operations you want to perform in terms of
the inputs, and then do them all "in bulk" to produce the output image. You
don't want people to go in and arbitrarily set pixels to anything they want
at any time they want.
--
Sebastian Sylvan
___
ay. You don't need to worry about the
dicing up and recombining, the compiler takes care of it for you. You just
write things in terms of parallel arrays (which can be small, e.g. 2 element
wide) and the compiler will fuse/flatten these together into big bulk
par
On Fri, Mar 26, 2010 at 10:52 PM, Mads Lindstrøm
wrote:
> Hi
>
> On Fri, 2010-03-26 at 21:33 +, Sebastian Sylvan wrote:
>
> >
> >
> > Reorganizing data on the fly sounds like it may be a pretty sensible
> > idea now that cache misses are so bad (in compari
ou could potentially store a heavily quantized lookup
table (possibly at the expense of padding some members to align all members
on a large common multiple from the base).
The general idea seems interesting to me, but then I'm hardly an expert. I
like the notion of using
hink that's what he's talking about. He's saying the data that
would normally be on the other side of the pointer would instead be stored
"inline", if I understand him correctly.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
hat are actually short-lived
into the older generation (which should reduce pressure on that older
generation, as well as speed up G0 collection). Ideally we'd have some way
of telling the GC to try to avoid running during the actual frame it
4.7.3) 162 pages (251 including builtin functions)
> Scheme (R5RS): 17 pages (45 including standard procedures)
>
Oberon: 16 pages, including table of contents and Appendix (containing EBNF
grammar).
--
Sebastian Sylvan
___
Haskell-Cafe mai
rary fails to build because of your ghc version, you can
install a specific version of that library instead. E.g. for haddock you see
that the failing version was 2.4.2 but if you leave out the version number
cabal will fetch the latest one for you, which isn't compatible wi
s to write any code which depends on this unpredictable behaviour. In
other words, the expressions that get evaluated lazily must not have side
effects.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/ma
bout what
you mean, rather than intentionally obscure your points to avoid
causing offence. Be specific. What language? How is it different than
Haskell w.r.t. purity?
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://w
gt; potential
Indeed. Something like Windows Azure could be a good fit too (as it more
directly supports native code than GAE does).
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with LINQ etc.), which also requires that
the expressions to be pure. Currently mainstream languages rely on
programmers being Very Careful, but again these kinds of assumptions aren't
scalable.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
H
a job.
Haskell is still exotic enough that it has a disproportionate amount of
Giant Brains among its practitioners. Companies tend to want to hang on to
these, even in a recession.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ld try to explain what you mean using
specific examples. I read the other thread and the post of yours didn't
really seem to make much sense to me there either.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
sort by
>> the index afterwards. If efficiency matters, you can perform other tweaks.
>> But the principle is quite straightforward. Or you can refactor your code
>> to take the IO dependency out of your random number generation, and run the
>> sets of pure code in parallel using the parallel library. If all you are
>> using IO for is random numbers, that's probably the nicest approach.
>>
>> Good, fast random numbers are unfortunately necessary - I had a nice
> implementation using System.Random, but had to rewrite it because
> performance was poor :( .
Have you tried this, pure, library?
http://hackage.haskell.org/package/mersenne-random-pure64
<http://hackage.haskell.org/package/mersenne-random-pure64>
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://msdn.microsoft.com/en-us/library/4khtbfyf(VS.80).aspx
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ue1.3"
(where wrapping a class up in angle brackets makes it into an existentially
qualified wrapper, which is instantiated in the class itself -- maybe we
need explicit conversion from e.g. Int to though...)
You don't need it very often, but I wonder if that's because there genuin
n the GHC compiler (I am using
> Windows Haskell Platform 2009.2.0.2)?
>
Line comments start with "-- ", not just "--".
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
utensils. Being "natural" or
"intuitive" is a 100% irrelevant metric for any tool. What matters is if
it's effective or not.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ake
no other assumptions. This is, in principle, no different from passing a
speed Double to a function that expects a mass Double (e.g. it may produce
garbage for negative values). In both cases a function that requires extra
invariants can enforce it by using a newtype that's constructed and
On Thu, Sep 10, 2009 at 10:58 AM, Duncan Coutts wrote:
> On Wed, 2009-09-09 at 20:19 +0100, Sebastian Sylvan wrote:
> >
> >
> > On Wed, Sep 9, 2009 at 1:28 PM, Duncan Coutts
> > wrote:
>
> >
> > If the Windows users can come to a consensus on
the default global or user installation paths.
>
I think it's morally right to run as user by default. Yes, the windows
culture has some legacy that may, on occasion, make it slightly harder to
use "well behaved" programs, but it's fairly minor these days.
--
Sebastian S
e
> > programming contest problems can be written in a purely functional
> > style, so you can limit monadic code to just a few helper functions.
> >
>
> Yes I know but there are a lot of problems requiring O(1) array updates
> so then you are stuck with IO again
Not nec
use?
>
I usually just whip up a quick parser using
Text.ParserCombinators.Parsec<http://www.haskell.org/ghc/docs/latest/html/libraries/parsec/Text-ParserCombinators-Parsec.html>
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
setup?
>
> Iain
>
>
>
> _______
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, Aug 16, 2009 at 2:50 PM, John A. De Goes wrote:
> On Aug 15, 2009, at 5:32 PM, Sebastian Sylvan wrote:
>
> On Sun, Aug 16, 2009 at 12:18 AM, John A. De Goes
> wrote:
>
>> You must think I'm arguing for some kind of low-level analog of C,
>> augmented wit
On Sun, Aug 16, 2009 at 12:18 AM, John A. De Goes wrote:
> On Aug 15, 2009, at 4:59 PM, Sebastian Sylvan wrote:
>
>
>> Your point about safety in C has no relation to safety in a functional
>> language with a sophisticated effect system.
>>
>> I'm sorry,
which can cause very hard-to-catch bugs
when you rely on ordering, is no good argument that we should add even more
of it!
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, Aug 15, 2009 at 11:54 PM, John A. De Goes wrote:
> On Aug 14, 2009, at 9:34 PM, Sebastian Sylvan wrote:
>
> On Sat, Aug 15, 2009 at 3:55 AM, John A. De Goes wrote:
>>
>> If you don't like the file system, consider mutable memory. An effect
>> system will
ou can always rely on ordering even if you
don't even realise you need to, and there's plenty of practical experience
indicating that the other option (explicit barriers to indicate when
something isn't commutative) is sheer madness.
--
Sebastian Sylvan
On Sat, Aug 15, 2009 at 3:55 AM, John A. De Goes wrote:
> On Aug 14, 2009, at 8:21 PM, Sebastian Sylvan wrote:
>
> But you can't! I can easily envisage a scenario where there's a link
>> between two pieces of data in two different files, where it's okay if the
>
o the outside world, there may be implicit ordering that
you need to respect, so I really think that needs to be serialized.
Of course, there may be things in the IO monad that doesn't talk to the
outside world that could be commutative.
--
Sebastian Sylvan
_
those operations,
precisely because the compiler has no way of knowing anything about what
kind of assumptions are in effect.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
hanges the contents of another file?
Surely to catch that you must mark *all* file system access as
"interefering"? Even worse, another program could monitor the state of a
file and conditionally disable thet network driver, now file access
interferes wit
ata-structures, I'll of
> course also need to control the alignment in such a case. Is there
> such a thing as explicit dynamic memory allocation in Haskell ?
>
> Thanks, Thomas
>
> On Wed, Aug 5, 2009 at 3:16 PM, Sebastian
> Sylvan wrote:
> > GHC doesn't have per
rth trying that. In particular I believe it
executes sparks in batches, to reduce the overhead (which hopefully fixes
your issue).
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
rbage collected fairly quickly so I don' think that's
an issue, other than the effects on speed that the extra allocations would
have. It's probably mainly speed because each pixel would have time
complexity O(n+m) rather than O(1) for an n*m image...
--
Seb
On Mon, Aug 3, 2009 at 6:38 AM, CK Kashyap wrote:
> Thanks Sebastian,
> ppm module is indeed very useful. So, I guess my question then just boils
> down to, how can I write a function to mimic the setPixel function ->
>
> Basically, a blank white image would look like this (as per ppm module)
>
the docs for
ppm has an example for the ASCII version):
writePPM fname img = withBinaryFile fname WriteMode (\h -> hPutStr h (ppm_p6
img) )
If you're looking for the learning experience, you could always read the
source for the library (which is pretty tiny).
--
Sebastian Sylvan
+44(0)7857-300802
UIN:
, Jun 15, 2009 at 10:40 AM, Sebastian
> Sylvan wrote:
> >
> >
> > On Mon, Jun 15, 2009 at 4:18 AM, Richard O'Keefe
> wrote:
> >>
> >> There's a current thread in the Erlang mailing list about
> >> priority queues. I'm aware of,
wed binomial heaps is asymptotically optimal
(O(1) for everything except deleteMin which is O(log n)), so if that's what
he means by "efficient" then he's most definitely wrong. If he's talking
about "small constant factors" then it's harder to understand what he&#
On Wed, Jun 10, 2009 at 2:10 PM, Sebastian Sylvan <
sebastian.syl...@gmail.com> wrote:
>
>
> On Wed, Jun 10, 2009 at 2:08 PM, Sebastian Sylvan <
> sebastian.syl...@gmail.com> wrote:
>
>>
>>
>> randomList :: (RandomGen g) -> Int -> g ->
On Wed, Jun 10, 2009 at 2:08 PM, Sebastian Sylvan <
sebastian.syl...@gmail.com> wrote:
>
>
> randomList :: (RandomGen g) -> Int -> g -> [Integer]
>
Just spotted this typo, it should be:
randomList :: (RandomGen g) = Int -> g -> [Integer]
There may be ot
e having side effects. So
the "IO" type is "contagious", as soon as you use it in a function, then
that function must also return IO, and so on for anything using *that*
function and son.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
t;)', namely `return 0'
> In the second argument of `timed2', namely
> `(wait 5 >> return 0)'
>
Right, I forgot about the "Either" bit so you'd have to make sure the
action's result and the default has the same type (or modify it to return an
Either).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
- no compiler atm).
timed timeout act fallback = do
res <- newEmptyMVar
tid <- forkIO $ act >>= writeMVar res
threadDelay timeout
stillRunning <- isEmptyMVar res
if stillRunning then killThread tid >> return fallback else takeMVa
mperative to pure functional ?
Massive brain-rewiring. Keep at it, don't think in terms of modifying state,
think of it as computing new values from old values. I find that the payoff
of learning to think ,like this is massive, as it's usuall
nd the version with parallelism is slow (> 10 sec).
> This could be entirely due to space leaks etc when queueing many
> tasks.
>
> I'm useful for any thoughts people might have!
>
> Thanks in advance,
>
> Neil
>
> _______
>
;t know how much of Qt is implemented in
>> qtHaskell, or whether the latest version of Qt (4.4) is implemented.
>>
>> Thanks,
>> Mike
>>
>
> The main problem is, as far as I know, the complete lack of any usable GUI
> designer. You have to type everything y
> up the numbers and the highest one wins. Voting yes on everything
> doesn't help since then all your votes cancel out.
You can do that with condorcet by just selecting the ones you approve of and
making them tied for first...
--
Sebastian Syl
em all to my liking, but without instant visual
> feedback on the voting ballot, this is a hopeless task.
Indeed, I thought each entry would contain a thumbnail for the logo itself,
but I guess it doesn't support HTML? This is pretty arduous...
--
Sebastian Sylvan
+44(0)7857-300802
UI
t would be helpful to define a helper function with this signature:
prepend :: (Eq a) => a -> [a] -> [a]
Which for "prepend x xs" will put x at the front of the list, so long as the
first element of the list xs is different from x. Once you have this
func
On Mon, Mar 9, 2009 at 10:38 PM, Sebastian Sylvan <
sebastian.syl...@gmail.com> wrote:
>
>
> On Mon, Mar 9, 2009 at 10:21 PM, Bulat Ziganshin <
> bulat.zigans...@gmail.com> wrote:
>
>> Hello Sebastian,
>>
>> Tuesday, March 10, 2009, 1:08:38 AM, you wr
erence among them I would've ranked
them - if I didn't then I must not care either way.
I suspect 99% will have a few favourites, and then they will have a few that
they object to, and for the rest they just don't care which ones win.
Expressing that with the proposed
On Mon, Mar 9, 2009 at 5:26 PM, Luke Palmer wrote:
> 2009/3/9 Sebastian Sylvan
>
>>
>>
>> On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin <
>> bulat.zigans...@gmail.com> wrote:
>>
>>> Hello Sebastian,
>>>
>>> Monday, March 9
tie" in the interface) if they don't care which one of the
group they want, or they can differentiate between them if they like. You
could possibly name them "60 a", "60 b" etc. to indicate that they are
similar, but there's no reason not to allow people to d
On Mon, Mar 9, 2009 at 10:52 AM, Sebastian Sylvan <
sebastian.syl...@gmail.com> wrote:
>
>
> On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin <
> bulat.zigans...@gmail.com> wrote:
>
>> Hello Sebastian,
>>
>> Monday, March 9, 2009, 1:08:50 PM, yo
the middle, and just fine tune your
ranking at the top and bottom.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
few of those that you really dislike and
put them even lower than the default rank). But the point is that you
shouldn't need to rank every single logo, just the ones you care about and
then you leave the rest at the default rank.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
ocator/GC that's worsened by having
two threads?
What happens with -O2?
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
or maybe they just misunderstood you. Either way, please try
to be civil.
The only argument anyone made towards "cheating" on the gcc side is that ANY
program which just prints a precomputed result is worthless for comparisoin
(regardless of which side is doing it).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
n, no
> more.)
>
> His point is valid. But Don's results *not* obtained by optimizing in this
> fashion are valid comparisons, and the results obtained with this
> optimization are useful for other reasons.
>
> Louis Wasserman
> wasserman.lo...@gmail.com
>
&g
otivating example
for implementing a compiler optimization to do it automatically.
Just outputting the precomputed result means nothing.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://ww
I was intending to send this privately but clicked the wrong button.
Apologies for adding even more noise to this discussion.
On Sat, Feb 21, 2009 at 12:47 AM, Sebastian Sylvan <
syl...@student.chalmers.se> wrote:
>
>
> On Sat, Feb 21, 2009 at 12:16 AM, Bulat Ziganshin &
t a smiley at the end of a thinly veiled ad hominem
doesn't mean you get to pretend that you're just a victim when people get
understandably ticked off at your tone and respond in kind.
Search the archives, performance discussions come up all the time, often
with quite vigorous criticism o
and general approach in the future. Haskell
people in general are always pretty good at accepting criticism IME (they
tend to want to fix the problem), don't you think it's odd that it's only
*your* criticism that gets so much flak? Maybe some part of the reas
>> undeclared (first use in this function)
> >> Database\HDBC\Sqlite3\Statement.hsc:150: error: `SQLITE_ERROR'
> >> undeclared (first use in this function)
> >> compiling dist\build\Database\HDBC\Sqlite3\Statement_hsc_make.c failed
> >>
> >> Is the file '
s,
> David.
> _______
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ugh some
level of "sanity checking". When you're writing imperative code, a lot of
the meaning of your program comes from the ordering of statements - which
usually isn't checked at all (aside from scope).
So IMO static typing is good, but it'
t; even comes close to having production-safe (that is, non-abusable)
> semantics.
Shouldn't the following WASH function help?
once :: (Read a, Show a) => CGI a -> CGI a
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
erated by ghc
>
Impossible? Really? How does performance relate to it being possible to
write? I would be surprised if it was indeed impossible to get something
that runs fine one *some* machine.
It may be difficult to beat C, but that doesn't mean it's impossible to
write something use
ch the session log
from disk, replay the whole session from that, and reproduce the
continuation that way. That way most sessions would just work directly off
of the cache and never touch disk, but if someone waits too long (or, say,
bookmarks a page in the middle of the session!) there's sti
--
From: "Duncan Coutts"
Sent: Sunday, February 01, 2009 2:59 PM
To: "Don Stewart"
Cc:
Subject: Re: [Haskell-cafe] 1,000 packages, so let's build a few!
On Sat, 2009-01-31 at 14:02 -0800, Don Stewart wrote:
>not really :) e.g. my output
--
From: "Don Stewart"
Sent: Saturday, January 31, 2009 8:35 PM
To: "Andrew Coppin"
Cc:
Subject: Re: [Haskell-cafe] 1,000 packages, so let's build a few!
andrewcoppin:
In celebration of Hackage reachin over 1,000 unique packages, I decided
th
ows for the async monad)?
See e.g.
http://blogs.msdn.com/dsyme/archive/2007/09/22/some-details-on-f-computation-expressions-aka-monadic-or-workflow-syntax.aspx
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ackend
which should work fine with MySQL.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
asks.
Consider using Contorl.Parallel.Strategies which allows you to spark of
lightweight jobs that get run on a pool of threads.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskel
The cabal file still includes the vty dependency, but simply removing it
made it compile.
--
From: "Simon Michael"
Sent: Sunday, January 18, 2009 7:04 PM
To: "Sebastian Sylvan"
Cc: ;
Subject: Re: ANN: hledger 0.3 released
#x27;re using and would remove packages that won't build on that OS (by
recursively checking dependencies too).
--
From: "Duncan Coutts"
Sent: Sunday, January 18, 2009 6:20 PM
To: "Sebastian Sylvan"
Cc: "Jeff Wheeler&
ependency graph.
--
From: "Simon Michael"
Sent: Sunday, January 18, 2009 6:08 PM
To: "Sebastian Sylvan"
Cc: ;
Subject: Re: ANN: hledger 0.3 released
On 1/18/09 9:39 AM, Sebastian Sylvan wrote:
I was interested in actually using this &quo
I was interested in actually using this "for real", but unfortunately it seems
like you have a dependency on the unix package. Would it be possible to use
something portable (specifically to windows) instead?
From: Simon Michael
Sent: Saturday, January 17, 2009 11:42 PM
To: hled...@googlegroup
Doesn't work on windows.
--
From: "Jeff Wheeler"
Sent: Sunday, January 18, 2009 4:27 PM
To:
Subject: Re: [Haskell-cafe] runghc Setup.hs doitall
On Sun, 2009-01-18 at 16:22 +0000, Sebastian Sylvan wrote:
Is there some sort of
Is there some sort of bundle that you can use to install cabal-install
easily? Because it looks to me like I'd have to spend the better part of an
evening manually downloading and installing the gazillion of dependencies it
has, which is far too much work when I just wanted to spend ten minutes
the
footnotes for their fill of papers containing pages of squiggly symbols!).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
pty boxing being equivalent to +Inf),
allowing multiple entries to share the same rank.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
people won't be deeply unhappy with it.
> >It would be a shame if there's lots of votes that are spread out over
> a
> >large group of fairly similar logos that are good, and then a crappy
> one
> >wins out with 6% of the vote because there weren't a
t with 6% of the vote because there weren't any others like it so the
votes for that "style" weren't spread out over multiple entries.
Wikipedia:
http://en.wikipedia.org/wiki/Condorcet_voting
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
_
ghc --make -fcpr-off
-threaded -fdph-par -package dph-base -Odph -XPArr parr2.hs
-- execution as before
main = print $ [: True | n <- [: 1000 .. 5000 :], fac n == 0 :]
That's 4000 items of work there, so surely it should kick off plenty of
sparks to overcome the "sparks bug"
s
> > the way to go :)
> >
> Or you could use OpenGL, which has supported that since the first GPUs
> that did were released.
I think that came with OpenGL 3.0. Unless you're counting vendor-specific
extensions...
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
his, I am applying a non-linear
> transformation to an object on every frame. (Note: non-linear, so a
> matrix transform will not suffice.)
>
Any reason why you can not do this in the vertex shader? You really should
avoid trying to touch the vertices with the CPU if at all possible.
--
t's not how *real* applications look! In real
applications that kind of code would be only a fraction of the total code
base, most of it would be perfectly ordinary Haskell! (whereas in C
everything would be, well C)
Cheers,
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ght after Map.
> >
> > Only if you can figure out that "Map" means what every other programming
> > language on the face of the Earth calls a "dictionary". (This took me a
> > while!)
>
> So, when did Java leave the face of the earth?
At the same
u can create a list or Rule like so:
>mylist :: [Rule]
>mylist = [ MkSgRule mysgrule, MkGcRule mygcrule ]
where mysgrule :: SgRule and mygcrule :: GcRule.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
le cell mailbox (both reads and writes are blocking),
then set up two classes that shuffles values from the same two mailboxes in
the opposite direction?
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@has
nd locks are on the same side of this argument - they both
require the user to ahead of time partition the data up and decide how to
serialize operations on the data (which is not always possible statically,
leading to very very complicated code, or very low concurrency).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
cy using locks
6. Lockless programming.
So while I wouldn't resort to any shared state concurrency unless there are
good reasons for why the other methods don't work well (performance is a
good reason!), there are still situations where you need it, and a general
purpose language had b
at the program does, a little poking in an
interactive session will usually get you there far faster then anything you
could do in C++. The same goes for tracking down bugs, IMO. It would be
nicer to have better traditional debugging tools of course
t this? Specifically what things can happen in-place, and future
extensions...
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ally flew on this problem.
> >
>
>
> I did some reading up on this, and it seems interesting. It would be
> need to implement something like this in Haskell, but I can't seem to
> find any detailed specs on the data-structure. Got any
> recommendations?
http://en.wiki
end to impact your
program a lot more than just some minor changes to the functions at the
"bottom", it will change the whole design.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
1 - 100 of 445 matches
Mail list logo
