Implement Size

Author: tylertreat-wf

trie/ctrie/ctrie.go

@@ -350,6 +350,15 @@ func (c *Ctrie) Iterator() <-chan *Entry {
 	return ch
 }
 
+// Size returns the number of keys in the Ctrie.
+func (c *Ctrie) Size() uint {
+	size := uint(0)
+	for _ = range c.Iterator() {
+		size++
+	}
+	return size
+}
+
 func traverse(i *iNode, ch chan<- *Entry) {
 	switch {
 	case i.main.cNode != nil:

trie/ctrie/ctrie_test.go

@@ -283,6 +283,14 @@ func TestIterator(t *testing.T) {
 	assert.Equal(len(expected), count)
 }
 
+func TestSize(t *testing.T) {
+	ctrie := New(nil)
+	for i := 0; i < 10; i++ {
+		ctrie.Insert([]byte(strconv.Itoa(i)), i)
+	}
+	assert.Equal(t, uint(10), ctrie.Size())
+}
+
 func BenchmarkInsert(b *testing.B) {
 	ctrie := New(nil)
 	b.ResetTimer()