Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 173 for products2 (0.06 sec)

  1. apache-maven/src/main/appended-resources/licenses/EPL-1.0.txt

    in any such claim at its own expense.
    
    For example, a Contributor might include the Program in a commercial product
    offering, Product X. That Contributor is then a Commercial Contributor. If
    that Commercial Contributor then makes performance claims, or offers warranties
    related to Product X, those performance claims and warranties are such Commercial
    Contributor's responsibility alone. Under this section, the Commercial Contributor
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Mon Sep 17 05:50:12 UTC 2018
    - 11.1K bytes
    - Viewed (0)
  2. docs/fr/README.md

    *[Fess Site Search](https://github.com/codelibs/fess-site-search)* est une alternative gratuite à [Google Site Search](https://enterprise.google.com/search/products/gss.html). Pour plus de détails, consultez la [documentation FSS JS Generator](https://fss-generator.codelibs.org/docs/manual).
    
    ## Site Web
    
    [fess.codelibs.org](https://fess.codelibs.org/)
    
    ## Problèmes/Questions
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 12 07:19:47 UTC 2024
    - 7.9K bytes
    - Viewed (0)
  3. docs/pt-BR/README.md

    *[Fess Site Search](https://github.com/codelibs/fess-site-search)* é uma alternativa gratuita ao [Google Site Search](https://enterprise.google.com/search/products/gss.html). Para mais detalhes, veja a [documentação do FSS JS Generator](https://fss-generator.codelibs.org/docs/manual).
    
    ## Site
    
    [fess.codelibs.org](https://fess.codelibs.org/)
    
    ## Problemas/Perguntas
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 12 07:19:47 UTC 2024
    - 7.4K bytes
    - Viewed (0)
  4. NOTICE

    MinIO Project, (C) 2015-2023 MinIO, Inc.
    
    This product includes software developed at MinIO, Inc.
    (https://min.io/).
    
    The MinIO project contains unmodified/modified subcomponents too with
    separate copyright notices and license terms. Your use of the source
    code for these subcomponents is subject to the terms and conditions
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sat Feb 18 18:33:50 UTC 2023
    - 367 bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/collect/FluentIterable.java

       *     in this fluent iterable to that value
       * @throws IllegalArgumentException if {@code keyFunction} produces the same key for more than one
       *     value in this fluent iterable
       * @throws NullPointerException if any element of this iterable is {@code null}, or if {@code
       *     keyFunction} produces {@code null} for any key
       * @since 14.0
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 35.3K bytes
    - Viewed (0)
  6. guava/src/com/google/common/collect/FluentIterable.java

       *     in this fluent iterable to that value
       * @throws IllegalArgumentException if {@code keyFunction} produces the same key for more than one
       *     value in this fluent iterable
       * @throws NullPointerException if any element of this iterable is {@code null}, or if {@code
       *     keyFunction} produces {@code null} for any key
       * @since 14.0
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 34.8K bytes
    - Viewed (0)
  7. src/test/java/jcifs/util/CryptoTest.java

            // When
            MessageDigest md4 = Crypto.getMD4();
            byte[] hash = md4.digest(data);
    
            // Then
            assertNotNull(hash);
            assertEquals(16, hash.length); // MD4 produces 128-bit hash
        }
    
        @Test
        @DisplayName("Should calculate MD5 hash correctly")
        void testMD5Hash() {
            // Given
            String input = "Hello World";
            byte[] data = input.getBytes();
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 7.4K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/hash/Hashing.java

       *
       * @param minimumBits a positive integer. This can be arbitrarily large. The returned {@link
       *     HashFunction} instance may use memory proportional to this integer.
       * @return a hash function, described above, that produces hash codes of length {@code
       *     minimumBits} or greater
       */
      public static HashFunction goodFastHash(int minimumBits) {
        int bits = checkPositiveAndMakeMultipleOf32(minimumBits);
    
        if (bits == 32) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  9. android/guava-testlib/src/com/google/common/testing/NullPointerTester.java

       */
      public void testAllPublicInstanceMethods(Object instance) {
        testInstanceMethods(instance, Visibility.PUBLIC);
      }
    
      /**
       * Verifies that {@code method} produces a {@link NullPointerException} or {@link
       * UnsupportedOperationException} whenever <i>any</i> of its non-nullable parameters are null.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Jul 14 14:44:08 UTC 2025
    - 24.9K bytes
    - Viewed (0)
  10. guava/src/com/google/common/hash/Hashing.java

       *
       * @param minimumBits a positive integer. This can be arbitrarily large. The returned {@link
       *     HashFunction} instance may use memory proportional to this integer.
       * @return a hash function, described above, that produces hash codes of length {@code
       *     minimumBits} or greater
       */
      public static HashFunction goodFastHash(int minimumBits) {
        int bits = checkPositiveAndMakeMultipleOf32(minimumBits);
    
        if (bits == 32) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:06:57 UTC 2025
    - 31.1K bytes
    - Viewed (0)
Back to top