strategy -- that
one comes to appreciate the Way and its Power.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Jonathan Cast wrote:
> Jason Dusek wrote:
> > Thus it is in practical arts -- Chinese medicine, Taiji,
> > strategy -- that one comes to appreciate the Way and its
> > Power.
>
> But nonetheless, Haskell is not a practical art, no more than
> theoretical physics o
I upmodded this on Reddit. Thank you for your work.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Henning Thielemann wrote:
> Jason Dusek schrieb:
> > I'm taking a stab at composable streams, starting with
> > cursors. I managed to make a derived cursor today -- as I
> > work through this stuff, I hope to understand
> > Iteratee/Enumerator better.
>
>
/Enumerator approach. The notion that we just
"fold" over the (potentially side-effecting) data structure is
probably misleading unless you already understand the design.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
h
of Windows developers
be represented -- I was myself surprised to discover that the
UUID package only worked on Linux -- it would be
unconstructive to carry out such discussions offlist.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
It is really too bad we can not define the operators
>_> ^_^ <_<
These are significant from an internationalization standpoint;
and they'd make the language so much more competitive
vis-a-vis LOLCode.
--
Jason Dusek
2009/1/10 Brandon S. Allbery KF8NH :
> O
Some day, we're going to need a short, catchy name for Cabal
packages. Let's call them cabbages.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
can be extended to the other ones, at the cost of
a few characters.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/09/20 Joe Fredette :
> I also agree. Hackage should also be renamed to something appropriate.
>
> The Cabbage Patch?
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
etable -- good raw
or pickled or in little salady things like coleslaw -- finds
itself used as a disincentive.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
t the
bottom that has exactly the format of the "user" property of
the schema ahead of it -- why is that? Well, `json-schema`
uses a fault tolerant parsing approach; the very last Tweet
was cut off and the "user" property's value was among the
things that coul
2009/09/28 John A. De Goes :
> Libraries are _everything_...
Not exactly. Python would never have gotten a foothold over
Perl, nor Java over C, if cleaner language semantics weren't
enough for some shops or certain applications.
--
Jas
This version fixes defective handling of empty objects and
arrays.
http://hackage.haskell.org/package/json-b-0.0.4
Thanks to Dmitry Astapov for this fix.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
ve been
enough to keep Python and Ruby from ever growing into the
force they now are.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
How do you read in the IOUArray? By parsing a character string
or do you treat the file as binary numbers or ... ?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/11/4 Philippos Apolinarius
> Jason Dusek wrote:
> > How do you read in the IOUArray? By parsing a character
> > string or do you treat the file as binary numbers or ... ?
>
> I always pare the file. Parsing the file has the advantage of
> alowing me to have files of
2009/11/04 Jason Dusek :
> ...you "parse the file" I imagine you in face...
in face -> in fact
Sorry.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Does marking the call `unsafe` make any difference?
This is running on a *NIX of some flavour?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
osecport :: IO ()
Let us know if this helps.
> Here is the compilation script:
>
> ghc -fglasgow-exts serial.c %1.hs -L./ -ljapi --make
> erase *.hi
> erase *.o
> strip %1.exe
I encourage you to look into Cabal soon :)
--
Jason Dusek
___
`argv` is `char**` and not
`char*`, right?) so we introduce `stringPrim` and then build
up the primitives from that.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
wonder, does the
Haskell always call `closecport`? Maybe you could put in a
print statement in the C to find out?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
DemoFailure.o )
Linking demo ...
0x5cff -1 峿
:; chmod ug+x DemoFailure.hs && DemoFailure.hs
0x5cff 2 峿
Switching between safe/unsafe does not make any difference. This
was run on a Macintosh.
--
Jason Dusek
#!/usr/bin/env runhaskell
{- DemoFailur
Thank you very much!
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There is a Cabal package for this already:
http://hackage.haskell.org/package/setlocale
A call to `setLocale LC_ALL (Just "")` in `main` fixes things.
--
Jason Dusek
2009/11/13 Daniel Fischer :
> Am Samstag 14 November 2009 00:00:36 schrieb Jason Dusek:
>> I
evening when I was fleshing out the JSON parser).
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
quite keen on releasing my JSON
parser in a timely manner; the maintainer was (very
reasonably) not on my schedule and I'm not sure my patch was
ever applied.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.has
one column wide.
In addition, a little utility is provided that constructs a
table of widths by character and a listing of character ranges
with the same width. On different systems, `wcwidth` may
assign different widths to the same character for some obscure
characters.
--
J
ing
properties as "part of an object", it's natural to go the
record syntax route; but this doesn't capture the notion that
all these records conform to a certain type equation. In this
way, Haskell is more demanding of you; but it also offers you
a way to make the
osition of `sequence_`
and `map`.
mapM_ f list = sequence_ (map f list)
As for `preserveMatrix`, it is some OpenGL thing; probably
what it does is ensure that any changes you make to one of the
matrices that make up the rendering state are undone once you
exit the enclo
-2.1.0.0
Then the maintainer of Parsec specifies that 2.1.0.1 is
compatible with 2.1.0.0 and we can compile the second package,
the one that require 2.1.0.0, with 2.1.0.1 since they are
compatible and that is all it is asking for. Then we try to
use these two packages together and everyth
unjust, and it encourages more of the same. It's like
> littering your own house.
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
n points out in his wiki article, you can't expect to
catch those as they don't throw exceptions or cause any
errors! You need to validate the input or use a timer in that
case. Relying on the program to crash in a timely manner if
something is wrong with the input is not
ave a tool for binding to native code
in a way that trusts it to be pure, I don't see how having a
way to bind to nominally side-effecting Haskell code in a way
that trusts it to be pure adds anything to our troubles.
--
Jason Dusek
___
Haskell-
ry" and "packages"?
The types don't tell us what libraries we need. They don't
tell us how much RAM/CPU we need, either.
> Pure functional code as the minimal essence of pure
> computation -- everything else an EDSL.
Partial or total code?
--
Jason Dusek
__
2009/12/12 Luke Palmer :
> On Fri, Dec 11, 2009 at 7:07 PM, Jason Dusek wrote:
> > Where do we draw the line between "machinery" and "packages"?
> > The types don't tell us what libraries we need.
>
> ...you might mean what *haskell* libraries does a
2009/12/14 Edward Kmett :
> [...] That doesn't mean that I want to subject myself to working
> in such a sufficient computing environment :)
Sufficient?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.
've done one Haskell contract this year, for legal document
processing. This was a case where the client was definitely
"more focused on the solution than the language used" and
really cared a lot more about a good CLI and clearly defined
output for each proce
What is the relationship between the "Parsec API", Applicative
and Alternative? Is the only point of overlap `<|>`?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/12/16 Stephen Tetley :
> 2009/12/16 Jason Dusek :
> > What is the relationship between the "Parsec API", Applicative
> > and Alternative? Is the only point of overlap `<|>`?
>
> Lots of functions in Text.ParserCombinators.Parsec.Combinator can be
>
te them with a
Haskell comment, like `-- EOT`. Since your message always
comes wrapped in a list, you could just use the square
brackets to tell you when you're done.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
h
2009/12/16 Mitar :
> On Wed, Dec 16, 2009 at 11:25 PM, Jason Dusek wrote:
> Criterion for garbage is that it is not readable with "read" and that
> not because there would be not enough data available. It seems that I
> will need to do buffer filling and reading at the same
tural (for Haskell) approach.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Concatenating two `ByteString`s is O(n)?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm curious what happened to these two projects and if any
docs remain for them.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
A quick check on Hayoo! and in my interpreter shows that
there are basically no instances of `IsString`. Is it
really so little used?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
2009/12/20 Brandon S. Allbery KF8NH :
> On Dec 20, 2009, at 17:09 , Jason Dusek wrote:
> >
> > A quick check on Hayoo! and in my interpreter shows that
> > there are basically no instances of `IsString`. Is it
> > really so little used?
>
>
> The only 2 instan
use the flags
--extra-include-dirs= and --extra-lib-dirs= to specify where it is.
It takes like a minute to err out, too. This isn't urgent or
anything but it would be nice to know how to get this build
process -- C generation followed by compilation -- to
Thanks; this should be enough for me to get it working again.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
use `guard' and `when' and other monadic operations.
The `MonadPlus' instance gives you access to `msum'. It's not
just about `do' notation :)
> 3. The comprehension syntax for Lists in Haskell - can that be
> used in anyway for other Monads?
Not a
m misunderstanding you, but `eval :: M t -> t' does
not fall out of the definition of a monad. You need more than
monadicity -- you need an algebra for `M' at `t'.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
der what approaches have been tried here?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/12/29 Luke Palmer :
> > They are another group, too -- the group with `*':
> >
> > Group* = (*, 1, 1 / _)
>
> Ignoring 0 for sake of discussion.
Doh.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haske
to release HPath in conjunction with
LaTeX macros to allow easy inclusion of Haskell in elaborate
documents.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Yes, I just saw that.
http://hackage.haskell.org/package/HPath-0.0.1
It doesn't handle Haskell needing the C preprocessor and
there are some real problems with the output of data/type
definitions -- I hope to resolve these shortly.
--
Jason
Here is a bug report for the newlines issue:
http://trac.haskell.org/haskell-src-exts/ticket/188
A tentative patch is also included. This is not something I can
really fix within HPath, unfortunately.
--
Jason Dusek
___
Haskell-Cafe mailing
-- the Trippy RGB
Waves kit from Lady Ada. I am (gratuitously) exploring ways to
program it with Haskell.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
does nothing. All the work is
> done by blink_atom() which is called out of the ISR (Interrupt
> Service Routine).
Thanks for the example.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
it is to ensure non-interleaved
execution for safe multi-threading?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Wait, no -- I missed something. As long as the outermost Atom
routine is run every `n' µs by a hardware clock, the counter
(`__global_clock') will contain an accurate count of how many
`n' µs intervals have passed in our application.
This version of `HPath' depends on new release of
`haskell-src-exts' with improved pretty printing.
http://hackage.haskell.org/package/HPath-0.0.2
No other changes have been made.
--
Jason Dusek
___
Haskell-Cafe mailing list
Ha
Well, you can, with:
-XTypeSynonymInstances
though I'm not sure it addresses your specific need.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
how the `__global_clock' influences
execution in the present system.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Patched by Antoine S. Latter to interoperate with UUID.
http://hackage.haskell.org/package/system-uuid-1.2.0
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I believe GMail put the original message in my SPAM folder.
Which is just as well. Let me re-affirm the collective
rejection of this post. Very no!
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
Monk and nun?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
e all my shell scripts
in Haskell -- especially those scripts that drive SSH
connections or multiple external processes -- but the line
noise penalty is pretty high right now. Using quasi-quotation
-- a kind of pre-processor -- with a more shell-like set of
shortcuts might be just the right
ode system? They don't seem to
offer it, last I checked.
I'm looking in to doing this with PRGMR, which has pretty good
pricing though it's not nearly as featureful as Linode.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haske
What about System.FUSE then?
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I have a program here:
https://svn.j-s-n.org/public/haskell/cedict
currently at revision 302, which compiles okay but I can't get
it to work. I'm using the FFI to take a (currently small)
array and translate it into a Map.
It compiles fine and loads fine -- but it doesn't run fine:
Thomas Schilling <[EMAIL PROTECTED]> wrote:
> Did you try removing all .hi and .o files?
Yes. I tried it again this morning, and I've got the same
error -- same unknown symbol, &c.
I don't have trouble with most Haskell programs on my Mac, so
I assume it's the way I'm connecting to C that
The message
unknown symbol `___stginit_cedictzm0zi1zi1_DataziCharziCEDICTziMatter_'
says that it can't find the initializer for`
Data.Char.CEDICT.Matter` in `cedict-0.1.1` (this is
'z-encoding', if I remember correctly). So, the odd thing is,
that is not the part with the C FFI stuf
Bertram Felgenhauer <[EMAIL PROTECTED]> wrote:
> Jason Dusek wrote:
> > It compiles fine and loads fine -- but it doesn't run fine:
> > unknown symbol `___stginit_cedictzm0zi1zi1_DataziCharziCEDICTziMatter_'
>
> This is a cabal pitfall.
Thank you
Stefan O'Rear <[EMAIL PROTECTED]> wrote:
> The only type that you are allowed to assume corresponds to a C int is
> CInt, in the Foreign.C.Types module. This probably isn't the problem,
> but it could make problems of its own on a 64-bit or otherwise weird
> system.
So say I turn everything
Thanks for your answers, everybody.
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
David Roundy <[EMAIL PROTECTED]> wrote:
> ...when in text mode on DOS-descended systems, the
> character sequence "\r\n" is converted to "\n" by the operating
> system.
So basically, Windows supports both the "\n" convention and
the "\r\n" convention by making a distinction between "text"
an
I'm trying to build the LDAP libs, version 0.6.3, on a recent
MacBook Air with OpenLDAP 2.3.27 (the version of OpenLDAP
shipped by Apple).
The "atom sorting error" I get from `ld` is outside my range
of knowledge -- if some could advise me on how to get around
it, I'd be much obliged.
David Menendez <[EMAIL PROTECTED]> wrote:
> I've often thought it would be for Haskell to steal Agda's
> module syntax. It does pretty much everything you want (plus
> some other stuff we maybe don't need) and the various things
> it does fit together logically.
What does that look like? I've be
David Menendez <[EMAIL PROTECTED]> wrote:
> Jason Dusek <[EMAIL PROTECTED]> wrote:
> > David Menendez <[EMAIL PROTECTED]> wrote:
> > > I've often thought it would be for Haskell to steal Agda's
> > > module syntax.
> >
>
John Meacham <[EMAIL PROTECTED]> wrote:
> Chris Kuklewicz wrote:
> > I have reached an impasse in designing a Haskell API for the
> > google's The messages in protobuf are defined in a namespace
> > that nests in the usual hierarchical OO style that Java
> > encourages.
>
> > To avoid namespace con
Maybe you could try building it with 2.8 and let us know how
it goes?
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I am unable to build Haddock 2.1, with the odd error:
src/Haddock/GHC/Typecheck.hs:82:4:
Constructor `HsModule' should have 7 arguments, but has been given 8
What is the root of it, you think?
--
_jsn
Configuring haddock-2.1.0...
Dependency base-any: using base-3.0.2.0
Depen
for example: "head (filter (\x -> x > 5) [1..])"
in a strict language, you can't easily play with infinite lists
In a strict language, you would write that as "6" :)
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://ww
Thank you.
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm trying to figure out the adjunction diagrams for the
adjunction where the diagonal functor is right adjoint to the
coproduct functor. I'm |almost done|, but the co-unit has me
stumped, because I can't figure out how the arrow at the top
can be unique -- it seems it could be either one
Eric Kow <[EMAIL PROTECTED]> wrote:
> "I would contribute to darcs if only..."
...there were interest in binary file handling.
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Derek Elkins <[EMAIL PROTECTED]> wrote:
> h : A -> C and k : B -> C
> [...snip...]
> h : A -> B
> k : C -> D
Are these the same h and k?
--
́́_jsn
́
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haske
Derek Elkins <[EMAIL PROTECTED]> wrote:
> [id,id] is the counit.
> [id,id] : C+C -> C
> Given a function f : A+B -> C there exists a unique function
> f* : (A,B) -> (C,C) that is a pair of functions
> h : A -> C and k : B -> C such that
> [id,id] . h+k = f.
This f is what I have labelled [f,g] (
Derek Elkins <[EMAIL PROTECTED]> wrote:
> Jason Dusek wrote:
> > the unique arrow that goes from A+B to C+C is f+g -- but
> > that would make C+C just the same as C.
>
> The unique arrow is f* : (A,B) -> (C,C), -not- an arrow A+B ->
> C+C. An arrow f : A+B -
Derek Elkins <[EMAIL PROTECTED]> wrote:
> The notation f+g is the notation for the functorial action of
> + : CxC -> C on arrows, that is, if f : A -> B and g : C -> D
> then f+g : A+C -> B+D.
So [f,g] and f+g different. I assumed that the functorial
action of + on arrows was to take ((A -> C)
So I guess the Wikipedia page has an error in it?
http://en.wikipedia.org/wiki/Coproduct#Definition
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
What about the part that reads:
The unique arrow f making this diagram commute is then
correspondingly denoted f1 ∐ f2 or f1 ⊕ f2 or f1 + f2 or
[f1, f2]
This would seem to say that [f,g] and f+g are the same thing
-- but if I've understood Derek Elkins' remarks, the latter is
Derek Elkins <[EMAIL PROTECTED]> wrote:
> Jason Dusek wrote:
>> What about the part that reads:
>>
>> The unique arrow f making this diagram commute is then
>> correspondingly denoted f1 ∐ f2 or f1 ⊕ f2 or f1 + f2 or
>> [f1, f2]
>>
>>
zooko <[EMAIL PROTECTED]> wrote:
> Jason Dusek wrote:
> > Eric Kow <[EMAIL PROTECTED]> wrote:
> > >
> > > "I would contribute to darcs if only..."
> >
> > ...there were interest in binary file handling.
>
> ...what do you mean --
I've gotten most of my category theory help through the
Haskell community one way or another, but I hesitate to ask
more questions on this list if there is a better forum.
Googling turned up an old, closed list.
Is there somewhere else I should be asking my questions -- for
example, I
The problem as stated is to find the unit for the adjunction:
((- x A), (-)^A x A)
The latter functor takes an arrow f to (f . -) x id_A and does
the obvious thing for objects. The co-unit diagram is given
as:
B^A x A eval_AB > B
^
Jonathan Cast <[EMAIL PROTECTED]> wrote:
> Jason Dusek wrote:
> > It is an arrow that takes a C to an arrow that takes an A
> > and makes the product C x A. I want to write curry(C x A)
> > but that is ridiculous looking. What's the right notation
> > for
Thanks!
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'd like to perform a micro-benchmark, pitting ByteString
comparision against Word comparison. What I'd like to do is:
. Generate a bunch of random Word32s.
. Generate strict ByteStrings containing those Word32s.
. Compare every Word32 with every other Word32 for equality,
and see ho
I found an old lib for it:
http://www.haskell.org/ghc/docs/6.0/html/unix/System.Sendfile.html
Hoogle turns up nothing, though.
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
201 - 300 of 381 matches
Mail list logo