搜索资源列表
src
- ackage bplustree import java.util.* import com.xuedi.IO.* import com.xuedi.maths.* ////// DisposeRoot ///////中的key参数有些问题 public class BTree {
Btree
- 二叉树实现。实现了插入、删除、查找、求深度、各种遍历、判断完全二叉树等算法。-Binary Tree. Implements insert, delete, search, seeking depth, variety traversal algorithms to determine a complete binary tree.
btree
- 一个简单的二叉树，包含二叉树的先序后序中序遍历，交换左右子树。-A simple two binary tree traversal, contains two binary tree preorder postorder, exchange of left and right subtree.
BTREE
- Implementation of heap tr-Implementation of heap tree
bset
- Code for working with individual keys, and sorted sets of keys with in a btree node.
btreesearch
- 实现单向链表和文件操作，包括链表二叉查找、插入、删除，文件读写等，简单明了。-single list operation btree search and file operation
bcache
- Btree keys - all units are in sectors.
xfs_discard
- Look up the longest btree in the AGF and start with it.
btree
- B 叉树的实例，仅供参考，好吧。。。祝好-what you want
xfs_bmap
- Compute and fill in the value of the maximum depth of a bmap btree in this filesystem. Done once, during mount.
dm-btree
- makes the assumption that no two keys are the same.
Mylex
- lib btree.c - Simple In-memory B+Tree.
xfs_btree
- Btree magic numbers for Linux v2.13.6.
tauros2
- Removing an entry a btree. -Removing an entry a btree.
xfs_da_format
- This structure is common to both leaf nodes and non-leaf nodes in the Btree.
btree
- 使用visual studio 2012在C++环境中实现B树的插入，删除等功能-Use visual studio 2012 to achieve B tree in C++ environment to insert, delete, etc.
B-Tree
- B树实现啊 数据结构还有基本操作-something about BTree
Rtree
- R树索引，可以为高维数据建立类似Btree的索引，大大加快查找速度-R-tree indexes, you can create similar Btree indexes for high-dimensional data, greatly accelerate the search speed
BTree
- B-Tree of order 4 Each node has at most 4 pointers and 3 keys, and at least 2 pointers and 1 key. Insert: 5, 3, 21, 9, 1, 13, 2, 7, 10, 12, 4, 8 Delete: 2, 21, 10, 3, 4
writeback
- background writeback - scan btree for dirty data and write it to the backing device.