- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,407 for distances (0.18 sec)
-
releasenotes/notes/update-se-instances.yaml
dwq <******@****.***> 1656083735 +0800
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Jun 24 15:15:35 UTC 2022 - 163 bytes - Viewed (0) -
src/internal/trace/traceviewer/static/trace_viewer_full.html
for(var j=0;j<columnCount;j++) distances[0][j]=j;for(i=1;i<rowCount;i++){for(j=1;j<columnCount;j++){if(this.equals(current[currentStart+j-1],old[oldStart+i-1])) distances[i][j]=distances[i-1][j-1];else{var north=distances[i-1][j]+1;var west=distances[i][j-1]+1;distances[i][j]=north<west?north:west;}}}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 20:45:06 UTC 2023 - 2.5M bytes - Viewed (1) -
guava/src/com/google/common/collect/DiscreteDomain.java
} /** * Returns, conceptually, "origin + distance", or equivalently, the result of calling {@link * #next} on {@code origin} {@code distance} times. */ C offset(C origin, long distance) { C current = origin; checkNonnegative(distance, "distance"); for (long i = 0; i < distance; i++) { current = next(current); if (current == null) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DiscreteDomain.java
} /** * Returns, conceptually, "origin + distance", or equivalently, the result of calling {@link * #next} on {@code origin} {@code distance} times. */ C offset(C origin, long distance) { C current = origin; checkNonnegative(distance, "distance"); for (long i = 0; i < distance; i++) { current = next(current); if (current == null) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
} /** * A builder for creating {@link ImmutableValueGraph} instances, especially {@code static final} * graphs. Example: * * <pre>{@code * static final ImmutableValueGraph<City, Distance> CITY_ROAD_DISTANCE_GRAPH = * ValueGraphBuilder.undirected() * .<City, Distance>immutable() * .putEdgeValue(PARIS, BERLIN, kilometers(1060))
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableValueGraph.java
} /** * A builder for creating {@link ImmutableValueGraph} instances, especially {@code static final} * graphs. Example: * * <pre>{@code * static final ImmutableValueGraph<City, Distance> CITY_ROAD_DISTANCE_GRAPH = * ValueGraphBuilder.undirected() * .<City, Distance>immutable() * .putEdgeValue(PARIS, BERLIN, kilometers(1060))
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
/** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Bytes.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 14.9K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Bytes.java
/** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Bytes.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.java
/** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 19.9K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Booleans.java
/** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 19.9K bytes - Viewed (0)