Class TreeBasedTable<R,C,V>
- java.lang.Object
- 
- com.google.common.collect.TreeBasedTable<R,C,V>
 
- 
- All Implemented Interfaces:
- RowSortedTable<R,C,V>,- Table<R,C,V>,- java.io.Serializable
 
 @GwtCompatible(serializable=true) public class TreeBasedTable<R,C,V> extends java.lang.Object Implementation ofTablewhose row keys and column keys are ordered by their natural ordering or by supplied comparators. When constructing aTreeBasedTable, you may provide comparators for the row keys and the column keys, or you may use natural ordering for both.The rowKeySet()method returns aSortedSetand therowMap()method returns aSortedMap, instead of theSetandMapspecified by theTableinterface.The views returned by Table.column(C),columnKeySet(), andTable.columnMap()have iterators that don't supportremove(). Otherwise, all optional operations are supported. Null row keys, columns keys, and values are not supported.Lookups by row key are often faster than lookups by column key, because the data is stored in a Map<R, Map<C, V>>. A method call likecolumn(columnKey).get(rowKey)still runs quickly, since the row key is provided. However,column(columnKey).size()takes longer, since an iteration across all row keys occurs.Because a TreeBasedTablehas unique sorted values for a given row, bothrow(rowKey)androwMap().get(rowKey)areSortedMapinstances, instead of theMapspecified in theTableinterface.Note that this implementation is not synchronized. If multiple threads access this table concurrently and one of the threads modifies the table, it must be synchronized externally. See the Guava User Guide article on Table.- Since:
- 7.0
- Author:
- Jared Levy, Louis Wasserman
- See Also:
- Serialized Form
 
- 
- 
Method SummaryAll Methods Static Methods Instance Methods Concrete Methods Deprecated Methods Modifier and Type Method Description java.util.Set<Table.Cell<R,C,V>>cellSet()Returns a set of all row key / column key / value triplets.voidclear()Removes all mappings from the table.java.util.Map<R,V>column(C columnKey)Returns a view of all mappings that have the given column key.java.util.Comparator<? super C>columnComparator()Deprecated.Store theComparatoralongside theTable.java.util.Set<C>columnKeySet()Returns a set of column keys that have one or more values in the table.java.util.Map<C,java.util.Map<R,V>>columnMap()Returns a view that associates each column key with the corresponding map from row keys to values.booleancontains(java.lang.Object rowKey, java.lang.Object columnKey)Returnstrueif the table contains a mapping with the specified row and column keys.booleancontainsColumn(java.lang.Object columnKey)Returnstrueif the table contains a mapping with the specified column.booleancontainsRow(java.lang.Object rowKey)Returnstrueif the table contains a mapping with the specified row key.booleancontainsValue(java.lang.Object value)Returnstrueif the table contains a mapping with the specified value.static <R extends java.lang.Comparable,C extends java.lang.Comparable,V>
 TreeBasedTable<R,C,V>create()Creates an emptyTreeBasedTablethat uses the natural orderings of both row and column keys.static <R,C,V>
 TreeBasedTable<R,C,V>create(TreeBasedTable<R,C,? extends V> table)Creates aTreeBasedTablewith the same mappings and sort order as the specifiedTreeBasedTable.static <R,C,V>
 TreeBasedTable<R,C,V>create(java.util.Comparator<? super R> rowComparator, java.util.Comparator<? super C> columnComparator)Creates an emptyTreeBasedTablethat is ordered by the specified comparators.booleanequals(java.lang.Object obj)Compares the specified object with this table for equality.Vget(java.lang.Object rowKey, java.lang.Object columnKey)Returns the value corresponding to the given row and column keys, ornullif no such mapping exists.inthashCode()Returns the hash code for this table.booleanisEmpty()Returnstrueif the table contains no mappings.Vput(R rowKey, C columnKey, V value)Associates the specified value with the specified keys.voidputAll(Table<? extends R,? extends C,? extends V> table)Copies all mappings from the specified table to this table.Vremove(java.lang.Object rowKey, java.lang.Object columnKey)Removes the mapping, if any, associated with the given keys.java.util.SortedMap<C,V>row(R rowKey)Returns a view of all mappings that have the given row key.java.util.Comparator<? super R>rowComparator()Deprecated.Usetable.rowKeySet().comparator()instead.java.util.SortedSet<R>rowKeySet()Returns a set of row keys that have one or more values in the table.java.util.SortedMap<R,java.util.Map<C,V>>rowMap()Returns a view that associates each row key with the corresponding map from column keys to values.intsize()Returns the number of row key / column key / value mappings in the table.java.lang.StringtoString()Returns the string representationrowMap().toString().java.util.Collection<V>values()Returns a collection of all values, which may contain duplicates.- 
Methods inherited from class java.lang.Objectclone, finalize, getClass, notify, notifyAll, wait, wait, wait
 - 
Methods inherited from interface com.google.common.collect.TablecellSet, clear, column, columnKeySet, columnMap, contains, containsColumn, containsRow, containsValue, equals, get, hashCode, isEmpty, put, putAll, remove, size, values
 
- 
 
- 
- 
- 
Method Detail- 
createpublic static <R extends java.lang.Comparable,C extends java.lang.Comparable,V> TreeBasedTable<R,C,V> create() Creates an emptyTreeBasedTablethat uses the natural orderings of both row and column keys.The method signature specifies R extends Comparablewith a rawComparable, instead ofR extends Comparable<? super R>, and the same forC. That's necessary to support classes defined without generics.
 - 
createpublic static <R,C,V> TreeBasedTable<R,C,V> create(java.util.Comparator<? super R> rowComparator, java.util.Comparator<? super C> columnComparator) Creates an emptyTreeBasedTablethat is ordered by the specified comparators.- Parameters:
- rowComparator- the comparator that orders the row keys
- columnComparator- the comparator that orders the column keys
 
 - 
createpublic static <R,C,V> TreeBasedTable<R,C,V> create(TreeBasedTable<R,C,? extends V> table) Creates aTreeBasedTablewith the same mappings and sort order as the specifiedTreeBasedTable.
 - 
rowComparator@Deprecated public java.util.Comparator<? super R> rowComparator() Deprecated.Usetable.rowKeySet().comparator()instead.Returns the comparator that orders the rows. With natural ordering,Ordering.natural()is returned.
 - 
columnComparator@Deprecated public java.util.Comparator<? super C> columnComparator() Deprecated.Returns the comparator that orders the columns. With natural ordering,Ordering.natural()is returned.
 - 
rowpublic java.util.SortedMap<C,V> row(R rowKey) Returns a view of all mappings that have the given row key. For each row key / column key / value mapping in the table with that row key, the returned map associates the column key with the value. If no mappings in the table have the provided row key, an empty map is returned.Changes to the returned map will update the underlying table, and vice versa. Because a TreeBasedTablehas unique sorted values for a given row, this method returns aSortedMap, instead of theMapspecified in theTableinterface.
 - 
rowKeySetpublic java.util.SortedSet<R> rowKeySet() Returns a set of row keys that have one or more values in the table. Changes to the set will update the underlying table, and vice versa.This method returns a SortedSet, instead of theSetspecified in theTableinterface.
 - 
rowMappublic java.util.SortedMap<R,java.util.Map<C,V>> rowMap() 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().This method returns a SortedMap, instead of theMapspecified in theTableinterface.
 - 
containspublic boolean contains(@CheckForNull java.lang.Object rowKey, @CheckForNull java.lang.Object columnKey) Description copied from interface:TableReturnstrueif the table contains a mapping with the specified row and column keys.
 - 
containsColumnpublic boolean containsColumn(@CheckForNull java.lang.Object columnKey) Description copied from interface:TableReturnstrueif the table contains a mapping with the specified column.- Specified by:
- containsColumnin interface- Table<R,C,V>
- Parameters:
- columnKey- key of column to search for
 
 - 
containsRowpublic boolean containsRow(@CheckForNull java.lang.Object rowKey) Description copied from interface:TableReturnstrueif the table contains a mapping with the specified row key.- Specified by:
- containsRowin interface- Table<R,C,V>
- Parameters:
- rowKey- key of row to search for
 
 - 
containsValuepublic boolean containsValue(@CheckForNull java.lang.Object value) Description copied from interface:TableReturnstrueif the table contains a mapping with the specified value.- Specified by:
- containsValuein interface- Table<R,C,V>
- Parameters:
- value- value to search for
 
 - 
get@CheckForNull public V get(@CheckForNull java.lang.Object rowKey, @CheckForNull java.lang.Object columnKey) Description copied from interface:TableReturns the value corresponding to the given row and column keys, ornullif no such mapping exists.
 - 
isEmptypublic boolean isEmpty() Description copied from interface:TableReturnstrueif the table contains no mappings.
 - 
sizepublic int size() Description copied from interface:TableReturns the number of row key / column key / value mappings in the table.
 - 
clearpublic void clear() Description copied from interface:TableRemoves all mappings from the table.
 - 
put@CanIgnoreReturnValue @CheckForNull public V put(R rowKey, C columnKey, V value) Description copied from interface:TableAssociates 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:
- putin interface- Table<R,C,V>
- Parameters:
- rowKey- row key that the value should be associated with
- columnKey- column key that the value should be associated with
- value- value to be associated with the specified keys
- Returns:
- the value previously associated with the keys, or nullif no mapping existed for the keys
 
 - 
remove@CanIgnoreReturnValue @CheckForNull public V remove(@CheckForNull java.lang.Object rowKey, @CheckForNull java.lang.Object columnKey) Description copied from interface:TableRemoves the mapping, if any, associated with the given keys.
 - 
cellSetpublic java.util.Set<Table.Cell<R,C,V>> cellSet() Returns a set of all row key / column key / value triplets. Changes to the returned set will update the underlying table, and vice versa. The cell set does not support theaddoraddAllmethods.The set's iterator traverses the mappings for the first row, the mappings for the second row, and so on. Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the time the cell is returned by a method call to the set or its iterator. 
 - 
columnpublic java.util.Map<R,V> column(C columnKey) Returns a view of all mappings that have the given column key. For each row key / column key / value mapping in the table with that column key, the returned map associates the row key with the value. If no mappings in the table have the provided column key, an empty map is returned.Changes to the returned map will update the underlying table, and vice versa. The returned map's views have iterators that don't support remove().
 - 
columnKeySetpublic java.util.Set<C> columnKeySet() Returns a set of column keys that have one or more values in the table. Changes to the set will update the underlying table, and vice versa.The returned set has an iterator that does not support remove().The set's iterator traverses the columns of the first row, the columns of the second row, etc., skipping any columns that have appeared previously. - Specified by:
- columnKeySetin interface- Table<R,C,V>
- Returns:
- set of column keys
 
 - 
valuespublic java.util.Collection<V> values() Returns a collection of all values, which may contain duplicates. Changes to the returned collection will update the underlying table, and vice versa.The collection's iterator traverses the values for the first row, the values for the second row, and so on. 
 - 
columnMappublic java.util.Map<C,java.util.Map<R,V>> columnMap() Description copied from interface:TableReturns 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().
 - 
putAllpublic void putAll(Table<? extends R,? extends C,? extends V> table) Description copied from interface:TableCopies 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.
 - 
equalspublic boolean equals(@CheckForNull java.lang.Object obj) Description copied from interface:TableCompares the specified object with this table for equality. Two tables are equal when their cell views, as returned byTable.cellSet(), are equal.
 - 
hashCodepublic int hashCode() Description copied from interface:TableReturns the hash code for this table. The hash code of a table is defined as the hash code of its cell view, as returned byTable.cellSet().
 - 
toStringpublic java.lang.String toString() Returns the string representationrowMap().toString().- Overrides:
- toStringin class- java.lang.Object
 
 
- 
 
-