- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,309 for Humbert (0.17 sec)
-
guava/src/com/google/common/base/Optional.java
* Optional<Number>} (where {@code Number} is the desired output type) solves the problem: * * <pre>{@code * Optional<Number> optionalInt = (Optional) getSomeOptionalInt(); * Number value = optionalInt.or(0.5); // fine * * FluentIterable<? extends Number> numbers = getSomeNumbers(); * Optional<Number> first = (Optional) numbers.first(); * Number value = first.or(0.5); // fine * }</pre>
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
BloomFilterStrategies.MURMUR128_MITZ_32); // Insert "numInsertions" even numbers into the BF. for (int i = 0; i < numInsertions * 2; i += 2) { bf.put(Integer.toString(i)); } assertApproximateElementCountGuess(bf, numInsertions); // Assert that the BF "might" have all of the even numbers. for (int i = 0; i < numInsertions * 2; i += 2) { assertTrue(bf.mightContain(Integer.toString(i)));
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) -
tests/test_tutorial/test_schema_extra_example/test_tutorial005_an.py
Python - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Sat Aug 26 18:03:13 GMT 2023 - 6.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
BloomFilterStrategies.MURMUR128_MITZ_32); // Insert "numInsertions" even numbers into the BF. for (int i = 0; i < numInsertions * 2; i += 2) { bf.put(Integer.toString(i)); } assertApproximateElementCountGuess(bf, numInsertions); // Assert that the BF "might" have all of the even numbers. for (int i = 0; i < numInsertions * 2; i += 2) { assertTrue(bf.mightContain(Integer.toString(i)));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
docs/erasure/README.md
MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives. Therefore, the number of drives you present must be a multiple of one of these numbers. Each object is written to a single erasure-coding set.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 4.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ArrayListMultimap.java
* numbers of keys and values without resizing. * * <p>This method will soon be deprecated in favor of {@code * MultimapBuilder.hashKeys(expectedKeys).arrayListValues(expectedValuesPerKey).build()}. * * @param expectedKeys the expected number of distinct keys * @param expectedValuesPerKey the expected average number of values per key
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 6.9K bytes - Viewed (0) -
tests/test_tutorial/test_schema_extra_example/test_tutorial005.py
Python - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Sat Aug 26 18:03:13 GMT 2023 - 6.7K bytes - Viewed (0) -
tests/test_tutorial/test_schema_extra_example/test_tutorial005_py310.py
Python - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Sat Aug 26 18:03:13 GMT 2023 - 6.8K bytes - Viewed (0) -
tests/test_tutorial/test_schema_extra_example/test_tutorial005_an_py310.py
Python - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Sat Aug 26 18:03:13 GMT 2023 - 6.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashMultimap.java
* keys and values without rehashing. * * <p>This method will soon be deprecated in favor of {@code * MultimapBuilder.hashKeys(expectedKeys).hashSetValues(expectedValuesPerKey).build()}. * * @param expectedKeys the expected number of distinct keys * @param expectedValuesPerKey the expected average number of values per key
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 5.9K bytes - Viewed (0)