On 24 Oct 2003 16:30:05 +0200
[EMAIL PROTECTED] wrote:
I was under the impression it was no longer current. Is it still
true?
It is still what the docs say, at least :)
Juanma
___
Hello,
I've been trying to optimise the following code..
-- Search Tree data type
newtype STree = STree (Array Int (STree,[Match]))
-- Initial value for Search Tree
sTree0 :: STree
sTree0 = STree (array (0,9) [(n,(sTree0,[]))| n - [0..9]])
-- Make the search tree from a list of words
makeSTree
[Binary tree] seems to be taking about 4.8 seconds (of 5.1 seconds total
program execution time) for the input I'm using. I thought using
DiffArrays might be faster, but no such luck. Execution time rose
to 9.5 *minutes*.
Is this what I should expect to see?
You don't mention _how_ you use
Hi,
thanks for your answer.
In the distributed parallel extension that we are
developing, programmers are free to use immutable or
mutable arrays and to transmit them between processes
(the language have mechanisms to make transparent
send/recv operations). Thus, it is important to give
On Monday 27 Oct 2003 3:17 pm, Alastair Reid wrote:
You don't mention _how_ you use diffarrays so I'll guess you're keeping the
array in ascending order, finding the insertion point by binary search and
inserting by copying bigger elements one place to the right.
Using binary trees (the code
Hello,
the following error is slightly confusing:
ghc --show-iface
ghc-6.0.1: unrecognised flag: --show-iface
Usage: For basic information, try the `--help' option.
ghc --show-iface Unify.hi
__interface Main Unify 1 where
__export Unify Unifiable{mgu} match mguType varBind;
...
A hint
