- Libraries - Haskell.org

ANN: New version of pretty-show, now with Html support
by Iavor Diatchki 06 Jan '13

06 Jan '13

Hello, I've uploaded a new version of the pretty-show package (1.5) to Hackage, which provides some useful tools for inspecting Haskell data-structures. I find it quite useful while debugging. The package provides a binary and a library: the binary, named `ppsh` can take as an input a Haskell value in standard `Show` notation, and can: * Either render it to a more human readable version by adding extra white-space and newlines, thus ensuring that the result is still a valid Haskell value, or * It can render the value as an interactive Html page, which is new in this version. The library provides similar functionality but in a programatically. Also, it has some support for working with non-Showable values, by using the `PrettyVal` class, which may be derived generically. As an example, I am attaching a picture of a part of a data-structure generated with the `language-c-quote` library, by using the standard `Show` instance. I hope you find this useful, -Iavor

1 0

Network.URI - MIN_VERSION_base problem, or finger-trouble?
by Graham Klyne 05 Jan '13

05 Jan '13

A couple of problems with Network.URI have been brought to my attention, so I thought I'd have a go at seeing if I could fix them. It's been a while (years) since I used the Haskell toolchain in anger, so I'm a bit out of touch with how thinks are working now. So far, I have: 1. Installed Haskell platform (64-bit version for MacOS). 2. Checked out the 'network' project from https://github.com/haskell/network 3. cabal install test-framework 4. cabal install test-framework-hunit 5. changed to the 'test' directory of the checked out 'network' project Then when I try to run GHC, I get this error: [[ conina:tests graham$ ghc -v -XDeriveDataTypeable ../Network/URI.hs uri001.hs Glasgow Haskell Compiler, Version 7.4.2, stage 2 booted by GHC version 7.0.4 Using binary package database: /Library/Frameworks/GHC.framework/Versions/7.4.2-x86_64/usr/lib/ghc-7.4.2/package.conf.d/package.cache Using binary package database: /Users/graham/.ghc/x86_64-darwin-7.4.2/package.conf.d/package.cache wired-in package ghc-prim mapped to ghc-prim-0.2.0.0-7d3c2c69a5e8257a04b2c679c40e2fa7 wired-in package integer-gmp mapped to integer-gmp-0.4.0.0-af3a28fdc4138858e0c7c5ecc2a64f43 wired-in package base mapped to base-4.5.1.0-81d626fb996bc7e140a3fd4481b338cd wired-in package rts mapped to builtin_rts wired-in package template-haskell mapped to template-haskell-2.7.0.0-29110cc89a711d6ab3e7ee0e0a8ee949 wired-in package dph-seq not found. wired-in package dph-par not found. Hsc static flags: -static *** Chasing dependencies: Chasing modules from: *../Network/URI.hs,*uri001.hs Created temporary directory: /tmp/ghc65140_0 *** C pre-processor: '/usr/bin/gcc' '-E' '-undef' '-traditional' '-m64' '-fno-stack-protector' '-m64' '-I' '/Library/Frameworks/GHC.framework/Versions/7.4.2-x86_64/usr/lib/ghc-7.4.2/base-4.5.1.0/include' '-I' '/Library/Frameworks/GHC.framework/Versions/7.4.2-x86_64/usr/lib/ghc-7.4.2/include' '-D__GLASGOW_HASKELL__=704' '-Ddarwin_BUILD_OS=1' '-Dx86_64_BUILD_ARCH=1' '-Ddarwin_HOST_OS=1' '-Dx86_64_HOST_ARCH=1' '-U __PIC__' '-D__PIC__' '-x' 'c' '../Network/URI.hs' '-o' '/tmp/ghc65140_0/ghc65140_0.hscpp' ../Network/URI.hs:135:0: error: missing binary operator before token "(" *** Deleting temp files: Deleting: /tmp/ghc65140_0/ghc65140_0.hscpp Warning: deleting non-existent /tmp/ghc65140_0/ghc65140_0.hscpp *** Deleting temp dirs: Deleting: /tmp/ghc65140_0 ]] The problem seems to be with the following lines in URI.hs (starting at line 135): [[ # if MIN_VERSION_base(4,0,0) import Data.Data (Data) # else import Data.Generics (Data) # endif ]] If I remove these lines, and just leave [[ import Data.Generics (Data) ]] I can compile and run the test suite just fine: [[ Test Cases Total Passed 319 319 Failed 0 0 Total 319 319 ]] I'm _guessing_ the problem here is something to do with "MIN_VERSION_base(4,0,0)" - not being familiar with the current build environment setup, I'm not sure where it is or should be defined, or what it is intended to mean. I did find these: * http://www.haskell.org/pipermail/haskell-cafe/2012-August/102787.html * http://stackoverflow.com/questions/8961413/zlib-build-error-with-ghc but they didn't help me. It seems there's a fix that involves using __GLASGOW_HASKELL__ instead of MIN_VERSION_base(4,0,0), but I'm not sure exactly how that would play out - or indeed if that's the correct approach for a permanent fix. Is there something else I should be doing to set up the development and test environment for this library module? Thanks for any pointers. #g --

4 4

Re: Maximum and Minimum monoids
by wren ng thornton 01 Jan '13

01 Jan '13

On 12/29/12 8:29 AM, Strake wrote:> and (Max a) and (Min a) are not properly monoids. They're monoids just fine. It's just that their identity element need not be in the set being folded over. > We could define these: > > Supr, Infi :: * -> * Please please, if we're going to abbreviate mathematical terms then we ought to stick to the standard mathematical abbreviations: sup, inf. Personally, I'm fine with Min and Max as they are, because in particular they capture the fact that we're dealing with total orders here. That is, other than for empty sets, they do in fact return the maximum/minimum. Whereas Sup and Inf bring to mind the fact that what we're dealing with is a complete lattice, which need not be a total order. While Sup and Inf make perfectly good monoids/semigroups, I'd prefer if they properly allow all complete lattices rather than being unnecessarily restricted to Ord. -- Live well, ~wren

2 2

Maximum and Minimum monoids
by Gabriel Gonzalez 01 Jan '13

01 Jan '13

I don't know if this has been brought up before or not, but would it be possible to add the Maximum and Minimum monoids to Data.Monoid? The following implementations extend the traditional semigroups using Maybe. ****** newtype Maximum a = Maximum { getMaximum :: Maybe a } instance (Ord a) => Monoid (Maximum a) where mempty = Maximum Nothing mappend (Maximum Nothing) m2 = m2 mappend m1 (Maximum Nothing) = m1 mappend (Maximum (Just a1)) (Maximum (Just a2)) = Maximum (Just (max a1 a2)) newtype Minimum a = Minimum { getMinimum :: Maybe a } instance (Ord a) => Monoid (Minimum a) where mempty = Minimum Nothing mappend (Minimum Nothing) m2 = m2 mappend m1 (Minimum Nothing) = m1 mappend (Minimum (Just a1)) (Minimum (Just a2)) = Minimum (Just (min a1 a2)) ****** These also give the correct behavior when folding empty structures by returning Nothing. The reason I'm asking is that my `pipes` library uses `WriterT` to implement folds and having the above monoids lets me implement minimum and maximum folds elegantly. I can always provide these monoids myself, but I feel like they belong in Data.Monoid.

12 24

Proposal: add conversion functions to Data.Fixed.
by Jeff Shaw 01 Jan '13

01 Jan '13

Hello, In my work I've run into an annoyance: Data.Fixed.Fixed does not have a Binary instance in the binary package. This is a result of the representation of Fixed being hidden, which is understandable. The problem is that when I want to create a Binary instance for Fixed, I need to use unsafeCoerce, which is nasty, and there's no built-in way to safely deal with problems involving the desired resolution being different when deseralizing. Today I played around with the source to Fixed, and came up with this proposed solution: - | Get a Fixed value's Integer representation and resolution. fromFixed :: (HasResolution a) => Fixed a -> (Integer,Integer) fromFixed f@(MkFixed i) = (i, resolution f) -- | Given an Integer representation and resolution of a Fixed value, -- create a new Fixed value with an arbitrary resolution. toFixed :: (HasResolution a) => (Integer,Integer) -> Fixed a toFixed (i,r0) = withResolution (\r1 -> MkFixed $ (i * r1) `div` r0) These functions lead to this useful derivation: convertFixed = toFixed . fromFixed, which leads to the possibility of having many possibly useful utility functions, such as toUni, fromUni, toDeci, fromDeci, etc. From fromFixed and toFixed, a safe instance for Binary (Fixed a) can be built (I haven't tested this, but it looks right): instance (HasResolution a) => Binary (Fixed a) where put = put . fromFixed get = get >>= return . toFixed Here is my patch: https://docs.google.com/open?id=0B8oSBVnQGD_wNGEtT1JRSnpPUms. Please respond with any comments, concerns, or ideas. Discussion period: 3 weeks. Thanks, Jeff

7 18

Proposal: Add foldMapWithKey to Data.Map and Data.IntMap
by Edward Kmett 30 Dec '12

30 Dec '12

I'd like to add foldMapWithKey to Data.Map and Data.IntMap. Right now you can foldrWithKey and foldlWithKey on Data.Map and Data.IntMap, but you cannot foldMapWithKey. You can fake this by using fold . mapWithKey but this requires converting the entire structure. You can also implement it with traverseWithKey and the use of the Const Monoid in a manner similar to foldMapDefault. When you have a monoid that can take advantage of the balanced nature of the tree, it'd be nice to be able to not lose the original near balanced parenthesization of the source tree. We can use this in the lens library for more efficient zippers on these containers, but in general having access to a 'balanced' foldMap is useful for any such container, and it seems odd not to be able to get at the keys in this orientation when you can go so every other way. A patch that implements the proposed operation is available here: https://github.com/haskell/containers/pull/24 Discussion Period: 2 weeks -Edward

5 5

Retiring as maintainer of dataenc
by Magnus Therning 29 Dec '12

29 Dec '12

Hi all, A few years ago I found a need to base64 encode a bit of text inside vim and realised that there was no convenient way of doing it. This resulted in dataenc[1] and a pair of tools built on it, omnicodec[2]. The main goals were to make dataenc correct, support many encodings, and easy to maintain. This resulted in very simple (some would say naïve) code, with fairly good test coverage. As some have noticed, this simplicity in algorithm results in rather bad performance on large data. Which is why I've been planning for a replacement for a while now. This replacement is now here, sandi[3]. The goals of sandi are similar to dataenc, correct, many encodings, fairly simple, but also reasonably fast. This means that I personally think dataenc has reached the end of its life and I won't spend any more time on maintaining it. If anyone is interested in taking over maintenance then please announce it on the list. /M [1]: http://hackage.haskell.org/package/dataenc [2]: http://hackage.haskell.org/package/omnicodec [3]: http://hackage.haskell.org/package/sandi -- Magnus Therning OpenPGP: 0xAB4DFBA4 email: magnus(a)therning.org jabber: magnus(a)therning.org twitter: magthe http://therning.org/magnus I invented the term Object-Oriented, and I can tell you I did not have C++ in mind. -- Alan Kay

1 0

ANN: sandi 0.1.1 - a data encoding/decoding library
by Magnus Therning 29 Dec '12

29 Dec '12

The other day I released version 0.1.1 of sandi, a data encoding/decoding library supporting the following encodings: base16, base32, base32hex, base64, base64url, base85, quoted-printable, uuencode, xxencode, yEnc I believe it's reasonably fast, but I still have to look more closely at criterion to get some hard numbers confirming that :) More details can be found at http://hackage.haskell.org/package/sandi /M -- Magnus Therning OpenPGP: 0xAB4DFBA4 email: magnus(a)therning.org jabber: magnus(a)therning.org twitter: magthe http://therning.org/magnus Perl is another example of filling a tiny, short-term need, and then being a real problem in the longer term. -- Alan Kay

1 0

Re: Maximum and Minimum monoids
by Gabriel Gonzalez 29 Dec '12

29 Dec '12

I'm still not convinced by the Bounded instance for Maybe, which seems like a hack. I would prefer to just use the Monoid instance for "Maybe (Max a)" and just fmap "getMaximum" over the result rather than pretend that Maybe is Bounded when it's not. Moreover, the entire Bounded constraint seems wrong in principle. There is no intuitive reason why some type should be bounded to be able to take a maximum of a set of elements. The Ord constraint should be sufficient to define a maximum. I also don't think it is a good idea to have direct Monoid instances for Max and Min, because they behave weirdly on empty lists. Do you really think that "minimum [] :: Int" should be defined? I still believe that the correct answer for "minimum []" should be Nothing or a similar type with a distinguished infinity like those that Roman proposed.``

3 3

Re: Maximum and Minimum monoids
by Gabriel Gonzalez 28 Dec '12

28 Dec '12

I am definitely in favor of adding "semigroups" to the platform if drops the containers dependency. Optionally, we could then fix the Monoid instance for Maybe so that it has a proper semigroup context and we wouldn't have to use the Option type. I would be happy with that solution. However, if we do that then rename the types to "Max" and "Min" instead of "Maximum and "Minimum", since "Maybe (Max a)" is long enough as it is.

4 9