- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 1,407 for distances (0.28 sec)
-
platforms/jvm/jacoco/src/integTest/groovy/org/gradle/testing/jacoco/plugins/JacocoTestRelocationIntegrationTest.groovy
def distance = levenshteinDistance(originalBytes, movedBytes) println String.format("Levenshtein distance if %s (%.2f%% difference)", distance, 100d * distance / length) // We are okay with 2% distance if (distance > length * 0.02) { // If we had too big a difference we fall back to Groovy reporting it
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 14 16:03:36 UTC 2023 - 2.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Ints.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(Ints.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 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.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 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 - 27.1K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Doubles.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 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 - 27.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.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(Longs.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 - 28.7K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Longs.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(Longs.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 - 28.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.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(Ints.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 - 29.7K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/img/nativeDependents.graphml
<y:LabelModel> <y:SmartNodeLabelModel distance="4.0"/> </y:LabelModel> <y:ModelParameter>
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 15.7K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/entity/GeoInfo.java
if (key.startsWith("geo." + geoField + ".")) { final String distanceKey = key.replaceFirst(".point$", ".distance"); final String distance = request.getParameter(distanceKey); if (StringUtil.isNotBlank(distance)) { StreamUtil.stream(e.getValue()).of(s -> s.forEach(pt -> {
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 4.7K bytes - Viewed (0) -
pilot/pkg/serviceregistry/serviceentry/store.go
all = append(all, instances...) } return all } func (s *serviceInstancesStore) getByKey(key instancesKey) []*model.ServiceInstance { all := make([]*model.ServiceInstance, 0, countSliceValue(s.instances[key])) for _, instances := range s.instances[key] { all = append(all, instances...) } return all } // deleteInstanceKeys deletes all instances with the given configKey and instanceKey
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 29 15:31:09 UTC 2024 - 6.1K bytes - Viewed (0)