- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 1,407 for distances (0.15 sec)
-
src/cmd/vendor/golang.org/x/text/language/tables.go
15: {want: 0x71, have: 0x3e2, distance: 0xa, oneway: true}, 16: {want: 0x75, have: 0x139, distance: 0xa, oneway: true}, 17: {want: 0x82, have: 0x1be, distance: 0xa, oneway: true}, 18: {want: 0xa5, have: 0x139, distance: 0xa, oneway: true}, 19: {want: 0xb2, have: 0x15e, distance: 0xa, oneway: true}, 20: {want: 0xdd, have: 0x153, distance: 0xa, oneway: true},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 14.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.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(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <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 - 23.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Chars.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(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <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 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
* 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(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <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 - 25.1K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Shorts.java
* 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(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <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 - 25.1K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/model/internal/registry/ModelPathSuggestionProvider.java
private final int distance; private final ModelPath path; private Suggestion(int distance, ModelPath path) { this.distance = distance; this.path = path; } @Override public int compareTo(Suggestion o) { int distanceDifference = distance - o.distance; if (distanceDifference == 0) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* 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(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 15:43:06 UTC 2024 - 25.2K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Floats.java
* 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(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 15:43:06 UTC 2024 - 25.2K bytes - Viewed (0) -
src/sort/example_keys_test.go
return p1.mass < p2.mass } distance := func(p1, p2 *Planet) bool { return p1.distance < p2.distance } decreasingDistance := func(p1, p2 *Planet) bool { return distance(p2, p1) } // Sort the planets by the various criteria. By(name).Sort(planets) fmt.Println("By name:", planets) By(mass).Sort(planets) fmt.Println("By mass:", planets) By(distance).Sort(planets)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 25 20:48:39 UTC 2017 - 2.7K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/entity/GeoInfoTest.java
request.setParameter("geo.location.1.distance", "10km"); request.setParameter("geo.location.2.point", "35,151"); request.setParameter("geo.location.2.distance", "1km"); final GeoInfo geoInfo = new GeoInfo(request); String result =
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 2.9K bytes - Viewed (0)