You probably have some packages of yours installed as user and some
others globally. Have a look at:
http://www.haskell.org/cabal/FAQ.html#dependencies-conflict
I recommend that as soon as you have a running Haskell Platform to
always install new packages with cabal install ... --user
Thomas
0.0
CAF System.Directory
125 1 0.00.0 0.00.0
Regards
Friedrich
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
ystem 99% cpu 17,836 total
Ruby is surely not the speed king of scripting languages, but what
Haskell delivers is "way worse"
Howerver at least it doesn not crash any longer
Regards
Friedrich
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Udo Stenzel <[EMAIL PROTECTED]> writes:
>> Friedrich wrote:
>> >Ok to be more concrete is the laziness "hidden" here?
>> >
>> >check_line line sum count =
>> >let match = matchRegex regexp line
>> >in case match of
Udo Stenzel <[EMAIL PROTECTED]> writes:
>> Friedrich wrote:
>> >Ok to be more concrete is the laziness "hidden" here?
>> >
>> >check_line line sum count =
>> >let match = matchRegex regexp line
>> >in case match of
Thanks, I just figured out that I run out of file descriptors with
reading them all at once. But I probably can try the countDownloads
function. We'll see how that works.
Regards
Friedrich
___
Haskell mailing list
Haskell@haskell.org
Taral <[EMAIL PROTECTED]> writes:
> On Sat, Oct 18, 2008 at 1:50 AM, Friedrich
> <[EMAIL PROTECTED]> wrote:
>> I've written just a few programs in Haskell one in a comparison for a
>> task I had "nearly daily".
>>
>> The code analyzes Apac
"Brandon S. Allbery KF8NH" <[EMAIL PROTECTED]> writes:
> On 2008 Oct 19, at 2:07, Friedrich wrote:
>> Howerver even if Strings are bad I can not see why they are hanging
>> around so long. I open a file a read it line by line and I close the
>> file so all
"Brandon S. Allbery KF8NH" <[EMAIL PROTECTED]> writes:
> On 2008 Oct 19, at 2:26, Friedrich wrote:
>> Paul Johnson <[EMAIL PROTECTED]> writes:
>>>> (By the way, putting in the top level type declarations helps a lot
>>> when you make a mistake
"Brandon S. Allbery KF8NH" <[EMAIL PROTECTED]> writes:
> On 2008 Oct 19, at 2:07, Friedrich wrote:
>> Howerver even if Strings are bad I can not see why they are hanging
>> around so long. I open a file a read it line by line and I close the
>> file so all
Paul Johnson <[EMAIL PROTECTED]> writes:
> Friedrich wrote:
>> I've written just a few programs in Haskell one in a comparison for a
>> task I had "nearly daily".
>>
> The first thing I notice is that this is clearly a direct translation
>> From
;-)
Howerver even if Strings are bad I can not see why they are hanging
around so long. I open a file a read it line by line and I close the
file so all read string are "garbage" and getting rid of them should
not be that hard or should it?
Regards
Friedrich
should.
I think I've overseen something which is bad written. Would you mind
to tell me where I did "extraordinarily" bad.
With best regards
Friedrich
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
I wonder if there are some known troubles. This mode yesterday nearly
drive me nuts. Indentation seem to be ok from the layout, but I got
complains about block closed to early, missing ; ...
Regards
Friedrich
--
for e-mail reply remove all after .com
ges/drscheme/
It runs on a lot of platform. I've running it under Linux and had it
installed under Windows too.
Regards
Friedrich
--
for e-mail reply remove all after .com
g.lisp have pointed out that I'm too much influenced by
Scheme and that my looping constructs look terrible ;-).
>
> Higher-orderness, is used unwisely, can be bad.
Isn't unwise use of other things not as bad? ;-)
Regards
Friedrich
--
for e-mail reply remove all after .com
it for explicit
recursion. And it's anyway a better training for me to understand
functional programming.
>
> BTW, your first two branches can be combined:
>
> makeChange 0 = map (const 0)
I added it later, before just one branch was there, it was just
playing around a bit to see
I know quite well) ;-)
I would really appriciate simular efforts as one can find e.g in
DrScheme for Haskell. DrScheme is IMHO one of the nicest IDEs for
learning Scheme. The online documentation is quite well and the
examples are well choosen. I can imagine that it's not easiy or
honorable to do, but I as a beginner would really appriciate
improvements in that area.
With best regards
Friedrich
--
for e-mail reply remove all after .com
coins) = 0:makeChange 0 coins
makeChange 0 [] = []
makeChange n (coin_val:coins) = let (how_many,rest) = divMod n coin_val
in
how_many:makeChange rest coins
could be replaces by some combination of HOFs. Could someone give me a
hand here?
Thanks in advance
Friedrich
. I'll have to wait and try till I
found what list comprehansion stands for.
Thanks anyway
Friedrich
--
for e-mail reply remove all after .com
Jan Skibinski <[EMAIL PROTECTED]> writes:
> On 22 Aug 2000, Friedrich Dominicus wrote:
>
> > Dear Haskell Fans, I'm afraid that I'm a bit dumb but I'm somewhat
> > stuck.
> >
> > Can someone give me a hand on this problem
> >
>
der functions.
My base idea is splitting up List of Vertices into a list of exactly
three vertices calculating that area and adding them all.
BTW, I do not like the above solution anyway. It's too bulky. So if one has
another idea on how to tackle it, I would be very thankful to some
h
I had
> to use one language for everything, CL would definitely be a
> candidate. Of course, Haskell is so much prettier.
I'm on my way learning both languages. IMO Lisp a more programmer
friendly language. I guess both are simular difficult (or easy it's a
matter of taste) to lean. A
7;s the "right" way. I hardly believe something simular will exist.
> I ask the question, If Lisp is not a 'functional language', then what is
> it?
I would think Lisp among other things is a functional language.
Regards
Friedrich
--
for e-mail reply remove all after .com
n't a FP language? I think among others
it is one. And the combination of features makes Lisp IMHO outstanding
even nowadays.
Regards
Friedrich
--
for e-mail reply remove all after .com
here is not debugger available for Haskell AFAIK)
Common Lisp (nice development environements, extremly flexible)
Smalltalk (off topic here, I think)
Regards
Friedrich
--
for e-mail reply remove all after .com
did not get it right.
Any suggestions?
Friedrich
>>>>> "AvI" == Arjan van IJzendoorn <[EMAIL PROTECTED]> writes:
AvI> Hello Friedrich,
AvI> Turning a string into an integer is easy with the Prelude function 'read':
AvI> n :: Integer
AvI> n = read "-34232"
Yes, oth
rs out
of a String and that's it. I can't believe there isn't some function for
that.
So my question is: Exists such a function or do I have to write it on my own? And the
other is what would you
think would be a good Haskell soluton for turing a string to an Integer.
I'm using HUGS from Feb 2000
Regards
Friedrich
e choice just between awk and Perl I would use Perl.
But because I have other options I can use whatever I like and feel
happy. And so do the Perl lovers. Isn't that wonderful?
Regards
Friedrich
;re rigth, and I better had just asked if someone like to
have a Haskell Shell. I just thought that this would be a nice
application.
Regards
Friedrich
Just wondering if someone uses Hugs for writing Unix-Shell Scripts. Or
what would you think about a Haskell-Shell. SCSH (a Scheme-Shell)
brought me on that idea. Don't you think that would be a nice thing?
Regards
Friedrich
PAtoVA?
> PA_to_VA? [Whatever PA and VA means]
>
If that would be true we just can drop space between words. The closest
to space in words is _. But it is completly unusual do write MixedCaSe
in normal text.
Just my 2 cents
Friedrich
rogram
you and you have such a trouble with that problem in Eiffel you are very
welcome to send a note to the Eiffel- mailing lists. I don't think that
you will get an answer, first learn OOP than ask
Regards
Friedrich
Hannah Schroeter wrote:
>
> Hello!
>
> On Fri, Jun 04, 1999 at 12:18:31PM +0200, Friedrich Dominicus wrote:
>
> > [...]
>
> > > splitFilterMap unSplitFn afterMap filterPredicate beforeMap splitFn =
> > > unSplitFn . map afterMap . filter
Hannah Schroeter wrote:
>
> Hello!
>
> On Fri, Jun 04, 1999 at 12:29:45PM +0200, Friedrich Dominicus wrote:
> > [...]
>
> > > What is difficult is that by using some predefined function, one can
> > > express very much in very small code. I believe Has
Lennart Augustsson wrote:
>
> Friedrich Dominicus wrote:
>
> > That might be good advice but I/O is one of the most essential things
> > and I have to know how to use it proper for writing small skripts.
>
> Actually, you can do a lot without learning about I
lter function from \l -> ... to
> \(_linenumber, l) -> ..., to extract the line content from the
> (line number, content) pair.
>
> For the final output, you must convert the remaining (number,content)
> pairs from fl to single strings containing the line number in textual
> form, i.e.
> let fl' = map (\(number, content) -> show number ++ "\t" ++ content) fl
> putStr (unlines fl')
>
This comments helped me. So I think I will put them under my pillow;-)
Regards and thanks
Friedrich
k with splitFilterMap. Nevertheless is
shows me all way lead to ROME ;-)
I re-wrote that stuff in Python and I've to admit it's way easier to
understand for me (not even talking of writing). But I think it was a
good example to learn how FP-trained would do it. It's a long long way
to go;-)
Regards
Friedrich
or should I try to learn that kind of
programming.
I have some problems with it because a lot of work is just done in one
Method. My knowledge comes from OO-programming and there it wouldn't be
good style to do so much in one function.
Regards
Friedrich
Sven Panne wrote:
>
> Friedrich Dominicus wrote:
> >[...] How can I combine the output with a line-number can I put that
> > into the filter? Or do I have to found another solution?
>
> Don't fear! Mr. One-Liner comes to the rescue:;-)
>
>longerTha
Hannah Schroeter wrote:
>
> Hello!
>
> On Tue, Jun 01, 1999 at 06:58:32AM +0200, Friedrich Dominicus wrote:
> > [...]
>
> > I want to do the following, read a file line by line and finding out
> > which line is longer than x-chars. I want to print out which li
Hannah Schroeter wrote:
>
> Hello!
>
> On Mon, May 31, 1999 at 06:01:31PM +0200, Friedrich Dominicus wrote:
> > Hannah Schroeter wrote:
>
> > > Hello!
>
> > > On Fri, May 28, 1999 at 08:00:27AM +0200, Friedrich Dominicus wrote:
> > > >
Hannah Schroeter wrote:
>
> Hello!
>
> On Fri, May 28, 1999 at 08:00:27AM +0200, Friedrich Dominicus wrote:
> > I wrote before with my trouble understanding hugsIsEOF. But I don't have
> > found a clean way just to write a cat. Can s.o give me a hand?
>
> i
I wrote before with my trouble understanding hugsIsEOF. But I don't have
found a clean way just to write a cat. Can s.o give me a hand?
Regards
Friedrich
uld s.o. give me a hint how I can get this program running?
Regards
Friedrich
46 matches
Mail list logo