Hi Sergey,
| In what way the Haskell implementations may use the GMP library?
| (GNU Multi-Precision integers ?)
Hugs 98 doesn't use gmp at all. For legal reasons (later rendered
irrelevant by changes to the Hugs license), Hugs used it's own
implementation of multi-precision integers.
| And th
Hi Andrew,
| Hey all.. I was wondering if somebody might offer me some assistance in
| trying to debug some code I wrote to check whether a tree is a binary
| search tree.. For some reason it always comes back as false! :( Thanks
| much!
One of the great things about functional programming is t
Dear Haskell implementors,
In what way the Haskell implementations may use the GMP library?
(GNU Multi-Precision integers ?)
I had some dim idea of that the implementations rely on gmp for the
arithmetic of integers of arbitrary size.
This letter encloses the reproduction of some part of the
Assuming this isn't a homework exercise...
> 1) If current node is empty then this portion of tree is a BST
> 2) if the left subtree and right subtree's are both not empty then ...
The logical negation of your second clause (which is what is picked
up by the 'otherwise' clause of your code) is
A new version of the Functional Graph Library for Haskell
is available at:
www.informatik.fernuni-hagen.de/pi4/erwig/fgl/haskell/
(Changes since the last version: User Guide available,
several new and changed functions)
--
Martin
Mon, 17 Apr 2000 14:47:49 -0400 (EDT), Sitzman <[EMAIL PROTECTED]> pisze:
> > | otherwise = False
2
/ should be a BST too.
1
> >checkL = ((treeVal (leftSub thetree)) < (treeVal (thetree)))
> >checkR = ((treeVal (rightSub thetree)) > (treeVal (thetree)))
It's not enough:
3
