This is done now, with a mandatory simple permissive license.
--
Ashley Yakeley, Seattle WA
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
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
> > >
> > > http://www.haskell.org/ghc/dist/curren
Erm, has nobody replied to this yet? I want a robust interface, that
uses bracket notation all the way down, so that any error is caught and
resources are freed appropriately without the use of finalizers (which
may not get run and lead to resource starvation - they are not reliable
if dealing
Yes, I see... I edited it from the source code, which actually has the type:
dbConnectWith :: VerifyTables t => (SqlHandle () -> IO ()) -> t -> Query
() -> IO ()
dbConnectWith confn tabs query = confn (do { _ <- runST (do verifyTables
tabs ; query) 0; return () })
I obviously did not think ha
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 t
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 :: Sequ
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...
Democr
On Fri, 2006-01-13 at 15:21 +0100, Christian Maeder wrote:
> Duncan Coutts wrote:
> >> What's the semantics of insert? Does it replace an element, or does it
> >> shirt all the elements after it one step?
> >
> > It shifts all the elements after it one step. So that's why all the
> > finite map ty
Christian Maeder wrote:
seqInsert i v = Map.insert i v
. Map.mapKeysMonotonic (\ j -> if j < i then j else j + 1)
Sorry, only O(n) and not O(log n). The same would apply to delete.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/
Duncan Coutts wrote:
What's the semantics of insert? Does it replace an element, or does it
shirt all the elements after it one step?
It shifts all the elements after it one step. So that's why all the
finite map types are no help.
import Data.Map as Map
seqInsert i v = Map.insert i v
. Ma
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 :: Sequ
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
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 -> Seque
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 -> Sequ
> 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
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
Christian Maeder <[EMAIL PROTECTED]> writes:
> Bruno Oliveira wrote:
> > Can somebody point me out the exact CVS location of the State Monad
> > implementation that ships with GHC? I am a bit lost in the CVS directory
> > structure ...
>
> fptools/libraries/mtl/Control/Monad/State.hs
Or rather
Bruno Oliveira wrote:
Can somebody point me out the exact CVS location of the State Monad
implementation
that ships with GHC? I am a bit lost in the CVS directory structure ...
fptools/libraries/mtl/Control/Monad/State.hs
Christian
___
Haskell maili
Hello,
Can somebody point me out the exact CVS location of the State Monad
implementation
that ships with GHC? I am a bit lost in the CVS directory structure ...
Related to this, I saw the following thread:
http://www.mail-archive.com/haskell@haskell.org/msg17702.html
Which seems to hint that
19 matches
Mail list logo
