Bidirectional Map can be implemented in less than 20 lines (put, get, remove).
The Archive of Interesting Code
11–20 of 34 posts
Re: The Archive of Interesting Code
#12Some are interesting, but there's lots of mundane and generally boring stuff too, e.g. [1] [1] http://www.keithschwarz.com/interesting/code/?dir=argmax
Wow, what a sad place has HN become that this kind of comment is getting upvoted. There are tons of interesting stuff in there, very exhaustively commented, and you say "some are interesting, lots are mundane" quoting a single goddamn example. Wouldn't linking the interesting ones be, like, more interesting? What a fucking weak attitude!
Re: The Archive of Interesting Code
#13Some are interesting, but there's lots of mundane and generally boring stuff too, e.g. [1] [1] http://www.keithschwarz.com/interesting/code/?dir=argmax
Wow, what a sad place has HN become that this kind of comment is getting upvoted. There are tons of interesting stuff in there, very exhaustively commented, and you say " some are interesting, lots are mundane" quoting a single goddamn example. Wouldn't linking the interesting ones be, like, more interesting? What a fucking weak attitude!
To each his own. For some splay trees is a revelation, for others - it's Algorithms 101.
Re: The Archive of Interesting Code
#14Earlier quoted context omitted.
Wow, what a sad place has HN become that this kind of comment is getting upvoted. There are tons of interesting stuff in there, very exhaustively commented, and you say " some are interesting, lots are mundane" quoting a single goddamn example. Wouldn't linking the interesting ones be, like, more interesting? What a fucking weak attitude!
To each his own. For some splay trees is a revelation, for others - it's Algorithms 101.
Euclid's Algorithm is certainly Algorithms 101, his discussion of it - far from it:
Re: The Archive of Interesting Code
#15Re: The Archive of Interesting Code
#16Um, pick me too! Persistent Red-Black Tree
http://wiki.edinburghhacklab.com/persistentredblacktreeset
Re: The Archive of Interesting Code
#17I was so happy to see the in-place merge algorithm!
Does anyone know if there is an implementation of the (supposedly) faster version, which was published in this later paper?
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134....
Re: The Archive of Interesting Code
#18Nice and simple; I like it! Also, you just made every introductory CS teacher cringe, unless they import all of these into their cheating detection system.
Re: The Archive of Interesting Code
#19Some are interesting, but there's lots of mundane and generally boring stuff too, e.g. [1] [1] http://www.keithschwarz.com/interesting/code/?dir=argmax
Wow, what a sad place has HN become that this kind of comment is getting upvoted. There are tons of interesting stuff in there, very exhaustively commented, and you say " some are interesting, lots are mundane" quoting a single goddamn example. Wouldn't linking the interesting ones be, like, more interesting? What a fucking weak attitude!
Have you looked at the link he provided?
IMHO it doesn't fit at all with the other things. You can implement In-Place Mergesort or one of its variants by studying Wikipedia. Or you can just look up a nice implementation from the OPs site and port it to your favorite language. That said, this argmin/argmax thing does absolutely not fit.
Re: The Archive of Interesting Code
#20Under what license may I reuse those snippets -- or are they too short to provoke legal issues anyways?