On Tue, Nov 9, 2010 at 5:37 PM, Mitar wrote:
> Why is ThreadKilled not displayed by RTS when send to thread (and
> unhandled), but any other exception is?
A ThreadKilled exception is not printed to stderr because it's not
really an error and should not be reported as such. It is also clear
how to
On Tue, Nov 9, 2010 at 5:47 PM, David Peixotto wrote:
>
> On Nov 9, 2010, at 3:45 PM, Jason Dagit wrote:
>
> I have a few questions:
> * What differentiates fibon from criterion? I see both use the
> statistics package.
>
>
> I think the two packages have different benchmarking targets.
>
> Cr
On Nov 9, 2010, at 3:45 PM, Jason Dagit wrote:
> I have a few questions:
> * What differentiates fibon from criterion? I see both use the statistics
> package.
I think the two packages have different benchmarking targets.
Criterion allows you to easily test individual functions and gives som
Hi,
I've just released HTTP 4000.1.0 to hackage:
- Fixed a bug that caused infinite loops for some URLs on some platforms
(whether the URL was a trigger is probably related to the size of the
returned data, and the affected platforms. Based on a patch by Daniel
Wagner.
- This is technic
Excerpts from Aaron Gray's message of Tue Nov 09 18:40:47 +0100 2010:
> Is there a Flash ActionScript Byte Code generating backend for Haskell ?
>
> I know there was an older SWF 3 backend :-
>
> http://www.n-heptane.com/nhlab/repos/haskell-swf/
>
> But is there anything more up to date ?
T
On 10/11/2010, at 12:50 AM, Bulat Ziganshin wrote:
> i never programmed in COBOL, but afaik data structures usually was
> organized this way - together with level numbers at left. it was just
> easier to read it this way
The clue here is "level numbers".
In a declaration like
01 Thingy
Anton Kholomiov wrote:
> no, it's not here any more, but i've added tutorial. look for update
>
> http://hackage.haskell.org/package/csound-expression
Thanks for that, but wouldn't it be nicer to move the
tutorial out of the library sources directoru src/ ?
Cheers,
Erik
--
On Tue, Nov 9, 2010 at 1:24 PM, David Peixotto wrote:
> I'm pleased to announce the release of the Fibon benchmark tools and suite.
>
> Fibon is a set of tools for running and analyzing benchmark programs in
> Haskell. Most importantly, it includes an optional set of benchmark
> programs includin
You might want to consider SVG only as an output format.
As a graphics format it is very baroque with many special cases and
sundry obscure corners. If you like grand challenges, round-tripping
SVG might be interesting. Unfortunately this would likely consume all
the effort that you would otherwis
I'm pleased to announce the release of the Fibon benchmark tools and suite.
Fibon is a set of tools for running and analyzing benchmark programs in
Haskell. Most importantly, it includes an optional set of benchmark
programs including many programs taken from the Hackage open source
repository.
T
Hello,
I wrote the old backend. I have not (and will not) have the time to
update to the newer SWF format. Unless things have changed, the format
is well documented -- so you don't have to reverse engineer it if you
want to make your own attempt.
That said, if you are trying to generate a
On Tue, 9 Nov 2010, Permjacov Evgeniy wrote:
First question. As I saw in sources, both hxt and haxml uses [Char]'s.
this is very inefficient. I want to know, does any effective parser for
haskell, written in haskell, exists. Efficient means using ByteString to
store strings and possibly buildin
First question. As I saw in sources, both hxt and haxml uses [Char]'s.
this is very inefficient. I want to know, does any effective parser for
haskell, written in haskell, exists. Efficient means using ByteString to
store strings and possibly building representations that shares one
string for all
Is there a Flash ActionScript Byte Code generating backend for Haskell ?
I know there was an older SWF 3 backend :-
http://www.n-heptane.com/nhlab/repos/haskell-swf/
But is there anything more up to date ?
Aaron
___
Haskell-Cafe mailing list
Haske
no, it's not here any more, but i've added tutorial. look for update
http://hackage.haskell.org/package/csound-expression
2010/11/4 C K Kashyap
> Hi Erik,
>
> > This looks very interesting and seems to have quite comprehensive
> > reference documentation. Unfortunately there doesn't seem to
Hi!
I have been spend some time to debug this in my program. ;-)
Why is ThreadKilled not displayed by RTS when send to thread (and
unhandled), but any other exception is?
For example, I am using custom exceptions to signal different kinds of
thread killing. Based on those my threads cleanup in d
Oops .. I made a mistake .. I had gone with Felipe's solution -
>>
>> getActions :: [MyAction Get] -> Get [MyAction Id]
>> getActions = mapM getAction
>
> --
> Felipe.
>
Felpe, could you please confirm if
> bs = BS.pack [1,0,2,4]
>
> toVal (A1 (Id v)) = fromIntegral v :: Int
> toVal (A2 (Id v)) =
> instance (EmbedAsChild m c, m1 ~ m) => EmbedAsChild m (XMLGenT m1 c)
That looked to me like a long-winded way of saying:
> instance (EmbedAsChild m c) => EmbedAsChild m (XMLGenT m c)
Unless I'm missing something?
These two instances are not equivalent:
- the first matches even if m and
Hi John
Yes, I finally got it (partly) working. I needed to add the
--extra-lib-dirs= and --extra-include-dirs= flags to point
to the necessary libraries.
However, now the hp2any-manager won't install because of (other) dependencies.
So I've given up on it for the time being because it's causi
I'm not sure whether to reply to the list(s) or the ticket; maybe if you
think my comments are valid they can be copied to the ticket. From
looking, it seems to me that you do have overlapping instances, and I
wonder if it's actually a 6.12 bug for accepting the code, not a 7 bug
for rejecting
Hello Gregg,
Tuesday, November 9, 2010, 2:12:12 AM, you wrote:
>> Doesn't COBOL have significant layout anyway as an inspiration to
>> both?
> Yes and no. What it actually has relates strongly to punched cards
> and is more like assemblers of the day.
i never programmed in COBOL, but afai
On 09/11/10 11:53, Neil Brown wrote:
XMLGenerator.lhs:64:16:
Overlapping instances for EmbedAsChild
(IdentityT IO) (XMLGenT m (XML m))
arising from a use of `asChild' at XMLGenerator.lhs:64:16-22
Matching instances:
instance [overlap ok] (XML m
>
> From: Mark Spezzano
>
> Hi,
>
> I get the following error when doing a 'cabal install hp2any-graph' (the
> profiling tool)
>
> Does anyone know why? (I'm running Snow Leopard and I've tried using other
> flags suggested...but with no success). GLUT is already installed via
> MacPorts and via c
Okay, I think I got it .. I went with Ozgur's example -
data MyAction m = A1 (m Word8) | A2 (m Word16)
a = A1 getWord8
b = A2 getWord16be
listOfActions = [a,b,a]
newtype Id a = Id a
getAction :: MyAction Get -> Get (MyAction Id)
getAction (A1 act) = A1 . Id <$> act
getAction (A2 act) = A2 . I
> What changed between GHC 6.12 and GHC 7.0? Is there a some solution
> besides using IncoherentInstances in every module that imports
> XMLGenerator?
I just want to point out that IncoherentInstances is NOT a solution.
It would probably make the files compile, but not at all with the
semantics we
Thanks Ozgur and Felipe,
Could you also show how I could actually use it to parse a bytestring please?
import qualified Data.ByteString.Lazy as BS
import Control.Applicative ((<$>))
import Data.Word
import Data.Binary.Get
data MyAction = A1 Word8 | A2 Word16
a,b :: Get MyAction
a = A1 <$> getW
> The original question was (I believe) how to drive the parsing with a
> list of Actions, not the result be a list of Actions.
Yes ... the result needs to be a list of plain values - Int's
But I did not follow why you have dropped the word16
--
Regards,
Kashyap
__
On 9 November 2010 08:01, Mark Spezzano wrote:
> I want to be able to run it from the command line in a terminal window, and
> have the text come up in colours (but very fast). My current version is
> already very fast, but I've heard everyone raving about how slow Strings were
> to use for I/O
2010/11/9 Ozgur Akgun :
> If we change the code a bit,
>
> data MyAction = A1 Word8 | A2 Word16
>
> a,b :: Get MyAction
>
> a = A1 <$> getWord8
>
> b = A2 <$> getWord16be
>
> listOfActions :: [Get MyAction]
> listOfActions = [a,b,a]
> Now, we know how to execute the list of actions, and get the out
If we change the code a bit,
data MyAction = A1 Word8 | A2 Word16
a,b :: Get MyAction
>
> a = A1 <$> getWord8
> b = A2 <$> getWord16be
listOfActions :: [Get MyAction]
listOfActions = [a,b,a]
Now, we know how to execute the list of actions, and get the output as list.
Using the following guys:
On Tue, Nov 9, 2010 at 8:10 AM, C K Kashyap wrote:
] I think I can restate my problem like this ---
]
] If I have a list of actions as follows -
]
] import Data.Word
] import Data.Binary.Get
]
] data MyAction = A1 (Get Word8) | A2 (Get Word16)
]
] a = A1 getWord8
] b = A2 getWord16be
]
] listOfAct
2010/11/9 C K Kashyap :
> I think I can restate my problem like this ---
>
> If I have a list of actions as follows -
>
> import Data.Word
> import Data.Binary.Get
>
> data MyAction = A1 (Get Word8) | A2 (Get Word16)
>
> a = A1 getWord8
> b = A2 getWord16be
>
> listOfActions = [a,b,a]
>
> How can I
I think I can restate my problem like this ---
If I have a list of actions as follows -
import Data.Word
import Data.Binary.Get
data MyAction = A1 (Get Word8) | A2 (Get Word16)
a = A1 getWord8
b = A2 getWord16be
listOfActions = [a,b,a]
How can I execute the "listOfActions" inside of a Get Mon
2010/11/9 C K Kashyap :
> Thanks Stephen,
>
> On Tue, Nov 9, 2010 at 2:53 PM, Stephen Tetley
> wrote:
>> I'd use a parser combinator library that has word8 word16, word32
>> combinators. The latter should really have big and little endian
>> versions word16be, word16le, word32be, word32le.
>>
>>
Thanks Stephen,
On Tue, Nov 9, 2010 at 2:53 PM, Stephen Tetley wrote:
> I'd use a parser combinator library that has word8 word16, word32
> combinators. The latter should really have big and little endian
> versions word16be, word16le, word32be, word32le.
>
> Data.Binary should provide this and A
On behalf of all the contributors, I am pleased to announce that the
Haskell Communities and Activities Report
(19th edition, November 2010)
is now available in PDF and HTML formats:
http://haskell.org/communities/11-2010/report.pdf
http://haskell.org/communities
I'd use a parser combinator library that has word8 word16, word32
combinators. The latter should really have big and little endian
versions word16be, word16le, word32be, word32le.
Data.Binary should provide this and Attoparsec I think. Usually I roll
my own, but only because I had my own libraries
Hi,
I've been trying to implement the RFB (VNC) protocol and I was
exploring a neat way of parsing the protocol bytestream.
The protocol specifies that the client first sends a byte that
identifies the command then a sequence of word8, word16, word32 and
paddings. I've tried to capture that logic
On 9 November 2010 19:01, Mark Spezzano wrote:
> Hi Ivan,
>
> Yes, I want it printed in a terminal window.
>
> I want to be able to run it from the command line in a terminal window, and
> have the text come up in colours (but very fast). My current version is
> already very fast, but I've heard
Hi Ivan,
Yes, I want it printed in a terminal window.
I want to be able to run it from the command line in a terminal window, and
have the text come up in colours (but very fast). My current version is already
very fast, but I've heard everyone raving about how slow Strings were to use
for I/O
40 matches
Mail list logo
