/guava/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
} return Iterators.unmodifiableIterator( incidentEdges.iterator( ) ) ;: Sets.union( inEdgeMap.keySet( ) , outEdgeMap.keySet( ) ) ;
: Sets.union ( inEdgeMap.keySet ( ) , outEdgeMap.keySet ( ) ) ; return Iterators.unmodifiableIterator ( incidentEdges.iterator ( ) ) ; }
return new AbstractSet<E>() { @Override public UnmodifiableIterator<E> iterator() { Iterable<E> incidentEdges = (selfLoopCount == 0) ? Iterables.concat(inEdgeMap.keySet(), outEdgeMap.keySet()) <extra_id_0> @Override public int size() { return IntMath.saturatedAdd(inEdgeMap.size(), outEdgeMap.size() - selfLoopCount); } @Override public boolean contains(@CheckForNull Object obj) {