- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 769 for distances (0.23 sec)
-
pkg/test/framework/components/echo/instances.go
sort.Stable(out) return out } // Copy this Instances array. func (i Instances) Copy() Instances { return append(Instances{}, i...) } // Append returns a new Instances array with the given values appended. func (i Instances) Append(instances Instances) Instances { return append(i.Copy(), instances...) } // Restart each Instance func (i Instances) Restart() error { g := multierror.Group{}
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 25 18:26:17 UTC 2024 - 4.7K bytes - Viewed (0) -
pkg/bootstrap/option/instances.go
Rama Chavali <******@****.***> 1715706158 +0530
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 14 17:02:38 UTC 2024 - 9K bytes - Viewed (0) -
maven-model-builder/src/test/resources/poms/depmgmt/root-distance.xml
Tamas Cservenak <******@****.***> 1706804704 +0100
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Feb 01 16:25:04 UTC 2024 - 1K bytes - Viewed (0) -
maven-model-builder/src/test/resources/poms/depmgmt/root-distance-explicit.xml
Tamas Cservenak <******@****.***> 1706804704 +0100
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Feb 01 16:25:04 UTC 2024 - 1.2K bytes - Viewed (0) -
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/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)