- Haskell-Cafe - Haskell.org

RE: [Haskell-cafe] looking for optimization advice
by Simon Marlow 29 Mar '04

29 Mar '04

> I think that adding the extra check to see if the pointers > are identical > sped this up enough that it's probably no longer a major > issue--I'm pretty > certain that the problem was large strings that were > identical, so every > byte had to be checked, so probably scary non-portable home-made > ForeignPtrs would not be worth the effort. (Although I'm > somewhat curious as to how it would be done...) A ForeignPtr allocated with mallocForeignPtr in GHC is heap-allocated garbage-collectable storage, and doesn't need a finalizer. The other kind of ForeignPtr created with newForeignPtr is associated with some external storage and needs a finalizer. Finalizers are expensive, and so is malloc(), but mallocForeignPtr is very cheap. This gives rise to a sum-type in the implementation of ForeignPtr: see the source code (libraries/base/GHC/ForeignPtr.hs). You could make a specialised version by ripping out the non-malloc ForeignPtr bits, and make an unboxable ForeignPtr type. A mallocForeignPtr-style ForeignPtr is essentially the same as an IOUArray. In fact, the underlying implementation type is the same (MutableByteArray#), except that a ForeignPtr is allocated in pinned (immovable) storage so that it can be passed to foreign functions. There could easily be a conversion from a "malloc" ForeignPtr to IOUArray. There is also some overlap with the StorableArray type. A StorableArray has a ForeignPtr inside it. It really looks like the framework could be simplified here, but I remember putting some thought into it and not coming up with a simple solution. Cheers, Simon

1 0

dimension of arrays
by Fred Nicolier 29 Mar '04

29 Mar '04

Is there a way to get the number of dimension of an array ? i.e. something like : >dims :: (Ix a) => Array a b -> Int >dims = ... >a = listArray (1,10) [1,2..] >b = listArray ((1,1),(10,10)) [1,2..] >dims a -- should be equal to 1 >dims b -- should be equal to 2 The key is somewhere in the Ix class but where ? Fred -- ------------------------------------------------------- Dr. Frederic Nicolier Maitre de conferences, laboratoire LAM - URCA Animateur du projet ANITA : http://f.nicolier.free.fr/recherches/ Dept. GE&II, IUT de Troyes 9 rue de Quebec 10026 Troyes Cedex Tel: 03 25 42 71 01 Std: 03 25 42 46 46 Fax: 03 25 42 46 43 email: f.nicolier(a)iut-troyes.univ-reims.fr ---------------------------------------------------------

2 2

HToolkit HSQL on Windows/GHC
by ATWOOD,JOHN (HP-Corvallis,ex1) 29 Mar '04

29 Mar '04

Clive, I see that HaskellDb requires htoolkit, so that's no help. Doesn't MySql listen on a port? Is that protocol documented? I've used postgresql that way from Haskell. Another thought, which I hesitate to even mention, would be to call the commandline tool via System.Cmd, pipe the results to a file, and read the file, and parse the results. Slow and ugly, but you could have it working in an hour. Seems like we could even use the higher level abstractions of HSQL or HaskellDB, but sub in this SlowAndUglyButPortable for the lower level access. John >From: "Clive Brettingham-Moore" <c(a)brettingham-moore.net> >Subject: [Haskell-cafe] HToolkit HSQL on Windows/GHC >To: <haskell-cafe(a)haskell.org> > >I realise that this is a little technical for this list, but I thought >that I'd check here before starting on the hard-core lists. > >Is there an easy way to build the HToolkit HSQL library for GHC (6.0.1 when >I >tried, 6.2.1 now) on windows (particularly MySQL/Windows XP, but I wont >say no to postgres, ODBC & sqlite)? >I assume people have tired and succeded, but I got lost [I think] in the >nasty place between the unix/cygwin libraries in GHC and the Windows focus >of the compiled MySQL client library. > >Since haskell is mainly a hobby for me, and I don't have a lot of free >time I haven't dug very deep, but not being able to interface my two of my >favourite constructs (functional programming and relational databases) is >getting to me. > >So any takers? > >C

4 3

operating on nested monads
by Marco Righele 29 Mar '04

29 Mar '04

Hello everyone, I have some operations that have to be done in sequence, with each one having the result of the previous as input. They can fail, so they have signature a -> Maybe b Checking for error can be quite tedious so I use monadic operations: f :: a -> Maybe b do y <- foo x z <- boo y moo z The problems arise when I try to do the same thing within the IO Monad, i.e. the functions have signature a->IO (Maybe b) How can I achieve the same effect (if it is ever possible)? I feel like it should be something almost trivial, but I really can't get it. Thanks Marco

4 3

RE: [Haskell-cafe] looking for optimization advice
by MR K P SCHUPKE 27 Mar '04

27 Mar '04

Would it ba faster to store the strings as UArrays and do the comparison in Haskell? Regards, Keean.

2 1

Re: [Haskell-cafe] operating on nested monads
by MR K P SCHUPKE 27 Mar '04

27 Mar '04

For operating on nested monads is do: declare a class MonadIO which contains the IO functions along with monad monad-transformer lifted versions, for example: class Monad m => MonadIO m where ioPrint :: Show a => a -> m () instance MonadIO IO where ioPrint = print instance (MonadIO m,MonadT t m) => MonadIO (t m) where ioPrint = up . ioPrint where MonadT is defined: class (Monad m,Monad (t m)) => MonadT t m where up :: m a -> t m a down :: t m a -> m a instance Runnable (m a) (m a) where run = id instance (Monad m,Monad n,MonadT t m,Runnable (m a) (n a)) => Runnable (t m a) (n a) where run = run . down instance (Monad m,MonadT t m,Monad (t m)) => Runnable (t m a) (m a) where run = down You can then define MonadMaybe similarly... you end up with code like: test :: (MonadIO m,MonadMaybe m) => m a test = do ioPrint "something" c <- ioGetChar -- note: c is automatically lifted into MonadMaybe by -- MonadMaybe's definition of up in class MonadT return Nothing Then to call it you must specify the stacking: main :: IO () main = do case run (test :: MonadMaybeT MonadIO Char) of Just x -> print x Nothing -> print "NOTHING" I have not defined MonadMaybeT here... but its fairly straightforward. Regards, Keean.

1 0

Extreme Markup Languages Conference 2004
by srn＠coolheads.com 26 Mar '04

26 Mar '04

Two kinds of information are necessary for human life on this planet: (1) Genetic information. No batteries required. (2) Everything else, i.e., civilization. Batteries required. Please be welcome to participate in the 11th annual Extreme Markup Languages Conference --> August 2-6, 2004 <-- Hotel Europa Montreal, Canada www.extrememarkup.com As always, it's a family gathering for rubber-meets-the-road technical luminaries interested in doing a better job of supporting civilization. Come share your light, and be brightened, too. You'll be glad you did, and not only because Montreal in August is great fun. Peer-reviewed paper submissions are due --> April 16, 2004 <-- Submission guidelines: http://www.mulberrytech.com/Extreme (e-mail questions to extreme(a)mulberrytech.com) Peer Reviewer Applications are due TODAY, Friday March 26, 2004. Tutorial Proposals are due TODAY, Friday March 26, 2004. -- Steve Steven R. Newcomb, Co-chair Extreme Markup Languages 2004 -- An IDEAlliance Event www.extrememarkup.com srn(a)coolheads.com ------------------------------------------------------- Coolheads Consulting http://www.coolheads.com direct: +1 540 951 9773 main: +1 540 951 9774 fax: +1 540 951 9775 208 Highview Drive Blacksburg, Virginia 24060 USA

1 0

RE: [Haskell-cafe] looking for optimization advice
by Simon Marlow 26 Mar '04

26 Mar '04

> > data PackedString = PS !(ForeignPtr Word8) !Int !Int A ForeignPtr is a sum type, so it can't be unboxed unfortunately. This is undoubtedly one cause of inefficiency in the code. Depending on how you're using ForeignPtrs, you could possibly define a specialiased kind of ForeignPtr that would be unboxable. This would require using low-level non-portable stuff though. Are you using mallocForeignPtr? Or adding extra finalizers to ForeignPtrs? Cheers, Simon

2 1

Implementing and indexing 2 dimen arrays
by Alex Gontcharov 25 Mar '04

25 Mar '04

I am writing a function, It's my first Haskell program in output function I will be working on [[3,4],[1,2,3,2],[3,9,9,4],[8,3,3,4] type structures I'd like to know how to index a particular element at run-time as I don't know on which element of which sublist I am at the moment in pullHelper function which starts with values !! ind p xs !! in C it would look something like values[][10]={{....}.{....}..}; int index[4]={3,4,6,7}; int i; i for(i = 0; i<4; i++) { int c = index[i]; if(values[i][c-1] == 0) /* do something */ else /*other things*/ } Any help would be appreciated --Stack for the digits of numbers, a modulo b, stack :: Int->Int->[[Int]] stack x y = reverse (split (subStack x y)) where --Split the digits further and constructs lists of lists split :: [Int]->[[Int]] split xs | length xs == 0 = [] | otherwise = (reverse (subStack (head xs) 10)): (split (tail xs)) subStack :: Int->Int->[Int] subStack x y | x == 0 = [] | otherwise = (mod x y):(subStack (div x y) y) -- It should work for 999999999 range but since I am using -- Int maximum is 2^31-1 output :: Int->[Char] output n = loop (stack n 10000) where -- goes through sets of at most 4 digits in the list, loop loop :: [[Int]]->[Char] loop xs | length xs == 0 = [] | otherwise = (strCon (head xs)) : (loop (tail xs)) strCon :: [Int]->[Char] strCon xs | length xs == 0 = [] | otherwise = (pullStr (head xs)) : (strCon (tail xs)) pullStr :: Int->[Char] pullStr s | s == 0 = [] | otherwise = pullHelper s --Helping to pull elements from the set, nested if pullHelper :: Int->[Char] pullHelper p | values !! ind p xs !! p - 1 == 0 = ones !! p - 1 ++ values !! ind p xs !! 0 | otherwise = values !! ind p xs !! p - 1 --Nasty !

3 2

zip comprehensions and local decls
by Christian Sievers 25 Mar '04

25 Mar '04

Hello! This is about a misconception I had about zip comprehensions and a possible extension to get the desired result. As zip compr. are implemented in hugs and in ghc (though I only tried hugs), I thought that haskell-cafe might be a good place for it. In hugs mode, I expected something like the following to work: [ (a,a*x) | x <- [1..5] | y <- [10..], let a=x+y ] but hugs says: ERROR - Undefined variable "x" I think I can see why: The expression is rewritten to [ (a,a*x) | (x,y) <- zip [ x | x<-[1..5] ] [ y | y <- [10..], let a=x+y ] ] This scheme is useful if one has ...|y<-list, let a=..., sometest a which drops some elements from the list before zipping. But it would be nice to have a way to drop already zipped tuples and to allow such usages of local declarations. Maybe a final '|' branch without generator, so to get what was intended with the expression above one might write [ (a,a*x) | x <- [1..5] | y <- [10..] | let a=x+y ] or, as another example, one could have [ (x,y) | x <- [1..5] | y <- [10..] | even x ] giving [(2,11),(4,13)]. So the idea is to rewrite [ e | oldstyle parallel list comprehension | declsandpreds ] to [ e | zipN <as before...> , declsandpreds ] Is this clear enough? Does it sound useful? Can you think of a nicer syntax? All the best Christian Sievers

1 0