ArrayMap (Infinispan JavaDoc 13.0.10.Final-redhat-00001 API)

java.lang.Object
- java.util.AbstractMap<K,V>
- - org.infinispan.commons.util.ArrayMap<K,V>

All Implemented Interfaces:

Map<K,V>

Direct Known Subclasses:

HopscotchHashMap
```
public abstract class ArrayMap<K,V>
extends AbstractMap<K,V>
```
Base for classes that implement hash map by storing keys in one array and values in another. It assumes that all keys that are in the array are contained in the map and that values are on corresponding indices in the map. Does not support null keys nor values. Forces implementation of methods get(Object), put(Object, Object), remove(Object)

Field Summary

Fields
Modifier and Type Field Description

protected Object[] keys

protected int modCount

protected int size

protected Object[] values

Constructor Summary

Constructors
Constructor Description

ArrayMap()

Method Summary

All Methods Instance Methods Abstract Methods Concrete Methods
Modifier and Type	Method	Description
`void`	`clear()`
`boolean`	`containsKey(Object key)`
`boolean`	`containsValue(Object value)`
`Set<Map.Entry<K,V>>`	`entrySet()`
`abstract V`	`get(Object key)`
`Set<K>`	`keySet()`
`abstract V`	`put(K key, V value)`
`abstract V`	`remove(Object key)`
`int`	`size()`
`Collection<V>`	`values()`

Field Detail

size
```
protected int size
```

keys
```
protected Object[] keys
```

values
```
protected Object[] values
```

modCount
```
protected int modCount
```

Constructor Detail
- ArrayMap
```
public ArrayMap()
```

Method Detail

get
```
public abstract V get(Object key)
```

put

public abstract V put(K key,
                      V value)

remove

public abstract V remove(Object key)

size
```
public int size()
```

containsValue

public boolean containsValue(Object value)

keySet
```
public Set<K> keySet()
```

values
```
public Collection<V> values()
```

entrySet

public Set<Map.Entry<K,V>> entrySet()

containsKey

public boolean containsKey(Object key)

clear
```
public void clear()
```