Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•6mo ago

Comments

nine_k•6mo ago

> 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.

90s_dev•6mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•6mo ago

They mention this in the article.

spockz•6mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•6mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•6mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•6mo ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•6mo ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•6mo ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•6mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•6mo ago

This was very well written. Excellent article!

NetOpWibby•6mo ago

Is this like MessagePack for Haskell?

Don't believe the hype – quantum tech can't yet solve real-world problems

Buy 2MMC, 4MMC, 3CMC, Crystal Meth, Ketamine, Ephedrine WhatsApp:+447447025920

Buy MDMA, amphetamine and cocaine online WhatsApp:+447447025920

QuackStack

Build waitlists that rank on Google

Apple plans to remove Wi-Fi network syncing on Apple Watch in the EU

How would a 4D Camera work?

100th GitHub Release, yet It's Day 1

OpenAI Hypocrisy on Paying for IP

The American Catalog Home Boom and Bust

'Everybody should simply decide to give me more money' is also my financial plan

Making Conway's Game of Life Playable

Retractable lightsaber with instant extension [video]

Myers Diff for Tab Management: Part 2

C___ – A simple programming language with clean syntax

A Guide to My Organizational Workflow

Notes Apps

US Government to Cut Air Traffic in 40 Major Markets If Shutdown Continues

The Race to Win Staten Island [video]

Geometric formulation of quantum mechanics (2015)

Build123d (A Python CAD programming library) Roadmap

Mamdani Broke the Democrat Machine

NetNewsWire 6.2 for Mac and iOS – RSS Plus Markdown

Arles Schwab close to deal for private share exchange Forge Global

Dearly Departed Datasets

Bluetooth 6.2 – more responsive, improves security, USB comms, and testing

Stepping Down as Framework Linux Community Ambassadors

CoAgent = AI-container, RepoZipper = GitHub backups

Student of the Game

Unfolding Patterns