Immutables
Fast and Functional Data Structures
Provides fast, side-effect free data structures, including catenable named lists, priority queues, double-ended queues, ordered sequences, and interval indices. Implementation is based on the finger-tree data structure of Hinze and Paterson (2006) <doi:10.1017/S0956796805005769>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.1 |
rolling linux/jammy R-4.5 | Immutables_1.0.1.tar.gz |
1.4 MiB |
1.0.1 |
rolling linux/noble R-4.5 | Immutables_1.0.1.tar.gz |
1.4 MiB |
1.0.1 |
rolling source/ R- | Immutables_1.0.1.tar.gz |
764.2 KiB |
1.0.1 |
latest linux/jammy R-4.5 | Immutables_1.0.1.tar.gz |
1.4 MiB |
1.0.1 |
latest linux/noble R-4.5 | Immutables_1.0.1.tar.gz |
1.4 MiB |
1.0.1 |
latest source/ R- | Immutables_1.0.1.tar.gz |
764.2 KiB |
1.0.1 |
2026-04-23 source/ R- | Immutables_1.0.1.tar.gz |
0 B |