Josh Baker
Josh Baker
The `b = b[n:]` progresses the `b` slice forward, which is needed for the loop to terminate at `for len(b) > 0` at https://github.com/tidwall/bfile/blob/master/bfile.go#L199
The return value of `find` is not the inverse of the input to `GetAt`. The `find` method does not return the index of a key in the entire `Map`, it...
For an inclusive range operation you can use the `Ascend` function. ``` min, max := 10, 100 m.Ascend(min, func(key int, value string) bool { if key > max { return...
Ok. I'll try to put together some documentation on the README.
I added a [PATH_HINT](https://github.com/tidwall/btree/blob/master/PATH_HINT.md) markdown file.
@tommie Your PathContext idea is slick. I'm not sure that it's best suited for adding directly to this library but I can see how it others might find it convenient.
I agree. Do you think adding verbose comments describing the logic would help?
It uses the same format as Redis. https://stackoverflow.com/a/55330520/424124
Sorry for the slow response. A data recovery tool does seem useful. I would consider accepting the tool as a contribution. But If there is an issue with BuntDB I...
I added allowing for a recover mechanism. Would something like this work? ``` defer func() { if err, ok := recover().(error); ok { if strings.HasPrefix(err.Error(), "buntdb: ") { err :=...