### Replication of object version and metadata

    assertTrue(queue.add("one"));
    assertTrue(queue.add("two"));
    assertTrue(queue.add("three"));
    assertEquals("one", queue.element());
    assertEquals("one", queue.peek());
    assertEquals(3, queue.size());
    assertEquals(0, queue.remainingCapacity());

    assertTrue(queue.add("four"));
    assertEquals("two", queue.element());
    assertEquals("two", queue.peek());
    assertEquals(3, queue.size());

        this.filterIndex = filterIndex;
    }

    /**
     * Returns the number of queue shards.
     * @return The number of queue shards.
     */
    public int getQueueShards() {
        return queueShards;
    }

    /**
     * Sets the number of queue shards.
     * @param queueShards The number of queue shards.
     */
    public void setQueueShards(final int queueShards) {

        UrlQueueImpl<Long> queue = new UrlQueueImpl<>();
        assertNotNull(queue);
        assertNull(queue.getId());
        assertNull(queue.getSessionId());
        assertNull(queue.getMethod());
        assertNull(queue.getUrl());
        assertNull(queue.getMetaData());
        assertNull(queue.getEncoding());
        assertNull(queue.getParentUrl());
        assertNull(queue.getDepth());

type ReplicationStats struct {
	// map of site deployment ID to site replication status
	// for site replication - maintain stats at global level
	srStats *SRStats
	// active worker stats
	workers *ActiveWorkerStat
	// queue stats cache
	qCache queueCache

	pCache proxyStatsCache
	// mrf backlog stats
	mrfStats ReplicationMRFStats
	// for bucket replication, continue to use existing cache

   * <p>After execution begins on a thread from the {@code delegate} {@link Executor}, tasks are
   * polled and executed from a task queue until there are no more tasks. The thread will not be
   * released until there are no more tasks to run.
   *
   * <p>If a task is submitted while a thread is executing tasks from the task queue, the thread
   * will not be released until that submitted task is also complete.
   *

    startNs = queue.taskRunner.backend.nanoTime()
    log(task, queue, "starting")
  }

  var completedNormally = false
  try {
    val result = block()
    completedNormally = true
    return result
  } finally {
    if (loggingEnabled) {
      val elapsedNs = queue.taskRunner.backend.nanoTime() - startNs
      if (completedNormally) {
        log(task, queue, "finished run in ${formatDuration(elapsedNs)}")

 *
 * <ul>
 *   <li>invoking the {@code finalize} methods of unreachable objects
 *   <li>clearing weak references to unreachable referents
 *   <li>enqueuing weak references to unreachable referents in their reference queue
 * </ul>
 *
 * <p>This class uses (possibly repeated) invocations of {@link java.lang.System#gc()} to cause
 * finalization to happen. However, a call to {@code System.gc()} is specified to be no more than a

pkg syscall (netbsd-arm64-cgo), func Kevent(int, []Kevent_t, []Kevent_t, *Timespec) (int, error)
pkg syscall (netbsd-arm64-cgo), func Kill(int, Signal) error
pkg syscall (netbsd-arm64-cgo), func Kqueue() (int, error)
pkg syscall (netbsd-arm64-cgo), func Listen(int, int) error
pkg syscall (netbsd-arm64-cgo), func Lstat(string, *Stat_t) error
pkg syscall (netbsd-arm64-cgo), func Mkfifo(string, uint32) error

 *
 * <ul>
 *   <li>invoking the {@code finalize} methods of unreachable objects
 *   <li>clearing weak references to unreachable referents
 *   <li>enqueuing weak references to unreachable referents in their reference queue
 * </ul>
 *
 * <p>This class uses (possibly repeated) invocations of {@link java.lang.System#gc()} to cause
 * finalization to happen. However, a call to {@code System.gc()} is specified to be no more than a