Comments on: Ruby: get full history (all parents) of a hash node http://sameshirteveryday.com/2007/09/23/ruby-get-full-history-all-parents-of-a-hash-node/ Personal blog of the one called Alex Gorbatchev, from Toronto, Canada. Sat, 15 May 2010 23:53:58 -0700 http://wordpress.org/?v=2.8.5 hourly 1 By: freno http://sameshirteveryday.com/2007/09/23/ruby-get-full-history-all-parents-of-a-hash-node/comment-page-1/#comment-2359 freno Mon, 29 Oct 2007 12:53:20 +0000 http://www.sameshirteveryday.com/2007/09/23/ruby-get-full-history-all-parents-of-a-hash-node/#comment-2359 For a similar snippet see http://snippets.dzone.com/posts/show/1908 . For a similar snippet see http://snippets.dzone.com/posts/show/1908 .

]]> By: Alex Gorbatchev http://sameshirteveryday.com/2007/09/23/ruby-get-full-history-all-parents-of-a-hash-node/comment-page-1/#comment-1992 Alex Gorbatchev Mon, 24 Sep 2007 23:58:40 +0000 http://www.sameshirteveryday.com/2007/09/23/ruby-get-full-history-all-parents-of-a-hash-node/#comment-1992 Rudolf, Not really an advantage over anything, this is just a code snippet illustrating how to get all parent nodes of a tree. I just found it to be a nice combo of recursion and yield. Rudolf,

Not really an advantage over anything, this is just a code snippet illustrating how to get all parent nodes of a tree. I just found it to be a nice combo of recursion and yield.

]]> By: Rudolf Olah http://sameshirteveryday.com/2007/09/23/ruby-get-full-history-all-parents-of-a-hash-node/comment-page-1/#comment-1991 Rudolf Olah Mon, 24 Sep 2007 23:14:57 +0000 http://www.sameshirteveryday.com/2007/09/23/ruby-get-full-history-all-parents-of-a-hash-node/#comment-1991 What's the advantage of this over using a binary search tree? Is it faster? What’s the advantage of this over using a binary search tree? Is it faster?

]]>