Hi,
--- Stefan Reich <[EMAIL PROTECTED]> wrote:
> Hi everybody,
>
> is there a Haskell collections framework suitable
> for practical use?
There's the Edison framework. From what I understand,
it is currently in a zombie state of development.
I understand it is maintained as part of the Haskell
SimonPJ and I have just (hopefully) finished a revision of Data.
Just committed.
In this course, we also have added instances for several things
including Ptr etc. As you propose, Ptr values are not traversed
and fromConstr and toConstr will be undefined.
Ralf
> with reference to Ptr, I only nee
Hi everybody,
is there a Haskell collections framework suitable for practical use? I
searched the Net and didn't really find anything. I'm growing tired of
remembering the various (and partially inconsistent) function names for
lists, sets, finite maps, arrays, ... For starters, take lookup and
> Yup that worked. Sort of an obscure error message
> to communicate "package not found"
>
> Is there a convention so I know which package I
> need for which module? My guess is sometimes (but
> randomly) you need to add a package
> on the command line corresponding to the first
> part of
Yup that worked. Sort of an obscure error message
to communicate "package not found"
Is there a convention so I know which package I
need for which module? My guess is sometimes (but
randomly) you need to add a package
on the command line corresponding to the first
part of the qualified modu
> This program does not compile using GHC 6.2 on winXP.
>
> import Network.Socket
> main = do putStr ""
>
> The error is:
>
> conc.o(.text+0x22):fake: undefined reference to
> `__stginit_NetworkziSocket_'
>
> What am I doing wrong?
You need to add '-package network' to the command lin
This program does not compile using GHC 6.2 on winXP.
import Network.Socket
main = do putStr ""
The error is:
conc.o(.text+0x22):fake: undefined reference to `__stginit_NetworkziSocket_'
What am I doing wrong?
-Alex-
_
S.
Hi Simon!
On Fri, Feb 27, 2004 at 09:20:40AM -, Simon Peyton-Jones wrote:
> There are several things that aren't research issues: notably, faster
> copying, fewer intermediate lists, fewer state-monad-induced
> intermediate closures. These are things that would move sharply up our
> priority
MR K P SCHUPKE <[EMAIL PROTECTED]> writes:
> I was thinking about improving array performance, and was wondering
> if a transactional model would work well.
>
> I would be interested in any comments... I suspect somebody has done this
> before, but I havent looked for any papers yet.
O'Neill and
with reference to Ptr, I only need an instance of Data for the
Ptr () case (ie opaque pointers) ... so for generics it only needs
to know that a Ptr is a Ptr, and to treat it like a value.
Regards,
Keean Schupke.
___
Glasgow-haskell-users
I was thinking about improving array performance, and was wondering
if a transactional model would work well. You would keep a base copy
of the array, and any writes would be written to a delta style transaction
list. A reference to the array would be the list plus the base array.
Different refere
11 matches
Mail list logo
