| -1507958926 | | Validate JSON data using JSON Schema. | succeeds | 0 |
| -1504841324 | | A simple data structure for a group of function arguments. Used by the mock package. | succeeds | 0 |
| -1506058129 | | Concise Typed Racket syntax for declaring recursive data in BNF This package needs documentation | succeeds | 3 |
| -1502815880 | | red-black trees. Includes implementations of augmented red-black trees, positional red-black trees, and an ordered set backed by a rb-tree. | succeeds | 0 |
| -1502815888 | | Deterministic Dictionaries | succeeds | 0 |
| -1503081511 | | Deterministic Sets | succeeds | 0 |
| -1502815951 | | A library for reading and writing EBML files. | succeeds | 0 |
| -1502815960 | | Persistent Functional Vectors This package needs documentation | succeeds | 3 |
| -1502816071 | | Finger Trees | succeeds | 0 |
| -1502816083 | | Generic Little (Object, Type, Anything, ...) System - multiple dispatch on types | succeeds | 0 |
| -1502816085 | | Generic graph library. | succeeds | 0 |
| -1502816092 | | A sparse prelude-lite level library of common things targeting Typed Racket. | succeeds | 0 |
| -1502816141 | | Library for working with points in 2d space | succeeds | 0 |
| -1502816149 | | Functional priority queues | succeeds | 0 |
| -1502816150 | | Composable, functional lenses | succeeds | 0 |
| -1502816150 | | Base lens constructors and additional combinators This package needs documentation | succeeds | 3 |
| -1502816151 | | Lens constructors for various Racket data structures This package needs documentation | succeeds | 3 |
| -1502816151 | | Documentation for the lens libraries | succeeds | 0 |
| -1502816151 | | Implementation (no docs) of the lens library, includes lens-data and lens-common This package needs documentation | succeeds | 3 |
| -1502816152 | | Unstable and experimental features for lenses This package needs documentation | succeeds | 3 |
| -1502816181 | | Mischief: A Racketeer's Toolkit | succeeds; has failing tests | 4 |
| -1502816181 | | Mischief: A Racketeer's Toolkit [development branch] | succeeds; has failing tests | 4 |
| -1502816189 | | An R Dataframe structure in Typed Racket. This package needs documentation | succeeds | 3 |
| -1503067163 | | A semi-persistent array | succeeds | 0 |
| -1502816246 | | A persistent implementation of the union-find data structure This package needs documentation | succeeds | 3 |
| -1502816247 | | Purely functional data structures for Typed Racket | succeeds; has failing tests | 4 |
| -1502816247 | | 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 | 0 |
| -1502816339 | | Fast, immutable, persistent vectors | succeeds | 0 |
| -1502816341 | | A fairly simple quad-tree implementation. Nothing terribly fancy. Currently rather unstable. This package needs documentation | succeeds | 3 |
| -1502816380 | | Purely Functional Random Access Lists | succeeds | 0 |
| -1502816401 | | protocol for restore program state This package needs documentation | succeeds; has failing tests | 4 |
| -1502816403 | | An imperative overwriting ring buffer data structure | succeeds | 0 |
| -1503261501 | | Use `racket/set` instead | succeeds | 0 |
| -1502816445 | | Semi-persistent matrices based on spvectors | succeeds | 0 |
| -1502816445 | | Semi-persistent vectors that provide O(1) performance for linear use, but O(n) performance for non-linear accesses | succeeds | 0 |