Search Options

Results per page
Sort
Preferred Languages
Advance

Results 251 - 260 of 571 for roots (0.04 sec)

  1. android/guava/src/com/google/common/collect/ObjectCountHashMap.java

        do {
          if (getHash(entries[next]) == hash) {
            if (Objects.equal(key, keys[next])) {
              int oldValue = values[next];
    
              if (last == UNSET) {
                // we need to update the root link from table[]
                table[tableIndex] = getNext(entries[next]);
              } else {
                // we need to update the link from the chain
                entries[last] = swapNext(entries[last], getNext(entries[next]));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jun 01 22:07:10 UTC 2021
    - 15K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/fess/api/json/SearchApiManager.java

            final String value = values.length > 3 ? values[3] : null;
            if (value == null) {
                return FormatType.SEARCH;
            }
            final String type = value.toLowerCase(Locale.ROOT);
            if ("documents".equals(type)) {
                if (values.length > 5 && "favorite".equals(values[5])) {
                    request.setAttribute(DOC_ID_FIELD, values[4]);
                    return FormatType.FAVORITE;
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 12 01:54:46 UTC 2024
    - 50.3K bytes
    - Viewed (0)
  3. guava/src/com/google/common/util/concurrent/AbstractTransformFuture.java

           * something. Try to treat it like a RuntimeException. If we overflow the stack again, the
           * resulting Error will propagate upward up to the root call to set().
           */
          setException(e);
          return;
        }
    
        T transformResult;
        try {
          transformResult = doTransform(localFunction, sourceResult);
        } catch (Throwable t) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 13:13:32 UTC 2024
    - 11K bytes
    - Viewed (0)
  4. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/DefaultLegacyArtifactCollector.java

            }
    
            Map<Object, List<ResolutionNode>> resolvedArtifacts = new LinkedHashMap<>();
    
            ResolutionNode root = new ResolutionNode(originatingArtifact, repositoryRequest.getRemoteRepositories());
    
            try {
                root.addDependencies(artifacts, repositoryRequest.getRemoteRepositories(), filter);
            } catch (CyclicDependencyException e) {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 36.7K bytes
    - Viewed (0)
  5. compat/maven-resolver-provider/src/main/java/org/apache/maven/repository/internal/RequestTraceHelper.java

                    String msg = "dependency collection step for " + stepData.getContext();
                    if (detailed) {
                        msg += ". Path to offending node from root:\n";
                        msg += stepData.getPath().stream()
                                .map(n -> " -> " + n.toString())
                                .collect(Collectors.joining("\n"));
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 3.2K bytes
    - Viewed (0)
  6. docs/en/docs/img/deployment/concepts/process-ram.drawio

            <mxGraphModel dx="741" dy="1167" grid="1" gridSize="10" guides="1" tooltips="1" connect="1" arrows="1" fold="1" page="1" pageScale="1" pageWidth="1920" pageHeight="1200" math="0" shadow="0">
                <root>
                    <mxCell id="0"/>
                    <mxCell id="1" parent="0"/>
                    <mxCell id="2" value="" style="rounded=0;whiteSpace=wrap;html=1;fontStyle=1;strokeWidth=4;" parent="1" vertex="1">
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu May 12 00:06:16 UTC 2022
    - 10K bytes
    - Viewed (0)
  7. android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

        }
        requests.addAndGet(reps);
        return dummy;
      }
    
      private int nextRandomKey() {
        int a = random.nextInt(max);
    
        /*
         * For example, if concentration=2.0, the following takes the square root of
         * the uniformly-distributed random integer, then truncates any fractional
         * part, so higher integers would appear (in this case linearly) more often
         * than lower ones.
         */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.4K bytes
    - Viewed (0)
  8. docs/multi-tenancy/README.md

    ```
    
    **Note:** Execute the commands on all 4 nodes.
    
    ![Example-3](https://github.com/minio/minio/blob/master/docs/screenshots/Example-3.jpg?raw=true)
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 3K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/io/FilesTest.java

        assertFalse(Files.isFile().apply(dir));
    
        assertFalse(Files.isDirectory().apply(asciiFile));
        assertTrue(Files.isFile().apply(asciiFile));
      }
    
      /** Returns a root path for the file system. */
      private static File root() {
        return File.listRoots()[0];
      }
    
      /** Returns a {@code File} object for the given path parts. */
      private static File file(String first, String... more) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 22.1K bytes
    - Viewed (0)
  10. android/guava-testlib/test/com/google/common/collect/testing/features/FeatureEnumTest.java

        assertGoodFeatureEnum(CollectionSize.class);
        assertGoodFeatureEnum(MapFeature.class);
      }
    
      private static String rootLocaleFormat(String format, Object... args) {
        return String.format(Locale.ROOT, format, args);
      }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 17 02:09:00 UTC 2024
    - 4.3K bytes
    - Viewed (0)
Back to top