}
			in.beginningOfLine = tok == '\n'
			if in.enabled() {
				in.text = in.Stack.Text()
				return tok
			}
		}
	}
	in.Error("recursive macro invocation")
	return 0
}

func (in *Input) Text() string {
	return in.text
}

// hash processes a # preprocessor directive. It reports whether it completes.
func (in *Input) hash() bool {

        /** The element */
        protected E element;

        /** The next entry */
        protected Entry next;

        /** The previous entry */
        protected Entry previous;

        Entry(final E element, final Entry next, final Entry previous) {
            this.element = element;
            this.next = next;
            this.previous = previous;
        }

        /**

                assertFalse(iterator3.hasNext(), "Third instance should have no elements");

                assertNull(iterator1.next(), "First instance next() should return null");
                assertNull(iterator2.next(), "Second instance next() should return null");
                assertNull(iterator3.next(), "Third instance next() should return null");
            } catch (CIFSException e) {
                throw new RuntimeException(e);
            }

    assertRoute(selection.next(), address, Proxy.NO_PROXY, dns.lookup(uriHost, 0), uriPort)
    assertThat(selection.hasNext()).isFalse()
    assertFailsWith<NoSuchElementException> {
      selection.next()
    }
    assertThat(routeSelector.hasNext()).isFalse()
    assertFailsWith<NoSuchElementException> {
      routeSelector.next()
    }
  }

  @Test fun explicitProxyTriesThatProxysAddressesOnly() {
    val address =

	}
	tok = p.next()
	if tok.ScanToken == '+' {
		if p.next().ScanToken != scanner.Int {
			return "", obj.ABI0, false
		}
		tok = p.next()
	}
	if tok.ScanToken != '(' {
		return "", obj.ABI0, false
	}
	if reg := p.next(); reg.ScanToken != scanner.Ident || reg.String() != "SB" {
		return "", obj.ABI0, false
	}
	if p.next().ScanToken != ')' || p.peek() != scanner.EOF {

        SmbResource result = iterator.next();
        assertNotNull(result, "Should still be able to get element");
        assertEquals("file1.txt", result.getName());

        assertFalse(iterator.hasNext(), "Should not have more elements");

        // Verify delegate.next() was only called once
        verify(mockDelegate, times(1)).next();
    }

    /**

                    }

                    DfsReferralDataInternal next = dr;
                    do {
                        next.stripPathConsumed(1 + domain.length() + 1 + root.length());
                        next = next.next();
                    } while (next != dr);

                    if (dr.getPathConsumed() > (path != null ? path.length() : 0)) {

        // 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();
    }

          return this;
        case CLOSED:
          C next = domain.next(endpoint);
          return (next == null) ? Cut.belowAll() : belowValue(next);
      }
      throw new AssertionError();
    }

    @Override
    Cut<C> withUpperBoundType(BoundType boundType, DiscreteDomain<C> domain) {
      switch (boundType) {
        case OPEN:
          C next = domain.next(endpoint);

    assertEquals((Integer) 12, it.next());
    assertEquals((Integer) 30, it.next());
    assertEquals((Integer) 40, it.next());
    // Skipping 20
    assertEquals((Integer) 11, it.next());
    // Not skipping 400, because it moved back down
    assertEquals((Integer) 400, it.next());
    assertEquals((Integer) 13, it.next());
    assertEquals((Integer) 200, it.next());
    assertEquals((Integer) 300, it.next());