- Sort Score
- Result 10 results
- Languages All
Results 191 - 200 of 275 for Chains (1.27 sec)
-
src/main/java/jcifs/internal/smb1/com/SmbComWriteAndX.java
* @param b the data buffer containing bytes to write * @param off the offset in the buffer where data starts * @param len the number of bytes to write * @param andx the next command in the AndX chain, or null */ public SmbComWriteAndX(final Configuration config, final int fid, final long offset, final int remaining, final byte[] b, final int off, final int len, final ServerMessageBlock andx) {Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 6.1K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/com/SmbComOpenAndX.java
* @param access the desired access mode * @param shareAccess the share access mode * @param flags the open flags * @param fileAttributes the file attributes * @param andx the next command in the chain */ public SmbComOpenAndX(final Configuration config, final String fileName, final int access, final int shareAccess, final int flags, final int fileAttributes, final ServerMessageBlock andx) {Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 7.3K bytes - Viewed (0) -
src/test/java/jcifs/SmbTreeTest.java
/** * Test for unwrap with nested wrapping. * Verifies that unwrap works correctly with multiple levels of wrapping. */ @Test void testUnwrap_nestedWrapping() { // Create a chain of wrapped trees CustomSmbTree innerTree = mock(CustomSmbTree.class); ExtendedSmbTree middleTree = mock(ExtendedSmbTree.class); when(smbTree.unwrap(ExtendedSmbTree.class)).thenReturn(middleTree);Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 9.2K bytes - Viewed (0) -
fess-crawler/src/test/java/org/codelibs/fess/crawler/transformer/TransformerTest.java
assertEquals(threadCount * operationsPerThread, transformer.getGetDataCallCount()); } /** * Test transformer chain */ public void test_transformerChain() { // Create chain of transformers List<Transformer> transformerChain = new ArrayList<>(); transformerChain.add(new TestTransformer("first"));
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sat Sep 06 04:15:37 UTC 2025 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
if (lastEntryIndex == -1) { // we need to update the root link from table[] tableSet(table, tableIndex, newNext); } else { // we need to update the link from the chain entries[lastEntryIndex] = maskCombine(entries[lastEntryIndex], newNext, mask); } return entryIndex; } lastEntryIndex = entryIndex; next = getNext(entry, mask);
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 7K bytes - Viewed (0) -
docs/contribute/concurrency.md
#### Shared reader thread
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Sun Feb 06 16:35:36 UTC 2022 - 7K bytes - Viewed (0) -
chainable_api.go
tx = db.getInstance() tx.Statement.ColumnMapping = m return } // Where add conditions // // See the [docs] for details on the various formats that where clauses can take. By default, where clauses chain with AND. // // // Find the first user with name jinzhu // db.Where("name = ?", "jinzhu").First(&user) // // Find the first user with name jinzhu and age 20 // db.Where(&User{Name: "jinzhu", Age: 20}).First(&user)
Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Fri Sep 19 01:49:06 UTC 2025 - 14.8K bytes - Viewed (0) -
okhttp/api/android/okhttp.api
public abstract fun withConnectTimeout (ILjava/util/concurrent/TimeUnit;)Lokhttp3/Interceptor$Chain; public abstract fun withReadTimeout (ILjava/util/concurrent/TimeUnit;)Lokhttp3/Interceptor$Chain; public abstract fun withWriteTimeout (ILjava/util/concurrent/TimeUnit;)Lokhttp3/Interceptor$Chain; public abstract fun writeTimeoutMillis ()I } public final class okhttp3/Interceptor$Companion {
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Wed Nov 05 18:28:35 UTC 2025 - 70.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
if (lastEntryIndex == -1) { // we need to update the root link from table[] tableSet(table, tableIndex, newNext); } else { // we need to update the link from the chain entries[lastEntryIndex] = maskCombine(entries[lastEntryIndex], newNext, mask); } return entryIndex; } lastEntryIndex = entryIndex; next = getNext(entry, mask);
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
InternalEntry<Object, Object, ?> entry = null; for (int i = 0; i < originalCount; i++) { Object key = new Object(); Object value = new Object(); int hash = map.hash(key); // chain all entries together as we only have a single bucket entry = segment.newEntryForTesting(key, hash, entry); segment.setValueForTesting(entry, value); } segment.setTableEntryForTesting(0, entry);
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Dec 11 20:07:52 UTC 2025 - 35.5K bytes - Viewed (0)