Documentation ¶
Index ¶
- Constants
- func Type() graph.Type
- type Iterator
- func (it *Iterator) Clone() graph.Iterator
- func (it *Iterator) Close() error
- func (it *Iterator) Contains(v graph.Value) bool
- func (it *Iterator) Describe() graph.Description
- func (it *Iterator) Err() error
- func (it *Iterator) Next() bool
- func (it *Iterator) NextPath() bool
- func (it *Iterator) Optimize() (graph.Iterator, bool)
- func (it *Iterator) Reset()
- func (it *Iterator) Result() graph.Value
- func (it *Iterator) ResultTree() *graph.ResultTree
- func (it *Iterator) Size() (int64, bool)
- func (it *Iterator) Sorted() bool
- func (it *Iterator) Stats() graph.IteratorStats
- func (it *Iterator) SubIterators() []graph.Iterator
- func (it *Iterator) TagResults(dst map[string]graph.Value)
- func (it *Iterator) Tagger() *graph.Tagger
- func (it *Iterator) Type() graph.Type
- func (it *Iterator) UID() uint64
- type LinksTo
- func (it *LinksTo) Clone() graph.Iterator
- func (it *LinksTo) Close() error
- func (it *LinksTo) Contains(val graph.Value) bool
- func (it *LinksTo) Describe() graph.Description
- func (it *LinksTo) Direction() quad.Direction
- func (it *LinksTo) Err() error
- func (it *LinksTo) Next() bool
- func (it *LinksTo) NextPath() bool
- func (it *LinksTo) Optimize() (graph.Iterator, bool)
- func (it *LinksTo) Reset()
- func (it *LinksTo) Result() graph.Value
- func (it *LinksTo) ResultTree() *graph.ResultTree
- func (it *LinksTo) Size() (int64, bool)
- func (it *LinksTo) Stats() graph.IteratorStats
- func (it *LinksTo) SubIterators() []graph.Iterator
- func (it *LinksTo) TagResults(dst map[string]graph.Value)
- func (it *LinksTo) Tagger() *graph.Tagger
- func (it *LinksTo) Type() graph.Type
- func (it *LinksTo) UID() uint64
- type MongoLogEntry
- type MongoNode
- type QuadStore
- func (qs *QuadStore) ApplyDeltas(in []graph.Delta, ignoreOpts graph.IgnoreOpts) error
- func (qs *QuadStore) Close()
- func (qs *QuadStore) FixedIterator() graph.FixedIterator
- func (qs *QuadStore) Horizon() graph.PrimaryKey
- func (qs *QuadStore) NameOf(v graph.Value) string
- func (qs *QuadStore) NodesAllIterator() graph.Iterator
- func (qs *QuadStore) OptimizeIterator(it graph.Iterator) (graph.Iterator, bool)
- func (qs *QuadStore) Quad(val graph.Value) quad.Quad
- func (qs *QuadStore) QuadDirection(in graph.Value, d quad.Direction) graph.Value
- func (qs *QuadStore) QuadIterator(d quad.Direction, val graph.Value) graph.Iterator
- func (qs *QuadStore) QuadsAllIterator() graph.Iterator
- func (qs *QuadStore) Size() int64
- func (qs *QuadStore) Type() string
- func (qs *QuadStore) ValueOf(s string) graph.Value
Constants ¶
const DefaultDBName = "cayley"
const QuadStoreType = "mongo"
Variables ¶
This section is empty.
Functions ¶
Types ¶
type Iterator ¶
type Iterator struct {
// contains filtered or unexported fields
}
func NewAllIterator ¶
func NewIterator ¶
func (*Iterator) Describe ¶ added in v0.4.1
func (it *Iterator) Describe() graph.Description
func (*Iterator) ResultTree ¶
func (it *Iterator) ResultTree() *graph.ResultTree
func (*Iterator) Stats ¶
func (it *Iterator) Stats() graph.IteratorStats
func (*Iterator) SubIterators ¶
SubIterators returns no subiterators for a Mongo iterator.
type LinksTo ¶ added in v0.4.1
type LinksTo struct {
// contains filtered or unexported fields
}
LinksTo is a MongoDB-dependent version of a LinksTo iterator. Like the normal LinksTo, it represents a set of links to a set of nodes, represented by its subiterator. However, this iterator may often be faster than the generic LinksTo, as it can use the secondary indices in Mongo as features within the Mongo query, reducing the size of the result set and speeding up iteration.
func NewLinksTo ¶ added in v0.4.1
func NewLinksTo(qs *QuadStore, it graph.Iterator, collection string, d quad.Direction, lset []graph.Linkage) *LinksTo
NewLinksTo constructs a new indexed LinksTo iterator for Mongo around a direction and a subiterator of nodes.
func (*LinksTo) Describe ¶ added in v0.4.1
func (it *LinksTo) Describe() graph.Description
func (*LinksTo) ResultTree ¶ added in v0.4.1
func (it *LinksTo) ResultTree() *graph.ResultTree
DEPRECATED
func (*LinksTo) Stats ¶ added in v0.4.1
func (it *LinksTo) Stats() graph.IteratorStats
Return a guess as to how big or costly it is to next the iterator.
func (*LinksTo) SubIterators ¶ added in v0.4.1
Return a list containing only our subiterator.
func (*LinksTo) TagResults ¶ added in v0.4.1
Tag these results, and our subiterator's results.
type MongoLogEntry ¶ added in v0.4.0
type QuadStore ¶ added in v0.4.1
type QuadStore struct {
// contains filtered or unexported fields
}
func (*QuadStore) ApplyDeltas ¶ added in v0.4.1
func (*QuadStore) FixedIterator ¶ added in v0.4.1
func (qs *QuadStore) FixedIterator() graph.FixedIterator
func (*QuadStore) Horizon ¶ added in v0.4.1
func (qs *QuadStore) Horizon() graph.PrimaryKey