Counting members of ConcurrentRadixTree?

[Tom Pierce]

What is the best approach to getting the count of keys and/or values in a RadixTree? I have been using:

 

Iterables.count(myTree.getValuesForClosestKeys(""))

Is this the best approach? 

[Niall]

Hi Tom,

That approach is fine.

For a radix tree, 

Iterables.count(myTree.getValuesForKeysStartingWith(""))

is also option for calculating number of keys/values stored, as all keys are considered to start with an empty string.

I'll consider adding a size() method in future which would make this more obvious/straightforward.

Note that calculating the size (number of keys/values) of the tree is an O(n) operation, so is quite expensive as it requires the whole tree to be traversed.

[Niall]

I've implemented tree.size() methods on the trees. You can track it in issue 8.