- Haskell-Cafe - Haskell.org

Is there a program to check if a matrix is totally unimodular?
by KC 08 Aug '11

08 Aug '11

-- -- Regards, KC

2 1

Re: [Haskell-cafe] [Haskell-beginners] Conciseness question
by KC 08 Aug '11

08 Aug '11

Sorry, I haven't read all the replies so I don't know if you have completely described the problem you're trying to solve; however, it might be better for people in future to say they want O(1) for insertions, O(lg n) for searching, etc. If they don't want to completely describe what their problem is. -- -- Regards, KC

1 0

Scalable Erlang PostDoc and 2 PhD Studentships
by Trinder, Philip W 08 Aug '11

08 Aug '11

The RELEASE project - A High-level Paradigm for Reliable Large-scale Server Software - is funded by the EU Framework 7 programme for 36 months from October 2011. Its aim is to scale the radical concurrency-oriented programming paradigm to build reliable general-purpose software, such as server-based systems, on massively parallel machines (100 000 cores). We seek * A post-doctoral researcher, and * Two part-time PhD students all working in the area of scalable programming language design, implementation, and evaluation. Further information on each post is attached. Phil -------------------------------------------- Phil Trinder School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh, EH14 4AS E: P.W.Trinder(a)hw.ac.uk T: +44 (0)131 451 3435 F: +44 (0)131 451 3327 I: www.macs.hw.ac.uk/~trinder -- Heriot-Watt University is a Scottish charity registered under charity number SC000278.

1 0

Re: [Haskell-cafe] Github support for cabal files
by Greg Weber 08 Aug '11

08 Aug '11

I think the haddock description field is a great barrior to documentation. I don't want to clutter my cabal file with lengthy documentation. Michael Snoyberg and I could not figure out how to document the Hamlet syntax because there is no way (as far as I know) to have literal unescaped, uninterpreted text. [1] When I go to a github repo, I expect that I can scroll down to the README and I will get a good overview. When I go to hackage, I expect nothing more than a synopsis, and I hope I can follow several links to find the information I am looking for. It is suggested that the description field should point to a top level module with all the documentation, but although haddock is good for documenting code, it is not an ideal overview style, and not all packages lend themselves well to having one top-level module. I would like a description field that just points to an external (README) file. Cabal could either use the pandoc library, or to avoid that dependency directly it could use the pandoc executable (that would have to be installed first by those of us that want this feature). Alternatively it could just allow an html file for the description and make me responsible for writing a script that runs pandoc and then invokes sdist. [1] http://hackage.haskell.org/package/hamlet

4 3

Simple Parsec example
by michael rice 08 Aug '11

08 Aug '11

What other imports must I add to get this to run. I can't seem to get it right. Michael ========= import Text.ParserCombinators.Parsec.Prim main = case (parse numbers "" "11, 2, 43") of Left err -> print err Right xs -> print (sum xs) numbers = commaSep integer ============== [michael@sabal ~]$ ghc --make parsetest.hs[1 of 1] Compiling Main ( parsetest.hs, parsetest.o ) parsetest.hs:7:11: Not in scope: `commaSep' parsetest.hs:7:20: Not in scope: `integer'[michael@sabal ~]$

3 3

Rotating calipers
by mukesh tiwari 07 Aug '11

07 Aug '11

Hello all , I am trying to understand rotating calipers [ http://en.wikipedia.org/wiki/Rotating_calipers ] but i am not sure if understood this algorithm correctly . I tried to use the almost same algorithm given on wiki but with four calipers to solve the problem [ http://cgm.cs.mcgill.ca/~orm/rotcal.html ]. My approach is find xminP, xmaxP, yminP ymaxP and their corresponding calipers will be ( 0 * i - j ) , ( o * i + j ) , ( i + 0 * j ) and ( -i + 0 * j ). I implemented the algorithm in Haskell but its not working . I am not sure if i have followed the wiki algorithm correctly and could some one please tell me what is wrong with implementation. It would be great if some one can explain this algorithm in pseudo code which explains the rotating caliper and their implementation details . In case of indentation , see here [ http://hpaste.org/49907 ] . Thank you Mukesh Tiwari import Data.List import Data.Array import Data.Maybe import Data.Function import Text.Printf import qualified Data.ByteString.Char8 as BS data Point a = P a a deriving ( Show , Ord , Eq ) data Vector a = V a a deriving ( Show , Ord , Eq ) data Turn = S | L | R deriving ( Show , Eq , Ord , Enum ) --start of convex hull compPoint :: ( Num a , Ord a ) => Point a -> Point a -> Ordering compPoint ( P x1 y1 ) ( P x2 y2 ) | compare x1 x2 == EQ = compare y1 y2 | otherwise = compare x1 x2 findMinx :: ( Num a , Ord a ) => [ Point a ] -> [ Point a ] findMinx xs = sortBy ( \x y -> compPoint x y ) xs compAngle ::(Num a , Ord a ) => Point a -> Point a -> Point a -> Ordering compAngle ( P x1 y1 ) ( P x2 y2 ) ( P x0 y0 ) = compare ( ( y1 - y0 ) * ( x2 - x0 ) ) ( ( y2 - y0) * ( x1 - x0 ) ) sortByangle :: ( Num a , Ord a ) => [ Point a ] -> [ Point a ] sortByangle (z:xs) = z : sortBy ( \x y -> compAngle x y z ) xs findTurn :: ( Num a , Ord a , Eq a ) => Point a -> Point a -> Point a - > Turn findTurn ( P x0 y0 ) ( P x1 y1 ) ( P x2 y2 ) | ( y1 - y0 ) * ( x2- x0 ) < ( y2 - y0 ) * ( x1 - x0 ) = L | ( y1 - y0 ) * ( x2- x0 ) == ( y2 - y0 ) * ( x1 - x0 ) = S | otherwise = R findHull :: ( Num a , Ord a ) => [ Point a ] -> [ Point a ] -> [ Point a ] findHull [x] ( z : ys ) = findHull [ z , x ] ys --incase of second point on line from x to z findHull xs [] = xs findHull ( y : x : xs ) ( z : ys ) | findTurn x y z == R = findHull ( x : xs ) ( z:ys ) | findTurn x y z == S = findHull ( x : xs ) ( z:ys ) | otherwise = findHull ( z : y : x : xs ) ys convexHull ::( Num a , Ord a ) => [ Point a ] -> [ Point a ] convexHull xs = reverse . findHull [ y , x ] $ ys where ( x : y : ys ) = sortByangle . findMinx $ xs --end of convex hull --start of rotating caliper part http://en.wikipedia.org/wiki/Rotating_calipers --dot product for getting angle angVectors :: ( Num a , Ord a , Floating a ) => Vector a -> Vector a - > a angVectors ( V ax ay ) ( V bx by ) = theta where dot = ax * bx + ay * by a = sqrt $ ax ^ 2 + ay ^ 2 b = sqrt $ bx ^ 2 + by ^ 2 theta = acos $ dot / a / b --rotate the vector x y by angle t rotVector :: ( Num a , Ord a , Floating a ) => Vector a -> a -> Vector a rotVector ( V x y ) t = V ( x * cos t - y * sin t ) ( x * sin t + y * cos t ) --dist between two parallel vectors distVec :: ( Num a , Ord a , Floating a ) => Vector a -> Vector a -> a distVec ( V x1 y1 ) ( V x2 y2 ) = sqrt $ ( x1 - x2 ) ^ 2 + ( y1 - y2 ) ^ 2 --rotating caliipers rotCal :: ( Num a , Ord a , Floating a ) => Array Int ( Point a ) -> a -> [ Int ] -> [ Vector a ] -> a -> Int -> a rotCal arr ang [ pa , pb , qa , qb] [ cpa , cpb , cqa , cqb ] area n | 2 * ang > pi = area | otherwise = rotCal arr ang' [ pa' , pb' , qa' , qb' ] [ cpa' , cpb' , cqa' , cqb' ] area' n where P x1 y1 = arr ! pa P x2 y2 = arr ! ( mod ( pa + 1 ) n ) P x3 y3 = arr ! pb P x4 y4 = arr ! ( mod ( pb + 1 ) n ) P x5 y5 = arr ! qa P x6 y6 = arr ! ( mod ( qa + 1 ) n ) P x7 y7 = arr ! qb P x8 y8 = arr ! ( mod ( qb + 1 ) n ) t1 = angVectors cpa ( V ( x2 - x1 ) ( y2 - y1 ) ) t2 = angVectors cpb ( V ( x4 - x3 ) ( y4 - y3 ) ) t3 = angVectors cqa ( V ( x6 - x5 ) ( y6 - y5 ) ) t4 = angVectors cqb ( V ( x8 - x7 ) ( y8 - y7 ) ) t = minimum [ t1 , t2 , t3 , t4 ] cpa' = rotVector cpa t cpb' = rotVector cpb t cqa' = rotVector cqa t cqb' = rotVector cqb t ang' = ang + t ( pa' , pb' , qa' , qb' ) = fN [ t1 , t2 , t3 , t4 ] t where fN [ t1 , t2 , t3 , t4 ] t | t == t1 = ( mod ( pa + 1 ) n , pb , qa , qb ) | t == t2 = ( pa , mod ( pb + 1 ) n , qa , qb ) | t == t3 = ( pa , pb , mod ( qa + 1 ) n , qb ) | otherwise = ( pa , pb , qa , mod ( qb + 1 ) n ) width = distVec cpa' cpb' length = distVec cqa' cqb' area' = min area $ length * width solve :: ( Num a , Ord a , Floating a ) => [ Point a ] -> a solve [] = 0 solve [ p ] = 0 solve [ p1 , p2 ] = 0 solve [ p1 , p2 , p3 ] = 0 solve arr = rotCal arr' 0 [ pa , pb , qa , qb ] [ cpa , cpb , cqa , cqb ] area n where y1 = minimumBy ( on compare fN1 ) arr y2 = maximumBy ( on compare fN1 ) arr x1 = minimumBy ( on compare fN2 ) arr x2 = maximumBy ( on compare fN2 ) arr pa = fromJust . findIndex ( == y1 ) $ arr pb = fromJust . findIndex ( == y2 ) $ arr qa = fromJust . findIndex ( == x1 ) $ arr qb = fromJust . findIndex ( == x2 ) $ arr cpa = V 1 0 cpb = V ( -1 ) 0 cqa = V 0 ( -1 ) cqb = V 0 1 area = 1e9 n = length arr arr' = listArray ( 0 , n ) arr fN1 ( P x y ) = y fN2 ( P x y ) = x --end of rotating caliper final :: ( Num a , Ord a , Floating a ) => [ Point a ] -> a final [] = 0 final [ p ] = 0 final [ p1 , p2 ] = 0 final [ p1 , p2 , p3 ] = 0 final arr = solve . convexHull $ arr

2 4

xmonad on xkcd
by Jon Fairbairn 07 Aug '11

07 Aug '11

http://xkcd.com/934/ (and look at the “hover text”) — so who’s going to implement it? -- Jón Fairbairn Jon.Fairbairn(a)cl.cam.ac.uk

3 2

library-profiling default
by Tom Doris 07 Aug '11

07 Aug '11

Hi Is there a good reason that the default for library-profiling in .cabal/config is set to False? It seems a lot of people hit the problem of trying to profile for the first time, finding it doesn't work because profiling libraries haven't been installed, then they have to walk the dependencies reinstalling everything. Is there a major cost or problem with just defaulting this to True? Apologies if this is answered elsewhere, I saw various discussions on why it is difficult to automatically build required libs with profiling on demand, but nothing that discussed changing the default so that they are always built. Tom

3 2

ANN: Netwire AFRP library
by Ertugrul Soeylemez 07 Aug '11

07 Aug '11

Hi there, after a few weeks of development time, I have released the first official version of my arrowized FRP library called Netwire: http://hackage.haskell.org/package/netwire I have written it with networking applications in mind, but it is a general purpose library, so it can be used in all of the classic fields like gaming, animation, user interfaces and others. Its basic idea is the same as in Yampa, but its internal structure is much simpler and hence it's easier to extend. Also like in most of my libraries I have specifically decided to expose the internals, so you can extend Netwire without having to fork. Features not found in Yampa/Animas: * switching by ArrowChoice, * suspended signal transformers, * signal inhibition, * combination through ArrowZero and ArrowPlus, * impure signal transformers. There exists a wiki page, which should give you a quickstart: http://haskell.org/haskellwiki/Netwire I would be grateful for any constructive feedback. Greets, Ertugrul -- nightmare = unsafePerformIO (getWrongWife >>= sex) http://ertes.de/

1 0

trouble using the aeson package
by anonymous 07 Aug '11

07 Aug '11

I recently installed the aeson package using cabal-install without any trouble: ❲~❳ uname -rspi; cabal -V; ghc -V; ghc-pkg list | grep "aeson\|double-conversion" Linux 2.6.38-10-generic x86_64 x86_64 cabal-install version 0.10.2 using version 1.10.1.0 of the Cabal library The Glorious Glasgow Haskell Compilation System, version 7.0.3 aeson-0.3.2.9 double-conversion-0.2.0.1 However when I try to use it I receive this error message: λ> let f = Data.Aeson.String Loading package double-conversion-0.2.0.1 ... can't load .so/.DLL for: stdc++ (libstdc++.so: cannot open shared object file: No such file or directory) This is the version I have installed: ❲~❳ aptitude search stdc++ | grep ^i i libstdc++6 - The GNU Standard C++ Library v3 i A libstdc++6-4.4-dev - The GNU Standard C++ Library v3 (developme i libstdc++6-4.5-dev - The GNU Standard C++ Library v3 (developme ❲~❳ aptitude show libstdc++6-4.4-dev | head -n 4 Package: libstdc++6-4.4-dev State: installed Automatically installed: yes Version: 4.4.5-15ubuntu1

2 1