Hello Lambda,
Monday, August 21, 2006, 1:20:26 AM, you wrote:
Greetings Haskellers,
I have recently found myself in a situation where I was needing to
general tuples of randomized things; in my case, two coordinates and
a custom data type, Direction. As it is always better to
On 8/19/06, Henk-Jan van Tuyl [EMAIL PROTECTED] wrote:
Or you could use:
putStrLn [head This and that]
Gotta say I really like this ... running the head function inside of the list...
Okay so I can really learn something here... what would that look like
in raw monadic notation?
using
yumagene:
On 8/19/06, Henk-Jan van Tuyl [EMAIL PROTECTED] wrote:
Or you could use:
putStrLn [head This and that]
Gotta say I really like this ... running the head function inside of the
list...
Okay so I can really learn something here... what would that look like
in raw monadic
Lennart and all,
On 8/19/06, Lennart Augustsson [EMAIL PROTECTED] wrote:
There are much better ways than storing strings on the stack.
Like using a data type with constructors for the different types that
you can store.
-- Lennart
Off topic, but this is important info for me!
From: Jared Updike [mailto:[EMAIL PROTECTED]
Ian's LCS code looks like it works fine in terms of space usage, but
for large input (lengrh as == 4, length bs == 5) it seems to
be way too slow in terms of time complexity (GNU sdiff executes on
this same data in a few seconds, the
Hi all,First, thanks Daan for offering to stay involved. I'd much prefer to have you working on the project in whatever capacity is possible for you - as the main architect and the person with most knowledge of the wxHaskell implementation, this will be invaluable.
Second thing, for those who are
Hi Shelarcy,Thanks for volunteering to work on the Windows port. What I'd like to ask is this: we need someone to maintain the Windows port.I think, in practice, that this would mean maintaining the Windows build files (which should, generally, be a fairly straightforward job) as well as building
On 2006 August 21 Monday 04:42, Gene A wrote:
but can you have
a list of type [Num] ?? I thought that it had to be the base types of
Int, Integer, Float, Double etc.. No?
See http://www.haskell.org/hawiki/ExistentialTypes
___
Haskell-Cafe mailing
Hello Gene,
Monday, August 21, 2006, 12:42:17 PM, you wrote:
being able to use +,* on any of the numeric types... but can you have
a list of type [Num] ?? I thought that it had to be the base types of
Int, Integer, Float, Double etc.. No?
you can, using existentials:
data Number = forall
Hello Brian,
Friday, August 18, 2006, 8:54:08 PM, you wrote:
classes: lack of record extension mechanisms (such at that implemented
in O'Haskell) and therefore inability to reuse operation
implementation in an derived data type...
You can reuse ops in a derived data type but it involves a
Hi,
I'm trying to write out a binary file, in particular I want the
following functions:
hPutInt :: Handle - Int - IO ()
hGetInt :: Handle - IO Int
For the purposes of these functions, Int = 32 bits, and its got to
roundtrip - Put then Get must be the same.
How would I do this? I see Ptr,
I don't know exactly what types you have as base types in your
implementation, but here's a small code fragment that of what I had
in mind.
data Value = D Double | S String | B Bool
type Stack = [Value]
-- Add top stack elements
plus :: Stack - Stack
plus (D x : D y : vs) = D (x+y) : vs
On Sun, 20 Aug 2006, Neil Mitchell wrote:
Hi,
I want to generate documentation for the base libraries, so I darcs
get the base libraries, and a very basic (the sample default)
Setup.hs, and try:
runhaskell Setup configure
runhaskell Setup build
Pretty much no luck, but I'll leave
Hi
haddock.exe: Main.all_subs_of_qname: unexpected unqual'd name:IOMode
Sometimes such an error is a Haddock problem, sometimes one of the
'unliterate' procedure in Cabal. Does the problem remain if you start
Haddock manually, maybe on manually unliterated modules?
Base is a bit too big and
Neil Mitchell wrote:
I'm trying to write out a binary file, in particular I want the
following functions:
hPutInt :: Handle - Int - IO ()
hGetInt :: Handle - IO Int
For the purposes of these functions, Int = 32 bits, and its got to
roundtrip - Put then Get must be the same.
How
Hi
hPutInt h = hPutStr h . map chr . map (0xff ..)
. take 4 . iterate (`shiftR` 8)
hGetInt h = replicateM 4 (hGetChar h) =
return . foldr (\i d - i `shiftL` 8 .|. ord d) 0
This of course assumes that a Char is read/written as a single low-order
byte without
Hi,
I note that in the base libraries, Data.Array.Diff is defined as:
type DiffArray = IOToDiffArray IOArray
However, IOToDiffArray takes 3 parameters.
I thought this was not allowed in Haskell 98? Its annoying from my
point of view because Hoogle wants to know the arity of a type, and if
it
Hi All,
I got up this morning {after not much sleep} to find these very
helpful suggestions/comments:
from Scott Turner:
{... See: http://www.haskell.org/hawiki/ExistentialTypes ...}
From Bulat Ziganshin:
{...
you can read recent discussion on this in this topic, or look at
This might be easier:
Prelude putStrLn $ return $ head this and that
t
Prelude
Gene A wrote:
The thread on the use of show and print to display an Int value,
brought up a problem I had early on... the one of cleanly displaying a
Char value, on a line all by itself.. My first attempts:
This
hi,
Now, is there a speed or cleaness of code advantage to using the
function composition method using (.) :
putStrLn . return . head $ This and that
over the application method...using ($):
putStrLn $ return $ head this and that
some thoughts on that ... they both work.. but any advantage
On 8/20/06, Brian Hulley [EMAIL PROTECTED]
wrote:
Henning Thielemann wrote: On Thu, 17 Aug 2006, Brian Smith wrote: I find it strange that right now almost every Haskell program directly or indirectly (through FPTOOLS) depends on CPP, yet there
is no effort to replace CPP with something better
Simon,I am familiar with the GHC library as I had used it a year or so ago to create a very cheap Haddock knockoff. I used the GHC library to do the type inference (which Haddock didn't do at the time) and to deal with elements that didn't have source code available. I remember that I created it
22 matches
Mail list logo
