/external/guava/guava/src/com/google/common/graph/ |
D | GraphBuilder.java | 78 .allowsSelfLoops(graph.allowsSelfLoops()) in from() 87 public GraphBuilder<N> allowsSelfLoops(boolean allowsSelfLoops) { in allowsSelfLoops() method in GraphBuilder 88 this.allowsSelfLoops = allowsSelfLoops; in allowsSelfLoops()
|
D | ValueGraphBuilder.java | 83 .allowsSelfLoops(graph.allowsSelfLoops()) in from() 92 public ValueGraphBuilder<N, V> allowsSelfLoops(boolean allowsSelfLoops) { in allowsSelfLoops() argument 93 this.allowsSelfLoops = allowsSelfLoops; in allowsSelfLoops()
|
D | NetworkBuilder.java | 89 .allowsSelfLoops(network.allowsSelfLoops()) in from() 108 public NetworkBuilder<N, E> allowsSelfLoops(boolean allowsSelfLoops) { in allowsSelfLoops() method in NetworkBuilder 109 this.allowsSelfLoops = allowsSelfLoops; in allowsSelfLoops()
|
D | ConfigurableNetwork.java | 54 private final boolean allowsSelfLoops; field in ConfigurableNetwork 83 this.allowsSelfLoops = builder.allowsSelfLoops; in ConfigurableNetwork() 116 public boolean allowsSelfLoops() { in allowsSelfLoops() method in ConfigurableNetwork 117 return allowsSelfLoops; in allowsSelfLoops() 150 if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality in edgesConnecting()
|
D | ConfigurableValueGraph.java | 47 private final boolean allowsSelfLoops; field in ConfigurableValueGraph 72 this.allowsSelfLoops = builder.allowsSelfLoops; in ConfigurableValueGraph() 93 public boolean allowsSelfLoops() { in allowsSelfLoops() method in ConfigurableValueGraph 94 return allowsSelfLoops; in allowsSelfLoops()
|
D | AbstractValueGraph.java | 62 public boolean allowsSelfLoops() { in asGraph() method in AbstractValueGraph 63 return AbstractValueGraph.this.allowsSelfLoops(); in asGraph() 139 + allowsSelfLoops()
|
/external/guava/android/guava/src/com/google/common/graph/ |
D | GraphBuilder.java | 78 .allowsSelfLoops(graph.allowsSelfLoops()) in from() 87 public GraphBuilder<N> allowsSelfLoops(boolean allowsSelfLoops) { in allowsSelfLoops() argument 88 this.allowsSelfLoops = allowsSelfLoops; in allowsSelfLoops()
|
D | ValueGraphBuilder.java | 83 .allowsSelfLoops(graph.allowsSelfLoops()) in from() 92 public ValueGraphBuilder<N, V> allowsSelfLoops(boolean allowsSelfLoops) { in allowsSelfLoops() argument 93 this.allowsSelfLoops = allowsSelfLoops; in allowsSelfLoops()
|
D | NetworkBuilder.java | 89 .allowsSelfLoops(network.allowsSelfLoops()) in from() 108 public NetworkBuilder<N, E> allowsSelfLoops(boolean allowsSelfLoops) { in allowsSelfLoops() argument 109 this.allowsSelfLoops = allowsSelfLoops; in allowsSelfLoops()
|
D | ConfigurableNetwork.java | 54 private final boolean allowsSelfLoops; field in ConfigurableNetwork 83 this.allowsSelfLoops = builder.allowsSelfLoops; in ConfigurableNetwork() 116 public boolean allowsSelfLoops() { in allowsSelfLoops() method in ConfigurableNetwork 117 return allowsSelfLoops; in allowsSelfLoops() 150 if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality in edgesConnecting()
|
D | ConfigurableValueGraph.java | 47 private final boolean allowsSelfLoops; field in ConfigurableValueGraph 72 this.allowsSelfLoops = builder.allowsSelfLoops; in ConfigurableValueGraph() 93 public boolean allowsSelfLoops() { in allowsSelfLoops() method in ConfigurableValueGraph 94 return allowsSelfLoops; in allowsSelfLoops()
|
D | AbstractValueGraph.java | 61 public boolean allowsSelfLoops() { in asGraph() method in AbstractValueGraph 62 return AbstractValueGraph.this.allowsSelfLoops(); in asGraph() 128 + allowsSelfLoops()
|
D | ForwardingGraph.java | 51 public boolean allowsSelfLoops() { in allowsSelfLoops() method in ForwardingGraph 52 return delegate().allowsSelfLoops(); in allowsSelfLoops()
|
/external/guava/guava-tests/test/com/google/common/graph/ |
D | TestUtil.java | 53 assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); in assertStronglyEquivalent() 61 assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); in assertStronglyEquivalent() 70 assertThat(networkA.allowsSelfLoops()).isEqualTo(networkB.allowsSelfLoops()); in assertStronglyEquivalent()
|
D | GraphsTest.java | 67 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedGraph() 73 MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); in transitiveClosure_directedGraph() 88 GraphBuilder.undirected().allowsSelfLoops(false).build(); in transitiveClosure_undirectedGraph() 94 MutableGraph<Integer> expectedClosure = GraphBuilder.undirected().allowsSelfLoops(true).build(); in transitiveClosure_undirectedGraph() 108 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedPathGraph() 113 MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); in transitiveClosure_directedPathGraph() 131 GraphBuilder.undirected().allowsSelfLoops(false).build(); in transitiveClosure_undirectedPathGraph() 136 MutableGraph<Integer> expectedClosure = GraphBuilder.undirected().allowsSelfLoops(true).build(); in transitiveClosure_undirectedPathGraph() 153 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedCycleGraph() 159 MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); in transitiveClosure_directedCycleGraph() [all …]
|
D | GraphEquivalenceTest.java | 56 return GraphBuilder.undirected().allowsSelfLoops(true).build(); in createGraph() 58 return GraphBuilder.directed().allowsSelfLoops(true).build(); in createGraph() 114 GraphBuilder.from(graph).allowsSelfLoops(!graph.allowsSelfLoops()).build(); in equivalent_propertiesDiffer()
|
D | GraphPropertiesTest.java | 43 GraphBuilder.directed().allowsSelfLoops(true).build(); in init() 45 GraphBuilder.undirected().allowsSelfLoops(true).build(); in init() 51 NetworkBuilder.directed().allowsParallelEdges(true).allowsSelfLoops(true).build(); in init() 53 NetworkBuilder.undirected().allowsParallelEdges(true).allowsSelfLoops(true).build(); in init()
|
D | EndpointPairTest.java | 121 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directedGraph() 137 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirectedGraph() 153 NetworkBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directedNetwork() 170 NetworkBuilder.undirected().allowsParallelEdges(true).allowsSelfLoops(true).build(); in endpointPair_undirectedNetwork() 207 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirected_contains() 226 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directed_contains()
|
D | NetworkEquivalenceTest.java | 61 return NetworkBuilder.undirected().allowsSelfLoops(true).build(); in createNetwork() 63 return NetworkBuilder.directed().allowsSelfLoops(true).build(); in createNetwork() 146 .allowsSelfLoops(!network.allowsSelfLoops()) in equivalent_propertiesDiffer()
|
/external/guava/android/guava-tests/test/com/google/common/graph/ |
D | TestUtil.java | 53 assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); in assertStronglyEquivalent() 61 assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); in assertStronglyEquivalent() 70 assertThat(networkA.allowsSelfLoops()).isEqualTo(networkB.allowsSelfLoops()); in assertStronglyEquivalent()
|
D | GraphsTest.java | 67 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedGraph() 73 MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); in transitiveClosure_directedGraph() 88 GraphBuilder.undirected().allowsSelfLoops(false).build(); in transitiveClosure_undirectedGraph() 94 MutableGraph<Integer> expectedClosure = GraphBuilder.undirected().allowsSelfLoops(true).build(); in transitiveClosure_undirectedGraph() 108 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedPathGraph() 113 MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); in transitiveClosure_directedPathGraph() 131 GraphBuilder.undirected().allowsSelfLoops(false).build(); in transitiveClosure_undirectedPathGraph() 136 MutableGraph<Integer> expectedClosure = GraphBuilder.undirected().allowsSelfLoops(true).build(); in transitiveClosure_undirectedPathGraph() 153 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); in transitiveClosure_directedCycleGraph() 159 MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); in transitiveClosure_directedCycleGraph() [all …]
|
D | GraphEquivalenceTest.java | 56 return GraphBuilder.undirected().allowsSelfLoops(true).build(); in createGraph() 58 return GraphBuilder.directed().allowsSelfLoops(true).build(); in createGraph() 114 GraphBuilder.from(graph).allowsSelfLoops(!graph.allowsSelfLoops()).build(); in equivalent_propertiesDiffer()
|
D | GraphPropertiesTest.java | 43 GraphBuilder.directed().allowsSelfLoops(true).build(); in init() 45 GraphBuilder.undirected().allowsSelfLoops(true).build(); in init() 51 NetworkBuilder.directed().allowsParallelEdges(true).allowsSelfLoops(true).build(); in init() 53 NetworkBuilder.undirected().allowsParallelEdges(true).allowsSelfLoops(true).build(); in init()
|
D | EndpointPairTest.java | 121 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directedGraph() 137 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirectedGraph() 153 NetworkBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directedNetwork() 170 NetworkBuilder.undirected().allowsParallelEdges(true).allowsSelfLoops(true).build(); in endpointPair_undirectedNetwork() 207 MutableGraph<Integer> undirectedGraph = GraphBuilder.undirected().allowsSelfLoops(true).build(); in endpointPair_undirected_contains() 226 MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); in endpointPair_directed_contains()
|
D | NetworkEquivalenceTest.java | 61 return NetworkBuilder.undirected().allowsSelfLoops(true).build(); in createNetwork() 63 return NetworkBuilder.directed().allowsSelfLoops(true).build(); in createNetwork() 146 .allowsSelfLoops(!network.allowsSelfLoops()) in equivalent_propertiesDiffer()
|