NewAnd creates an And iterator.

NewCount creates a new iterator to count a number of results from a provided subiterator.

Creates a new Fixed iterator with a custom comparator.

Construct a new HasA iterator, given the quad subiterator, and the quad direction for which it stands.

Construct a new LinksTo iterator around a direction and a subiterator of nodes.

Fairly useless New function.

NewRegex returns an unary operator -- a filter across the values in the relevant subiterator.

NewRegexWithRefs is like NewRegex but allows regexp iterator to match IRIs and BNodes.

Creates a new Resolver iterator.

NewSort creates a new Sort iterator.

The And iterator.

Count iterator returns one element with size of underlying iterator.

Error iterator always returns a single error with no other results.

A Fixed iterator consists of it's values, an index (where it is in the process of Next()ing) and an equality function.

A HasA consists of a reference back to the graph.QuadStore that it references, a primary subiterator, a direction in which the quads for that subiterator point, and a temporary holder for the iterator generated on Contains().

Limit iterator will stop iterating if certain a number of values were encountered.

A LinksTo has a reference back to the graph.QuadStore (to create the iterators for each node) the subiterator, and the direction the iterator comes from.

Not iterator acts like a complement for the primary iterator.

Here we define the simplest iterator -- the Null iterator.

Recursive iterator takes a base iterator and a morphism to be applied recursively, for each result.

A Resolver iterator consists of it's order, an index (where it is in the, process of iterating) and a store to resolve values from.

Skip iterator will skip certain number of values from primary iterator.

Sort iterator orders values from it's subiterator.

Unique iterator removes duplicate values from it's subiterator.