public class PersistentTreeMap extends APersistentMap implements Reversible, Sorted
Modifier and Type | Class and Description |
---|---|
static class |
PersistentTreeMap.NodeIterator |
static class |
PersistentTreeMap.Seq |
APersistentMap.KeySeq, APersistentMap.ValSeq
Modifier and Type | Field and Description |
---|---|
int |
_count |
java.util.Comparator |
comp |
static PersistentTreeMap |
EMPTY |
clojure.lang.PersistentTreeMap.Node |
tree |
Constructor and Description |
---|
PersistentTreeMap() |
PersistentTreeMap(IPersistentMap meta,
java.util.Comparator comp) |
Modifier and Type | Method and Description |
---|---|
PersistentTreeMap |
assoc(java.lang.Object key,
java.lang.Object val) |
PersistentTreeMap |
assocEx(java.lang.Object key,
java.lang.Object val) |
int |
capacity() |
java.util.Comparator |
comparator() |
boolean |
containsKey(java.lang.Object key) |
int |
count() |
static PersistentTreeMap |
create(java.util.Comparator comp,
ISeq items) |
static PersistentTreeMap |
create(ISeq items) |
static IPersistentMap |
create(java.util.Map other) |
int |
depth() |
int |
doCompare(java.lang.Object k1,
java.lang.Object k2) |
IPersistentCollection |
empty() |
clojure.lang.PersistentTreeMap.Node |
entryAt(java.lang.Object key) |
java.lang.Object |
entryKey(java.lang.Object entry) |
PersistentTreeMap.NodeIterator |
iterator() |
java.util.Iterator |
keys() |
java.util.Iterator |
keys(PersistentTreeMap.NodeIterator it) |
clojure.lang.PersistentTreeMap.Node |
max() |
java.lang.Object |
maxKey() |
clojure.lang.PersistentTreeMap.Node |
min() |
java.lang.Object |
minKey() |
PersistentTreeMap.NodeIterator |
reverseIterator() |
ISeq |
rseq() |
ISeq |
seq() |
ISeq |
seq(boolean ascending) |
ISeq |
seqFrom(java.lang.Object key,
boolean ascending) |
java.lang.Object |
valAt(java.lang.Object key) |
java.lang.Object |
valAt(java.lang.Object key,
java.lang.Object notFound) |
java.util.Iterator |
vals() |
java.util.Iterator |
vals(PersistentTreeMap.NodeIterator it) |
PersistentTreeMap |
withMeta(IPersistentMap meta) |
PersistentTreeMap |
without(java.lang.Object key) |
clear, cons, containsValue, entrySet, equals, equiv, get, hashCode, invoke, invoke, isEmpty, keySet, put, putAll, remove, size, toString, values
applyTo, applyToHelper, call, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, invoke, run, throwArity
public final java.util.Comparator comp
public final clojure.lang.PersistentTreeMap.Node tree
public final int _count
public static final PersistentTreeMap EMPTY
public PersistentTreeMap()
public PersistentTreeMap(IPersistentMap meta, java.util.Comparator comp)
public static IPersistentMap create(java.util.Map other)
public PersistentTreeMap withMeta(IPersistentMap meta)
public static PersistentTreeMap create(ISeq items)
public static PersistentTreeMap create(java.util.Comparator comp, ISeq items)
public boolean containsKey(java.lang.Object key)
containsKey
in interface Associative
containsKey
in interface java.util.Map
public PersistentTreeMap assocEx(java.lang.Object key, java.lang.Object val) throws java.lang.Exception
assocEx
in interface IPersistentMap
java.lang.Exception
public PersistentTreeMap assoc(java.lang.Object key, java.lang.Object val)
assoc
in interface Associative
assoc
in interface IPersistentMap
public PersistentTreeMap without(java.lang.Object key)
without
in interface IPersistentMap
public IPersistentCollection empty()
empty
in interface IPersistentCollection
public ISeq rseq() throws java.lang.Exception
rseq
in interface Reversible
java.lang.Exception
public java.util.Comparator comparator()
comparator
in interface Sorted
public java.lang.Object entryKey(java.lang.Object entry)
public ISeq seqFrom(java.lang.Object key, boolean ascending)
public PersistentTreeMap.NodeIterator iterator()
iterator
in interface java.lang.Iterable
public PersistentTreeMap.NodeIterator reverseIterator()
public java.util.Iterator keys()
public java.util.Iterator vals()
public java.util.Iterator keys(PersistentTreeMap.NodeIterator it)
public java.util.Iterator vals(PersistentTreeMap.NodeIterator it)
public java.lang.Object minKey()
public clojure.lang.PersistentTreeMap.Node min()
public java.lang.Object maxKey()
public clojure.lang.PersistentTreeMap.Node max()
public int depth()
public java.lang.Object valAt(java.lang.Object key, java.lang.Object notFound)
valAt
in interface Associative
public java.lang.Object valAt(java.lang.Object key)
valAt
in interface Associative
public int capacity()
public int count()
count
in interface Counted
count
in interface IPersistentCollection
public clojure.lang.PersistentTreeMap.Node entryAt(java.lang.Object key)
entryAt
in interface Associative
public int doCompare(java.lang.Object k1, java.lang.Object k2)