- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] trying to understand out of memory exceptions
by Anatoly Yakovenko 16 Apr '13

16 Apr '13

unfortunately read file tries to get the file size readFile :: FilePath -> IO ByteStringreadFile f = bracket (openFile f ReadMode) hClose (\h -> hFileSize h >>= hGet h . fromIntegral) which wont work on a special file, like a socket. which is what i am trying to simulate here. On Tue, Apr 16, 2013 at 11:28 AM, Clark Gaebel <cg.wowus.cg(a)gmail.com>wrote: > See the comment for hGetContents: > > "This function reads chunks at a time, doubling the chunksize on each > read. The final buffer is then realloced to the appropriate size. For files > > half of available memory, this may lead to memory exhaustion. Consider > using readFile<http://hackage.haskell.org/packages/archive/bytestring/0.9.2.1/doc/html/Dat…> in > this case." > > > http://hackage.haskell.org/packages/archive/bytestring/0.9.2.1/doc/html/Dat… > > Maybe try lazy bytestrings? > > - Clark > > On Tuesday, April 16, 2013, Anatoly Yakovenko wrote: > >> -- So why does this code run out of memory? >> >> import Control.DeepSeq >> import System.IO >> import qualified Data.ByteString.Char8 as BS >> >> scanl' :: NFData a => (a -> b -> a) -> a -> [b] -> [a] >> scanl' f q ls = q : (case ls of >> [] -> [] >> x:xs -> let q' = f q x >> in q' `deepseq` scanl' f q' xs) >> >> >> main = do >> file <- openBinaryFile "/dev/zero" ReadMode >> chars <- BS.hGetContents file >> let rv = drop 100000000000 $ scanl' (+) 0 $ map fromEnum $ BS.unpack >> chars >> print (head rv) >> >> -- my scanl' implementation seems to do the right thing, because >> >> main = print $ last $ scanl' (+) (0::Int) [0..] >> >> -- runs without blowing up. so am i creating a some thunk here? or is >> hGetContents storing values? any way to get the exception handler to print >> a trace of what caused the allocation? >> >>

2 1

ANN: rematch, an library for composable assertions with human readable failure messages
by Tom Crayford 16 Apr '13

16 Apr '13

I kept on running into this thing where I was calling error in quickcheck to get good error messages about the things I was comparing. In Java land, this stuff is handled by Hamcrest: a library for composable assertions with good error messages. This library is basically a port of hamcrest's core api, but I've been very pleased with how it turned out. I've been using this in tests for production code for a month or so now, and I'm very pleased with it. Running a matcher (in this example in an hunit test) looks like this: expect [1] (is [1]) The core API is very simple: data Matcher a = Matcher { match :: a -> Bool -- ^ A function that returns True if the matcher should pass, False if it should fail , description :: String -- ^ A description of the matcher (usually of its success conditions) , describeMismatch :: a -> String -- ^ A description to be shown if the match fails. } This means you can add/write your own matchers happily, which occasionally means you can write *very* nice test code (here's an example of using a custom matcher for checking the state of an "issue" in a hypothetical issue tracking app): expect latestIssue (hasState Resolved) -- I removed the supporting code to make this assertion actually run, -- this email is already pretty long. There are numerous matchers (and functions for creating matchers) in the rematch library, including some composition functions that provide good failure messages. There are some shims to hook rematch into the common haskell test frameworks (specifically hunit and quickcheck). The two libraries are up on hackage: http://hackage.haskell.org/package/rematch http://hackage.haskell.org/package/rematch-text The code is all up on github: http://github.com/tcrayford/rematch I get rather frustrated when my tests give bad failure explanations, and using rematch goes a long way to fix that. Lastly, rematch is pretty isolated from test frameworks/etc, with a very small and easy to understand surface api. Hopefully it'll help with the thing I've seen in other languages (cough ruby cough) with every test framework reinventing this idea, and not all frameworks having all the matchers I want to use. Let me know if you have any feedback/thoughts Tom

6 8

When - O'Reilly book on Parallel and Concurrent Haskell
by amslonewolf＠gmail.com 16 Apr '13

16 Apr '13

Are there updates on when Simon Marlow's O'Reilly book on Parallel and Concurrent Haskell is going to be released?

1 1

Monad fold
by Christopher Howard 16 Apr '13

16 Apr '13

So, I'm doing something like this foldl (>>=) someA list :: Monad m => m a where list :: Monad m => [a -> m a], someA :: Monad m => m a Is there a more concise way to write this? I don't think foldM is what I want -- or is it? -- frigidcode.com

6 8

primitive operations in StateT
by Clark Gaebel 16 Apr '13

16 Apr '13

Hi list! I want to use MVectors in a StateT monad transformer. How do I do that? StateT isn't a member of 'PrimMonad', and I have no idea how to make it one. Regards, - Clark

2 4

Google Summer of Code
by Marcos Pividori 16 Apr '13

16 Apr '13

Hi, I am a Computer Science student from Argentina. I am interested in working this summer on some project related to Haskell for the Google Summer of Code. I have learned a lot about this, because in my career, we have a special approach in functional programming. So, I would like to know about recent projects and who could mentor me. I found a ticket about improving Parsec. http://hackage.haskell.org/trac/summer-of-code/ticket/1556 Is anyone working with this? Thanks, Marcos Pividori

2 1

How to design an network client with user program.
by Alexander V Vershilov 16 Apr '13

16 Apr '13

Hello. I have next problem: I have a network client that connects to server, listens for messages and generate responces. So the control flow can be represended as: server -- input -> {generate output} -> output Output can be generated using default implementation or can overriden by user. The main difficulty appeares when I need to add a user program on the top of this logic, i.e. from user-side I want to have dsl:smth like withClient $ do x <- send message waitFor x timeout 5000000 forever $ sendRandomMessage i.e. an ability to send messages, waiting for some event (message to come), waiting for timeout. The question is how to define such logic without a big overhead. I see a solution using conduit, it's possible to create 3 processes: listener, user, sender. +----> user ----+ | | -input -> listener +----------------->+---- sender -> and use TQueue or TChan to send messages between them, however there can be another possible solutions, that uses less resources, or another design. -- Alexander

3 4

Re: [Haskell-cafe] GSoC proposal: Data Visualization
by Ernesto Rodriguez 15 Apr '13

15 Apr '13

Dear All, Data visualization for hMatrix is basically my main objective, but I would like to be flexible in the following ways: * Have generic approach so other data types can be visualized with my library as long as the necessary instances are present. * Define a generic standard to represent values in multiple types of plots. This way graphics output can be easily extended for more back ends (gtk, qt, gnuplot). I am looking for alternatives. I will check GuiTV definitely, but currently I am considering the possibility of plotting data via javascript as suggested by Dough and using Haskell just to generate the values. I am using ghclive (https://github.com/shapr/ghclive) as fronted since the project looks nice and might be worth continuing it. Do you think there would be big objections if I continue working with that project since it was built for last GSoC? Best regards, Ernesto Rodriguez > > On Mon, Apr 15, 2013 at 2:10 PM, Michal J. Gajda <miga(a)nmr.mpibpc.mpg.de>wrote: > >> Dear Conal, Ernesto, Heinrich, >> >> >> On 04/15/2013 10:32 AM, Heinrich Apfelmus wrote: >> >> Ernesto Rodriguez wrote: >> >> >> For me it would already be a huge advantage if I >> could edit and re-evaluate expressions interactively (in a comfortable >> GUI, >> not ghci). Also a plot widget with sliders would also help. I was >> wondering >> if you know any reason the project has not been worked on for various >> months (as I see in the repo). Is there anyone working in this project >> and >> has a later version? I mean these are features that are even available in >> free math packages such as Sage. >> >> >> I was actually the initial mentor for this project. I'm not particularly >> happy about the result. As you can see, it hasn't been picked up by anyone >> else, including me, and I think that's because it missed the modularity >> goals I had in mind. >> >> Indeed interactive notebook functionality is missed by many :-). >> >> Is it a good time to ask about current status of GuiTV, which is possibly >> second closest to what Ernesto had in mind? >> http://www.haskell.org/haskellwiki/GuiTV >> Would be possible to ask Conal Elliot whether he is interested in >> mentoring a project that would add widget(s) for hmatrix visualisation? >> >> PS I believe Johan Malmström <http://homepage.mac.com/jmalmstrom/>'s >> HaXcel project, which may have tried to implement a similar functionality >> with a spreadsheet interface is dead: >> http://www.mrtc.mdh.se/projects/Haxcel/ >> -- >> Best regards >> Michal >> > > > > -- > Ernesto Rodriguez > > Bachelor of Computer Science - Class of 2013 > Jacobs University Bremen > > > > -- Ernesto Rodriguez Bachelor of Computer Science - Class of 2013 Jacobs University Bremen

1 0

Re: [Haskell-cafe] NaN as Integer value
by wren ng thornton 15 Apr '13

15 Apr '13

On 4/13/13 1:18 PM, Jerzy Karczmarczuk wrote: > This is not a Haskell problem. For Ints, ALL representations are valid > numbers, a NaN is a specific float object, unless I'm mistaken, so the > introduction of such an abnormal number would require some serious > modifications of the representation. Also, the necessity of NaN for floats comes from the fact that floats include values for Infinity and -Infinity, which leads to various equations which cannot be resolved sensibly. This is different than mere undefinedness. Undefined values are underspecified, but that can often be resolved by choosing some arbitrary specification (often chosen via arguing from limits or combinatorial convenience). Whereas the problematic values due to infinities are overspecified, so no matter which answer you pick it's guaranteed to be the wrong answer half the time. Part of this whole problem comes from the fact that floats *do* decide to give a meaning to 1/0 (namely Infinity). That's the gateway drug,... -- Live well, ~wren

3 2

GSoC proposal: Data Visualization
by Ernesto Rodriguez 15 Apr '13

15 Apr '13

Dear Haskell Community, During the last months I used Haskell for machine learning, particularly in the field of Echo State Neural Networks. The main drawback I encountered is that its difficult to visualize and plot data in Haskell in spite the fact there are a couple of plotting libraries. Data visualization is very important in the field of machine learning research (not so much in machine learning implementation) since humans are very efficient to analyze graphical input to figure out what is going on in order to determine possible adjustments. I was wondering if other members of the community have experienced this drawback and would be interested in improved data visualization for Haskell, especially if there is interest to use Haskell for machine learning research. I collected my ideas in the following page: https://github.com/netogallo/Visualizer . Please provide me with feedback because if the proposal is interesting for the community I would start working with it, even if it doesn't make it to this GSoC, but a project like this will need a lot of collaboration for it to be successful. Thank you very much, Best Regards, Ernesto -- Ernesto Rodriguez Bachelor of Computer Science - Class of 2013 Jacobs University Bremen

3 5