shaded.com.google.common.graph.DirectedMultiNetworkConnections Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of spring-cloud-contract-shade Show documentation
Spring Cloud Contract Shaded Dependencies
There is a newer version: 4.1.4
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 shaded.shaded.com.google.common.graph;

import static shaded.shaded.com.google.common.base.Preconditions.checkState;
import static shaded.shaded.com.google.common.graph.GraphConstants.INNER_CAPACITY;
import static shaded.shaded.com.google.common.graph.GraphConstants.INNER_LOAD_FACTOR;

import shaded.shaded.com.google.common.collect.HashMultiset;
import shaded.shaded.com.google.common.collect.ImmutableMap;
import shaded.shaded.com.google.common.collect.Multiset;
import shaded.shaded.com.google.errorprone.annotations.concurrent.LazyInit;
import java.lang.ref.Reference;
import java.lang.ref.SoftReference;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
import org.checkerframework.checker.nullness.qual.Nullable;

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

  private DirectedMultiNetworkConnections(
      Map inEdges, Map outEdges, int selfLoopCount) {
    super(inEdges, outEdges, selfLoopCount);
  }

  static  DirectedMultiNetworkConnections of() {
    return new DirectedMultiNetworkConnections<>(
        new HashMap(INNER_CAPACITY, INNER_LOAD_FACTOR),
        new HashMap(INNER_CAPACITY, INNER_LOAD_FACTOR),
        0);
  }

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

  @LazyInit private transient Reference> predecessorsReference;

  @Override
  public Set predecessors() {
    return Collections.unmodifiableSet(predecessorsMultiset().elementSet());
  }

  private Multiset predecessorsMultiset() {
    Multiset predecessors = getReference(predecessorsReference);
    if (predecessors == null) {
      predecessors = HashMultiset.create(inEdgeMap.values());
      predecessorsReference = new SoftReference<>(predecessors);
    }
    return predecessors;
  }

  @LazyInit private transient Reference> successorsReference;

  @Override
  public Set successors() {
    return Collections.unmodifiableSet(successorsMultiset().elementSet());
  }

  private Multiset successorsMultiset() {
    Multiset successors = getReference(successorsReference);
    if (successors == null) {
      successors = HashMultiset.create(outEdgeMap.values());
      successorsReference = new SoftReference<>(successors);
    }
    return successors;
  }

  @Override
  public Set edgesConnecting(final N node) {
    return new MultiEdgesConnecting(outEdgeMap, node) {
      @Override
      public int size() {
        return successorsMultiset().count(node);
      }
    };
  }

  @Override
  public N removeInEdge(E edge, boolean isSelfLoop) {
    N node = super.removeInEdge(edge, isSelfLoop);
    Multiset predecessors = getReference(predecessorsReference);
    if (predecessors != null) {
      checkState(predecessors.remove(node));
    }
    return node;
  }

  @Override
  public N removeOutEdge(E edge) {
    N node = super.removeOutEdge(edge);
    Multiset successors = getReference(successorsReference);
    if (successors != null) {
      checkState(successors.remove(node));
    }
    return node;
  }

  @Override
  public void addInEdge(E edge, N node, boolean isSelfLoop) {
    super.addInEdge(edge, node, isSelfLoop);
    Multiset predecessors = getReference(predecessorsReference);
    if (predecessors != null) {
      checkState(predecessors.add(node));
    }
  }

  @Override
  public void addOutEdge(E edge, N node) {
    super.addOutEdge(edge, node);
    Multiset successors = getReference(successorsReference);
    if (successors != null) {
      checkState(successors.add(node));
    }
  }

  private static  @Nullable T getReference(@Nullable Reference reference) {
    return (reference == null) ? null : reference.get();
  }
}