| AdvanceUntilScanner<T> |
|
| AdvanceWhileScanner<T> |
|
| ArrayScanner<T> |
|
| BaseLinkedScanner<T,R> |
Subclasses do not have to worry about closing the input scanner.
|
| BaseScanner<T> |
Simple Scanners can extend this to avoid declaring the "current" field and "getCurrent" method
|
| BatchingScanner<T> |
|
| CollatingScanner<T> |
|
| ComparableScanner<T> |
|
| ConcatenatingScanner<T> |
|
| DeduplicatingScanner<T,R> |
|
| DistinctScanner<T,R> |
|
| EachScanner<T> |
|
| EmptyScanner<T> |
|
| FilteringScanner<T> |
|
| GeneratingScanner<T> |
|
| IterableScanner |
|
| IteratingScanner<T> |
|
| IteratorScanner<T> |
|
| LimitingScanner<T> |
|
| MappingScanner<T,R> |
|
| NaturalSortingScanner<T> |
|
| ObjectScanner<T> |
|
| OptionalScanner |
|
| PagingScanner<K,T> |
Base class for things that page through results by passing the last item as an exclusive start key for the next page
|
| ParallelMappingScanner<T,R> |
|
| ParallelScanner<T> |
|
| ParallelScannerContext |
|
| PrefetchingScanner<T> |
|
| RandomAccessScanner<T> |
Avoid an intermediate Iterator when scanning a List with RandomAccess layout.
|
| RetainingGroup<T> |
|
| RetainingScanner<T> |
|
| SamplingScanner<T> |
|
| Scanner<T> |
A form of iterator that operates as lazily as possible, not knowing if the next item is available until advancing and
dropping the reference to the previous item.
|
| ScannerConsumerFunction<T> |
|
| ScannerIterator<T> |
|
| ScannerPredicateFunction<T> |
|
| ScannerPredicateFunction.ScannerPredicateFunctionResult<T> |
|
| ScannerStream<T> |
Wrapper around a Scanner to allow closing it without explicitly closing the Stream.
|
| ScannerToGroups<T,K,V,C extends Collection<V>,M extends Map<K,C>> |
|
| ScannerToMap<T,K,V,M extends Map<K,V>> |
|
| ScannerToMap.Replace |
|
| ScannerTool |
|
| ShufflingScanner<T> |
|
| SortingScanner<T> |
|
| SplittingScanner<T,R> |
|
| SteppingScanner<T> |
|
| StreamScanner<T> |
|