Using insertWith' gets time down to 30-40 secs (thus only being 3-4
times slower than PHP).
PHP still is at 13 secs, does not require installing libraries - does
not require compilation and is trivial to write.
A trivial C++ application takes 11-12secs and even with some googling
was trivial to
On Tue, Jan 31, 2012 at 2:51 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
On the other hand, a designed-to-be-strict language-and-libraries
with close-to-Haskell *syntax* would be nice. I recently
described F# as combining the beauty of Caml with the functional
purity of C# -- both of
On Tue, Jan 31, 2012 at 6:05 AM, Marc Weber marco-owe...@gmx.de wrote:
I didn't say that I tried your code. I gave enumerator package a try
counting lines which I expected to behave similar to conduits
because both serve a similar purpose.
Then I hit the the sourceFile returns chunked lines
On Thu, Jan 26, 2012 at 11:42 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
- Fast enough: the streaming interface achieves 12 MiB/s for parsing,
which is pretty nice considering that there are some known overheads
on its implementation.
I've just released biostockholm 0.2.1 which
Donn Cave donn at avvanta.com writes:
On 28/01/2012 13:00, Paul R wrote:
...
All this dot syntax magic frankly frightens me. Haskell, as a pure
functionnal language, requires (and allows !) a programming style that
just does not mix well with object oriented practices.
In the
On Sat, Jan 28, 2012 at 12:51 PM, Jean-Marie Gaillourdet
j...@gaillourdet.net wrote:
Hello,
On 27.01.2012, at 00:47, Alexander V Vershilov wrote:
Recently I asked about tcp server libraries [1] and there was only one
answer haskell-scallable-server [2], but in that package there was some
On 01/29/2012 11:55 PM, Edward Z. Yang wrote:
Excerpts from Mikhail Vorozhtsov's message of Sun Jan 29 05:34:17 -0500 2012:
[snip]
I think it is one of the simplest layouts one can some up with. I'll try
to explain the motivation behind each inclusion.
ABORTS(μ) ⊆ RECOVERABLE_ZEROS(μ)
I'm
Hi,
On 29.01.2012, at 23:30, wren ng thornton wrote:
On 1/29/12 5:48 AM, Roman Cheplyaka wrote:
* wren ng thorntonw...@freegeek.org [2012-01-28 23:06:08-0500]
Why not to make it more pure? That is, return a lazy list of Ints (but
not a CAF), which user can throw away by the usual GC
On Mon, Jan 30, 2012 at 8:19 AM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Sun, 29 Jan 2012, Simon Meier wrote:
I'm currently using Neil Mitchell's cmdargs package [1]. How does your
package compare to that?
Last time I checked cmdargs it was not referential transparent.
Can I really rename old.T = new.T_orig ?
It looks as if then tries to load the wrong acid-state snapshot.
The name of your data type doesn't matter as acid-state doesn't store
that on the disk.
I think it does - because file names are state/T/*.log and so on?
J.W.
On Tue, Jan 31, 2012 at 8:27 AM, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
Can I really rename old.T = new.T_orig ?
It looks as if then tries to load the wrong acid-state snapshot.
The name of your data type doesn't matter as acid-state doesn't store
that on the disk.
I
jsonLines :: C.Resource m = C.Conduit B.ByteString m Value
jsonLines = C.sequenceSink () $ do
val - CA.sinkParser json'
CB.dropWhile isSpace_w8
return $ C.Emit () [val]
Adding a \state - (the way Felipe Lessa told me) make is work and
it runs in about 20sec and that although some
Quoth AntC anthony_clay...@clear.net.nz,
...
My proposal is that field selection functions be just ordinary functions, and
dot notation be just function application(tight-binding). Then:
object.fieldfuncmethod == fieldfuncmethod object
(Subject to the tight binding for the dot.)
And
On Tue, Jan 31, 2012 at 1:36 PM, Marc Weber marco-owe...@gmx.de wrote:
Adding a \state - (the way Felipe Lessa told me) make is work and
it runs in about 20sec and that although some conduit overhead is likely
to take place.
Just out of curiosity: did you use conduit 0.1 or 0.2?
Cheers! =)
Excerpts from Felipe Almeida Lessa's message of Tue Jan 31 16:49:52 +0100 2012:
Just out of curiosity: did you use conduit 0.1 or 0.2?
I updated to 0.2 today because I was looking for a monad instance for
SequenceSink - but didn't find it cause I tried using it the wrong way
(\state - see last
Hi Everyone,
I had a similar experience with a similar type of problem. The
application was analyzing web pages that our web crawler had collected,
well not the pages themselves but metadata about when the page was
collected.
The basic query was:
SELECT
Domain, Date, COUNT(*)
FROM
Pages
On Tue, Jan 31, 2012 at 9:19 PM, Steve Severance
ssevera...@alphaheavy.comwrote:
The other thing is that deepseq is very important . IMHO this needs to be
a first class language feature with all major libraries shipping with
deepseq instances. There seems to have been some movement on this
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
Hello cafe,
in Hamburg this month a new Haskell User Group has formed. We are trying
to establish a monthly meetup with hopefully interesting talks.
For the start we are having our first regular meetup on the 9th of
February, 19:00 in the betahaus hamburg. On this day I will give a talk
about
Donn Cave donn at avvanta.com writes:
Quoth AntC anthony_clayden at clear.net.nz,
...
My proposal is that field selection functions be just ordinary functions,
and
dot notation be just function application(tight-binding). Then:
object.fieldfuncmethod == fieldfuncmethod object
Crypto-API is a generic interface for cryptographic operations,
defining classes for hashes, ciphers, and random number generation
while also providing convenience functions such as block cipher modes
and padding. Maintainers of hash and cipher implementations are
encouraged to add instances for
On Tue, Jan 31, 2012 at 9:36 PM, Thomas DuBuisson
thomas.dubuis...@gmail.com wrote:
Release 0.9 Changes:
* Crypto.Classes now exports 'Data.Serialize.encode'
* AsymCipher now has proper fundeps
* cpolysArr is no longer one big line
Also:
* MacKey has phantom types.
This seems to be the
On 12-01-30 08:06 AM, Pēteris Paikens wrote:
import Text.XML.HXT.Core
import Text.XML.HXT.DOM.XmlTreeFilter
selectAllText :: ArrowXml a = a XmlTree XmlTree
selectAllText = deep isXText
Delete import Text.XML.HXT.DOM.XmlTreeFilter. Change isXText to
isText. That is,
import
Oh, sorry for the omission! I've worked out of HEAD for long enough
that I though that was in 0.8.
On Tue, Jan 31, 2012 at 5:36 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
Also:
* MacKey has phantom types.
This seems to be the only breaking change [1].
On 1/02/2012, at 11:38 AM, AntC wrote:
As soon as you decide to make 'virtual record selectors' just ordinary
functions (so they select but not update), then you can see that field names
are also just ordinary functions (for selection purposes). So the semantics
for field 'selection'
Here are my initial ideas about supporting cookies. Note that I'm using
Chrome for ideas since it's open source.
- Network/HTTP/Conduit/Cookies.hs file
- Exporting the following symbols:
- type StuffedCookie = SetCookie
- A regular SetCookie can have Nothing for its Domain
Well, this is embarrassing. Please disregard my previous email. I should
learn to read the RFC *before* submitting proposals.
--Myles
On Tue, Jan 31, 2012 at 6:37 PM, Myles C. Maxfield myles.maxfi...@gmail.com
wrote:
Here are my initial ideas about supporting cookies. Note that I'm using
On 1/02/2012, at 11:38 AM, AntC wrote:
As soon as you decide to make 'virtual record selectors'
just ordinary functions (so they select but not update)
, then you can see that field names are also just
ordinary functions (for selection purposes). So the
semantics for field
On 1/30/12 12:55 PM, Balazs Komuves wrote:
-- combinatorics 0.1.0
The combinatorics package offers efficient *exact* computation of common
combinatorial functions like the binomial coefficients and
On 1/30/12 3:54 PM, Roman Cheplyaka wrote:
Makes sense; but doesn't making the monad abstract and putting all
functions in the monad address the fragility issue?
The primary issue with monads is that the syntax is extremely cumbersome
for the expected use case. It'd be like paranoid C where,
On 1/31/12 8:58 AM, Jean-Marie Gaillourdet wrote:
A slight variation on that approach is to use implicit parameters to
parameterize your functions by the primes. Something allong the following lines:
That is another option. However, implicit parameters are GHC-only and
seldom used even in
On Tue, 31 Jan 2012 23:10:34 -0700, Anthony Clayden
anthony_clay...@clear.net.nz wrote:
I'm proposing x.f is _exactly_ f x. That is, the x.f gets
desugared at an early phase in compilation.
Anthony,
I think part of the concern people are expressing here is that the above
would imply the
33 matches
Mail list logo
