Search Options

Results per page
Sort
Preferred Languages
Advance

Results 441 - 450 of 639 for ruling (0.04 sec)

  1. src/test/java/org/codelibs/fess/job/PingSearchEngineJobTest.java

            // Execute
            String result = pingSearchEngineJob.execute();
    
            // Assert
            assertEquals("Status of production-cluster is changed to GREEN.", result);
        }
    
        // Test with exception during ping
        public void test_execute_pingException() {
            SearchEngineClient searchEngineClient = new SearchEngineClient() {
                @Override
                public PingResponse ping() {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  2. cmd/http-stats.go

    	"sync"
    	"sync/atomic"
    
    	xhttp "github.com/minio/minio/internal/http"
    	"github.com/prometheus/client_golang/prometheus"
    )
    
    // connStats - Network statistics
    // Count total input/output transferred bytes during
    // the server's life.
    type connStats struct {
    	internodeInputBytes  uint64
    	internodeOutputBytes uint64
    	s3InputBytes         uint64
    	s3OutputBytes        uint64
    }
    
    // Increase internode total input bytes
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Sep 24 17:13:00 UTC 2024
    - 11.4K bytes
    - Viewed (0)
  3. fess-crawler/src/main/java/org/codelibs/fess/crawler/helper/SitemapsHelper.java

     * and to parse an input stream into a {@link SitemapSet} object.
     * It uses SAX parser for XML sitemaps and XML sitemap indexes,
     * and handles potential exceptions during parsing.
     * The class also includes inner classes for handling XML sitemap and sitemap index parsing.
     */
    public class SitemapsHelper {
        private static final Logger logger = LogManager.getLogger(SitemapsHelper.class);
    
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Sun Jul 06 02:13:03 UTC 2025
    - 14.7K bytes
    - Viewed (0)
  4. samples/guide/src/main/java/okhttp3/recipes/kt/WiresharkExample.kt

              // https://timothybasanov.com/2016/05/26/java-pre-master-secret.html
              // https://security.stackexchange.com/questions/35639/decrypting-tls-in-wireshark-when-using-dhe-rsa-ciphersuites
              // https://stackoverflow.com/questions/36240279/how-do-i-extract-the-pre-master-secret-using-an-openssl-based-client
    
              // TLSv1.2 Events
              // Produced ClientHello handshake message
              // Consuming ServerHello handshake message
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat May 10 11:15:14 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  5. futures/listenablefuture1/src/com/google/common/util/concurrent/ListenableFuture.java

       * this method is guaranteed to be called once the computation is complete.
       *
       * <p>Exceptions thrown by a listener will be propagated up to the executor. Any exception thrown
       * during {@code Executor.execute} (e.g., a {@code RejectedExecutionException} or an exception
       * thrown by {@linkplain MoreExecutors#directExecutor direct execution}) will be caught and
       * logged.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 8K bytes
    - Viewed (0)
  6. guava/src/com/google/common/util/concurrent/ListenableFuture.java

       * this method is guaranteed to be called once the computation is complete.
       *
       * <p>Exceptions thrown by a listener will be propagated up to the executor. Any exception thrown
       * during {@code Executor.execute} (e.g., a {@code RejectedExecutionException} or an exception
       * thrown by {@linkplain MoreExecutors#directExecutor direct execution}) will be caught and
       * logged.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 8K bytes
    - Viewed (0)
  7. guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java

        // where {hi,lo} are characters forming a surrogate pair such that:
        // codePointOf(hi, lo) > safeMax
        // which would result in the surrogate pair being (wrongly) considered safe.
        // If we clip the safe range used during the per-character tests so it is
        // below the values of characters in surrogate pairs, this cannot occur.
        // This approach does mean that we break out of the fast path code in cases
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 15:45:16 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  8. docs/multi-user/README.md

    # MinIO Multi-user Quickstart Guide [![Slack](https://slack.min.io/slack?type=svg)](https://slack.min.io)
    
    MinIO supports multiple long term users in addition to default user created during server startup. New users can be added after server starts up, and server can be configured to deny or allow access to buckets and resources to each of these users. This document explains how to add/remove users and modify their access rights.
    
    ## Get started
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.2K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/graph/Graphs.java

        NodeAndRemainingSuccessors(N node) {
          this.node = node;
        }
      }
    
      /**
       * Determines whether an edge has already been used during traversal. In the directed case a cycle
       * is always detected before reusing an edge, so no special logic is required. In the undirected
       * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going
       * from B to A).
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  10. guava/src/com/google/common/graph/Graphs.java

        NodeAndRemainingSuccessors(N node) {
          this.node = node;
        }
      }
    
      /**
       * Determines whether an edge has already been used during traversal. In the directed case a cycle
       * is always detected before reusing an edge, so no special logic is required. In the undirected
       * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going
       * from B to A).
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
Back to top