Creates an iterator from another iterator that will keep the results of the inner iterator in memory, so that results don't have to be re-calculated.
Creates an iterator from another iterator that extract the requested column or property based on a path
Creates a filtered iterator from another iterator. The filtering is done by passing a callback function to each of the elements and taking them out if it does not return true.
This iterator will insert values into a property of each of the records returned. The values to be inserted come out of another traversal object. This is useful when you have two separate collections and want to merge them together by placing each of the values from one collection into a property inside the other collection.
Implements a simplistic version of the popular Map-Reduce algorithm. Acts like an iterator for the original passed data after each result has been processed, thus offering a transparent wrapper for results coming from any source.
A type of collection that is aware of nested items and exposes methods to check or retrieve them
An iterator that can be used as argument for other iterators that require a RecursiveIterator, but that will always report as having no nested items.
Creates an iterator from another iterator that will modify each of the values by converting them using a callback function.
An iterator that will return the passed items in order. The order is given by the value returned in a callback function that maps each of the elements.
A Recursive iterator used to flatten nested structures and also exposes all Collection methods
Iterator for flattening elements in a tree structure while adding some visual markers for their relative position in the tree
Creates an iterator that returns elements grouped in pairs