搜索资源列表
ver4_patricia_trie_node_writer
- bool Ver4 Patricia Trie Node Writer::mark Pt Node As Will Become Non Terminal.
bytestrie
- \file \brief C++ API: Trie for mapping byte sequences to integer values.
ustringtrie
- \file \brief C API: Helper definitions for dictionary trie APIs.Return values for BytesTrie::next(), UCharsTrie::next() and similar methods.
termcap
- TODO: take only dictDirPath, and open both header and trie files in the constructor below const bool isUpdatable = headerBuffer->isUpdatable.
utrie
- This a common implementation of a folded trie. -This is a common implementation of a folded trie.
zorro_ids
- The file format prepared and written here contains a 16-bit trie and a mapping table.
string_search
- 利用标准trie和bloom filter算法进行海量email地址搜索，开发编译环境为linux c，在2000万个email地址中搜索1000个地址占用内存为47M。-use standard Trie and bloom filter algorithms to search massive email address, the compiler development environment is linux c, and it occupies 47M memories to sea
rsPath
- This performs data swapping for a folded trie (see utrie.c for details).
string_string
- Preflight the trie length.Copy the indexes for surrogate code points into the BMP range for simple access across the entire BMP. -Preflight the trie length.Copy the indexes for surrogate code points into the BMP range for simple access across the
war
- Trie access folding function. Copied as-is properties code in uchar.c Source Code for Linux v2.13.6. -Trie access folding function. Copied as-is properties code in uchar.c Source Code for Linux v2.13.6.
search-related
- ac自动机，kmp，字典树trie，使用的一些搜索相关的参考实现代码，-ac automatic machine reference implementation code
lsm-trie-release-master
- 一个KV存储系统,堆内存的需求量比较小，且降低了LevelDB的写放大问题。-A KV storage system, the demand for heap memory is relatively small, and reduces write amplification LevelDB problem.
Wordprocess
- 用字典树统计一个文件中单词的出现次数，将单词及其出现次数按照字典中的顺序保存在输出文件中。-Use Trie Tree to statistic the number of words appeared in a document, save the word and its number of occurrences to the output file in the order according to the dictionary.
Peersim-Pht-master
- Distributed Hash Tables are scalable, robust, and self-organizing peer-to-peer systems that support exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree - a distributed data structure that enables more s
dictionary106
- 本程序利用Trie树实现了英语单词辅助记忆系统，并完成了相关的建表，查表以及存档等操作。-This procedure using Trie tree realize the English words auxiliary memory system, and complete the relevant built form, as well as the archive, such as look-up table operation.
TrieKeyValueStore
- It implements a Trie data structure to store key/value pairs, also it has a trie for all valid commands. TrieRun class takes a file name (with complete path) as an input user and then it reads the file line by line and the commands. TestFile.txt
WebPage
- 网页分析提取文本信息，网页分词，利用Trie树实现算法-Web analytics extract text, page segmentation, use of Trie tree algorithm
64832694Trie
- trie树的代码，实现字典树的安装和查找-Trie tree code to achieve the installation and search dictionary tree
FilterTest (2)
- 高效的关键字过滤及查找算法（Trie KO Hash）FilterTest(Trie KO Hash FilterTest)
AC自动机
- AC自动机，Trie树的实现的具体的全部的源代码(ACAUTOMACHINE TRIE CODE)