core

type Count ¶

type Count struct{}

Count incoming elements

func (c *Count) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type DefaultCompiler ¶

type DefaultCompiler struct {
	// contains filtered or unexported fields
}

DefaultCompiler is the core compiler that works with default graph interface

func (comp DefaultCompiler) Compile(stmts []*gripql.GraphStatement, opts *gdbi.CompileOptions) (gdbi.Pipeline, error)

type DefaultPipeline ¶

type DefaultPipeline struct {
	// contains filtered or unexported fields
}

DefaultPipeline a set of runnable query operations

func NewPipeline(graph gdbi.GraphInterface, procs []gdbi.Processor, ps *pipeline.State) *DefaultPipeline

func (pipe *DefaultPipeline) DataType() gdbi.DataType

func (pipe *DefaultPipeline) Graph() gdbi.GraphInterface

func (pipe *DefaultPipeline) MarkTypes() map[string]gdbi.DataType

func (pipe *DefaultPipeline) Processors() []gdbi.Processor

type Distinct ¶

type Distinct struct {
	// contains filtered or unexported fields
}

Distinct only returns unique objects as defined by the set of select features

func (g *Distinct) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Fields ¶

type Fields struct {
	// contains filtered or unexported fields
}

Fields selects fields from current element

func (f *Fields) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Has ¶

type Has struct {
	// contains filtered or unexported fields
}

Has filters based on data

func (w *Has) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type HasID ¶

type HasID struct {
	// contains filtered or unexported fields
}

HasID filters elements based on their id.

func (h *HasID) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type HasKey ¶

type HasKey struct {
	// contains filtered or unexported fields
}

HasKey filters elements based on whether it has one or more properties.

func (h *HasKey) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type HasLabel ¶

type HasLabel struct {
	// contains filtered or unexported fields
}

HasLabel filters elements based on their label.

func (h *HasLabel) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type InE ¶

type InE struct {
	// contains filtered or unexported fields
}

InE finds the incoming edges

func (l *InE) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Limit ¶

type Limit struct {
	// contains filtered or unexported fields
}

Limit limits incoming values to count

func (l *Limit) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type LookupEdgeAdjIn ¶

type LookupEdgeAdjIn struct {
	// contains filtered or unexported fields
}

LookupEdgeAdjIn finds incoming edge

func (l *LookupEdgeAdjIn) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type LookupEdgeAdjOut ¶

type LookupEdgeAdjOut struct {
	// contains filtered or unexported fields
}

LookupEdgeAdjOut finds out edge

func (l *LookupEdgeAdjOut) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type LookupEdges ¶

type LookupEdges struct {
	// contains filtered or unexported fields
}

LookupEdges starts query by looking up edges

func (l *LookupEdges) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type LookupVertexAdjIn ¶

type LookupVertexAdjIn struct {
	// contains filtered or unexported fields
}

LookupVertexAdjIn finds incoming vertex

func (l *LookupVertexAdjIn) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type LookupVertexAdjOut ¶

type LookupVertexAdjOut struct {
	// contains filtered or unexported fields
}

LookupVertexAdjOut finds out vertex

func (l *LookupVertexAdjOut) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type LookupVerts ¶

type LookupVerts struct {
	// contains filtered or unexported fields
}

LookupVerts starts query by looking on vertices

func (l *LookupVerts) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type LookupVertsIndex ¶

type LookupVertsIndex struct {
	// contains filtered or unexported fields
}

LookupVertsIndex look up vertices by indexed based feature

func (l *LookupVertsIndex) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type MarkSelect ¶

type MarkSelect struct {
	// contains filtered or unexported fields
}

MarkSelect moves to selected mark

func (s *MarkSelect) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Marker ¶

type Marker struct {
	// contains filtered or unexported fields
}

Marker marks the current element

func (m *Marker) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type OutE ¶

type OutE struct {
	// contains filtered or unexported fields
}

OutE finds the outgoing edges

func (l *OutE) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Path ¶

type Path struct {
	Template interface{} //this isn't really used yet.
}

Path tells system to return path data

func (r *Path) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type QueryOptimizer ¶

type QueryOptimizer func(pipe []*gripql.GraphStatement) []*gripql.GraphStatement

type Range ¶

type Range struct {
	// contains filtered or unexported fields
}

Range limits the number of travelers returned. When the low-end of the range is not met, objects are continued to be iterated. When within the low (inclusive) and high (exclusive) range, traversers are emitted. When above the high range, the traversal breaks out of iteration. Finally, the use of -1 on the high range will emit remaining traversers after the low range begins.

func (r *Range) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Render ¶

type Render struct {
	Template interface{}
}

Render takes current state and renders into requested structure

func (r *Render) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Selector ¶

type Selector struct {
	// contains filtered or unexported fields
}

Selector selects marks to return

func (s *Selector) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Skip ¶

type Skip struct {
	// contains filtered or unexported fields
}

Skip limits incoming values to count

func (o *Skip) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type Unwind ¶

type Unwind struct {
	Field string
}

Unwind takes an array field and replicates the message for every element in the array

func (r *Unwind) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type ValueIncrement ¶

type ValueIncrement struct {
	// contains filtered or unexported fields
}

func (s *ValueIncrement) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context

type ValueSet ¶

type ValueSet struct {
	// contains filtered or unexported fields
}

func (s *ValueSet) Process(ctx context.Context, man gdbi.Manager, in gdbi.InPipe, out gdbi.OutPipe) context.Context