Number of elements in trie about trie-rs HOT 7 OPEN

Maybe it would be best to add a counter in the Map struct? Like in a Vec.

from trie-rs.

You could search for "" and count the iterator.

from trie-rs.

I don't see the use case where knowing the size in O(1) time is worth it. You generally don't want to reify it, so it's not like you need to know to preallocate. Most searches will always be a different size but it would represent an upper bound. Is there a use case you had in mind?

from trie-rs.

Generally speaking, I would expect the length of a set to be an O(1) complexity thing, especially since it only requires an usize. As a tradeoff time vs memory, it would seem worth it to me.

from trie-rs.

All right. Let's see it.

from trie-rs.

I will make a small pull request adding it after we finish merging #28

from trie-rs.

I've gone from hesitant to, "Yes, this is all good and makes sense."

from trie-rs.