* Check if adding/updating a value would violate a unique constraint. * Throws UniqueConstraintViolationError if it would. * * @param label T

* Compare two dates for sorting. * Returns negative if this < other, positive if this > other, 0 if equal.

* Convert a CREATE clause into a CreateStep. * Handles both simple node patterns and chain patterns (with relationships). * * Chain patterns like:

* Convert a MERGE clause into a MergeStep.

* Convert a ShortestPathPattern into a sequence of steps. * Uses ShortestPathStep with BFS/Dijkstra algorithm. * * TODO: The pattern.all field (for

* Find an element by its unique properties. * This is used by MERGE operations to find existing elements. * * @param label The element label.

* Check if the stem has measure > 0

* Instantiate a vertex from a stored vertex. * @param storedVertex The stored vertex. * @returns The instantiated vertex.

* Checks if a value can be safely converted to a finite number. * Returns false for NaN, Infinity, and non-numeric strings.

* Find all elements with values in the given range. * O(log n + k) where k is the number of matches. * * @param min The lower bound. * @pa

* Look up an element by a unique property value. * Returns the element ID if found, undefined otherwise. * Automatically builds the index if not

* Creates a schema that trims whitespace from strings.

* Multiply this duration by a scalar.

* Negate this duration.

* Get the other vertex of the edge.

* Subscribe to changes to the graph. * @param observer The observer to subscribe to. * @returns A function to unsubscribe from the changes.

* Normalize value for consistent JSON.stringify behavior. * Converts undefined to null for consistent serialization.

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