Uses of Interface
clojure.lang.IHashEq

Packages that use IHashEq

Package	Description
clojure.lang

Uses of IHashEq in clojure.lang

Classes in clojure.lang that implement IHashEq

Modifier and Type	Class and Description
class	AMapEntry
class	APersistentMap
static class	APersistentMap.KeySeq
static class	APersistentMap.ValSeq
class	APersistentSet
class	APersistentVector
static class	APersistentVector.RSeq
class	ArraySeq
static class	ArraySeq.ArraySeq_boolean
static class	ArraySeq.ArraySeq_byte
static class	ArraySeq.ArraySeq_char
static class	ArraySeq.ArraySeq_double
static class	ArraySeq.ArraySeq_float
static class	ArraySeq.ArraySeq_int
static class	ArraySeq.ArraySeq_long
class	ASeq
class	ChunkedCons
class	Cons
class	EnumerationSeq
class	IteratorSeq
class	Keyword
class	LazySeq
class	MapEntry
class	PersistentArrayMap Simple implementation of persistent map on an array Note that instances of this class are constant values i.e. add/remove etc return new values Copies array on every change, so only appropriate for _very_small_ maps null keys and values are ok, but you won't be able to distinguish a null value via valAt - use contains/entryAt
class	PersistentHashMap
class	PersistentHashSet
class	PersistentList
class	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
class	PersistentStructMap
class	PersistentTreeMap Persistent Red Black Tree Note that instances of this class are constant values i.e. add/remove etc return new values See Okasaki, Kahrs, Larsen et al
static class	PersistentTreeMap.Seq
class	PersistentTreeSet
class	PersistentVector
static class	PersistentVector.ChunkedSeq
class	Range
class	StringSeq
class	Symbol