- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 19 for adjacent (0.2 sec)
-
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 May 03 11:42:14 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 May 03 12:43:13 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) -
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 May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.2K 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) -
android/guava/src/com/google/common/graph/BaseGraph.java
* </ul> * * @throws IllegalArgumentException if {@code node} is not an element of this graph */ Set<N> adjacentNodes(N node); /** * Returns a live view of all nodes in this graph adjacent to {@code node} which can be reached by * traversing {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* * @throws IllegalArgumentException if {@code node} is not an element of this graph */ @Override Set<N> adjacentNodes(N node); /** * Returns a live view of all nodes in this graph adjacent to {@code node} which can be reached by * traversing {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* </ul> * * @throws IllegalArgumentException if {@code node} is not an element of this network */ Set<N> adjacentNodes(N node); /** * Returns a live view of all nodes in this network adjacent to {@code node} which can be reached * by traversing {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>In an undirected network, this is equivalent to {@link #adjacentNodes(Object)}.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* * @throws IllegalArgumentException if {@code node} is not an element of this graph */ @Override Set<N> adjacentNodes(N node); /** * Returns a live view of all nodes in this graph adjacent to {@code node} which can be reached by * traversing {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge. * * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0)