Re: [Haskell-cafe] Darcs home page updated
Simon It does discuss both camp and darcs. I meant to say the following: Simon I was happy to be able to use Ian Lynagh's video, which I have always Simon felt strikes a very good tone - technical, concise, grounded and Simon energising. I like listening to it. Thanks Ian! Indeed, the form, duration and pace are all very good in this video. However, if I understand correctly, your initiative mainly targets potential newcomers. I am not sure they will understand the connection here, and they will quickly ask how to display the patches DAG in darcs. Also, from a communication POV, the title of the video does not match well with the date of the video ( we are on darcs.net and the video is why we continue to develop Camp and is from 2008 :] ) I don't dismiss the great work on this camp video itself. It is just that if some darcs user has time to make a 2012 darcs video (name hit : darcs vs git), based on the same idea, that would probably be more suited for darcs website. regards, -- Paul ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] twitter election on favorite programming language
Out of curiousity, was this a plurality election (vote for one), or an approval election (vote for many)? On Tue, May 1, 2012 at 12:11 AM, Kazu Yamamoto k...@iij.ad.jp wrote: Hello, A twitter election on favorite programming language was held in Japan and it appeared that Heskell is No. 10 loved language in Japan. :-) http://twisen.com/election/index/654 Regards, --Kazu ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] ANN: bitwise - fast multi-dimensional unboxed bit packed Bool arrays
Hi all, I'm pleased to announce bitwise-0.1: http://hackage.haskell.org/package/bitwise --8-- excerpt from the hackage page Unboxed multidimensional bit packed Bool arrays with fast aggregate operations based on lifting Bool operations to bitwise operations. There are many other bit packed structures out there, but none met all of these requirements: 1. unboxed bit packed Bool array, 2. multi-dimensional indexing, 3. fast (de)serialization, or interoperable with foreign code, 4. fast aggregate operations (fold, map, zip). --8-- end excerpt bitwise has been tested in hugs -98, ghc-7.0.4, ghc-7.4.1. Bool data structures comparison (features numbered as excerpt above): package features additional notes 1 2 3 4 arrayY Y n n bitarray Y n n ? based on array bitstreamn n ? ? based on vector bitstringY n ? ? based on bytestring bit-vector n n Y ? based on vector bitwise Y Y Y Y repa n Y Y ? based on vector uvector Y n ? ? deprecated vector n n Y ? uses a Word8 for each Bool Known shortcomings of this first release of bitwise: * missing common instances (Eq, Ord, Read, Show, ...); * missing additional functions (counting, searching, ...); * missing documentation on ByteString format: the bits are taken from the array and packed into Word8s, with the first bit (in array order) becoming the least significant bit of the first Word8; the last Word8 is padded with 0 at the most-significant-bit end; * PBM reading is not compliant to the official specification; * misleading benchmark (bitwise zipWith is fast, but there may be a faster way to zipWith UArray ix Bool than the one I used). What I'm using bitwise for at the moment: A building block for fractal imaging: an image is made up of cells, each cell can be in one of 4 states (represented with 2 bits): * cell is 100% interior to a set of points in the plane * cell is 100% exterior * partially interior and partially exterior (ie, on the boundary) * unknown with recursive subdivision of cells into images taking place only when the cell is on the boundary of the set being imaged. Thanks, Claude ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Creating a dependency graph (in the hope it may show some structure)
On 2 May 2012 06:15, Bram Neijt bne...@gmail.com wrote: Dear Haskelllers, I've reacently started with Haskell and during the Dutch Hackaton[3], I decided to generate graphs of dependencies. I was thinking about doing this for Java earlier, and that weekend I decided to write the tooling in Haskell. Just to be clear, what are you referring to by dependencies: * Package dependencies * Inter-module dependencies * Call-graph dependencies And are you doing this on a per-module or a per-package basis? I've written two programs: hs2dot[1] and dotimate[2]. The first generates a dot file (Graphviz) from all .hs files below the current working directory. The second will take one or more dot files and call neato (from Graphviz) multiple times to generate frames of neato output from one to the next. Trying hs2dot and dotimate on two sequencial commits in the cabal/cabal-install/frames directory already gives me a way to complex and full graph. See attached. == My question is: What dependencies, if any, would be nice to graph, and/or which dependencies could I filter out to keep this from becoming a mess? First of all, consider this list of existing graph-based visualisation tools for Haskell and see if any have some features you can duplicate: http://stackoverflow.com/questions/7427094/generate-diagrams-for-haskell-code I know in SourceGraph, my take was to try and do different kinds of pruning, collapsing, etc. to shrink the information overload down (however, I haven't touched SourceGraph apart from dependency updates for quite a while). Greetings, Bram Neijt [1] https://gist.github.com/bneijt/hs2dot [2] https://gist.github.com/bneijt/dotimate [3] http://www.haskell.org/haskellwiki/DHD_UHac#Utrecht_Hackathon ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Ivan Lazar Miljenovic ivan.miljeno...@gmail.com http://IvanMiljenovic.wordpress.com ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
