return false, Boolean, nil
		}
		return nil, Unknown, d.mkError(ErrSyntax, "in literal false")
	case 't':
		if d.remaining() < 3 {
			return nil, Unknown, d.mkError(ErrUnexpectedEOF)
		}
		//nolint:gocritic
		if d.next() == 'r' && d.next() == 'u' && d.next() == 'e' {
			return true, Boolean, nil
		}
		return nil, Unknown, d.mkError(ErrSyntax, "in literal true")
	case 'n':
		if d.remaining() < 3 {

     */
    @Override
    public boolean hasNext() {
        return this.next != null;
    }

    /**
     * {@inheritDoc}
     *
     * @see java.util.Iterator#next()
     */
    @Override
    public SmbResource next() {
        final SmbResource n = this.next;
        this.next = advance();
        return n;
    }

    /**
     * {@inheritDoc}
     *

   * guaranteed to be equal to each other.
   */
  @CanIgnoreReturnValue
  @Override
  @ParametricNullness
  E next();

  /**
   * {@inheritDoc}
   *
   * <p>Implementations may or may not support removal when a call to {@link #peek()} has occurred
   * since the most recent call to {@link #next()}.
   *

    assertThat(cycle.next()).isEqualTo("b");
    assertTrue(cycle.hasNext());
    assertThat(cycle.next()).isEqualTo("a");
    cycle.remove();
    assertEquals(singletonList("b"), iterable);
    assertTrue(cycle.hasNext());
    assertThat(cycle.next()).isEqualTo("b");
    assertTrue(cycle.hasNext());
    assertThat(cycle.next()).isEqualTo("b");
    cycle.remove();
    assertEquals(emptyList(), iterable);

        // Given
        Trans2FindNext2 next = new Trans2FindNext2(0x0101, 0, "name");
        byte[] buf = new byte[16];

        // When/Then
        assertEquals(0, next.readSetupWireFormat(buf, 0, buf.length));
        assertEquals(0, next.readParametersWireFormat(buf, 0, buf.length));
        assertEquals(0, next.readDataWireFormat(buf, 0, buf.length));
        assertEquals(0, next.writeDataWireFormat(buf, 0));
    }

      return next != null;
    }

    @Override
    @ParametricNullness
    public K next() {
      checkForConcurrentModification();
      if (next == null) {
        throw new NoSuchElementException();
      }
      current = next;
      seenKeys.add(current.getKey());
      do { // skip ahead to next unseen key
        next = next.next;

        // Act
        assertTrue(it.hasNext());
        assertEquals("first", it.next().getName()); // initial
        assertTrue(it.hasNext());
        FileEntry next = it.next();

        // Assert: "bad" was skipped due to filter exception, "good" returned
        assertNotNull(next);
        assertEquals("good", next.getName());
        assertFalse(it.hasNext());
        verify(tree, times(1)).release();
    }

        FileEntry entry3 = mock(FileEntry.class);

        // Constructor gets entry1, first next() returns it and gets entry2,
        // second next() returns entry2 and gets entry3,
        // third next() returns entry3 and exhausts
        when(delegate.hasNext()).thenReturn(true, true, true, false);
        when(delegate.next()).thenReturn(entry1, entry2, entry3);

        TestIterator iterator = new TestIterator(null);

    assertEquals(
        "next() should still return first element after peeking", "A", peekingIterator.next());

    assertEquals("Should be able to peek() at middle element", "B", peekingIterator.peek());
    assertEquals(
        "Should be able to peek() middle element multiple times", "B", peekingIterator.peek());
    assertEquals(

         * @param value
         *            the value
         * @param next
         *            the next entry
         */
        public Entry(final int hashCode, final K key, final V value, final Entry<K, V> next) {
            this.hashCode = hashCode;
            this.key = key;
            this.value = value;
            this.next = next;
        }

        @Override
        public K getKey() {