if (labels[currentLabelIndex].size == currentLabelByteIndex) {
            // We've exhausted our current label. Either there are more labels to compare, in which
            // case we expect a dot as the next character. Otherwise, we've checked all our labels.
            if (currentLabelIndex == labels.size - 1) {
              break
            } else {
              currentLabelIndex++

    return new AbstractSequentialIterator<C>(first()) {
      final C last = last();

      @Override
      protected @Nullable C computeNext(C previous) {
        return equalsOrThrow(previous, last) ? null : domain.next(previous);
      }
    };
  }

  @GwtIncompatible // NavigableSet
  @Override
  public UnmodifiableIterator<C> descendingIterator() {
    return new AbstractSequentialIterator<C>(last()) {

    void testGetNextResponse() {
        // When
        CommonServerMessageBlockResponse nextResponse = response.getNextResponse();

        // Then - should return null as no next response is set
        assertEquals(null, nextResponse);
    }

    @Test
    @DisplayName("Should handle prepare method correctly")
    void testPrepareMethod() {
        // Given

            byte[] buf = new byte[16];

            // Skip advances internal file pointer; next read should use this offset
            in.skip(2);

            // Act
            int n = in.readDirect(buf, 0, 5);

            // Assert

   */
  protected @Nullable V standardRemove(@Nullable Object key) {
    Iterator<Entry<K, V>> entryIterator = entrySet().iterator();
    while (entryIterator.hasNext()) {
      Entry<K, V> entry = entryIterator.next();
      if (Objects.equals(entry.getKey(), key)) {
        V value = entry.getValue();
        entryIterator.remove();
        return value;
      }
    }
    return null;
  }

  /**

    Set<E> edgesConnecting = edgesConnecting(nodeU, nodeV);
    switch (edgesConnecting.size()) {
      case 0:
        return null;
      case 1:
        return edgesConnecting.iterator().next();
      default:
        throw new IllegalArgumentException(String.format(MULTIPLE_EDGES_CONNECTING, nodeU, nodeV));
    }
  }

  @Override
  public @Nullable E edgeConnectingOrNull(EndpointPair<N> endpoints) {

  }

  private static final DiscreteDomain<Integer> UNBOUNDED_DOMAIN =
      new DiscreteDomain<Integer>() {
        @Override
        public Integer next(Integer value) {
          return integers().next(value);
        }

        @Override
        public Integer previous(Integer value) {
          return integers().previous(value);
        }

        @Override

    public <T extends Address> T unwrap(final Class<T> type) {
        if (type.isAssignableFrom(this.getClass())) {
            return (T) this;
        }
        return null;
    }

    /**
     * Guess next called name to try for session establishment. These
     * methods are used by the smb package.
     *
     * @return guessed name
     */
    @Override
    public String firstCalledName() {

        // Credits
        SMBUtil.writeInt2(1, buffer, bufferIndex + 14);
        // Flags
        SMBUtil.writeInt4(1, buffer, bufferIndex + 16); // SMB2_FLAGS_SERVER_TO_REDIR
        // Next command
        SMBUtil.writeInt4(0, buffer, bufferIndex + 20);
        // Message ID
        SMBUtil.writeInt8(1, buffer, bufferIndex + 24);
        // Reserved/Async ID

  @CollectionSize.Require(SEVERAL)
  public void testDescendingNavigation() {
    List<E> descending = new ArrayList<>();
    for (Iterator<E> i = navigableSet.descendingIterator(); i.hasNext(); ) {
      descending.add(i.next());
    }
    Collections.reverse(descending);
    assertEquals(values, descending);
  }

  public void testEmptySubSet() {
    NavigableSet<E> empty = navigableSet.subSet(e0(), false, e0(), false);