* Get the vertices that are connected to the vertices by both incoming and outgoing edges. * @param edgeLabels The labels of the edges to get. If n

* Convert a pattern into a sequence of steps. * Handles node patterns, edge patterns, and variable-length paths. * * @param pattern The pattern to

* Get or create an index for a property. * Returns undefined if no index is configured for this property. * Note: This creates the index structu

* Get a specific parameter value. * @param name The parameter name (without $ prefix)

* Find all elements with values greater than the given value. * O(log n + k) where k is the number of matches. * * @param value The lower bou

* Get a typed index (HashIndex, BTreeIndex, or FullTextIndex).

* Get all unique index configurations for a label. * @param label The element label. * @returns Array of property names that have unique constra

* Check if a procedure exists.

* Instantiate an edge from a stored edge. * @param storedEdge The stored edge. * @returns The instantiated edge.

* Helper to check if an expression is a function call to labels() or type()

* Perform a full-text search with relevance scoring. * Returns results sorted by score descending. * * @param query The search query. * @p

* Helper method to find and update the ShortestPathStep with new config.

* The value in the path.

* Convert a LabelExpression AST node to a StepCondition. * Supports: LabelName, LabelOr, LabelAnd, LabelNot, LabelWildcard

* Convert a SetValue AST node to a SetAssignmentValue.

* Ensure all unique indexes for a label are built. * This should be called before adding elements to ensure constraint checking works. * * @p

* Generate a document with specific keywords embedded.

* Filter edges which have a property value in the specified list. * @param propertyName The name of the property to filter by. * @param values T

* Check if a property has an index of a specific type. * @param label The element label. * @param property The property name. * @param type T

* Check if the stem has measure > 1

* Check if a vertex matches the target criteria.

* Find all elements with values less than the given value. * O(log n + k) where k is the number of matches. * * @param value The upper bound

* Tests for IS LABELED Predicate * * Syntax: variable IS :Label or variable IS :LabelExpression * * Supports: * - n IS :Person - true if n has th

* Tests for Advanced Label Expressions * * Supports: * - :A|B (OR) - matches nodes with label A or B * - :A&B (AND) - matches nodes with label A a

* Negate the condition on the last filter step. * Note: This only works if the last step is a FilterElementsStep.

* Find documents where the text contains the given substring. * No relevance scoring - returns all matches. * * @param substring The substrin

* Get statistics about the index.

* Update a value in the index. * @param elementId The ID of the element. * @param oldValue The old property value. * @param newValue The new

* Safely stringify a value, handling circular references and other edge cases.

* Add months to a date with proper month-end handling. * If the original day exceeds the days in the target month, clamp to the last day. * For exam