Home
last modified time | relevance | path

Searched refs:trie (Results 26 – 50 of 5742) sorted by relevance

12345678910>>...230

/dports/devel/libdatrie/libdatrie-0.2.13/datrie/
H A Dtrie.c118 Trie *trie; in trie_new() local
137 return trie; in trie_new()
144 free (trie); in trie_new()
163 Trie *trie; in trie_new_from_file() local
172 return trie; in trie_new_from_file()
193 Trie *trie; in trie_fread() local
207 return trie; in trie_fread()
214 free (trie); in trie_fread()
231 free (trie); in trie_free()
699 return trie_state_new (trie, da_get_root (trie->da), 0, FALSE); in trie_root()
[all …]
/dports/mail/dovecot/dovecot-2.3.17/src/plugins/fts-squat/
H A Dsquat-trie.c172 node_free(trie, &trie->root); in squat_trie_close()
220 trie->fd = open(trie->path, O_RDWR); in squat_trie_open_fd()
1083 ctx->trie = trie; in squat_trie_iterate_init()
1447 ret = pread_full(trie->fd, &trie->hdr, sizeof(trie->hdr), 0); in squat_trie_map_header()
1478 memcpy(&trie->hdr, trie->mmap_base, sizeof(trie->hdr)); in squat_trie_map_header()
1479 trie->data = trie->mmap_base; in squat_trie_map_header()
1498 trie->file_cache = file_cache_new_path(trie->fd, trie->path); in squat_trie_map()
1514 node_free(trie, &trie->root); in squat_trie_map()
1577 trie->fd = squat_trie_create_fd(trie, trie->path, 0); in squat_trie_build_init()
1596 ctx->trie = trie; in squat_trie_build_init()
[all …]
/dports/devel/icu/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/devel/icu-lx/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/intl/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/textproc/R-cran-stringi/stringi/src/icu69/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/intl/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/www/firefox/firefox-99.0/intl/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/lang/v8/v8-9.6.180.12/third_party/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/www/firefox-legacy/firefox-52.8.0esr/intl/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in differentiate()
112 return trie; in differentiate()
149 return trie;
294 if( trie==NULL || trie->isCompacted ||
430 if(trie->leadUnitValue==trie->data[0]) {
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0;
668 trie->data[newStart++]=trie->data[start++];
674 trie->data[newStart++]=trie->data[start++];
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT];
912 trie->initialValue=trie->data32[0];
[all …]
H A Dutrie2_builder.cpp110 UTrie2 *trie; in utrie2_open() local
232 return trie; in utrie2_open()
274 return trie; in cloneBuilder()
314 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
561 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
621 if(trie==NULL || trie->isCompacted) { in set32()
1073 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1075 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1079 trie->data[newStart++]=trie->initialValue; in compactData()
1149 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/intl/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
H A Dutrie2_builder.cpp110 UTrie2 *trie; in utrie2_open() local
232 return trie; in utrie2_open()
274 return trie; in cloneBuilder()
314 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
561 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
621 if(trie==NULL || trie->isCompacted) { in set32()
1073 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1075 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1079 trie->data[newStart++]=trie->initialValue; in compactData()
1149 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/intl/icu/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/textproc/R-cran-stringi/stringi/src/icu55/common/
H A Dutrie.cpp51 UNewTrie *trie; in utrie_open() local
110 return trie; in utrie_open()
147 return trie; in utrie_clone()
292 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
428 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
552 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
666 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
672 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
683 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
910 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
H A Dutrie2_builder.cpp108 UTrie2 *trie; in utrie2_open() local
230 return trie; in utrie2_open()
272 return trie; in cloneBuilder()
312 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
559 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
619 if(trie==NULL || trie->isCompacted) { in set32()
1071 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1073 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1077 trie->data[newStart++]=trie->initialValue; in compactData()
1147 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/www/node10/node-v10.24.1/deps/icu-small/source/common/
H A Dutrie.cpp53 UNewTrie *trie; in utrie_open() local
112 return trie; in utrie_open()
149 return trie; in utrie_clone()
294 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
430 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
554 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
668 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
674 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
685 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
912 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/icu4c-57.1/source/common/
H A Dutrie.cpp51 UNewTrie *trie; in utrie_open() local
110 return trie; in utrie_open()
147 return trie; in utrie_clone()
292 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
428 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
552 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
666 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
672 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
683 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
910 trie->initialValue=trie->data32[0]; in utrie_unserialize()
[all …]
H A Dutrie2_builder.cpp108 UTrie2 *trie; in utrie2_open() local
230 return trie; in utrie2_open()
272 return trie; in cloneBuilder()
312 if(trie->memory==NULL && trie->newTrie==NULL) { in utrie2_clone()
559 trie->map[block>>UTRIE2_SHIFT_2]=-trie->firstFreeBlock; in releaseDataBlock()
619 if(trie==NULL || trie->isCompacted) { in set32()
1071 trie->index2[i]=trie->map[trie->index2[i]>>UTRIE2_SHIFT_2]; in compactData()
1073 trie->dataNullOffset=trie->map[trie->dataNullOffset>>UTRIE2_SHIFT_2]; in compactData()
1077 trie->data[newStart++]=trie->initialValue; in compactData()
1147 trie->index1[i]=trie->map[trie->index1[i]>>UTRIE2_SHIFT_1_2]; in compactIndex2()
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/docker/docker/vendor/github.com/tchap/go-patricia/patricia/
H A Dpatricia.go51 trie := &Trie{}
54 opt(trie)
65 return trie
189 node := trie
353 return trie.item == nil && trie.children.length() == 0
358 trie.children = newSparseChildList(trie.maxPrefixPerNode)
448 return trie
457 return trie
462 return trie
476 root = trie
[all …]
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/github.com/containerd/containerd/containerd-1.4.3/vendor/github.com/tchap/go-patricia/patricia/
H A Dpatricia.go51 trie := &Trie{}
54 opt(trie)
65 return trie
189 node := trie
353 return trie.item == nil && trie.children.length() == 0
358 trie.children = newSparseChildList(trie.maxPrefixPerNode)
448 return trie
457 return trie
462 return trie
476 root = trie
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/containerd/containerd/vendor/github.com/tchap/go-patricia/patricia/
H A Dpatricia.go51 trie := &Trie{}
54 opt(trie)
65 return trie
189 node := trie
353 return trie.item == nil && trie.children.length() == 0
358 trie.children = newSparseChildList(trie.maxPrefixPerNode)
448 return trie
457 return trie
462 return trie
476 root = trie
[all …]
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/containerd/containerd/vendor/github.com/tchap/go-patricia/patricia/
H A Dpatricia.go51 trie := &Trie{}
54 opt(trie)
65 return trie
189 node := trie
353 return trie.item == nil && trie.children.length() == 0
358 trie.children = newSparseChildList(trie.maxPrefixPerNode)
448 return trie
457 return trie
462 return trie
476 root = trie
[all …]

12345678910>>...230