All Downloads are FREE. Search and download functionalities are using the official Maven repository.
Please wait. This can take some minutes ...
Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
com.google.common.collect.AbstractTable Maven / Gradle / Ivy
/*
* Copyright (C) 2013 The Guava Authors
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License
* is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
* or implied. See the License for the specific language governing permissions and limitations under
* the License.
*/
package com.google.common.collect;
import com.google.common.annotations.GwtCompatible;
import java.util.AbstractCollection;
import java.util.AbstractSet;
import java.util.Collection;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.Spliterator;
/**
* Skeletal, implementation-agnostic implementation of the {@link Table} interface.
*
* @author Louis Wasserman
*/
@GwtCompatible
abstract class AbstractTable implements Table {
@Override
public boolean containsRow(Object rowKey) {
return Maps.safeContainsKey(rowMap(), rowKey);
}
@Override
public boolean containsColumn(Object columnKey) {
return Maps.safeContainsKey(columnMap(), columnKey);
}
@Override
public Set rowKeySet() {
return rowMap().keySet();
}
@Override
public Set columnKeySet() {
return columnMap().keySet();
}
@Override
public boolean containsValue(Object value) {
for (Map row : rowMap().values()) {
if (row.containsValue(value)) {
return true;
}
}
return false;
}
@Override
public boolean contains(Object rowKey, Object columnKey) {
Map row = Maps.safeGet(rowMap(), rowKey);
return row != null && Maps.safeContainsKey(row, columnKey);
}
@Override
public V get(Object rowKey, Object columnKey) {
Map row = Maps.safeGet(rowMap(), rowKey);
return (row == null) ? null : Maps.safeGet(row, columnKey);
}
@Override
public boolean isEmpty() {
return size() == 0;
}
@Override
public void clear() {
Iterators.clear(cellSet().iterator());
}
@Override
public V remove(Object rowKey, Object columnKey) {
Map row = Maps.safeGet(rowMap(), rowKey);
return (row == null) ? null : Maps.safeRemove(row, columnKey);
}
@Override
public V put(R rowKey, C columnKey, V value) {
return row(rowKey).put(columnKey, value);
}
@Override
public void putAll(Table extends R, ? extends C, ? extends V> table) {
for (Table.Cell extends R, ? extends C, ? extends V> cell : table.cellSet()) {
put(cell.getRowKey(), cell.getColumnKey(), cell.getValue());
}
}
private transient Set> cellSet;
@Override
public Set> cellSet() {
Set> result = cellSet;
return (result == null) ? cellSet = createCellSet() : result;
}
Set> createCellSet() {
return new CellSet();
}
abstract Iterator> cellIterator();
abstract Spliterator> cellSpliterator();
class CellSet extends AbstractSet> {
@Override
public boolean contains(Object o) {
if (o instanceof Cell) {
Cell, ?, ?> cell = (Cell, ?, ?>) o;
Map row = Maps.safeGet(rowMap(), cell.getRowKey());
return row != null
&& Collections2.safeContains(
row.entrySet(), Maps.immutableEntry(cell.getColumnKey(), cell.getValue()));
}
return false;
}
@Override
public boolean remove(Object o) {
if (o instanceof Cell) {
Cell, ?, ?> cell = (Cell, ?, ?>) o;
Map row = Maps.safeGet(rowMap(), cell.getRowKey());
return row != null
&& Collections2.safeRemove(
row.entrySet(), Maps.immutableEntry(cell.getColumnKey(), cell.getValue()));
}
return false;
}
@Override
public void clear() {
AbstractTable.this.clear();
}
@Override
public Iterator> iterator() {
return cellIterator();
}
@Override
public Spliterator> spliterator() {
return cellSpliterator();
}
@Override
public int size() {
return AbstractTable.this.size();
}
}
private transient Collection values;
@Override
public Collection values() {
Collection result = values;
return (result == null) ? values = createValues() : result;
}
Collection createValues() {
return new Values();
}
Iterator valuesIterator() {
return new TransformedIterator, V>(cellSet().iterator()) {
@Override
V transform(Cell cell) {
return cell.getValue();
}
};
}
Spliterator valuesSpliterator() {
return CollectSpliterators.map(cellSpliterator(), Table.Cell::getValue);
}
class Values extends AbstractCollection {
@Override
public Iterator iterator() {
return valuesIterator();
}
@Override
public Spliterator spliterator() {
return valuesSpliterator();
}
@Override
public boolean contains(Object o) {
return containsValue(o);
}
@Override
public void clear() {
AbstractTable.this.clear();
}
@Override
public int size() {
return AbstractTable.this.size();
}
}
@Override
public boolean equals(Object obj) {
return Tables.equalsImpl(this, obj);
}
@Override
public int hashCode() {
return cellSet().hashCode();
}
/** Returns the string representation {@code rowMap().toString()}. */
@Override
public String toString() {
return rowMap().toString();
}
}
| | | | | | |