buffer.putInt(FileNotifyInformation.FILE_ACTION_ADDED);
        buffer.putInt(fileNameBytes1.length);
        buffer.put(fileNameBytes1);

        // Pad to aligned size
        while (buffer.position() < entry1AlignedSize) {
            buffer.put((byte) 0);
        }

        // Second notification
        buffer.putInt(entry2AlignedSize); // nextEntryOffset

    lines['status'] = InvokeStatus.passed  # default to passed
    start_line = lines['start']
    end_line = lines.get('end', lines.get('next_url', len(log_lines))) - 1
    k = end_line
    while k > start_line:
      backtrack_line = log_lines[k]
      build_failed = backtrack_line.startswith(FAILED_BUILD_LINE)
      if build_failed or not backtrack_line.startswith(BUILD_STATUS_LINE):
        tests_failed = False

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Map;

/**
 * A specialized ArrayList for storing document data with additional metadata.
 * This class extends ArrayList to hold document maps while tracking content size
 * and processing time metrics. It's used throughout the Fess search system to
 * manage collections of search results and crawled documents.
 *
 */

  }

  /** Sleeps [nanos], throwing if the socket is closed before that period has elapsed. */
  fun sleepWhileOpen(nanos: Long) {
    var ms = nanos / 1_000_000L
    val ns = nanos - (ms * 1_000_000L)

    while (ms > 100) {
      Thread.sleep(100)
      if (javaNetSocket.isClosed) throw InterruptedIOException("socket closed")
      ms -= 100L
    }

    if (ms > 0L || ns > 0) {
      Thread.sleep(ms, ns.toInt())

        int elemStart = bufferOffset;
        FileNotifyInformationImpl i = new FileNotifyInformationImpl();
        bufferIndex += i.decode(buffer, bufferOffset, len);
        this.notifyInformation.add(i);

        while (i.getNextEntryOffset() > 0 && bufferIndex < bufferOffset + len) {
            bufferIndex = elemStart + i.getNextEntryOffset();
            elemStart = bufferIndex;

            i = new FileNotifyInformationImpl();

 * general way.
 *
 * <p>A good example of usage of this class is for HTML escaping where the replacement array
 * contains information about the named HTML entities such as {@code &amp;} and {@code &quot;} while
 * {@link #escapeUnsafe} is overridden to handle general escaping of the form {@code &#NNNNN;}.
 *
 * <p>The size of the data structure used by {@link ArrayBasedUnicodeEscaper} is proportional to the

     */
    boolean isAllowStubModel();

    /**
     * Determines whether the project builder should recursively build parent/child projects.
     * When true, the builder will process parent POMs and child modules as needed.
     *
     * @return true if the build should be recursive, false otherwise
     */
    boolean isRecursive();

    /**

    val actualUrls = calls.map { it.request.url.toString() }
    assertThat(actualUrls).containsExactly(*expectedUrls)
  }

  fun finishJob(url: String) {
    val i = calls.iterator()
    while (i.hasNext()) {
      val call = i.next()
      if (call.request.url.toString() == url) {
        i.remove()
        dispatcherTest.dispatcher.finishedAccessor(call)
        return
      }
    }

    /**
     * Generic read permission
     */
    int GENERIC_READ = 0x80000000; // 31

    /**
     * Inheritance flag: child objects inherit this ACE
     */
    int FLAGS_OBJECT_INHERIT = 0x01;
    /**
     * Inheritance flag: child containers inherit this ACE
     */
    int FLAGS_CONTAINER_INHERIT = 0x02;
    /**
     * Inheritance flag: inheritance stops after one level
     */

     * 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() {