sqry-core 11.0.4

Core library for sqry - semantic code search engine
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

//! Unified graph architecture for cross-language code analysis
//!
//! This module implements the core data structures and algorithms for sqry's
//! unified graph architecture, enabling cross-language queries, visualization,
//! and advanced analysis.
//!
//! # Architecture
//!
//! The graph architecture consists of:
//! - **Nodes**: Code entities (functions, classes, modules)
//! - **Edges**: Relationships (calls, imports, HTTP, FFI)
//! - **Indices**: Fast lookup structures for queries
//! - **Builders**: Language-specific graph construction
//!
//! # Memory Optimization
//!
//! Per AGENTS.md:149-151, strings are interned via `Arc<str>` to reduce memory
//! usage in symbol-heavy data structures (saves 10-50 MB for typical repos).
//!
//! # Concurrency
//!
//! The graph uses interior mutability (DashMap) to allow concurrent graph
//! building while maintaining a shared reference (&CodeGraph).
//!
//! # Example
//!
//! ```rust
//! use sqry_core::graph::node::{NodeId, Language};
//!
//! // Create node identifiers with string interning
//! let node_id = NodeId::new(Language::Cpp, "main.cpp", "main");
//! assert_eq!(node_id.to_string(), "cpp:main.cpp:main");
//!
//! // Node name extraction works across languages
//! let cpp_id = NodeId::new(Language::Cpp, "utils.cpp", "std::vector::push_back");
//! assert_eq!(cpp_id.symbol_name(), "push_back");
//!
//! let py_id = NodeId::new(Language::Python, "api.py", "User.authenticate");
//! assert_eq!(py_id.symbol_name(), "authenticate");
//! ```

pub mod body_hash;
pub mod builder;
pub mod call_sites;
pub mod edge;
pub mod error;
pub mod local_scopes;
pub mod node;
pub mod path_resolver;

/// Unified graph architecture with Arena+CSR storage.
///
/// This module provides the new high-performance graph implementation
/// with generational indices, two-tier edge storage, and MVCC concurrency.
///
/// See `docs/development/graph-architecture-reconcile-*/` for design docs.
pub mod unified;

/// Graph comparison and diff functionality.
///
/// This module provides tools for comparing two CodeGraph instances to detect
/// symbol changes between different versions of code (e.g., git refs).
pub mod diff;

// ============================================================================
// Primary Exports (Unified Graph - )
// ============================================================================

/// The unified code graph with Arena+CSR storage.
///
/// This is the primary graph type for new code. It provides:
/// - Generational indices for safe node/edge references
/// - Two-tier edge storage (inline for common, external for metadata-heavy)
/// - MVCC concurrency via snapshots
///
/// For concurrent building, use [`ConcurrentCodeGraph`] which wraps this type
/// with interior mutability.
pub use unified::concurrent::CodeGraph;

/// Thread-safe wrapper for concurrent graph building.
pub use unified::ConcurrentCodeGraph;

/// Immutable graph snapshot for queries.
pub use unified::GraphSnapshot;

// ============================================================================
// Core Type Exports
// ============================================================================

pub use body_hash::{BodyHash128, HASH_SEED_0, HASH_SEED_1};
pub use builder::GraphBuilder;
pub use call_sites::{CallSite, CallSiteExtras, CallSiteMetadata};
pub use edge::{CodeEdge, DetectionMethod, EdgeId, EdgeKind, EdgeMetadata, FFIType, TableWriteOp};
pub use error::{GraphBuilderError, GraphResult};
pub use node::{CodeNode, Language, NodeId, NodeKind, Position, Span};
pub use path_resolver::{normalize_path, resolve_import_path, resolve_python_import};