Bugs item #1231273, was opened at 2005-07-01 17:01
Message generated for change (Comment added) made by pimlott
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1231273group_id=8032
Please note that this message will contain a full copy of the comment
It turns out, ar couldn't quite handle building the symbol table for
the archive. I tried ar qS, then ranlib the archive, but ranlib turns
out to be exactly the same kind of brittle crap...
I am currently looking for more robust binutils - I'll appreciate any
siggestions.
Cheers,
D. Tenev
Frederik Eaton wrote:
main = do
let a = (map (\x-
x+1) --*
[0..9]) --*
print a
seeing this, I wonder if do-statements (and qualifiers in list
comprehensions) could be easily extended by an alternative for simple
declarations (without mutual recursion and type
Dear all,
I am writing a long string (several MByte) to a file,
with writeFile fname ( render d )
where d :: Text.PrettyPrint.HughesPJ.Doc
I wonder what happens internally
(when compiled with ghc -O, if that matters)
Will the string be in memory completely
before it is actually written?
My d
Hi,
maybe try using fullRender with defaults (mode=PageMode, lineLength=100,
ribbonsPerLine=1.5) and a instantiated to IO() so that TextDetails
can be appended to a file (handle).
HTH Christian
Johannes Waldmann wrote:
Dear all,
I am writing a long string (several MByte) to a file,
with
At 12:02 PM 7/12/2005, Wolfgang Jeltsch wrote:
Am Montag, 11. Juli 2005 15:51 schrieben Sie:
[...]
I am always interested in functional I/O solutions that adopt the
world-as-value paradigm (or the more verbose explicit multiple
environment passing paradigm) that has been exploited in
Am Donnerstag, 14. Juli 2005 13:17 schrieben Sie:
[...]
where readEntireFile reads the entire file and returns it as a string.
I can imagine several results: [a,a], [a,b], [a,_|_], [_|_,_|_], _|_.
I decided to distinguish between read-only I/O and write-permitted I/O.
If
On 14 July 2005 10:08, Johannes Waldmann wrote:
I am writing a long string (several MByte) to a file,
with writeFile fname ( render d )
where d :: Text.PrettyPrint.HughesPJ.Doc
I wonder what happens internally
(when compiled with ghc -O, if that matters)
Will the string be in memory
On Thu, Jul 14, 2005 at 03:15:32AM +0200, Lennart Augustsson wrote:
The offside rule is patronizing. :)
It tries to force you to lay out your program in a certain way.
If you like that way, good.
I disagree. The offside rule in general makes a more concise syntax
available to the programmer,
On 7/14/05, Frederik Eaton [EMAIL PROTECTED] wrote:
On Thu, Jul 14, 2005 at 03:15:32AM +0200, Lennart Augustsson wrote:
The offside rule is patronizing. :)
It tries to force you to lay out your program in a certain way.
If you like that way, good.
I disagree. The offside rule in general
Mark Carroll [EMAIL PROTECTED] writes:
On Wed, 13 Jul 2005, Dinh Tien Tuan Anh wrote:
(snip)
eg: m = 75, k = 5
= [50, 20, 5]
[50, 20, 1,2,2]
(snip)
Is this problem suitable for functional programming language ?
Oh, what fun. I like this sort of thing. My quick
Actually, something along the lines of Dinh's
attempted solution to the original partition
problem is a very nice solution to the coin
changing problem:
Make change for the amount a, using at most
k of the coins cs.
coins _ 0 _ = [[]]
coins _ _ 0 = []
coins cs a k = [h:s | t - init (tails
On Thu, Jul 14, 2005 at 01:44:05PM +0300, Yitzchak Gale wrote:
Here it is translated into regular monad syntax:
coinsM _ 0 k = return []
coinsM _ _ 0 = []
coinsM cs a k = do
t - init (tails cs)
let h = head t
unless (h = a) []
s - coinsM t (a-h) (k-1)
return (h:s)
On 2005-07-07, Henning Thielemann [EMAIL PROTECTED] wrote:
My point was that vectors naturally do _not_ represent linear maps at all,
but they are the objects linear maps act on. If I process an audio signal
or an image I can consider it well as vector but why should I consider it
as linear
This is a classic dynamic programming problem. Dynamic programming is
easy to do in Haskell using recursive arrays. Instead of using
recursive arrays directly, however, I'll add a few helper functions that
make this kind of problem easier.
import Array
tabulate :: (Ix a) = (a,a) - (a - b) -
The combinator is really elegant, but I want to ask a question about the
arrays that get built. The 3D array index is by (m,n,i) and a single
array should be good for all of the results.
If I say let {x=change 10 5; y=change 5 10;} then it looks like dp
(10,5,8) and dp (5,10,8) get evaluated.
On Wed, Jul 13, 2005 at 06:13:48PM +0200, Alberto Ruiz wrote:
I have changed the function names as suggested. This new style is clearly
better, allowing Vector.add, Matrix.add, Vector.Complex.add,
Matrix.Complex.add, etc.
...
Now we can have Vector.T a and Matrix.T a for any storable a
ChrisK wrote:
During a single evaluation the recursive calls never collide, so
unless this overlap is optimized, then the subproblem memoizing won't do
anything...
Actually, the recursive calls can collide. For example, if you are trying to
make 87 cents with 7 coins, you can make the
18 matches
Mail list logo
