A named collection of graphs and nested directories.
Directories enable hierarchical organization of graphs, providing structure for navigation, scoped metadata, and targeted operations.
Each directory can contain DCATR.Graphs and nested DCATR.Directorys as members.
Access Functions
Direct access (non-recursive)
members/1- all direct Element membersgraphs/1- direct Graph members only (callback)directories/1- direct Directory members only (callback)
Recursive access (generated by DCATR.Directory.Type)
all_graphs/1- all Graphs through entire sub-directory treeall_members/1- all Elements through entire sub-directory treefind_graph/2- find Graph by ID recursively
Summary
Functions
Returns all graphs through the entire sub-directory tree.
Returns all elements through the entire sub-directory tree.
Finds a graph by ID recursively through the sub-directory tree.
Returns all direct element members.
Types
Functions
@spec all_graphs(DCATR.Directory.Type.schema()) :: [DCATR.Graph.t()]
Returns all graphs through the entire sub-directory tree.
@spec all_members(DCATR.Directory.Type.schema()) :: [DCATR.Element.t()]
Returns all elements through the entire sub-directory tree.
@spec find_graph(DCATR.Directory.Type.schema(), RDF.IRI.coercible()) :: DCATR.Graph.t() | nil
Finds a graph by ID recursively through the sub-directory tree.
@spec from(Grax.Schema.t()) :: {:ok, t()} | {:error, any()}
@spec from!(Grax.Schema.t()) :: t()
@spec load( RDF.Graph.t() | RDF.Description.t(), RDF.IRI.coercible() | RDF.BlankNode.t(), opts :: keyword() ) :: {:ok, t()} | {:error, any()}
@spec load!( RDF.Graph.t() | RDF.Description.t(), RDF.IRI.coercible() | RDF.BlankNode.t(), opts :: keyword() ) :: t()
@spec members(DCATR.Directory.Type.schema()) :: [DCATR.Element.t()]
Returns all direct element members.