Post #3722303
2026-07-10 18:14 UTC
@joe@f.duriansoftware.com @slava@mathstodon.xyz So no nested spans, just flat spans of bit ranges with no internal stride?
Replies (2)
-
@joe@f.duriansoftware.com 2026-07-10 18:18
@zwarich@hachyderm.io @slava@mathstodon.xyz well, perl made it four major versions without nested arrays
-
@joe@f.duriansoftware.com 2026-07-10 18:28
@zwarich@hachyderm.io @slava@mathstodon.xyz from a value semanticist point of view, you could argue a span is a "reference type" and modeling its equatability/hashability/comparability in terms of its pointer value is the right thing to do. and if the value comprises the whole graph then you ought to be using indices to describe the edges, like slava said, so the whole blob is a portable bitwise-manipulable blob