On Wed, Feb 23, 2011 at 12:57 PM, Gwern Branwen gwe...@gmail.com wrote:
On Wed, Feb 23, 2011 at 12:45 AM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
I'm a bit sceptical that it is (I was not convinced by the earlier
strict-set-inclusion argument, since that's another Data.Map feature
On Wed, Feb 23, 2011 at 1:27 PM, Gwern Branwen gwe...@gmail.com wrote:
You could look at them yourself; I attached the files. I see 6 uses
out of ~100 which involve an == 0
Looks like the mailing list gateway didn't let your attachements
through. No need to attach them though, I can just grep
On Wed, Feb 23, 2011 at 1:55 PM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
Thanks for bringing some data to the table. There are definitely some
common patterns in what you sent me:
1) For defining Binary instances, you need to write set size before
you write the elements: ~7
Attached are all the uses of S.size and Set.size from a semi-recent
snapshot of Hackage.
Johan
Combinatorrent/0.3.2/Combinatorrent-0.3.2/src/Process/Peer.hs:let sz =
S.size q
Combinatorrent/0.3.2/Combinatorrent-0.3.2/src/Process/PieceMgr.hs:
ipHave = S.size . ipHaveBlocks
On Thu, Mar 10, 2011 at 10:06 AM, Bas van Dijk v.dijk@gmail.com wrote:
On 10 March 2011 08:12, Hauschild, Klaus (EXT)
klaus.hauschild@siemens.com wrote:
Hi Haskellers,
I read about the cabal features for running test code from Setup.hs with
defaultMainWithHooks. I'm looking for more
On Thu, Mar 10, 2011 at 11:27 AM, Hauschild, Klaus (EXT)
klaus.hauschild@siemens.com wrote:
Hallo,
I'm using Haskell Platform 2010.2.0.0 on a Windows XP machine. This haskell
platform includes cabal-1.8.0.6.
Now I want to update cabal by cabal install cabal. Installation works
well.
On Mar 14, 2011 6:23 PM, Malcolm Wallace malcolm.wall...@me.com wrote:
On 22 Feb 2011, at 22:21, Bryan O'Sullivan wrote:
for some code that's (b) faster than anything else currently available
I look forward to seeing some benchmarks against libraries other than
containers, such as AVL
Hi,
I'd like to advertise three Google Summer of Code projects that I
recently added to the list [1] of proposed projects:
*** Build multiple Cabal packages in parallel ***
http://hackage.haskell.org/trac/summer-of-code/ticket/1594
Many developers have multi-core machines but Cabal runs the
You use a lot of (linked lists). Are they all used to represent streams or
are they actually manifest during runtime? If it's the latter switch to a
better data structure, like Vector.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sun, Mar 27, 2011 at 1:03 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
*** Build multiple Cabal packages in parallel ***
http://hackage.haskell.org/trac/summer-of-code/ticket/1594
Many developers have multi-core machines but Cabal runs the build
process in a single thread, only
Hi,
The Google Summer of Code student application period starts today at
19:00 UTC. If you're a student and like to get paid to work on a
Haskell project this summer I recommend you go find an interesting
project [1] and start working on your application. You can find more
information on the wiki
On Mon, Mar 28, 2011 at 7:31 PM, Michael A Baikov pa...@bk.ru wrote:
I am still playing with lastest iteratee and i think i found something
strange.
let's suppose we have a file test.hs like this:
import Data.Iteratee
import Data.Iteratee.IO
import Data.Iteratee.Char
main =
Could you please file a bug at
http://hackage.haskell.org/trac/ghc/
Give an as small reproducible test case as possible and as much
information about your system as possible.
Thanks!
Johan
2011/3/29 Michael A Baikov pa...@bk.ru:
I tried with both 7.0.2 and 7.0.3
-Original
Hi Gábor,
There are a few non-Cabal projects on the ideas list
(http://hackage.haskell.org/trac/summer-of-code/report/1). Just
thought I mentioned it in case you missed it.
2011/4/1 Gábor Lehel illiss...@gmail.com:
Alternately, I'd be very happy to receive suggestions
about other GHC-related
2011/4/1 Gábor Lehel illiss...@gmail.com:
Oh, hmm. Good idea. Should've cross-posted from the beginning :|.
What's the accepted etiquette here? Forward the original message? Send
a short heads-up with a link to this thread in the archives?
I'd send a new message with only the parts relevant
Hi Marco
On Tue, Apr 5, 2011 at 3:17 PM, Marco Túlio Gontijo e Silva
mar...@marcot.eti.br wrote:
I've writed a draft of the proposal at
http://www2.dcc.ufmg.br/laboratorios/llp/wiki/doku.php?id=marco_soc2011 . If
you have any comments, I'll be glad to receive them.
Thanks for taking the time
Hi Gilberto,
On Wed, Mar 30, 2011 at 4:39 PM, Gilberto Garcia giba@gmail.com wrote:
fkSum :: Int - [Int] - Int
fkSum a [] = 0
fkSum a (b) = foldl (+) 0 (filter (\x - isMultiple x b) [1..a])
isMultiple :: Int - [Int] - Bool
isMultiple a [] = False
isMultiple a (x:xs) = if (mod a x == 0)
On Tue, Apr 19, 2011 at 10:36 PM, Bas van Dijk v.dijk@gmail.com wrote:
On 19 April 2011 15:06, John Obbele john.obb...@gmail.com wrote:
-- Step 3 is the most important step. Submitting the transfer:
handleUSBException $ c'libusb_submit_transfer transPtr
-- TODO: Now
On Wed, Apr 20, 2011 at 5:22 PM, Bas van Dijk v.dijk@gmail.com wrote:
On 20 April 2011 17:04, Johan Tibell johan.tib...@gmail.com wrote:
Not that evtRead and evtWrite maps to different things on different
platforms.
Do you mean Not or Note?
Yes, sorry
On Wed, Apr 20, 2011 at 6:11 PM, Bas van Dijk v.dijk@gmail.com wrote:
I still need to add appropriate conditions for checking whether the
program is using the threaded RTS. What is the recommended approach
for this?
I see GHC.Conc.IO uses a dynamic check:
foreign import ccall unsafe
On Fri, Apr 29, 2011 at 10:25 AM, Evan Laforge qdun...@gmail.com wrote:
Indeed, and I was starting to do that... well, I would make my own
project specific Serialize class, since the type dispatch is useful.
But copy pasting a UTF8 encoder, or the variable length Integer
encoder, or whatever
Hi all,
I've just uploaded a new version of the unordered-containers package,
a package of fast hashing-based container types. Version
0.1.3.0 [1] adds:
* the ability to take the union of two maps,
* lower memory overhead per key/value pair (contributed by Jan-Willem
Maessen), and
* the
Hi Simon,
On Wed, May 18, 2011 at 7:32 PM, Simon Meier iridc...@gmail.com wrote:
In fact, one of my current goals with this work is to polish it such
that it can be integrated into the 'bytestring' library.
We should definitely add a builder monoid in the bytestring package.
Since Write
Hi Simon,
On Thu, May 19, 2011 at 10:46 PM, Simon Meier iridc...@gmail.com wrote:
Write achieves this separation, but it has some costs which I'm not
entirely comfortable with.
First, it leads to lots of API duplication. For every type (e.g. Word)
we want to be able serialize we have two
On Fri, May 20, 2011 at 11:12 PM, Simon Meier iridc...@gmail.com wrote:
There, seems to be a historical artefact here. The new Write
abstraction in system-io-write is different from the one used in
blaze-builder. It's type is
data Write a = Write Int (a - Ptr Word8 - IO (Ptr Word8))
This
Hi Daniel,
On Tue, May 24, 2011 at 10:07 AM, Daniel Díaz danield...@asofilak.es wrote:
Hi, cafe,
I just feel curiosity. In the bytestring package, Data.ByteString module,
functions like length, index, and others with Int in its type signature,
have Int64 in the analogous Data.ByteString.Lazy
On Wed, May 25, 2011 at 2:01 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
With my wl-pprint-text package, Jason Dagit suggested to me on
#haskell that it would make sense to make such a pretty-printer be
class-based so that the same API could be used for String, ByteString,
Text,
Hi Aleksandar,
On Tue, May 31, 2011 at 6:10 PM, Aleksandar Dimitrov
aleks.dimit...@googlemail.com wrote:
Say, we have an input file that contains a word per line. I want to find all
unigrams (unique words) in that file, and associate with them the amount of
times they occurred in the file.
Hi Aleksandar,
I thought it'd be educational to do some back-of-the-envelope
calculations to see how much memory we'd expect to use to store words
in a HashMap ByteString Int. First, lets start by looking at how much
memory one ByteString uses. Here's the definition of ByteString [1]:
data
On Wed, Jun 1, 2011 at 4:24 PM, Aleksandar Dimitrov
aleks.dimit...@googlemail.com wrote:
One additional thought: it might be interesting to provide this outside of
this
mailing list, perhaps as a documentation addendum to unordered-containers,
since
it really explains the size needs for
Hi Aleks,
On Wed, Jun 1, 2011 at 12:14 AM, Aleksandar Dimitrov
aleks.dimit...@googlemail.com wrote:
I implemented your method, with these minimal changes (i.e. just using a main
driver in the same file.)
countUnigrams :: Handle - IO (M.Map S.ByteString Int)
countUnigrams = foldLines (\ m s -
On Thu, Jun 2, 2011 at 5:10 AM, Jason Dagit dag...@gmail.com wrote:
One of the cool things about SO is that you can answer your own
question. For example, you might do that if you're anticipating an
FAQ. I think asking this question on SO and reposting your answer
from this thread would be
Hi Joachim,
On Sat, Jun 4, 2011 at 2:23 PM, Joachim Breitner nome...@debian.org wrote:
Hi Johan,
Am Donnerstag, den 05.05.2011, 23:02 +0200 schrieb Johan Tibell:
I've just uploaded a new version of the unordered-containers package,
a package of fast hashing-based container types.
I
On Thu, Jun 2, 2011 at 7:52 AM, Johan Tibell johan.tib...@gmail.com wrote:
I've decided to stick it in a blog post, add some pictures, and
elaborate some more (e.g. provide numbers for all containers and for
Text, so people can refer to the post when needed).
I ended up writing two blog posts
Hi,
On Thu, Jun 16, 2011 at 9:53 AM, kaffeepause73 kaffeepaus...@yahoo.de wrote:
I try to create an own data type containing Vector Double from the H-Matrix
package. The code:
##
data PowerSig = PowerSig Int Double Vector Double
You need to put parenthesis around (Vector Double). Otherwise
On Thu, Jun 16, 2011 at 3:01 PM, Dmitri O.Kondratiev doko...@gmail.com wrote:
Hi,
Data.Map has many great functions, yet I could not find the one that allows
from one map create another map where keys are values and values are keys of
the first one.
Something like:
transMap:: (Ord k, Ord a)
On Thu, Jun 16, 2011 at 3:01 PM, Dmitri O.Kondratiev doko...@gmail.com wrote:
Hi,
Data.Map has many great functions, yet I could not find the one that allows
from one map create another map where keys are values and values are keys of
the first one.
Something like:
transMap:: (Ord k, Ord a)
On Tue, Jun 21, 2011 at 2:34 PM, cheater cheater cheate...@gmail.com wrote:
Hi,
does the package adhere to some form of standard API that works the
same way across other similar packages (different mysql drivers,
postgres, mongo, couch, etc)?
Is there such a standard for haskell?
Not at the
On Tue, Jun 21, 2011 at 4:47 PM, David Virebayre
dav.vire+hask...@gmail.com wrote:
The problem isn't with the stored procedure, it works if I call it
from the mysql client.
Does mysql-simple support stored procedures?
Johan
___
Haskell-Cafe mailing
Hi Stuart,
On Wed, Jun 22, 2011 at 11:02 AM, Stuart Coyle stuart.co...@gmail.com wrote:
I cannot reach the hackage server so cabal can't download packages.
Have I the correct address?
http://hackage.haskell.org
Yes.
stuart@rumbaba:~# resolveip hackage.haskell.org
IP address of
On Wed, Jun 22, 2011 at 10:39 PM, SM Design social_me...@abv.bg wrote:
I have a homework which is very important to be done but I can't complete
the task at all. The program i should write is:
http://www.haskell.org/haskellwiki/Homework_help
___
On Mon, Jul 11, 2011 at 11:51 AM, Sjoerd Visscher sjo...@w3future.com wrote:
On Jul 11, 2011, at 11:42 AM, Jack Henahan wrote:
Well, for your example frustration, the leading comma style would sort your
problem nicely. As for the particulars… hmm, not sure. I use leading commas
for both,
On Mon, Jul 11, 2011 at 3:54 PM, Henning Thielemann
thunderb...@henning-thielemann.de wrote:
Johan Tibell wrote:
I've found this quite annoying, especially when using CPP to
conditionally include something in a list, as it might force you to
reorder the list to make the commas appear correctly
Hi all,
I've put together a quick, 12-question State of Haskell, 2011 survey:
http://blog.johantibell.com/2011/07/its-time-for-this-years-state-of.html
The survey will hopefully give us some insight into how people use
Haskell and perhaps also some ideas on how Haskell tools and libraries
Hi Chris,
On Tue, Aug 9, 2011 at 12:47 PM, Chris Yuen kizzx2+hask...@gmail.com wrote:
1. Why are bangs needed on the length arrays?
If I remove them from below, performance drops 10%. I thought `unsafeIndex`
is straight in both arguments, no?
wordLength i = go i
where
go n
|
[bcc: haskell@, beginners@]
Hi all,
On Sun, Jul 17, 2011 at 1:21 PM, Johan Tibell johan.tib...@gmail.com wrote:
I've put together a quick, 12-question State of Haskell, 2011 survey:
http://blog.johantibell.com/2011/07/its-time-for-this-years-state-of.html
The survey will hopefully give
On Tue, Aug 23, 2011 at 10:01 PM, David Pollak
feeder.of.the.be...@gmail.com wrote:
If you need any help with the tutorial, I might be able to help. Beginning
Scala is reputed to be approachable by a broad range of developers and I'd
be happy to try to apply my approach in Beginning Scala to
On Tue, Aug 23, 2011 at 10:04 PM, Andreas Voellmy
andreas.voel...@gmail.com wrote:
data DAT = DAT (IOArray Int32 Char)
Try to make this a newtype instead. The data type adds a level of indirection.
do let p j c = insertDAT a j c lookupDAT a j = \v - v `pseq` return
()
You most likely want
Hi Michael,
Kazu recently fixed this (in the stable branch on GitHub) in
Network.listenOn but perhaps the more basic Network.Socket.listen should
also be changed. Lets discuss what's the right thing to do in this thread.
On Wed, Sep 21, 2011 at 1:38 PM, Michael Snoyman mich...@snoyman.comwrote:
Hi,
On Wed, Sep 21, 2011 at 7:38 PM, Kazu Yamamoto k...@iij.ad.jp wrote:
Johan's observation is correct. Network.listenOn is alreay fixed but
Network.Socket.listen, which Warp relies on, is not fixed yet. I will
try to fix it. When the next version of the network library will be
released,
I've released a new version of network, 2.3.0.6, that contains the fix.
On Wed, Sep 28, 2011 at 1:34 AM, Kazu Yamamoto k...@iij.ad.jp wrote:
Hello,
Sorry for the delay but I made a patch and sent a pull request:
https://github.com/haskell/network/pull/18
After consideration, I
Let me take this opportunity to ask for a co-maintainer that can help me
keep the network package working on Windows. I don't have easy access to a
Windows machine (or even VM) anymore so testing on Windows is hard. What I'd
really like is a buildbot that builds the following Jenkins job as a
On Wed, Oct 5, 2011 at 2:37 PM, Tom Thorne thomas.thorn...@gmail.comwrote:
The only problem is that now I am getting random occasional segmentation
faults that I was not been getting before, and once got a message saying:
Main: schedule: re-entered unsafely
Perhaps a 'foreign import unsafe'
Hi,
On Wed, Oct 19, 2011 at 1:13 AM, Kazu Yamamoto k...@iij.ad.jp wrote:
Hello,
I'm measuring performance of the insertion operation of red-black
trees. For input, three kinds of [Int] are prepared: the increasing
the order, decreasing order, and random.
The random case is 4 or 5 times
On Wed, Oct 19, 2011 at 12:21 PM, Gregory Collins
g...@gregorycollins.netwrote:
On Wed, Oct 19, 2011 at 5:03 PM, Johan Tibell johan.tib...@gmail.com
wrote:
It does. You need to use evaluate to have ensure actually be evaluated.
I'm almost certain you're wrong about this. The bang
Hi,
On Thu, Oct 27, 2011 at 8:45 AM, Ryan Newton rrnew...@gmail.com wrote:
Based a quick perusal of Hackage there does not seem to be a lot of work in
this area. Of course, for Haskell the importance of this topic may be
diminished relative to pure data structures, but for doing
On Mon, Oct 31, 2011 at 12:08 AM, Gregory Crosswhite
gcrosswh...@gmail.comwrote:
I have uploaded a number of small packages to Hackage that I no longer
actively use so that I don't find out immediately when a new version of GHC
has broken them. Since Hackage is going to the trouble of finding
These are all very good questions! Here's my stab at it:
On Wed, Nov 2, 2011 at 11:28 AM, Ryan Newton rrnew...@gmail.com wrote:
What is the right interface for a queue? What is the right interface for
a random number generator?
For any given class I'd try to get a few experts/interested
On Thu, Nov 3, 2011 at 8:35 AM, Andreas Voellmy
andreas.voel...@gmail.comwrote:
I just read Kazu Yamamoto's article on a high performance web server in
the latest Monad.Reader, and I came across a statement that doesn't sound
correct to me. He says:
When a user thread issues a system call, a
On Mon, Nov 7, 2011 at 7:53 AM, Ben Gamari bgamari.f...@gmail.com wrote:
With GHC 1ece7b27a11c6947f0ae3a11703e22b7065a6b6c zlib fails to build,
apparently due to Safe Haskell (bug 5610 [1]). The error is specifically,
$ cabal install zlib
Resolving dependencies...
Configuring
On Mon, Nov 7, 2011 at 12:06 PM, Jason Dagit dag...@gmail.com wrote:
This is due to a change in how FFI imports and newtypes work. GHC was
recently changed to not allow you to use newtypes in FFI imports unless
the
constructor of the newtype is in scope. This broke quite a few
libraries.
On Wed, Nov 9, 2011 at 3:58 PM, Ryan Newton rrnew...@gmail.com wrote:
I don't know about you, but I personally haven't found the time to cast
back in time for each of my package's dependencies to find a true lower
bound version.
Do we have any tools that would do the following?
- ask
Hi Jason,
On Tue, Nov 15, 2011 at 12:08 PM, Jason Dusek jason.du...@gmail.com wrote:
Should I be annotating my functions with strictness, for the
vector reference, for example? Should I be using STUArrays,
instead?
From
On Wed, Nov 16, 2011 at 11:58 AM, Jason Dusek jason.du...@gmail.com wrote:
diff --git a/Rebuild.hs b/Rebuild.hs
@@ -15,6 +15,7 @@ import Data.STRef
import Data.String
import Data.Word
+import Control.DeepSeq
import Data.Vector.Unboxed (Vector)
import qualified Data.Vector.Unboxed as
On Wed, Nov 16, 2011 at 12:07 PM, Johan Tibell johan.tib...@gmail.comwrote:
On Wed, Nov 16, 2011 at 11:58 AM, Jason Dusek jason.du...@gmail.comwrote:
diff --git a/Rebuild.hs b/Rebuild.hs
@@ -15,6 +15,7 @@ import Data.STRef
import Data.String
import Data.Word
+import Control.DeepSeq
On Wed, Nov 16, 2011 at 12:33 PM, Antoine Latter aslat...@gmail.com wrote:
We already have one in base - it re-exports Data.STRef in whole :-)
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-STRef-Strict.html
Then it's wrong. :( In what sense is it strict? I think it should
On Wed, Nov 16, 2011 at 2:23 PM, Jason Dusek jason.du...@gmail.com wrote:
Just double checked. modifySTRef is too lazy:
-- |Mutate the contents of an 'STRef'
modifySTRef :: STRef s a - (a - a) - ST s ()
modifySTRef ref f = writeSTRef ref . f = readSTRef ref
We need Data.STRef.Strict
Hi all,
I spent some time today documenting a library and the experience left me
wanting a better markup language. In particular, Haddock lacks:
* markup for bold text: bold text works better than italics for emphasis
on computer monitors.
* hyperlinks with anchor texts: having the actual URL
Hi all,
Data.Map is getting split into Data.Map.Lazy and Data.Map.Strict (with
Data.Map re-exporting the lazy API). I want to better document the
strictness properties of the two new modules. Right now the
documentation for Data.Map.Strict reads:
Strictness properties
=
*
On Thu, Nov 17, 2011 at 9:21 PM, Johan Tibell johan.tib...@gmail.com wrote:
I'm not entirely happy with this formulation. I'm looking for
something that's clear (i.e. precise and concise, without leaving out
important information), assuming that the reader already knows how
lazy evaluation
On Fri, Nov 18, 2011 at 12:09 AM, Roman Cheplyaka r...@ro-che.info wrote:
Is it mentioned anywhere that Map is spine-strict?
It's not and we should probably mention it.
I was mulling this over last night. My initial thought was that it
shouldn't matter as long as the algorithmic complexity of
On Fri, Nov 18, 2011 at 1:58 AM, Roman Leshchinskiy r...@cse.unsw.edu.au
wrote:
Johan Tibell wrote:
map (\ v - undefined) == undefined
mapKeys (\ k - undefined) == undefined
Not really related to the question but I don't really understand how these
properties can possibly
On Fri, Nov 18, 2011 at 5:02 AM, Twan van Laarhoven twa...@gmail.com wrote:
* key and value function arguments passed to functions are
evaluated to WHNF before the function body is evaluated, and
function arguments passed to functions sounds a bit redundant. Either say
arguments passed to
Here's an attempt at an improved version:
Strictness properties
=
This module satisfies the following properties:
1. Key and value arguments are evaluated to WHNF;
2. Keys and values are evaluated to WHNF before they are stored in
the map.
Here are some examples that
On Fri, Nov 18, 2011 at 9:16 AM, Roman Cheplyaka r...@ro-che.info wrote:
* Johan Tibell johan.tib...@gmail.com [2011-11-18 08:06:29-0800]
On Fri, Nov 18, 2011 at 12:09 AM, Roman Cheplyaka r...@ro-che.info wrote:
Is it mentioned anywhere that Map is spine-strict?
It's not and we should
On Mon, Dec 5, 2011 at 6:09 AM, Yves Parès limestr...@gmail.com wrote:
However the performance issues seem odd: text is based on bytestring.
This is not the case. Text is based on ByteArray#, GHC internal type for
blocks of bytes. The text package depends on the bytestring package because
it
On Thu, Dec 8, 2011 at 8:12 AM, Christoph Breitkopf
chbreitk...@googlemail.com wrote:
Hello,
I'm in the process of implementing a container data type, and wonder what
class instances are generally considered necessary. E.g. is it ok to start
out with a Show that's adequate for debugging, or
(I forgot to announce v0.1 so this is a combined announcement.)
I'm proud to announce the ekg [1] library. The library lets you remotely
monitor any running Haskell program, using your web browser or an automated
monitoring program.
The library lets you monitor garbage collector and memory usage
On Thu, Jan 5, 2012 at 9:05 AM, Christoph Breitkopf
chbreitk...@googlemail.com wrote:
a) You are not allowed to remove or change the types of existing stuff.
Ok.
Unless you bump the major version number (i.e. X or Y in X.Y.Z.P).
That way people can depend on
IntervalMap == X.Y.Z.*
and be
On Thu, Jan 5, 2012 at 9:30 AM, Christoph Breitkopf
chbreitk...@googlemail.com wrote:
If I understand correctly, you would recommend:
- Mayor Version changes: as described in the guidelines: changed interface,
new instances
- Minor version change: when I just add functions
- Patchlevel
On Fri, Jan 13, 2012 at 10:46 AM, Simon Michael si...@joyful.com wrote:
Aha, thanks both.
The haskell organisation looks bigger, I think I'd like to upload feed
there. Could the owner add contact info or a how-to-join note to the page ?
The Haskell organization on GitHub is for core libraries
On Tue, Jan 31, 2012 at 1:22 PM, Gregory Collins
g...@gregorycollins.net wrote:
I completely agree on the first part, but deepseq is not a panacea either.
It's a big hammer and overuse can sometimes cause wasteful O(n) no-op
traversals of already-forced data structures. I also definitely
On Tue, Jan 31, 2012 at 12:19 PM, Steve Severance
ssevera...@alphaheavy.com wrote:
The webpage data was split out across tens of thousands of files compressed
binary. I used enumerator to load these files and select the appropriate
columns. This step was performed in parallel using parMap and
differently from my last name, I would have asked them to pick another one.
;)
-- Johan Tibell
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Feb 2, 2012 at 4:46 PM, Conrad Parker con...@metadecks.org wrote:
On 3 February 2012 08:30, Johan Tibell johan.tib...@gmail.com wrote:
On Thu, Feb 2, 2012 at 4:19 PM, Conrad Parker con...@metadecks.org
wrote:
I've followed what Johan Tibbell did in the hashable package:
If I
Hi,
Someone recently contributed a fix that should make network build with 7.4:
https://github.com/haskell/network/pull/25
Can you see if that works for you? I haven't yet had time to merge and
release that fix (I'm on vacation.)
-- Johan
___
Hi all,
Here's a heads-up that this year's Google of Code is kicking off. My
experience from the last few years is that we can maximize the output we
get from GSoC by being proactive and writing down semi-detailed
explanations of what kind of projects we'd like to see, instead of letting
the
of the prerpocessor directives.
With this change the code compiles well with:
http://neilmitchell.blogspot.com/2010/12/installing-haskell-network-library-on.html
However my compiled library lack the methods defined as foreign. I´ll
keep trying.
2012/2/6 Johan Tibell johan.tib...@gmail.com
this is not included in the object library
2012/2/7 Johan Tibell johan.tib...@gmail.com:
Note that there are two branches on github, master and
stable.
You
want
the
latter.
On Feb 7, 2012 8:23 AM, Alberto G. Corona
agocor...@gmail.com
test
All tests should pass.
-- Johan
On Wed, Feb 8, 2012 at 11:04 AM, Johan Tibell johan.tib...@gmail.comwrote:
I will merge this as soon as I get back from vacation.
On Feb 8, 2012 8:54 AM, Holger Reinhardt hreinha...@gmail.com wrote:
Having discussed the issue privately with Alberto, I've
simple: PASS
2012/2/13 Johan Tibell johan.tib...@gmail.com
I've merged and pushed the changes to the stable branch on GitHub. If
someone could verify that it works fine on Windows, I'll make another
release.
In addition to running whatever program you're interested in, also run:
cabal
Resending as the last message got held for moderation:
On Mon, Feb 13, 2012 at 10:18 AM, Johan Tibell johan.tib...@gmail.comwrote:
Version 2.3.0.11 released.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
On Mon, Feb 13, 2012 at 1:10 PM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
What's the time frame for project proposals? I have two ideas in my head
that I think are unusually cool. To make a successful SOC project, they
need a bit of preparation on my part, though, so I'm wondering
On Mon, Feb 13, 2012 at 3:20 PM, Greg Weber g...@gregweber.info wrote:
Other than changing the status myself, how do I get a priority
attached to my GSoC proposal?
What priorities are you referring to?
-- Johan
___
Haskell-Cafe mailing list
Yes. I rated some myself and left a motivation for my rating and waited for
someone to disagree. :) In general I was just trying to help students out
by pushing down proposals that (in my experience) where too hard to
complete in a summer or that were too narrow to benefit a larger portion of
the
On Wed, Feb 15, 2012 at 7:40 PM, Ryan Newton rrnew...@gmail.com wrote:
I'm interested in mentoring any projects related to concurrent data
structure implementation. Is it too late to propose new projects?
http://parfunk.blogspot.com/2012/02/potential-gsoc-haskell-lock-free-data.html
Not
On Thu, Feb 16, 2012 at 1:51 PM, Jeremy Shaw jer...@n-heptane.com wrote:
Sometimes we want to store very large collection types in RAM -- such as a
Data.Map or Data.IxSet.
It seems like we could trade-off some speed for space savings by compressing
the values in RAM.
Not knowing the actual
On Thu, Feb 16, 2012 at 2:03 PM, Antoine Latter aslat...@gmail.com wrote:
You could have a re-implemented HashMap which would un-pack the
payload's ByteString constructor into the leaves of the HashMap type
itself.
Then you would save on both the keys and the values.
Note that ByteString has
Hi Iavor,
On Mon, Feb 20, 2012 at 6:45 PM, Iavor Diatchki
iavor.diatc...@gmail.com wrote:
Hello,
I am happy to announce the availability of a little tool that I wrote while
I was doing some Haskell profiling. It converts GHC's heap-profiles into
HTML, and renders them nicely using the flot
On Mon, Feb 20, 2012 at 9:23 PM, Iavor Diatchki
iavor.diatc...@gmail.com wrote:
I started with the legend but it was too big on the program that i was
profiling, so i switched to the hovering mode. I agree that it is not
optimal. Perhaps there's a way to instruct flot to show only some of the
301 - 400 of 534 matches
Mail list logo
