- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 34 for linaro (0.19 sec)
-
android/guava/src/com/google/common/math/PairedStats.java
return ensureInUnitRange(sumOfProductsOfDeltas / Math.sqrt(productOfSumsOfSquaresOfDeltas)); } /** * Returns a linear transformation giving the best fit to the data according to <a * href="http://mathworld.wolfram.com/LeastSquaresFitting.html">Ordinary Least Squares linear * regression</a> of {@code y} as a function of {@code x}. The count must be greater than one, and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.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 * >40% faster than the Euclidean algorithm in benchmarks. */ int aTwos = Integer.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 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* a b * / \ / \ * / \ / \ * c d e * \ / * \ / * f * }</pre> * * <p><b>Note on binary trees</b> * * <p>This method can be used to traverse over a binary tree. Given methods {@code * leftChild(node)} and {@code rightChild(node)}, this method can be called as * * <pre>{@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultisetTest.java
assertEquals(Integer.MAX_VALUE, ms.tailMultiset("a", CLOSED).size()); } @J2ktIncompatible @GwtIncompatible // reflection @AndroidIncompatible // Reflection bug, or actual binary compatibility problem? public void testElementSetBridgeMethods() { for (Method m : TreeMultiset.class.getMethods()) { if (m.getName().equals("elementSet") && m.getReturnType().equals(SortedSet.class)) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* </ul> * <li>another java.util.Set delegate implementation. In most modern JDKs, normal java.util hash * collections intelligently fall back to a binary search tree if hash table collisions are * detected. Rather than going to all the trouble of reimplementing this ourselves, we * simply switch over to use the JDK implementation wholesale if probable hash flooding is
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* {@link #poll} and {@link #remove()}) run in {@code O(log n) time}. * <li>The {@link #remove(Object)} and {@link #contains} operations require linear ({@code O(n)}) * time. * <li>If you only access one end of the queue, and don't use a maximum size, this class is * functionally equivalent to {@link PriorityQueue}, but significantly slower. * </ul> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
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) -
src/main/java/jcifs/smb/SID.java
} int type; String domainName = null; String acctName = null; String origin_server = null; CIFSContext origin_ctx = null; /** * Construct a SID from it's binary representation. * * * @param src * @param si */ public SID ( byte[] src, int si ) { this.revision = src[ si++ ]; this.sub_authority_count = src[ si++ ];
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 14.9K bytes - Viewed (0)