- Beginners - Haskell.org

How to initialize a C struct with FFI
by Marco De Oliveira 06 Feb '10

06 Feb '10

Hi, I try to initialize a C struct using the FFI API and ghc stays blocked when I execute my code (and I got sometimes the error "out of memory"). I do not understand, I do not find any mistake in my code: {-# OPTIONS -XTypeSynonymInstances #-} import Foreign.C.Types import Foreign.Marshal.Alloc import Foreign.Ptr import Foreign.Storable type CStruct = (CULong, CULong) instance Storable CStruct where sizeOf _ = 2*sizeOf (undefined::CULong) alignment _ = alignment (undefined::CULong) test = alloca (\pStruct -> do poke pStruct ( (fromIntegral 1)::CULong, (fromIntegral 1)::CULong ) ) Thanks for your help. Marco

2 3

Re: [Haskell-beginners] Just clarifying the "pred" and "succ" functions in Haskell
by Brandon S. Allbery KF8NH 06 Feb '10

06 Feb '10

Andy Elvey wrote: > So, I may look at doing what I would call "lpred" and lsucc" - the > predecessor and successor of a list element. I'm somewhat surprised > that (from what I can tell) Haskell doesn't seem to have those two > functions for a list. I may be wrong.... Again, lists don't work that way; a list in Haskell is a single immutable object, you can pull items from it using (!!), head, etc., but you can't have a pointer into the "middle" of a list. You can have a sublist (for example, `tail ["foo", "bar", "baz"]' = `["bar", "baz"]') --- but you can't get from there to the "foo", as it isn't part of that new list. (This despite the fact that what `tail' gives you is going to be shared in actual storage with the original list. You don't have a backpointer into that original list to follow.) This is actually a feature of the Haskell model: it's usually easier to reason about these kinds of structures, where you can treat any operation as producing a new object and the Haskell compiler takes care of optimizations for you (shared representations, possibly recognizing that it can quietly do an update-in-place because you can't possibly reach the old value, etc.). You may want to take a look at the Seq type defined in the Data.Seq module, though; you have a `view' (what you can think of as a cursor) on a given Seq which can be moved back and forth. -- brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery(a)kf8nh.com system administrator [openafs,heimdal,too many hats] allbery(a)ece.cmu.edu electrical and computer engineering, carnegie mellon university KF8NH

3 2

Typeclass problems
by Patrick LeBoutillier 06 Feb '10

06 Feb '10

Hi all, I've written a small type class that is meant to behave a bit like Show: class Show a => Echo a where echo :: a -> String echoList :: [a] -> String echoListSep :: a -> String echo = show echoListSep _ = " " echoList [] = "" echoList [x] = echo x echoList (x:xs) = echo x ++ echoListSep x ++ echoList xs instance Echo Char where echo c = [c] echoListSep _ = "" instance Echo a => Echo [a] where echo = echoList instance Echo Int where instance Echo Integer where instance Echo Double where instance Echo Float where gen = map (const 1) f xs = map echo $ gen xs However the code doesn't compile on the last line. But it does compile if I replace 'echo' with 'show'. What's missing to make my typeclass behave like Show and accept input of any type (besides all the missing instances...)? I looked at the code for Show but I didn't see anything that looked "magical"... Thanks, Patrick -- ===================== Patrick LeBoutillier Rosemère, Québec, Canada

3 3

Just clarifying the "pred" and "succ" functions in Haskell
by Andy Elvey 06 Feb '10

06 Feb '10

Hi all - I'm doing a public-domain package of "functional" programs" in C, and that involves trying to replicate (in C) a number of Haskell functions. The two that I'm looking at now are "pred" and "succ". I've seen the examples on zvon.org, which give "pred 5" as being 4, and "pred B" as being "A". Ok, that's fine, no problem. However, is my understanding correct that this can be extended to lists (arrays in C) so that (for example) for a list ["foo", "bar", "baz"] , "pred "bar" " would give you "foo" , and "succ "bar" " would give you "baz"? Thanks in advance - bye for now - - Andy

2 2

Re: Fast tree manipulation
by Gabi 05 Feb '10

05 Feb '10

Hi Heinrich, I didn't see any mature zipper libraries to efficiently manipulate trees. Can you point me to any mature libs ? Aside from that, there are many reasons why I would represent trees using sequence. The major one is that many GA operations like 2 point crossover and mutation are trivial if we represent the genome in vectors or sequence instead of trees. The downside is the cost of the translation of sequences back to trees. -- Regards, Gabi http://bugspy.net

2 1

Simulation of interconnect network
by Roger King 05 Feb '10

05 Feb '10

I am building a simulator for an interconnect network for a multiprocessor computer. I would like to develop it in Haskell as an opportunity to learn Haskell. The network will have a number of routers with input ports and output ports and crossbars between them. I would like to simulate the protocol. This would be an event driven simulator. It would be at a high level, leaving out many details. I would like it to be fast and be able to run it on several processors. I would like to know if you have any advice. Has anyone done this before? Are there any discrete event simulators written in Haskell? R

2 1

show vs. Data.ByteString.Char8.unpack for ByteString
by Hong Yang 04 Feb '10

04 Feb '10

Hi, What is the difference between show and unpack when the function arguments are of ByteString type? I thought they are the same, but they are not interchangeable at compile time. Thanks, Hong

3 2

Circular Linked Lists
by Matthew J. Williams 04 Feb '10

04 Feb '10

Dear All How would one mimic, in Haskell, a C++ circular linked list i.e., where the last element precedes (points to) the first? Sincerely Matthew J. Williams

10 20

Fast tree manipulation
by Gabi 04 Feb '10

04 Feb '10

Maybe Data.Sequence is a good option. Seems to be designed to give good performance when mutating If trees could be represented using Data.Sequence, I think that tree manipulation performance would be bearable. Any other libraries that might be useful? -- Regards, Gabi http://bugspy.net

2 1

wanto post haskell question
by 조광래 04 Feb '10

04 Feb '10

hi I have a question about haskell coding. Matrices One of many ways to define matrices in Haskell is the list of matrix rows, where a row is a list of double precision oating point numbers: type Matrix=[[Double]] Using this type you should define the following functions (definition of dim is given as an inspirational example). dim :: Matrix -> (Int,Int) --returns matrix dimension (number of rows and columns) dim m = if (not.isMatrix) m then error "Not a matrix" else (length m, length (head m)) isMatrix :: Matrix -> Bool --checks whether all rows have the same length isMatrix m = and [length (head m) == length a | a <- m] I have done upto here and I am stuck on multSM. multSM :: Double -> Matrix -> Matrix --multiplies a scalar and a matrix when I do: multSM d m = [[(b*a)| b<-[d], a<-(head m)]] or [map (*d) (head m)] ...I get (using Hugs): Main> multSM 3 [[2,3,4],[1,3,4],[6,3,0]] [[6.0,9.0,12.0]] So I solve 3 [2,3,4] but I do not know how to get the rest 3 [[1,3,4],[6,3,0]. Please help me on this problem.

2 1