All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.facebook.presto.jdbc.internal.guava.graph.AbstractValueGraph Maven / Gradle / Ivy

There is a newer version: 0.289
Show newest version
/*
 * 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.facebook.presto.jdbc.internal.guava.graph;

import com.facebook.presto.jdbc.internal.guava.annotations.Beta;
import com.facebook.presto.jdbc.internal.guava.base.Function;
import com.facebook.presto.jdbc.internal.guava.collect.Maps;
import java.util.Map;
import java.util.Optional;
import java.util.Set;
import org.checkerframework.checker.nullness.qual.Nullable;

/**
 * This class provides a skeletal implementation of {@link ValueGraph}. It is recommended to extend
 * this class rather than implement {@link ValueGraph} directly.
 *
 * 

The methods implemented in this class should not be overridden unless the subclass admits a * more efficient implementation. * * @author James Sexton * @param Node parameter type * @param Value parameter type * @since 20.0 */ @Beta public abstract class AbstractValueGraph extends AbstractBaseGraph implements ValueGraph { @Override public Graph asGraph() { return new AbstractGraph() { @Override public Set nodes() { return AbstractValueGraph.this.nodes(); } @Override public Set> edges() { return AbstractValueGraph.this.edges(); } @Override public boolean isDirected() { return AbstractValueGraph.this.isDirected(); } @Override public boolean allowsSelfLoops() { return AbstractValueGraph.this.allowsSelfLoops(); } @Override public ElementOrder nodeOrder() { return AbstractValueGraph.this.nodeOrder(); } @Override public Set adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set successors(N node) { return AbstractValueGraph.this.successors(node); } @Override public int degree(N node) { return AbstractValueGraph.this.degree(node); } @Override public int inDegree(N node) { return AbstractValueGraph.this.inDegree(node); } @Override public int outDegree(N node) { return AbstractValueGraph.this.outDegree(node); } }; } @Override public Optional edgeValue(N nodeU, N nodeV) { return Optional.ofNullable(edgeValueOrDefault(nodeU, nodeV, null)); } @Override public final boolean equals(@Nullable Object obj) { if (obj == this) { return true; } if (!(obj instanceof ValueGraph)) { return false; } ValueGraph other = (ValueGraph) obj; return isDirected() == other.isDirected() && nodes().equals(other.nodes()) && edgeValueMap(this).equals(edgeValueMap(other)); } @Override public final int hashCode() { return edgeValueMap(this).hashCode(); } /** Returns a string representation of this graph. */ @Override public String toString() { return "isDirected: " + isDirected() + ", allowsSelfLoops: " + allowsSelfLoops() + ", nodes: " + nodes() + ", edges: " + edgeValueMap(this); } private static Map, V> edgeValueMap(final ValueGraph graph) { Function, V> edgeToValueFn = new Function, V>() { @Override public V apply(EndpointPair edge) { return graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null); } }; return Maps.asMap(graph.edges(), edgeToValueFn); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy