I suppose I'm just stating the obvious here, but R[x, y] is naturally
isomorphic to R[x][y]. That is, polynomials in x and y over the ring R have a
natural interpretation as polynomials in y over the ring R[x] of polynomials
over R. So, if you had a good library for working with polynomials (of
It is now possible for the overriding method to hide state from your class.
I think if you want to enforce this invariant you need an augmentable method.
On Oct 15, 2012, at 10:45 AM, Danny Yoo wrote:
> Oh, I forgot about allowing the subclass to process the events too!
> Add the following t
Thanks for the feedback. We will sent out a brief survey to
people who signed up. The goal is to make RacketCon a good
place for Racketeers to plot the futures of all languages.
-- Matthias
On Oct 15, 2012, at 1:10 PM, Greg Hendershott wrote:
> I'd also like to thank everyone who helped or
On 10/15/2012 11:49 AM, Jens Axel Søgaard wrote:
2012/10/15 Stephen Bloch :
But probably slower, at least for exact numbers. If "expt" were implemented naively as "for i
= 1 to num", the total number of multiplications would be quadratic in degree; if it were implemented by
repeated squaring
I'd also like to thank everyone who helped organize and present it.
It was a really great experience. To touch on just a few of the things
I learned (with apologies to anyone or anything I'm forgetting right
now):
- Sam has achieved the platonic ideal of typed/racket error messages;
it is simply
I'm glad I decided to get up very very early in the morning and make the
drive down to RacketCon. The tutorials were great. The little talks gave
a nice view on what is going on in the community. It was especially nice
to have a chance to talk to people in person.
Thank You RacketCon!
--
Anthony
2012/10/15 Stephen Bloch :
> But probably slower, at least for exact numbers. If "expt" were implemented
> naively as "for i = 1 to num", the total number of multiplications would be
> quadratic in degree; if it were implemented by repeated squaring, the total
> number of multiplications would
On Oct 15, 2012, at 11:35 AM, Robby Findler wrote:
> What degree of polynomial, I wonder, would it take to find a
> noticeable difference between these?
To distinguish between linear and quadratic, probably thousands to millions
(depending on whether "noticeable" means "to a human being" or "to
What degree of polynomial, I wonder, would it take to find a
noticeable difference between these?
On Mon, Oct 15, 2012 at 9:57 AM, Stephen Bloch wrote:
>
> On Oct 15, 2012, at 10:44 AM, Justin R. Slepak wrote:
>
>> Ah, I forgot about for/sum. This version is probably clearer:
>>
>> (struct polyno
On Oct 15, 2012, at 10:44 AM, Justin R. Slepak wrote:
> Ah, I forgot about for/sum. This version is probably clearer:
>
> (struct polynomial (coeffs)
> #:transparent
> #:property prop:procedure
> (lambda (poly num)
> (for/sum ([x (length (polynomial-coeffs poly))]
> [c (polynomial-
Oh, I forgot about allowing the subclass to process the events too!
Add the following to the end of the on-subwindow-char method:
(super on-subwindow-char receiver key-event)
Full source code is here:
https://gist.github.com/3892860
Racket Users list:
http://list
Ah, I forgot about for/sum. This version is probably clearer:
(struct polynomial (coeffs)
#:transparent
#:property prop:procedure
(lambda (poly num)
(for/sum ([x (length (polynomial-coeffs poly))]
[c (polynomial-coeffs poly)])
(* c (expt num x)
---
Justin Slep
> Is there a way to get the state map of the keyboard, i.e., to know if some
> key is pressed or released, independently of any key-event?
> Also, is there a way to know if the num-lock, caps-lock and scroll-lock
> states are on or off?
Hi Laurent,
Sorry; I could not find it so far. I was hoping
Do you want to try for/sum here?
On Oct 14, 2012, at 10:28 PM, Justin R. Slepak wrote:
> To use prop:procedure, just give a function which will handle the application
> of the structure to some arguments. The define-values is only there because
> the for/fold has two accumulators (sum and x)
14 matches
Mail list logo
