_id stringlengths 2 7 | text stringlengths 6 2.61k | title stringclasses 1
value |
|---|---|---|
c12400 | // NewRandomGraph creates a new random graph generator. | |
c12401 | // newTriple creates new triple using the provided node IDs. | |
c12402 | // Generate creates the required number of triples. | |
c12403 | // New returns a new table that can hold data for the given bindings. The,
// table creation will fail if there are repeated bindings. | |
c12404 | // String returns a readable representation of a cell. | |
c12405 | // ToTextLine converts a row into line of text. To do so, it requires the list
// of bindings of the table, and the separator you want to use. If the separator
// is empty tabs will be used. | |
c12406 | // AddRow adds a row to the end of a table. For performance reasons, it does not
// check that all bindings are set, nor that they are declared on table
// creation. BQL builds valid tables, if you plan to create tables on your own
// you should be careful to provide valid rows. | |
c12407 | // NumRows returns the number of rows currently available on the table. | |
c12408 | // Row returns the requested row. Rows start at 0. Also, if you request a row
// beyond it will return nil, and the ok boolean will be false. | |
c12409 | // Rows returns all the available rows. | |
c12410 | // unsafeAddBindings add the new bindings provided to the table bypassing the lock. | |
c12411 | // AddBindings add the new bindings provided to the table. | |
c12412 | // ProjectBindings replaces the current bindings with the projected one. The
// provided bindings needs to be a subset of the original bindings. If the
// provided bindings are not a subset of the original ones, the projection will
// fail, leave the table unmodified, and return an error. The projection only
// modify ... | |
c12413 | // HasBinding returns true if the binding currently exist on the table. | |
c12414 | // Bindings returns the bindings contained on the tables. | |
c12415 | // equalBindings returns true if the bindings are the same, false otherwise. | |
c12416 | // AppendTable appends the content of the provided table. It will fail it the
// target table is not empty and the bindings do not match. | |
c12417 | // disjointBinding returns true if they are not overlapping bindings, false
// otherwise. | |
c12418 | // MergeRows takes a list of rows and returns a new map containing both. | |
c12419 | // DotProduct does the dot product with the provided table | |
c12420 | // Truncate flushes all the data away. It still retains all set bindings. | |
c12421 | // Limit keeps the initial ith rows. | |
c12422 | // Swap exchange the i and j rows in the table. | |
c12423 | // Less returns true if the i row is less than j one. | |
c12424 | // unsafeSort sorts the table given a sort configuration bypassing the lock. | |
c12425 | // Sort sorts the table given a sort configuration. | |
c12426 | // groupRangeReduce takes a sorted range and generates a new row containing
// the aggregated columns and the non aggregated ones. | |
c12427 | // unsafeFullGroupRangeReduce takes a sorted range and generates a new row containing
// the aggregated columns and the non aggregated ones. This call bypasses the lock. | |
c12428 | // toMap converts a list of alias and acc pairs into a nested map. The first
// key is the input binding, the second one is the output binding. | |
c12429 | // Reduce alters the table by sorting and then range grouping the table data.
// In order to group reduce the table, we sort the table and then apply the
// accumulator functions to each group. Finally, the table metadata gets
// updated to reflect the reduce operation. | |
c12430 | // Filter removes all the rows where the provided function returns true. | |
c12431 | // ToText convert the table into a readable text versions. It requires the
// separator to be used between cells. | |
c12432 | // String attempts to force serialize the table into a string. | |
c12433 | // Trace attempts to write a trace if a valid writer is provided. The
// tracer is lazy on the string generation to avoid adding too much
// overhead when tracing ins not on. | |
c12434 | // String returns a readable version of the LookupOptions instance. | |
c12435 | // UUID return the UUID of the lookup option. | |
c12436 | // NewGraph creates a new graph. | |
c12437 | // Graph returns an existing graph if available. Getting a non existing
// graph should return an error. | |
c12438 | // AddTriples adds the triples to the storage. | |
c12439 | // RemoveTriples removes the triples from the storage. | |
c12440 | // newChecker creates a new checker for a given LookupOptions configuration. | |
c12441 | // CheckAndUpdate checks if a predicate should be considered and it also updates
// the internal state in case counts are needed. | |
c12442 | // Objects published the objects for the give object and predicate to the
// provided channel. | |
c12443 | // Evaluate return the provided value. | |
c12444 | // String returns a readable string of the operation. | |
c12445 | // NewEvaluationExpression creates a new evaluator for two bindings in a row. | |
c12446 | // NewBinaryBooleanExpression creates a new binary boolean evaluator. | |
c12447 | // NewUnaryBooleanExpression creates a new unary boolean evaluator. | |
c12448 | // NewEvaluator construct an evaluator given a sequence of tokens. It will
// return a descriptive error if it could build it properly. | |
c12449 | // Strings returns the pretty printing version of the type | |
c12450 | // ToComparableString returns a string that can be directly compared. | |
c12451 | // Bool returns the value of a literal as a boolean. | |
c12452 | // Int64 returns the value of a literal as an int64. | |
c12453 | // Float64 returns the value of a literal as a float64. | |
c12454 | // Text returns the value of a literal as a string. | |
c12455 | // Build creates a new unbound literal from a type and a value. | |
c12456 | // Parse creates a string out of a prettified representation. | |
c12457 | // Build creates a new literal of bounded size. | |
c12458 | // Parse creates a string out of a prettyfied representation. | |
c12459 | // UUID returns a global unique identifier for the given literal. It is
// implemented as the SHA1 UUID of the literal value. | |
c12460 | // String returns the pretty printed version of the predicate. | |
c12461 | // Parse converts a pretty printed predicate into a predicate. | |
c12462 | // TimeAnchor attempts to return the time anchor of a predicate if its type is
// temporal. | |
c12463 | // NewImmutable creates a new immutable predicate. | |
c12464 | // NewTemporal creates a new temporal predicate. | |
c12465 | // UUID returns a global unique identifier for the given predicate. It is
// implemented as the SHA1 UUID of the predicate values. | |
c12466 | // PartialUUID returns a global unique identifier for the given predicate but it
// only takes into account the predicate ID. Usually you do not want to use this
// partial UUID and likely you want to use the standard UUID. This partial UUID
// is only useful for driver implementers when they want to take advantage
// ... | |
c12467 | // UsageString returns the command usage string.. | |
c12468 | // New creates a new tree generator. The triples are generated using breadth
// search first. All predicates are immutable and use the predicate
// `"parent_of"@[]`.` | |
c12469 | // newTriple creates a new triple given the parent and the descendant as an object. | |
c12470 | // recurse generated the triple by recursing while there are still triples
// left to generate. | |
c12471 | // Generates the requested number of triples. | |
c12472 | // String pretty prints the object. | |
c12473 | // UUID returns a global unique identifier for the given object. It is
// implemented by returning the UIUD of the underlying value stored in the
// object. | |
c12474 | // Node attempts to return the boxed node. | |
c12475 | // Predicate attempts to return the boxed predicate. | |
c12476 | // Literal attempts to return the boxed literal. | |
c12477 | // ParseObject attempts to parse an object. | |
c12478 | // New creates a new triple. | |
c12479 | // Equal checks if two triples are identical. | |
c12480 | // String marshals the triple into pretty string. | |
c12481 | // Parse process the provided text and tries to create a triple. It assumes
// that the provided text contains only one triple. | |
c12482 | // Reify given the current triple it returns the original triple and the newly
// reified ones. It also returns the newly created blank node. | |
c12483 | // UUID returns a global unique identifier for the given triple. It is
// implemented as the SHA1 UUID of the concatenated UUIDs of the subject,
// predicate, and object. | |
c12484 | // TypeBindingClauseHook returns a ClauseHook that sets the binding type. | |
c12485 | // dataAccumulator creates a element hook that tracks fully formed triples and
// adds them to the Statement when fully formed. | |
c12486 | // graphAccumulator returns an element hook that keeps track of the graphs
// listed in a statement. | |
c12487 | // whereNextWorkingClause returns a clause hook to close the current graphs
// clause and starts a new working one. | |
c12488 | // whereInitWorkingClause initialize a new working graph clause. | |
c12489 | // whereSubjectClause returns an element hook that updates the subject
// modifiers on the working graph clause. | |
c12490 | // processPredicate parses a consumed element and returns a predicate and its attributes if possible. | |
c12491 | // processPredicate parses a consumed element and returns a bound predicate and its attributes if possible. | |
c12492 | // wherePredicateClause returns an element hook that updates the predicate
// modifiers on the working graph clause. | |
c12493 | // varAccumulator returns an element hook that updates the object
// modifiers on the working graph clause. | |
c12494 | // bindingsGraphChecker validate that all input bindings are provided by the
// graph pattern. | |
c12495 | // groupByBindings collects the bindings listed in the group by clause. | |
c12496 | // groupByBindingsChecker checks that all group by bindings are valid output
// bindings. | |
c12497 | // orderByBindings collects the bindings listed in the order by clause. | |
c12498 | // orderByBindingsChecker checks that all order by bindings are valid output
// bindings. | |
c12499 | // havingExpression collects the tokens that form the HAVING clause. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.