Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 191 - 200 of 296 for LookUp (0.27 seconds)

  1. okhttp/src/jvmTest/kotlin/okhttp3/internal/connection/RouteSelectorTest.kt

        dns[PROXY_A_HOST] = dns.allocate(2)
        val selection = routeSelector.next()
        assertRoute(selection.next(), address, proxyA, dns.lookup(PROXY_A_HOST, 0), PROXY_A_PORT)
        assertRoute(selection.next(), address, proxyA, dns.lookup(PROXY_A_HOST, 1), PROXY_A_PORT)
        assertThat(selection.hasNext()).isFalse()
        assertThat(routeSelector.hasNext()).isFalse()
        dns.assertRequests(PROXY_A_HOST)
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Oct 08 03:50:05 GMT 2025
    - 20.3K bytes
    - Click Count (0)
  2. src/main/java/jcifs/smb1/smb1/SmbTransport.java

        //        MsrpcDfsRootEnum rpc;
        //        DcerpcHandle handle = null;
        //
        //        /* Procedure:
        //         * Lookup a DC in the target domain
        //         * Ask the DC for a referral for the domain (e.g. "\example.com")
        //         * Do NetrDfsEnumEx on the server returned in the referral to
        //         * get roots in target domain
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 31.8K bytes
    - Click Count (0)
  3. cmd/bucket-replication.go

    	lkMap := caseInsensitiveMap(objInfo.UserDefined)
    	if lang, ok := lkMap.Lookup(xhttp.ContentLanguage); ok {
    		putOpts.ContentLanguage = lang
    	}
    	if disp, ok := lkMap.Lookup(xhttp.ContentDisposition); ok {
    		putOpts.ContentDisposition = disp
    	}
    	if cc, ok := lkMap.Lookup(xhttp.CacheControl); ok {
    		putOpts.CacheControl = cc
    	}
    	if mode, ok := lkMap.Lookup(xhttp.AmzObjectLockMode); ok {
    		rmode := minio.RetentionMode(mode)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 118.2K bytes
    - Click Count (0)
  4. src/main/java/jcifs/Configuration.java

         */
        boolean isDfsStrictView();
    
        /**
         *
         * Property {@code jcifs.smb.client.dfs.disabled} (boolean, default false)
         *
         * @return whether DFS lookup is disabled
         */
        boolean isDfsDisabled();
    
        /**
         * Enable hack to make kerberos auth work with DFS sending short names
         *
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 25.4K bytes
    - Click Count (0)
  5. src/main/java/jcifs/smb/DfsImpl.java

            DfsReferralDataInternal dr = rootDr;
            String link;
    
            if (path == null || path.length() <= 1) {
                /*
                 * Lookup the domain based DFS root target referral. Note the
                 * path is just "\" and not "\example.com\root".
                 */
                link = "\\";
            } else if (path.charAt(path.length() - 1) == '\\') {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 29.7K bytes
    - Click Count (0)
  6. okhttp/src/jvmTest/kotlin/okhttp3/ConnectionListenerTest.kt

            headers = headersOf("Location", "http://www.fakeurl:" + server.port),
          ),
        )
        server.enqueue(MockResponse())
        val dns = FakeDns()
        dns["fakeurl"] = client.dns.lookup(server.hostName)
        dns["www.fakeurl"] = client.dns.lookup(server.hostName)
        client =
          client
            .newBuilder()
            .dns(dns)
            .build()
        val call =
          client.newCall(
            Request
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Nov 04 18:33:48 GMT 2025
    - 9.7K bytes
    - Click Count (0)
  7. docs/changelogs/changelog_2x.md

        This fixes a bug in resumed TLS sessions where the wrong protocol could be
        selected.
     *  Fix: Don't crash in SPDY and HTTP/2 when disconnecting before connecting.
     *  Fix: Avoid a reverse DNS-lookup for a numeric proxy address
     *  Fix: Resurrect http/2 frame logging.
     *  Fix: Limit to 20 authorization attempts.
    
    ## Version 2.1.0
    
    _2014-11-11_
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Feb 06 02:19:09 GMT 2022
    - 26.6K bytes
    - Click Count (0)
  8. impl/maven-core/src/main/java/org/apache/maven/configuration/internal/EnhancedConverterLookup.java

    import org.codehaus.plexus.component.configurator.converters.composite.ObjectWithFieldsConverter;
    import org.codehaus.plexus.component.configurator.converters.lookup.ConverterLookup;
    import org.codehaus.plexus.component.configurator.converters.lookup.DefaultConverterLookup;
    
    class EnhancedConverterLookup implements ConverterLookup {
        private final ConverterLookup delegate = new DefaultConverterLookup();
    
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 2.1K bytes
    - Click Count (0)
  9. compat/maven-compat/src/main/java/org/apache/maven/project/ProjectUtils.java

            try {
                return c.lookup(RepositorySystem.class);
            } catch (ComponentLookupException e) {
                throw new IllegalStateException(e);
            }
        }
    
        private static RepositorySystemSession rss(PlexusContainer c) {
            try {
                LegacySupport legacySupport = c.lookup(LegacySupport.class);
    
                return legacySupport.getRepositorySession();
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 3.8K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/math/IntMath.java

        }
        throw new AssertionError();
      }
    
      private static int log10Floor(int x) {
        /*
         * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
         *
         * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 26.1K bytes
    - Click Count (0)
Back to Top