, or the new scalable
server based on conduit on github? I'd recommend switching to the
github version if not. A few key bugs exist in the older
implementation.)
- Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
I am using 6.12... are there any good pointers as to how one uses
threadscope?
On Mon, Jan 4, 2010 at 3:14 PM, Neil Mitchell ndmitch...@gmail.com wrote:
Hi Jamie,
First question, what version of GHC are you using? There are
significant performance improvements to parallel code in GHC 6.12
machine).
Very little time is being spent using the garbage collector. Any
suggestions?
Thanks,
-Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello;
I am writing some vectorized code, and I wondered exactly which types can
be used in DPH? Is it true one cannot use data constructors and recursive
types?
Thanks,
-Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
benj...@gmx.net wrote:
Daniel Fischer schrieb:
Am Sonntag 20 Dezember 2009 23:25:02 schrieb Jamie Morgenstern:
Hello;
Also, I was wondering if something akin to a parallel or exists. By
this,
I mean I am looking for a function which, given x : a , y : a, returns
either, whichever
computation returns first. Can I use strategies to code
up something like this?
I suppose this doesn't play nicely with the idea of determinism, but thought
it might be worth asking
anyway.
Thanks,
-Jamie
proposition.hs
Description: Binary data
___
Haskell
I did compile with -threaded.
On Sun, Dec 20, 2009 at 5:42 PM, Maciej Piechotka uzytkown...@gmail.comwrote:
On Sun, 2009-12-20 at 17:25 -0500, Jamie Morgenstern wrote:
Hello;
I am writing a parallel theorem prover using Haskell, and I am trying
to do several things. As a first
should be:
Documentation + examples (which I'm willing to help with if there is interest)
Systematic benchmarks
Integration with the edison api, to encourage a single collection
api on hackage
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe
See Black-Scholes model/option formula being implemented in different
languages including Haskell.
http://www.espenhaug.com/black_scholes.html
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Can someone point us to some resources about these? I for one have not heard
of them before
http://okmij.org/ftp/Streams.html#iteratee
is probably the best place to start.
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
one map
interface lying around.
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, it might be better to write a
Win32-based backend for Grapefruit instead of a wxWidgets-based one. What do
you think about that?
Win32-based backend would make more sense as it is one less layer to deal
with. But how? Same thing with Mac.
Jamie
Best wishes
to port Gtk2Hs widgets
to Grapefruit.
Awesome! I'll be looking forward start using Grapefruit soon! :)
Thanks
Jamie
Best wishes,
Wolfgang
Jamie Clark___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
On Mon, 16 Feb 2009, Wolfgang Jeltsch wrote:
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:25 schrieben Sie:
Hi Wolfgang,
I was wondering if I can use FLTK as GUI backend for Grapefruit?
This should be possible in principal. It just could be that my assumptions
about how
On Mon, 16 Feb 2009, Wolfgang Jeltsch wrote:
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:26 schrieben Sie:
One more thing, would Grapefruit work with files created by Glade (UI
builder)?
No, it won’t, I’m afraid. There is, for example, the principal problem that
Glade is
?
Theora codec is being used in Ekiga (popular SIP/H.323 video softphone but
that thing keeps crashing on me :( )
Jamie
Conrad.
gtener:
On Wed, Feb 11, 2009 at 21:00, Jamie hask...@datakids.org wrote:
Hi Gwern,
On Wed, 11 Feb 2009, Gwern Branwen wrote:
I just checked H.263
On Thu, 12 Feb 2009, Achim Schneider wrote:
Jamie hask...@datakids.org wrote:
For Theora playback we've found that the largest CPU load comes from
colorspace conversion, where the YUV output of the codec needs to be
converted to RGB for some targets (like Firefox). That is some
fairly
Hi Bulat,
On Wed, 11 Feb 2009, Bulat Ziganshin wrote:
Hello Jamie,
Wednesday, February 11, 2009, 5:54:09 AM, you wrote:
Seems like it is ok to write H.264 in Haskell and released via GPL
license?
anyway it's impossible due to slow code generated by ghc
I see, I guess I'll have to stuck
Seems like it is ok to write H.264 in Haskell and released via GPL license?
There is theora.org but H.264 would be ideal. Ditto for H.263.
Software patent issues are entirely orthogonal to the copyright issues of who
wrote what under which license. That's why software patents suck so very
in/out for
decoding.
That could be a seed to create Haskell library of video/audio codecs.
One mentioned that C based ffmpeg library is buggy with memory leaks left
and center (and probably right too :) Ouch!
gwern
Jamie
___
Haskell-Cafe
What I would like to see is H.264 video codec in Haskell. H.264/MPEG-4 is
getting very popular nowadays and it would be great to have encoder and
decoder in haskell. Can use x264 (encoder) and ffmpeg (en/de coder)
as a base to start with.
Jamie
On Tue, 10 Feb 2009, Conrad Meyer wrote:
On Tuesday 10 February 2009 07:18:00 am Jamie wrote:
What I would like to see is H.264 video codec in Haskell. H.264/MPEG-4 is
getting very popular nowadays and it would be great to have encoder and
decoder in haskell. Can use x264 (encoder
in advance!
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
input and shared network connection. What
is ideal way to deal with this in Haskell?
Thanks!
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
state makes it much
easier to automate reasoning about code.
Jamie
On Mon, Feb 2, 2009 at 6:43 PM, Lee Pike leep...@gmail.com wrote:
Hello,
I'm interested to hear if anyone out there has used Haskell (or other
functional languages for that matter) to build simulators for real-time
systems
are planned and what stage the current work is at? I
remember seeing some demos at anglohaskell during the summer but
nothing since.
Jamie
On Tue, Jan 13, 2009 at 3:33 PM, Regis Saint-Paul
regis.saint-p...@create-net.org wrote:
Hi,
I've seen many times the monad topic coming around on the cafe
and irc. It makes people seem more human and hence
harder to flame.
Jamie
On Fri, Jan 2, 2009 at 8:27 PM, Don Stewart d...@galois.com wrote:
A small announcement :)
7 years after its inception, under the guiding hand of Shae Erisson (aka
shapr), the #haskell IRC channel[1] on freenode has reached
here:
http://web.comlab.ox.ac.uk/teaching/materials08-09/probabilistic/19-symbolic.pdf
If you skip to page 42 theres a table comparing memory use with
traditional sparse representations.
Jamie
On Fri, Dec 19, 2008 at 5:07 PM, Bayley, Alistair
alistair.bay...@invesco.com wrote:
(OT, but I'm hoping
You're essentially describing functional reactive programming. You end
up with the system being described as pure, reactive values and
plugging IO based streams in at the edges.
Have a look at the wiki description
(http://www.haskell.org/haskellwiki/Functional_Reactive_Programming)
and especially
Ideas for how to make such tries
composable would encourage me to release a hackage module :-)
Have a look at code.haskell.org/gmap/api - a library for composable
maps. It currently requires huge instances in the name of efficiency
but I hope to improve that over the next couple of months. The
I am afraid, but this does not give constant amortized time.
sendEmail :: ProperlyThoughtOut Idea - IO ()
Clearly my brain lacks a type checker.
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
, for this kind of question you'll get help much faster if
you ask on #haskell.
Jamie
On Thu, Sep 25, 2008 at 5:11 AM, Matthew Eastman [EMAIL PROTECTED] wrote:
Hey guys,
This is probably more of a question about functional programming than it is
about Haskell, but hopefully you can help me out. I'm new
the byestring part up to date).I dont yet know
how fast it is but I will be tweaking it over the next month or so.
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I was hoping to have my summer of code blog added to planet haskell
but [EMAIL PROTECTED] no longer seems to exist. Hopefully
the owner is subscribed to this list?
Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
Data.Binary.Put
import qualified Data.ByteString.Lazy as B
simpleImage = take tot (map (\x - x `mod` 256) [1..])
where tot = 640 * 480
main = do
output - openFile test.tmp WriteMode
B.hPut output $ runPut $ mapM_ putWord8 simpleImage
--
Jamie Love
Senior Consultant
Aviarc Australia
Mobile: +61
are good -- they can prevent bugs caused by
an unexpected type being inferred).
This message has been scanned for viruses and dangerous content
by MailScanner and is believed to be clean.
--
Jamie Love
Senior Consultant
This message has been scanned for viruses and dangerous content
by MailScanner and is believed to be clean.
--
Jamie Love
Senior Consultant
Aviarc Australia
Mobile: +61 400 548 048
Just to clarify, I know it was my mistake, and so I'm not blaming
Haskell or Ghc. The first few times you realise the compiler isn't a
magic wand that stops you being silly are the hardest.
Jamie Love wrote:
Oh, I see
I wasn't thinking through the code (and I'm still in the honeymoon
I should point out that this is on GHC 6.8.2 compiled from source on a
Mac powerpc.
Jamie Love wrote:
Hi there,
Not sure where to raise bugs in hackage libraries, so I'm posting
here. If there is a better place, please let me know.
The following code crashes with a divide by zero error
was to do something like:
foldr (\x B.hPut output (runPut $ do put (x :: Word8))) data
(where output is my file handle), but apart from giving me type errors,
it seems a rather arduous way to do it.
Could anyone suggest a better way to do this?
--
Jamie Love
Senior Consultant
Aviarc
Stephan Walter wrote:
Hi,
On 2008-01-24 12:14, Jamie Love wrote:
I have a list of ints, with values between 0 and 255 and I need to print
them out in little endian form to a file.
How about just using Data.Char.chr ?
Essentially because I need to control the byte ordering
.
Jed
--
Jamie Love
Senior Consultant
Aviarc Australia
Mobile: +61 400 548 048
This message has been scanned for viruses and dangerous content
by MailScanner and is believed to be clean
:: Int32)
put (14 :: Int32)
Yields the lazy bytestring,
BM\NUL\NUL\NUL\NUL\NUL\NUL\NUL\NUL\NUL\NUL\NUL\SO
--
Jamie Love
Senior Consultant
Aviarc Australia
Mobile: +61 400 548 048
This message has been scanned
) to 4 Char8 elements
2/ rotate bits/bytes in a 32 bit Char32 (or Int32) so they are
explicitly little-endian (I work on a mac powerbook, and it is big-endian)
3/ convert an Integer or Int type to an Int32 type
Any pointers or suggestions would be helpful.
Thanks
--
Jamie Love
Senior Consultant
44 matches
Mail list logo