- Sort Score
- Num 10 results
- Language All
Results 31 - 40 of 313 for edge (0.06 seconds)
-
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
@Test public void edges_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<String> edges = network.edges(); assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); addEdge(N1, N2, E12); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Override @Test public void incidentEdges_checkReturnedSetMutability() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 21.3K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Stable order * <li>{@code inEdges(node)}: Edge insertion order * <li>{@code outEdges(node)}: Edge insertion order * <li>{@code adjacentEdges(edge)}: Stable order
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 6.5K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/EdgesConnecting.java
import org.jspecify.annotations.Nullable; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ final class EdgesConnecting<E> extends AbstractSet<E> {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Aug 11 19:31:30 GMT 2025 - 2.1K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ArchetypeGraph.java
// Graph properties // /** * Returns true if the edges in this graph are directed. Directed edges connect a {@link * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other. */ boolean isDirected(); /** * Returns true if this graph allows self-loops (edges that connect a node to itself). AttemptingCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Nov 11 17:11:16 GMT 2025 - 7.5K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.java
public Set<E> outEdges(N node) { return delegate().outEdges(node); } @Override public EndpointPair<N> incidentNodes(E edge) { return delegate().incidentNodes(edge); } @Override public Set<E> adjacentEdges(E edge) { return delegate().adjacentEdges(edge); } @Override public int degree(N node) { return delegate().degree(node); } @Override
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 3.4K bytes - Click Count (0) -
src/test/java/jcifs/smb/SmbTransportInternalTest.java
SmbException ex = assertThrows(SmbException.class, () -> transport.hasCapability(42)); assertTrue(ex.getMessage().contains("failed")); verify(transport).hasCapability(42); } // Edge: disconnected status toggles @ParameterizedTest @DisplayName("isDisconnected reflects current mocked state") @ValueSource(booleans = { true, false }) void isDisconnected_states(boolean disconnected) {
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 07:14:38 GMT 2025 - 12.1K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
return network.outEdges(node); } @Override public EndpointPair<N> incidentNodes(E edge) { return network.incidentNodes(edge); } @Override public Set<E> adjacentEdges(E edge) { return network.adjacentEdges(edge); } // _don't_ override edge*Connecting*; we want the behavior from AbstractNetwork }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 7.4K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
// 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(); } assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).isEmpty(); // no edges can remain if there's no nodes
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.6K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/suggest/entity/SuggestItemBoundaryTest.java
import java.util.Arrays; import java.util.HashMap; import java.util.Map; import org.codelibs.fess.suggest.constants.FieldNames; import org.junit.Test; /** * Boundary tests for SuggestItem. * Tests edge cases, null handling, and limit conditions. */ public class SuggestItemBoundaryTest { // ============================================================ // Tests for empty/boundary text arraysCreated: Fri Apr 17 09:08:13 GMT 2026 - Last Modified: Sat Jan 17 05:10:37 GMT 2026 - 22.2K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/suggest/concurrent/DeferredTest.java
assertEquals("An error occurred during the deferred computation.", e.getMessage()); } } // ============================================================ // Edge case tests for timeout handling // ============================================================ @Test public void test_getResponseTimeout() throws Exception {
Created: Fri Apr 17 09:08:13 GMT 2026 - Last Modified: Sun Feb 01 12:48:24 GMT 2026 - 21.1K bytes - Click Count (0)