plar / go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

what does the benchmark really mean?

hiqsociety opened this issue · comments

  1. insert words are all words? how many total?
  2. search words (26) what does that mean? just search for 1 word or many many words?

| Tree Insert Words | 9 | 117,888,698 ns/op | 37,942,744 B/op | 1,214,541 allocs/op |
| Tree Search Words | 26 | 44,555,608 ns/op | 0 B/op | 0 allocs/op |
| Tree Insert UUIDs | 18 | 59,360,135 ns/op | 18,375,723 B/op | 485,057 allocs/op |
| Tree Search UUIDs | 54 | 21,265,931 ns/op | 0 B/op | 0 allocs/op |