*
     * ## Upstream
     *
     * In this case the current thread is assigned as the upstream reader. We read bytes from
     * upstream and copy them to both the file and to the buffer. Finally we release the upstream
     * reader lock and return the new bytes.
     *
     * ## The file
     *
     * In this case we copy bytes from the file to the [sink].
     *
     * ## The buffer
     *

            }

            length = (length << 8) + octet;
        } while (++octetsPos < octetsCount);

        if (length >= limit && !isParsing) // after all we must have read at least 1 byte
        {
            throw new IOException("corrupted stream - out of bounds length found: " + length + " >= " + limit);
        }

        return length;
    }

   * with linear probing in its implementation. The returned size is the smallest power of two that
   * can hold setSize elements with the desired load factor. Always returns at least setSize + 2.
   */
  // TODO(cpovirk): Move to Hashing or something, since it's used elsewhere in the Android version.
  static int chooseTableSize(int setSize) {
    setSize = max(setSize, 2);

      }
    }

    // Close the writer to release its resources (such as deflaters).
    ignoreIoExceptions {
      writer.close()
    }

    // Cancel the socket to break out the reader thread, which will clean up after itself.
    ignoreIoExceptions {
      socket.cancel()
    }

    // Release the threads.
    writerQueue.shutdown()
    pushQueue.shutdown()

                // Exponential backoff with overflow protection
                if (retryDelayMs > 0) {
                    try {
                        // Safe calculation: ensure retryCount is at least 1 for proper exponential backoff
                        int safeShift = Math.min(MAX_BACKOFF_SHIFT, Math.max(1, retryCount));
                        long multiplier = 1L << safeShift;

            }
        };

        ThreadDumpUtil.processThreadDump(countingConsumer);

        // Verify that multiple threads were processed
        assertTrue("Should process at least one thread", threadCount.get() >= 1);
        assertTrue("Should have stack trace elements", stackTraceCount.get() > 0);
        assertTrue("Should have more stack traces than threads", stackTraceCount.get() > threadCount.get());

                    pathCount++;
                }
            }
        }
        // Verify minimum expected number of paths
        assertTrue("Should have at least 100 paths, found: " + pathCount, pathCount >= 100);
    }

    public void test_detailsEditPattern() throws Exception {
        // Test common pattern: base, details, edit JSPs

            ClassCastException.class, () -> getCauseAs(thrown, IllegalStateException.class));
    assertThat(expected).hasCauseThat().isSameInstanceAs(thrown);
  }

  @AndroidIncompatible // No getJavaLangAccess in Android (at least not in the version we use).
  @J2ktIncompatible
  @GwtIncompatible // lazyStackTraceIsLazy()
  public void testLazyStackTraceWorksInProd() {
    // TODO(b/64442212): Remove this guard once lazyStackTrace() works in Java 9+.

  @Override
  protected char @Nullable [] escape(int cp) {
    // We should never get negative values here but if we do it will throw an
    // IndexOutOfBoundsException, so at least it will get spotted.
    if (cp < safeOctets.length && safeOctets[cp]) {
      return null;
    } else if (cp == ' ' && plusForSpace) {
      return plusSign;
    } else if (cp <= 0x7F) {

       */
      /*
       * A CopyOnWriteArraySet<WeakReference> is faster than a newSetFromMap of a MapMaker map with
       * weakKeys() and concurrencyLevel(1), even up to at least 12 cached exception types.
       */
      private static final Set<WeakReference<Class<? extends Exception>>> validClasses =
          new CopyOnWriteArraySet<>();

      @Override