[HN Gopher] Packed Data Support in Haskell
       ___________________________________________________________________
        
       Packed Data Support in Haskell
        
       Author : matt_d
       Score  : 16 points
       Date   : 2025-04-28 20:57 UTC (2 hours ago)
        
 (HTM) web link (arthi-chaud.github.io)
 (TXT) w3m dump (arthi-chaud.github.io)
        
       | nine_k wrote:
       | > _Introducing the 'packed' data format, a binary format that
       | allows using data as it is, without the need for a
       | deserialisation step. A notable perk of this format is that
       | traversals on packed trees is proven to be faster than on
       | 'unpacked' trees: as the fields of data structures are inlines,
       | there are no pointer jumps, thus making the most of the L1
       | cache._
       | 
       | That is, a "memory dump -> zero-copy memory read" of a subgraph
       | of Haskell objects, allowing to pass such trees / subgraphs
       | directly over a network. Slightly reminiscent of Cap'n Proto.
        
       ___________________________________________________________________
       (page generated 2025-04-28 23:00 UTC)