Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 201 - 210 of 304 for Pair (0.07 seconds)

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

       *
       * <p>Occasionally, in order to maintain the heap invariant, it must swap a later element of the
       * list with one before {@code index}. Under these circumstances it returns a pair of elements as
       * a {@link MoveDesc}. The first one is the element that was previously at the end of the heap and
       * is now at some position before {@code index}. The second element is the one that was swapped
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  2. src/main/java/org/codelibs/fess/api/json/SearchApiManager.java

            } else {
                writeJsonResponse(status, message);
            }
        }
    
        /**
         * Escapes a JSON key-value pair.
         * @param key The key.
         * @param value The value.
         * @return The escaped key-value pair.
         */
        protected String escapeJsonKeyValue(final String key, final String value) {
            return "\"" + key + "\":" + escapeJson(value);
        }
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 27 13:56:32 GMT 2026
    - 55.4K bytes
    - Click Count (1)
  3. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/ConnectPlan.kt

       */
      @Throws(IOException::class)
      private fun createTunnel(): Request? {
        var nextRequest = tunnelRequest!!
        // Make an SSL Tunnel on the first message pair of each SSL + proxy connection.
        val url = route.address.url
        val requestLine = "CONNECT ${url.toHostHeader(includeDefaultPort = true)} HTTP/1.1"
        while (true) {
          val tunnelCodec =
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 19.3K bytes
    - Click Count (2)
  4. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2Stream.kt

       * request is transmitted. This is only interesting for duplex calls where the request and
       * response may be interleaved.
       *
       * Read this value only once for each enter/exit pair because its value can change.
       */
      private fun doReadTimeout() = !connection.client || sink.closed || sink.finished
    
      /**
       * A source that reads the incoming data frames of a stream. Although this class uses
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Mon Jul 07 18:57:05 GMT 2025
    - 22.4K bytes
    - Click Count (0)
  5. guava/src/com/google/common/base/Joiner.java

       *
       * <p>In addition to operating on {@code Map} instances, {@code MapJoiner} can operate on {@code
       * Multimap} entries in two distinct modes:
       *
       * <ul>
       *   <li>To output a separate entry for each key-value pair, pass {@code multimap.entries()} to a
       *       {@code MapJoiner} method that accepts entries as input, and receive output of the form
       *       {@code key1=A&key1=B&key2=C}.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Apr 14 15:16:19 GMT 2025
    - 21K bytes
    - Click Count (0)
  6. cmd/admin-handlers-config-kv.go

    	return result, err
    }
    
    // GetConfigKVHandler - GET /minio/admin/v3/get-config-kv?key={key}
    //
    // `key` can be one of three forms:
    // 1. `subsys:target` -> request for config of a single subsystem and target pair.
    // 2. `subsys:` -> request for config of a single subsystem and the default target.
    // 3. `subsys` -> request for config of all targets for the given subsystem.
    //
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 15.8K bytes
    - Click Count (1)
  7. android/guava/src/com/google/common/graph/Graph.java

      /**
       * Returns true if the edges in this graph are directed. Directed edges connect a {@link
       * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while
       * undirected edges connect a pair of nodes to each other.
       */
      @Override
      boolean isDirected();
    
      /**
       * Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 13.6K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/primitives/UnsignedInts.java

       * href="http://en.wikipedia.org/wiki/Lexicographical_order">lexicographically</a>. That is, it
       * compares, using {@link #compare(int, int)}), the first pair of values that follow any common
       * prefix, or when one array is a prefix of the other, treats the shorter array as the lesser. For
       * example, {@code [] < [1] < [1, 2] < [2] < [1 << 31]}.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 16:38:16 GMT 2026
    - 13.9K bytes
    - Click Count (0)
  9. fess-crawler/src/main/java/org/codelibs/fess/crawler/client/http/Hc5HttpClient.java

            final List<Pair<Hc5FormScheme, Credentials>> formSchemeList = new ArrayList<>();
            for (final Hc5Authentication authentication : siteCredentialList) {
                final AuthScheme authScheme = authentication.getAuthScheme();
                if (authScheme instanceof Hc5FormScheme) {
                    formSchemeList.add(new Pair<>((Hc5FormScheme) authScheme, authentication.getCredentials()));
    Created: Sun Apr 12 03:50:13 GMT 2026
    - Last Modified: Sat Jan 31 12:23:29 GMT 2026
    - 62.2K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/graph/ValueGraph.java

      /**
       * Returns true if the edges in this graph are directed. Directed edges connect a {@link
       * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while
       * undirected edges connect a pair of nodes to each other.
       */
      @Override
      boolean isDirected();
    
      /**
       * Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 15K bytes
    - Click Count (0)
Back to Top