Children from resource:core
Children from resource:basis
Children from resource:extra
| Vocabulary | Summary |
 arrays | Fixed-size arrays |
| assocs | Associative structure protocol |
| byte-arrays | Efficient fixed-length byte arrays |
| byte-vectors | Growable byte arrays |
| graphs | Directed graphs |
| growable | Low-level implementation of vectors and string buffers |
| hashtables | Associative structure with expected constant time lookup |
| make | Sequence construction utility |
| namespaces | Dynamically-scoped variables |
| quotations | Code quotations, essentially executable fixed-size arrays |
| sbufs | Growable string buffers |
| sequences | Sequence protocol, combinators and utilities |
| sets | Set-theoretic operations on sequences |
| sorting | Merge sort for sequences |
| splitting | Splitting sequences and grouping sequence elements |
| strings | Fixed-size character arrays |
| vectors | Growable arrays |
Children from resource:basis
| Vocabulary | Summary |
| biassocs | Bidirectional assocs |
| bit-arrays | Fixed-size bit arrays |
| bit-vectors | Growable bit arrays |
| cache | An associative mapping whose entries expire after a while |
| circular | Virtual sequence presenting a rotation of an underlying sequence |
| columns | Virtual sequence view of a matrix column |
| deques | Double-ended queue protocol and common operations |
| disjoint-sets | An efficient implementation of the disjoint-set data structure |
| dlists | Double-linked lists/deques |
| grouping | Grouping sequence elements into subsequences |
| hash2 | Special-purpose fixed-size hashtable where keys are pairs of integers |
| heaps | Maxheap and minheap implementations of priority queues |
| interval-maps | Interval maps for disjoint closed ranges |
| lists | Implementation of lisp-style linked lists |
| lists.lazy | Lazy lists |
| mirrors | View any object as an association mapping slots to values |
| nmake | Generalization of make for constructing several sequences simultaneously |
| persistent.assocs | Persistent associative mapping protocol |
| persistent.deques | Persistent amortized O(1) deques |
| persistent.hashtables | Persistent hashtables with O(1) insertion, removal and lookup |
| persistent.heaps | Datastructure for functional peristent heaps, from ML for the Working Programmer |
| persistent.sequences | Persistent sequence protocol |
| persistent.vectors | Immutable vectors with O(log_32 n) random access, push, and pop |
| search-deques | Double-ended queues with sub-linear membership testing |
| sequences.cords | Virtual sequence concatenation |
| sequences.deep | Sequence/tree combinators like deep-map, deep-each, etc |
| sequences.merged | A virtual sequence which merges (interleaves) other sequences. |
| sorting.human | Correct sorting of sequences of strings with embedded numbers |
| sorting.insertion | Insertion sort |
| specialized-arrays | Arrays of unboxed primitive C types |
| specialized-vectors | Vectors of unboxed primitive C types |
| suffix-arrays | Suffix arrays |
| tuple-arrays | Efficient arrays of tuples with value semantics for elements |
| xml.data | Contains XML data types and basic tools for manipulation |
Children from resource:extra
| Vocabulary | Summary |
| digraphs | Simple directed graph implementation for topological sorting |
| quadtrees | Quadtree spatial indices |
| sequences.modified | sequences.modified vocabulary |
| sequences.repeating | sequences.repeating vocabulary |
| trees | Binary search trees |
| trees.avl | Balanced AVL trees |
| trees.splay | Splay trees |