GoLLRB
GoLLRB copied to clipboard
petar
A Left-Leaning Red-Black (LLRB) implementation of balanced binary search trees for Google Go
Please consider assigning version numbers and tagging releases. Tags/releases are useful for downstream package maintainers (in [Debian](http://debian.org) and other distributions) to export source tarballs, automatically track new releases and to...
I encountered a crash in a data processing app that makes use of GoLLRB. panic: runtime error: invalid memory address or nil pointer dereference at llrb/llrb.go:423 (moveRedLeft) I found a...
Changing the interface makes the example break. Just a quick fix to make it work so that people can get started with the example.
I think somebody else would find my fork useful, but I don't want to pollute the google wiki with this fork. Perhaps it's worth mentioning my fork in your README....
Hi, I noticed this because I've been writing an llrb, and on my own project I can't get deletion to test as correct when using top down 2-3-4 insertion (see...
I want to iterate from a given key to the end of the tree inclusively. But there seems to be no way to get the last (tree.Max()) value as part...
Hi, this PR fixes the example which was probably written for an older API. Kind regards, and many thanks for GoLLRB! Charly
