pykinos-core: Unboxed SIMD Roaring Bitmaps, ART IntMap, B+ and FAST search trees

[ data, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

Cache-conscious, unboxed, blocked data structures for high-performance algebraic evaluation, AST indexing, and transactional memory in Haskell.

Named from Greek πυκινός / πυκνός (close, compact, solid; cf. Homer, Iliad 15.529 'πυκινὸς θώρηξ' and Dionysius of Halicarnassus 'τὸ πυκνόν'), pykinos eliminates boxed pointer chains in favour of flat, cache-line aligned primitive memory arrays.

Provides two-tier SIMD Roaring bitmaps, 4-tier Adaptive Radix Trees (ART), unboxed B+ trees, FAST search tree accelerators, Swiss Tables, and dynamic hidden classes.


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.2
Change log CHANGELOG.md
Dependencies base (>=4.19 && <5), containers (>=0.6 && <0.9), primitive (>=0.9 && <0.10), text (>=2.0 && <2.2) [details]
Tested with ghc ==9.14.1
License (EUPL-1.2 OR Apache-2.0)
Author Nadia Yvette Chambers
Maintainer nadia.yvette.chambers@ik.me
Uploaded by nyc at 2026-11-19T20:04:13Z
Category Data, Data Structures
Home page https://github.com/NadiaYvette/pykinos
Bug tracker https://github.com/NadiaYvette/pykinos/issues
Source repo head: git clone https://github.com/NadiaYvette/pykinos(packages/pykinos-core)
Distributions
Reverse Dependencies 5 direct, 0 indirect [details]
Downloads 3 total (3 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for pykinos-core-0.1.0.2

[back to package description]

pykinos-core — Unboxed Blocked Memory Substrates

πυκινός (pykinos, Epic Greek; Attic πυκνός pyknos): close, compact, dense, solid, shrewd, terse.
Named after the Homeric πυκινὸς θώρηξ (Iliad 15.529, "a close-fitting corselet") and πυκιναὶ φάλαγγες (Iliad 4.281, "dense close-packed phalanxes"), in opposition to ἀραιός ("sparse, dispersed").

pykinos-core provides high-performance, cache-conscious, unboxed data structures engineered to minimize pointer indirection, eliminate object header overhead, and maximize CPU cache line density in Haskell:

  1. Roaring Bitsets (Pykinos.Bitset.Roaring): Unboxed two-tier compressed bitsets partitioned into 64 KiB chunks (ArrayChunk for sparse clusters \(\le 4096\), BitmapChunk for dense bitmasks).
  2. Adaptive Radix Trees (Pykinos.IntMap.ART): Cache-conscious 4-tier radix tree (Node4, Node16, Node48, Node256) that adapts node sizing to branch density, slashing pointer chasing.
  3. B+ Trees (Pykinos.Tree.BPlus): Multi-way balanced search trees with unboxed key/value leaf nodes for ordered traversal and range slicing.
  4. FAST Accelerators (Pykinos.Tree.FAST): Fast Architecture Sensitive Tree accelerators with sequential layouts tailored for SIMD and hardware prefetchers.
  5. Swiss Tables (Pykinos.Mutable.SwissTable): High-speed open-addressing hash table with 1-byte control words and SSE/AVX metadata scanning.
  6. Hidden Classes (Pykinos.Schema.HiddenClass): Self-optimizing schema transitions and interning for dynamic and extensible record representations.

License

EUPL-1.2.