add some test code and examples

Author: vcaesar

cedar_bm_test.go

@@ -1 +1,61 @@
 package cedar
+
+import (
+	"testing"
+
+	"github.com/vcaesar/tt"
+)
+
+func init() {
+	InitCd()
+}
+
+func BenchmarkInsert(t *testing.B) {
+	fn := func() {
+		cd.Insert([]byte("a"), 1)
+		cd.Insert([]byte("b"), 3)
+		cd.Insert([]byte("d"), 6)
+	}
+
+	tt.BM(t, fn)
+}
+
+func BenchmarkJump(t *testing.B) {
+	fn := func() {
+		cd.Jump([]byte("a"), 1)
+	}
+
+	tt.BM(t, fn)
+}
+
+func BenchmarkFind(t *testing.B) {
+	fn := func() {
+		cd.Find([]byte("a"), 1)
+	}
+
+	tt.BM(t, fn)
+}
+
+func BenchmarkValue(t *testing.B) {
+	fn := func() {
+		cd.Value(1)
+	}
+
+	tt.BM(t, fn)
+}
+
+func BenchmarkUpdate(t *testing.B) {
+	fn := func() {
+		cd.Update([]byte("a"), 1)
+	}
+
+	tt.BM(t, fn)
+}
+
+func BenchmarkDelete(t *testing.B) {
+	fn := func() {
+		cd.Delete([]byte("b"))
+	}
+
+	tt.BM(t, fn)
+}

cedar_test.go

@@ -1 +1,50 @@
 package cedar
+
+import (
+	"testing"
+
+	"github.com/vcaesar/tt"
+)
+
+var (
+	cd *Cedar
+
+	words = []string{
+		"a", "aa", "ab", "abc", "abcd", "abcdef",
+		"太阳系", "太阳系水星", "太阳系金星", "太阳系地球", "太阳系火星",
+		"太阳系木星", "太阳系土星", "太阳系天王星", "太阳系海王星",
+	}
+)
+
+func InitCd(reduced ...bool) error {
+	cd = New(reduced...)
+	return nil
+}
+
+func TestLoadData(t *testing.T) {
+	if cd == nil {
+		cd = New()
+	}
+
+	// insert the keys
+	for i, word := range words {
+		err := cd.Insert([]byte(word), i)
+		tt.Nil(t, err)
+	}
+
+	for _, word := range words {
+		err := cd.Delete([]byte(word))
+		tt.Nil(t, err)
+	}
+
+	for i, word := range words {
+		err := cd.Update([]byte(word), i)
+		tt.Nil(t, err)
+	}
+
+	// delete the keys
+	for i := 0; i < len(words); i += 3 {
+		err := cd.Delete([]byte(words[i]))
+		tt.Nil(t, err)
+	}
+}

examples/main.go

@@ -0,0 +1,18 @@
+package main
+
+import (
+	"fmt"
+
+	"github.com/vcaesar/cedar"
+)
+
+func main() {
+	// Create a new cedar trie.
+	d := cedar.New()
+	d.Insert([]byte("ab"), 1)
+	d.Insert([]byte("abc"), 2)
+	d.Insert([]byte("abcd"), 3)
+
+	fmt.Println(d.Jump([]byte("ab"), 0))
+	fmt.Println(d.Jump([]byte("bc"), 0))
+}

fn.go

@@ -32,10 +32,10 @@ func (cd *Cedar) get(key []byte, from, pos int) *int {
 	return &cd.array[to].baseV
 }
 
-// GetVal get follow node by key, split by update()
-func (cd *Cedar) getNode(key []byte, from, pos int, redched ...bool) int {
+// getNode get follow node by key, split by update()
+func (cd *Cedar) getNode(key []byte, from, pos int, reduced ...bool) int {
 	for ; pos < len(key); pos++ {
-		if isReduced(redched...) {
+		if isReduced(reduced...) {
 			value := cd.array[from].baseV
 			if value >= 0 && value != ValLimit {
 				to := cd.follow(from, 0)
@@ -47,7 +47,7 @@ func (cd *Cedar) getNode(key []byte, from, pos int, redched ...bool) int {
 	}
 
 	to := from
-	if cd.array[from].baseV < 0 || !isReduced(redched...) {
+	if cd.array[from].baseV < 0 || !isReduced(reduced...) {
 		to = cd.follow(from, 0)
 	}
 
@@ -122,10 +122,10 @@ func (cd *Cedar) Insert(key []byte, val int) error {
 }
 
 // Update the key for the value, it is public interface that works on &str
-func (cd *Cedar) Update(key []byte, value int, redched ...bool) error {
+func (cd *Cedar) Update(key []byte, value int, reduced ...bool) error {
 	p := cd.get(key, 0, 0)
 
-	if *p == ValLimit && isReduced(redched...) {
+	if *p == ValLimit && isReduced(reduced...) {
 		*p = value
 		return nil
 	}
@@ -135,27 +135,27 @@ func (cd *Cedar) Update(key []byte, value int, redched ...bool) error {
 }
 
 // Delete the key from the trie, the internal interface that works on &[u8]
-func (cd *Cedar) Delete(key []byte, redched ...bool) error {
+func (cd *Cedar) Delete(key []byte, reduced ...bool) error {
 	// move the cursor to the right place and use erase__ to delete it.
 	to, err := cd.Jump(key, 0)
 	if err != nil {
 		return ErrNoKey
 	}
 
-	if cd.array[to].baseV < 0 && isReduced(redched...) {
+	if cd.array[to].baseV < 0 && isReduced(reduced...) {
 		base := cd.array[to].base()
 		if cd.array[base].check == to {
 			to = base
 		}
 	}
 
-	if !isReduced(redched...) {
+	if !isReduced(reduced...) {
 		to = cd.array[to].base()
 	}
 
 	from := to
 	for to > 0 {
-		if isReduced(redched...) {
+		if isReduced(reduced...) {
 			from = cd.array[to].check
 		}
 		base := cd.array[from].base()