Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 527 for consume (0.21 seconds)

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/-CacheControlCommon.kt

          if (pos == value.length || value[pos] == ',' || value[pos] == ';') {
            pos++ // Consume ',' or ';' (if necessary).
            parameter = null
          } else {
            pos++ // Consume '='.
            pos = value.indexOfNonWhitespace(pos)
    
            if (pos < value.length && value[pos] == '\"') {
              // Quoted string.
              pos++ // Consume '"' open quote.
              val parameterStart = pos
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  2. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/HttpHeaders.kt

          result.write(this, i)
          // Consume '"'.
          readByte()
          return result.readUtf8()
        }
    
        if (size == i + 1L) return null // Dangling escape.
        result.write(this, i)
        // Consume '\'.
        readByte()
        result.write(this, 1L) // The escaped character.
      }
    }
    
    /**
     * Consumes and returns a non-empty token, terminating at special characters in
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 7.2K bytes
    - Click Count (0)
  3. okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerReader.kt

        // Note that this may be be an encoded "end of data" header.
        return DerHeader(tagClass, tag, constructed, length)
      }
    
      /**
       * Consume a header and execute [block], which should consume the entire value described by the
       * header. It is an error to not consume a full value in [block].
       */
      internal inline fun <T> read(
        name: String?,
        block: (DerHeader) -> T,
      ): T {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 10.5K bytes
    - Click Count (0)
  4. docs/en/docs/deployment/concepts.md

    And if your remote server or virtual machine only has 3 GB of RAM, trying to load more than 4 GB of RAM will cause problems. 🚨
    
    ### Multiple Processes - An Example { #multiple-processes-an-example }
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 18.5K bytes
    - Click Count (1)
  5. docs/features/events.md

    System.out.println("REQUEST 1 (new connection)");
    try (Response response = client.newCall(request).execute()) {
      // Consume and discard the response body.
      response.body().source().readByteString();
    }
    
    System.out.println("REQUEST 2 (pooled connection)");
    try (Response response = client.newCall(request).execute()) {
      // Consume and discard the response body.
      response.body().source().readByteString();
    }
    ```
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Mar 15 09:01:42 GMT 2026
    - 7.7K bytes
    - Click Count (0)
  6. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/Punycode.kt

        // appendCodePoint(). The Punycode algorithm processes code points in increasing code-point
        // order, not in increasing index order.
        val codePoints = mutableListOf<Int>()
    
        // consume all code points before the last delimiter (if there is one)
        //  and copy them to output, fail on any non-basic code point
        val lastDelimiter = string.lastIndexOf('-', limit)
        if (lastDelimiter >= pos) {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 8.6K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/graph/StandardNetwork.java

      final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections;
    
      // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
      // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
      final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
    
      /** Constructs a graph with the properties specified in {@code builder}. */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  8. docs/en/docs/advanced/stream-data.md

    In this example, we are simulating a file with `io.BytesIO`, which is a file-like object that lives only in memory, but lets us use the same interface.
    
    For example, we can iterate over it to consume its contents, as we could with a file.
    
    {* ../../docs_src/stream_data/tutorial002_py310.py ln[1:27] hl[3,12:13,25] *}
    
    /// note | Technical Details
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 5.4K bytes
    - Click Count (0)
  9. okhttp/src/commonJvmAndroid/kotlin/okhttp3/MultipartReader.kt

          // Read a boundary, skipping the remainder of the preceding part as necessary.
          if (partCount == 0 && source.rangeEquals(0L, dashDashBoundary)) {
            // This is the first part. Consume "--" followed by the boundary.
            source.skip(dashDashBoundary.size.toLong())
          } else {
            // This is a subsequent part or a preamble. Skip until "\r\n--" followed by the boundary.
            while (true) {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  10. docs/en/docs/help-fastapi.md

    * Then check that the tests **pass** after the PR. ✅
    
    * Many PRs don't have tests, you can **remind** them to add tests, or you can even **suggest** some tests yourself. That's one of the things that consume most time and you can help a lot with that.
    
    * Then also comment what you tried, that way I'll know that you checked it. 🤓
    
    ## Create a Pull Request { #create-a-pull-request }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 12.6K bytes
    - Click Count (0)
Back to Top