- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 56 for accident (0.04 sec)
-
CODE_OF_CONDUCT.md
reported to the community leaders responsible for enforcement at . All complaints will be reviewed and investigated promptly and fairly. All community leaders are obligated to respect the privacy and security of the reporter of any incident. ## Enforcement Guidelines Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct: ### 1. Correction
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Thu Oct 17 06:18:13 UTC 2024 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
* @param <V> Value parameter type */ interface GraphConnections<N, V> { Set<N> adjacentNodes(); Set<N> predecessors(); Set<N> successors(); /** * Returns an iterator over the incident edges. * * @param thisNode The node that this all of the connections in this class are connected to. */ Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode); /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
* * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ abstract class AbstractUndirectedNetworkConnections<N, E> implements NetworkConnections<N, E> { /** Keys are edges incident to the origin node, values are the node at the other end. */ final Map<E, N> incidentEdgeMap; AbstractUndirectedNetworkConnections(Map<E, N> incidentEdgeMap) { this.incidentEdgeMap = checkNotNull(incidentEdgeMap);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.7K bytes - Viewed (0) -
docs/contribute/code_of_conduct.md
* Your account of what occurred, and if you believe the incident is ongoing. If there is a publicly available record (e.g. a mailing list archive or a public IRC logger), please include a link. * Any additional information that may be helpful. After filing a report, a representative from the Square Code of Conduct committee will contact you personally. The committee will then review the incident, follow up with any additional questions,
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sun Feb 06 02:19:09 UTC 2022 - 5.1K bytes - Viewed (0) -
docs/en/docs/css/custom.css
text-align: center; } .user .count { font-size: 80%; text-align: center; } a.announce-link:link, a.announce-link:visited { color: #fff; } a.announce-link:hover { color: var(--md-accent-fg-color); } .announce-wrapper { display: flex; justify-content: space-between; flex-wrap: wrap; align-items: center; } .announce-wrapper div.item { display: none; }
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Wed Jul 17 02:12:29 UTC 2024 - 2.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
assertThat(network.removeNode(nodeList.get(i))).isTrue(); } assertThat(network.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractNetworkTest.validateNetwork(network); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(network.removeNode(nodeList.get(i))).isTrue(); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
import com.google.errorprone.annotations.CanIgnoreReturnValue; import java.util.Set; import org.jspecify.annotations.Nullable; /** * An interface for representing and manipulating an origin node's adjacent nodes and incident edges * in a {@link Network}. * * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ interface NetworkConnections<N, E> { Set<N> adjacentNodes();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
* * @author James Sexton * @param <N> Node parameter type * @param <E> Edge parameter type */ abstract class AbstractUndirectedNetworkConnections<N, E> implements NetworkConnections<N, E> { /** Keys are edges incident to the origin node, values are the node at the other end. */ final Map<E, N> incidentEdgeMap; AbstractUndirectedNetworkConnections(Map<E, N> incidentEdgeMap) { this.incidentEdgeMap = checkNotNull(incidentEdgeMap);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.7K bytes - Viewed (0)