Search Options

Results per page
Sort
Preferred Languages
Advance

Results 931 - 940 of 1,291 for current (0.04 sec)

  1. src/test/java/jcifs/netbios/NodeStatusResponseTest.java

            recordNameField.setAccessible(true);
            assertNotNull(recordNameField.get(response));
    
            // Verify macAddress is initialized with correct size
            Field macAddressField = NodeStatusResponse.class.getDeclaredField("macAddress");
            macAddressField.setAccessible(true);
            byte[] macAddress = (byte[]) macAddressField.get(response);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 19.3K bytes
    - Viewed (0)
  2. src/main/java/jcifs/internal/smb2/nego/EncryptionNegotiateContext.java

         */
        public static final int CIPHER_AES256_GCM = 0x4;
    
        private int[] ciphers;
    
        /**
         * Constructs an encryption negotiate context.
         *
         * @param config the configuration (currently unused)
         * @param ciphers array of encryption cipher IDs to negotiate
         */
        public EncryptionNegotiateContext(final Configuration config, final int ciphers[]) {
            this.ciphers = ciphers;
        }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 3.8K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/core/collection/MultiIterator.java

     * @param <E> the element type
     */
    public class MultiIterator<E> implements Iterator<E> {
    
        /** Array of {@link Iterator}s. */
        protected final Iterator<E>[] iterators;
    
        /** Index of the currently iterated {@link Iterator}. */
        protected int index;
    
        /**
         * Returns an {@link Iterable} that wraps a {@link MultiIterator} for use in a for-each statement.
         *
         * @param <E> the element type
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Thu Jun 19 09:12:22 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  4. src/test/java/jcifs/internal/smb2/lease/Smb2LeaseStateTest.java

    import org.junit.jupiter.api.DisplayName;
    import org.junit.jupiter.api.Test;
    
    @DisplayName("Smb2LeaseState Tests")
    class Smb2LeaseStateTest {
    
        @Test
        @DisplayName("Should define correct lease state constants")
        void testLeaseStateConstants() {
            assertEquals(0x00, Smb2LeaseState.SMB2_LEASE_NONE);
            assertEquals(0x01, Smb2LeaseState.SMB2_LEASE_READ_CACHING);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 21 00:16:17 UTC 2025
    - 5.2K bytes
    - Viewed (0)
  5. docs/features/caching.md

    Caching
    =======
    
    OkHttp implements an optional, off by default, Cache. OkHttp aims for RFC correct and
    pragmatic caching behaviour, following common real-world browser like Firefox/Chrome and 
    server behaviour when ambiguous.
    
    # Basic Usage
    
    ```kotlin
      private val client: OkHttpClient = OkHttpClient.Builder()
          .cache(Cache(
              directory = File(application.cacheDir, "http_cache"),
              // $0.05 worth of phone storage in 2020
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sun Feb 06 02:19:09 UTC 2022
    - 3.1K bytes
    - Viewed (0)
  6. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

            result *= i;
          }
          return BigInteger.valueOf(result);
        }
    
        /*
         * We want each multiplication to have both sides with approximately the same number of digits.
         * Currently, we just divide the range in half.
         */
        int mid = (n1 + n2) >>> 1;
        return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
      }
    
      @Benchmark
      int slowFactorial(int reps) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  7. docs/ftp/README.md

    # MinIO FTP/SFTP Server
    
    MinIO natively supports FTP/SFTP protocol, this allows any ftp/sftp client to upload and download files.
    
    Currently supported `FTP/SFTP` operations are as follows:
    
    | ftp-client commands | supported |
    |:-------------------:|:----------|
    | get                 | yes       |
    | put                 | yes       |
    | ls                  | yes       |
    | mkdir               | yes       |
    | rmdir               | yes       |
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue May 07 06:41:25 UTC 2024
    - 7.8K bytes
    - Viewed (0)
  8. src/test/java/org/codelibs/fess/opensearch/client/CrawlerEngineClientTest.java

            assertFalse(crawlerEngineClient.equals(other));
        }
    
        // Test getClass method
        public void test_getClass() {
            // Test that getClass returns the correct class
            assertEquals(CrawlerEngineClient.class, crawlerEngineClient.getClass());
        }
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 4.7K bytes
    - Viewed (0)
  9. okhttp/src/commonJvmAndroid/kotlin/okhttp3/ConnectionPool.kt

     *
     * @constructor Create a new connection pool with tuning parameters appropriate for a single-user
     * application. The tuning parameters in this pool are subject to change in future OkHttp releases.
     * Currently this pool holds up to 5 idle connections which will be evicted after 5 minutes of
     * inactivity.
     */
    class ConnectionPool internal constructor(
      internal val delegate: RealConnectionPool,
    ) {
      internal constructor(
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Tue Jun 03 17:10:08 UTC 2025
    - 4.8K bytes
    - Viewed (0)
  10. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

            result *= i;
          }
          return BigInteger.valueOf(result);
        }
    
        /*
         * We want each multiplication to have both sides with approximately the same number of digits.
         * Currently, we just divide the range in half.
         */
        int mid = (n1 + n2) >>> 1;
        return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
      }
    
      @Benchmark
      int slowFactorial(int reps) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
Back to top