搜索资源列表
josephus
- 利用红黑树结构来实现的josephus排列，复杂度为o（nlogn）-Red-black tree structure used to achieve the josephus arrangement
rbt2
- 利用红黑树实现字符串的快速查找，在测试中发现要比哈希查找要快，在一百万个字符串查找每一个字符串，大概50us左右。-Using red and black tree to realize the rapid search string, in tests found than hash find fast, in one million a string search each string, about 50 around us.
SearchTree
- 用c++实现的红黑树代码，高效的搜索树，有添加查找各种功能-red-black tree code in C++
memcheck_malloc_map
- Contains implementation of routines that implement a red-black tree of memory blocks allocated by the guest system.
memcheck_mmrange_map
- Contains implementation of routines that implement a red-black tree of memory mappings in the guest system.
stl_tree
- Red-black tree class, designed for use in implementing STL associative containers (set, multiset, map, and multimap). -Red-black tree class, designed for use in implementing STL associative containers (set, multiset, map, and multimap).
tc_csum
- This turns a red-black tree into a [multi]set.
DirsWatcher
- linux多文件目录监控源码，采用红黑树来存储数据结构，方便随机方面及修改。-linux multiple files directory monitor source, using red-black tree data structure to store, easy to modify and stochastic aspects.
red_black_tree
- C语言实现的红黑树，实现了插入、删除、查找、rank-red black tree in c