- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for grand (0.26 sec)
-
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} /** Returns the minimum child or {@code -1} if no child exists. */ int findMinChild(int index) { return findMin(getLeftChildIndex(index), 2); } /** Returns the minimum grand child or -1 if no grand child exists. */ int findMinGrandChild(int index) { int leftChildIndex = getLeftChildIndex(index); if (leftChildIndex < 0) { return -1; }
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-tests/test/com/google/common/io/ByteStreamsTest.java
assertEquals(bytes[1], actual[3]); } public void testNewDataInput_readLine() { ByteArrayDataInput in = ByteStreams.newDataInput( "This is a line\r\nThis too\rand this\nand also this".getBytes(Charsets.UTF_8)); assertEquals("This is a line", in.readLine()); assertEquals("This too", in.readLine()); assertEquals("and this", in.readLine());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/CharMatcherBenchmark.java
for (int n = 0; n < length; n++) { builder.append( randomCharFrom(list.get(n) >= threshold ? NONMATCHING_CHARS : matchingChars, rand)); } return builder.toString(); } private static char randomCharFrom(String s, Random rand) { return s.charAt(rand.nextInt(s.length())); } /** * Provides samples on a random distribution derived from the web. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 194.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/IntMathTest.java
for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); } } private static int force32(int value) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits(); for (int i = 0; i < keyBits; i++) { int[] same = new int[hashBits]; int[] diff = new int[hashBits]; // go through trials to compute probability for (int j = 0; j < trials; j++) { int key1 = rand.nextInt(); // flip input bit for key2
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
Random rand = new Random(1); for (int bits = 10; bits < 63; bits++) { for (int i = 0; i < 100; i++) { long p = BigInteger.probablePrime(bits, rand).longValue(); assertTrue(LongMath.isPrime(p)); } } } @GwtIncompatible // isPrime is GWT-incompatible public void testIsPrimeOnRandomComposites() { Random rand = new Random(1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/CharMatcherTest.java
assertTrue(len4.matches('d')); for (char c = 'e'; c < 'z'; c++) { assertFalse(len4.matches(c)); } Random rand = new Random(1234); for (int testCase = 0; testCase < 100; testCase++) { char[] chars = randomChars(rand, rand.nextInt(63) + 1); CharMatcher m = SmallCharMatcher.from(bitSet(chars), new String(chars)); checkExactMatches(m, chars); } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 18:32:41 GMT 2024 - 30.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/CharMatcherTest.java
assertTrue(len4.matches('d')); for (char c = 'e'; c < 'z'; c++) { assertFalse(len4.matches(c)); } Random rand = new Random(1234); for (int testCase = 0; testCase < 100; testCase++) { char[] chars = randomChars(rand, rand.nextInt(63) + 1); CharMatcher m = SmallCharMatcher.from(bitSet(chars), new String(chars)); checkExactMatches(m, chars); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 18:32:41 GMT 2024 - 30.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); } } private static int force32(int value) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/CharMatcherBenchmark.java
for (int n = 0; n < length; n++) { builder.append( randomCharFrom(list.get(n) >= threshold ? NONMATCHING_CHARS : matchingChars, rand)); } return builder.toString(); } private static char randomCharFrom(String s, Random rand) { return s.charAt(rand.nextInt(s.length())); } /** * Provides samples on a random distribution derived from the web. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 194.8K bytes - Viewed (0)