Open roseduan opened 1 year ago
tree := iradix.New[[]byte]() iter := tree.Root().Iterator() iter.SeekPrefix([]byte("a")) iter.SeekLowerBound([]byte("b"))
if there are no keys match the prefix, then I call SeekLowerBound, it will panic.
SeekLowerBound
if there are no keys match the prefix, then I call
SeekLowerBound
, it will panic.