gql

README

Comparing the old and new methods, we find that using slice makes the parsing 20% faster on average than using channels. Also, using slices allows the parser to backtrack and peek the tokens which couldn't be done using channels as each token can only be consumed once.

Name                              unit    Old     New     Improvement
----------------------------------------------------------------------
Benchmark_Filters-4               ns/op   14007   9634    31 %
Benchmark_Geq-4                   ns/op   11701   8602    26 %
Benchmark_Date-4                  ns/op   11687   8630    26 %
Benchmark_directors-4             ns/op   18663   14201   23 %
Benchmark_Filters_parallel-4      ns/op   6486    5015    22 %
Benchmark_Movies-4                ns/op   16097   12807   20 %
Benchmark_directors_parallel-4    ns/op   8766    6966    20 %
Benchmark_Mutation-4              ns/op   5167    4155    19 %
Benchmark_Movies_parallel-4       ns/op   7537    6151    18 %
Benchmark_Date_parallel-4         ns/op   5462    4515    17 %
Benchmark_Geq_parallel-4          ns/op   5390    4485    16 %
Benchmark_Mutation_parallel-4     ns/op   2326    2161    07 %
Benchmark_Mutation1000-4          ns/op   549428  512851  06 %
Benchmark_Mutation1000_parallel-4 ns/op   261785  254911  02 %

Documentation

Overview

Package gql is responsible for lexing and parsing a GraphQL query/mutation.

Index

• Constants
• Variables
• func ParseMutation(mutation string) (*api.Mutation, error)
• func ParseUid(xid string) (uint64, error)
• type Arg
• type Count
• type FilterTree
• type Function
  • func (f *Function) IsAggregator() bool
  • func (f *Function) IsPasswordVerifier() bool
• type GraphQuery
  • func (gq *GraphQuery) DebugPrint(prefix string)
• type GroupByAttr
• type MathTree
• type Mutation
  • func (m Mutation) HasOps() bool
• type NQuad
  • func (nq NQuad) CreateUidEdge(subjectUid uint64, objectUid uint64) *intern.DirectedEdge
  • func (nq NQuad) CreateValueEdge(subjectUid uint64) (*intern.DirectedEdge, error)
  • func (nq NQuad) ToDeletePredEdge() (*intern.DirectedEdge, error)
  • func (nq NQuad) ToEdgeUsing(newToUid map[string]uint64) (*intern.DirectedEdge, error)
• type RecurseArgs
• type Request
• type Result
  • func Parse(r Request) (res Result, rerr error)
• type VarContext
• type Vars

Constants

const (
	ANY_VAR   = 0
	UID_VAR   = 1
	VALUE_VAR = 2
	LIST_VAR  = 3
)

Variables

var (
	ErrInvalidUID = errors.New("UID has to be greater than one.")
)

Functions

func ParseMutation

func ParseMutation(mutation string) (*api.Mutation, error)

func ParseUid

func ParseUid(xid string) (uint64, error)

Gets the uid corresponding

Types

type Arg

type Arg struct {
	Value        string
	IsValueVar   bool // If argument is val(a)
	IsGraphQLVar bool
}

type Count

type Count int

type FilterTree

type FilterTree struct {
	Op    string
	Child []*FilterTree
	Func  *Function
}

FilterTree is the result of parsing the filter directive. Either you can have `Op and Children` on non-leaf nodes Or Func at leaf nodes.

type Function

type Function struct {
	Attr       string
	Lang       string // language of the attribute value
	Name       string // Specifies the name of the function.
	Args       []Arg  // Contains the arguments of the function.
	UID        []uint64
	NeedsVar   []VarContext // If the function requires some variable
	IsCount    bool         // gt(count(friends),0)
	IsValueVar bool         // eq(val(s), 5)
}

Function holds the information about gql functions.

func (*Function) IsAggregator

func (f *Function) IsAggregator() bool

func (*Function) IsPasswordVerifier

func (f *Function) IsPasswordVerifier() bool

type GraphQuery

type GraphQuery struct {
	UID        []uint64
	Attr       string
	Langs      []string
	Alias      string
	IsCount    bool
	IsInternal bool
	IsGroupby  bool
	Var        string
	NeedsVar   []VarContext
	Func       *Function
	Expand     string // Which variable to expand with.

	Args map[string]string
	// Query can have multiple sort parameters.
	Order        []*intern.Order
	Children     []*GraphQuery
	Filter       *FilterTree
	MathExp      *MathTree
	Normalize    bool
	Recurse      bool
	RecurseArgs  RecurseArgs
	Cascade      bool
	IgnoreReflex bool
	Facets       *intern.FacetParams
	FacetsFilter *FilterTree
	GroupbyAttrs []GroupByAttr
	FacetVar     map[string]string
	FacetOrder   string
	FacetDesc    bool

	// Indicates whether count of uids is requested as a child node. If
	// there is a child with count() attr, then this is not empty for the parent.
	// If there is an alias, this has the alias value, else its value is count.
	UidCount string
	// True for blocks that don't have a starting function and hence no starting nodes. They are
	// used to aggregate and get variables defined in another block.
	IsEmpty bool
	// contains filtered or unexported fields
}

GraphQuery stores the parsed Query in a tree format. This gets converted to intern.y used query.SubGraph before processing the query.

func (*GraphQuery) DebugPrint

func (gq *GraphQuery) DebugPrint(prefix string)

DebugPrint is useful for debugging.

type GroupByAttr

type GroupByAttr struct {
	Attr  string
	Alias string
	Langs []string
}

type MathTree

type MathTree struct {
	Fn    string
	Var   string
	Const types.Val // This will always be parsed as a float value
	Val   map[uint64]types.Val
	Child []*MathTree
}

type Mutation

type Mutation struct {
	Set     []*api.NQuad
	Del     []*api.NQuad
	DropAll bool
	Schema  string
}

Mutation stores the strings corresponding to set and delete operations.

func (Mutation) HasOps

func (m Mutation) HasOps() bool

HasOps returns true iff the mutation has at least one non-empty part.

type NQuad

type NQuad struct {
	*api.NQuad
}

func (NQuad) CreateUidEdge

func (nq NQuad) CreateUidEdge(subjectUid uint64, objectUid uint64) *intern.DirectedEdge

func (NQuad) CreateValueEdge

func (nq NQuad) CreateValueEdge(subjectUid uint64) (*intern.DirectedEdge, error)

func (NQuad) ToDeletePredEdge

func (nq NQuad) ToDeletePredEdge() (*intern.DirectedEdge, error)

func (NQuad) ToEdgeUsing

func (nq NQuad) ToEdgeUsing(newToUid map[string]uint64) (*intern.DirectedEdge, error)

ToEdgeUsing determines the UIDs for the provided XIDs and populates the xidToUid map.

type RecurseArgs

type RecurseArgs struct {
	Depth     uint64
	AllowLoop bool
}

type Request

type Request struct {
	Str       string
	Variables map[string]string
}

type Result

type Result struct {
	Query     []*GraphQuery
	QueryVars []*Vars
	Schema    *intern.SchemaRequest
}

Result struct contains the Query list, its corresponding variable use list and the mutation block.

func Parse

func Parse(r Request) (res Result, rerr error)

Parse initializes and runs the lexer. It also constructs the GraphQuery subgraph from the lexed items.

type VarContext

type VarContext struct {
	Name string
	Typ  int //  1 for UID vars, 2 for value vars
}

type Vars

type Vars struct {
	Defines []string
	Needs   []string
}

Vars struct contains the list of variables defined and used by a query block.