* CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)
     * and then to XOR them together.  The strideTable enables us to hash an int followed by 12
     * zero bytes (3 ints), while the byteTable is for advancing one byte at a time.
     * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget"
     * by Kadatch and Jenkins, 2010.
     */

    Crc32cHasher() {

        method.setAccessible(true);
        return (FileEntry[]) method.invoke(response);
    }

    private Method getReadStringMethod() throws Exception {
        Class<?> clazz = response.getClass();
        while (clazz != null) {
            try {
                Method method = clazz.getDeclaredMethod("readString", byte[].class, int.class, int.class, boolean.class);
                method.setAccessible(true);

   */
  public static String commonPrefix(CharSequence a, CharSequence b) {
    checkNotNull(a);
    checkNotNull(b);

    int maxPrefixLength = min(a.length(), b.length());
    int p = 0;
    while (p < maxPrefixLength && a.charAt(p) == b.charAt(p)) {
      p++;
    }
    if (validSurrogatePairAt(a, p - 1) || validSurrogatePairAt(b, p - 1)) {
      p--;
    }
    return a.subSequence(0, p).toString();
  }

) : Sink by delegate {
  private var bytesWrittenSinceLastDelay = 0L

  override fun write(
    source: Buffer,
    byteCount: Long,
  ) {
    var bytesLeft = byteCount

    while (bytesLeft > 0) {
      if (bytesWrittenSinceLastDelay == bytesPerPeriod) {
        flush()
        socket.sleepWhileOpen(periodDelayNanos)
        bytesWrittenSinceLastDelay = 0
      }

    private volatile boolean shouldStop = false;

    Interruptenator(Thread interruptee) {
      this.interruptee = interruptee;
    }

    @Override
    public void run() {
      while (!shouldStop) {
        interruptee.interrupt();
      }
    }

    void stopInterrupting() {
      shouldStop = true;
    }
  }

          new ImmutableList.Builder<>(ranges.size());
      sort(ranges, rangeLexOrdering());
      PeekingIterator<Range<C>> peekingItr = peekingIterator(ranges.iterator());
      while (peekingItr.hasNext()) {
        Range<C> range = peekingItr.next();
        while (peekingItr.hasNext()) {
          Range<C> nextRange = peekingItr.peek();
          if (range.isConnected(nextRange)) {
            checkArgument(

      return read(cbuf, off, len);
    }
    return result;
  }

  @Override
  public long skip(long n) throws IOException {
    Preconditions.checkArgument(n >= 0, "n is negative");
    if (n > 0) {
      while (current != null) {
        long result = current.skip(n);
        if (result > 0) {
          return result;
        }
        advance();
      }
    }
    return 0;
  }

  @Override

 */
package org.apache.maven;

import org.apache.maven.plugin.MojoFailureException;

/**
 * Exception which occurs when a normal (i.e. non-aggregator) mojo fails to
 * execute. In this case, the mojo failed while executing against a particular
 * project instance, so we can wrap the {@link MojoFailureException} with context
 * information including projectId that caused the failure.
 *
 *
 */

      return 1
    fi
  fi
}

# hash string like Java String::hashCode
hash_string() {
  str="${1:-}" h=0
  while [ -n "$str" ]; do
    char="${str%"${str#?}"}"
    h=$(((h * 31 + $(LC_CTYPE=C printf %d "'$char")) % 4294967296))
    str="${str#?}"
  done
  printf %x\\n $h
}

verbose() { :; }

        w.start();

        // Wait until writer thread signals readiness
        synchronized (w) {
            long deadline = System.currentTimeMillis() + 2000;
            while (!w.isReady() && System.currentTimeMillis() < deadline) {
                w.wait(10);
            }
            assertTrue(w.isReady(), "WriterThread should be ready to accept work");

            // Act: submit a write