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

Go to download

Show more of this group Show more artifacts with this name
Show all versions of presto-jdbc Show documentation

There is a newer version: 0.289

/*
 * 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 static com.facebook.presto.jdbc.internal.guava.graph.GraphConstants.EXPECTED_DEGREE;

import com.facebook.presto.jdbc.internal.guava.collect.BiMap;
import com.facebook.presto.jdbc.internal.guava.collect.HashBiMap;
import com.facebook.presto.jdbc.internal.guava.collect.ImmutableBiMap;
import java.util.Collections;
import java.util.Map;
import java.util.Set;

/**
 * An implementation of {@link NetworkConnections} for directed networks.
 *
 * @author James Sexton
 * @param  Node parameter type
 * @param  Edge parameter type
 */
final class DirectedNetworkConnections extends AbstractDirectedNetworkConnections {

  protected DirectedNetworkConnections(
      Map inEdgeMap, Map outEdgeMap, int selfLoopCount) {
    super(inEdgeMap, outEdgeMap, selfLoopCount);
  }

  static  DirectedNetworkConnections of() {
    return new DirectedNetworkConnections<>(
        HashBiMap.create(EXPECTED_DEGREE), HashBiMap.create(EXPECTED_DEGREE), 0);
  }

  static  DirectedNetworkConnections ofImmutable(
      Map inEdges, Map outEdges, int selfLoopCount) {
    return new DirectedNetworkConnections<>(
        ImmutableBiMap.copyOf(inEdges), ImmutableBiMap.copyOf(outEdges), selfLoopCount);
  }

  @Override
  public Set predecessors() {
    return Collections.unmodifiableSet(((BiMap) inEdgeMap).values());
  }

  @Override
  public Set successors() {
    return Collections.unmodifiableSet(((BiMap) outEdgeMap).values());
  }

  @Override
  public Set edgesConnecting(N node) {
    return new EdgesConnecting(((BiMap) outEdgeMap).inverse(), node);
  }
}