Op 2-5-2012 22:05, Roelof Wobben schreef:
Hello,
I try to make a function in which a gauge get descreased and the
x-postion of a cat get decreased.
But that's not the problem.
Im trying to make the display function now.
When I break down the display in parts I get this :
(define cat )
(def
2012/5/3 Chris Stephenson :
> Isn't this just a question of choice of data representation?
>
> Once you drop the explicit powers from the representation and store
> least significant coefficient first, then the racket program becomes
> extremely simple.
>
> One reason Racket goes slower is that it
On May 2, 2012, at 11:50 PM, Deren Dohoda wrote:
> Well I am sure it will try to use all the memory it can. Anyway, my
> functional code can raise the polynomial you gave '(1 1 1 1 1 1 0) to
> the 300th power in about four seconds on my machine, with half a
> second of garbage collection
> Bu
uhm... am I mistaken, or is there one recursive call to fast-expt in a
non tail recursive position? Schouldn't that be unwound?
Quoting Stephen Bloch :
On May 2, 2012, at 11:50 PM, Deren Dohoda wrote:
Well I am sure it will try to use all the memory it can. Anyway, my
functional code can r
On Thu, May 3, 2012 at 1:45 PM, Rüdiger Asche wrote:
> uhm... am I mistaken, or is there one recursive call to fast-expt in a non
> tail recursive position? Schouldn't that be unwound?
The calls nest only upto log_2(n), so, why worry?
Racket Users list:
http://lists.rack
Hello all,
We're students and we're working on a space invaders project.
Our game runs very well but we've got a problem:
We would like to give the opportunity to players to press two keyboards buttons
at the same time but for now,our program tests only one event at the same time.
Is there a sol
Fine with me. (Can you re-indent the sierpenski example code the way
that DrRacket would indent it? Always good to follow our own style
guide...)
Robby
On Wed, May 2, 2012 at 11:45 PM, Asumu Takikawa wrote:
> On 2012-05-03 00:38:18 -0400, Asumu Takikawa wrote:
>> As you may know, myself and seve
Op 3-5-2012 14:24, Laurine Harbulot schreef:
Hello all,
We're students and we're working on a space invaders project.
Our game runs very well but we've got a problem:
We would like to give the opportunity to players to press two
keyboards buttons at the same time but for now,our program tests o
On May 3, 2012, at 8:24 AM, Laurine Harbulot wrote:
> Hello all,
> We're students and we're working on a space invaders project.
>
> Our game runs very well but we've got a problem:
> We would like to give the opportunity to players to press two keyboards
> buttons at the same time but for now,
Thanks for working on all these pages. I have edited these myself, and I have
no objections to fixed.
As for folding in the DrRacket/DrScheme page, I have serious doubts. We trained
several hundred teachers and faculty colleagues who know us and who refer to us
as the "DrScheme people". Even
On May 3, 2012, at 1:29 AM, John Clements wrote:
> "The earliest Lisp macros took the form of FEXPRs, function-like operators
> whose inputs were not the values computed by the arguments but rather the
> syntactic forms of the arguments, and whose output were syntactic fragments
> to be used i
On May 3, 2012, at 7:45 AM, Rüdiger Asche wrote:
> uhm... am I mistaken, or is there one recursive call to fast-expt in a non
> tail recursive position?
Yes, there is.
> Schouldn't that be unwound?
Assuming you want correct answers :-) , it can't be unless you start adding
extra parameters t
I made the first change, but will leave the second to Ryan (or you?).
Jay
On Sat, Apr 14, 2012 at 10:29 PM, J G Cho wrote:
> 1. Currently the following Formlet is used:
>
> (define new-post-formlet
> (formlet
> (#%# ,{input-string . => . title}
> ,{input-string . => . body})
> (value
Dear Stephen,
It turns out that the "fast" multiplication algorithm isn't so fast for
polynomials. See Norvig's Paradigms of AI Programming or Zippel's
Effective Polynomial Computation.
-Arthur
==
Arthur Nunes-Harwitt
Computer Sc
This reminded me that I had a similar kind of recursion issue when I
wrote some code for generating integer partitions. In the end I
abandoned the stack+tail recursion form and accumulated a list of
things to do when I thought I was done, which made all calls tail
calls. It significantly sped up th
Party out of a desire to be explicit, but mosty because no polynomial
to be multiplied will ever need the zero position. I found working
with hashtables less awkward than vectors had been, for this reason.
My latest hash-based version also calculates 300 multiplications in
around 4 seconds. Not
I am using `render-metafunction' from redex/pict inside a scribble document but
the resulting pict's font is too large. How can I make it smaller, or
preferabbly use the same font size as the rest of the document? I found
`current-font-size' from slideshow/base but that doesn't seem to be the ri
At Thu, 03 May 2012 14:18:17 -0600, Jon Rafkind wrote:
> I am using `render-metafunction' from redex/pict inside a scribble
> document but the resulting pict's font is too large.
How about scaling the pict using `scale'?
Otherwise, I think you want `default-font-size' and
`metafunction-font-size'
(There are a bunch of such knobs, and they should be all right next to
each other in the redex/pict library's documentation.)
On Thu, May 3, 2012 at 3:35 PM, Matthew Flatt wrote:
> At Thu, 03 May 2012 14:18:17 -0600, Jon Rafkind wrote:
>> I am using `render-metafunction' from redex/pict inside a
Aha I see metafunction-font-size and other useful things like `linebreaks',
thanks.
On 05/03/2012 02:43 PM, Robby Findler wrote:
> (There are a bunch of such knobs, and they should be all right next to
> each other in the redex/pict library's documentation.)
>
> On Thu, May 3, 2012 at 3:35 PM, Ma
On May 3, 2012, at 7:11 AM, Matthias Felleisen wrote:
>
> On May 3, 2012, at 1:29 AM, John Clements wrote:
>
>> "The earliest Lisp macros took the form of FEXPRs, function-like operators
>> whose inputs were not the values computed by the arguments but rather the
>> syntactic forms of the arg
Hi all,
I would like to show in a canvas% (or perhaps as some type of snip%) in one
window, a thumbnail snapshot image of the current display (i.e. the
contents) of some other frame%.
My understanding of how the GUI all hangs together isn't clear, and so I am
unsure of the best way to attack. Any
On Thu, May 03, 2012 at 05:02:08PM -0700, John Clements wrote:
>
> and updated the Wikipedia page to reflect my better understanding. The text
> now reads:
>
> "The earliest Lisp macros took the form of FEXPRs, function-like operators
> whose inputs were not the values computed by the argument
Mea culpa, I knew that too and (as indicated in my private message) Eugene's
dissertation chapter on the history of macros says so.
We should mention the symbol property list idea here, which is pervasive in
1.5.
Do read Eugen's chapter -- Matthias
On May 3, 2012, at 8:02 PM, John Clement
--- On Thu, 5/3/12, Hendrik Boom wrote:
> From: Hendrik Boom
> Subject: Re: [racket] Wikipedia article update
> To: users@racket-lang.org
> Date: Thursday, May 3, 2012, 8:51 PM
> On Thu, May 03, 2012 at 05:02:08PM
> -0700, John Clements wrote:
> >
> > and updated the Wikipedia page to reflect m
25 matches
Mail list logo
