Matthew,
I would strongly suggest taking a look on SPJ's presentation at OSCON 2007
(video at http://blip.tv/file/324976). He shows a very interesting circular
list (with a zipper).
Since you are interested in functional data structures, Chris Okasaki's book
"Purely Functional Data Structures" is a great source too!
On Tue, Feb 3, 2009 at 00:53, Erik de Castro Lopo
wrote:
Matthew J. Williams wrote:
How would one mimic, in Haskell, a C++ circular linked list i.e., where the last element precedes (points to) the first?
Try this, "Tying the Knot":
http://www.haskell.org/haskellwiki/Tying_the_Knot
Erik -- -- ----------------------------------------------------------------- Erik de Castro Lopo ----------------------------------------------------------------- "I consider C++ the most significant technical hazard to the survival of your project and do so without apologies." -- Alistair Cockburn _______________________________________________ Beginners mailing list Beginners@haskell.org http://www.haskell.org/mailman/listinfo/beginners
-- Rafael Gustavo da Cunha Pereira Pinto Electronic Engineer, MSc.