Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1421 - 1430 of 1,544 for RESULT (0.04 sec)

  1. fess-crawler/src/test/java/org/codelibs/fess/crawler/rule/RuleTest.java

            ResponseData responseData = new ResponseData();
            responseData.setUrl("http://example.com");
    
            // Multiple calls should return same result
            boolean firstResult = rule.match(responseData);
            boolean secondResult = rule.match(responseData);
            boolean thirdResult = rule.match(responseData);
    
            assertEquals(firstResult, secondResult);
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Wed Sep 03 14:42:53 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/base/Suppliers.java

        }
    
        @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
      }
    
      /**
       * Returns a function that accepts a supplier and returns the result of invoking {@link
       * Supplier#get} on that supplier.
       *
       * <p>Prefer to use the method reference {@code Supplier::get} instead, though note that it is not
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 16.5K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/math/Quantiles.java

     *
     * <p>The definition of the kth q-quantile of N values is as follows: define x = k * (N - 1) / q; if
     * x is an integer, the result is the value which would appear at index x in the sorted dataset
     * (unless there are {@link Double#NaN NaN} values, see below); otherwise, the result is the average
     * of the values which would appear at the indexes floor(x) and ceil(x) weighted by (1-frac(x)) and
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 30.1K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/CompactHashMap.java

          checkForConcurrentModification();
          if (!hasNext()) {
            throw new NoSuchElementException();
          }
          indexToRemove = currentIndex;
          T result = getOutput(currentIndex);
          currentIndex = getSuccessor(currentIndex);
          return result;
        }
    
        @Override
        public void remove() {
          checkForConcurrentModification();
          checkRemove(indexToRemove >= 0);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 35.7K bytes
    - Viewed (0)
  5. ci/official/containers/ml_build_arm64/builder.devtoolset/stringop_trunc.patch

    @@ -82,7 +82,7 @@ _nss_nisplus_parse_pwent (nis_result *result, struct passwd *pw,
     
       char *numstr = NISOBJVAL (2, obj);
       len = NISOBJLEN (2, obj);
    -  if (len == 0 && numstr[len - 1] != '\0')
    +  if (len == 0 || numstr[len - 1] != '\0')
         {
           if (len >= room_left)
     	goto no_more_room;
    @@ -98,7 +98,7 @@ _nss_nisplus_parse_pwent (nis_result *result, struct passwd *pw,
     
       numstr = NISOBJVAL (3, obj);
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Nov 11 19:25:56 UTC 2024
    - 42.9K bytes
    - Viewed (0)
  6. CHANGELOG.md

        result in it OkHttp starting a thread for each queued task, even when a single thread could run
        all of them.
    
     *  Fix: Address a performance bug in `MultipartReader`. We were scanning the entire input stream
        for a delimiter when we only needed to scan enough to return a result.
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Mon Jul 07 19:32:33 UTC 2025
    - 31.6K bytes
    - Viewed (2)
  7. src/main/java/org/codelibs/fess/helper/CrawlingConfigHelper.java

    import org.codelibs.fess.opensearch.config.exentity.FileConfig;
    import org.codelibs.fess.opensearch.config.exentity.WebConfig;
    import org.codelibs.fess.util.ComponentUtil;
    import org.dbflute.cbean.result.ListResultBean;
    import org.dbflute.optional.OptionalEntity;
    import org.dbflute.optional.OptionalThing;
    
    import com.google.common.cache.Cache;
    import com.google.common.cache.CacheBuilder;
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 19.5K bytes
    - Viewed (1)
  8. LICENSE

          negligent acts) or agreed to in writing, shall any Contributor be
          liable to You for damages, including any direct, indirect, special,
          incidental, or consequential damages of any character arising as a
          result of this License or out of the use or inability to use the
          Work (including but not limited to damages for loss of goodwill,
          work stoppage, computer failure or malfunction, or any and all
    Registered: Thu Sep 04 15:34:10 UTC 2025
    - Last Modified: Thu Jun 14 07:45:22 UTC 2018
    - 11.1K bytes
    - Viewed (0)
  9. LICENSE

          negligent acts) or agreed to in writing, shall any Contributor be
          liable to You for damages, including any direct, indirect, special,
          incidental, or consequential damages of any character arising as a
          result of this License or out of the use or inability to use the
          Work (including but not limited to damages for loss of goodwill,
          work stoppage, computer failure or malfunction, or any and all
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Tue Nov 22 19:44:46 UTC 2016
    - 11.1K bytes
    - Viewed (0)
  10. LICENSES/LICENSE

          negligent acts) or agreed to in writing, shall any Contributor be
          liable to You for damages, including any direct, indirect, special,
          incidental, or consequential damages of any character arising as a
          result of this License or out of the use or inability to use the
          Work (including but not limited to damages for loss of goodwill,
          work stoppage, computer failure or malfunction, or any and all
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Fri May 08 04:49:00 UTC 2020
    - 11.3K bytes
    - Viewed (0)
Back to top