gb_trees

20012015 Ericsson AB. All Rights Reserved. The contents of this file are subject to the Erlang Public License, Version 1.1, (the "License"); you may not use this file except in compliance with the License. You should have received a copy of the Erlang Public License along with this software. If not, it can be retrieved online at http://www.erlang.org/. Software distributed under the License is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for the specific language governing rights and limitations under the License. gb_trees

gb_trees General Balanced Trees

An efficient implementation of Prof. Arne Andersson's General Balanced Trees. These have no storage overhead compared to unbalanced binary trees, and their performance is in general better than AVL trees.

This module considers two keys as different if and only if they do not compare equal (==).

Data structure

Data structure:


      
- {Size, Tree}, where `Tree' is composed of nodes of the form:
  - {Key, Value, Smaller, Bigger}, and the "empty tree" node:
  - nil.

There is no attempt to balance trees after deletions. Since deletions do not increase the height of a tree, this should be OK.

Original balance condition h(T) <= ceil(c * log(|T|)) has been changed to the similar (but not quite equivalent) condition 2 ^ h(T) <= |T| ^ c. This should also be OK.

Performance is comparable to the AVL trees in the Erlang book (and faster in general due to less overhead); the difference is that deletion works for these trees, but not for the book's trees. Behaviour is logarithmic (as it should be).

A GB tree.

tree() is equivalent to tree(term(), term()).

A GB tree iterator.

iter() is equivalent to iter(term(), term()).

Rebalance a tree

Rebalances Tree1. Note that this is rarely necessary, but may be motivated when a large number of nodes have been deleted from the tree without further insertions. Rebalancing could then be forced in order to minimise lookup times, since deletion only does not rebalance the tree.

Remove a node from a tree

Removes the node with key Key from Tree1; returns new tree. Assumes that the key is present in the tree, crashes otherwise.

Remove a (possibly non-existing) node from a tree

Removes the node with key Key from Tree1 if the key is present in the tree, otherwise does nothing; returns new tree.

Return an empty tree

Returns a new empty tree

Insert or update key with value in a tree

Inserts Key with value Value into Tree1 if the key is not present in the tree, otherwise updates Key to value Value in Tree1. Returns the new tree.

Make a tree from an orddict

Turns an ordered list List of key-value tuples into a tree. The list must not contain duplicate keys.

Look up a key in a tree, if present

Retrieves the value stored with Key in Tree. Assumes that the key is present in the tree, crashes otherwise.

Insert a new key and value in a tree

Inserts Key with value Value into Tree1; returns the new tree. Assumes that the key is not present in the tree, crashes otherwise.

Test for membership of a tree

Returns true if Key is present in Tree, otherwise false.

Test for empty tree

Returns true if Tree is an empty tree, and false otherwise.

Return an iterator for a tree

Returns an iterator that can be used for traversing the entries of Tree; see next/1. The implementation of this is very efficient; traversing the whole tree using next/1 is only slightly slower than getting the list of all elements using to_list/1 and traversing that. The main advantage of the iterator approach is that it does not require the complete list of all elements to be built in memory at one time.

Return an iterator for a tree starting from specified key

Returns an iterator that can be used for traversing the entries of Tree; see next/1. The difference as compared to the iterator returned by iterator/1 is that the first key greater than or equal to Key is returned.

Return a list of the keys in a tree

Returns the keys in Tree as an ordered list.

Return largest key and value

Returns {Key, Value}, where Key is the largest key in Tree, and Value is the value associated with this key. Assumes that the tree is nonempty.

Look up a key in a tree

Looks up Key in Tree; returns {value, Value}, or none if Key is not present.

Return largest key and value

Maps the function F(K, V1) -> V2 to all key-value pairs of the tree Tree1 and returns a new tree Tree2 with the same set of keys as Tree1 and the new set of values V2.

Traverse a tree with an iterator

Returns {Key, Value, Iter2} where Key is the smallest key referred to by the iterator Iter1, and Iter2 is the new iterator to be used for traversing the remaining nodes, or the atom none if no nodes remain.

Return the number of nodes in a tree

Returns the number of nodes in Tree.

Return smallest key and value

Returns {Key, Value}, where Key is the smallest key in Tree, and Value is the value associated with this key. Assumes that the tree is nonempty.

Extract largest key and value

Returns {Key, Value, Tree2}, where Key is the largest key in Tree1, Value is the value associated with this key, and Tree2 is this tree with the corresponding node deleted. Assumes that the tree is nonempty.

Extract smallest key and value

Returns {Key, Value, Tree2}, where Key is the smallest key in Tree1, Value is the value associated with this key, and Tree2 is this tree with the corresponding node deleted. Assumes that the tree is nonempty.

Convert a tree into a list

Converts a tree into an ordered list of key-value tuples.

Update a key to new value in a tree

Updates Key to value Value in Tree1; returns the new tree. Assumes that the key is present in the tree.

Return a list of the values in a tree

Returns the values in Tree as an ordered list, sorted by their corresponding keys. Duplicates are not removed.