Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1191 - 1200 of 1,655 for sizes (0.02 sec)

  1. guava-testlib/src/com/google/common/testing/DummyProxy.java

        interfaceClasses.add(Serializable.class);
        Object dummy =
            Proxy.newProxyInstance(
                interfaceClasses.iterator().next().getClassLoader(),
                interfaceClasses.toArray(new Class<?>[interfaceClasses.size()]),
                new DummyHandler(interfaceType));
        @SuppressWarnings("unchecked") // interfaceType is T
        T result = (T) dummy;
        return result;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:10:29 UTC 2025
    - 4.5K bytes
    - Viewed (0)
  2. guava/src/com/google/common/hash/ChecksumHashFunction.java

            /*
             * The long returned from a 32-bit Checksum will have all 0s for its second word, so the
             * cast won't lose any information and is necessary to return a HashCode of the correct
             * size.
             */
            return HashCode.fromInt((int) value);
          } else {
            return HashCode.fromLong(value);
          }
        }
      }
    
      @J2ObjCIncompatible
      @SuppressWarnings("unused")
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 17:34:21 UTC 2025
    - 4.4K bytes
    - Viewed (0)
  3. android/guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java

                  return indexOfEntryWithValue(left) - indexOfEntryWithValue(right);
                }
    
                int indexOfEntryWithValue(V value) {
                  for (int i = 0; i < orderedEntries.size(); i++) {
                    if (equal(orderedEntries.get(i).getValue(), value)) {
                      return i;
                    }
                  }
                  throw new IllegalArgumentException(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jan 30 16:59:10 UTC 2025
    - 18.2K bytes
    - Viewed (0)
  4. fess-crawler/src/test/java/org/codelibs/fess/crawler/rule/RuleTest.java

                rules.add(rule);
            }
    
            // Verify all IDs are unique
            for (int i = 0; i < rules.size(); i++) {
                for (int j = i + 1; j < rules.size(); j++) {
                    assertNotSame(rules.get(i).getRuleId(), rules.get(j).getRuleId());
                }
            }
        }
    
        /**
         * Test rule processor chain behavior
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Wed Sep 03 14:42:53 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  5. cmd/erasure-healing-common_test.go

    		Size:           329289, Mode: 0x0, WrittenByVersion: 0x63c77756,
    		Metadata: map[string]string{
    			"content-type": "application/octet-stream", "etag": "f205307ef9f50594c4b86d9c246bee86", "x-minio-internal-erasure-upgraded": "5->6", "x-minio-internal-inline-data": "true",
    		},
    		Parts: []ObjectPartInfo{
    			{
    				ETag:       "",
    				Number:     1,
    				Size:       329289,
    				ActualSize: 329289,
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  6. android/guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java

        private ArrayWithDuplicate(E[] elements, E duplicate) {
          this.elements = elements;
          this.duplicate = duplicate;
        }
      }
    
      /**
       * @return an array of the proper size with a duplicate element. The size must be at least three.
       */
      protected ArrayWithDuplicate<E> createArrayWithDuplicateElement() {
        E[] elements = createSamplesArray();
        E duplicate = elements[(elements.length / 2) - 1];
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java

             *
             * Ideally we'd have a real eviction policy, but until we see a problem in practice, I hope
             * that this will suffice. I have not even benchmarked with different size limits.
             */
            if (validClasses.size() > 1000) {
              validClasses.clear();
            }
    
            validClasses.add(new WeakReference<Class<? extends Exception>>(exceptionClass));
          }
        }
    
        /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 10.2K bytes
    - Viewed (0)
  8. tensorflow/c/c_api_experimental.h

    // enabled through MarkForCompilationPassFlags.
    TF_CAPI_EXPORT unsigned char TF_GetXlaAutoJitEnabled();
    
    // Sets XLA's minimum cluster size. This has global effect.
    TF_CAPI_EXPORT void TF_SetXlaMinClusterSize(int size);
    
    // Gets/Sets TF/XLA flag for whether(true) or not(false) to disable constant
    // folding. This is for testing to ensure that XLA is being tested rather than
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Thu Apr 27 21:07:00 UTC 2023
    - 15.1K bytes
    - Viewed (0)
  9. okhttp/src/jvmMain/kotlin/okhttp3/internal/platform/BouncyCastlePlatform.kt

          TrustManagerFactory.getInstance(
            "PKIX",
            BouncyCastleJsseProvider.PROVIDER_NAME,
          )
        factory.init(null as KeyStore?)
        val trustManagers = factory.trustManagers!!
        check(trustManagers.size == 1 && trustManagers[0] is X509TrustManager) {
          "Unexpected default trust managers: ${trustManagers.contentToString()}"
        }
        return trustManagers[0] as X509TrustManager
      }
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/graph/NetworkConnections.java

      Set<E> incidentEdges();
    
      Set<E> inEdges();
    
      Set<E> outEdges();
    
      /**
       * Returns the set of edges connecting the origin node to {@code node}. For networks without
       * parallel edges, this set cannot be of size greater than one.
       */
      Set<E> edgesConnecting(N node);
    
      /**
       * Returns the node that is adjacent to the origin node along {@code edge}.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.3K bytes
    - Viewed (0)
Back to top