btree
btree copied to clipboard
tidwall
B-tree implementation for Go
When using this table with predictable constant-size binary keys(32 bytes), would this library still use interface{} or does it adjust to constant column/data sizes? Would be great if the extra...
Docs say Get(key, value) instead of Get(key). I'll submit a pull request if I can make a moment. Thanks, this b-tree is hot.
can you export ```go func (tr *Map[K, V]) find(n *mapNode[K, V], key K) (index int, found bool) ``` to public domain, like: ```go func (tr *Map[K, V]) Find(n *mapNode[K, V],...
I am trying to understand how exactly I can use path hint methods. Could you please give some examples in the Readme. That would be helpful.
Hello @tidwall, thank you a lot for this very nice module, it was very handy to me several times. I'm trying to debug a crash in one of my applications:...
I like marshalling to btrees because it gives me a stable key order. This PR uses a naive implementation, and only implements it for Map. That was all I needed...
- Upgraded `actions/checkout` and `actions/setup-go` - Test on macOS, Windows and Linux - Use go.mod file for go version
The method will return the position of the current item within the iterator. This method will have `O(log n.m)` where `m` is the degree of the btree.
how about "add put method to set kvpairs , if old value exists, return val", thinkabout this: a position can only hold one element, but if the element return to...
