| AFn |
| AFunction |
| AMapEntry |
| APersistentMap |
| APersistentMap.KeySeq |
| APersistentMap.ValSeq |
| APersistentSet |
| APersistentVector |
| APersistentVector.RSeq |
| APersistentVector.SubVector |
| ARef |
| AReference |
| ArraySeq |
| ArraySeq.ArraySeq_boolean |
| ArraySeq.ArraySeq_byte |
| ArraySeq.ArraySeq_char |
| ArraySeq.ArraySeq_double |
| ArraySeq.ArraySeq_float |
| ArraySeq.ArraySeq_int |
| ArraySeq.ArraySeq_long |
| ArraySeq.ArraySeq_short |
| ASeq |
| Associative
Copyright (c) Rich Hickey.
|
| BigInt |
| Binding |
| Compiler.C |
| Compiler.LiteralExpr |
| Compiler.LocalBinding |
| Compiler.LocalBindingExpr |
| Compiler.MaybePrimitiveExpr |
| Compiler.ObjExpr |
| Compiler.ObjMethod |
| Cons |
| Counted
Copyright (c) Rich Hickey.
|
| Cycle |
| EnumerationSeq |
| Fn |
| IAtom |
| IAtom2 |
| IChunk |
| IChunkedSeq |
| IDeref |
| IDrop
Persistent or algorithmically defined collections can implement IDrop to provide
a means of dropping N items that is more efficient than sequential walking.
|
| IEditableCollection |
| IExceptionInfo
Interface for exceptions that carry data (a map) as additional payload.
|
IFn
IFn provides complete access to invoking
any of Clojure's APIs. |
| IHashEq |
| IKVReduce |
| ILookup |
| ILookupSite |
| ILookupThunk |
| IMapEntry |
| IMapIterable
Indicate a map can provide more efficient key and val iterators.
|
| IMeta |
| Indexed |
| IndexedSeq |
| IObj |
| IPending |
| IPersistentCollection
Copyright (c) Rich Hickey.
|
| IPersistentList |
| IPersistentMap |
| IPersistentSet |
| IPersistentStack |
| IPersistentVector
Copyright (c) Rich Hickey.
|
| IReduce |
| IReduceInit |
| IRef |
| IReference |
| ISeq
A persistent, functional, sequence interface
|
| Iterate |
| IteratorSeq |
| ITransientAssociative |
| ITransientAssociative2 |
| ITransientCollection |
| ITransientMap |
| ITransientSet |
| ITransientVector |
| Keyword |
| LineNumberingPushbackReader |
| MapEntry |
| MapEquivalence |
| MethodImplCache |
| MultiFn |
| Named |
| Namespace |
| Numbers.Category |
| Obj |
| PersistentArrayMap
Simple implementation of persistent map on an array
|
| PersistentHashMap |
| PersistentHashSet |
| PersistentList |
| PersistentQueue
conses onto rear, peeks/pops from front
See Okasaki's Batched Queues
This differs in that it uses a PersistentVector as the rear, which is in-order,
so no reversing or suspensions required for persistent use
|
| PersistentStructMap |
| PersistentStructMap.Def |
| PersistentTreeMap
Persistent Red Black Tree
|
| PersistentTreeMap.NodeIterator |
| PersistentTreeSet |
| PersistentVector |
| PersistentVector.Node |
| Ratio |
| ReaderConditional |
| Ref |
| Repeat |
| RestFn |
| Reversible |
| Seqable |
| Sequential
Copyright (c) Rich Hickey.
|
| Settable |
| Sorted |
| StringSeq |
| Symbol |
| TaggedLiteral |
| Util.EquivPred |
| Var |
| WarnBoxedMath |