Struct FunctionRegistry 

pub struct FunctionRegistry { /* private fields */ }

Registry of all built-in functions (scalar, aggregate, table).

Implementations

impl FunctionRegistry

pub fn new() -> Self

pub fn register_scalar(&mut self, name: &str, func: ScalarFunction)

pub fn register_aggregate(&mut self, name: &str, func: AggregateFunction)

pub fn register_table(&mut self, name: &str, func: TableFunction)

pub fn resolve(&self, name: &str) -> Option<ResolvedFunction>

pub fn get_scalar(&self, name: &str) -> Option<&ScalarFunction>

pub fn get_aggregate(&self, name: &str) -> Option<&AggregateFunction>

pub fn get_table(&self, name: &str) -> Option<&TableFunction>

pub fn list_all(&self) -> Vec<(String, String)>

List all registered functions as (name, kind) pairs. Kind is one of: “SCALAR”, “AGGREGATE”, “TABLE”.

pub fn contains(&self, name: &str) -> bool

pub fn scalar_count(&self) -> usize

Number of registered scalar functions.

pub fn aggregate_count(&self) -> usize

Number of registered aggregate functions.

pub fn table_count(&self) -> usize

Number of registered table functions.

pub fn total_count(&self) -> usize

Total number of registered functions.

pub fn execute_table_function( &self, name: &str, args: &[Value], graph: Option<&dyn GraphDataSource>, ) -> Result<Vec<Vec<Value>>, String>

Execute a table function by name with the given pre-evaluated arguments.

Returns a Vec<Vec<Value>> representing rows of results. Each inner vec is one row with one or more column values.

graph is an optional graph data source passed to graph-algorithm table functions. Callers that own a storage catalog (e.g. the query processor or the connection layer) supply it so GDS functions run against real node/rel tables; callers without catalog access pass None, in which case the closure may fall back to its built-in data.

Trait Implementations

impl Default for FunctionRegistry

fn default() -> FunctionRegistry

Returns the “default value” for a type.