- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 28 for linaro (0.21 sec)
-
android/guava/src/com/google/common/math/Quantiles.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
// BigInteger.gcd is consistent with this decision. return b; } else if (b == 0) { return a; // similar logic } /* * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm. This is * >60% faster than the Euclidean algorithm in benchmarks. */ int aTwos = Long.numberOfTrailingZeros(a); a >>= aTwos; // divide out all 2s
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
} return false; } @Override public int hashCode() { return Arrays.hashCode(functions); } } /** * Linear CongruentialGenerator to use for consistent hashing. See * http://en.wikipedia.org/wiki/Linear_congruential_generator */ private static final class LinearCongruentialGenerator { private long state; public LinearCongruentialGenerator(long seed) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
* equivalently, if this inverse view contains a key that is equal to {@code value}). * * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
* equivalently, if this inverse view contains a key that is equal to {@code value}). * * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
return entry2.getCount() - entry1.getCount(); // subtracting two nonnegative integers } } /** * An {@link AbstractMultiset} with additional default implementations, some of them linear-time * implementations in terms of {@code elementSet} and {@code entrySet}. */ private abstract static class ViewMultiset<E extends @Nullable Object> extends AbstractMultiset<E> { @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedLists.java
@ParametricNullness E key, List<? extends E> list, int foundIndex) { // Of course, we have to use binary search to find the precise // breakpoint... int lower = 0; int upper = foundIndex; // Of course, we have to use binary search to find the precise breakpoint... // Everything between lower and upper inclusive compares at <= 0. while (lower < upper) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
} return this; } /** * Adds each member of {@code elements} as a candidate for the top {@code k} elements. This * operation takes amortized linear time in the length of {@code elements}. * * <p>If all input data to this {@code TopKSelector} is in a single {@code Iterable}, prefer
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/src/com/google/common/collect/ImmutableSet.java
private static final int CUTOFF = (int) (MAX_TABLE_SIZE * DESIRED_LOAD_FACTOR); /** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. Always returns at least setSize + 2. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava/src/com/google/common/io/BaseEncoding.java
import java.io.Reader; import java.io.Writer; import java.util.Arrays; import java.util.Objects; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A binary encoding scheme for reversibly translating between byte sequences and printable ASCII * strings. This class includes several constants for encoding schemes specified by <a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Mar 15 16:33:32 GMT 2024 - 41.7K bytes - Viewed (0)