pub struct GraphSchema {
pub nodes: BTreeMap<String, GraphNodeSchema>,
pub relations: BTreeMap<String, GraphRelationSchema>,
pub sources_without_schema: BTreeSet<String>,
}Expand description
Merged graph schema used by inspection APIs and future MCP tools.
Fields§
§nodes: BTreeMap<String, GraphNodeSchema>§relations: BTreeMap<String, GraphRelationSchema>§sources_without_schema: BTreeSet<String>Implementations§
Source§impl GraphSchema
impl GraphSchema
Sourcepub fn merge_source_schema(&mut self, source_id: &str, schema: &SourceSchema)
pub fn merge_source_schema(&mut self, source_id: &str, schema: &SourceSchema)
Merge a source-provided schema into the aggregate graph view.
Sourcepub fn mark_queried_nodes<'a, I>(&mut self, labels: I, query_id: &str)where
I: IntoIterator<Item = &'a str>,
pub fn mark_queried_nodes<'a, I>(&mut self, labels: I, query_id: &str)where
I: IntoIterator<Item = &'a str>,
Mark node labels as being referenced by a query.
Sourcepub fn mark_queried_relations<'a, I>(&mut self, labels: I, query_id: &str)where
I: IntoIterator<Item = &'a str>,
pub fn mark_queried_relations<'a, I>(&mut self, labels: I, query_id: &str)where
I: IntoIterator<Item = &'a str>,
Mark relationship labels as being referenced by a query.
Sourcepub fn record_source_without_schema(&mut self, source_id: &str)
pub fn record_source_without_schema(&mut self, source_id: &str)
Record a source that exists but could not describe its schema.
Trait Implementations§
Source§impl Clone for GraphSchema
impl Clone for GraphSchema
Source§fn clone(&self) -> GraphSchema
fn clone(&self) -> GraphSchema
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for GraphSchema
impl Debug for GraphSchema
Source§impl Default for GraphSchema
impl Default for GraphSchema
Source§fn default() -> GraphSchema
fn default() -> GraphSchema
Returns the “default value” for a type. Read more
Source§impl<'de> Deserialize<'de> for GraphSchema
impl<'de> Deserialize<'de> for GraphSchema
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl PartialEq for GraphSchema
impl PartialEq for GraphSchema
Source§fn eq(&self, other: &GraphSchema) -> bool
fn eq(&self, other: &GraphSchema) -> bool
Tests for
self and other values to be equal, and is used by ==.Source§impl Serialize for GraphSchema
impl Serialize for GraphSchema
impl Eq for GraphSchema
impl StructuralPartialEq for GraphSchema
Auto Trait Implementations§
impl Freeze for GraphSchema
impl RefUnwindSafe for GraphSchema
impl Send for GraphSchema
impl Sync for GraphSchema
impl Unpin for GraphSchema
impl UnsafeUnpin for GraphSchema
impl UnwindSafe for GraphSchema
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.