Struct GraphNodeSummary 

pub struct GraphNodeSummary {
    pub name: Arc<str>,
    pub node_kind: NodeKind,
    pub file_path: Arc<Path>,
    pub start_line: u32,
    pub start_column: u32,
    pub end_line: u32,
    pub end_column: u32,
    pub qualified_name: Option<Arc<str>>,
    pub visibility: Option<Arc<str>>,
    pub signature: Option<Arc<str>>,
    pub is_async: bool,
    pub is_static: bool,
}

Lightweight node summary for cache storage.

Contains only the essential fields needed for semantic code search:

• Node identification (name, kind)
• Location information (file path, line/column ranges)
• Optional metadata (qualified name, visibility, signature)

Serialization

Uses postcard for compact binary serialization. Target size: ≤256 bytes.

Memory Optimization

Uses Arc<str> for string fields and Arc<Path> for paths to enable efficient sharing when multiple cache entries reference the same data.

Fields

name: Arc<str>

Node name (shared via Arc)

node_kind: NodeKind

Node kind (function, class, etc.)

file_path: Arc<Path>

File path where node is defined (shared via Arc)

start_line: u32

Line number where node starts (1-based)

start_column: u32

Column where node starts (0-based)

end_line: u32

Line number where node ends (1-based)

end_column: u32

Column where node ends (0-based)

qualified_name: Option<Arc<str>>

Fully qualified name (e.g., “Module::Class::method”)

visibility: Option<Arc<str>>

Visibility modifier (public, private, protected, etc.)

signature: Option<Arc<str>>

Optional signature/type information

is_async: bool

Whether this is an async function/method.

is_static: bool

Whether this is a static member.

Implementations

impl GraphNodeSummary

pub fn from_entry(entry: &NodeEntry, graph: &CodeGraph) -> Option<Self>

Build a summary from a graph node entry.

Returns None if required string or file resolution fails.

pub fn new( name: impl Into<Arc<str>>, node_kind: NodeKind, file_path: impl Into<Arc<Path>>, start_line: u32, start_column: u32, end_line: u32, end_column: u32, ) -> Self

Create a summary from explicit fields (useful for tests).

pub fn serialized_size(&self) -> usize

Estimate the serialized size in bytes (postcard format).

Returns the actual postcard-serialized size of this summary. Used for size budget validation and cache eviction calculations.

Falls back to the documented 256-byte budget estimate if serialization fails (which should be extremely rare in practice).

Trait Implementations

impl Clone for GraphNodeSummary

fn clone(&self) -> GraphNodeSummary

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphNodeSummary

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphNodeSummary

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphNodeSummary

fn eq(&self, other: &GraphNodeSummary) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphNodeSummary

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for GraphNodeSummary

impl StructuralPartialEq for GraphNodeSummary