On 7/25/2017 12:45 AM, Lehi Toskin wrote:
I have noticed that printing in DrRacket is rather slow and I'm wondering if
that's something I could speed up. If I have a loop that runs and prints a
whole lot of information each loop, were I to become overwhelmed and click the
Stop button, it woul
This is difficult, since text% and everything on top of it is
unfortunately rather slow and complex. My best advice is to limit
or structure the amount of information displayed by the program, since
the end user (including you) is likely even slower in parsing the
information than racket is display
> On Jul 25, 2017, at 12:45 AM, Lehi Toskin wrote:
>
> I have noticed that printing in DrRacket is rather slow and I'm wondering if
> that's something I could speed up. If I have a loop that runs and prints a
> whole lot of information each loop, were I to become overwhelmed and click
> the S
I've made a language that exposes drracket:rep:current-rep. Code written in the
language can use it to display text and images, and add regions to be colored.
But there are occasional errors. Instead of posting the errors, which vary, and
are difficult to reliably reproduce, I'm wondering what i
On Tue, Jul 25, 2017 at 4:52 PM, George Neuner wrote:
>
> Having little experience with Racket's drawing library, I can't speak to
> how fast it is. I do recall someone saying it was (mostly) just a thin
> layer over the native platform library, but even "thin layers" add some
> latency. Nor do
The Interaction Window in DrRacket supports snips, picts etc., so it is
reasonable that is slower than a terminal.
But ... maybe it is possible to let the user choose a simpler interaction
window. One that only supports text?
As a feasibility experiment, is William Hatch's terminal faster than the
I'm trying to write my own source-code editor using `racket/gui` and
`framework`. Things are going well! I love what I've been able to accomplish so
far, with very little code!
I'm to the point where I'd like to add support for another language besides
Racket. I've been using `racket:text%` obj
+leif
Olin sent it to me a few years ago, but I couldn't get it working in
Racket. I didn't try hard though. I don't have it anymore since NEU swiftly
revokes access to email after you graduate. Perhaps Leif can bug Olin for a
copy of that tarball? Keep in mind that Olin is notoriously hard to fin
I've been working on building a DSL in Racket (as a #lang collection), and have
reached the stage where it's functioning as expected and ready to be embedded
in my application (which is written in C++).
I have modified the `run` function from the embedding example here
(https://docs.racket-lang
Thank you all for your help. I have moved to project to a flat file structure
now and reorganised everything hopefully to Racket standards (thank you,
Philip), and I have changed the complicated contracts to use 'integer-in'. I
think the API can stay as it is now, there is one struct and two functi
Thanks for the reply
I read that thing about the error handling on a forum but found it later in
another location
http://www.ccs.neu.edu/racket/pubs/icfp10-cf.pdf
>
>
> In other words, adding error-checking
> to the loop macro is expected to double the size of the
> code. Using syntax-parse
sigh ... meant to get this part into the reply (from the same paper)
The original version of the loop macro consists of 1840 lines of
code, not counting comments and empty lines. The implementation
of the loop keyword macros takes 387 lines; the rest includes the
implementation of its various int
One thing I'm curious about is what things can you and can you not pack? In the
README it shows bytes being packed, which seems a little obvious, but what
about (transparent) structs? Hashes? Lists? I'm very interested in this
package... for science!
--
You received this message because you ar
Hi Thomas,
I think the program is more of Racket programming setup rather than
embedding Racket. When start a Racket program on our own, we have to
setup the environment correctly.
Here is my test program that can load an external program and the
accompanying commands (also attached at the end).
I've come to the conclusion, that not assuming binary classification makes no
sense, since every n-class classification problem can be split into n binary
classification problems.
When assuming classes 0 and 1, the performance increases and I get to:
cpu time: 608 real time: 605 gc time: 68
Fo
On Tuesday, July 25, 2017 at 5:52:45 PM UTC-4, Shu-Hung You wrote:>
> As we can see,
> `scheme_namespace_require(scheme_intern_symbol("racket/base"));`
> is actually missing from your setup program. This line requires racket
> base and the usual #%app bindings. It's probably needed even if you're
16 matches
Mail list logo