Hi all,
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
lookup :: Sequence a - Int - Maybe a
insert :: Sequence a - Int - a - Sequence a
delete :: Sequence a - Int - Sequence a
Obviously I can
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
[snip] For example the Data.Map supports all of these except
insert. Okasaki's random access lists only support inserting elements at
the head of the
On 1/13/06, Duncan Coutts [EMAIL PROTECTED] wrote:
Hi all,
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
lookup :: Sequence a - Int - Maybe a
insert :: Sequence a - Int - a - Sequence a
delete
On Fri, Jan 13, 2006 at 01:18:35PM +, Duncan Coutts wrote:
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
lookup :: Sequence a - Int - Maybe a
insert :: Sequence a - Int - a - Sequence a
On Fri, 2006-01-13 at 14:41 +0100, Sebastian Sylvan wrote:
On 1/13/06, Duncan Coutts [EMAIL PROTECTED] wrote:
Hi all,
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
lookup :: Sequence a -
On Fri, 2006-01-13 at 13:53 +, Ross Paterson wrote:
On Fri, Jan 13, 2006 at 01:18:35PM +, Duncan Coutts wrote:
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
lookup :: Sequence a -
Duncan Coutts wrote:
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
See also, Robert Will's Democratic Sequences which strive for O(log
n) complexity for all major operations...
Democratic
On Fri, 2006-01-13 at 13:53 +, Ross Paterson wrote:
On Fri, Jan 13, 2006 at 01:18:35PM +, Duncan Coutts wrote:
I've been looking around (unsuccessfully) for an efficient data
structure to implement a sequence data type with indexed
insert/delete/lookup.
lookup :: Sequence a -
On Fri, Jan 13, 2006 at 08:25:46PM +, Duncan Coutts wrote:
On Fri, 2006-01-13 at 13:53 +, Ross Paterson wrote:
Have a look at Data.Sequence (in CVS/darcs version), docs at
http://www.haskell.org/ghc/dist/current/docs/libraries/base/Data-Sequence.html
[...]
It's probably too much
On Fri, 2006-01-13 at 20:52 +, Ross Paterson wrote:
On Fri, Jan 13, 2006 at 08:25:46PM +, Duncan Coutts wrote:
On Fri, 2006-01-13 at 13:53 +, Ross Paterson wrote:
Have a look at Data.Sequence (in CVS/darcs version), docs at
10 matches
Mail list logo
