- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for Workers (0.17 sec)
-
android/guava/src/com/google/common/util/concurrent/SequentialExecutor.java
/** * This counter prevents an ABA issue where a thread may successfully schedule the worker, the * worker runs and exhausts the queue, another thread enqueues a task and fails to schedule the * worker, and then the first thread's call to delegate.execute() returns. Without this counter, * it would observe the QUEUING state and set it to QUEUED, and the worker would never be * scheduled again for future submissions. */ @GuardedBy("queue")
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
} final transient Comparator<? super E> comparator; ImmutableSortedSet(Comparator<? super E> comparator) { this.comparator = comparator; } /** * Returns the comparator that orders the elements, which is {@link Ordering#natural()} when the * natural ordering of the elements is used. Note that its behavior is not consistent with {@link
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/Helpers.java
* </ul> */ public static <T extends @Nullable Object> void testComparator( Comparator<? super T> comparator, List<T> valuesInExpectedOrder) { // This does an O(n^2) test of all pairs of values in both orders for (int i = 0; i < valuesInExpectedOrder.size(); i++) { T t = valuesInExpectedOrder.get(i); for (int j = 0; j < i; j++) { T lesser = valuesInExpectedOrder.get(j); assertTrue(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 17.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetOperationsTest.java
@Override protected Set<String> create(String[] elements) { checkArgument(elements.length == 3); // Put the sets in different orders for the hell of it return Sets.union( Sets.newLinkedHashSet(asList(elements)), Sets.newLinkedHashSet(asList(elements[1], elements[0], elements[2])));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableTable.java
* ordering of all views in the returned table. Note that some views of the original table and the * copied table may have different iteration orders. For more control over the ordering, create a * {@link Builder} and call {@link Builder#orderRowsBy}, {@link Builder#orderColumnsBy}, and * {@link Builder#putAll} *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 17.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
} final transient Comparator<? super E> comparator; ImmutableSortedSet(Comparator<? super E> comparator) { this.comparator = comparator; } /** * Returns the comparator that orders the elements, which is {@link Ordering#natural()} when the * natural ordering of the elements is used. Note that its behavior is not consistent with {@link
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
} /** * Creates an empty {@code TreeBasedTable} that is ordered by the specified comparators. * * @param rowComparator the comparator that orders the row keys * @param columnComparator the comparator that orders the column keys */ public static <R, C, V> TreeBasedTable<R, C, V> create( Comparator<? super R> rowComparator, Comparator<? super C> columnComparator) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
return least(k, comparator.reversed()); } /** * Returns a comparator of {@link Optional} values which treats {@link Optional#empty} as less * than all other values, and orders the rest using {@code valueComparator} on the contained * value. * * @since 22.0 */ public static <T> Comparator<Optional<T>> emptiesFirst(Comparator<? super T> valueComparator) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 10.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SetOperationsTest.java
@Override protected Set<String> create(String[] elements) { checkArgument(elements.length == 3); // Put the sets in different orders for the hell of it return Sets.union( Sets.newLinkedHashSet(asList(elements)), Sets.newLinkedHashSet(asList(elements[1], elements[0], elements[2])));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/net/HttpHeaders.java
public static final String UNSAFE_URL = "unsafe-url"; } /** * The HTTP <a href="https://www.w3.org/TR/service-workers/#update-algorithm">{@code * Service-Worker}</a> header field name. * * @since 20.0 */ public static final String SERVICE_WORKER = "Service-Worker"; /** The HTTP {@code TE} header field name. */ public static final String TE = "TE";
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:08:08 GMT 2024 - 34.3K bytes - Viewed (0)