- Sort Score
- Num 10 results
- Language All
Results 371 - 380 of 870 for Order (0.03 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
* * <p>This class serializes execution of <i>submitted</i> tasks but not any <i>listeners</i> of * those tasks. * * <p>Submitted tasks have a happens-before order as defined in the Java Language Specification. * Tasks execute with the same happens-before order that the function calls to {@link #submit} and * {@link #submitAsync} that submitted those tasks had. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 23 01:35:55 GMT 2025 - 22.1K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}. * * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion * order. Any removal invalidates any ordering guarantees. * * <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 24.7K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
policy, CycleDetectingLockFactory.createNodes(enumClass)); } public void testDeadlock_twoLocks() { // Establish an acquisition order of lockA -> lockB. lockA.lock(); lockB.lock(); lockA.unlock(); lockB.unlock(); // The opposite order should fail (Policies.THROW). PotentialDeadlockException firstException = null; lockB.lock(); PotentialDeadlockException expected =
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 16.3K bytes - Click Count (0) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
policy, CycleDetectingLockFactory.createNodes(enumClass)); } public void testDeadlock_twoLocks() { // Establish an acquisition order of lockA -> lockB. lockA.lock(); lockB.lock(); lockA.unlock(); lockB.unlock(); // The opposite order should fail (Policies.THROW). PotentialDeadlockException firstException = null; lockB.lock(); PotentialDeadlockException expected =
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 16.3K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/opensearch/log/cbean/bs/BsClickLogCB.java
doColumn("urlId"); } public void columnDocId() { doColumn("docId"); } public void columnOrder() { doColumn("order"); } public void columnQueryId() { doColumn("queryId"); } public void columnQueryRequestedAt() { doColumn("queryRequestedAt"); }
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 15 06:53:53 GMT 2025 - 7K bytes - Click Count (0) -
src/main/webapp/WEB-INF/view/searchResults.jsp
data-id="${doc.doc_id}" data-order="${s.index}">${doc.content_title}</a> </h3> <div class="body"> <c:if test="${thumbnailSupport && !empty doc.thumbnail}"> <div class="me-3"> <a class="link d-none d-sm-flex" href="${doc.url_link}" data-uri="${doc.url_link}" data-id="${doc.doc_id}" data-order="${s.index}" > <img src="${fe:url('/images/blank.png')}" alt="thumbnail"Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Mon Feb 23 08:03:44 GMT 2026 - 12.2K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/Service.java
* invoked in the same order as the underlying service enters those states. Additionally, at most * one of the listener's callbacks will execute at once. However, multiple listeners' callbacks * may execute concurrently, and listeners may execute in an order different from the one in which * they were registered. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 10.8K bytes - Click Count (0) -
guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
Comparator<byte[]> comparator2 = UnsignedBytes.lexicographicalComparatorJavaImpl(); /* * These arrays are set up to test that the comparator compares bytes within a word in the * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first * array has a smaller element at one index, and then the second array has a smaller element at * the next. */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Mar 08 01:43:32 GMT 2026 - 14K bytes - Click Count (0) -
guava/src/com/google/common/collect/ReverseNaturalOrdering.java
import com.google.common.annotations.GwtIncompatible; import com.google.common.annotations.J2ktIncompatible; import java.io.Serializable; import java.util.Iterator; /** An ordering that uses the reverse of the natural order of the values. */ @GwtCompatible final class ReverseNaturalOrdering extends Ordering<Comparable<?>> implements Serializable { static final ReverseNaturalOrdering INSTANCE = new ReverseNaturalOrdering(); @Override
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Jun 04 13:03:16 GMT 2025 - 3K bytes - Click Count (0) -
src/main/java/jcifs/smb1/util/MD4.java
* time of the invocation of this call. */ @Override public void engineReset() { // initial values of MD4 i.e. A, B, C, D // as per rfc-1320; they are low-order byte first context[0] = 0x67452301; context[1] = 0xEFCDAB89; context[2] = 0x98BADCFE; context[3] = 0x10325476; count = 0L; for (int i = 0; i < BLOCK_LENGTH; i++) {Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 9.6K bytes - Click Count (0)