Return black-node depth, loading violation details if invalid.
Declared in <bslalg_rbtreeutil.h>
template<class NODE_COMPARATOR>
static
int
validateRbTree(
RbTreeNode const** errorNode,
char const** errorDescription,
RbTreeNode const* rootNode,
NODE_COMPARATOR const& comparator);
Return the number of black nodes on each path from the specified rootNode to a leaf, and load violation details into the specified errorNode and errorDescription if the tree is invalid.
black-node depth, 0 if rootNode is 0, or a negative number if invalid
| Name | Description |
|---|---|
| errorNode | set to a node that violates a red-black constraint |
| errorDescription | set to a description of the violation |
| rootNode | root of the tree to validate, or 0 |
| comparator | functor used to order nodes in the tree |