- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 41 for up (0.14 sec)
-
.github/workflows/ci.yml
with: access_token: ${{ github.token }} - name: 'Check out repository' uses: actions/checkout@0ad4b8fadaa221de15dcec353f45205ec38ea70b # v4.1.4 - name: 'Set up JDK ${{ matrix.java }}' uses: actions/setup-java@99b8673ff64fbf99d8d325f52d9a5bdedb8483e9 # v4.2.1 with: java-version: ${{ matrix.java }} distribution: 'zulu' cache: 'maven'
Others - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:33:50 GMT 2024 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
* guaranteed to execute. There is no guarantee, however, that listeners will be executed in the * order that they are added. * * <p>Exceptions thrown by a listener will be propagated up to the executor. Any exception thrown * during {@code Executor.execute} (e.g., a {@code RejectedExecutionException} or an exception * thrown by {@linkplain MoreExecutors#directExecutor direct execution}) will be caught and logged. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* elements directly and null for empty positions, we store indices of the keys in the hash table, * and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. * * (The index actually stored is the index of the key in alternatingKeysAndValues, which is * double the index of the entry in entrySet.asList.) *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/SpliteratorTester.java
return split == null ? null : new GeneralSpliteratorOfPrimitive<>(split, consumerizer); } } /** * Different ways of decomposing a Spliterator, all of which must produce the same elements (up to * ordering, if Spliterator.ORDERED is not present). */ enum SpliteratorDecompositionStrategy { NO_SPLIT_FOR_EACH_REMAINING { @Override <E extends @Nullable Object> void forEach(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 18:19:31 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
node.thread = null; // mark as 'deleted' restart: while (true) { Waiter pred = null; Waiter curr = waiters; if (curr == Waiter.TOMBSTONE) { return; // give up if someone is calling complete } Waiter succ; while (curr != null) { succ = curr.next; if (curr.thread != null) { // we aren't unlinking this node, update pred. pred = curr;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
assertEquals((Integer) 2, it.next()); it.remove(); // After this remove, 400 has moved up and 20 down past cursor assertTrue("Heap is not intact after remove", mmHeap.isIntact()); assertEquals((Integer) 10, it.next()); assertEquals((Integer) 3, it.next()); it.remove(); // After this remove, 400 moved down again and 500 up past the cursor assertTrue("Heap is not intact after remove", mmHeap.isIntact());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Queues.java
* numElements} elements are not available, it will wait for them up to the specified timeout. * * @param q the blocking queue to be drained * @param buffer where to add the transferred elements * @param numElements the number of elements to be waited for * @param timeout how long to wait before giving up, in units of {@code unit}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 16K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
Arrays.sort(castBuffer, 0, bufferSize, comparator); if (bufferSize > k) { Arrays.fill(buffer, k, buffer.length, null); bufferSize = k; threshold = buffer[k - 1]; } // Up to bufferSize, all elements of buffer are real Ts (not null unless T includes null) T[] topK = Arrays.copyOf(castBuffer, bufferSize); // we have to support null elements, so no ImmutableList for us
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
*/ public static <E> ImmutableList<E> of( E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9, E e10, E e11) { return construct(e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11); } // These go up to eleven. After that, you just get the varargs form, and // whatever warnings might come along with it. :( /** * Returns an immutable list containing the given elements, in order. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/TreeMultiset.java
totalCount += count; return this; } AvlNode<E> add( Comparator<? super E> comparator, @ParametricNullness E e, int count, int[] result) { /* * It speeds things up considerably to unconditionally add count to totalCount here, * but that destroys failure atomicity in the case of count overflow. =( */ int cmp = comparator.compare(e, getElement()); if (cmp < 0) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0)