Hi,
I have little knowledge about windows in general, but CV package requires
that you install
the opencv c-libraries. You will find them at
http://opencv.willowgarage.com/. Including
a windows distribution.
However, CV package has not been tried on windows, so there might or might
not
be
On Tuesday 17 May 2011 01:40:41, Gracjan Polak wrote:
Daniel Fischer daniel.is.fischer at googlemail.com writes:
On Monday 16 May 2011 23:41:44, Gracjan Polak wrote:
Thanks Daniel, Yves and Edward for explanation. Two things come to
my mind now.
1. It should be unified.
The
Thanks for your answers! I looked further and found that 'Oleg alredy
did it'. Really, looks like iteratees will suit my needs :) I'm sorry
for bothering.
Sergey
2011/5/15 Daniel Gorín dgo...@dc.uba.ar:
I think you need to change the type of putback slightly:
import Data.IORef
putback :: a
On Sat, 2011-05-14 at 17:32 -0700, Gregory Crosswhite wrote:
On 5/14/11 1:25 PM, Maciej Marcin Piechotka wrote:
(to mention
one which is often neglected - parallel build).
While I do appreciate you stepping in to defend autotools (if for no
other reason then because someone has to so
On 17/05/11 01:42, Michael Serra wrote:
eventLoop w cs = do
drawCells w cs
e - waitEventBlocking
checkEvent e
where
checkEvent (KeyUp (Keysym SDLK_ESCAPE _ _)) = return ()
checkEvent (KeyUp (Keysym SDLK_n _ _)) = eventLoop w $
nextgen cs
checkEvent _
On Mon, 16 May 2011 20:33:12 +0400
Grigory Sarnitskiy sargrig...@ya.ru wrote:
Hello!
I'm probing CUDA with Haskell, accelerate package to be exact. Sound stupid,
but I couldn't find how to actually construct an array, for example Vector
Float.
There is quite a number of examples
Hello,
over the weekend I played a little with the fasta benchmark at the
shootout site.
I tried to understand the current submission and decided to build my own
version.
Astonishingly, after some tuning its quite fast (1sec on my machine,
when the current
entry use ~11sec) but uses quite
I am extremely pleased to announce a developer preview release of the
diagrams framework [1] for declarative drawing. This is a
well-thought-out, well-documented, working release with all core
functionality in place, but with many planned features still missing
(for example, support for rendering
Dear All,
I am planning to write a master thesis project on the monadic programming
manner of Haskell PL.
What I want to kindly ask you is that if you have enough time and patience
which can be shared with me, could you please have a quick look at the attached
outline for the project I intend
Dear All,
I am not sure, if the attached files are allowed in the list or not.
Because of this reason, I want to send my outline attached as inline, in any
case.
Thanks already now and best of regards.
Burak Ekici.
OUTLINE
Basically, the objective of this project is to use some objects
--
--
Regards,
KC
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
cabal install primes?
http://hackage.haskell.org/package/primes
https://github.com/sebfisch/primes
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Cool.
On 17 May 2011 16:42, Brent Yorgey byor...@seas.upenn.edu wrote:
- Create a higher-level module built on top of the diagrams framework
(e.g. tree or graph layout, generating Turing machine configuration
diagrams, Penrose tilings ... your imagination is the only limit!)
and
Can we see some examples of the graphics it can produce?
On Tue, May 17, 2011 at 8:42 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
I am extremely pleased to announce a developer preview release of the
diagrams framework [1] for declarative drawing. This is a
well-thought-out,
Is there a way to tell when a function is included in the standard
Haskell Platform or when it needs to be loaded from Hackage?
On Tue, May 17, 2011 at 9:08 AM, Benedict Eastaugh ionf...@gmail.com wrote:
cabal install primes?
http://hackage.haskell.org/package/primes
Yes, of course there is! You can find the index of all functions, types,
typeclasses etc. here:
http://lambda.haskell.org/hp-tmp/docs/2011.2.0.0/doc-index.html
KC kc1...@gmail.com писал(а) в своём письме Tue, 17 May 2011 20:33:05
+0300:
Is there a way to tell when a function is included
An excellent question! There are a couple examples in my blog post:
http://byorgey.wordpress.com/2011/05/17/announcing-diagrams-preview-release/
In the next few days I hope to set up a web site with a gallery of
more examples.
-Brent
On Tue, May 17, 2011 at 10:31:29AM -0700, Warren Henning
On 16 May 2011 21:31, dm-list-haskell-c...@scs.stanford.edu wrote:
At Mon, 16 May 2011 10:56:02 +0100,
Simon Marlow wrote:
Yes, it's not actually documented as far as I know, and we should fix
that. But if you think about it, sequential consistency is really the
only sensible policy:
Hello all,
By the way, is there any reason to prefer package 'vector' over package
'array'? Do they just provide different interfaces to similar
functionnalities or are there real performance stakes?
I personnaly prefer Data.Array, since:
- It gives the possibility to index with something else
Has anyone figured out a way to get libraries that open windows to work with
ghci? With libraries like glut I get the body of a window, but no frame, and
the process wedges. I guess the problem has to do with lack of .app bundle.
If so, perhaps a work-around might involve running ghci in an app
I still haven't found any way to do GUIs or interactive graphics in Haskell
on a Mac that isn't plagued one or more of the following serious problems:
* Incompatible with ghci, e.g., fails to make a window frame or kills the
process the second time one opens a top-level window,
* Goes through the
Yes, the differences between
* vector
* array
* repa
were discussed this week on Stack Overflow:
http://stackoverflow.com/questions/6006304/what-haskell-representation-is-recommended-for-2d-unboxed-pixel-arrays-with-mill
The reason to prefer vectors of arrays are:
* flexible interface
On Tue, May 17, 2011 at 4:17 PM, Conal Elliott co...@conal.net wrote:
Has anyone figured out a way to get libraries that open windows to work with
ghci? With libraries like glut I get the body of a window, but no frame, and
the process wedges. I guess the problem has to do with lack of .app
On Tue, May 17, 2011 at 8:30 PM, Don Stewart don...@gmail.com wrote:
* vector
* array
* repa
Don, do you think that repa is as recommended as vector for
production applications? I'm asking so because it is my understanding
that accelerate still isn't mature enough to be used in production
Well, repa doesn't have a GPU backend. So if you need GPU stuff, you
probably do need to look at accelerate.
I think Repa is in beta now, the API might change a little (e.g.
we're discussing making the stuff under the hood Storable class
friendly). It also only has a small number of users, while
Yes, I understand that - but if there is some install or usage dependency, or
install procedure, I would hope to see it documented somewhere; perhaps I
missed that?
The end result is that from the project page and install, it fails. :-)
Earlier in the thread I noted that this was a Windows
for example:
I will ask the glorious compiler, and it says:
*Main :t calcFFT
calcFFT
:: (Math.FFT.Base.FFTWReal r) =
V.Vector (Complex r) - V.Vector (Complex r)
I then put the signature in my code, reload it, and:
Not in scope: type constructor or class `Math.FFT.Base.FFTWReal'
It
On 18 May 2011 13:44, bri...@aracnet.com wrote:
for example:
I will ask the glorious compiler, and it says:
*Main :t calcFFT
calcFFT
:: (Math.FFT.Base.FFTWReal r) =
V.Vector (Complex r) - V.Vector (Complex r)
I then put the signature in my code, reload it, and:
Not in scope:
If you're importing the module as
import qualified Math.FFT as FFT
Shouldn't Math.FFT become FFT? :)
On Tue, May 17, 2011 at 8:44 PM, bri...@aracnet.com wrote:
for example:
I will ask the glorious compiler, and it says:
*Main :t calcFFT
calcFFT
:: (Math.FFT.Base.FFTWReal r) =
Is there any way to indicate to Hackage that it should not try to generate
Haddock documentation? I'm concerned for two use cases for packages using a
different docs system:
1) A user might see the commentless auto-generated haddock and believe the
package is undocumented.
2) A user might find
I'm intrigued by the idea of Hackage docs that don't use Haddock.
IF you do have better docs, host them somewhere, and put a link
prominently in the .cabal file synopsis.
On Tue, May 17, 2011 at 9:25 PM, John Millikin jmilli...@gmail.com wrote:
Is there any way to indicate to Hackage that it
Hi,
Yes, I understand that - but if there is some install or usage dependency,
or install procedure, I would hope to see it documented somewhere; perhaps I
missed that?
The only installation procedure I can document is how to do this in linux.
My guess is that it must be similar with
On 5/17/11 11:53 PM, KC wrote:
If you're importing the module as
import qualified Math.FFT as FFT
Shouldn't Math.FFT become FFT? :)
Nope.
Depending on your definition of should at least. Hierarchical modules
are not considered entities exported by modules further up on the tree.
So
If one thinks about Haskell data structures as of ordinary data
structures, fusion seems a great deal -- instead of producing
intermediate lists and possibly running out of memory, we just run a
loop and use constant amount of space.
But Haskell data structures are quite different -- they are
34 matches
Mail list logo
