April 2009 - Haskell-Cafe

ANN: list-tries-0.0 - first release
by Matti Niemenmaa 22 Apr '09

22 Apr '09

Announcing the first public release of list-tries! Version 0.0, woo! list-tries is a library providing implementations of finite sets and maps for list keys using tries, both simple and of the Patricia kind. The data types are parametrized over the map type they use internally to store the child nodes: this allows extending them to support different kinds of key types or increasing efficiency. To get at it, head over either to Hackage or my homepage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/list-tries http://iki.fi/matti.niemenmaa/list-tries/ It's Hugs-compliant to boot! I haven't tested UHC, but I suspect it'd work as well. I've tested compilation with both GHC 6.10 releases; 6.8 should also be fine. Being at version 0.0, I'm happy to get feedback, although I'm fairly busy with school for the foreseeable future so I can't promise I'll act on it very quickly. In particular, the API might be a bit unobvious due to the map type parametrization (and a bit cluttered due to the strict versions of just about every operation), but I hope it's not much trouble. I've actually had this release ready for a while now. I originally planned to coincide its release with that of GHC 6.10.2 since it needs a new version of 'containers' to build (see "Warning", below), but of course 'containers' wasn't updated since the changes that list-tries requires are API changes. I figured I might as well wait until 6.12.1, but with some recent buzz regarding tries I decided to just shove it out now, even as a crippled version due to the lack of a new enough 'containers'. Warning ======= In order to run properly, list-tries needs a version of 'containers' that hasn't yet been released. I incorporated a little hack which makes it compile even with 0.2, but some calls will fail by calling 'error': 30 of my 1014 test cases do so. If you have the latest Darcs version of 'containers' (which you probably do if you're using the GHC HEAD, for instance), make sure it's registered as a 0.3 version and then ask Cabal to build list-tries with the '-fcontainers03' flag. That way you'll get a fully-featured version of list-tries! Unfinished ========== I had hoped to get some benchmarks out before I released list-tries, to see if there's still much work to be done with respect to performance (and if there's any point in releasing it), but I didn't find the time. Data.ListTrie.Base.Map is largely undocumented, but it's not meant to be used much anyway so that shouldn't matter a great deal.

3 4

Books recommendation for LINQ?
by Günther Schmidt 22 Apr '09

22 Apr '09

Hi, I'll be trying Sigbjorns haskell-dotnet package together with LINQ. What's a good book for LINQ? Günther

1 0

ANN: HTTP-4000.0.6
by Sigbjorn Finne 21 Apr '09

21 Apr '09

Hi, a refresh release of the HTTP package has been uploaded to Hackage, http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HTTP Robust handling of ill-formed cookies + squash a bug in normalization of certain proxy-bound requests would be the (minor) headlines of this release. enjoy --sigbjorn

1 0

Re: [Haskell-cafe] Getting the x out
by michael rice 21 Apr '09

21 Apr '09

There's a lot of well thought out stuff in Haskell, but getting familiar with it all seems like a huge task. Thanks for the help. Michael --- On Tue, 4/21/09, Ross Mellgren <rmm-haskell(a)z.odi.ac> wrote: From: Ross Mellgren <rmm-haskell(a)z.odi.ac> Subject: Re: [Haskell-cafe] Getting the x out To: "michael rice" <nowgate(a)yahoo.com> Cc: haskell-cafe(a)haskell.org Date: Tuesday, April 21, 2009, 8:53 PM If you want to just get the value out, meaning you'll get a program error if it happens to be Nothing, then you can use Data.Maybe.fromJust. But usually, you'd want to preserve the Nothing. Applicative or Monad is pretty good for this: import Control.Applicative (3+) <$> safeDivision 10 5 the result will be Just 5.0 in this case, but if the division was incorrect it would be nothing. If you want to do something else, you can either pattern match on it: case safeDivision 10 5 of Just x -> -- do something with x Nothing -> -- do something else or use some functions from Data.Maybe. Say you want to evaluate to 1 instead of Nothing: import Data.Maybe fromMaybe 1 (safeDivision 10 5) -Ross On Apr 21, 2009, at 8:49 PM, michael rice wrote: How do I get the x out of Just x? Michael ============= safeDivision :: Float -> Float -> Maybe Float safeDivision x y = if y == 0 then Nothing else Just (x/y) *Main Data.List> safeDivision 10 5 Just 2.0 *Main Data.List> 3 + (safeDivision 10 5) <interactive>:1:0: No instance for (Num (Maybe Float)) arising from a use of `+' at <interactive>:1:0-22 Possible fix: add an instance declaration for (Num (Maybe Float)) In the expression: 3 + (safeDivision 10 5) In the definition of `it': it = 3 + (safeDivision 10 5) *Main Data.List> _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

Comments from two weeks of using Leksah
by Jeff Heard 21 Apr '09

21 Apr '09

I've been using the latest and greatest version of leksah for the last couple of weeks and I wanted to give a short report on the things I've found. First of all, it's crashed only once, and the error was an actual segfault, so I'm not sure what went wrong there. All in all, I like the eyecandy and have left it on for everything I do, but I've noticed that arrows have an extra space after them, no matter which arrow. Also, the candy for =<< and >>= is the same. Only one "missing feature" that I've noticed: regex find and replace. I'd like very much to be able to find and replace using regexes, as this is pretty much why I keep coming back to vi and emacs. I really really like the modules pane which gives me quick views into the doc of everything that's installed and the signatures. I wonder, though, could it be limited to the packages made available by the dependencies in configuring the current working package? That way, it would be easy to tell whether a dependency was missing. I wonder if there's a way to setup the preferences so that autocomplete can be accelerator based (like Ctrl+Space) instead of constantly on, because I've noticed that occasionally I'll hit enter at the end of a line and have it autocorrect my last identifier incorrectly. It'd be kind of neat if the error lines from the continuous background build showed up highlighted in the editor in some way, like they do in oh say Eclipse, but that's just a nice feature. Only other feature i'd like to see added is the ability to have multiple packages open at once, allow them to depend on each other, and handle configuring, building, and installing each of them be a one-step process. That's about it. For large projects, very neat and very useful! I like it. -- Jeff

4 4

A haskell error message
by siso dagbovie 21 Apr '09

21 Apr '09

Hi, I have been trying to specify the depth-first numbering algorithm as follow: >_dfNum :: Int -> [Tree a] -> [Tree Int] >_dfNum i ((Node n ts):us) = (Node i vs):(_dfNum (i+1+(length ts)) us) where > vs=_dfNum (i+1) ts But when I test it, I receive the message: Non-exhaustive patterns in function _bfNum Please, could you give me an idea of how I could fix this? Thanks Kind regards, Ayawoa Sitsopé Dagbovie African Institute for Mathematical Sciences #6 Melrose Road Muizenberg 7945 South Africa. Phone: +27 782 960453

2 1

UPDATE: haskellmode for Vim now at projects.haskell.org (+screencast; -)
by Claus Reinke 21 Apr '09

21 Apr '09

I have become aware that many Haskellers are not aware of the Haskell mode plugins for Vim, in spite of the >100 downloads per month I saw when I last checked. Since the plugins have just completed their move to their new home at http://projects.haskell.org/haskellmode-vim/ this seems to be a good opportunity to mention them again (now with 100% more screencasts!-). They do much (though certainly not all) of the stuff people often wish for here, such as showing or adding types, looking up source where available locally or looking up documentation where source isn't available. Mostly, they collect my attempts to automate tasks when I have to do them often enough. Here is a section of the quick reference (:help haskellmode-quickref): |:make| load into GHCi, show errors (|quickfix| |:copen|) |_ct| create |tags| file |_si| show info for id under cursor |_t| show type for id under cursor |_T| insert type declaration for id under cursor |balloon| show type for id under mouse pointer |_?| browse Haddock entry for id under cursor |:IDoc| {identifier} browse Haddock entry for unqualified {identifier} |:MDoc| {module} browse Haddock entry for {module} |:FlagReference| {s} browse Users Guide Flag Reference for section {s} |_.| qualify unqualified id under cursor |_i| add 'import <module>(<identifier>)' for id under cursor |_im| add 'import <module>' for id under cursor |_iq| add 'import qualified <module>(<identifier>)' for id under cursor |_iqm| add 'import qualified <module>' for id under cursor |_ie| make imports explit for import statement under cursor |_opt| add OPTIONS_GHC pragma |_lang| add LANGUAGE pragma |i_CTRL-X_CTRL-O| insert-mode completion based on imported ids (|haskellmode-XO|) |i_CTRL-X_CTRL-U| insert-mode completion based on documented ids (|haskellmode-XU|) |i_CTRL-N| insert-mode completion based on imported sources |:GHCi|{command/expr} run GHCi command/expr in current module For those who have never used these plugins, or haven't used Vim at all, it has often been difficult to imagine what editing in Vim can be like. The old quick tour of features available has now been updated from screenshots to screencasts (my first venture into this area - please let me know whether that is useful or a waste of time!-), so you can watch them on Youtube before deciding to invest time into learning Vim. For those who are using Vim, the only reason not to use my haskellmode plugins would be if you had your own (not uncommon among Vim users;-), in which case I hope you make yours available as well (feel free to adopt features from my plugins, and let me know if you have some useful features to contribute), here: http://www.haskell.org/haskellwiki/Libraries_and_tools/Program_development#… For those who have happily been using these plugins: in the process of moving the site, I noticed that I hadn't updated the published version for a quite some time - apparently, noone had missed the fixes, but in case you want to check, the relevant section of my update log is appended below. Happy Vimming!-) Claus ------------- updates since last published version on old site 04/04/2009 haskell_doc.vim: when narrowing choices by qualifier for _?, take lookup index from un-narrowed list (else we could end up in the docs for the wrong module) 02/04/2009 ghc.vim: actually, we can try to make a reasonable guess at the parent type for constructors in _ie, from their type signature 01/04/2009 ghc.vim: try a bit harder to escape " and ' in :GHCi eliminate duplicates in _ie and mark data constructor imports as ???(Cons) - we can't reliably figure out the parent type for the constructor:-( handle Prelude as special case in _ie (can't just comment out import, need to import [qualified] Prelude [as X]() ) haskell_doc.vim: fix keys (no namespace tags) and urls (modules) for :MDoc 31/03/2009 all files: new home page at projects.haskell.org 28/03/2009 haskell_doc.vim: in ProcessHaddockIndexes2, fix a case where making new entries could lose old ones (eg, zipWith's base package locations got lost when adding its vector package locations) 07/12/2008 haskell_doc.vim: since we're now reading from multiple haddock indices in DocIndex, we need to extend, not overwrite entries.. 03/12/2008 ghc.vim: do not reset b:ghc_static_options on every reload

3 10

ANNOUNCE: Runge-Kutta library -- solve ODEs
by Uwe Hollerbach 21 Apr '09

21 Apr '09

Hello, all, I'm pleased to announce a small Runge-Kutta library for numerically solving ordinary differential equations, which I'm hereby unleashing upon an unsuspecting world. The README is as follows: This is a small module collecting about a dozen Runge-Kutta methods of different orders, along with a couple of programs to exercise them. Build and run testrk, volterra, volterra2, and arenstorf: o testrk exercises all of the methods in a non-adaptive way, solving a test problem with a known analytic solution, to check convergence. (This was what first indicated that there was a problem with the Fehlberg 7(8) listing in HNW.) o volterra uses a non-adaptive method to solve the Lotka-Volterra equations from t=0 to t=40: either from a built-in starting point, or from a starting point specified on the command line. o volterra2 does the same, except it uses an adaptive solver o arenstorf solves the restricted 3-body problem (earth+moon+satellite) using an adaptive solver with some specific initial conditions which yield periodic orbits The volterra2 and arenstorf examples use an "oracle" function to decide what is a good step size. Right now that oracle function is in each test file; arguably it should be in the RungeKutta module. Eventually it will be, but I haven't spent much time yet on making that oracle especially good. I have so far only tested it with ghc 6.8.3 on MacOS 10.3.9 (powerPC), but I know of no reason why it wouldn't work with other versions and OSs. It's BSD licensed, in fact I stole the LICENSE file from ghc (and filed off the serial numbers). I'm afraid I haven't messed with cabal much yet, so it's not cabalized; neither is it uploaded to hackage, as I have no account there. If someone wants to do either of those, please feel entirely free to do so. In addition to attaching a tarball to this message, I'm also putting this onto my (sadly neglected) web site: it will live at http://www.korgwal.com/software/rk-1.0.0.tar.gz. Enjoy! Uwe

4 6

regex-tdfa: mkRegex and matchRegex in ghci
by j.romildo＠gmail.com 21 Apr '09

21 Apr '09

Hello. How mkRegex and matchRegex can be used with the regex-tdfa backend in ghci? The following fails: $ ghci GHCi, version 6.10.2: http://www.haskell.org/ghc/ :? for help Loading package ghc-prim ... linking ... done. Loading package integer ... linking ... done. Loading package base ... linking ... done. Prelude> import Text.Regex Prelude Text.Regex> import Text.Regex.TDFA Prelude Text.Regex Text.Regex.TDFA> let re = mkRegex "jos. romildo" Loading package syb ... linking ... done. Loading package array-0.2.0.0 ... linking ... done. Loading package containers-0.2.0.1 ... linking ... done. Loading package bytestring-0.9.1.4 ... linking ... done. Loading package mtl-1.1.0.2 ... linking ... done. Loading package regex-base-0.93.1 ... linking ... done. Loading package regex-posix-0.94.1 ... linking ... done. Loading package regex-compat-0.92 ... linking ... done. Prelude Text.Regex Text.Regex.TDFA> let text = "josé romildo" Prelude Text.Regex Text.Regex.TDFA> matchRegex re text Nothing Clearly regex-posix is being used here. The standalone version of the program works as expected: $ cat t.hs module Main (main) where import Text.Regex import Text.Regex.TDFA re = mkRegex "jos. romildo" text = "josé romildo" result = matchRegex re text main = print result $ ghc --make t [1 of 1] Compiling Main ( t.hs, t.o ) Linking t ... $ ./t Just [] Any clues? Romildo

1 0

Building regex-tdfa-1.1.1 documentation
by j.romildo＠gmail.com 21 Apr '09

21 Apr '09

Hello. I want to build regex-tdfa-1.1.1 haddock documentation locally, but the procedure fails: $ ./setup haddock Preprocessing library regex-tdfa-1.1.1... Running Haddock for regex-tdfa-1.1.1... Warning: The documentation for the following packages are not installed. No links will be generated to these packages: rts-1.0 Text/Regex/TDFA/Common.hs:106:25: parse error on input `-- ^ identity of Position tag to set during a transition -- | Internal use to indicate type of tag and preference for larger or smaller Positions' $ haddock --version Haddock version 2.4.2, (c) Simon Marlow 2006 Ported to use the GHC API by David Waern 2006-2008 Any clues? Romildo

1 0