> Apparently it doesn't, and it seems to be fixed now.
Does anyone know what exactly the bug was? Because this seems like a
serious bug to me. I've run into it myself today and wasn't happy.
Linear algorithms should work in linear time however much memory they
allocate (modulo cache thrashing of c
> So the question remains: is there a way to limit a parser to a finite chunk
> of input? Perhaps a way to run the 'take n' parser on the input and then run
> another parser on its result? This smells like monadic behavior, but of
> course with different semantics than the Monad instance for Parser
I agree on all counts! The hex-handling logic here is so straightforward
that it's hardly worth bothering with. In fact, my application's code as it
stands looks very similar to what you wrote. I'm really asking because I
want to be more "fluent" in attoparsec.
So the question remains: is there a
BTW you probably want 'data Color = Color !Word8 !Word8 !Word8'
On Fri, Sep 23, 2011 at 8:21 PM, Evan Laforge wrote:
> On Fri, Sep 23, 2011 at 8:04 PM, Michael Craig wrote:
>> Suppose we want to parse a 24-bit hex color value:
>> input :: ByteString
>> input = "af093c blah blah blah"
>> type Col
On Fri, Sep 23, 2011 at 8:04 PM, Michael Craig wrote:
> Suppose we want to parse a 24-bit hex color value:
> input :: ByteString
> input = "af093c blah blah blah"
> type Color = (Word8, Word8, Word8)
>
> Attoparsec.Char8 exports a nice hexadecimal parser, but it consumes all
> available hex-flavor
Suppose we want to parse a 24-bit hex color value:
input :: ByteString
input = "af093c blah blah blah"
type Color = (Word8, Word8, Word8)
Attoparsec.Char8 exports a nice hexadecimal parser, but it consumes all
available hex-flavored input. I'd like to make it consume exactly two bytes,
so I cou
I use hashStableName to split the names up then walk down the list use equality
comparisons on an expected O(1) items. I'll probably rewrite it using unordered
containers, since Tibbe does the same sans the stable names.
Sent from my iPad
On Sep 23, 2011, at 5:54 AM, "Alberto G. Corona " wrote
You still need IO to get the stable name out to use. :)
Sent from my iPad
On Sep 23, 2011, at 5:33 AM, Sean Leather wrote:
> Hi Edward,
>
> On Thu, Sep 22, 2011 at 16:50, Edward Kmett wrote:
> I have a "stable-maps" package that provides lookup and inserting into a map
> via stable names.
>
Has a class like
class Decoration t where
type Datum t :: *
value :: t -> Datum t
been defined in any of the haskell packages on hackage? [There are so
many variants on naming, it is rather difficult to search for this]
Jacques
___
Haskell-Caf
There are for sure people who know better Haskell on Mac than me.
When I made tests for EclipseFP, I just used the latest Haskell Platform
release containing GHC 7.0.3 and it worked fine. Maybe the best thing you
can do is start all over again using Haskell platform, if you don't need any
new featu
yes... i have the same feeling..
but don't know why it should matter
homebrew installs it in /usr/local/Cellar/ghc/7.0.4/bin
but it creates a symlink in /usr/local/bin
so, it's part of the path.
I can try to install it again, with the .pkg that it's available at
http://hackage.haskell.org/platfor
How do you do that, since Stable Names have not an Ord instance?. Using the
Eq instance the lookup should be O(n).
The paper suggest that SNMap is a hash table, presumably with
hashStableNames underneath:
This should work more or less . using Data.HashTable
Import Data.HashTable
import Data.Dyn
Hi Edward,
On Thu, Sep 22, 2011 at 16:50, Edward Kmett wrote:
> I have a "stable-maps" package that provides lookup and inserting into a
> map via stable names.
The paper mentions the need for a mutable finite map, and all the operations
are IO. Do you know why this is and what's different with
On 09/22/2011 02:00 AM, Felipe Almeida Lessa wrote:
On Wed, Sep 21, 2011 at 5:19 PM, Vincent Hanquez wrote:
Also, it seems that cryptohash's Skein is currently broken. The skein
package comes with the "golden" KATs sent by the Skein team to the
NIST, and passes everything. OTOH, cryptohash's
Joachim Breitner wrote:
Felipe Almeida Lessa wrote:
Given that you are following the PVP, I would put the following constraint:
Build-depends: foo >= 0.1 && < 0.2
However, if someone with an older version of foo installed on their
system tried to install my package, they would get a type err
15 matches
Mail list logo
