Hacker GitHub

← All repos

petar/GoLLRB

View on GitHub ↗ ★ 821 Go

A Left-Leaning Red-Black (LLRB) implementation of balanced binary search trees for Google Go

5 mentions on Hacker News by 5 people: 1 story, 4 comments · first 2010-08-31 · latest 2015-04-06

Mentions per year 5 mentions · busiest year 2014 (2)
20082026
AllStoriesComments NewestTopOldest
  1. …can generate LLRB trees in Go (can also use as a lib): github.com/aybabtme/datagen Otherwise there's also github.com/petar/GoLLRB/llrb.
    comment by AYBABTME · 2015-04-06 · in Left-leaning Red-Black Trees (2008) [pdf]
  2. …here's an implementation of a "generic" LLRB Tree in Go using interfaces and runtime reflection: https://github.com/petar/GoLLRB I suppose you could hand-write it to fit the value type of choice? Does that answer your question?
    comment by vanderZwan · 2014-06-07 · in Things that make Go fast
  3. …if you want to add them (most often this sort of list is of a custom data type though). e.g. https://github.com/petar/gollrb So if you need a data structure like this, you can do it without much trouble without generics. Perhaps you don't…
    comment by grey-area · 2014-04-28 · in Leaving Go
  4. …template processors, afaik. A Left-leaning Red-Black Tree, for example: http://gopkgdoc.appspot.com/pkg/github.com/petar/GoLLRB/llrb Holding up Eclipse as an example citing performance is perhaps not the best idea. And Chromium seems to do…
    comment by agentS · 2012-04-09 · in Do Not Use Go for 32bit Development
  5. ▲ 1
    Left-Leaning Red-Black (LLRB) balanced binary search trees for Google Go
    story by bravura · 2010-08-31 · 0 comments