Location:
Search - binary trie
Search list
Description: 写这个的出发点是吧之前做的trie能写到文件而且能很容易mmap到内存, 可以用于输入法 搜索引擎分词 词表的功能, 共享前缀存储, 支持最大２０亿节点.
简单一点可以当一个hash表使用, 查找的时间复杂度为 N* Log(256) N为字符长度, key可以为二进制的数据, value 必须为int类型, 不能为０, 因为mmtrie_get()/find() 没有结果的情况下为０,
如果需要set value为０的话自己+１, 出来的时候-１就好了.-Write the starting point is to do the trie before it can write files and can very easily mmap to memory, can be used to enter France search engine sub-word vocabulary, shared storage prefix supports up to two billion nodes. A simple thing can be when a Use hash table to find the time complexity is N* Log (256) N for the characters in length, key data for binary, value must be int type, can not be 0, because mmtrie_get ()/find () does not result in the situation is 0, if set value to 0 if its+1, out of time-1 enough.
Platform: |
Size: 5120 |
Author: 王涛 |
Hits:
Description: The cprops (C prototyping tools) library provides
a portable, thread-safe C API including linked list, binary heap, priority queue, hash table, hash list, trie, AVL, Red-Black, and splay tree implementations, a thread pool and thread management framework, a TCP and HTTP socket API, and a database abstraction layer with drivers for Postgres and MySQL. libcprops compiles and runs on Linux, BSD, Solaris, Mac OS X, and Win32.-The cprops (C prototyping tools) library provides a portable, thread-safe C API including linked list, binary heap, priority queue, hash table, hash list, trie, AVL, Red-Black, and splay tree implementations, a thread pool and thread management framework, a TCP and HTTP socket API, and a database abstraction layer with drivers for Postgres and MySQL. libcprops compiles and runs on Linux, BSD, Solaris, Mac OS X, and Win32.
Platform: |
Size: 797696 |
Author: evil |
Hits:
Description: 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo.
1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。
已实现 ( Implemented ):
Array shuffle
Prime test(trial division)
Prime test(Miller-Rabin s method)
2D Array
Arbitary Integer
Linear congruential generator
Maximum subarray problem
Bit-Set
Queue
Stack
Binary Heap
Fibonacci Heap
Priority Queue (list based)
Bubble sort
Selection sort
Insertion sort
Radix sort
Quick sort
Merge sort
Heap sort
Double linked list
Skip list
Self-organized linked-list ops (move-to-front, move-ahead-one)
Largest common sequence
Binary search tree
Dynamic order statistics
Red-black tree
Interval tree
Prefix Tree(Trie)
Suffix Tree
B-Tree
Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)
Platform: |
Size: 1636352 |
Author: 汪小君 |
Hits: