Alp Mestanogullari wrote:
Anyway, would you be willing to integrate your library in that project ?
Yea, it's much better to work with a group on stuff like this.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/l
Alp Mestanogullari wrote:
Hello -cafe,
When I started learning Haskell, I saw the AI page [1] which aimed at
creating a sound, uniform and handy framework for AI programming in
Haskell. I added my name on it and thought a bit about it. I even wrote
a first version of HNN [2], a neural network
michael rice wrote:
There's a thread on the plt-scheme list about creating a function of NO
arguments named NEXT that just returns the number of times it's been
called, a piece of cake in Scheme, but how would one do this in Haskell?
Would the best approach be to use a State monad?
Michael
So i was reading "Programming Game AI by Example" by Mat Buckland
(http://www.ai-junkie.com/books/toc_pgaibe.html) and decided to rewrite
his chapter on Fuzzy logic in haskell (from C++).
My initial impression: its one of those scenarios where OOP grossly over
complicates things
Heres an ex
staafmeister wrote:
Hi,
I wrote a O(n log n) line segment intersection code. Couple of questions
1) I did not find such a library on hackage (at least google gave no
results:)),
and I notice a lot of people submit packages. Would there be any interest
to submit this code (would give incentive
Simon Marlow wrote:
On 23/07/2009 11:53, Simon Marlow wrote:
On 22/07/2009 02:51, Neal Alexander wrote:
Neal Alexander wrote:
Compiled with "ghc -O2 -fvia-C -optc-O2 -funbox-strict-fields
-threaded" btw.
GHC 6.10.3 on 64bit windows7.
Interesting. It's completely flat on Lin
Neal Alexander wrote:
Compiled with "ghc -O2 -fvia-C -optc-O2 -funbox-strict-fields -threaded"
btw.
GHC 6.10.3 on 64bit windows7.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
main = forever performGC
The OS reported memory usage skyrockets. If i enable +RTS -S the GC
statistics show the heap "live bytes" being constant.
Is it accumulating statistics even when profiling is disabled (and can
you turn that off), or is there something going on with the FFI call to
p
Christopher Lane Hinson wrote:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/priority-sync
$ cabal install priority-sync
git clone http://www.downstairspeople.org/git/priority-sync.git
Feedback will be greatly appreciated. This package is a spin-off from
my work on roguestar, w
Christopher Lane Hinson wrote:
Is there any interest or movement in developing thread priority or any
other realtime support in Haskell?
Right now, if I have tasks that need to be responsive in real time, even
if the realtime needs are very soft, it seems that the only option is to
try to e
Michael P Mossey wrote:
Ketil Malde wrote:
Michael Mossey writes:
I'm a beginner, but I'll chime in and say I use Emacs with
haskell-mode. It's auto-indentation is a bit complex in behavior which
is unappealing (I feel like I never know what it's going to do when I
hit tab), but I would be cu
ChrisK wrote:
Hello,
As a side effect of the discussion of the new C++ future/promise
features at http://lambda-the-ultimate.org/node/3221 I have implemented
a Haskell package called "future" at
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/future
This ought to do what C++ st
Csaba Hruska wrote:
Of course I write everything in haskell! I mean about Ogre that i use
only it's model and material formats and none of its code. Thats all.
Yes, later I'd like to write a collada importer. :)
2009/3/8 Peter Verswyvelen mailto:bugf...@gmail.com>>
Awesome!
When you
Neal Alexander wrote:
Grzegorz Chrupala wrote:
Hi all,
In a couple of my projects I have needed to perform operations on (very)
sparse vectors.
I came up with the attached simple module which defines a typeclass and
implements instances for
simple and nested (Int)Maps.
Is this the right way to
Grzegorz Chrupala wrote:
Hi all,
In a couple of my projects I have needed to perform operations on (very)
sparse vectors.
I came up with the attached simple module which defines a typeclass and
implements instances for
simple and nested (Int)Maps.
Is this the right way to go about it? Am I reinve
Maurício wrote:
Hi,
I've seen that if I'm going to leave a pointer
to data in the hands of foreign code, I should
use StablePtr so that the value it points to
doesn't change.
However, we also usually give FunPtr to foreign
code, like when registering callbacks, but I
can't found any kind of "S
Maurício wrote:
Hi,
I've seen that if I'm going to leave a pointer
to data in the hands of foreign code, I should
use StablePtr so that the value it points to
doesn't change.
However, we also usually give FunPtr to foreign
code, like when registering callbacks, but I
can't found any kind of "S
Array is no good man! Quad Tree matrices perform much nicer from what
I've seen.
I wrote some matrix stuff based on D. Stott Parker's "Randomized
Gaussian elimination" papers (http://www.cs.ucla.edu/~stott/ge/). He
presents some recursive block based methods of solving without pivoting.
I wa
Simon Marlow wrote:
Neal Alexander wrote:
Thomas DuBuisson wrote:
It seems like we could get some priority based scheduling (and still
be slackers) if we allow marked green threads to be strictly
associated with a specific OS thread (forkChildIO?).
I think you want the GHC-only
Ertugrul Soeylemez wrote:
Hello fellow Haskellers,
When I read questions from Haskell beginners, it somehow seems like they
try to avoid monads and view them as a last resort, if there is no easy
non-monadic way. I'm really sure that the cause for this is that most
tutorials deal with monads ve
Bueno, Denis wrote:
Oh, do you mean by actually calling memcpy via ffi?
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Foreign-Marshal-Utils.html
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listin
Thomas DuBuisson wrote:
It seems like we could get some priority based scheduling (and still
be slackers) if we allow marked green threads to be strictly
associated with a specific OS thread (forkChildIO?).
I think you want the GHC-only GHC.Conc.forkOnIO
Suggestions like this are m
Bulat Ziganshin wrote:
Hello Neal,
Monday, December 22, 2008, 11:07:32 PM, you wrote:
The threaded RT creates an OS thread for each CPU/core on the system and
uses them to multiplex userland threads. These are context switched
whenever they block/yield/gc and no priorities can be assigned.
From what i understand (correct me if I'm wrong):
The threaded RT creates an OS thread for each CPU/core on the system and
uses them to multiplex userland threads. These are context switched
whenever they block/yield/gc and no priorities can be assigned.
It seems like we could get some priori
""" To be eligible, you will need to upload them. Entries not displayed
here won't be eligible. """
Do the images really have to be uploaded to the wiki or are external
links on the wiki page ok?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.or
m...@justinbogner.com wrote:
George Pollard writes:
On Wed, 2008-12-17 at 02:47 +, Jeff Wheeler wrote:
I love this ASCII-art version. I tried to make a vector version of it in
Photoshop, and I came up with this [1]
and [2].
Any critiques/suggestions? I'm thinking about a second version
Don Stewart wrote:
I'd like to echo Jason's remarks earlier.
http://www.reddit.com/r/haskell_proposals/
We've tried for a couple of years now to efficiently track 'wanted
libraries' for the community, but never with much success.
In particular, two approaches have been tried:
* a wiki
Brent Yorgey wrote:
---
ANN: OpenGL with extra type safety. Neal Alexander
Hopefully the code will be uploaded to Hackage as a separate package soon.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/OGL-0.0.0
I recently modified the hOpenGL (and GLFW) source tree to force extra
type checking on its various IO actions using the
-XGeneralizedNewtypeDeriving extension (see
http://hackage.haskell.org/trac/ghc/ticket/736).
The main motivation was for writing concurrent OpenGL applications. Here
its imp
Don Stewart wrote:
wqeqweuqy:
T Willingham wrote:
On Sat, Nov 1, 2008 at 3:15 AM, Neal Alexander <[EMAIL PROTECTED]>
wrote:
Even when generating one or more copies of "world" per frame the
performance
stays fine and allocations are minimal.
Who says? That may be your parti
T Willingham wrote:
On Sat, Nov 1, 2008 at 3:15 AM, Neal Alexander <[EMAIL PROTECTED]> wrote:
Even when generating one or more copies of "world" per frame the performance
stays fine and allocations are minimal.
Who says? That may be your particular experience from your parti
Even when generating one or more copies of "world" per frame the
performance stays fine and allocations are minimal. From what ive seen,
the OpenGL calls are whats going to bottle neck.
loop (time, space)
where
loop = loop <=< runKleisli action
where
action = (ChronoSync.sy
Tim Docker wrote:
Neal Alexander wrote:
I was using the HaskellCharts library and needed the same two things; so
i rolled a quick and dirty pie chart generator (Barchart is on the TODO
list).
http://72.167.145.184:8000/Screenshot.png
http://72.167.145.184:8000/PieChart.hs
Nice! Do you mind
Tim Docker wrote:
Peter wrote:
Has anyone got some code for drawing charts? I don't mean
graphs of functions, ala
http://dockerz.net/twd/HaskellCharts
...
I would like something that can generate PNGs in memory, i.e. not
directly to a file.
The library at the above URL supports a range of bac
I also redid the profiling for Parsec3 using ByteStrings directly (Its
slower than manually unpacking and feeding it a [Char]):
http://72.167.145.184:8000/parsec_test/Parsec3_BStr.prof
The code for EQ2Parse.hs is identical, aside from changing the type
signature of "init" to use the ByteString
Antoine Latter wrote:
On Tue, May 13, 2008 at 9:23 PM, Neal Alexander <[EMAIL PROTECTED]> wrote:
I stripped the code down to just the parsec related stuff and retested it.
http://72.167.145.184:8000/parsec_test/Parsec2.prof
http://72.167.145.184:8000/parsec_test/Parsec3.prof
And the
Philippa Cowderoy wrote:
On Tue, May 13, 2008 5:53 am, Neal Alexander wrote:
I can post the full profiling info if anyone really cares.
Any info is helpful. It's taking a while to get round to things, but the
more relevant info we have to hand when we do the easier it is to improve
t
Just a heads up - i only have a month or so experience with Haskell, so
alot of these issues may be my own fault.
Anyway, the log file that i'm parsing uses English grammar, and the
performance really dropped just by upgrading to Parsec3. I was hoping to
use the ByteString support to boost the
38 matches
Mail list logo
