Uses of Interface
org.javimmutable.collections.common.CollisionMap.Node

Packages that use CollisionMap.Node

Package	Description
org.javimmutable.collections.common
org.javimmutable.collections.hash.map
org.javimmutable.collections.list
org.javimmutable.collections.tree

Uses of CollisionMap.Node in org.javimmutable.collections.common

Methods in org.javimmutable.collections.common that return CollisionMap.Node

Modifier and Type	Method	Description
CollisionMap.Node	CollisionMap.delete(CollisionMap.Node node, K key)
CollisionMap.Node	CollisionMap.dual(K key1, V value1, K key2, V value2)
CollisionMap.Node	CollisionMap.empty()
CollisionMap.Node	CollisionMap.single(K key, V value)
CollisionMap.Node	CollisionMap.update(CollisionMap.Node node, K key, Func1<Maybe<V>,V> generator)
CollisionMap.Node	CollisionMap.update(CollisionMap.Node node, K key, V value)

Methods in org.javimmutable.collections.common with parameters of type CollisionMap.Node

Modifier and Type	Method	Description
CollisionMap.Node	CollisionMap.delete(CollisionMap.Node node, K key)
Maybe<IMapEntry<K,V>>	CollisionMap.findEntry(CollisionMap.Node node, K key)
Maybe<V>	CollisionMap.findValue(CollisionMap.Node node, K key)
IMapEntry<K,V>	CollisionMap.first(CollisionMap.Node node)
void	CollisionMap.forEach(CollisionMap.Node node, Proc2<K,V> proc)
<E extends Exception> void	CollisionMap.forEachThrows(CollisionMap.Node node, Proc2Throws<K,V,E> proc)
default GenericIterator.Iterable<IMapEntry<K,V>>	CollisionMap.genericIterable(CollisionMap.Node node)
V	CollisionMap.getValueOr(CollisionMap.Node node, K key, V defaultValue)
default SplitableIterable<IMapEntry<K,V>>	CollisionMap.iterable(CollisionMap.Node node)
GenericIterator.State<IMapEntry<K,V>>	CollisionMap.iterateOverRange(CollisionMap.Node node, GenericIterator.State<IMapEntry<K,V>> parent, int offset, int limit)
default SplitableIterator<IMapEntry<K,V>>	CollisionMap.iterator(CollisionMap.Node node)
<R> R	CollisionMap.reduce(CollisionMap.Node node, R sum, Sum2<K,V,R> proc)
<R, E extends Exception> R	CollisionMap.reduceThrows(CollisionMap.Node node, R sum, Sum2Throws<K,V,R,E> proc)
int	CollisionMap.size(CollisionMap.Node node)
CollisionMap.Node	CollisionMap.update(CollisionMap.Node node, K key, Func1<Maybe<V>,V> generator)
CollisionMap.Node	CollisionMap.update(CollisionMap.Node node, K key, V value)

Uses of CollisionMap.Node in org.javimmutable.collections.hash.map

Constructors in org.javimmutable.collections.hash.map with parameters of type CollisionMap.Node

Modifier	Constructor	Description
	ArrayMultiValueMapNode(CollisionMap.Node node)

Uses of CollisionMap.Node in org.javimmutable.collections.list

Methods in org.javimmutable.collections.list that return CollisionMap.Node

Modifier and Type	Method	Description
CollisionMap.Node	ListCollisionMap.delete(CollisionMap.Node node, K key)
CollisionMap.Node	ListCollisionMap.dual(K key1, V value1, K key2, V value2)
CollisionMap.Node	ListCollisionMap.empty()
CollisionMap.Node	ListCollisionMap.single(K key, V value)
CollisionMap.Node	ListCollisionMap.update(CollisionMap.Node node, K key, Func1<Maybe<V>,V> generator)
CollisionMap.Node	ListCollisionMap.update(CollisionMap.Node node, K key, V value)

Methods in org.javimmutable.collections.list with parameters of type CollisionMap.Node

Modifier and Type	Method	Description
CollisionMap.Node	ListCollisionMap.delete(CollisionMap.Node node, K key)
Maybe<IMapEntry<K,V>>	ListCollisionMap.findEntry(CollisionMap.Node node, K key)
Maybe<V>	ListCollisionMap.findValue(CollisionMap.Node node, K key)
IMapEntry<K,V>	ListCollisionMap.first(CollisionMap.Node node)
void	ListCollisionMap.forEach(CollisionMap.Node node, Proc2<K,V> proc)
<E extends Exception> void	ListCollisionMap.forEachThrows(CollisionMap.Node node, Proc2Throws<K,V,E> proc)
V	ListCollisionMap.getValueOr(CollisionMap.Node node, K key, V defaultValue)
GenericIterator.State<IMapEntry<K,V>>	ListCollisionMap.iterateOverRange(CollisionMap.Node node, GenericIterator.State<IMapEntry<K,V>> parent, int offset, int limit)
<R> R	ListCollisionMap.reduce(CollisionMap.Node node, R sum, Sum2<K,V,R> proc)
<R, E extends Exception> R	ListCollisionMap.reduceThrows(CollisionMap.Node node, R sum, Sum2Throws<K,V,R,E> proc)
int	ListCollisionMap.size(CollisionMap.Node node)
CollisionMap.Node	ListCollisionMap.update(CollisionMap.Node node, K key, Func1<Maybe<V>,V> generator)
CollisionMap.Node	ListCollisionMap.update(CollisionMap.Node node, K key, V value)

Uses of CollisionMap.Node in org.javimmutable.collections.tree

Classes in org.javimmutable.collections.tree that implement CollisionMap.Node

Modifier and Type	Class	Description
class	LeafNode<K,V>	¬ * A Node containing one value and no children.

Methods in org.javimmutable.collections.tree that return CollisionMap.Node

Modifier and Type	Method	Description
CollisionMap.Node	TreeCollisionMap.delete(CollisionMap.Node node, K key)
CollisionMap.Node	TreeCollisionMap.dual(K key1, V value1, K key2, V value2)
CollisionMap.Node	TreeCollisionMap.empty()
CollisionMap.Node	TreeCollisionMap.single(K key, V value)
CollisionMap.Node	TreeCollisionMap.update(CollisionMap.Node node, K key, Func1<Maybe<V>,V> generator)
CollisionMap.Node	TreeCollisionMap.update(CollisionMap.Node node, K key, V value)

Methods in org.javimmutable.collections.tree with parameters of type CollisionMap.Node

Modifier and Type	Method	Description
CollisionMap.Node	TreeCollisionMap.delete(CollisionMap.Node node, K key)
Maybe<IMapEntry<K,V>>	TreeCollisionMap.findEntry(CollisionMap.Node node, K key)
Maybe<V>	TreeCollisionMap.findValue(CollisionMap.Node node, K key)
IMapEntry<K,V>	TreeCollisionMap.first(CollisionMap.Node node)
void	TreeCollisionMap.forEach(CollisionMap.Node node, Proc2<K,V> proc)
<E extends Exception> void	TreeCollisionMap.forEachThrows(CollisionMap.Node node, Proc2Throws<K,V,E> proc)
V	TreeCollisionMap.getValueOr(CollisionMap.Node node, K key, V defaultValue)
GenericIterator.State<IMapEntry<K,V>>	TreeCollisionMap.iterateOverRange(CollisionMap.Node node, GenericIterator.State<IMapEntry<K,V>> parent, int offset, int limit)
<R> R	TreeCollisionMap.reduce(CollisionMap.Node node, R sum, Sum2<K,V,R> proc)
<R, E extends Exception> R	TreeCollisionMap.reduceThrows(CollisionMap.Node node, R sum, Sum2Throws<K,V,R,E> proc)
int	TreeCollisionMap.size(CollisionMap.Node node)
CollisionMap.Node	TreeCollisionMap.update(CollisionMap.Node node, K key, Func1<Maybe<V>,V> generator)
CollisionMap.Node	TreeCollisionMap.update(CollisionMap.Node node, K key, V value)