Searched refs:lcp (Results 1 - 8 of 8) sorted by relevance
| /third_party/skia/third_party/externals/brotli/research/ |
| H A D | find_opt_references.cc | 54 void BuildLCP(input_type* storage, sarray_type* sarray, lcp_type* lcp, in BuildLCP() argument
60 lcp[size - 1] = 0; in BuildLCP()
70 lcp[pos[i]] = k; in BuildLCP()
75 inline void PrintReference(sarray_type* sarray, lcp_type* lcp, size_t size, in PrintReference() argument
91 inline void GoLeft(sarray_type* sarray, lcp_type* lcp, int idx, int left_ix, in GoLeft() argument
96 if (lcp[left_ix] < left_lcp) break; in GoLeft()
103 inline void GoRight(sarray_type* sarray, lcp_type* lcp, int idx, size_t size, in GoRight() argument
108 if (lcp[right_ix] < right_lcp) break; in GoRight()
115 inline void StoreReference(sarray_type* sarray, lcp_type* lcp, size_t size, in StoreReference() argument
120 GoLeft(sarray, lcp, id in StoreReference()
130 ProcessReferences(sarray_type* sarray, lcp_type* lcp, size_t size, uint32_t* pos, const Fn& process_output) ProcessReferences() argument
224 lcp_type* lcp = new lcp_type[input_size]; main() local
[all...] |
| H A D | deorummolae.cc | 94 std::vector<TextIdx>* lcp, std::vector<TextIdx>* invese_sa) { in buildLcp()
96 lcp->resize(size); in buildLcp()
98 lcp->at(size - 1) = 0; in buildLcp()
109 lcp->at(invese_sa->at(i)) = k; in buildLcp()
118 TextIdx lcp; member
148 TextIdx length, std::vector<TextIdx>* sa, std::vector<TextIdx>* lcp, in cutMatch()
153 while (lcp->at(i) >= length) { in cutMatch()
161 if (index == 0 || lcp->at(index - 1) < length) break; in cutMatch()
216 std::vector<TextIdx> lcp; in DM_generate() local
236 buildLcp(&full_text, &sa, &lcp, in DM_generate()
93 buildLcp(std::vector<TextChar>* text, std::vector<TextIdx>* sa, std::vector<TextIdx>* lcp, std::vector<TextIdx>* invese_sa) buildLcp() argument
147 cutMatch(std::vector<std::vector<TextChar>>* data, TextIdx index, TextIdx length, std::vector<TextIdx>* sa, std::vector<TextIdx>* lcp, std::vector<TextIdx>* invese_sa, TextChar* next_terminator, std::vector<TextIdx>* file_map, std::vector<TextIdx>* file_offset) cutMatch() argument
[all...] |
| H A D | durchschlag.cc | 340 const TextIdx* lcp = index.lcp.data(); in durchschlag_prepare() local
363 if (lcp[current - 1] < sliceLen) { in durchschlag_prepare()
405 std::vector<TextIdx> lcp(total); in durchschlag_index()
407 lcp[total - 1] = 0; in durchschlag_index()
418 lcp[current] = k; in durchschlag_index()
422 return {std::move(lcp), std::move(sa)}; in durchschlag_index()
|
| H A D | durchschlag.h | 58 std::vector<DurchschlagTextIdx> lcp; member
|
| /third_party/lwip/src/netif/ppp/ |
| H A D | utils.c | 64 #include "netif/ppp/lcp.h"
719 unsigned char *lcp = p + 2; in ppp_dump_packet() local
720 int l = (lcp[2] << 8) + lcp[3]; in ppp_dump_packet()
722 if ((lcp[0] == ECHOREQ || lcp[0] == ECHOREP) in ppp_dump_packet()
|
| /third_party/rust/crates/regex/src/literal/ |
| H A D | imp.rs | 15 lcp: Memmem,
61 lcp: Memmem::new(lits.longest_common_prefix()), in new()
132 pub fn lcp(&self) -> &Memmem { in lcp() functions
133 &self.lcp in lcp()
|
| /third_party/lwip/src/ |
| H A D | Filelists.mk | 111 $(LWIPDIR)/netif/ppp/lcp.c \
|
| /third_party/rust/crates/regex/src/ |
| H A D | exec.rs | 1450 lcs_len >= 3 && lcs_len > self.dfa.prefixes.lcp().char_len() in should_suffix_scan()
|
Completed in 6 milliseconds