A new version of the ALUT package has been uploaded to Hackage. Again, this is
a bug fix only release, containing only tiny changes:
* Include missing aclocal.m4 and examples in source distribution
* Removed unused Makefiles and prologue.txt
* Fixed OpenAL URLs
Cheers,
S.
A new version of the OpenAL package has been uploaded to Hackage. Again, this
is a bug fix only release:
* Include OpenAL header when checking values of constants
* Include missing aclocal.m4 and examples in source distribution
* Removed unused Makefiles and prologue.txt
* Removed
A new version of the GLUT package has been uploaded to Hackage. This is a bug
fix only release, containing only tiny changes:
* Include missing aclocal.m4 and examples in source distribution
* Removed unused Makefiles and prologue.txt
Cheers,
S.
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090502
Issue 116 - May 02, 2009
---
Welcome to issue 116 of HWN, a newsletter covering
2009/5/1 Jens Petersen peter...@haskell.org:
2009/4/26 Ian Lynagh ig...@earth.li:
Are you using a registerised build? If so, then as PPC/Linux isn't a
tier 1 platform, it could well have bitrotted.
So I tried doing an unregisterised ppc build with:
echo GhcUnregisterised=YES mk/build.mk
echo
Am Sonntag, 15. Februar 2009 08:32:59 schrieb Jared:
The OpenAL binding's wiki page directs questions to Haskell-Cafe, but the
more serious of my problems seems to be with GHC. My platform is GHC
6.10.1 under Windows XP. This post boils down to two questions. First,
why would GHCi and GHC
Hi all,
6.10.3 is now ready to release. There have been very few changes
relative to 6.10.2; the release notes are here:
http://www.haskell.org/ghc/dist/stable/docs/users_guide/release-6-10-3.html
This is just to give people a chance to report any regressions relative
to 6.10.2, in
Belka
Now that you've got some metrics to know when you have a successful
design, start examining the trades.
Most systems have a turning point in their performance as load is
increased, you need manage the traffic so that the offered load does
not push the system over that point (or if
Yes, you've got the problem domain. I don't have to deliver responses
to stimuli all the time within a bound, but I need to supply some
probability for that figure.
That problem domain is everywhere - all that varies is the bound on the time
and the probability of meeting it.
'Hard real time'
Though I don't fully understand what you are doing (specifically what you
mean by specific order), but in a lazy language, traversals are usually
simply encoded as lists. Just write a function which returns all the leaves
as a list, and filter over it.
yea, i know, i am trying to learn how
I believe Data.Binary includes a header with the data
it serializes. In consequence, the second and all following
arrays will be invisible.
Sorry I can not be of more help.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sat, May 2, 2009 at 3:13 AM, Anatoly Yakovenko aeyakove...@gmail.comwrote:
Though I don't fully understand what you are doing (specifically what you
mean by specific order), but in a lazy language, traversals are usually
simply encoded as lists. Just write a function which returns all
On Sat, May 2, 2009 at 11:12, Jason Dusek jason.du...@gmail.com wrote:
I believe Data.Binary includes a header with the data
it serializes. In consequence, the second and all following
arrays will be invisible.
[Apologies for Jason for sending this twice to him]
I didn't check the Binary
Henning Thielemann schlepp...@henning-thielemann.de writes:
Paul Keir schrieb:
There's nothing better than making a data type an instance of Num. In
particular, fromInteger is a joy. But how about lists?
http://www.haskell.org/haskellwiki/Num_instance_for_functions
Hi Steve,
Steve wrote:
Why is gcd 0 0 undefined?
That's a good question. Can you submit an official proposal?
http://www.haskell.org/haskellwiki/Library_submissions
Thanks,
Martijn.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
2009/05/02 Krzysztof Skrzętnicki gte...@gmail.com:
2009/05/02 Jason Dusek jason.du...@gmail.com:
I believe Data.Binary includes a header with the data it
serializes. In consequence, the second and all following
arrays will be invisible.
I didn't check the Binary instance for arrays, however
Hi
I wanted a mailing list for my project WxGeneric and I am wondering when
it is OK to do so? How big must the potential audience be? Is there any
kind of etiquette or guidelines?
Here http://haskell.org/mailman/admin it says that I must have the
proper authority to create a mailing list. What
2009/05/02 Jason Dusek :The original poster should try serializing a tuple of arrays instead of serializing each array individually.Maybe, but I have some doubts. I have to operate with thousands of arrays --- are tuples good in such case? Moreover it is desirable to write data as it is
On the wiki page for Applicative Functors
(http://www.haskell.org/haskellwiki/Applicative_functor) a familiar
characteristic of monads is quoted; that they allow you to run actions
depending on the outcomes of earlier actions. I feel comfortable with Functors
and Applicative Functors, but I
Thanks Andy, et al. I can stop hacking for now then. I'm using a simple
fromList function already which seems like a reasonable, and at least
semi-standard solution (http://www.haskell.org/hoogle/?hoogle=fromList)
Paul
-Original Message-
From: sploin...@gmail.com on behalf of andy
On Sat, May 2, 2009 at 11:31 AM, Paul Keir pk...@dcs.gla.ac.uk wrote:
On the wiki page for Applicative Functors
(http://www.haskell.org/haskellwiki/Applicative_functor) a familiar
characteristic of monads is quoted; that they allow you to run actions
depending on the outcomes of earlier
On Sat, May 02, 2009 at 05:31:03PM +0100, Paul Keir wrote:
On the wiki page for Applicative Functors
(http://www.haskell.org/haskellwiki/Applicative_functor) a familiar
characteristic of monads is quoted; that they allow you to run actions
depending on the outcomes of earlier actions. I
On Sat, May 02, 2009 at 05:31:03PM +0100, Paul Keir wrote:
An example immediately follows that quotation on the wiki:
do text - getLine
if null text
then putStrLn You refuse to enter something?
else putStrLn (You entered ++ text)
Then, how about
getMyLine = getLine =
I'd like to get some feedback from the Haskell community about some packaging
issues, so here is my problem: As a medium-term goal, I'd like to decouple the
OpenAL/ALUT packages from the OpenGL package, because there are very sensible
use cases where you might need some sound, but not OpenGL.
Hi,
I don't think I already presented myself; I'm Nicolas, a 23y french
student, trying to learn and use haskell.
I've been using C for years, for all sort of tasks, and am quite
comfortable with it. I'm also using it 40h a week in my internship for
network systems, so I kind of know how to use
Hello Sven,
Saturday, May 2, 2009, 9:14:13 PM, you wrote:
must, but the actual packaging is not nice. So the obvious idea is to
introduce 3 new packages which lift out functionality from the OpenGL package:
another possible variant: OpenGL-DataTypes package that joins these 3
--
Best
OK, I think what you're saying is to work with (random) integers and use
fromEnum and toEnum to get corresponding DayOfWeek. But I get this when I try
to use toEnum:
[mich...@localhost ~]$ ghci dow
GHCi, version 6.10.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ...
OK, I think what you're saying is to work with (random) integers and use
fromEnum and toEnum to get corresponding DayOfWeek. But I get this when I
try to use toEnum:
*Main toEnum 2
ghci does not know what type of enum you want to create from the number 2.
Try: toEnum 2 :: DayOfWeek
That
its a syntax tree, and at some point i hit a type reference who'se
declaration will be satisfied in some other part of the tree. the
type references are always leaves, so when i hit a typeref, i just
want to continue along the rest of the parser until i hit a
declaration. My current solution is
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090502
Issue 116 - May 02, 2009
---
Welcome to issue 116 of HWN, a newsletter covering
I intuited that that's what the problem was.
Thanks,
Michael
--- On Sat, 5/2/09, Rahul Kapoor r...@trie.org wrote:
From: Rahul Kapoor r...@trie.org
Subject: Re: [Haskell-cafe] Generating random enums
To: michael rice nowg...@yahoo.com
Cc: John Van Enk vane...@gmail.com,
Am Samstag 02 Mai 2009 20:00:54 schrieb Rahul Kapoor:
OK, I think what you're saying is to work with (random) integers and use
fromEnum and toEnum to get corresponding DayOfWeek. But I get this when I
try to use toEnum:
*Main toEnum 2
ghci does not know what type of enum you want to
Reprinted from my blog post [1]:
===
The semester is over, my final project was a success (at least in that
I passed the class) and it’s time now to release the game I made for
Graphics 455: Silkworm!
This is my first full application in Haskell. The process has been an
enlarging
Rahul Kapoor r...@trie.org writes:
*Main toEnum 2
ghci does not know what type of enum you want to create from the number 2.
Try: toEnum 2 :: DayOfWeek
That said, I would expect toEnum 2 to give an error like: 'Ambiguous
type variable `a''. So I am not sure why your error message says:
At 7:17 PM +0200 5/2/09, Nicolas Martyanoff wrote:
Content-Type: multipart/signed; micalg=pgp-sha1;
protocol=application/pgp-signature; boundary=ibTvN161/egqYuK8
Content-Disposition: inline
Hi,
I don't think I already presented myself; I'm Nicolas, a 23y french
student, trying to learn
Excellent work!
Time to upload to hackage??
-- Don
duane.johnson:
Reprinted from my blog post [1]:
===
The semester is over, my final project was a success (at least in that I
passed the class) and it’s time now to release the game I made for
Graphics 455: Silkworm!
This is my first
Am Samstag 02 Mai 2009 21:22:26 schrieb Ketil Malde:
Rahul Kapoor r...@trie.org writes:
*Main toEnum 2
ghci does not know what type of enum you want to create from the number
2. Try: toEnum 2 :: DayOfWeek
That said, I would expect toEnum 2 to give an error like: 'Ambiguous
type
Hi!
On Sat, May 02, 2009 at 01:00:23PM -0600, Duane Johnson wrote:
Silkworm combines the Hipmunk binding to Chipmunk 2D Game
Dynamics with OpenGL, and GLFW (an alternative to GLUT).
It's great to see Hipmunk being useful to someone :). I've
written the binding to turn some of my ideas into
Congratulations!!! It is actually a fun game to play too :-)
On Sat, May 2, 2009 at 9:00 PM, Duane Johnson duane.john...@gmail.comwrote:
Reprinted from my blog post [1]:
===
The semester is over, my final project was a success (at least in that I
passed the class) and it’s time now to
On Sat, May 2, 2009 at 6:17 PM, Nicolas Martyanoff khae...@gmail.comwrote:
Hi,
I don't think I already presented myself; I'm Nicolas, a 23y french
student, trying to learn and use haskell.
I've been using C for years, for all sort of tasks, and am quite
comfortable with it. I'm also using
* OpenAL uses OpenGL's notion of StateVars all over the place.
I've thought that this would be an appropriate package in it's own right.
It may be small and simple but it captures and generalizes a frequently
needed concept.
As for the other two, I don't know that anything besides GL/AL
Steve stevech1...@yahoo.com.au wrote:
It is useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0 because then
the natural numbers become a complete distributive lattice with gcd
as meet and lcm as join operation. This extension of the definition
is also compatible with the generalization for
I think splitting this up is a good thing, and at first sight I thought it
was overkill to make 3 micro packages, but when thinking twice I believe it
is indeed the way to go:
- Having StateVar into its own module will hopefully promote its reuse by
other imperative wrapper libs which currently
Hi, Richard, these are interesting suggestions, I may explore them a bit.
I tried initially to make something that would be usable without too
much pain for small-to-medium problem, and that could be used, albeit
with a performance hit, for a larger problem; but I'm sure I am
nowhere near what
Sven Panne schrieb:
* a tiny ObjectName package, consisting only of OpenGL's ObjectName class
(In Data.ObjectName? I'm not very sure about a good place in the hierarchy
here.)
How about Data.GraphicsObjects ?
* a package containing most of the data types/newtypes in OpenGL's
Thanks, Felipe! Indeed, it was a wonderful surprise to see a 2D
physics engine binding for Haskell. It made it possible for me to
choose Haskell as my implementation language. I'm very grateful for
that. I wish you luck (and time!) in implementing your ideas :)
Regards,
Duane
On May
Yes, it is quite fun.
I think it should be using cabal's datadir from Paths_silkworm.hs to
install (and find) the resources.
Yell if you can't figure out how to do that. (xmonad has an example)
-- Don
bugfact:
Congratulations!!! It is actually a fun game to play too :-)
On Sat, May 2, 2009
2009/05/02 Grigory Sarnitskiy sargrig...@ya.ru:
2009/05/02 Jason Dusek :
The original poster should try serializing a tuple of arrays
instead of serializing each array individually.
Maybe, but I have some doubts. I have to operate with
thousands of arrays --- are tuples good in such case?
48 matches
Mail list logo
