* Take the first n edges in the traversal. * @param n The number of edges to take.

* Skip the first n edges in the traversal.

* Resolve a condition value - either return the literal value or resolve a reference from the path.

* Get all incoming edges of a vertex. * @param vertexId The id of the vertex.

* Convert an AST condition value to Step condition value format. * Handles literal values, property references, variable references, and arithmetic e

* Generate a realistic document with the specified word count. * Uses a mix of common words and technical terms.

* Build an index by scanning all elements. * Called lazily on first query that could use the index. * * @param label The element label. *

* Type ordering for deterministic cross-type comparisons: * undefined < null < boolean < number < string < object * * When comparing values of diff

* Convert AST condition to Step condition format. * @param condition - The AST condition to convert * @param useDirectPropertyAccess - If true, use

* Delete a vertex from the graph.

* Enable weighted shortest path using Dijkstra's algorithm. * @param propertyName The edge property containing the weight.

* Repeat the traversal until a sub-traversal returns at least one result.

* Count the number of edges in the traversal.

* Get the key for an index.

* Creates the binary-tree-2 fixture graph. * Similar to binary-tree-1 but with different label patterns. * Nodes have labels X or Y in alternating p

* Intersect the edges in the traversal with another traversal. * @param other The other traversal to intersect with.

* Check if a property has a unique index constraint. * @param label The element label. * @param property The property name. * @returns True i

* Does the traverser emit values from the input paths? * @param source The graph source. * @param input The input paths to match. * @param co

* Clear all entries from the index.

* Compare two values using the given operator. * Returns true if the comparison holds.

* Delete an edge from the graph.

* Specify the direction of edge traversal. * @param direction The direction: "out", "in", or "both".

* Specify the maximum depth (number of hops) to search. * @param depth The maximum depth.

* Find the insertion point for a value using binary search.

* Filter edges where the specified property contains the given value. * @param propertyName The name of the property to check. * @param value Th

* Convert a property map, handling nested maps and parameter references. * Transforms NestedMap AST nodes into plain objects.

* Create a DateValue from a map of components.

* Generate a new unique identifier for an element.

* Slice the edges in the traversal. * @param start The index to start slicing * @param end The index to end slicing

* Check if a property has an index defined in the schema. * @param label The element label. * @param property The property name. * @returns T

* The vertex that the edge points to (target). * Named "inV" because this is the vertex the edge goes INTO.

* Register a procedure definition.