Announcing buddha version 1.1
-
www.cs.mu.oz.au/~bjpop/buddha
New in this release:
- support for GHC 6.2
- better user interface
- many bug fixes
--
A declarative debugger for Haskell
On Fri, 27 Feb 2004 [EMAIL PROTECTED] wrote:
> If indeed the read performance is at premium and updates are
> infrequent, by bother with ternary etc. trees -- why not to use just a
> single, one-level array. Given a reasonable hash function
Because updates are not so infrequent that I want
t
G'day all.
Quoting [EMAIL PROTECTED]:
> If indeed the read performance is at premium and updates are
> infrequent, by bother with ternary etc. trees -- why not to use just a
> single, one-level array. Given a reasonable hash function, the
> retrieval performance is O(1).
Ah, but key compar
Hello,
why is the Random module situated under System? Wouldn't something like Data
be more adequate?
Wolfgang
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hi,
Reading the recent discussions abount Array and FiniteMap,
I want to know what people think about the current specification of the Array update.
The Array implementaton of GHC effectively has this property (like FiniteMap):
(arr // cs1) // cs2 == arr // (cs1 ++ cs2) -- allow duplicat
| > In Haskell today, you can at least tell what value is bound to each
| > identifier in the program, *without* first doing type checking.
|
| I'm afraid I'm confused. In the following code
|
| > data Z
| > data S a
| >
| > class Card c where c2int:: c -> Int
| >
| > instance Card Z where c2int
Simon Peyton-Jones wrote:
> In Haskell today, you can at least tell what value is bound to each
> identifier in the program, *without* first doing type checking.
I'm afraid I'm confused. In the following code
> data Z
> data S a
>
> class Card c where c2int:: c -> Int
>
> instance Card Z where
Hello!
If indeed the read performance is at premium and updates are
infrequent, by bother with ternary etc. trees -- why not to use just a
single, one-level array. Given a reasonable hash function, the
retrieval performance is O(1). And still, no IO/ST are necessary.
{-# OPTIONS -fglasg
