Vocabularies tagged “collections”
Factor handbook > Vocabulary index > Vocabulary tags

Children from resource:core
arraysFixed-size arrays
assocsAssociative structure protocol
byte-arraysEfficient fixed-length byte arrays
byte-vectorsGrowable byte arrays
graphsDirected graphs
growableLow-level implementation of vectors and string buffers
hashtablesAssociative structure with expected constant time lookup
makeSequence construction utility
namespacesDynamically-scoped variables
quotationsCode quotations, essentially executable fixed-size arrays
sbufsGrowable string buffers
sequencesSequence protocol, combinators and utilities
setsSet-theoretic operations on sequences
sortingMerge sort for sequences
splittingSplitting sequences and grouping sequence elements
stringsFixed-size character arrays
vectorsGrowable arrays

Children from resource:basis
biassocsBidirectional assocs
bit-arraysFixed-size bit arrays
bit-setsEfficient bitwise operations on bit arrays
bit-vectorsGrowable bit arrays
boxesAn abstraction for enforcing a mutual-exclusion invariant
cacheAn associative mapping whose entries expire after a while
circularVirtual sequence presenting a rotation of an underlying sequence
columnsVirtual sequence view of a matrix column
dequesDouble-ended queue protocol and common operations
disjoint-setsAn efficient implementation of the disjoint-set data structure
dlistsDouble-linked lists/deques
groupingGrouping sequence elements into subsequences
hashtables.identityHashtables keyed by object identity (eq?) rather than by logical value (=)
heapsMaxheap and minheap implementations of priority queues
interval-mapsInterval maps for disjoint closed ranges
listsImplementation of lisp-style linked lists
lists.lazyLazy lists
mirrorsView any object as an association mapping slots to values
nibble-arraysSpace-efficient arrays of 4-bit values
nmakeGeneralization of make for constructing several sequences simultaneously
persistent.assocsPersistent associative mapping protocol
persistent.dequesPersistent amortized O(1) deques
persistent.hashtablesPersistent hashtables with O(1) insertion, removal and lookup
persistent.heapsDatastructure for functional peristent heaps, from ML for the Working Programmer
persistent.sequencesPersistent sequence protocol
persistent.vectorsImmutable vectors with O(log_32 n) random access, push, and pop
search-dequesDouble-ended queues with sub-linear membership testing
sequences.cordsVirtual sequence concatenation
sequences.deepSequence/tree combinators like deep-map, deep-each, etc
sequences.mergedA virtual sequence which merges (interleaves) other sequences.
sequences.productCartesian products of sequences
sorting.humanCorrect sorting of sequences of strings with embedded numbers
sorting.insertionInsertion sort
specialized-arraysArrays of unboxed primitive C types
specialized-vectorsVectors of unboxed primitive C types
suffix-arraysSuffix arrays
tuple-arraysEfficient arrays of tuples with value semantics for elements
xml.dataContains XML data types and basic tools for manipulation

Children from resource:extra
assoc-heapsPriority queue with fast insertion, removal of first element, and lookup of arbitrary elements by key
assocs.extrasassocs.extras vocabulary
digraphsSimple directed graph implementation for topological sorting
hashtables.numbershashtables.numbers vocabulary
lru-cacheLeast Recently Used (LRU) cache
quadtreesQuadtree spatial indices
sequences.abbrevsequences.abbrev vocabulary
sequences.modifiedsequences.modified vocabulary
sequences.repeatingsequences.repeating vocabulary
sets.extrassets.extras vocabulary
treesBinary search trees
trees.avlBalanced AVL trees
trees.splaySplay trees