[Haskell-cafe] Large data structures

2006-12-11 Thread Alex Queiroz
Hi all, I'm considering the use of Haskell to manipulate large data structures for Computer Graphics (large geometric datasets). I'm wondering what's the best way to do it. As "objects" (not in the OO sense) in Haskell are immutable, how can I add a vertex to a large mesh without using obscen

Re: [Haskell-cafe] Large data structures

2006-12-11 Thread Stefan O'Rear
On Mon, Dec 11, 2006 at 10:27:44PM -0300, Alex Queiroz wrote: > Hi all, > > I'm considering the use of Haskell to manipulate large data > structures for Computer Graphics (large geometric datasets). I'm > wondering what's the best way to do it. As "objects" (not in the OO > sense) in Haskell a

Re: [Haskell-cafe] Large data structures

2006-12-11 Thread Alex Queiroz
Hallo, On 12/11/06, Stefan O'Rear <[EMAIL PROTECTED]> wrote: No. Haskell's lists are linked lists, enlarge creates a single new link without modifying (and copying) the original. ___ Thanks. Is there a way to mimic this behaviour with my own co

Re: [Haskell-cafe] Large data structures

2006-12-11 Thread Matthew Brecknell
> > No. Haskell's lists are linked lists, enlarge creates a single new link > > without modifying (and copying) the original. > > Thanks. Is there a way to mimic this behaviour with my own code? Yes. Take a look at Data.Map. This data structure provides various operations which create a new map f

Re: [Haskell-cafe] Large data structures

2006-12-12 Thread Alex Queiroz
Hallo, On 12/11/06, Matthew Brecknell <[EMAIL PROTECTED]> wrote: Yes. Take a look at Data.Map. This data structure provides various operations which create a new map from an old one in O(log n) time, by splicing bits of the old map into the new one. Importantly, performing any of these operatio