Class ArrayTable<R,C,V>
- java.lang.Object
-
- com.google.common.collect.ArrayTable<R,C,V>
-
- All Implemented Interfaces:
Table<R,C,V>
,Serializable
@Beta @GwtCompatible(emulated=true) public final class ArrayTable<R,C,V> extends Object implements Serializable
Fixed-sizeTable
implementation backed by a two-dimensional array.The allowed row and column keys must be supplied when the table is created. The table always contains a mapping for every row key / column pair. The value corresponding to a given row and column is null unless another value is provided.
The table's size is constant: the product of the number of supplied row keys and the number of supplied column keys. The
remove
andclear
methods are not supported by the table or its views. Theerase(java.lang.Object, java.lang.Object)
anderaseAll()
methods may be used instead.The ordering of the row and column keys provided when the table is constructed determines the iteration ordering across rows and columns in the table's views. None of the view iterators support
Iterator.remove()
. If the table is modified after an iterator is created, the iterator remains valid.This class requires less memory than the
HashBasedTable
andTreeBasedTable
implementations, except when the table is sparse.Null row keys or column keys are not permitted.
This class provides methods involving the underlying array structure, where the array indices correspond to the position of a row or column in the lists of allowed keys and values. See the
at(int, int)
,set(int, int, V)
,toArray(java.lang.Class<V>)
,rowKeyList()
, andcolumnKeyList()
methods for more details.Note that this implementation is not synchronized. If multiple threads access the same cell of an
ArrayTable
concurrently and one of the threads modifies its value, there is no guarantee that the new value will be fully visible to the other threads. To guarantee that modifications are visible, synchronize access to the table. Unlike otherTable
implementations, synchronization is unnecessary between a thread that writes to one cell and a thread that reads from another.See the Guava User Guide article on
Table
.- Since:
- 10.0
- Author:
- Jared Levy
- See Also:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface com.google.common.collect.Table
Table.Cell<R,C,V>
-
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Deprecated Methods Modifier and Type Method Description V
at(int rowIndex, int columnIndex)
Returns the value corresponding to the specified row and column indices.Set<Table.Cell<R,C,V>>
cellSet()
Returns an unmodifiable set of all row key / column key / value triplets.void
clear()
Deprecated.UseeraseAll()
Map<R,V>
column(C columnKey)
Returns a view of all mappings that have the given column key.ImmutableList<C>
columnKeyList()
Returns, as an immutable list, the column keys provided when the table was constructed, including those that are mapped to null values only.ImmutableSet<C>
columnKeySet()
Returns an immutable set of the valid column keys, including those that are associated with null values only.Map<C,Map<R,V>>
columnMap()
Returns a view that associates each column key with the corresponding map from row keys to values.boolean
contains(Object rowKey, Object columnKey)
Returnstrue
if the provided keys are among the keys provided when the table was constructed.boolean
containsColumn(Object columnKey)
Returnstrue
if the provided column key is among the column keys provided when the table was constructed.boolean
containsRow(Object rowKey)
Returnstrue
if the provided row key is among the row keys provided when the table was constructed.boolean
containsValue(Object value)
Returnstrue
if the table contains a mapping with the specified value.static <R,C,V>
ArrayTable<R,C,V>create(Table<R,C,V> table)
Creates anArrayTable
with the mappings in the provided table.static <R,C,V>
ArrayTable<R,C,V>create(Iterable<? extends R> rowKeys, Iterable<? extends C> columnKeys)
Creates anArrayTable
filled withnull
.boolean
equals(Object obj)
Indicates whether some other object is "equal to" this one.V
erase(Object rowKey, Object columnKey)
Associates the valuenull
with the specified keys, assuming both keys are valid.void
eraseAll()
Associates the valuenull
with every pair of allowed row and column keys.V
get(Object rowKey, Object columnKey)
Returns the value corresponding to the given row and column keys, ornull
if no such mapping exists.int
hashCode()
Returns a hash code value for the object.boolean
isEmpty()
Returnstrue
ifrowKeyList().size == 0
orcolumnKeyList().size() == 0
.V
put(R rowKey, C columnKey, V value)
Associates the specified value with the specified keys.void
putAll(Table<? extends R,? extends C,? extends V> table)
Copies all mappings from the specified table to this table.V
remove(Object rowKey, Object columnKey)
Deprecated.Map<C,V>
row(R rowKey)
Returns a view of all mappings that have the given row key.ImmutableList<R>
rowKeyList()
Returns, as an immutable list, the row keys provided when the table was constructed, including those that are mapped to null values only.ImmutableSet<R>
rowKeySet()
Returns an immutable set of the valid row keys, including those that are associated with null values only.Map<R,Map<C,V>>
rowMap()
Returns a view that associates each row key with the corresponding map from column keys to values.V
set(int rowIndex, int columnIndex, V value)
Associatesvalue
with the specified row and column indices.int
size()
Returns the number of row key / column key / value mappings in the table.V[][]
toArray(Class<V> valueClass)
Returns a two-dimensional array with the table contents.String
toString()
Returns the string representationrowMap().toString()
.Collection<V>
values()
Returns an unmodifiable collection of all values, which may contain duplicates.
-
-
-
Method Detail
-
create
public static <R,C,V> ArrayTable<R,C,V> create(Iterable<? extends R> rowKeys, Iterable<? extends C> columnKeys)
Creates anArrayTable
filled withnull
.- Parameters:
rowKeys
- row keys that may be stored in the generated tablecolumnKeys
- column keys that may be stored in the generated table- Throws:
NullPointerException
- if any of the provided keys is nullIllegalArgumentException
- ifrowKeys
orcolumnKeys
contains duplicates or if exactly one ofrowKeys
orcolumnKeys
is empty.
-
create
public static <R,C,V> ArrayTable<R,C,V> create(Table<R,C,V> table)
Creates anArrayTable
with the mappings in the provided table.If
table
includes a mapping with row keyr
and a separate mapping with column keyc
, the returned table contains a mapping with row keyr
and column keyc
. If that row key / column key pair in not intable
, the pair maps tonull
in the generated table.The returned table allows subsequent
put
calls with the row keys intable.rowKeySet()
and the column keys intable.columnKeySet()
. Callingput(R, C, V)
with other keys leads to anIllegalArgumentException
.The ordering of
table.rowKeySet()
andtable.columnKeySet()
determines the row and column iteration ordering of the returned table.- Throws:
NullPointerException
- iftable
has a null key
-
rowKeyList
public ImmutableList<R> rowKeyList()
Returns, as an immutable list, the row keys provided when the table was constructed, including those that are mapped to null values only.
-
columnKeyList
public ImmutableList<C> columnKeyList()
Returns, as an immutable list, the column keys provided when the table was constructed, including those that are mapped to null values only.
-
at
public V at(int rowIndex, int columnIndex)
Returns the value corresponding to the specified row and column indices. The same value is returned byget(rowKeyList().get(rowIndex), columnKeyList().get(columnIndex))
, but this method runs more quickly.- Parameters:
rowIndex
- position of the row key inrowKeyList()
columnIndex
- position of the row key incolumnKeyList()
- Returns:
- the value with the specified row and column
- Throws:
IndexOutOfBoundsException
- if either index is negative,rowIndex
is greater than or equal to the number of allowed row keys, orcolumnIndex
is greater than or equal to the number of allowed column keys
-
set
@CanIgnoreReturnValue public V set(int rowIndex, int columnIndex, @NullableDecl V value)
Associatesvalue
with the specified row and column indices. The logicput(rowKeyList().get(rowIndex), columnKeyList().get(columnIndex), value)
has the same behavior, but this method runs more quickly.- Parameters:
rowIndex
- position of the row key inrowKeyList()
columnIndex
- position of the row key incolumnKeyList()
value
- value to store in the table- Returns:
- the previous value with the specified row and column
- Throws:
IndexOutOfBoundsException
- if either index is negative,rowIndex
is greater than or equal to the number of allowed row keys, orcolumnIndex
is greater than or equal to the number of allowed column keys
-
toArray
@GwtIncompatible public V[][] toArray(Class<V> valueClass)
Returns a two-dimensional array with the table contents. The row and column indices correspond to the positions of the row and column in the iterables provided during table construction. If the table lacks a mapping for a given row and column, the corresponding array element is null.Subsequent table changes will not modify the array, and vice versa.
- Parameters:
valueClass
- class of values stored in the returned array
-
clear
@Deprecated public void clear()
Deprecated.UseeraseAll()
Not supported. UseeraseAll()
instead.
-
eraseAll
public void eraseAll()
Associates the valuenull
with every pair of allowed row and column keys.
-
contains
public boolean contains(@NullableDecl Object rowKey, @NullableDecl Object columnKey)
Returnstrue
if the provided keys are among the keys provided when the table was constructed.
-
containsColumn
public boolean containsColumn(@NullableDecl Object columnKey)
Returnstrue
if the provided column key is among the column keys provided when the table was constructed.- Specified by:
containsColumn
in interfaceTable<R,C,V>
- Parameters:
columnKey
- key of column to search for
-
containsRow
public boolean containsRow(@NullableDecl Object rowKey)
Returnstrue
if the provided row key is among the row keys provided when the table was constructed.- Specified by:
containsRow
in interfaceTable<R,C,V>
- Parameters:
rowKey
- key of row to search for
-
containsValue
public boolean containsValue(@NullableDecl Object value)
Description copied from interface:Table
Returnstrue
if the table contains a mapping with the specified value.- Specified by:
containsValue
in interfaceTable<R,C,V>
- Parameters:
value
- value to search for
-
get
public V get(@NullableDecl Object rowKey, @NullableDecl Object columnKey)
Description copied from interface:Table
Returns the value corresponding to the given row and column keys, ornull
if no such mapping exists.
-
isEmpty
public boolean isEmpty()
Returnstrue
ifrowKeyList().size == 0
orcolumnKeyList().size() == 0
.
-
put
@CanIgnoreReturnValue public V put(R rowKey, C columnKey, @NullableDecl V value)
Associates the specified value with the specified keys. If the table already contained a mapping for those keys, the old value is replaced with the specified value.- Specified by:
put
in interfaceTable<R,C,V>
- Parameters:
rowKey
- row key that the value should be associated withcolumnKey
- column key that the value should be associated withvalue
- value to be associated with the specified keys- Returns:
- the value previously associated with the keys, or
null
if no mapping existed for the keys - Throws:
IllegalArgumentException
- ifrowKey
is not inrowKeySet()
orcolumnKey
is not incolumnKeySet()
.
-
putAll
public void putAll(Table<? extends R,? extends C,? extends V> table)
Copies all mappings from the specified table to this table. The effect is equivalent to callingTable.put(R, C, V)
with each row key / column key / value mapping intable
.If
table
is anArrayTable
, its null values will be stored in this table, possibly replacing values that were previously non-null.- Specified by:
putAll
in interfaceTable<R,C,V>
- Parameters:
table
- the table to add to this table- Throws:
NullPointerException
- iftable
has a null keyIllegalArgumentException
- if any of the provided table's row keys or column keys is not inrowKeySet()
orcolumnKeySet()
-
remove
@CanIgnoreReturnValue @Deprecated public V remove(Object rowKey, Object columnKey)
Deprecated.Not supported. Useerase(java.lang.Object, java.lang.Object)
instead.
-
erase
@CanIgnoreReturnValue public V erase(@NullableDecl Object rowKey, @NullableDecl Object columnKey)
Associates the valuenull
with the specified keys, assuming both keys are valid. If either key is null or isn't among the keys provided during construction, this method has no effect.This method is equivalent to
put(rowKey, columnKey, null)
when both provided keys are valid.- Parameters:
rowKey
- row key of mapping to be erasedcolumnKey
- column key of mapping to be erased- Returns:
- the value previously associated with the keys, or
null
if no mapping existed for the keys
-
size
public int size()
Description copied from interface:Table
Returns the number of row key / column key / value mappings in the table.
-
cellSet
public Set<Table.Cell<R,C,V>> cellSet()
Returns an unmodifiable set of all row key / column key / value triplets. Changes to the table will update the returned set.The returned set's iterator traverses the mappings with the first row key, the mappings with the second row key, and so on.
The value in the returned cells may change if the table subsequently changes.
-
column
public Map<R,V> column(C columnKey)
Returns a view of all mappings that have the given column key. If the column key isn't incolumnKeySet()
, an empty immutable map is returned.Otherwise, for each row key in
rowKeySet()
, the returned map associates the row key with the corresponding value in the table. Changes to the returned map will update the underlying table, and vice versa.
-
columnKeySet
public ImmutableSet<C> columnKeySet()
Returns an immutable set of the valid column keys, including those that are associated with null values only.- Specified by:
columnKeySet
in interfaceTable<R,C,V>
- Returns:
- immutable set of column keys
-
columnMap
public Map<C,Map<R,V>> columnMap()
Description copied from interface:Table
Returns a view that associates each column key with the corresponding map from row keys to values. Changes to the returned map will update this table. The returned map does not supportput()
orputAll()
, orsetValue()
on its entries.In contrast, the maps returned by
columnMap().get()
have the same behavior as those returned byTable.column(C)
. Those maps may supportsetValue()
,put()
, andputAll()
.
-
row
public Map<C,V> row(R rowKey)
Returns a view of all mappings that have the given row key. If the row key isn't inrowKeySet()
, an empty immutable map is returned.Otherwise, for each column key in
columnKeySet()
, the returned map associates the column key with the corresponding value in the table. Changes to the returned map will update the underlying table, and vice versa.
-
rowKeySet
public ImmutableSet<R> rowKeySet()
Returns an immutable set of the valid row keys, including those that are associated with null values only.
-
rowMap
public Map<R,Map<C,V>> rowMap()
Description copied from interface:Table
Returns a view that associates each row key with the corresponding map from column keys to values. Changes to the returned map will update this table. The returned map does not supportput()
orputAll()
, orsetValue()
on its entries.In contrast, the maps returned by
rowMap().get()
have the same behavior as those returned byTable.row(R)
. Those maps may supportsetValue()
,put()
, andputAll()
.
-
values
public Collection<V> values()
Returns an unmodifiable collection of all values, which may contain duplicates. Changes to the table will update the returned collection.The returned collection's iterator traverses the values of the first row key, the values of the second row key, and so on.
-
equals
public boolean equals(@NullableDecl Object obj)
Description copied from class:java.lang.Object
Indicates whether some other object is "equal to" this one.The
equals
method implements an equivalence relation on non-null object references:- It is reflexive: for any non-null reference value
x
,x.equals(x)
should returntrue
. - It is symmetric: for any non-null reference values
x
andy
,x.equals(y)
should returntrue
if and only ify.equals(x)
returnstrue
. - It is transitive: for any non-null reference values
x
,y
, andz
, ifx.equals(y)
returnstrue
andy.equals(z)
returnstrue
, thenx.equals(z)
should returntrue
. - It is consistent: for any non-null reference values
x
andy
, multiple invocations ofx.equals(y)
consistently returntrue
or consistently returnfalse
, provided no information used inequals
comparisons on the objects is modified. - For any non-null reference value
x
,x.equals(null)
should returnfalse
.
The
equals
method for classObject
implements the most discriminating possible equivalence relation on objects; that is, for any non-null reference valuesx
andy
, this method returnstrue
if and only ifx
andy
refer to the same object (x == y
has the valuetrue
).Note that it is generally necessary to override the
hashCode
method whenever this method is overridden, so as to maintain the general contract for thehashCode
method, which states that equal objects must have equal hash codes. - It is reflexive: for any non-null reference value
-
hashCode
public int hashCode()
Description copied from class:java.lang.Object
Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided byHashMap
.The general contract of
hashCode
is:- Whenever it is invoked on the same object more than once during
an execution of a Java application, the
hashCode
method must consistently return the same integer, provided no information used inequals
comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. - If two objects are equal according to the
equals(Object)
method, then calling thehashCode
method on each of the two objects must produce the same integer result. - It is not required that if two objects are unequal
according to the
Object.equals(java.lang.Object)
method, then calling thehashCode
method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by class
Object
does return distinct integers for distinct objects. (The hashCode may or may not be implemented as some function of an object's memory address at some point in time.)- Specified by:
hashCode
in interfaceTable<R,C,V>
- Overrides:
hashCode
in classObject
- Returns:
- a hash code value for this object.
- See Also:
Object.equals(java.lang.Object)
,System.identityHashCode(java.lang.Object)
- Whenever it is invoked on the same object more than once during
an execution of a Java application, the
-
-