- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 692 for lift (0.16 sec)
-
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/KtSymbolByFirBuilder.kt
Plain Text - Registered: Fri Apr 26 08:18:10 GMT 2024 - Last Modified: Thu Mar 28 09:06:28 GMT 2024 - 32.4K bytes - Viewed (0) -
docs/metrics/prometheus/list.md
Harshavardhana <******@****.***> 1714082491 -0700
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 25 22:01:31 GMT 2024 - 43.4K bytes - Viewed (2) -
android/guava/src/com/google/common/collect/Ordering.java
// k is really large; just do a straightforward sorted-copy-and-sublist ArrayList<E> list = Lists.newArrayList(iterator); Collections.sort(list, this); if (list.size() > k) { list.subList(k, list.size()).clear(); } list.trimToSize(); return Collections.unmodifiableList(list); } else { TopKSelector<E> selector = TopKSelector.least(k, this);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultimapNaturalTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* the returned list is unspecified. * * <p>The returned list may have unexpected behavior if it contains {@code NaN}, or if {@code NaN} * is used as a parameter to any of its methods. * * <p>The returned list is serializable. * * @param backingArray the array to back the list * @return a list view of the array */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.java
* the returned list is unspecified. * * <p>The returned list may have unexpected behavior if it contains {@code NaN}, or if {@code NaN} * is used as a parameter to any of its methods. * * <p>The returned list is serializable. * * <p><b>Note:</b> when possible, you should represent your data as an {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 27.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
private void trim() { int left = 0; int right = 2 * k - 1; int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeMultimapNaturalTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
for (int trials = 10; trials-- > 0; ) { byte[] left = new byte[1 + rnd.nextInt(32)]; rnd.nextBytes(left); byte[] right = left.clone(); assertThat(comparator.compare(left, right)).isEqualTo(0); int i = rnd.nextInt(left.length); left[i] ^= (byte) (1 + rnd.nextInt(255)); assertThat(comparator.compare(left, right)).isNotEqualTo(0);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
return delegate.createArray(length); } @Override public Iterable<E> order(List<E> insertionOrder) { return delegate.order(insertionOrder); } @Override public SortedSet<E> create(Object... elements) { List<?> normalValues = (List<?>) Arrays.asList(elements); List<E> extremeValues = new ArrayList<>();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0)