At Tue, 14 Apr 2015 21:04:38 -0400, Alexander D. Knauth wrote:
On Apr 14, 2015, at 6:57 PM, Matthew Flatt mfl...@cs.utah.edu wrote:
This is the kind of problem that the readtable argument to
`read/recursive` was meant to solve, but I see that it doesn't work in
this case.
I have in
I don't think you're missing anything. I don't often run into this
problem, maybe because libraries I've used tend to keep structs
private. When the problem does show up, I have resorted to using
`_pointer`, too.
At Tue, 14 Apr 2015 17:04:38 -0700 (PDT), Ian Johnson wrote:
I'm trying to
On Wed, Apr 15, 2015 at 09:55:11AM -0600, Matthew Flatt wrote:
I don't think you're missing anything. I don't often run into this
problem, maybe because libraries I've used tend to keep structs
private. When the problem does show up, I have resorted to using
`_pointer`, too.
Looks like the
You got it.
On Apr 15, 2015, at 10:19 PM, Alexander D. Knauth alexan...@knauth.org
wrote:
On Apr 15, 2015, at 10:12 PM, Jon Zeppieri zeppi...@gmail.com wrote:
On Wed, Apr 15, 2015 at 9:35 PM, Alexander D. Knauth
alexan...@knauth.org wrote:
On Apr 15, 2015, at 2:29 PM, Jon Zeppieri
On Wed, Apr 15, 2015 at 9:35 PM, Alexander D. Knauth
alexan...@knauth.org wrote:
On Apr 15, 2015, at 2:29 PM, Jon Zeppieri zeppi...@gmail.com wrote:
I'm trying to provide a struct, the struct type of which uses
prop:procedure and prop:match-expander, and I'd like the procedure to
have a
On Apr 15, 2015, at 10:12 PM, Jon Zeppieri zeppi...@gmail.com wrote:
On Wed, Apr 15, 2015 at 9:35 PM, Alexander D. Knauth
alexan...@knauth.org wrote:
On Apr 15, 2015, at 2:29 PM, Jon Zeppieri zeppi...@gmail.com wrote:
I'm trying to provide a struct, the struct type of which uses
Hi Sean,
On 4/14/2015 3:21 PM, Sean Kanaley wrote:
I see you also made the same point about English! But I don't get the
units. As far as I see it, the algorithm is doing X effective
computation per cycle. A faster algorithm is computing more each cycle,
And that's where we depart. A more
On Saturday, March 28, 2015 at 12:15:39 AM UTC+1, Alexis King wrote:
It might be interesting to create a binary s-expression format for more
efficient reading/writing, a la BSON’s relationship to JSON. Perhaps even
with some sort of optional compression. Racket’s reader is fairly
Well, I've some support for tracking a certain class of internal
errors in online check syntax that, before the recent push, would have
resulted in the purple dot never going away and check syntax getting
stuck. DrRacket should now show the error message and not get stuck.
And also the bluebox
FWIW the binary-class package by Roman Klochkov looks pretty nice:
http://pkg-build.racket-lang.org/doc/binary-class/index.html
/Jens Axel
2015-04-15 11:08 GMT+02:00 Adriaan Leijnse adriaan.leij...@gmail.com:
On Saturday, March 28, 2015 at 12:15:39 AM UTC+1, Alexis King wrote:
It might
On Wed, Apr 15, 2015 at 02:04:45AM -0400, George Neuner wrote:
The measure I was advocating was difference percentage based on
the terminology 50% faster. Difference percentage is just the
linear relative change (a ratio) multiplied by 100%. A ratio is a
fraction and the base of a
11 matches
Mail list logo
