tsuraan tsur...@gmail.com wrote:
Is there a more concise way to do this?
I use
someIO = f where
f Opt1 = ...
If it's a common pattern, you can even do
opts f _ _ (Opt1 x) = f x
opts _ g _ (Opt2 x) = g x
opts _ _ h (Opt3 x) = h x
. Functions are easier to mess around with than case
Nathan Hunter enfer...@gmail.com wrote:
-What Data Structures in the current libraries are in most dire need
of improvement?
-How necessary do you think a Containers Library revision is?
-Should I attempt to build on the work Jamie Brandon did with Map as
generalised tries, or is that beyond
Richard O'Keefe o...@cs.otago.ac.nz wrote:
I grant you that driving cars is recent (:-) (:-)!
And shoes! Never leave home with them. Well, at least spring till fall.
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying,
Stephen Tetley stephen.tet...@gmail.com wrote:
Much of the behaviour of CPP is not defined and often inaccurately
described, certainly it wouldn't appear to make an ideal one summer,
student project.
If you get
http://ldeniau.web.cern.ch/ldeniau/cos.html
to work, virtually everything else
Arnoldo Muller arnoldomul...@gmail.com wrote:
Right now, the bottleneck of my program is in binarySearch', the
function must be called a few billion times.
Do you have any ideas on how to improve the performance of this
function?
The fastest way to do a binary search is to reify it into
Ketil Malde ke...@malde.org wrote:
Lazy IO always worked well for me, so althouhg I feel I should look
more deeply into real solutions, like Iteratee, my half-hearted
attemts to do so have only resulted in the conclusion that it was
more complicated, and thus postponed for some rainy day...
Sebastian Fischer s...@informatik.uni-kiel.de wrote:
(Choosing names that are
misleading or flat out wrong is of course always a bad idea.)
foo = f . g . h where
f x = ...
g x = ...
h x = ...
Sometimes laziness is just the clearest option.
--
(c) this sig last receiving data
Nick Bowler nbow...@elliptictech.com wrote:
I meant to say that fromRational . toRational is not appropriate for
converting values from one floating point type to another floating
point type.
It gets even worse: My GPU doesn't know about doubles and its floats
aren't IEEE, at all (not that
Stefan Monnier monn...@iro.umontreal.ca wrote:
Note that this is a safety measure for the submitter: If the code
is, indeed, released to the public, it is (dual licesed) GPL,
anyway, even if that might not have been the intent.
No. If the submitter did not explicitly release his code
David Leimbach leim...@gmail.com wrote:
Yes the author can privately license code to himself under any
license he wants, but when he distributes code based on GPL'd code,
it has to be GPL'd. That's why people hate this license, or love this
license. For all the freedom it talks about it's
Johan Tibell johan.tib...@gmail.com wrote:
= A high-performance HTML combinator library using Data.Text =
May I add
* Conceptual compatiblity with the W3C DOM. The library shoud be
designed in a way that allows a thin / automatically generated
wrapping layer to support DOM operations,
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
For example, see the license for cpphs [1]; on Hackage it's listed as
LGPL whereas the library is LGPL and the program is GPL.
Output from GPL programs is licensed under whatever license its input
is licensed under (that is, the GPL
Johan Tibell johan.tib...@gmail.com wrote:
On Fri, Mar 5, 2010 at 3:46 PM, Achim Schneider bars...@web.de
wrote:
Johan Tibell johan.tib...@gmail.com wrote:
= A high-performance HTML combinator library using Data.Text =
May I add
* Conceptual compatiblity with the W3C DOM
Matthias Kilian k...@outback.escape.de wrote:
On Fri, Mar 05, 2010 at 09:26:08PM +, Simon Marlow wrote:
Switching GHC to a completely new build system written completely
in Haskell would be the most stupid idea ever. (You know why)
You're referring to bootstrapping, I presume?
Malcolm Wallace malcolm.wall...@cs.york.ac.uk wrote:
I'd also like to point to Nix[3] and Cabal[4] for ideas, and I bet
most
of the dependency analysis could be ripped from the latter.
Hrrm, sadly Cabal has no dependency analysis at all - everything
must be specified by the author of
Tom Tobin korp...@korpios.com wrote:
Maybe it would be useful if Cabal had some sort of licensing check
command that could be run on a .cabal file, and warn an author if any
libraries it depends on (directly or indirectly) are GPL'd but the
.cabal itself does not have the license set to GPL.
Tom Hawkins tomahawk...@gmail.com wrote:
The debugger was not that helpful, so I may have to resort to this.
Is there any work being done to improve reporting for these type of
errors? It seems to be a fairly common problem.
http://hackage.haskell.org/trac/ghc/wiki/ExplicitCallStack
--
Donn Cave d...@avvanta.com wrote:
I imagine I'm at fault somewhere in this, since I am also responsible
for the GHC port to Haiku, but just wondering if this suggests an
obvious course of inquiry to anyone. I assume it's not working as
intended, as from the documentation I would rather have
Eugene Dzhurinsky b...@redwerk.com wrote:
Hello!
I need to list all currently mounted filesystems and get some stats
like total space, free space, mount point and physical device.
Is there any library capable of obtaining such information from OS
itself? Parsing output of 'df' is
Andrew Coppin andrewcop...@btinternet.com wrote:
Ozgur Akgun wrote:
A humble suggestion: Have a *lazy* to list method for
your /lists, arrays, sets, etc./ and use the nice list-only version.
Yeah, that works quite nicely.
It won't work for arbitrarily complex structures, however. My
Jason Dagit da...@codersbase.com wrote:
My biggest fear is that of usability.
If I understand you correctly, then as you change module imports you
change the meaning of the code in potentially non-obvious ways. So
this isn't too different than using unqualified imports and flipping
John Ky newho...@gmail.com wrote:
Hi,
Currently I'm pretty printing code by building arrays of strings and
calling indent. For example:
instance JavaPrintableNamed AST.EnumeratedType where
javaLinesNamed parentName (AST.EnumeratedType memberDefinitions) =
[ public enum ++
Achim Schneider bars...@web.de wrote:
As for how to express it in code: I'd recommend a combination of a
State monad to track the indentation, and the underused[1] Applicative
interpretation of lists to concatenate stuff. = would function as
concatenation of lines, getting the state, while
Bulat Ziganshin bulat.zigans...@gmail.com wrote:
Hello Achim,
Thursday, May 28, 2009, 1:34:55 AM, you wrote:
Error: type of x is Integer
while type of read argument should be String
The problem with this is that the compiler can't know whether or not
the type of arguments to
John Dorsey hask...@colquitt.org wrote:
As another native English speaker, I found expected/inferred very
intuitive when I was new to GHC, and to Haskell. I even think that
expected/inferred helped me form my intuition about Haskell's type
inference.
First off, me too, and I'm not a native
Bulat Ziganshin bulat.zigans...@gmail.com wrote:
while we are here - i always had problems understanding what is
inferred and what is expected type. may be problem is just that i'm
not native speaker
The shape of the brick you are trying to push through a hole is
analysed (inferred) by the
Bulat Ziganshin bulat.zigans...@gmail.com wrote:
Error: type of x is Integer
while type of read argument should be String
The problem with this is that the compiler can't know whether or not
the type of arguments to read should be a String, as someone could
have messed up read's signature.
Conal Elliott co...@conal.net wrote:
I gather that some people are terribly uncomfortable
without certainty. If you take away their certainty, they demand an
immediate replacement!
This is a very important observation, vast areas of human psychology
can be explained in terms of feeling
Michael Mossey m...@alumni.caltech.edu wrote:
Based on a previous reply, I think some people think this sounds like
vapid cheerleading, but I think you would agree with me that life
(and software) always offers more possibilities when we engage our
imagination with hope and energy, not giving
wren ng thornton w...@freegeek.org wrote:
That is, the distinction between agglutinative vs
fusional is typological rather than theoretical.
Though yes, the distinction is most clearly observed by looking at
verbal inflections. And now we're really far off topic :)
No, we aren't. A couple
michael rice nowg...@yahoo.com wrote:
In the code below, is the type returned by the return functions
inferred from the result type in the function type signature, i.e.,
just change the result type to Maybe Int and the code will return a
Maybe monad, (Just 4), instead of a List monad?
Yes.
Conor McBride co...@strictlypositive.org wrote:
Remember folks: Missiles need miffy!
H. Iff you have something like CoPointed or Foldable, you can
thread your own, Applicative, tail back into yourself and decide what
you are by inspecting it.
That makes foldr the join of Hask itself, or
John Van Enk vane...@gmail.com wrote:
Which package?
More importantly, is it a recent version, that's still live? Does it
compile with ghc 5.2?
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying, hiring, renting,
Nathan Bloomfield nblo...@gmail.com wrote:
The greatest in gcd is not w.r.t. the canonical ordering on the
naturals; rather w.r.t. the partial order given by the divides
relation.
This, to defend myself, was not how it was explained in high school.
--
(c) this sig last receiving data
Steve stevech1...@yahoo.com.au wrote:
It is useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0 because then
the natural numbers become a complete distributive lattice with gcd
as meet and lcm as join operation. This extension of the definition
is also compatible with the generalization for
Neil Davies semanticphilosop...@googlemail.com wrote:
Ignoring, at least for the moment, all the issues of paging,
processor cache occupancy etc, what are the complexity drivers for
the time to GC?
It largely depends on the GC implementation, especially when you
interpret time to GC as time
Maurício briqueabra...@yahoo.com wrote:
bindings-agar
http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/51478
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying, hiring, renting,
performance and/or quoting of this
Jason Dusek jason.du...@gmail.com wrote:
2009/04/21 Manlio Perillo manlio_peri...@libero.it:
Luke Palmer ha scritto:
And many other permutations, with differing degrees of
laziness and parametericity.
As long as you stricly read a string from the socket, this is
ok. But you can not
Richard O'Keefe o...@cs.otago.ac.nz wrote:
I have never thought, stated, or implied, that only people
without superuser access count! It's just that I and for that
matter, the sysadmin I talk to most are heartily fed up with the
assumption that everyone is a sysadmin.
Yes, but I thought you
Xiao-Yong Jin xj2...@columbia.edu wrote:
Gwern Branwen gwe...@gmail.com writes:
I was cabalizing a package once, and I chucked into the
build-depends 'ghc' and made it build. About 30 seconds later, it
occurred to me that this was a geometry library and what the heck
was it doing with
Edward Middleton emiddle...@bebear.net wrote:
Could you add this[1] link too, because it highlights the problem with
user installs[1]. i.e. you either have to have root access to install
the dependencies, or install non-haskell dependencies in your home
directory.
Edward
1.
Daniel Fischer daniel.is.fisc...@web.de wrote:
Well, if it doesn't implement the full standard, perhaps it should
rather be called UVNABNQHC (Utrecht very nearly, almost but not quite
Haskell compiler)?
Ha! Haskell™!
I said it first, and rule that...
I don't care what you use the name for.
Maurício briqueabra...@yahoo.com wrote:
Maybe we could learn with them: what about if Haskell Weekly
News had a section on code review, like many newspapers have
book review sections?
The weekly WTF?
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright
Tillmann Rendel ren...@cs.au.dk wrote:
Hi Claus,
thanks for your elaborations. I'm still not convinced that a common
name (e.g. TT :. Tr :. Tu :. Te) is a better interface than a common
import (e.g. TypeLevel.Bool.True). In both cases, the authors of all
modules have to actively
Richard O'Keefe o...@cs.otago.ac.nz wrote:
On 21 Apr 2009, at 11:36 pm, Achim Schneider wrote:
Richard O'Keefe o...@cs.otago.ac.nz wrote:
Some of the right questions are
- how many potential whatever users would need to have
whatever installed on _some_ machine they do
Claus Reinke claus.rei...@talk21.com wrote:
[...]
+1. That, and better error messages: A Verbose-Consequences flag in the
config (on by default), resulting in strings like Binaries have been
installed to $HOME/.cabal/bin and _not_ symlinked. $HOME/.cabal/bin is
not in your $PATH: You will not
Richard O'Keefe et all wrote:
[n+k patterns]
I'd like to add my two cents: Assuming that UHC's roadmap strives to be
H'-compilant in the future, and n+k patterns aren't going to be in H',
why bother implementing them?
Also, assuming that current H98 code will be ported to H', shouldn't
n+k
Jason Dusek jason.du...@gmail.com wrote:
Really, the whole thing makes me wish we had blasphemy laws.
If any person, in speaking or in writing, shall indicate
a preference for column widths other than 80 or indent
characters other than spaces (`0x20`) they shall be
michael rice nowg...@yahoo.com wrote:
OK, I changed the operator from () to (~). When I try to use it I
get this:
[mich...@localhost ~]$ ghci rand
GHCi, version 6.10.1: http://www.haskell.org/ghc/__ :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer ...
Thomas Davie tom.da...@gmail.com wrote:
There seems to be an assumption amongst the community that a user's
home directory is the most useful place for cabal to install to by
default. A few people have challenged that. I wanted to find out
which one most people do actually prefer, so
Richard O'Keefe o...@cs.otago.ac.nz wrote:
This is good advice (/usr/local is fine though).
Actually, no, it isn't.
To start with, these days it's chock full of stuff
which is hardly less critical for system operation
than anything you'll find in /bin.
More importantly, /usr/local is a
Edward Middleton emiddle...@bebear.net wrote:
ghc 6.8.3 is /usr/bin/ghc on my office Mac, but nothing in the world
prevents there being some other program called ghc that would also
like to be there. Only by painstaking verification of a whole
bunch of applications together can one be
Richard O'Keefe o...@cs.otago.ac.nz wrote:
Some of the right questions are
- how many potential whatever users would need to have
whatever installed on _some_ machine they do NOT have
administrator access to?
Irrelevant.
- if people find Mac and Windows installers that show you
Edward Middleton emiddle...@bebear.net wrote:
Achim Schneider wrote:
Edward Middleton emiddle...@bebear.net wrote:
ghc 6.8.3 is /usr/bin/ghc on my office Mac, but nothing in the
world prevents there being some other program called ghc that
would also like to be there. Only
Dusan Kolar ko...@fit.vutbr.cz wrote:
Dear all,
reading that
according the several style guides, lines shouldn't be too long
(longer than 78 characters).
http://www.cs.caltech.edu/courses/cs11/material/haskell/misc/haskell_style_guide.html
Lennart Augustsson lenn...@augustsson.net wrote:
On Sun, Apr 19, 2009 at 10:43 PM, Peter Verswyvelen
bugf...@gmail.com wrote:
For example, suppose you have a predicate a - Bool, and a list of
these predicates [a - Bool], but you want to remove all functions
that are obviously equal in the
Christian Maeder christian.mae...@dfki.de wrote:
[...]
All very fine, but what about simply moving code into a top-level
binding or a function-level let/where?
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying, hiring,
Don Stewart d...@galois.com wrote:
This means that 'cabal
install' works out of the box on every system, without needing
admin/root privs (esp. important for students).
...and people who were bitten by sanity and thus never, ever touch /usr
manually, only through their distribution's package
Jon Fairbairn jon.fairba...@cl.cam.ac.uk wrote:
a...@cs.uu.nl writes:
Utrecht Haskell Compiler -- first release, version 1.0.0
The UHC team is happy to announce the first public release of the
Utrecht Haskell
Peter Verswyvelen bugf...@gmail.com wrote:
Sometimes I do miss the pragmatic C solution:- two function pointers
that are equal surely represent the same functions (although in C
nothing is really sure ;)
In haskell, they would, but C doesn't give you the same guarantee:
int evil = 0;
int
Antoine Latter aslat...@gmail.com wrote:
On Sat, Apr 18, 2009 at 4:38 PM, Thomas Davie tom.da...@gmail.com
wrote:
This looks like the same error I got ___ see bug report 1 in the bug
database ___ the configure script reports that you have uuagc even if
you don't ___ cabal install it,
Eugene Kirpichov ekirpic...@gmail.com wrote:
The parameterless version is a top-level definition and won't get
garbage-collected, IIRC.
So, if you evaluate primes!!1000, you'll end up with a
1000-element list hanging in memory forever.
If you evaluate (primes' ()) !! 1000, you
Jason Dusek jason.du...@gmail.com wrote:
2009/04/16 Achim Schneider bars...@web.de:
{-# CAF foo #-}
{-# NOCAF foo #-}
Where do I find docs for these pragmas?
...in your friendly bug tracker, under the label missing feature
--
(c) this sig last receiving data processing entity
Patai Gergely patai_gerg...@fastmail.fm wrote:
...
I don't think using dirty tricks to implement FRP deserves flak, at
all, from my POV, it sounds like complaining that the IO monad is
implemented using C... meaning that if you're that close to bare
thunks, you have every right to use any means
Jeff Wheeler j...@nokrev.com wrote:
As one of the Yi developers, I'd love to hear some more specific
feedback on this. Do you remember any specific Vim features that were
missing?
Nope, but I'll be writing bug reports next time, at the very least.
--
(c) this sig last receiving data
Patai Gergely patai_gerg...@fastmail.fm wrote:
Am I right thinking that the
NOINLINE pragma on unsafeDupablePerformIO prevents the problem of
multiple evaluation discussed yesterday?
From what I know and experienced, yes. Each individual unsafePerformIO
only ever evaluates its action once,
David Carter david.m.car...@gmail.com wrote:
I then thought I might work around the problem by converting lazy
ByteStrings to strict ones in order to do the regex match.
strictBS :: LB.ByteString - B.ByteString
strictBS = B.concat . LB.toChunks
lazyBS :: B.ByteString - LB.ByteString
lazyBS =
Peter Verswyvelen bugf...@gmail.com wrote:
The reason why I'm talking about examples and not semantics is
because the latter seems to be pretty hard to get right for FRP?
There's a difference between those two? I've heard much, but never
anyone complaining about specifications overlapping in a
Richard O'Keefe o...@cs.otago.ac.nz wrote:
If you have a low level of trust, you'll need a great level of
detail, and it still won't help.
Heh. Keep your friends close, your enemies closer.
Freelancing, I was always paid per hour, not per feature. From my
experience, writing something like
FFT fft1...@gmail.com wrote:
Has anyone tried Yi?
Yes, and I figured I'd have to edit the keymap to get productive. While
it features a fully functional subset of vim that's more than enough to
efficiently edit files, it's not the subset I use... and then I was too
lazy to actually do it.
Melanie_Green jac_legend_...@hotmail.com wrote:
Hi I would like to follow the crowd and find out what text editor
everyone uses for haskell on windows.
Have you considered using leksah? While it doesn't focus on being an
editor, it's still a darn fine way to edit Haskell.
--
(c) this sig
rodrigo.bonifacio rodrigo.bonifa...@uol.com.br wrote:
Dear Sirs,
I guess this is a very simple question. How can I convert IO
[XmlTree] to just a list of XmlTree?
unsafeCoerce.
Seriously, you just don't, you weld stuff together using =. It takes
an 'IO a' and a function 'a - IO b' and
Cristiano Paris fr...@theshire.org wrote:
I was a bit surprised by the strong reaction about my citation of
unsafePerformIO. Maybe it'd useful, for the future, to write a
document explaining how to help newbies properly, maybe putting it in
the mailing list charter.
1) Tell them about
John Smith smithsno...@gmail.com wrote:
Yes, I see. Good points in both answers, but I still would like to see
how to do it with the mutable hash, if possible...
test = do
h - H.new (==) id
h1 - H.new (==) id
H.insert h 3 h1
H.insert h1 1 1000
inner - H.lookup h 3
case
minh thu not...@gmail.com wrote:
On a related note, I have another question. Say we have some data
structure, for instance a list, some functions on this data structure
(probably defined with some well known functions, such as map or
fold), and a program using them. Is there any research
minh thu not...@gmail.com wrote:
But for some functions, it can be seen clearly that such information
could have been constructed at the same time that the data structure.
So it is related to fusion techniques, but with the additional
possibility of adding fields to the original data
J__rgen Nicklisch-Franken j...@arcor.de wrote:
So I please the members of the community to pause for a moment and try
out Leksah with a benevolent attitude.
I did (the previous version, tbh), and couldn't find anything to
seriously bicker about... a few problems regarding metadata generation,
Henning Thielemann schlepp...@henning-thielemann.de wrote:
Actually, I really object to have exception handling built into IO
monad.
I couldn't agree more. If I want to write non-recovering code, I can
always just say
(Right foo) - readLine
, and hope that the RTS is smart enough to print
Peter Verswyvelen bugf...@gmail.com wrote:
To me, any version control system should be able to track dependencies
between repositories. Something similar like Cabal's dependency
system.
So my question is really, how do you solve the dependency tracking
between several Darcs repositories?
Colin Adams colinpaulad...@googlemail.com wrote:
2009/3/27 Achim Schneider bars...@web.de:
wren ng thornton w...@freegeek.org wrote:
Colin Adams wrote:
A reference to a research paper is fine to show where the ideas
came from, but that is not where the library documentation
should
wren ng thornton w...@freegeek.org wrote:
Colin Adams wrote:
2009/3/25 wren ng thornton w...@freegeek.org:
when I look up the Haddock-generated documentation for a function, I
DON'T appreciate it if that is in the form of a hyperlink to a
research paper.
And that occurs in several of
Alberto G. Corona agocor...@gmail.com wrote:
However, reusability of source code and maintainability has never
been taken seriously by haskell programmers, simply because there are
no industrial projects in Haskell with dozens of people with
different skills that come and go.
Now that's a
Manlio Perillo manlio_peri...@libero.it wrote:
Should I fill a feature request ticket, or this is how it is supposed
to work?
I would like to be able to do that, too. I also don't want cabal to
recompile a thousand modules just for a demo program, and don't want to
see hackage being polluted
Manlio Perillo manlio_peri...@libero.it wrote:
The main problem, here, is that:
- recursion and pattern matching are explained in every tutorial about
functional programming and Haskell.
This is the reason why I find them more natural.
Well, you're going to have a hard time writing
Rohit Agrawalla son...@gmail.com wrote:
I am a beginner haskell programmer. I am interested in data
structures implementation (all from basic ones like stack, queues
etc. to advance ones like balanced binary trees, graphs etc.) in
haskell. It would be really helpful if someone can point
wren ng thornton w...@freegeek.org wrote:
All natural languages are Thinking-complete.
No, they aren't. Falsifying the Saphir-Worph thesis, I quite often find
myself incapable of expressing a certain thought, or if I succeed,
come up with two or more versions in multiple different languages
Brettschneider, Matthias brettschnei...@hs-albsig.de wrote:
Thx for your hints, I played around with them and the performance
gets slightly better. But the major boost is still missing :)
I noticed, that one real bottleneck seems to be the conversion of the
array back into a list. The
John A. De Goes j...@n-brain.net wrote:
Go ahead sell your GPL application. I'll get your code, build the
application, and sell it for less than half of what you're selling
it for.
I don't think you can go below 0.79 in the Apple store, and I guess
you'll have a hard time convincing
John A. De Goes j...@n-brain.net wrote:
You simply can't make a living selling GPL software. If the
software's complicated enough and you know your way around it, then
you can sell support maintenance. However, those conditions doesn't
apply to consumer software, because consumers don't want
Eelco Lempsink ee...@lempsink.nl wrote:
My preference
would be to have one person with sense of (and education in, if
possible) design make some nice looking variations and have a second
(final) round of voting, but, we could also do the wiki-thing again ;)
That was the plan, yes.
Manlio Perillo manlio_peri...@libero.it wrote:
Hi.
There is a limitation, in Haskell, that I'm not sure to understand.
Here is an example:
module Main where
divide :: Float - Float - Float
divide _ 0 = error division by 0
divide = (/)
main = do
print $ divide 1.0 0.0
print
Martijn van Steenbergen mart...@van.steenbergen.nl wrote:
f x y = bam x y
This would introduce another matching of x on the outside of bam, and I
don't know if this works without significantly messing with e.g.
strictness.
--
(c) this sig last receiving data processing entity. Inspect headers
Csaba Hruska csaba.hru...@gmail.com wrote:
svn checkout
*http*://lambdacube.googlecode.com/svn/trunk/lambdacube-read-only
I think you mean
svn co http://lambdacube.googlecode.com/svn/trunk
I didn't do anything yet, except running the sample program. I get to
see an ogre head and this:
8
Csaba Hruska csaba.hru...@gmail.com wrote:
I _think_ example1 is killed by SIGABRT, but I could be wrong, I've
never seen this before. Anyway, it's a strange thing.
Does the program exit immediatly after the first rendered frame?
Usually yes, sometimes I'm seeing the ogre being rotated
Colin Adams colinpaulad...@googlemail.com wrote:
-DNDEBUG -g -fwrapv -O3 -Wall -Wstrict-prototypes -I/opt/local/include
-I/opt/local/Library/Frameworks/Python.framework/Versions/2.5/include/python2.5
-c _hashopenssl.c -o build/temp.macosx-10.3-i386-2.5/_hashopenssl.o
unable to execute
Colin Paul Adams co...@colina.demon.co.uk wrote:
Why does cabal install nearly everything in the user repository rather
than the global repository?
uh... because you're a mere user and don't have the rights to do so?
try su -, then cabal update to fill root's $HOME/.cabal with the
needed
Colin Paul Adams co...@colina.demon.co.uk wrote:
Achim uh... because you're a mere user and don't have the rights
Achim to do so?
No, I own the machine.
Well, but it neither knows nor cares, unless you log in as root.
colin isn't allowed to write to /usr/local/lib/ghc-6.11.20090319/
Colin Paul Adams co...@colina.demon.co.uk wrote:
So why doesn't it find packages then, when they are installed?
I've got no idea, what exactly are you trying to do, and how?
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved.
Anonymous Anonymous temp.pub...@gmail.com wrote:
Hello,
I'm new to haskell, I'm wondering how can you write a function that
will do the following:
fromIntToString :: Int - String
this is a cast function to cast an Int to a String. I know such
function exist, however let's assume it
Achim Schneider bars...@web.de wrote:
Anonymous Anonymous temp.pub...@gmail.com wrote:
fromIntToString :: Int - String
intOfString = sum . map (uncurry (*)) . zip (map (10^) [0..])
. map intOfChar . reverse
/me hides under a stone and tries again, this time
1 - 100 of 528 matches
Mail list logo
