Wow, that's really good. That's what I was trying to come up with all
afternoon. I knew I needed some way to keep track of the function's state,
but I couldn't figure it out.
I came up with my own version using Rich's zipper library, traversing the
data structure like a tree, but yours is much fas
Hi,
Am 01.08.2009 um 18:37 schrieb Garth Sheldon-Coulson:
I have a program that produces multidimensional LazySeqs, i.e. seqs
of seqs of seqs of...
I would like to write a function to convert these multidimensional
LazySeqs to vectors. This is in case a user needs constant lookup
time.
On Aug 1, 9:37 am, Garth Sheldon-Coulson wrote:
> Hi there,
>
> I have a program that produces multidimensional LazySeqs, i.e. seqs of seqs
> of seqs of...
>
> I would like to write a function to convert these multidimensional LazySeqs
> to vectors. This is in case a user needs constant lookup
Hi there,
I have a program that produces multidimensional LazySeqs, i.e. seqs of seqs
of seqs of...
I would like to write a function to convert these multidimensional LazySeqs
to vectors. This is in case a user needs constant lookup time.
The following function will do it:
(defn vectorize [obj]
