Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for tuples (0.04 sec)

  1. src/main/java/org/codelibs/fess/mylasta/direction/FessProp.java

        }
    
        String getCrawlerMetadataNameMapping();
    
        default Tuple3<String, String, String> getCrawlerMetadataNameMapping(final String name) {
            @SuppressWarnings("unchecked")
            Map<String, Tuple3<String, String, String>> params =
                    (Map<String, Tuple3<String, String, String>>) propMap.get(CRAWLER_METADATA_NAME_MAPPING);
            if (params == null) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 86.5K bytes
    - Viewed (0)
  2. docs/changelogs/changelog_3x.md

        Interceptors that rewrite or replace the request body may now inadvertently interfere with
        duplex request bodies. Such interceptors should check `RequestBody.isDuplex()` and avoid
        accessing the request body when it is.
    
        Duplex calls require HTTP/2. If HTTP/1 is established instead the duplex call will fail. The
        most common use of duplex calls is [gRPC][grpc_http2].
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sun Feb 06 14:55:54 UTC 2022
    - 50.8K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/Sets.java

       *
       * {@snippet :
       * for (B b0 : sets.get(0)) {
       *   for (B b1 : sets.get(1)) {
       *     ...
       *     ImmutableList<B> tuple = ImmutableList.of(b0, b1, ...);
       *     // operate on tuple
       *   }
       * }
       * }
       *
       * <p>Note that if any input set is empty, the Cartesian product will also be empty. If no sets at
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 81.6K bytes
    - Viewed (0)
  4. tests/migrate_test.go

    		t.Fatalf("Failed to auto migrate, got error %v", err)
    	}
    
    	if tables, err := DB.Migrator().GetTables(); err != nil {
    		t.Fatalf("Failed to get database all tables, but got error %v", err)
    	} else {
    		for _, t1 := range []string{"users", "accounts", "pets", "companies", "toys", "languages", "tools"} {
    			hasTable := false
    			for _, t2 := range tables {
    				if t2 == t1 {
    					hasTable = true
    					break
    				}
    			}
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Wed Aug 20 04:51:17 UTC 2025
    - 65.2K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

      }
    
      /**
       * Applies a supplemental hash function to a given hash code, which defends against poor quality
       * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
       * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
       * bits.
       *
       * @param h hash code
       */
      static int rehash(int h) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 90K bytes
    - Viewed (0)
  6. okhttp/src/commonJvmAndroid/kotlin/okhttp3/OkHttpClient.kt

      /**
       * Default call timeout (in milliseconds). By default there is no timeout for complete calls, but
       * there is for the connect, write, and read actions within a call.
       *
       * For WebSockets and duplex calls the timeout only applies to the initial setup.
       */
      @get:JvmName("callTimeoutMillis")
      val callTimeoutMillis: Int = builder.callTimeout
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Mon May 05 16:01:00 UTC 2025
    - 51.7K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/base/CharMatcher.java

       *
       * <p>This implementation tries to be smart in a number of ways. It recognizes cases where the
       * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables
       * for matchers that only match a few characters, and so on. In the worst-case scenario, it
       * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 53.9K bytes
    - Viewed (0)
Back to top