- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 470 for taip (0.06 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
guava/src/com/google/common/collect/LinkedListMultimap.java
if (head == null) { // empty list head = tail = node; keyToKeyList.put(key, new KeyList<K, V>(node)); modCount++; } else if (nextSibling == null) { // non-empty list, add to tail // requireNonNull is safe because the list is non-empty. requireNonNull(tail).next = node; node.previous = tail; tail = node; KeyList<K, V> keyList = keyToKeyList.get(key);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 27K bytes - Click Count (0) -
src/test/java/jcifs/smb1/dcerpc/ndr/NdrHyperTest.java
*/ @ExtendWith(MockitoExtension.class) public class NdrHyperTest { /** * Tests a simple round‑trip encode → decode retains the original value. */ @Test @DisplayName("Basic round‑trip for a fixed value") public void testEncodeRoundTrip() throws NdrException { final long original = 0x1122334455667788L; NdrHyper hyper = new NdrHyper(original);Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 4.3K bytes - Click Count (0) -
src/test/java/jcifs/util/SmbCircuitBreakerTest.java
long initialTime = circuitBreaker.getTimeSinceLastStateChange(); assertTrue(initialTime >= 0, "Should have initial timestamp"); // Trip circuit circuitBreaker.trip(); Thread.sleep(100); long afterTripTime = circuitBreaker.getTimeSinceLastStateChange(); assertTrue(afterTripTime >= 100, "Time should have advanced");
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 30 05:58:03 GMT 2025 - 23.2K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/ExecutionListBenchmark.java
RunnableExecutorPair newTail = new RunnableExecutorPair(runnable, executor); if (head == null) { head = newTail; tail = newTail; } else { tail.next = newTail; tail = newTail; } return; } } executeListener(runnable, executor); } void execute() { RunnableExecutorPair list;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Jul 16 17:42:14 GMT 2025 - 15.8K bytes - Click Count (0) -
src/test/java/jcifs/spnego/NegTokenInitTest.java
assertArrayEquals(mechs, parsed.getMechanisms(), "Mechanism OIDs should round-trip"); assertEquals(flags, parsed.getContextFlags(), "Flags should round-trip"); assertArrayEquals(mechToken, parsed.getMechanismToken(), "Mechanism token should round-trip"); assertArrayEquals(mic, parsed.getMechanismListMIC(), "MIC should round-trip"); assertTrue(parsed.getContextFlag(NegTokenInit.DELEGATION));Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 21K bytes - Click Count (0) -
docs/tr/docs/deployment/versions.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 07:53:17 GMT 2026 - 3.8K bytes - Click Count (0) -
android/guava/src/com/google/common/cache/ReferenceEntry.java
/** Returns the key for this entry. */ @Nullable K getKey(); /* * Used by entries that use access order. Access entries are maintained in a doubly-linked list. * New entries are added at the tail of the list at write time; stale entries are expired from * the head of the list. */ /** Returns the time that this entry was last accessed, in ns. */ @SuppressWarnings("GoodTime") long getAccessTime();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 13:13:59 GMT 2026 - 3.5K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/ndr/NdrShortTest.java
assertEquals(largeValue, ndrShort.value); } } @Nested @DisplayName("Round-trip Tests") class RoundTripTests { @Test @DisplayName("Should handle encode-decode round-trip correctly") void testEncodeDecodeRoundTrip() throws NdrException { // Given: Original value that fits in byte range
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 11.2K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 22.4K bytes - Click Count (0) -
ci/official/utilities/rename_and_verify_wheels.sh
# List all .whl files by their modification time (ls -t) and move anything # other than the most recently-modified one (the newest one). mkdir -p $TFCI_OUTPUT_DIR/extra_wheels ls -t *.whl | tail -n +2 | xargs mv -t $TFCI_OUTPUT_DIR/extra_wheels fi # Repair wheels with auditwheel and delete the old one. if [[ "$TFCI_WHL_AUDIT_ENABLE" == "1" ]]; then
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Sep 22 21:39:32 GMT 2025 - 4.4K bytes - Click Count (0)