| /external/guava/guava/src/com/google/common/graph/ |
| D | AbstractDirectedNetworkConnections.java | 44 protected final Map<E, N> inEdgeMap; field in AbstractDirectedNetworkConnections
52 Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { in AbstractDirectedNetworkConnections() argument
53 this.inEdgeMap = checkNotNull(inEdgeMap); in AbstractDirectedNetworkConnections()
56 checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size()); in AbstractDirectedNetworkConnections()
71 ? Iterables.concat(inEdgeMap.keySet(), outEdgeMap.keySet()) in incidentEdges()
72 : Sets.union(inEdgeMap.keySet(), outEdgeMap.keySet()); in incidentEdges()
78 return IntMath.saturatedAdd(inEdgeMap.size(), outEdgeMap.size() - selfLoopCount); in incidentEdges()
83 return inEdgeMap.containsKey(obj) || outEdgeMap.containsKey(obj); in incidentEdges()
90 return Collections.unmodifiableSet(inEdgeMap.keySet());
110 N previousNode = inEdgeMap.remove(edge);
[all …]
|
| D | DirectedNetworkConnections.java | 38 Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { in DirectedNetworkConnections() argument
39 super(inEdgeMap, outEdgeMap, selfLoopCount); in DirectedNetworkConnections()
55 return Collections.unmodifiableSet(((BiMap<E, N>) inEdgeMap).values()); in predecessors()
|
| D | ImmutableNetwork.java | 102 Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network)); in connectionsOf() local
106 ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount) in connectionsOf()
107 : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount); in connectionsOf()
|
| D | DirectedMultiNetworkConnections.java | 72 predecessors = HashMultiset.create(inEdgeMap.values()); in predecessorsMultiset()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | AbstractDirectedNetworkConnections.java | 44 protected final Map<E, N> inEdgeMap; field in AbstractDirectedNetworkConnections
52 Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { in AbstractDirectedNetworkConnections() argument
53 this.inEdgeMap = checkNotNull(inEdgeMap); in AbstractDirectedNetworkConnections()
56 checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size()); in AbstractDirectedNetworkConnections()
71 ? Iterables.concat(inEdgeMap.keySet(), outEdgeMap.keySet()) in incidentEdges()
72 : Sets.union(inEdgeMap.keySet(), outEdgeMap.keySet()); in incidentEdges()
78 return IntMath.saturatedAdd(inEdgeMap.size(), outEdgeMap.size() - selfLoopCount); in incidentEdges()
83 return inEdgeMap.containsKey(obj) || outEdgeMap.containsKey(obj); in incidentEdges()
90 return Collections.unmodifiableSet(inEdgeMap.keySet());
110 N previousNode = inEdgeMap.remove(edge);
[all …]
|
| D | DirectedNetworkConnections.java | 38 Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { in DirectedNetworkConnections() argument
39 super(inEdgeMap, outEdgeMap, selfLoopCount); in DirectedNetworkConnections()
55 return Collections.unmodifiableSet(((BiMap<E, N>) inEdgeMap).values()); in predecessors()
|
| D | ImmutableNetwork.java | 102 Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network)); in connectionsOf() local
106 ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount) in connectionsOf()
107 : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount); in connectionsOf()
|
| D | DirectedMultiNetworkConnections.java | 72 predecessors = HashMultiset.create(inEdgeMap.values()); in predecessorsMultiset()
|