}

  /**
   * Returns a new immutable array containing the values in the specified range.
   *
   * <p><b>Performance note:</b> The returned array has the same full memory footprint as this one
   * does (no actual copying is performed). To reduce memory usage, use {@code subArray(start,
   * end).trimmed()}.
   */
  public ImmutableLongArray subArray(int startIndex, int endIndex) {

    }
  }

  /**
   * Removes a single instance of the specified element from this queue, if it is present. More
   * formally, removes an element {@code e} such that {@code o.equals(e)}, if this queue contains
   * one or more such elements. Returns {@code true} if this queue contained the specified element
   * (or equivalently, if this queue changed as a result of the call).
   *
   * @param o element to be removed from this queue, if present

      long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
      // we allow one second worth of work to go in a burst (i.e. take less than a second)
      assertThat(burst).isAtMost(1000);
      long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
      // but work beyond that must take at least one second
      assertThat(afterBurst).isAtLeast(1000);
    }
  }

  /**

        assertSame(c, second, "Second get should return second cached buffer");
        assertNotSame(d, third, "Third get should allocate a new buffer (not the dropped one)");
        assertEquals(3, third.length, "Allocated buffer length matches configured maximum size");
    }

    // Parameterized: exercise small variations of cache size for a simple reuse cycle
    @ParameterizedTest

    @DisplayName("close() clears pending element and hasNext() becomes false")
    void closeClearsNext() throws Exception {
        SmbFile parent = newParent();
        List<FileEntry> entries = Collections.singletonList(entry("one", SmbConstants.TYPE_SHARE));
        ShareEnumIterator it = new ShareEnumIterator(parent, entries.iterator(), null);

        assertTrue(it.hasNext());
        it.close();
        assertFalse(it.hasNext());

name: Feature Addition Request
description: I want to add a new feature
labels: ["type=addition"]
body:
  - type: markdown
    attributes:
      value: >
        Filing feature requests is one of the most popular ways to contribute to Guava.


        Be aware, though: most feature requests are not accepted, even if they're suggested by
        a full-time Guava team member. [Feedback](https://stackoverflow.com/a/4543114) from our

   */
  val scheduledTasks: List<Task>
    get() = taskRunner.withLock { futureTasks.toList() }

  /**
   * Schedules [task] for execution in [delayNanos]. A task may only have one future execution
   * scheduled. If the task is already in the queue, the earliest execution time is used.
   *
   * The target execution time is implemented on a best-effort basis. If another task in this queue

        // Create a simple context entry
        byte[] ctx = new byte[0x40];
        int ci = 0;
        SMBUtil.writeInt4(0, ctx, ci); // Next = 0 (only one)
        ci += 4;
        SMBUtil.writeInt2(0x10, ctx, ci); // NameOffset
        SMBUtil.writeInt2(4, ctx, ci + 2); // NameLength
        ci += 4;
        // Reserved (2) + DataOffset (2)

    @Test
    @DisplayName("Test readParametersWireFormat with empty buffer")
    void testReadParametersWireFormatEmptyBuffer() throws Exception {
        byte[] buffer = new byte[0];

        // Empty buffer adds one empty FileNotifyInformation
        int result = response.readParametersWireFormat(buffer, 0, 0);
        assertEquals(0, result);
        assertEquals(1, response.getNotifyInformation().size());

import okio.Buffer
import okio.BufferedSource
import okio.ByteString
import okio.ForwardingSource
import okio.Source
import okio.buffer

/**
 * Streaming decoder of data encoded following Abstract Syntax Notation One (ASN.1). There are
 * multiple variants of ASN.1, including:
 *
 *  * DER: Distinguished Encoding Rules. This further constrains ASN.1 for deterministic encoding.
 *  * BER: Basic Encoding Rules.
 *