intervalradix

Interval Radix

Interval radix tree with byte slice keys optimized for point query read performance.

tree := intvradix.New[int]()
tree.Insert([]byte(`alpha`), []byte(`bravo`), 100)
tree.Insert([]byte(`bravo`), []byte(`charlie`), 200)
c := tree.Insert([]byte(`bravo`), []byte(`delta`), 300)

items := tree.Find([]byte(`bravo`))  // [200, 300]
items = tree.Find([]byte(`charlie`)) // [300]

items = tree.FindAny([]byte(`alpha`), []byte(`bravo`), []byte(`charlie`)) // [100, 200, 300]

c.Remove()

items = tree.Find([]byte(`bravo`))   // [200]
items = tree.Find([]byte(`charlie`)) // []