Galler schrieb:
'Racket could implement mutable continuations, but has not'
I was just thinking whether mutable continuations can
be used for some JIT-ing. Had already a question about
call-site code replacement here. And there some response
was to use set! on a symbol. But using set-car! looks
Matthias wrote:
The documentation (See Guide s10.3) says "A continuation is a value
that encapsulates a piece of an expression context"
Someone should submit a doc bug report to the Guile people. The
'expression' should be replaced (or supplemented) with 'evaluation'.
Not "Guile", "Guide". T
Hi All,
From time to time the topic of screenshots pop up.
Being able to take screenshots from within (Dr)Racket
could be used for multiple purposes:
* bug reports
* StackOverflow posts
* scripting the images of GUI elements in the docs
Being on OS X have written some code that works for m
Thanks a lot.
But I want to test equality of two functions by comparing their call-graphs.
If you know, plz tell me?
How to construct call-graph of functions.
Racket Users list:
http://lists.racket-lang.org/users
I'd like to write a unit test that a syntax-parse expectation failure
elicits a certain error message. For instance, I'd do a regexp-match?
that "something" is present in a message like "expected something".
However it seems that syntax-parse expectation failures don't raise an
exception. In other
On Dec 2, 2012, at 1:42 AM, Galler wrote:
> Racket also provides operations for inspecting continuations, for example
> (continuation-marks k) returns the set of marks associated with k. (see Ref.
> s9.5).
Those are somewhat orthogonal to the opaqueness of continuations but
yes, I wrote "Imagin
On 12/02/2012 12:14 PM, Greg Hendershott wrote:
I'd like to write a unit test that a syntax-parse expectation failure
elicits a certain error message. For instance, I'd do a regexp-match?
that "something" is present in a message like "expected something".
However it seems that syntax-parse expec
What you're asking for is a control flow analysis. I think you might be
approaching whatever problem you're having the wrong way.
-Ian
- Original Message -
From: Mohammad Mustaqeem
To: users@racket-lang.org
Sent: Sun, 2 Dec 2012 11:56:48 -0500 (EST)
Subject: Re: [racket] Matching patterns
On Sun, Dec 02, 2012 at 09:29:34AM -0500, Prabhakar Ragde wrote:
> Matthias wrote:
>
> >>The documentation (See Guide s10.3) says "A continuation is a value
> >>that encapsulates a piece of an expression context"
> >
> >Someone should submit a doc bug report to the Guile people. The
> >'expression
The phrase 'evaluation context' has been in the literature since 1986 for just
this purpose. I know, I coined it.
On Dec 2, 2012, at 2:25 PM, Hendrik Boom wrote:
> On Sun, Dec 02, 2012 at 09:29:34AM -0500, Prabhakar Ragde wrote:
>> Matthias wrote:
>>
The documentation (See Guide s10.
Perfect -- thank you!
On Sun, Dec 2, 2012 at 1:34 PM, Ryan Culpepper wrote:
> On 12/02/2012 12:14 PM, Greg Hendershott wrote:
>>
>> I'd like to write a unit test that a syntax-parse expectation failure
>> elicits a certain error message. For instance, I'd do a regexp-match?
>> that "something" is
So I recently started to poke at my humble little bindings to the
Chipmunk library again. (someone sent me an email asking for help,
which reminded me that I hadn't worked on it in a while) The problem
is that I'm still stumbling over the same block that made me stop in
the first place a number of
Based on the documentation I found and the CP_ARBITER_GET_SHAPES macro,
it looks like the double-pointer arguments are just used for multiple
outputs. So you should use the following type for the function:
(_fun _cpArbiter-pointer
(out1 : (_ptr o _cpShape-pointer))
(out2 : (_ptr o _
> The phrase 'evaluation context' has been in the literature since 1986 for just
this purpose. I know, I coined it.
>
I wonder if there's been terminology drift in the reference
For example:
In the documentation, 'expression context' appears and is defined (Ref. 1.2.3.3)
'continuation frame'
Stepping through the program when debugging, it (the Racket runtime)
now crashes when running (cpArbiterGetShapes arb) with the
modifications you suggested.
(also I just pushed the changes to the GitHub repo for the bindings:
https://github.com/Freezerburn/Rhipmunk-Physics if you want to take a
loo
I searched the mailing list archives and didn't find any references to an
implementation of a minimum spanning tree algorithm. I've implemented
Prim's algorithm years ago in C#, but I was surprised not to find anything
on Planet or the archive.
If I create an implementation, where should I "publi
16 matches
Mail list logo