and `version`. This better suits HTTP/2 where the request line had to be synthesized from
    component headers.

 *  Breaking: Change `RecordedRequest.body` from a mutable `Buffer` to an immutable `ByteString`.

 *  Breaking: Adopt Okio's new `Socket` interface for `MockResponse.socketHandler`.

Note that any _Breaking_ changes above impact only APIs introduced in earlier 5.0.0-alpha releasees.

    a = ImmutableList.of(4, 8, 15, 16, 23, 42);
    b = asList(4, 8, 15, 16, 23, 42);
    assertTrue(elementsEqual(a.iterator(), b.iterator()));

    // An element differs.
    a = asList(4, 8, 15, 12, 23, 42);
    b = asList(4, 8, 15, 16, 23, 42);
    assertFalse(elementsEqual(a.iterator(), b.iterator()));

    // null versus non-null.

// streamHTTPResponse has been used.
// The returned reader contains the payload and must be closed if no error is returned.
func waitForHTTPStream(respBody io.ReadCloser, w io.Writer) error {
	var tmp [1]byte
	// 8K copy buffer, reused for less allocs...
	bufp := poolBuf8k.Get()
	buf := *bufp
	defer poolBuf8k.Put(bufp)

	for {
		_, err := io.ReadFull(respBody, tmp[:])
		if err != nil {
			return err
		}

{ var acc byte for _, b := range x { acc |= b } return acc == 0 } // isLess reports whether a < b, where a and b are big-endian buffers of the // same length and shorter than 72 bytes. func isLess(a, b []byte) bool { if len(a) != len(b) { panic("crypto/ecdh: internal error: mismatched isLess inputs") } // Copy the values into a fixed-size preallocated little-endian buffer. // 72 bytes is enough for every scalar in this package, and having a fixed // size lets us avoid heap allocations. if len(a) >...

		m = Count(s, old)
	}
	if m == 0 {
		// Just return a copy.
		return append([]byte(nil), s...)
	}
	if n < 0 || m < n {
		n = m
	}

	// Apply replacements to buffer.
	t := make([]byte, len(s)+n*(len(new)-len(old)))
	w := 0
	start := 0
	if len(old) > 0 {
		for range n {
			j := start + Index(s[start:], old)
			w += copy(t[w:], s[start:j])

         * actual files has a smaller maxBufSize this could be
         * incorrect. To handle this properly it is necessary
         * to redirect the tree to the target server first before
         * establishing buffer size. These exists() calls facilitate
         * that.
         */
        resolveDfs(null);

        /* It is invalid for the source path to be a child of the destination
         * path or visa versa.

   * be thrown by calling {@code finishToFuture().get()} if this were the last step. Calling {@code
   * cancel()} on the returned future has no effect on the {@code ClosingFuture} pipeline.
   *
   * <p>{@code statusFuture} differs from most methods on {@code ClosingFuture}: You can make calls
   * to {@code statusFuture} <i>in addition to</i> the call you make to {@link #finishToFuture()} or

		reader = part

		possibleShardSize := (r.ContentLength - headerLen)
		if globalStorageClass.ShouldInline(possibleShardSize, false) { // keep versioned false for this check
			var b bytes.Buffer
			n, err := io.Copy(&b, reader)
			if err != nil {
				apiErr := errorCodes.ToAPIErr(ErrMalformedPOSTRequest)
				apiErr.Description = fmt.Sprintf("%s (%v)", apiErr.Description, err)

 * CacheBuilder} is its <a
 * href="https://www.javadoc.io/doc/com.github.ben-manes.caffeine/caffeine/latest/com.github.benmanes.caffeine/com/github/benmanes/caffeine/cache/Caffeine.html">{@code
 * Caffeine}</a> class. Caffeine offers better performance, more features (including asynchronous
 * loading), and fewer <a
 * href="https://github.com/google/guava/issues?q=is%3Aopen+is%3Aissue+label%3Apackage%3Dcache+label%3Atype%3Ddefect">bugs</a>.
 *

pkg bytes, method (*Buffer) ReadString(uint8) (string, error)
pkg bytes, method (*Buffer) Reset()
pkg bytes, method (*Buffer) String() string
pkg bytes, method (*Buffer) Truncate(int)
pkg bytes, method (*Buffer) UnreadByte() error
pkg bytes, method (*Buffer) UnreadRune() error
pkg bytes, method (*Buffer) Write([]uint8) (int, error)
pkg bytes, method (*Buffer) WriteByte(uint8) error
pkg bytes, method (*Buffer) WriteRune(int32) (int, error)