com.google_voltpatches.common.graph.AbstractValueGraph Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of voltdbclient Show documentation
Show all versions of voltdbclient Show documentation
VoltDB client interface libraries
/*
* Copyright (C) 2016 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_voltpatches.common.graph;
import static com.google_voltpatches.common.base.Preconditions.checkArgument;
import static com.google_voltpatches.common.graph.GraphConstants.EDGE_CONNECTING_NOT_IN_GRAPH;
import static com.google_voltpatches.common.graph.GraphConstants.GRAPH_STRING_FORMAT;
import static com.google_voltpatches.common.graph.GraphConstants.NODE_NOT_IN_GRAPH;
import com.google_voltpatches.common.annotations.Beta;
import com.google_voltpatches.common.base.Function;
import com.google_voltpatches.common.collect.Maps;
import java.util.Map;
/**
* This class provides a skeletal implementation of {@link ValueGraph}. It is recommended to extend
* this class rather than implement {@link ValueGraph} directly.
*
* @author James Sexton
* @param Node parameter type
* @param Value parameter type
* @since 20.0
*/
@Beta
public abstract class AbstractValueGraph extends AbstractGraph
implements ValueGraph {
@Override
public V edgeValue(Object nodeU, Object nodeV) {
V value = edgeValueOrDefault(nodeU, nodeV, null);
if (value == null) {
checkArgument(nodes().contains(nodeU), NODE_NOT_IN_GRAPH, nodeU);
checkArgument(nodes().contains(nodeV), NODE_NOT_IN_GRAPH, nodeV);
throw new IllegalArgumentException(String.format(EDGE_CONNECTING_NOT_IN_GRAPH, nodeU, nodeV));
}
return value;
}
/** Returns a string representation of this graph. */
@Override
public String toString() {
String propertiesString =
String.format("isDirected: %s, allowsSelfLoops: %s", isDirected(), allowsSelfLoops());
return String.format(GRAPH_STRING_FORMAT, propertiesString, nodes(), edgeValueMap());
}
private Map, V> edgeValueMap() {
Function, V> edgeToValueFn =
new Function, V>() {
@Override
public V apply(EndpointPair edge) {
return edgeValue(edge.nodeU(), edge.nodeV());
}
};
return Maps.asMap(edges(), edgeToValueFn);
}
}