| -1496282910 | | A simple data structure for a group of function arguments. Used by the mock package. | succeeds |
| -1492928439 | | Concise Typed Racket syntax for declaring recursive data in BNF | succeeds |
| -1431897430 | | red-black trees. Includes implementations of augmented red-black trees, positional red-black trees, and an ordered set backed by a rb-tree. | succeeds |
| -1485618110 | | Deterministic Dictionaries | succeeds |
| -1485387824 | | Deterministic Sets | succeeds; has dependency problems |
| -1431976654 | | A library for reading and writing EBML files. | succeeds |
| -1410189695 | | Persistent Functional Vectors | succeeds |
| -1456160890 | | Finger Trees | succeeds |
| -1451127173 | | Generic Little (Object, Type, Anything, ...) System - multiple dispatch on types | succeeds |
| -1491331419 | | Generic graph library. | succeeds |
| -1431836282 | | A low-level 'core' Typed Racket Library. | succeeds |
| -1450581352 | | Functional priority queues | succeeds |
| -1451861173 | | Mischief: A Racketeer's Toolkit | succeeds; has failing tests |
| -1451861174 | | Mischief: A Racketeer's Toolkit [development branch] | succeeds; has failing tests |
| -1428515316 | | An R Dataframe structure in Typed Racket. | succeeds |
| -1405263487 | | A semi-persistent array | succeeds |
| -1415547910 | | A persistent implementation of the union-find data structure | succeeds |
| -1459534793 | | Purely functional data structures for Typed Racket | succeeds; has failing tests |
| -1496326124 | | Algebraic Data Types for Typed/Racket, with features tailored to compiler writing. The data types do not have to be declared before they are used, like prefab structs and symbols. Behind the scenes, this library remembers all the data types in a file, and uses it to implicitly pre-declare them. Mostly stable, although some things may change a bit in the future. | succeeds |
| -1453671155 | | Fast, immutable, persistent vectors | succeeds |
| -1460110672 | | A fairly simple quad-tree implementation. Nothing terribly fancy. Currently rather unstable. | succeeds |
| -1458079799 | | Purely Functional Random Access Lists | succeeds |
| -1450562172 | | An imperative overwriting ring buffer data structure | succeeds |
| -1410272082 | | Use `racket/set` instead | succeeds; has dependency problems |
| -1450562187 | | Semi-persistent matrices based on spvectors | succeeds |
| -1450562187 | | Semi-persistent vectors that provide O(1) performance for linear use, but O(n) performance for non-linear accesses | succeeds |