Return the total number of nodes in this tree, including internal nodes without values. Note that this method has O(n) complexity where n is the number of nodes, and is intended for use in testing to verify tree structure invariants. In user code use size() that tells the actual number of entries with values.

Synopsis

Declared in <ball_categorymanager_radixtree.h>

CategoryManager_RadixTree<t_VALUE>::size_type
countNodes() const;

Created with MrDocs