(b *testing.B)
| 38 | } |
| 39 | |
| 40 | func BenchmarkTrie_Find_existent(b *testing.B) { |
| 41 | insert := make([]string, 3000) |
| 42 | for i := 0; i < len(insert); i++ { |
| 43 | insert[i] = fmt.Sprintf("%f", rand.Float64()) |
| 44 | } |
| 45 | n := NewNode() |
| 46 | n.Insert(insert...) |
| 47 | |
| 48 | b.ResetTimer() |
| 49 | for i := 0; i < b.N; i++ { |
| 50 | n.Find(insert[i%3000]) // always exists ! |
| 51 | } |
| 52 | } |
| 53 | |
| 54 | func BenchmarkTrie_Remove_lazy(b *testing.B) { |
| 55 | insert := make([]string, 3000) |