GenAI.Graph.Root (GenAI Core v0.2.0)
The root data structure that contains nested graphs, nodes and other structures.
Link to this section Summary
Functions
Retrieve a nested element by id from graph
Retrieve a nested element by handle from graph
Retrieve a element_lookup entry by element id.
extract nested entry by path from source element.
Retrieve graph context by link
Retrieve an element_lookup entry by handle and base node
Merge a single graph handle entry into lookup table.
Merge list of {handle, element or path to element} entries into lookup table.
Merge element lookup entries
Retrieve closest nested handle nested under base. If a global entry is found and under base it will be used. If a standard entry is found and under base it will be used. Only if no standard or global entry under base exists will locals be checked.
Link to this section Functions
element(this, id)
Retrieve a nested element by id from graph
element_by_handle(this, handle, base \\ nil)
Retrieve a nested element by handle from graph
element_entry(this, element)
Retrieve a element_lookup entry by element id.
get_nested_element(source, path)
extract nested entry by path from source element.
graph_context_by_link(this, link, from_element)
Retrieve graph context by link
handle_entry(this, handle, base \\ nil)
Retrieve an element_lookup entry by handle and base node
merge_handle(this, arg)
Merge a single graph handle entry into lookup table.
merge_handles(this, handles)
Merge list of {handle, element or path to element} entries into lookup table.
merge_lookup_table_entries(this, entries)
Merge element lookup entries
nearest_handle_entry(this, handle, base)
Retrieve closest nested handle nested under base. If a global entry is found and under base it will be used. If a standard entry is found and under base it will be used. Only if no standard or global entry under base exists will locals be checked.