103104105106107108109110111112113
for (int i = 0; i < 11777; i++) { if (reader.isExhausted()) { reader.nextBlock(); } assertEquals(i, reader.nextDocument()); final int frq = reader.nextNodeFreq(); assertTrue(frq > 0); assertTrue(frq <= 10); } in.close();
108109110111112113114115116117118