coffeebird[m] has quit [Ping timeout: 240 seconds]
thejohnhenry[m] has quit [Ping timeout: 260 seconds]
Edward[m] has quit [Ping timeout: 260 seconds]
davidar_ has quit [Ping timeout: 260 seconds]
JulianFoad[m] has quit [Ping timeout: 245 seconds]
thekyriarchy has quit [Ping timeout: 240 seconds]
davidar has quit [Ping timeout: 260 seconds]
M-hrjet has quit [Ping timeout: 240 seconds]
nolan_d has quit [Ping timeout: 269 seconds]
Ed[m] has quit [Ping timeout: 269 seconds]
hannes[m] has quit [Ping timeout: 256 seconds]
wakest has quit [Ping timeout: 260 seconds]
harish has quit [Ping timeout: 260 seconds]
xet7 has joined #sandstorm
zopsi has quit [Ping timeout: 256 seconds]
hannes[m] has joined #sandstorm
<simpson>
Huh. So, when Monte's Capn parser loads a message, it builds an in-memory skeleton representing the basic pointer information. TIL that this is a dovetail with work done in the succinct data-structure community to speed up parsing.
<kentonv>
simpson, does that mean the parser traverses the whole tree upfront?
<simpson>
kentonv: Mine only looks at the first header to determine where it should imagine its data and pointers to be. But after that, each additional bit of exploration generates a new bit of the skeleton.
<simpson>
ekmett talks about the same idea, generating a mini-index on some JSON bytes lazily with Haskell's laziness.
<kentonv>
ah
samba_ has quit [Ping timeout: 240 seconds]
blueminder has joined #sandstorm
samba_ has joined #sandstorm
harish_ has joined #sandstorm
harish has quit [Read error: Connection reset by peer]