Home
last modified time | relevance | path

Searched refs:Trie (Results 76 – 100 of 2796) sorted by relevance

12345678910>>...112

/dports/devel/lazygit/lazygit-0.31.4/vendor/gopkg.in/ozeidan/fuzzy-patricia.v3/fuzzy-patricia-3.0.0/patricia/
H A Dpatricia.go43 type Trie struct { struct
54 func NewTrie() *Trie {
55 trie := &Trie{}
70 func (trie *Trie) Clone() *Trie { argument
71 return &Trie{
181 node *Trie
466 var parent *Trie
640 child *Trie
686 child = new(Trie)
726 func (trie *Trie) compact() *Trie { argument
[all …]
/dports/games/tanglet/tanglet-1.6.0/src/
H A Dtrie.h19 class Trie
76 explicit Trie();
82 explicit Trie(const QString& word);
88 explicit Trie(const QByteArray& data);
127 friend QDataStream& operator<<(QDataStream& stream, const Trie& trie);
128 friend QDataStream& operator>>(QDataStream& stream, Trie& trie);
147 QDataStream& operator<<(QDataStream& stream, const Trie& trie);
155 QDataStream& operator>>(QDataStream& stream, Trie& trie);
163 QDataStream& operator<<(QDataStream& stream, const Trie::Node& node);
171 QDataStream& operator>>(QDataStream& stream, Trie::Node& node);
/dports/lang/yap/yap-6.2.2/library/
H A Dtries.yap56 trie_empty(Trie) :-
57 trie_usage(Trie, 0, 0, _).
59 trie_dup(Trie, CopyTrie) :-
61 trie_join(CopyTrie, Trie).
63 trie_traverse(Trie, Ref) :-
64 trie_traverse(Trie, 0, Ref).
66 trie_to_depth_breadth_trie(Trie, DepthBreadthTrie, FinalLabel, OptimizationLevel) :-
68 trie_dup(Trie, CopyTrie),
73 trie_to_depth_breadth_trie(Trie, DepthBreadthTrie, FinalLabel, OptimizationLevel, StartCounter, End…
74 …trie_depth_breadth(Trie, DepthBreadthTrie, FinalLabel, OptimizationLevel, StartCounter, EndCounter…
/dports/dns/dnsjit/dnsjit-1.2.2/src/lib/
H A Dtrie.lua62 Trie = {}
92 }, { __index = Trie })
99 function Trie:_get_keylen(key, keylen)
121 function Trie:log()
129 function Trie:clear()
134 function Trie:weight()
139 function Trie:get_try(key, keylen)
148 function Trie:get_ins(key, keylen)
156 function Trie:get_first()
167 function Trie:iter()
[all …]
/dports/textproc/jade/jade-1.2.1/lib/
H A DTrieBuilder.h42 Trie *extractTrie() { return root_.extract(); } in extractTrie()
46 void doB(Trie *trie,
55 Trie *extendTrie(Trie *, const String<EquivCode> &);
56 void setToken(Trie *trie, int tokenLength, Token token, Priority::Type pri,
59 Trie *forceNext(Trie *trie, EquivCode);
60 void copyInto(Trie *, const Trie *, int);
63 Owner<Trie> root_;
/dports/textproc/opensp/OpenSP-1.5.2/lib/
H A DTrieBuilder.h42 Trie *extractTrie() { return root_.extract(); } in extractTrie()
46 void doB(Trie *trie,
55 Trie *extendTrie(Trie *, const String<EquivCode> &);
56 void setToken(Trie *trie, int tokenLength, Token token, Priority::Type pri,
59 Trie *forceNext(Trie *trie, EquivCode);
60 void copyInto(Trie *, const Trie *, int);
63 Owner<Trie> root_;
/dports/databases/mariadb104-server/mariadb-10.4.24/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp204 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_open_trie_if_needed()
206 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_open_trie_if_needed()
250 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_rebuild_trie()
489 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_add()
507 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_add()
597 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete_by_id()
639 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete()
736 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_scan()
856 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_lcp_search()
898 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_cursor_open()
[all …]
/dports/databases/mariadb104-client/mariadb-10.4.24/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp204 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_open_trie_if_needed()
206 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_open_trie_if_needed()
250 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_rebuild_trie()
489 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_add()
507 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_add()
597 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete_by_id()
639 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete()
736 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_scan()
856 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_lcp_search()
898 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_cursor_open()
[all …]
/dports/databases/mariadb103-client/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp204 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie);
206 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie;
250 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie;
489 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie;
507 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie);
597 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie);
639 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie);
736 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie);
856 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie);
898 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie);
[all …]
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp204 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_open_trie_if_needed()
206 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_open_trie_if_needed()
250 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_rebuild_trie()
489 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_add()
507 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_add()
597 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete_by_id()
639 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete()
736 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_scan()
856 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_lcp_search()
898 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_cursor_open()
[all …]
/dports/databases/mariadb103-server/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp204 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_open_trie_if_needed()
206 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_open_trie_if_needed()
250 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_rebuild_trie()
489 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_add()
507 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_add()
597 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete_by_id()
639 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete()
736 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_scan()
856 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_lcp_search()
898 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_cursor_open()
[all …]
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/mroonga/vendor/groonga/lib/
H A Ddat.cpp204 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_open_trie_if_needed()
206 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_open_trie_if_needed()
250 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_rebuild_trie()
489 grn::dat::Trie * const new_trie = new (std::nothrow) grn::dat::Trie; in grn_dat_add()
507 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_add()
597 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete_by_id()
639 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_delete()
736 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_scan()
856 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_lcp_search()
898 grn::dat::Trie * const trie = static_cast<grn::dat::Trie *>(dat->trie); in grn_dat_cursor_open()
[all …]
/dports/databases/postgis31/postgis-3.1.4/extensions/address_standardizer/
H A Dgamma.c114 NODE **Trie ; in rules_init() local
162 rules -> Trie = NULL; in rules_init()
174 rules -> Trie = Trie ; in rules_init()
190 NODE **Trie ; in rules_add_rule() local
207 Trie = rules -> Trie ; in rules_add_rule()
264 u = Trie[ u ][ *r ] ; in rules_add_rule()
350 rules -> Trie = NULL ; in rules_ready()
403 NODE **Trie ; in create_rules() local
518 u = Trie[ u ][ *r ] ; in create_rules()
761 x = Trie[ EPSILON ][ a ] ; in precompute_gamma_function()
[all …]
/dports/databases/postgis32/postgis-3.2.0/extensions/address_standardizer/
H A Dgamma.c114 NODE **Trie ; in rules_init() local
162 rules -> Trie = NULL; in rules_init()
174 rules -> Trie = Trie ; in rules_init()
190 NODE **Trie ; in rules_add_rule() local
207 Trie = rules -> Trie ; in rules_add_rule()
264 u = Trie[ u ][ *r ] ; in rules_add_rule()
350 rules -> Trie = NULL ; in rules_ready()
403 NODE **Trie ; in create_rules() local
518 u = Trie[ u ][ *r ] ; in create_rules()
761 x = Trie[ EPSILON ][ a ] ; in precompute_gamma_function()
[all …]
/dports/databases/postgis30/postgis-3.0.4/extensions/address_standardizer/
H A Dgamma.c114 NODE **Trie ; in rules_init() local
162 rules -> Trie = NULL; in rules_init()
174 rules -> Trie = Trie ; in rules_init()
190 NODE **Trie ; in rules_add_rule() local
207 Trie = rules -> Trie ; in rules_add_rule()
264 u = Trie[ u ][ *r ] ; in rules_add_rule()
350 rules -> Trie = NULL ; in rules_ready()
403 NODE **Trie ; in create_rules() local
518 u = Trie[ u ][ *r ] ; in create_rules()
761 x = Trie[ EPSILON ][ a ] ; in precompute_gamma_function()
[all …]
/dports/databases/postgis25/postgis-2.5.5/extensions/address_standardizer/
H A Dgamma.c114 NODE **Trie ; in rules_init() local
162 rules -> Trie = NULL; in rules_init()
174 rules -> Trie = Trie ; in rules_init()
190 NODE **Trie ; in rules_add_rule() local
207 Trie = rules -> Trie ; in rules_add_rule()
264 u = Trie[ u ][ *r ] ; in rules_add_rule()
350 rules -> Trie = NULL ; in rules_ready()
403 NODE **Trie ; in create_rules() local
518 u = Trie[ u ][ *r ] ; in create_rules()
761 x = Trie[ EPSILON ][ a ] ; in precompute_gamma_function()
[all …]
/dports/www/trafficserver/trafficserver-9.1.1/include/tscore/
H A DTrie.h35 template <typename T> class Trie
38 Trie() { m_root.Clear(); } in Trie() function
54 virtual ~Trie() { Clear(); } in ~Trie()
103 Trie(const Trie<T> &rhs){}; in Trie() function
104 Trie &
105 operator=(const Trie<T> &rhs)
113 Trie<T>::_CheckArgs(const char *key, int &key_len) const in _CheckArgs()
205 Trie<T>::_Clear(Node *node) in _Clear()
220 Trie<T>::Clear() in Clear()
233 Trie<T>::Print() const in Print()
[all …]
/dports/lang/swi-pl/swipl-8.2.3/library/dialect/xsb/
H A Dintern.pl36 [ trie_create/2, % -Trie, +Options
37 trie_insert/2, % +Trie, +Term
38 trie_unify/2 % +Trie, -Term
41 trie_create(Trie, _Options) :-
42 trie_new(Trie).
44 trie_insert(Trie, Term) :-
45 trie_insert(Trie, Term, true).
47 trie_unify(Trie, Term) :-
48 trie_gen(Trie, Term, _).
/dports/textproc/redisearch20/RediSearch-2.0.15/src/trie/
H A Dtrie_type.h21 } Trie; typedef
33 Trie *NewTrie();
34 int Trie_Insert(Trie *t, RedisModuleString *s, double score, int incr, RSPayload *payload);
35 int Trie_InsertStringBuffer(Trie *t, const char *s, size_t len, double score, int incr,
38 int Trie_Delete(Trie *t, const char *s, size_t len);
41 Vector *Trie_Search(Trie *tree, const char *s, size_t len, size_t num, int maxDist, int prefixMode,
47 TrieIterator *Trie_Iterate(Trie *t, const char *prefix, size_t len, int maxDist, int prefixMode);
51 int Trie_RandomKey(Trie *t, char **str, t_len *len, double *score);
55 void TrieType_GenericSave(RedisModuleIO *rdb, Trie *t, int savePayloads);
/dports/textproc/redisearch16/RediSearch-1.6.16/src/trie/
H A Dtrie_type.h21 } Trie; typedef
33 Trie *NewTrie();
34 int Trie_Insert(Trie *t, RedisModuleString *s, double score, int incr, RSPayload *payload);
35 int Trie_InsertStringBuffer(Trie *t, const char *s, size_t len, double score, int incr,
38 int Trie_Delete(Trie *t, const char *s, size_t len);
41 Vector *Trie_Search(Trie *tree, const char *s, size_t len, size_t num, int maxDist, int prefixMode,
47 TrieIterator *Trie_Iterate(Trie *t, const char *prefix, size_t len, int maxDist, int prefixMode);
51 int Trie_RandomKey(Trie *t, char **str, t_len *len, double *score);
55 void TrieType_GenericSave(RedisModuleIO *rdb, Trie *t, int savePayloads);
/dports/textproc/redisearch/RediSearch-2.2.5/src/trie/
H A Dtrie_type.h21 } Trie; typedef
33 Trie *NewTrie();
34 int Trie_Insert(Trie *t, RedisModuleString *s, double score, int incr, RSPayload *payload);
35 int Trie_InsertStringBuffer(Trie *t, const char *s, size_t len, double score, int incr,
38 int Trie_Delete(Trie *t, const char *s, size_t len);
41 Vector *Trie_Search(Trie *tree, const char *s, size_t len, size_t num, int maxDist, int prefixMode,
47 TrieIterator *Trie_Iterate(Trie *t, const char *prefix, size_t len, int maxDist, int prefixMode);
51 int Trie_RandomKey(Trie *t, char **str, t_len *len, double *score);
55 void TrieType_GenericSave(RedisModuleIO *rdb, Trie *t, int savePayloads);
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/cpp/src/arrow/util/
H A Dtrie_test.cc159 TEST(Trie, Empty) { in TEST() argument
168 TEST(Trie, EmptyString) { in TEST() argument
178 TEST(Trie, LongString) { in TEST() argument
200 TEST(Trie, Basics1) { in TEST() argument
205 TEST(Trie, Basics2) { in TEST() argument
210 TEST(Trie, Basics3) { in TEST() argument
215 TEST(Trie, LongStrings) { in TEST() argument
220 TEST(Trie, NullChars) { in TEST() argument
241 TEST(Trie, NegativeChars) { in TEST() argument
248 TEST(Trie, Duplicates) { in TEST() argument
[all …]
/dports/databases/arrow/apache-arrow-6.0.1/cpp/src/arrow/util/
H A Dtrie_test.cc159 TEST(Trie, Empty) { in TEST() argument
168 TEST(Trie, EmptyString) { in TEST() argument
178 TEST(Trie, LongString) { in TEST() argument
200 TEST(Trie, Basics1) { in TEST() argument
205 TEST(Trie, Basics2) { in TEST() argument
210 TEST(Trie, Basics3) { in TEST() argument
215 TEST(Trie, LongStrings) { in TEST() argument
220 TEST(Trie, NullChars) { in TEST() argument
241 TEST(Trie, NegativeChars) { in TEST() argument
248 TEST(Trie, Duplicates) { in TEST() argument
[all …]
/dports/textproc/py-pyahocorasick/pyahocorasick-1.4.1/py/
H A Dunittests.py14 t = Trie()
19 t = Trie()
26 t = Trie()
36 t = Trie()
42 t = Trie()
47 t = Trie()
56 t = Trie()
63 t = Trie()
80 t = Trie()
98 t = Trie()
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/cpp/src/arrow/util/
H A Dtrie.h117 class ARROW_EXPORT Trie {
122 Trie() : size_(0) {} in Trie() function
123 Trie(Trie&&) = default;
124 Trie& operator=(Trie&&) = default;
200 ARROW_DISALLOW_COPY_AND_ASSIGN(Trie);
217 using index_type = Trie::index_type;
218 using fast_index_type = Trie::fast_index_type;
223 Trie Finish();
231 Status AppendChildNode(Trie::Node* parent, uint8_t ch, Trie::Node&& node);
234 Status CreateChildNode(Trie::Node* parent, char ch, util::string_view substring);
[all …]

12345678910>>...112