Skip navigation

Tag Archives: data structures

Clojure is a new Lisp on the block.  It runs on the JVM, giving it full access to any Java library (and its complement), but it leans more towards the functional paradigm, so data structures are immutable (a big boon for concurrent programming, as locks become obsolete).

In addition to supporting the usual data types of Lisp, Clojure has added syntactic support for vectors, maps and sets.  Some sacrifices have been made for performance; in order to have immutable data structures, it returns a new data structure for each mutation.  However, because the parent data structure is immutable, much of the structure can be shared. Performance-wise, Rich Hickey has stated that “I’ve tried to keep [operations] all within 1 to 4 times [the equivalent] Java data structure, [but lookup times are frequently faster]”.

Read More »

My roommates were just giving me a hard time about a few things; heating up pans on the stove and forgetting about them and making toast and then not eating it.

I really have no recollection of leaving pans on the stove within the past 2-3 weeks, and 3 of my roommates have only lived here for 6 weeks.  The fact that they have noticed the elements being left on and commented on it probably means that I am guilty of the act within the 2-3 week period.  I remember none of this, which is definitely a bad thing.

As far as toast goes, I have noticed that my toast disappears.  Just a week ago I went to eat some toast I had made the previous day, and it was gone!  Of all the things, I expect my toast to stay put until I am ready for it. Read More »