Number of elements in trie

[LucaCappelletti94]

Hi, I am not sure whether there is a method in the trie that returns the number of elements in the trie. Is there?

[shanecelis]

You could search for "" and count the iterator.

[LucaCappelletti94]

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

[shanecelis]

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?

[LucaCappelletti94]

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.

[shanecelis]

All right. Let's see it.

[LucaCappelletti94]

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

[shanecelis]

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