- Haskell-Cafe - Haskell.org

Fwd: [Haskell-cafe] Native windowing for glut applications on OS X.
by Lyndon Maydwell 14 Sep '09

14 Sep '09

I just realized that I only replied to Brandon. Sorry about that :) ---------- Forwarded message ---------- From: Lyndon Maydwell <maydwell(a)gmail.com> Date: Sat, Sep 5, 2009 at 4:22 PM Subject: Re: [Haskell-cafe] Native windowing for glut applications on OS X. To: "Brandon S. Allbery KF8NH" <allbery(a)ece.cmu.edu> I installed opengl via macports. Can I adjust my path somehow so that it prefers the native libraries? On Sat, Sep 5, 2009 at 8:57 AM, Brandon S. Allbery KF8NH<allbery(a)ece.cmu.edu> wrote: > On Sep 4, 2009, at 03:13 , Lyndon Maydwell wrote: >> >> I recently updated glut through cabal to version GLUT-2.2.1.0, and >> where once I had native windowing, now I can only seem to use X11. >> >> Does anyone know how to use native windowing? > > > Do you use Fink or MacPorts? Check for OpenGL libraries installed via > those; they're probably shadowing the native libraries. > > -- > 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 > > >

1 1

ANNOUNCE: A Levenberg-Marquardt implementation
by Bas van Dijk 14 Sep '09

14 Sep '09

Dear all, We like to announce the release of a Haskell binding to Manolis Lourakis's C levmar library at: http://www.ics.forth.gr/~lourakis/levmar/ This library implements the Levenberg-Marquardt algorithm which is an iterative technique that finds a local minimum of a function that is expressed as the sum of squares of nonlinear functions. It has become a standard technique for nonlinear least-squares problems and can be thought of as a combination of steepest descent and the Gauss-Newton method. When the current solution is far from the correct one, the algorithm behaves like a steepest descent method: slow, but guaranteed to converge. When the current solution is close to the correct solution, it becomes a Gauss-Newton method. Our binding consists of three packages: * http://hackage.haskell.org/package/bindings-levmar-0.1 A low-level wrapper around the C library. Note that the C library is lightly patched so that the functions can be safely called inside unsafePerformIO. The patched C library is bundled with this package. * http://hackage.haskell.org/package/levmar-0.1 A high-level wrapper around bindings-levmar. It provides a more familiar Haskell interface. For example, instead of passing a 'Ptr r' to the levmar function you can pass a [r]. levmar also provides some higher-level modules that use some type-level programming to add more type safety. * http://hackage.haskell.org/package/levmar-chart-0.1 Finally levmar-chart is a small package for quickly viewing the output of levmar in a chart. Unfortunately the documentation of these libraries is not available from hackage because bindings-levmar won't configure because of a missing dependency (lapack) on the hackage server. Instead I put the documentation at the following places: http://code.haskell.org/bindings-levmar/bindings-levmar-0.1/doc/html/bindin… http://code.haskell.org/levmar/levmar-0.1/doc/html/levmar/index.html Here follows a quick example: Suppose we have the following model functions: constant :: Num r => Model N1 r r linear :: Num r => Model N2 r r quadratic :: Num r => Model N3 r r cubic :: Num r => Model N4 r r constant a _ = a linear b a x = b * x + constant a x quadratic c b a x = c * x*x + linear b a x cubic d c b a x = d * x*x*x + quadratic c b a x And the jacobians: constantJacob :: Num r => Jacobian N1 r r linearJacob :: Num r => Jacobian N2 r r quadraticJacob :: Num r => Jacobian N3 r r cubicJacob :: Num r => Jacobian N4 r r constantJacob _ _ = 1 ::: Nil linearJacob _ a x = x ::: constantJacob a x quadraticJacob _ b a x = x*x ::: linearJacob b a x cubicJacob _ c b a x = x*x*x ::: quadraticJacob c b a x Now assume we have some sample data. If you call levmar like this: levmar cubic (Just cubicJacob) (-0.05 ::: 0.5 ::: -12 ::: 10 ::: Nil) samples 1000 defaultOpts Nothing Nothing noLinearConstraints Nothing You get the following fit (using levmar-chart): http://code.haskell.org/~roelvandijk/code/levmar-chart/cubicFit.png Note that levmar contains a demo with a lot more examples: http://code.haskell.org/levmar/Demo.hs Happy fitting, Roel and Bas van Dijk

5 16

Program with ByteStrings leads to memory exhaust.
by Grigory Sarnitskiy 14 Sep '09

14 Sep '09

I have a simple program that first generates a large (~ 500 mb) file of random numbers and then reads the numbers back to find their sum. It uses Data.Binary and Data.ByteString.Lazy. The problem is when the program tries to read the data back it quickly (really quickly) consumes all memory. The source: http://moonpatio.com/fastcgi/hpaste.fcgi/view?id=3607#a3607 or: module Main where import Data.Binary import Data.Int import System.Random import qualified Data.ByteString.Lazy as BL encodeFileAp f = BL.appendFile f . encode path = "Results.data" n = 20*1024*1024 :: Int getBlockSize :: BL.ByteString -> Int64 getBlockSize bs = round $ (fromIntegral $ BL.length bs) / (fromIntegral n) fillFile :: StdGen -> Int -> IO () fillFile _ 0 =return () fillFile gen i = do let (x, gen') = random gen :: (Double, StdGen) encodeFileAp path x fillFile gen' (i-1) processFile :: BL.ByteString -> Int64 -> Int -> Double -> Double processFile bs blockSize 0 sum = sum processFile bs blockSize i sum = let tmpTuple = BL.splitAt blockSize bs x = decode $ fst $! tmpTuple in processFile (snd tmpTuple) blockSize (i-1) $! sum + x main = do fillFile (mkStdGen 42) n results <- BL.readFile path putStrLn $ show $ processFile results (getBlockSize results) n 0

3 3

why these two are not equivalent?
by Diego Souza 14 Sep '09

14 Sep '09

Hi, I was trying to solve a simple problem in SPOJ, however, after two weeks trying almost everything I could think of, I was still getting WrongAnswer. Then I decided to do the same thing in C++ and I really got puzzled when I got ACcepted. I tried to understand what was different without success. I hope someone can tell me why spoj says the Haskell version is wrong: http://moonpatio.com/fastcgi/hpaste.fcgi/view?id=3583 [Haskell,WA] http://moonpatio.com/fastcgi/hpaste.fcgi/view?id=3582 [C++,AC] The problem I'm talking about is this one: https://www.spoj.pl/problems/SBANK/ Thanks, -- ~dsouza yahoo!im: paravinicius gpg key fingerprint: 71B8 CE21 3A6E F894 5B1B 9ECE F88E 067F E891 651E

4 8

Plotting parametric functions in Haskell
by Rafael Cunha de Almeida 14 Sep '09

14 Sep '09

Hello, I think it would be interesting to plot and visualize parametric (and other kind of functions) using the haskell language to define them [functions]. Does anyone know about some software or API that does just that? I started writing a plotter to do that using hopengl. But my computer graphics skills are rather bad and I couldn't produce anything really useful. []'s Rafael

4 3

Community.haskell.org is down
by Neil Mitchell 14 Sep '09

14 Sep '09

Hi, http://community.haskell.org/ seems to be down for me. In general, who should this be reported to? Thanks Neil

4 3

HECC License (was: [Haskell-cafe] Haskell Weekly News: Issue 130 - September 12, 2009)
by Thomas DuBuisson 14 Sep '09

14 Sep '09

> hecc-0.1. Marcel Fourn√© [5]announced the first release of hecc, the > Elliptic Curve Cryptography Library for Haskell. Implemented are > affine, projective, jacobian and modified jacobian point formats with > the basic operations. Included as an Example is a basic ECDH as well as > a basic speed test. This is great news - I hope it finds its way into the crypto library. One question - is this license a derivative of something I would have heard about? IANAL, but have just read the license it sounds fairly permissive in that it doesn't mandate distribution of source code (BSDish). Was this the intent? Did I miss something? Thomas

2 2

RE: Darcs and NFS Resolution
by Lewis-Sandy, Darrell 13 Sep '09

13 Sep '09

Thanks to everyone who pointed me in the right direction on this problem, I have been able to find a work around that allows me to push to an archive on a network file share. After some digging, I discovered the root of the problem. Briefly, Darcs uses the standard library System.Directory to perform file manipulations. This library make use of compiler pragmas to conditionally compile either the Windows or Linux specific functions based on the host operating system. This approach assumes that when your operating system is a Linux variant, all your mounted volumes will natively support POSIX. When you have mounted CIFS volumes, this will result in errors when calling those library functions to create, rename, copy and delete files or folders! Given the flexibility of the Linux operating system, A more versatile implementation for System.Directory might be able to detect the file system of each volume at runtime and choose the appropriate functions to call. But I digress... To workaround the inability to push to a CIFS volume in darcs, I modified the workaround.hs module to shell out to the OS's rename function rather than using the Haskell library's rename function. Specifically: I added the following code after the #else near line 80: renameFile :: FilePath -> FilePath -> IO () renameFile old new = do ecode <- System.Cmd.rawSystem "mv" [old,new] case ecode of ExitSuccess -> return () ExitFailure n -> putStrLn ("renameFile failed with exit code" ++ show n) which ensures that when the operating system is not WIN32, that renaming of files will be performed by the OS shell. I then added the System.Cmd module to the list of imports by inserting the following code near line 21 import qualified System.Cmd(rawSystem) after a recompile I could push to a CIFS volume, for example: sudo darcs push /mnt/cifsvol this is an obvious hack, and does not address the inability to put to a CIFS share (put depends upon copyFile and would need to be hacked to shell-out as well). Archives on the CIFS share have to be created by navigating to that folder and initializing. Shelling out is clearly a poor long term solution; a longer term solution would ideally introduce into the Haskell System.Directory library the ability to apply the correct functions transparently in accordance with the file system of the volume. Cheers -Darrell Lewis-Sandy

8 8

ANNOUNCE: arbtt-0.1
by Joachim Breitner 13 Sep '09

13 Sep '09

Hi, I just uploaded the Automatic Rule-Based Time Tracking tool on hackage. It is written in Haskell (duh :-)) and might be interesting for some of you to either use or hack on (or both). I have put an introduction on https://www.joachim-breitner.de/blog/archives/336-The-Automatic-Rule-Based-… As always, comments are very welcome. Enjoy, Joachim PS: If you don’t like to use the DSL I created for the rule, but rather want to use Haskell, it might also be possible to do the xmonad approach (maybe using dyre). If so, I’m curious to hear about it :-) -- Joachim "nomeata" Breitner mail: mail(a)joachim-breitner.de | ICQ# 74513189 | GPG-Key: 4743206C JID: nomeata(a)joachim-breitner.de | http://www.joachim-breitner.de/ Debian Developer: nomeata(a)debian.org

1 0

yhc compiled hbc
by Fernan Bolando 13 Sep '09

13 Sep '09

Hi all Are there any yhc users here? Can anybody send me a precompiled yhc cross-platform hbc file? regards fernan -- http://www.fernski.com

1 0