Quoth Achim Schneider on Sun, Jun 01, 2008 at 04:09:10 +0200
I would go for GL(U(T)), as it's as good for 2d primitives as SDL will
ever be, has excellent cross-platform support and allows you to go 3d
if you want to. There's also some very decent event handling.
You can use R as well.
Andrew Coppin wrote:
I don't suppose this will surprise anybody greatly, but...
Apparently if you write a Haskell module that is 400 KB in size and
defines a single CAF consisting of a 45,000-element [String], GHCi
panics when attempting to load it interpretted, and hits a stack
overflow
Anatoly Yakovenko wrote:
do you have any plans to provide an interface for inplace updates?
Yes, I will try to write a simple version of Data.Array.ST...
On Sun, Jun 1, 2008 at 3:20 AM, Alberto Ruiz [EMAIL PROTECTED] wrote:
Anatoly Yakovenko wrote:
What is the most efficient way to update
On 1 jun 2008, at 20.44, Bertram Felgenhauer wrote:
Hi,
I'm pleased to announce yet another tool for importing darcs
repositories
to git. Unlike darcs2git [1] and darcs-to-git [2], it's written in
Haskell, on top of the darcs2 source code. The result is a much faster
program - it can
On Mon, 2008-06-02 at 00:07 -0500, Galchin, Vasili wrote:
Hello,
I have been developing new code for the unix package. I have
run into what I think are ghc 6.8.2 anomalies but couldn't see a
pattern. Possibly now I do. I have been using the 32-bit x86 ghc
binary that I downloaded
Thomas Schilling wrote:
On 1 jun 2008, at 20.44, Bertram Felgenhauer wrote:
[git-darcs-import]
Nice! Do you happen to also have a darcs (or Git) repository somewhere?
I've uploaded my (git) repo to repo.or.cz, see
http://repo.or.cz/w/git-darcs-import.git
Patches are welcome.
enjoy,
Hi,
I'm getting the compilation error that is actually logged on Hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/plugins
Below is a small diff file that resolves these problems; I don't know
what the proper protocol is for submitting these diffs but it may be
useful to
Hello
I'm using GHC 6.8.2 with mutally recursive modules. I'm familiar with
how to do simple cases in GHC ({-# SOURCE #-} and .hs-boot files) but I
can't figure out how to get it to work for a particular set of modules.
Is it known (i.e., proven) that GHC 6.8.2 can compile any set of
Richard Giraud wrote:
Hello
I'm using GHC 6.8.2 with mutally recursive modules. I'm familiar with
how to do simple cases in GHC ({-# SOURCE #-} and .hs-boot files) but I
can't figure out how to get it to work for a particular set of modules.
Is it known (i.e., proven) that GHC 6.8.2 can
Am Freitag, 30. Mai 2008 22:09 schrieb Achim Schneider:
[…]
I'm generally very interested in declarative GUI programming, but not
nearly enough acquainted with the whole topic to judge one project's
approach over the other. I just followed standard scientific evaluation
technique to select
I am building a web-app that, in broad strokes, allows a leader to assign tasks
to team members and allows team members to accept/reject/pick tasks that they
want to do.
I really like Haskell and I would like to use it to implement the solution. Are
frameworks like Happs ready? Not so much
Isaac,
Does anyone know if it is possible to specify a default definition
for an
associated type synonym?
According to http://hackage.haskell.org/trac/ghc/wiki/TypeFunctionsStatus
defaults for associated types is still a TODO.
Cheers,
Stefan
Dreixel wrote:
Hello,
Does anyone know if it is possible to specify a default definition for an
associated type synonym? When I tried:
class A a where
type B a = a
GHC (version 6.9.20080309) told me: Type declaration in a class must be a
kind signature or synonym default. However, when I
On Mon, Jun 02, 2008 at 09:37:11AM -0500, Aditya Siram wrote:
I am building a web-app that, in broad strokes, allows a leader to assign
tasks to team members and allows team members to accept/reject/pick tasks
that they want to do.
I really like Haskell and I would like to use it to
I just noticed this is also reported as a 6.8 build failure on hackage itself.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/happs-hsp-template
2008/6/2 Thomas Hartman [EMAIL PROTECTED]:
Can cabal install be made to work for this package?
*
[EMAIL PROTECTED]:~sudo cabal
do you have any plans to provide an interface for inplace updates?
Yes, I will try to write a simple version of Data.Array.ST...
I can try to help you, although I still dont quite grok monads.
Wouldn't it be more efficient to use StorableArray, so you can cast
from and to C? I am not sure
Can cabal install be made to work for this package?
*
[EMAIL PROTECTED]:~sudo cabal install happs-hsp-template
[sudo] password for thartman:
cabal: internal error: could not construct a valid install plan.
The proposed (invalid) plan contained the following problems:
Package Cabal is required
On 29 maj 2008, at 18.13, Don Stewart wrote:
Hackage and Cabal are nice, but a command line tool for automatically
searching Hackage and installing Hackage packages (like the cpan
program, or easy_install) would be nice. Unless I haven't done my
homework and this tool exists...
This tool
aditya_siram:
I am building a web-app that, in broad strokes, allows a leader to
assign tasks to team members and allows team members to
accept/reject/pick tasks that they want to do.
I really like Haskell and I would like to use it to implement the
solution. Are frameworks like Happs
Thanks,
if possible, could you construct this as a patch against the darcs
branch, which lives here:
http://code.haskell.org/~dons/code/hs-plugins
Cheers,
Don
devriese:
Hi,
I'm getting the compilation error that is actually logged on Hackage:
Hello Anatoly,
Yes, I will try to write a simple version of Data.Array.ST...
Wouldn't it be more efficient to use StorableArray, so you can cast
there is some difference between them - MutableByteArray# (used for
STUArray) is movable Haskell object which is subject to GC while
StorableArray
Galchin, Vasili wrote:
my knowledge of point-free is from category theory. in what sense is
Haskell point-free handle namespace pollution?
In the sense that you can write e.g.
f = g . h
instead of
f x = g (h x)
thereby avoiding the need to give a name the argument to f.
Cheers
Ben
On 6/2/08 10:21 AM, Don Stewart wrote:
aditya_siram:
I am building a web-app that, in broad strokes, allows a leader to
assign tasks to team members and allows team members to
accept/reject/pick tasks that they want to do.
I really like Haskell and I would like to use it to implement the
Galchin, Vasili wrote:
typedef struct blah
{
int val1;
union {
int val2;
struct {
int val3;
int val4;
}
}
}C_type;
question: in Haskell, can I embed definition of the union inside
Hi Don,
Is this the kind of thing you mean (I'm not really a darcs user; this is
the patch created by darcs record):
[Hide some names to remove ambiguity errors
Edsko de Vries [EMAIL PROTECTED]**20080602202001] {
hunk ./src/System/Plugins/Env.hs 76
-import Distribution.Package
+import
On Sat, May 31, 2008 at 6:22 PM, Jim Snow [EMAIL PROTECTED] wrote:
In practice, one might use something like 32 hash tables. This yields a
false positive rate of 1/(2^32). Their most obvious application is to store
the dictionary for a spell checker in a space-efficient way, though I have a
Anyone else here from Vancouver (Canada)? I thought it would be great
to have a little informal get-together at a local cafe and share how
we're currently using Haskell, or really anything (problems,
comparisons, useful software tools, etc.) in relation to Haskell.
I'm scheduling a meeting
Hi,
I have to write ParseChart implementation with Data.Map/Set. The chart
is type like this:
type Chart k v = Map k (Set v)
now I need operation like:
insert :: k - v - Chart k v - Maybe (Chart k v)
where the result is (Just _) if the (k,v) is actually added to the
chart or Nothing if it was
Anyone else here from Vancouver (Canada)? I thought it would be great
to have a little informal get-together at a local cafe and share how
we're currently using Haskell, or really anything (problems,
comparisons, useful software tools, etc.) in relation to Haskell.
I'm scheduling a meeting
jstrait:
Anyone else here from Vancouver (Canada)? I thought it would be great
to have a little informal get-together at a local cafe and share how
we're currently using Haskell, or really anything (problems,
comparisons, useful software tools, etc.) in relation to Haskell.
I'm
Hi Krasimir,
insert :: k - v - Chart k v - Maybe (Chart k v)
where the result is (Just _) if the (k,v) is actually added to the
chart or Nothing if it was already there and nothing have to be done.
insertLookupWithKey :: Ord k = (k - a - a - a) - k - a - Map k
a - (Maybe a, Map k a)
This
after darcs record,
darcs send -o file.patch
and then send file.patch via email to the maintainer.
2008/6/2 Edsko de Vries [EMAIL PROTECTED]:
Hi Don,
Is this the kind of thing you mean (I'm not really a darcs user; this is
the patch created by darcs record):
[Hide some names to remove
On Mon, 2008-06-02 at 22:35 +0200, Krasimir Angelov wrote:
The problem with this is that both the Map and the Set are traversed
twice. The first time from lookup/member and the second time from
insert. Does someone have an idea how to do this with the current
libraries?
The chart
On Mon, 2008-06-02 at 09:42 -0700, Thomas Hartman wrote:
Can cabal install be made to work for this package?
*
[EMAIL PROTECTED]:~sudo cabal install happs-hsp-template
[sudo] password for thartman:
cabal: internal error: could not construct a valid install plan.
The proposed (invalid)
Not completely! This is a possible implementation:
case insertLookupWithKey (\_ - Set.union) k (Set.singleton v) chart of
(Nothing, chart) - Just chart
(Just set, chart) | Set.member v set - Nothing
| otherwise - Just chart
but notice that the set is
Hi
case insertLookupWithKey (\_ - Set.union) k (Set.singleton v) chart of
(Nothing, chart) - Just chart
(Just set, chart) | Set.member v set - Nothing
| otherwise - Just chart
but notice that the set is still traversed twice.
Yes, I missed that bit. I
On 5/30/08, Martin Blais [EMAIL PROTECTED] wrote:
Dear Philip, could you point your virtual finger towards a
reference/paper/book/any-bleeping-thing that would help this simple
beginner understand why it doesn't work in this case? I'm trying to
picture why a read function that terminates the
Hi
The best thing to do is bypass read and use 'reads' to define your
own safe read.
maybeRead :: Read a = String - Maybe a
maybeRead s = case reads s of
[(x, )] - Just x
_ - Nothing
Or just use the Safe package:
Hi Duncan,
Not sure I agree the behavior is ok. E.g. here is a build of mmap:
[EMAIL PROTECTED]:~/FTP/Haskell/bytestring-mmap-0.2.0$ runhaskell Setup.lhs
clean
cleaning...
[EMAIL PROTECTED]:~/FTP/Haskell/bytestring-mmap-0.2.0$ runhaskell Setup.lhs
configure
Configuring
G'day all.
Quoting Isaac Dupree [EMAIL PROTECTED]:
Luckily,
it is very often the case that your code will be better off anyway if
refactored to have less module recursion. (though not always.)
Nonetheless, I prefer not to leave the robustness of my code to luck.
Besides, if I liked
Duncan,
By installing localling, I runhaskell Setup.hs configure
--prefix=$HOME plus add local path to LD_LIBRARY_PATH and LD_RUN_PATH? On
Linux, does ghc use .so's or is it linked statically?
Vasili
On Mon, Jun 2, 2008 at 5:38 AM, Duncan Coutts [EMAIL PROTECTED]
wrote:
On Mon,
41 matches
Mail list logo
