- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for bigener (0.21 sec)
-
guava-tests/test/com/google/common/collect/ListsTest.java
ArrayList<Integer> list = Lists.newArrayListWithCapacity(0); assertEquals(Collections.emptyList(), list); ArrayList<Integer> bigger = Lists.newArrayListWithCapacity(256); assertEquals(Collections.emptyList(), bigger); } public void testNewArrayListWithCapacity_negative() { try { Lists.newArrayListWithCapacity(-1); fail();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
assertTrue(BloomFilter.optimalNumOfBits(random.nextInt(1 << 16), random.nextDouble()) >= 0); } // and some crazy values (this used to be capped to Integer.MAX_VALUE, now it can go bigger assertEquals(3327428144502L, BloomFilter.optimalNumOfBits(Integer.MAX_VALUE, Double.MIN_VALUE)); IllegalArgumentException expected = assertThrows( IllegalArgumentException.class,
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableListTest.java
assertEquals( "Modifying the builder should not have changed any already" + " built sets", 216, webSafeColors.size()); assertEquals("the new array should be one bigger than webSafeColors", 217, addedColor.size()); Integer[] appendColorArray = addedColor.toArray(new Integer[addedColor.size()]); assertEquals(0x00BFFF, (int) appendColorArray[216]); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 23.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
|| !fitsInLong(BigIntegerMath.binomial(LongMath.biggestBinomials[k] + 1, k))); // In the first case, any long is valid; in the second, we want to test that the next-bigger // long overflows. } int k = LongMath.biggestBinomials.length; assertFalse(fitsInLong(BigIntegerMath.binomial(2 * k, k))); // 2 * k is the smallest value for which we don't replace k with (n-k).
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Files.java
* * @param file the file to read from * @return a byte array containing all the bytes from file * @throws IllegalArgumentException if the file is bigger than the largest possible byte array * (2^31 - 1) * @throws IOException if an I/O error occurs */ public static byte[] toByteArray(File file) throws IOException { return asByteSource(file).read();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 33.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
|| !fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k] + 1, k))); // In the first case, any int is valid; in the second, we want to test that the next-bigger // int overflows. } assertFalse( fitsInInt( BigIntegerMath.binomial( 2 * IntMath.biggestBinomials.length, IntMath.biggestBinomials.length))); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SetsTest.java
checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1))); checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1), set(3, num + 1))); // a bigger one checkHashCode( Sets.cartesianProduct(set(1, num, num + 1), set(2), set(3, num + 2), set(4, 5, 6, 7, 8))); } public void testPowerSetEmpty() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 47.9K bytes - Viewed (1) -
android/guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java
} // A random value that cannot be 0 and that is unsigned-less-than or equal // to the given dividend, so that we don't have half of our divisions being // trivial because the divisor is bigger than the dividend. // Using remainder here does not give us a uniform distribution but it should // not have a big impact on the measurement. private static long randomDivisor(long dividend) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableListTest.java
assertEquals( "Modifying the builder should not have changed any already" + " built sets", 216, webSafeColors.size()); assertEquals("the new array should be one bigger than webSafeColors", 217, addedColor.size()); Integer[] appendColorArray = addedColor.toArray(new Integer[addedColor.size()]); assertEquals(0x00BFFF, (int) appendColorArray[216]); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 23.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
|| !fitsInLong(BigIntegerMath.binomial(LongMath.biggestBinomials[k] + 1, k))); // In the first case, any long is valid; in the second, we want to test that the next-bigger // long overflows. } int k = LongMath.biggestBinomials.length; assertFalse(fitsInLong(BigIntegerMath.binomial(2 * k, k))); // 2 * k is the smallest value for which we don't replace k with (n-k).
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0)