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 :
> On Saturday, March 28, 2015 at 12:15:39 AM UTC+1, Alexis King wrote:
> > It might be interesting to crea
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
> complic
Hmm, yes, on closer inspection, I see that you’re right. It’s not worthless,
but it’s definitely not ideal for actually using as a communication protocol.
So I guess my original point still stands: having a consistent binary encoding
for s-expressions could be nice.
> On Mar 27, 2015, at 18:10,
Just comenting only on Alexis's suggestion here, since sounds like John
is happy with sexps for now.
I don't see how `racket/fasl` is suitable for heterogeneous interop,
which is a very common case needing this, perhaps the most common.
Spec-wise, `racket/fasl` is not defined, beyond that it c
Oh, very neat... racket/fasl was precisely the sort of thing I was thinking of.
> On Mar 27, 2015, at 17:26, Jay McCarthy wrote:
>
> Look at my original response to John's post about this... The binary format
> you are thinking of is racket/fasl.
>
> Jay
>
> On Friday, March 27, 2015, Sean Ka
Look at my original response to John's post about this... The binary format
you are thinking of is racket/fasl.
Jay
On Friday, March 27, 2015, Sean Kanaley wrote:
> Couldn't this binary s-expression just be a struct?
>
> '(move 3 5)
>
> becomes
>
> (struct move (x y) #:prefab)
> (move 3 5)
>
>
Couldn't this binary s-expression just be a struct?
'(move 3 5)
becomes
(struct move (x y) #:prefab)
(move 3 5)
client/server will likely have some kind of matching either way, and prefab
structs can be matched
(match command
[(list 'move x y) ...
becomes
(match command
[(move x y) ...
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 complicated,
though, so it might need to restrict itself to a useful subset?
> On M
Brian Craft wrote on 03/27/2015 03:45 PM:
Was this a reference to a particular racket lib? And if so, which one?
https://twitter.com/ID_AA_Carmack/status/577878167542734848
The `read` and `write` procedures are one way to do this. (Though you
want to disable some features when you do that.
Was this a reference to a particular racket lib? And if so, which one?
https://twitter.com/ID_AA_Carmack/status/577878167542734848
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it,
10 matches
Mail list logo