@haitchfive<p><strong>Crosstacks are Orthogonal Stack Views</strong></p><p><a href="https://github.com/ha1tch/ual/blob/main/spec/incoming/ual-1.8-PROPOSAL-crosstacks.md" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/ha1tch/ual/blob/mai</span><span class="invisible">n/spec/incoming/ual-1.8-PROPOSAL-crosstacks.md</span></a><br>Crosstacks are a new ual kind of element that provides orthogonal views across multiple stacks (think: a row of a spreadsheet that traverses several stack columns).<br>This extension lets you work with data in both vertical (traditional stack) and horizontal (cross-stack) directions with equal efficiency. With crosstacks, you can elegantly express complex operations on multi-dimensional data without specialized syntax. Tailored for matrix operations, image processing, and tensor calculations while maintaining ual's philosophy of explicit, efficient operations.</p><p><strong>HA-HT</strong></p><p><a href="https://github.com/ha1tch/ual/blob/main/doc/compiler/crosstack-implementation/haht.md" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/ha1tch/ual/blob/mai</span><span class="invisible">n/doc/compiler/crosstack-implementation/haht.md</span></a><br>Under the hood, crosstacks use a Hybrid Adaptive Hash-Tree structure that combines direct addressing with specialized data structures. The first two levels provide O(1) access to positions, while the third level adapts between five different implementations based on actual usage patterns. This approach delivers consistent performance for both vertical and horizontal access while efficiently handling sparse data and diverse workloads. At this time this is our best candidate implementation.</p><p><a href="https://oldbytes.space/tags/ual" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ual</span></a> <a href="https://oldbytes.space/tags/compsci" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>compsci</span></a> <a href="https://oldbytes.space/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a> <a href="https://oldbytes.space/tags/rustlang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rustlang</span></a> <a href="https://oldbytes.space/tags/golang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>golang</span></a> <a href="https://oldbytes.space/tags/foss" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>foss</span></a> <a href="https://oldbytes.space/tags/forth" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>forth</span></a> <a href="https://oldbytes.space/tags/retrocomputing" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>retrocomputing</span></a> <a href="https://oldbytes.space/tags/retrodev" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>retrodev</span></a></p>