[In spirit of teaching you how to fish instead of fishing for you.
No hurt feelings intended. :-)]
On Sat, 28 Sep 2002, [iso-8859-1] João Marcos wrote:
We're currently developing a project in my gradutaion course
(Computer Science), about databases in Haskell. We didn't manage to
write the
false. You free up Nth cell of v when you finish with
3Nth cell of result.
| -- This has no space leak, e.g., when reducing (length (foo2 100))
| foo1 m
(...the only difference below:)
| single x = [x]
Greetings :-)
Michal Gajda
[EMAIL PROTECTED
:-)
Michal Gajda
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
] yields [[1],[2,3],[4,5]]
This is much more general than the existing partitioning function and
applicable in many practical cases.
But here generality comes at the expense of speed I think.
Greetings :-)
Michal Gajda
[EMAIL PROTECTED
]
Michal Gajda
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
. And the need to
explicitly name imperative state or behaviour may clean up the code and
improve understanding of the problem.
Am I the only one?
Greetings
Michal Gajda
[EMAIL PROTECTED]
PS I think that inefficiency of lazy evaluation may be the more important
searching for "stuff like this" in the library.
Michal Gajda
[EMAIL PROTECTED]
instead of 2815000.
2. If (and only if) that doesn't help - try to integrate both programs
using tool such as HaskellDirect
Hope it helps
Michal Gajda
[EMAIL PROTECTED]
On 31 Dec 1999, Matthias Riese wrote:
Hi!
My system is made up of a non-haskell program producing data
