I tested with Racket v7.8 bc and it was also slow.
I also tested it with a year old version of my code and added similar
`time` calls around the drawing code
and it behaved like the recent version redrawing for all the mouse events,
only difference is that the on-paint takes around 23ms instead
I have a racket gui app that uses a canvas% with overridden on-event and
on-paint methods.
When the user hovers over drawn elements the on-paint is called via (send
this refresh)
to display the element under the cursor with a selection/outline.
Recently I noticed that this has gotten extremely
Thanks!
We were previously manually processing the files from
current-library-collection-links, but using `links` saves ~100 lines
of code.
On Fri, May 21, 2021 at 11:50 AM Matthew Flatt wrote:
>
> Yes, the format changed in that commit.
>
> The `decode-link-path` function is not meant to be
I wanted to understand a limitation of the repl of the rash package (github
issue https://github.com/willghatch/racket-rash/issues/78) as well as in the
racket repl, i guess, and see if i could do a quick hack to get something
working.
Anyway, i just wanted to catch SIGINT without using
There is some strangeness with the freenode situation. Andrew Lee posted a pdf
publicly and is talking about it right now on this thread if you haven't seen
it: https://news.ycombinator.com/item?id=27234542
Nate
> On May 20, 2021, at 2:30 PM, Stephen De Gabrielle
> wrote:
>
> I don’t use
Yes, the format changed in that commit.
The `decode-link-path` function is not meant to be public, although it
could be exposed. But for an approach that works now and with older
versions, the API you want is `links` from `setup/link`, possibly like
this:
(links #:file (find-links-file)
Hi,
It seems that, since 8.1, the format of paths in links.rktd has changed?
Are there new API fns that deal with this new kind of encoded path? Or
what is the recommended way to process them?
Something like this? (Is this `decode-link-path` public? I couldnt find it)
I was there and, as I remember it, there was a presentation on something else
where this was mentioned. IIRC, the topic was Language Oriented Programming
and there was a discussion about how much complexity is okay when you are
programmatically generating DSL code. The presenter mentioned
8 matches
Mail list logo