Hi Francisco,
You can try GitHub's code search
https://github.com/search?l=Haskellq=mvarref=cmdformtype=Code
Cheers,
--Lucas
2013/6/12 Francisco M. Soares Nt. xfrancisco.soa...@gmail.com
Hello, everyone.
I am looking for packages on hackage which use MVars extensively. Those
which create
On 12 June 2013 21:29, Francisco M. Soares Nt.
xfrancisco.soa...@gmail.com wrote:
I am looking for packages on hackage which use MVars extensively. Those
which create plenty of MVars
Hi Francisco,
Also take a look at Control.Concurrent.Chan in the base library:
First of all, thank you for your suggestions.
You can try GitHub's code search
For the moment I am ignoring Github because it's harder to separate stable
development from unstable. Even so, it might be worth the trouble to check
out github soon. Thank you, Lucas.
Also take a look at
Hi,
Robert Clausecker wrote:
Each instruction has up to three operands, looking like this:
@+4 (Jump for bytes forward)
foo (the string foo
'0'(1+2)
etc. A string literal may contain anything but a newline, (there are
no escape codes or similar). But when I add a check for a
On Wed, 2 Mar 2011 14:14:02 +0100, you wrote:
Thank you all for the responses. Here's an example:
As I alrerady said, I tried to parse the MMIXAL assembly language.
Each instruction has up to three operands, looking like this:
@+4 (Jump for bytes forward)
foo (the string foo
Apologies if this has been answered already (I've got a bit lost with
this thread), but the *try* here seems to be giving you precisely the
behaviour you don't want.
*try* means backtrack on failure, and try the next parser. So if you
want ill formed strings to throw an error if they aren't
Actually this is stranger than I thought - from testing it seems like
Attoparsec's (|) is different to Parsec's. From what I'm seeing
Attoparsec appears to do a full back track for (|) regardless of
whether the string lexer is wrapped in try, whereas Parsec needs try
to backtrack.
On 2 March 2011
Actually, It's not | that's different, it's the string combinator.
In Parsec, string matches each character one at a time. If the match
fails, any partial input it matched is consumed. In attoparsec,
string matches either the entire thing or not, as a single step. If
it fails to match, no input
On Thu, Oct 15, 2009 at 02:41:42PM +0100, Dougal Stanton wrote:
I found the HsASA library [1] on Hackage, but there's no documentation
and it's not particularly intuitive. I can't see any obvious way of
choosing initial config or generating new configurations. Google
reveals no one using it.
2009/10/15 Dougal Stanton dou...@dougalstanton.net:
I found the HsASA library [1] on Hackage, but there's no documentation
and it's not particularly intuitive. I can't see any obvious way of
choosing initial config or generating new configurations. Google
reveals no one using it. Does anyone
John D. Ramsdell wrote:
Usually I include the example program in the package, but make its compilation
conditional using a Cabal flag like buildExamples.
But then the binaries generated from the example program get
installed. I think the poster wants to share the source code, not
Am Samstag, 8. August 2009 13:29 schrieb Andrew Coppin:
As some of you may remember, I recently released a couple of packages on
Hackage. I'd like to also release some example programs using these
packages, but I'm not sure of the best way to do this.
Do I make the example programs part of
This seems to me like the kind of thing hackage maintainers should be
giving guidance on (maybe they do already?) so that there is
consistency.
Sorry if this seems too off base, but here I go anyway... I have used
apache IVY for packaging/dependency management in java and I really
like the way it
Usually I include the example program in the package, but make its
compilation conditional using a Cabal flag like buildExamples.
But then the binaries generated from the example program get
installed. I think the poster wants to share the source code, not
install a demo.
I haven't figure
John D. Ramsdell wrote:
Usually I include the example program in the package, but make its
compilation conditional using a Cabal flag like buildExamples.
But then the binaries generated from the example program get
installed. I think the poster wants to share the source code, not
install a
On Sun, Aug 9, 2009 at 8:15 PM, Thomas
DuBuissonthomas.dubuis...@gmail.com wrote:
... Another option: test
code (or any other source) can easily be included in the source dist
by adding them to the extra-source-files: line in the .cabal file.
But then cabal doesn't know how to build binaries
Maybe in addition to having a buildable boolean in a library or
executable section, there should be an installable boolean. It would
default to true, but when false, the library or executable section is
ignored during package installation.
John
___
On 10/08/2009, at 9:29 AM, John D. Ramsdell wrote:
Usually I include the example program in the package, but make its
compilation conditional using a Cabal flag like buildExamples.
But then the binaries generated from the example program get
installed. I think the poster wants to share the
On Sat, 8 Aug 2009, Andrew Coppin wrote:
As some of you may remember, I recently released a couple of packages on
Hackage. I'd like to also release some example programs using these packages,
but I'm not sure of the best way to do this.
Do I make the example programs part of the package
2009/3/14 Gü?nther Schmidt gue.schm...@web.de:
Hi,
can someone please point me to error handling examples with takusen?
I try to run a piece of code with takusen but just get the very sparse
Database.InternalEnumerator.DBException
Hello Günther,
We use dynamic exceptions in Takusen, which
Hugo Pacheco wrote:
Hi all,
I have been searching for examples of Haskell real scenarios that employ
mutually recursive datatype definitions.
Does anyone know some interesting libraries or structures that I could play
with?
Tim Sheard presents a realistic use case in [1]. We're using it in a
On Sun, 26 Oct 2008, Hugo Pacheco wrote:
Hi all,
I have been searching for examples of Haskell real scenarios that employ
mutually recursive datatype definitions.
Does anyone know some interesting libraries or structures that I could play
with?
Think of any real programming language out there. For example, in many
languages statements may contain expressions, and expressions in turn
may contain statements (in Java through anonymous inner classes, for
example).
Boa noite,
Martijn.
Hugo Pacheco wrote:
Hi all,
I have been
Think of any real programming language out there. For example, in many
languages statements may contain expressions, and expressions in turn may
contain statements (in Java through anonymous inner classes, for example).
... and as an example of this you could have a look at the
Probably I overdid the real part.I was thinking of examples such as ASTs
(such as the Haskell one), trees and imagining more fancy things, maybe
L-systems and fractal processing.
I will have a look at the Haskell sources and the previous papers from Tim
Sheard.
Cheers,
hugo
On Sun, Oct 26, 2008
Along these lines, check out (and maybe quote) the July 2007 note from Doug
McIlroy to the Haskell list:
http://www.haskell.org/pipermail/haskell/2007-July/019632.html
I've particularly been enjoying Doug's paper The Music of Streams,
mentioned in that note.
- Conal
On Mon, May 26, 2008 at
On Thu, 7 Jun 2007, Dan Piponi wrote:
Does anyone have any sample Haskell code they'd like to share for
doing things like creating a waveform from a list of samples or a
mathematical function and playing them using these libraries (or
indeed any easy to install on MacOS X Haskell library)?
If I don't cast then how do I convert this code?
doubleToInts d = runST (
do arr - newDoubleArray (1,2)
writeDoubleArray arr 1 d
i1 - readIntArray arr 1
i2 - readIntArray arr 2
return (i1,i2))
Or can I just read an array of ints from the double array using the
Joel Reymont [EMAIL PROTECTED] writes:
If I don't cast then how do I convert this code?
Uh, what is wrong with divMod?
*Main Data.Word (100::Word64) `divMod` (2^32)
(2,1410065408)
doubleToInts d = runST ( [...]
This will only give you a headache. :-)
-k
--
If I haven't seen
joel reymont wrote:
I don't understand the syntax needed to create a new double or float
array with newArray from Data.Array.MArray. I also don't yet
understand how to cast that double array to read ints from it.
doubleToInts d = runST (
do arr - newDoubleArray (1,2)
Joel Reymont [EMAIL PROTECTED] writes:
I must be missing something because I don't think the code below
converts a double.
Yes, sorry, my bad. I was (and is) confused about what you wanted to
do.
-k
--
If I haven't seen further, it is by standing in the footprints of giants
I'm just trying to replicate the example using the fresh syntax
that does not use readDoubleArray, readIntArray, etc.
On Oct 14, 2005, at 4:32 PM, Ketil Malde wrote:
Yes, sorry, my bad. I was (and is) confused about what you wanted to
do.
--
http://wagerlabs.com/
On 10/13/05, joel reymont [EMAIL PROTECTED] wrote:
Folks,
Are there any examples on using STUArray and friends? I'm trying to
convert the following bit of code which uses deprecated features.
I don't understand the syntax needed to create a new double or float
array with newArray from
33 matches
Mail list logo
