| /external/guava/guava/src/com/google/common/graph/ |
| D | AbstractDirectedNetworkConnections.java | 47 protected final Map<E, N> outEdgeMap; field in AbstractDirectedNetworkConnections
52 Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { in AbstractDirectedNetworkConnections() argument
54 this.outEdgeMap = checkNotNull(outEdgeMap); 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()
95 return Collections.unmodifiableSet(outEdgeMap.keySet());
102 return checkNotNull(outEdgeMap.get(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()
60 return Collections.unmodifiableSet(((BiMap<E, N>) outEdgeMap).values()); in successors()
65 return new EdgesConnecting<E>(((BiMap<E, N>) outEdgeMap).inverse(), node); in edgesConnecting()
|
| D | ImmutableNetwork.java | 103 Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network)); in connectionsOf() local
106 ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount) in connectionsOf()
107 : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount); in connectionsOf()
|
| D | DirectedMultiNetworkConnections.java | 88 successors = HashMultiset.create(outEdgeMap.values()); in successorsMultiset()
96 return new MultiEdgesConnecting<E>(outEdgeMap, node) { in edgesConnecting()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | AbstractDirectedNetworkConnections.java | 47 protected final Map<E, N> outEdgeMap; field in AbstractDirectedNetworkConnections
52 Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { in AbstractDirectedNetworkConnections() argument
54 this.outEdgeMap = checkNotNull(outEdgeMap); 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()
95 return Collections.unmodifiableSet(outEdgeMap.keySet());
102 return checkNotNull(outEdgeMap.get(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()
60 return Collections.unmodifiableSet(((BiMap<E, N>) outEdgeMap).values()); in successors()
65 return new EdgesConnecting<E>(((BiMap<E, N>) outEdgeMap).inverse(), node); in edgesConnecting()
|
| D | ImmutableNetwork.java | 103 Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network)); in connectionsOf() local
106 ? DirectedMultiNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount) in connectionsOf()
107 : DirectedNetworkConnections.ofImmutable(inEdgeMap, outEdgeMap, selfLoopCount); in connectionsOf()
|
| D | DirectedMultiNetworkConnections.java | 88 successors = HashMultiset.create(outEdgeMap.values()); in successorsMultiset()
96 return new MultiEdgesConnecting<E>(outEdgeMap, node) { in edgesConnecting()
|