Package org.jruby.util

Class GenericMap

java.lang.Object

org.jruby.util.GenericMap

All Implemented Interfaces:

Map

Direct Known Subclasses:

WeakIdentityHashMap

public abstract class GenericMap
extends Object
implements Map

A GenericMap is simply an abstract java.util.Map implementation for which subclasses really only need to implement the method entryIterator.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
(package private) class	GenericMap.Entry
(package private) class	GenericMap.KeyIterator
(package private) class	GenericMap.KeyOrValueIterator
(package private) class	GenericMap.ValueIterator

Field Summary

Fields

Modifier and Type	Field	Description
protected int	size

Constructor Summary

Constructors

Constructor	Description
GenericMap()

Method Summary

Modifier and Type	Method	Description
boolean	containsKey(Object key)
boolean	containsValue(Object value)	return the element with the given key
protected abstract Iterator	entryIterator()
Set	entrySet()
boolean	equals(Object other)
int	hashCode()
boolean	isEmpty()
protected boolean	keyEquals(Object containedKey, Object givenKey)
protected int	keyHash(Object key)
protected Iterator	keyIterator()
Set	keySet()
void	putAll(Map other)
int	size()
private static Object[]	toArray(Object[] arr, int size, Iterator it)	I don't quite understand why we need to replace this method from AbstractCollection, but it has been observed that toArray returns the *reverse* order of elements.
protected boolean	valueEquals(Object value1, Object value2)
protected int	valueHash(Object value)
protected Iterator	valueIterator()
Collection	values()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Map

clear, compute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAll

Field Details

size

protected int size

Constructor Details

GenericMap

public GenericMap()

Method Details

size

public int size()

Specified by:

size in interface Map

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map

keyHash

protected int keyHash(Object key)

keyEquals

protected boolean keyEquals(Object containedKey,
 Object givenKey)

valueHash

protected int valueHash(Object value)

valueEquals

protected boolean valueEquals(Object value1,
 Object value2)

putAll

public void putAll(Map other)

Specified by:

putAll in interface Map

entryIterator

protected abstract Iterator entryIterator()

keyIterator

protected Iterator keyIterator()

valueIterator

protected Iterator valueIterator()

toArray

private static Object[] toArray(Object[] arr,
 int size,
 Iterator it)

I don't quite understand why we need to replace this method from AbstractCollection, but it has been observed that toArray returns the *reverse* order of elements. --Kresten

values

public Collection values()

Specified by:

values in interface Map

keySet

public Set keySet()

Specified by:

keySet in interface Map

hashCode

public int hashCode()

Specified by:

hashCode in interface Map

Overrides:

hashCode in class Object

equals

public boolean equals(Object other)

Specified by:

equals in interface Map

Overrides:

equals in class Object

entrySet

public Set entrySet()

Specified by:

entrySet in interface Map

containsValue

public boolean containsValue(Object value)

return the element with the given key

Specified by:

containsValue in interface Map

containsKey

public boolean containsKey(Object key)

Specified by:

containsKey in interface Map