Lines Matching refs:trees
6 What are red-black trees, and what are they for?
9 Red-black trees are a type of self-balancing binary search tree, used for
10 storing sortable key/value data pairs. This differs from radix trees (which
16 Red-black trees are similar to AVL trees, but provide faster real-time bounded
23 There are a number of red-black trees in use in the kernel.
29 trees, as are epoll file descriptors, cryptographic keys, and network
35 Linux Weekly News article on red-black trees
38 Wikipedia entry on red-black trees
41 Linux implementation of red-black trees
168 sorted order. These work on arbitrary trees, and should not need to be
248 More details about interval trees: