WARNING: The online documentation has moved to https://docs.pjsip.org.
Visit the new documentation at https://docs.pjsip.org:
Detailed DescriptionDeclaration of a red-black tree. All elements in the tree must have UNIQUE key. A red black tree always maintains the balance of the tree, so that the tree height will not be greater than lg(N). Insert, search, and delete operation will take lg(N) on the worst case. But for insert and delete, there is additional time needed to maintain the balance of the tree. Field DocumentationKey comparison function. Constant to indicate NULL node. Constant to indicate NULL node. Root tree node.
Number of elements in the tree. The documentation for this struct was generated from the following file:
Copyright (C) 2006-2009 Teluu Inc. |