ance was
exactly opposed to these reasonable use cases.
Silvio
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
array does provide folding functions, found in its Foldable and
Traversable instances.
Where can I find this? I can neither in the array package nor with
google nor with hoogle.
Silvio
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
aster depends very much on the problem at
hand. And array is just missing half the needed features.
Silvio
import Criterion.Main
import Criterion.Config
import Data.Word
import Data.Bits
import System.Random
import qualified Data.Vector.Unboxed as UVec
import qualified Data.Vector.Storable as
write :: MVector a -> Int -> a -> ST s a
This should have been:
write :: MVector s a -> Int -> a -> ST s a
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
t all
procedurally accelerated data structures like hash-tables.
Silvio
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There was a paper about this. I think I found it.
"Google's MapReduce Programming Model -- Revisited"
http://userpages.uni-koblenz.de/~laemmel/MapReduce/paper.pdf
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/list
t you get a ByteString back but
if you only use your own types where you write all the instances yourself you
should be safe.
silvio
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
very easy to understand.
silvio
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.4.11 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/
iQIcBAEBAgAGBQJP3s9EAAoJEDLsP+zrbatWUBIP/iWp4AUox1T+CkjaqOEi5qa8
YrJxK0STTjOMNtEA2IWBNHTt2WILKBIMUq6KbEL2o5uZBaWgloYobeyYHmQ8L9Tz
Rk
ways have to watch out for when dealing with ST is not
to return something that depends on s in the last statement (the one
you use runST on). In other words, if you want to return a vector you
have to freeze it, so it's not mutable anymore.
If you still can't figure it out paste some c
vm flag. It says somewhere that they don't
measure llvm because they don't have time. But I think they are
refering to clang. So maybe someone should tell them to turn on the
llvm flag since it makes a lot of haskell programs faster.
Silvio
-BEGIN PGP SIGNATURE-
Version: GnuPG v
a module, the module is imputed to be Main and
> the symbol main is exported from it. See the final paragraph of
> Section 5.1.
Didn't see that
I also think I figured out number why there should be an error in
number 3. Though I still thinks it's a very roundabout way of sa
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I am trying to write a haskell compiler and i have stumbled upon 2
issues that i don't understand in the Haskell report 2010. Btw. these
issues are also present in the 98 report.
1)
first is this in section 5.1 Module Structure [1]. A module is define
ne sum'
import Data.List
sum' = foldl' (+) 0
Silvio
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.4.11 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/
iQIcBAEBAgAGBQJOuTSFAAoJEDLsP+zrbatW3W8P/04IPhOqSvAI5Cau+GusInCr
CVu932qNVROMb++NHulEtx
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
> SF.hs:11:10: `>>>' is not a (visible) method of class `Arrow'
> Failed, modules loaded: none.
In the base package Arrows are defined a bit different from what you
some times see in the literature. I also stumbled over this once. The
(>>>) operator
14 matches
Mail list logo
