com.signalfx.shaded.google.common.graph.MultiEdgesConnecting Maven / Gradle / Ivy
Show all versions of signalfx-codahale Show documentation
/*
* 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.signalfx.shaded.google.common.graph;
import static com.signalfx.shaded.google.common.base.Preconditions.checkNotNull;
import com.signalfx.shaded.google.common.collect.AbstractIterator;
import com.signalfx.shaded.google.common.collect.UnmodifiableIterator;
import java.util.AbstractSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import com.signalfx.shaded.javax.annotation.CheckForNull;
/**
* A class to represent the set of edges connecting an (implicit) origin node to a target node.
*
* The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See
* {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges.
*
* @author James Sexton
* @param Edge parameter type
*/
@ElementTypesAreNonnullByDefault
abstract class MultiEdgesConnecting extends AbstractSet {
private final Map outEdgeToNode;
private final Object targetNode;
MultiEdgesConnecting(Map outEdgeToNode, Object targetNode) {
this.outEdgeToNode = checkNotNull(outEdgeToNode);
this.targetNode = checkNotNull(targetNode);
}
@Override
public UnmodifiableIterator iterator() {
Iterator> entries = outEdgeToNode.entrySet().iterator();
return new AbstractIterator() {
@Override
@CheckForNull
protected E computeNext() {
while (entries.hasNext()) {
Entry entry = entries.next();
if (targetNode.equals(entry.getValue())) {
return entry.getKey();
}
}
return endOfData();
}
};
}
@Override
public boolean contains(@CheckForNull Object edge) {
return targetNode.equals(outEdgeToNode.get(edge));
}
}