_id stringlengths 2 7 | text stringlengths 6 2.61k | title stringclasses 1
value |
|---|---|---|
c12500 | // havingExpressionBuilder given the collected tokens that forms the having
// clause expression, it builds the expression to use when filtering values
// on the final result table. | |
c12501 | // limitCollection collects the limit of rows to return as indicated by the
// LIMIT clause. | |
c12502 | // collectGlobalBounds collects the global time bounds that should be applied
// to all temporal predicates. | |
c12503 | // InitWorkingConstructClause returns a clause hook to initialize a new working
// construct clause. | |
c12504 | // NextWorkingConstructClause returns a clause hook to close the current working
// construct clause and start a new working construct clause. | |
c12505 | // constructSubject returns an element hook that updates the subject
// modifiers on the working construct clause. | |
c12506 | // constructPredicate returns an element hook that updates the predicate
// modifiers on the current predicate-object pair of the working graph clause. | |
c12507 | // constructObject returns an element hook that updates the object
// modifiers on the current predicate-object pair of the working graph clause. | |
c12508 | // NextWorkingConstructPredicateObjectPair returns a clause hook to close the current
// predicate-object pair and start a new predicate-object pair within the working
// construct clause. | |
c12509 | // ShowClauseHook returns a clause hook for the show statement. | |
c12510 | // getTreeGenerators returns the set of tree generators to use while creating
// benchmarks. | |
c12511 | // getGraphGenerators returns the set of tree generators to use while creating
// benchmarks. | |
c12512 | // assertCommand runs all the BQL statements available in the file. | |
c12513 | // runCommand runs all the BQL statements available in the file. | |
c12514 | // BQL attempts to execute the provided query against the given store. | |
c12515 | // NewConsumedToken create a new consumed element that boxes a token. | |
c12516 | // ToNode converts the node found by the lexer and converts it into a BadWolf
// node. | |
c12517 | // ToPredicate converts the node found by the lexer and converts it into a
// BadWolf predicate. | |
c12518 | // ToLiteral converts the node found by the lexer and converts it into a
// BadWolf literal. | |
c12519 | // Covariant checks for given two types A and B, A covariant B if B _is a_ A.
// In other word, A _covariant_ B if B is a prefix of A. | |
c12520 | // String returns a pretty printing representation of Node. | |
c12521 | // Parse returns a node given a pretty printed representation of a Node or a BlankNode. | |
c12522 | // Covariant checks if the types of two nodes is covariant. | |
c12523 | // NewType creates a new type from plain string. | |
c12524 | // NewID create a new ID from a plain string. | |
c12525 | // NewNode returns a new node constructed from a type and an ID. | |
c12526 | // NewNodeFromStrings returns a new node constructed from a type and ID
// represented as plain strings. | |
c12527 | // NewBlankNode creates a new blank node. The blank node ID is guaranteed to
// be unique in BadWolf. | |
c12528 | // UUID returns a global unique identifier for the given node. It is
// implemented as the SHA1 UUID of the node values. | |
c12529 | // String provides a readable version of the StatementType. | |
c12530 | // BindingsMap returns the binding map for the graph clause. | |
c12531 | // Bindings returns the list of unique bindings listed in the graph clause. | |
c12532 | // String returns a readable representation of a construct clause. | |
c12533 | // String returns a readable representation of a ConstructPredicateObjectPair. | |
c12534 | // AddGraph adds a graph to a given statement. | |
c12535 | // AddInputGraph adds an input graph to a given statement. | |
c12536 | // AddOutputGraph adds an output graph to a given statement. | |
c12537 | // Init initializes all graphs given the graph names. | |
c12538 | // AddData adds a triple to a given statement's data. | |
c12539 | // AddWorkingGraphClause adds the current working graph clause to the set of
// clauses that form the graph pattern. | |
c12540 | // BindingsMap returns the set of bindings available on the graph clauses for the
// statement. | |
c12541 | // Bindings returns the list of bindings available on the graph clauses for he
// statement. | |
c12542 | // Swap exchanges the i and j elements in the clauses array. | |
c12543 | // Less returns true if the i element is less specific than j one. | |
c12544 | // SortedGraphPatternClauses return the list of graph pattern clauses | |
c12545 | // String returns a readable form of the projection. | |
c12546 | // IsEmpty checks if the given projection is empty. | |
c12547 | // WorkingProjection returns the current working variable projection. | |
c12548 | // AddWorkingProjection adds the current projection variable to the set of
// projects that this statement. | |
c12549 | // InputBindings returns the list of incoming bindings feed from a where clause. | |
c12550 | // OutputBindings returns the list of binding that a query will return. | |
c12551 | // AddWorkingConstructClause adds the current working construct clause to the set
// of construct clauses that form the construct statement. | |
c12552 | // AddWorkingPredicateObjectPair adds the working predicate-object pair to the set
// of predicate-object pairs belonging to the construct clause. | |
c12553 | // NewSymbol creates a new element from a symbol. | |
c12554 | // NewTokenType creates a new element from a token. | |
c12555 | // NewParser creates a new recursive descent parser for a left factorized
// grammar. | |
c12556 | // Parse attempts to run the parser for the given input. | |
c12557 | // consume attempts to consume all input tokens for the provided symbols given
// the parser grammar. | |
c12558 | // expect given the input, symbol, and clause attempts to satisfy all elements. | |
c12559 | // getGraphFromStore returns a Graph. Will create it if it does not exist. | |
c12560 | // populateSources create all the graph required for the story and
// populates it with the provided data. | |
c12561 | // cleanSources create all the graph required for the story and
// populates it with the provided data. | |
c12562 | // runAssertion runs the assertion and compares the outcome. Returns the outcome
// of comparing the obtained result table with the assertion table if there is
// no error during the assertion. | |
c12563 | // Run evaluates a story. Returns if the story is true or not. It will also
// return an error if something wrong happen along the way. It is worth
// mentioning that Run does not clear any data available in the provided
// storage. | |
c12564 | // RunStories runs a the provided stories and returns the outcome of each of
// them. | |
c12565 | // runServer runs the simple BQL endpoint. | |
c12566 | // bqlHandler imPathUnescapeplements the handler to server BQL requests. | |
c12567 | // getQueries returns the list of queries found. It will split them if needed. | |
c12568 | // defaultHandler implements the handler to server BQL requests. | |
c12569 | // reportError reports the given error. | |
c12570 | // REPL starts a read-evaluation-print-loop to run BQL commands. | |
c12571 | // printHelp prints help for the console commands. | |
c12572 | // runBQLFromFile loads all the statements in the file and runs them. | |
c12573 | // runBQL attempts to execute the provided query against the given store. | |
c12574 | // planBQL attempts to create the execution plan for the provided query against the given store. | |
c12575 | // Marshal serializes the story into a JSON readable string. | |
c12576 | // Unmarshal rebuilds a story from a JSON readable string. | |
c12577 | // inferCell builds a Cell out of the provided string. | |
c12578 | // OutputTable returns the expected result table for the must result table
// provided by the story. | |
c12579 | // updateTimeBounds updates the time bounds use for the lookup based on the
// provided graph clause. | |
c12580 | // updateTimeBoundsForRow updates the time bounds use for the lookup based on
// the provided graph clause. | |
c12581 | // simpleExist returns true if the triple exist. Return the unfeasible state,
// the table and the error if present. | |
c12582 | // addTriples add all the retrieved triples from the graphs into the results
// table. The semantic graph clause is also passed to be able to identify what
// bindings to set. | |
c12583 | // objectToCell returns a cell containing the data boxed in the object. | |
c12584 | // runAll executes all the canned benchmarks and prints out the stats. | |
c12585 | // runBattery executes all the canned benchmarks and prints out the stats. | |
c12586 | // GetStatementsFromFile returns the statements found in the provided file. | |
c12587 | // ReadLines from a file into a string array. | |
c12588 | // ProcessLines from a file using the provided call back. The error of the
// callback will be passed through. Returns the number of processed errors
// before the error. Returns the line where the error occurred or the total
// numbers of lines processed. | |
c12589 | // ReadIntoGraph reads a graph out of the provided reader. The data on the
// reader is interpret as text. Each line represents one triple using the
// standard serialized format. ReadIntoGraph will stop if fails to Parse
// a triple on the stream. The triples read till then would have also been
// added to the graph. ... | |
c12590 | // WriteGraph serializes the graph into the writer where each triple is
// marshaled into a separate line. If there is an error writing the
// serialization will stop. It returns the number of triples serialized
// regardless if it succeeded or failed partially. | |
c12591 | // AddGraphTriplesBenchmark creates the benchmark. | |
c12592 | // Registers the available drivers. | |
c12593 | // lex creates a new lexer for the given input | |
c12594 | // New return a new read only channel with the tokens found in the provided
// input string. | |
c12595 | // lexToken represents the initial state for token identification. | |
c12596 | // isSingleSymbolToken checks if a single char should be lexed. | |
c12597 | // lexBinding lexes a binding variable. | |
c12598 | // lexSpace consumes spaces without emitting any token. | |
c12599 | // lexBlankNode tries to lex a blank node out of the input |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.