internal package
Foswiki::Search::ResultSet is a
Foswiki::Iterator in future it will probably become more clever.
Create a new iterator over the given list of iterators. The list is not damaged in any way.
Returns false when the iterator is exhausted.
skip X elements (returns 0 if successful, or number of elements remaining to skip if there are not enough elements to skip) skip must set up next as though hasNext was called.
Return the next entry in the list.
the implementation of %SORT{"" limit="" order="" reverse="" date=""}%
it should be possible for the search engine to pre-sort, making this a nop, or to delay evaluated, partially evaluated, or even delegated to the DB/SQL