Search Options

Results per page
Sort
Preferred Languages
Advance

Results 131 - 140 of 161 for freq (0.04 sec)

  1. src/main/java/org/codelibs/fess/app/web/admin/backup/AdminBackupAction.java

            final ObjectMapper mapper = new ObjectMapper();
            final AtomicBoolean resetJobs = new AtomicBoolean(false);
            try (CurlResponse response = ComponentUtil.getCurlHelper().post("/_bulk").onConnect((req, con) -> {
                con.setDoOutput(true);
                try (final BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(tempFile)));
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  2. guava/src/com/google/common/base/Joiner.java

         * linear-time operation, and it can even have side effects. Thus, we limit the special case to
         * List, which is _even more likely_ to have size() implemented to be fast and side-effect-free.
         *
         * We could consider recognizing specific other collections as safe (like ImmutableCollection,
         * except ContiguousSet!) or as not worth this optimization (CopyOnWriteArrayList?).
         */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 15:16:19 UTC 2025
    - 21K bytes
    - Viewed (0)
  3. guava/src/com/google/common/io/Files.java

       * be exploited to create security vulnerabilities, especially when executable files are to be
       * written into the directory.
       *
       * <p>This method assumes that the temporary volume is writable, has free inodes and free blocks,
       * and that it will not be called thousands of times per second.
       *
       * <p><b>{@link java.nio.file.Path} equivalent:</b> {@link
       * java.nio.file.Files#createTempDirectory}.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 32.9K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/Graphs.java

       */
      public static <N> boolean hasCycle(Graph<N> graph) {
        int numEdges = graph.edges().size();
        if (numEdges == 0) {
          return false; // An edge-free graph is acyclic by definition.
        }
        if (!graph.isDirected() && numEdges >= graph.nodes().size()) {
          return true; // Optimization for the undirected case: at least one cycle must exist.
        }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  5. guava/src/com/google/common/graph/Graphs.java

       */
      public static <N> boolean hasCycle(Graph<N> graph) {
        int numEdges = graph.edges().size();
        if (numEdges == 0) {
          return false; // An edge-free graph is acyclic by definition.
        }
        if (!graph.isDirected() && numEdges >= graph.nodes().size()) {
          return true; // Optimization for the undirected case: at least one cycle must exist.
        }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  6. src/test/java/org/codelibs/fess/api/WebApiManagerTest.java

            @Override
            public jakarta.servlet.AsyncContext startAsync() {
                return null;
            }
    
            @Override
            public jakarta.servlet.AsyncContext startAsync(jakarta.servlet.ServletRequest req, jakarta.servlet.ServletResponse res) {
                return null;
            }
    
            @Override
            public boolean isAsyncStarted() {
                return false;
            }
    
            @Override
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 26.6K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/LongMath.java

        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
       * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
       * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
       * than the straightforward ternary expression.
       */
      @VisibleForTesting
      static int lessThanBranchFree(long x, long y) {
        // Returns the sign bit of x - y.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 29 16:20:07 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  8. CHANGELOG/CHANGELOG-1.4.md

    * Declare out of disk when there is no free inodes ([#28176](https://github.com/kubernetes/kubernetes/pull/28176), [@ronnielai](https://github.com/ronnielai))
    * Includes the number of free inodes in stat summary ([#28173](https://github.com/kubernetes/kubernetes/pull/28173), [@ronnielai](https://github.com/ronnielai))
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Thu Dec 24 02:28:26 UTC 2020
    - 133.5K bytes
    - Viewed (0)
  9. src/test/java/org/codelibs/fess/job/SuggestJobTest.java

                }
                return new File(tempDir, path.replace("/", File.separator)).getAbsolutePath();
            }
    
            @Override
            public void service(jakarta.servlet.ServletRequest req, jakarta.servlet.ServletResponse res) {
                // Not used in tests
            }
    
            // Implement other required methods with default/empty implementations
            @Override
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 31.4K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt

                    ALICE'S ADVENTURES IN WONDERLAND
    
                              by Lewis Carroll
    
    First published in 1865.
    
    This text was produced by Project Gutenberg www.gutenberg.org,
    an organization that produces free electronic books, mostly of
    works old enough that they have passed into the public domain.
    
    
                                CHAPTER I
    
                          Down the Rabbit-Hole
    
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Apr 21 02:27:51 UTC 2017
    - 145.2K bytes
    - Viewed (0)
Back to top