net.sf.saxon.ma.parray

Class IntTreePMap<V>

java.lang.Object

java.util.AbstractMap<java.lang.Integer,V>

net.sf.saxon.ma.parray.IntTreePMap<V>

Type Parameters:

V -

All Implemented Interfaces:

java.util.Map<java.lang.Integer,V>

public final class IntTreePMap<V>
extends java.util.AbstractMap<java.lang.Integer,V>

An efficient persistent map from integer keys to non-null values.

Iteration occurs in the integer order of the keys.

This implementation is thread-safe (assuming Java's AbstractMap and AbstractSet are thread-safe), although its iterators may not be.

The balanced tree is based on the Glasgow Haskell Compiler's Data.Map implementation, which in turn is based on "size balanced binary trees" as described by:

Stephen Adams, "Efficient sets: a balancing act", Journal of Functional Programming 3(4):553-562, October 1993, http://www.swiss.ai.mit.edu/~adams/BB/.

J. Nievergelt and E.M. Reingold, "Binary search trees of bounded balance", SIAM journal of computing 2(1), March 1973.

Author:

harold

Nested Class Summary

Nested classes/interfaces inherited from class java.util.AbstractMap

java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>

Nested classes/interfaces inherited from interface java.util.Map

java.util.Map.Entry<K,V>

Method Summary

Modifier and Type	Method and Description
boolean	containsKey(java.lang.Object key)
static <V> IntTreePMap<V>	empty()
java.util.Set<java.util.Map.Entry<java.lang.Integer,V>>	entrySet()
static <V> IntTreePMap<V>	from(java.util.Map<? extends java.lang.Integer,? extends V> map)
V	get(java.lang.Object key)
IntTreePMap<V>	minus(java.lang.Object key)
IntTreePMap<V>	minusAll(java.util.Collection<?> keys)
IntTreePMap<V>	plus(java.lang.Integer key, V value)
IntTreePMap<V>	plusAll(java.util.Map<? extends java.lang.Integer,? extends V> map)
static <V> IntTreePMap<V>	singleton(java.lang.Integer key, V value)
int	size()

Methods inherited from class java.util.AbstractMap

clear, clone, containsValue, equals, hashCode, isEmpty, keySet, put, putAll, remove, toString, values

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll

Method Detail

empty

public static <V> IntTreePMap<V> empty()

Type Parameters:

V -

Returns:

an empty map

singleton

public static <V> IntTreePMap<V> singleton(java.lang.Integer key,
                                           V value)

Type Parameters:

V -

Parameters:

key -

value -

Returns:

empty().plus(key, value)

from

public static <V> IntTreePMap<V> from(java.util.Map<? extends java.lang.Integer,? extends V> map)

Type Parameters:

V -

Parameters:

map -

Returns:

empty().plusAll(map)

entrySet

public java.util.Set<java.util.Map.Entry<java.lang.Integer,V>> entrySet()

Specified by:

entrySet in interface java.util.Map<java.lang.Integer,V>

Specified by:

entrySet in class java.util.AbstractMap<java.lang.Integer,V>

size

public int size()

Specified by:

size in interface java.util.Map<java.lang.Integer,V>

Overrides:

size in class java.util.AbstractMap<java.lang.Integer,V>

containsKey

public boolean containsKey(java.lang.Object key)

Specified by:

containsKey in interface java.util.Map<java.lang.Integer,V>

Overrides:

containsKey in class java.util.AbstractMap<java.lang.Integer,V>

get

public V get(java.lang.Object key)

Specified by:

get in interface java.util.Map<java.lang.Integer,V>

Overrides:

get in class java.util.AbstractMap<java.lang.Integer,V>

plus

public IntTreePMap<V> plus(java.lang.Integer key,
                           V value)

minus

public IntTreePMap<V> minus(java.lang.Object key)

plusAll

public IntTreePMap<V> plusAll(java.util.Map<? extends java.lang.Integer,? extends V> map)

minusAll

public IntTreePMap<V> minusAll(java.util.Collection<?> keys)