- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 29 for adjacent (0.23 sec)
-
android/guava/src/com/google/common/graph/NetworkConnections.java
import com.google.errorprone.annotations.CanIgnoreReturnValue; import java.util.Set; import javax.annotation.CheckForNull; /** * 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 */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/IncidentEdgeSet.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
okhttp-idna-mapping-table/src/main/kotlin/okhttp3/internal/idn/MappingTables.kt
} } for (sectionList in result.values) { mergeAdjacentDeltaMappedRanges(sectionList) } return result.toMap() } /** * Modifies [ranges] to combine any adjacent [MappedRange.InlineDelta] of same size to single entry. * @returns same instance of [ranges] for convenience */ internal fun mergeAdjacentDeltaMappedRanges(ranges: MutableList<MappedRange>): MutableList<MappedRange> {
Plain Text - Registered: Fri Apr 26 11:42:10 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/RangeTest.java
try { range.intersection(Range.closed(0, 2)); fail(); } catch (IllegalArgumentException expected) { assertThat(expected).hasMessageThat().contains("connected"); } // adjacent below assertEquals(Range.closedOpen(4, 4), range.intersection(Range.closedOpen(2, 4))); // overlap below assertEquals(Range.closed(4, 6), range.intersection(Range.closed(2, 6)));
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 24.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/RangeTest.java
try { range.intersection(Range.closed(0, 2)); fail(); } catch (IllegalArgumentException expected) { assertThat(expected).hasMessageThat().contains("connected"); } // adjacent below assertEquals(Range.closedOpen(4, 4), range.intersection(Range.closedOpen(2, 4))); // overlap below assertEquals(Range.closed(4, 6), range.intersection(Range.closed(2, 6)));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 24.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
private Graphs() {} // Graph query methods /** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableRangeSet.java
* and will be merged, but overlapping ranges will cause an exception when {@link #build()} is * called. */ @CanIgnoreReturnValue public Builder<C> addAll(RangeSet<C> ranges) { return addAll(ranges.asRanges()); } /** * Add all of the specified ranges to this builder. Adjacent ranges are permitted and will be
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 26.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
* and will be merged, but overlapping ranges will cause an exception when {@link #build()} is * called. */ @CanIgnoreReturnValue public Builder<C> addAll(RangeSet<C> ranges) { return addAll(ranges.asRanges()); } /** * Add all of the specified ranges to this builder. Adjacent ranges are permitted and will be
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 27.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
return nodeU; } /** * Returns the node {@link #adjacentNode(Object) adjacent} to {@link #nodeU()} along the origin * edge. If this {@link EndpointPair} {@link #isOrdered()}, this is equal to {@link #target()}. */ public final N nodeV() { return nodeV; } /** * Returns the node that is adjacent to {@code node} along the origin edge. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
import com.google.errorprone.annotations.CanIgnoreReturnValue; import java.util.Iterator; import java.util.Set; import javax.annotation.CheckForNull; /** * An interface for representing and manipulating an origin node's adjacent nodes and edge values in * a {@link Graph}. * * @author James Sexton * @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault interface GraphConnections<N, V> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0)