Define an equality function of purely ==, which works for native types.

Creates a new And iterator.

Creates a new Fixed iterator with a custom comparitor.

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

Creates a new Int64 with the given range.

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

Fairly useless New function.

Creates a new optional iterator.

The And iterator.

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.TripleStore that it references, a primary subiterator, a direction in which the triples for that subiterator point, and a temporary holder for the iterator generated on Contains().

An All iterator across a range of int64 values, from `max` to `min`.

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

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

An optional iterator has the sub-constraint iterator we wish to be optional and whether the last check we received was true or false.

Keyer provides a method for comparing types that are not otherwise comparable.

Define the signature of an equality function.