* Check all unique constraints for an element's properties. * @param label The element label. * @param properties The properties to check. *

* Check if stem contains a vowel

* Convert a CALL clause into a CallStep.

* Convert a DELETE clause into a DeleteStep.

* Convert a FOREACH clause into a ForeachStep.

* Convert a MultiPattern (comma-separated patterns like MATCH (a), (b)) into steps. * Creates a Cartesian product of all matching combinations. * *

* Convert a REMOVE clause into a RemoveStep.

* Convert a SET clause into a SetStep. * Supports three types of assignments: * 1. Individual property: n.prop = value * 2. Replace all properties:

* Convert a SET map value (property map or parameter reference).

* Convert an UNWIND clause into an UnwindStep.

* Convert a WITH clause into a WithStep.

* Divide this duration by a scalar.

* Check if stem ends with consonant-vowel-consonant pattern * where the final consonant is not w, x, or y

* Evaluate a quantifier expression over a list.

* Evaluate a reduce expression over a list. * Folds the list into a single value using an accumulator.

* Extract variable names bound by a pattern for OPTIONAL MATCH null bindings. * When skipAnchor is true, skips the first node if it's an anchor patte

* Look up a procedure by name (case-insensitive).

* Get all the node in the path by label. * @param label The label to get the nodes by.

* Get neighboring vertices based on direction.

* Check if the stem has measure = 1

* Check if a parameter exists. * @param name The parameter name (without $ prefix)

* Check if an index has been built.

* Filter edges where the specified property is null or undefined. * @param propertyName The name of the property to check.

* Serialize a value to JSON and back. Alias for JSON.parse(JSON.stringify(value)). * Used where we explicitly want JSON serialization behavior.

* Return the number of edges/relationships in this path. * Mirrors Cypher's `length(path)`.

* Find all elements with values greater than or equal to the given value. * O(log n + k) where k is the number of matches. * * @param value T

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

* Look up element IDs matching any of the given values. * O(n) where n is the number of values. * * @param values Array of values to look up.

* Creates a schema that parses string numbers to integers.

* Internal function to perform matching with full details.

* Subtract another duration from this duration.

* Called when a new element is added to the graph. * Updates all built indexes for this element. * Note: This does NOT check unique constraints

* Called when an element is removed from the graph. * Updates all built indexes for this element.