- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 435 for enough (0.1 sec)
-
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* * <p>Note that {@code toArray(new Object[0])} is identical in function to {@code toArray()}. * * @param a the array into which the elements of the queue are to be stored, if it is big enough; * otherwise, a new array of the same runtime type is allocated for this purpose * @return an array containing all of the elements in this queue
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 22.5K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
// Update the vector with information from `input_tensors` if provided. if (input_tensors != nullptr) { // Note that we take the address of the elements in `all_input_tensors` // below. Allocate enough space so that no reallocation happens, which will // make the pointers invalid. all_input_tensors.reserve(num_inputs); for (int i = 0; i < num_inputs; ++i) { if (input_tensors[i] == nullptr) continue;
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 16:27:48 UTC 2024 - 29.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/ExecutionSequencerTest.java
} }, directExecutor())); thingToCancel[0] = serializer.submit(Callables.returning(null), directExecutor()); results.add(thingToCancel[0]); // Enqueue more than enough tasks to force reentrancy. for (int i = 0; i < 5; i++) { results.add(serializer.submit(Callables.returning(null), directExecutor())); } manualExecutorTask[0].run();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 22:10:29 UTC 2024 - 16.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
sort( insertionOrder, new Comparator<V>() { @Override public int compare(V left, V right) { // The indexes are small enough for the subtraction trick to be safe. return indexOfEntryWithValue(left) - indexOfEntryWithValue(right); } int indexOfEntryWithValue(V value) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 18.2K bytes - Viewed (0) -
android/pom.xml
tests themselves and not the code being tested that needs that access, though there's no obvious way to ensure that. We could consider arranging things so that only the tests we know need this would get the add-opens. Right now that doesn't seem worth the effort, though. --> <test.add.opens> --add-opens java.base/java.lang=ALL-UNNAMED
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:51:04 UTC 2024 - 21K bytes - Viewed (0) -
pom.xml
tests themselves and not the code being tested that needs that access, though there's no obvious way to ensure that. We could consider arranging things so that only the tests we know need this would get the add-opens. Right now that doesn't seem worth the effort, though. --> <test.add.opens> --add-opens java.base/java.lang=ALL-UNNAMED
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:51:04 UTC 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* <p>This behavior can't be broadly guaranteed, but has been tested with OpenJDK 1.7 and 1.8. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty hash set with enough capacity to hold {@code expectedSize} elements * without resizing * @throws IllegalArgumentException if {@code expectedSize} is negative */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 21 14:28:19 UTC 2024 - 78.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* test. This must return an Iterator that returns the expected elements passed to the constructor * in the given order. Warning: it is not enough to simply pull multiple iterators from the same * source Iterable, unless that Iterator is unmodifiable. */ protected abstract I newTargetIterator(); /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* data using an unpredictable seed should normally be enough to thwart this attack. * * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes * indexes} is generally less than the total time taken to compute each of them separately, and * sometimes much less. For example, on a large enough dataset, computing the 90th and 99th
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedListMultimap.java
LinkedListMultimap<K, V> create() { return new LinkedListMultimap<>(); } /** * Constructs an empty {@code LinkedListMultimap} with enough capacity to hold the specified * number of keys without rehashing. * * @param expectedKeys the expected number of distinct keys * @throws IllegalArgumentException if {@code expectedKeys} is negative */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 27.5K bytes - Viewed (0)