list.add(new MockRunnable(countDownLatch), exec);
    assertEquals(3L, countDownLatch.getCount());

    list.execute();

    // Verify that all of the runnables execute in a reasonable amount of time.
    assertTrue(countDownLatch.await(1L, SECONDS));
  }

  public void testExecute_idempotent() {
    AtomicInteger runCalled = new AtomicInteger();
    list.add(
        new Runnable() {
          @Override

    /**
     * Creates a new SMB1 close file request.
     *
     * @param config the CIFS configuration
     * @param fid the file identifier to close
     * @param lastWriteTime the last write time to set on the file
     */
    public SmbComClose(final Configuration config, final int fid, final long lastWriteTime) {
        super(config, SMB_COM_CLOSE);
        this.fid = fid;
        this.lastWriteTime = lastWriteTime;

      for (int j = 0; j < datasetSize; j++) {
        datasets[i][j] = rng.nextDouble();
      }
    }
  }

  private double[] dataset(int i) {
    // We must test on a fresh clone of the dataset each time. Doing sorts and quickselects on a
    // dataset which is already sorted or partially sorted is cheating.
    return datasets[i & 0xFF].clone();
  }

  @Benchmark
  double median(int reps) {
    double dummy = 0.0;

    /**
     * The detailed error log or stack trace for the failure.
     * This field contains the full error information for debugging purposes.
     */
    public String errorLog;

    /**
     * The number of times this URL has failed.
     * This is a required field that tracks repeated failures for the same URL.
     */
    @Required
    @ValidateTypeFailure
    public String errorCount;

    /**

   * key, the choice of {@link KeyAbsentBehavior} decides which index is returned.
   *
   * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time
   * access to each list element.
   *
   * @param list the list to be searched.
   * @param key the value to be searched for.
   * @param comparator the comparator by which the list is ordered.

                          format: date-time
                          example: "2017-10-09T22:28:56.000Z"
                        content_length:
                          type: string
                          example: "29624"
                        timestamp:
                          type: string
                          format: date-time
                          example: "2017-10-09T22:28:56.000Z"

 * elements FIFO (first-in-first-out). The head of the queue is that element that has been
 * on the queue the longest time. The tail of the queue is that element that has been on
 * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue
 * retrieval operations obtain elements at the head of the queue.
 *

        // Referral flags (2 bytes)
        SMBUtil.writeInt2(0, buffer, 14);

        // Proximity (2 bytes for v3)
        SMBUtil.writeInt2(0, buffer, 16);

        // Time to live (2 bytes for v3)
        SMBUtil.writeInt2(300, buffer, 18);

        // DFS path offset (2 bytes) - points to string data
        SMBUtil.writeInt2(stringDataStart - 8, buffer, 20); // Offset from start of referral

   * types. CharBuffer has poor performance when being written into or read out of so round tripping
   * all the bytes through the buffer takes a long time. With these specialized types we can just
   * use a char array.
   *
   * @param from the object to read from
   * @param to the object to write to
   * @return the number of characters copied

## Development Commands

### Setup
```bash
# Download OpenSearch plugins (required before first build)
mvn antrun:run

# Generate DBFlute source code (when schema changes)
mvn dbflute:download  # One-time setup
mvn dbflute:freegen
mvn license:format
```

### Build
```bash
# Standard build
mvn package

# Clean build
mvn clean package

# Build distribution packages