Er what is going on here? CVS sources from this morning, building with
GHC binary release.
==fptools== gmake all --no-print-directory -r;
in /usr/local/pub-bkb/ghc/fptools/hslibs/tools/DrIFT
[Simon: could you add this to the CVS cheat sheet?]
Folks,
As many of you know, you can get GHC from the CVS repository.
Quite a few people do this, and it's great! We get early feedback,
which we really welcome.
I'd like to make a suggestion, though. If you are reporting a bug or
infelicity
I complained on the slow compilation of 40 functions like
e1 =
[(-3,(1,0,1),[3,0,0,0]), (-2,(0,1,0),[3,0,0,0]), (1,(0,0,3),[]),
(1,(0,0,2),[2,0,0,0]) ...
]
I do not know now, probably, I have to withdraw the complaint ...
Simon Marlow [EMAIL PROTECTED] writes on 17 Apr 2000
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
/ \
2
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
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
