Versions in this module Expand all Collapse all v0 v0.7.3 Apr 23, 2018 v0.7.2 Mar 3, 2018 v0.7.1 Jan 30, 2018 Changes in this version + type Wildcard struct + Pattern string + func (f Wildcard) BuildIterator(qs graph.QuadStore, it graph.Iterator) graph.Iterator + func (f Wildcard) Regexp() string v0.7.0 Dec 24, 2017 Changes in this version + var MaterializeThreshold = 100 + func BuildIterator(qs graph.QuadStore, s Shape) graph.Iterator + func IsNull(s Shape) bool + func Iterate(ctx context.Context, qs graph.QuadStore, s Shape) *graph.IterateChain + func One(s Shape) (graph.Value, bool) + func Walk(s Shape, fnc WalkFunc) + type AllNodes struct + func (s AllNodes) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s AllNodes) Optimize(r Optimizer) (Shape, bool) + type Comparison struct + Op iterator.Operator + Val quad.Value + func (f Comparison) BuildIterator(qs graph.QuadStore, it graph.Iterator) graph.Iterator + type Composite interface + Simplify func() Shape + type Count struct + Values Shape + func (s Count) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Count) Optimize(r Optimizer) (Shape, bool) + type Except struct + Exclude Shape + From Shape + func (s Except) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Except) Optimize(r Optimizer) (Shape, bool) + type Filter struct + Filters []ValueFilter + From Shape + func (s Filter) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Filter) Optimize(r Optimizer) (Shape, bool) + type Fixed []graph.Value + func (s *Fixed) Add(v ...graph.Value) + func (s Fixed) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Fixed) Optimize(r Optimizer) (Shape, bool) + type FixedTags struct + On Shape + Tags map[string]graph.Value + func (s FixedTags) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s FixedTags) Optimize(r Optimizer) (Shape, bool) + type InternalQuad struct + Label graph.Value + Object graph.Value + Predicate graph.Value + Subject graph.Value + func (q InternalQuad) Get(d quad.Direction) graph.Value + func (q InternalQuad) Set(d quad.Direction, v graph.Value) + type Intersect []Shape + func (s Intersect) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Intersect) Optimize(r Optimizer) (sout Shape, opt bool) + type Lookup []quad.Value + func (s *Lookup) Add(v ...quad.Value) + func (s Lookup) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Lookup) Optimize(r Optimizer) (Shape, bool) + type Materialize struct + Size int + Values Shape + func (s Materialize) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Materialize) Optimize(r Optimizer) (Shape, bool) + type NodesFrom struct + Dir quad.Direction + Quads Shape + func (s NodesFrom) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s NodesFrom) Optimize(r Optimizer) (Shape, bool) + type Null struct + func (Null) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Null) Optimize(r Optimizer) (Shape, bool) + type Optimizer interface + OptimizeShape func(s Shape) (Shape, bool) + type Optional struct + From Shape + func (s Optional) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Optional) Optimize(r Optimizer) (Shape, bool) + type Page struct + From Shape + Limit int64 + Skip int64 + func (s Page) ApplyPage(p Page) *Page + func (s Page) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Page) Optimize(r Optimizer) (Shape, bool) + type QuadFilter struct + Dir quad.Direction + Values Shape + type QuadIndexer interface + LookupQuadIndex func(c map[quad.Direction]graph.Value) (InternalQuad, bool) + SizeOfIndex func(c map[quad.Direction]graph.Value) (int64, bool) + type Quads []QuadFilter + func (s *Quads) Intersect(q ...QuadFilter) + func (s Quads) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Quads) Optimize(r Optimizer) (Shape, bool) + type QuadsAction struct + Filter map[quad.Direction]graph.Value + Result quad.Direction + Save map[quad.Direction][]string + Size int64 + func (s *QuadsAction) SetFilter(d quad.Direction, v graph.Value) + func (s QuadsAction) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s QuadsAction) Clone() QuadsAction + func (s QuadsAction) Optimize(r Optimizer) (Shape, bool) + func (s QuadsAction) Simplify() Shape + type Regexp struct + Re *regexp.Regexp + Refs bool + func (f Regexp) BuildIterator(qs graph.QuadStore, it graph.Iterator) graph.Iterator + type Save struct + From Shape + Tags []string + func (s Save) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Save) Optimize(r Optimizer) (Shape, bool) + type Shape interface + BuildIterator func(qs graph.QuadStore) graph.Iterator + Optimize func(r Optimizer) (Shape, bool) + func AddFilters(nodes Shape, filters ...ValueFilter) Shape + func Compare(nodes Shape, op iterator.Operator, v quad.Value) Shape + func Has(from, via, nodes Shape, rev bool) Shape + func HasLabels(from, via, nodes, labels Shape, rev bool) Shape + func In(from, via, labels Shape, tags ...string) Shape + func IntersectShapes(s1, s2 Shape) Shape + func Labels(from Shape) Shape + func Optimize(s Shape, qs graph.QuadStore) (Shape, bool) + func Out(from, via, labels Shape, tags ...string) Shape + func Predicates(from Shape, in bool) Shape + func SavePredicates(from Shape, in bool, tag string) Shape + func SaveVia(from, via Shape, tag string, rev, opt bool) Shape + func SaveViaLabels(from, via, labels Shape, tag string, rev, opt bool) Shape + type Union []Shape + func UnionShapes(s1, s2 Shape) Union + func (s Union) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Union) Optimize(r Optimizer) (Shape, bool) + type Unique struct + From Shape + func (s Unique) BuildIterator(qs graph.QuadStore) graph.Iterator + func (s Unique) Optimize(r Optimizer) (Shape, bool) + type ValueFilter interface + BuildIterator func(qs graph.QuadStore, it graph.Iterator) graph.Iterator + type WalkFunc func(Shape) bool
Go to main page