deagle_core/
lib.rs

1//! deagle-core — graph types and SQLite storage for code intelligence.
2//!
3//! Defines the code graph model: nodes (functions, classes, modules),
4//! edges (calls, imports, contains, inherits), and SQLite-backed persistence.
5//!
6//! ## Feature Flags
7//!
8//! - `semantic` — enables semantic code search via [ares-vector](https://crates.io/crates/ares-vector)
9
10#[cfg(feature = "semantic")]
11pub mod semantic;
12
13use serde::{Deserialize, Serialize};
14use std::path::PathBuf;
15
16/// A node in the code graph — represents a code entity.
17#[derive(Debug, Clone, Serialize, Deserialize, PartialEq)]
18pub struct Node {
19    /// Unique identifier (auto-generated)
20    pub id: i64,
21    /// Entity name (function name, class name, etc.)
22    pub name: String,
23    /// Entity kind
24    pub kind: NodeKind,
25    /// Programming language
26    pub language: Language,
27    /// Source file path (relative to repo root)
28    pub file_path: String,
29    /// Start line number (1-indexed)
30    pub line_start: u32,
31    /// End line number (1-indexed)
32    pub line_end: u32,
33    /// Optional source code excerpt
34    pub content: Option<String>,
35}
36
37/// Kind of code entity.
38#[derive(Debug, Clone, Copy, Serialize, Deserialize, PartialEq, Eq, Hash)]
39#[serde(rename_all = "snake_case")]
40pub enum NodeKind {
41    File,
42    Module,
43    Function,
44    Method,
45    Class,
46    Struct,
47    Enum,
48    Trait,
49    Interface,
50    Constant,
51    Variable,
52    TypeAlias,
53    Import,
54}
55
56impl std::fmt::Display for NodeKind {
57    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
58        let s = match self {
59            Self::File => "file",
60            Self::Module => "module",
61            Self::Function => "function",
62            Self::Method => "method",
63            Self::Class => "class",
64            Self::Struct => "struct",
65            Self::Enum => "enum",
66            Self::Trait => "trait",
67            Self::Interface => "interface",
68            Self::Constant => "constant",
69            Self::Variable => "variable",
70            Self::TypeAlias => "type_alias",
71            Self::Import => "import",
72        };
73        write!(f, "{}", s)
74    }
75}
76
77/// Supported programming languages.
78#[derive(Debug, Clone, Copy, Serialize, Deserialize, PartialEq, Eq, Hash)]
79#[serde(rename_all = "lowercase")]
80pub enum Language {
81    Rust,
82    Python,
83    Go,
84    TypeScript,
85    JavaScript,
86    Java,
87    Cpp,
88    C,
89    Ruby,
90    Unknown,
91}
92
93impl Language {
94    /// Detect language from file extension.
95    pub fn from_extension(ext: &str) -> Self {
96        match ext.to_lowercase().as_str() {
97            "rs" => Self::Rust,
98            "py" => Self::Python,
99            "go" => Self::Go,
100            "ts" | "tsx" => Self::TypeScript,
101            "js" | "jsx" | "mjs" | "cjs" => Self::JavaScript,
102            "java" => Self::Java,
103            "cpp" | "cc" | "cxx" | "hpp" => Self::Cpp,
104            "c" | "h" => Self::C,
105            "rb" | "rake" | "gemspec" => Self::Ruby,
106            _ => Self::Unknown,
107        }
108    }
109
110    /// File extensions for this language.
111    pub fn extensions(&self) -> &[&str] {
112        match self {
113            Self::Rust => &["rs"],
114            Self::Python => &["py"],
115            Self::Go => &["go"],
116            Self::TypeScript => &["ts", "tsx"],
117            Self::JavaScript => &["js", "jsx", "mjs", "cjs"],
118            Self::Java => &["java"],
119            Self::Cpp => &["cpp", "cc", "cxx", "hpp"],
120            Self::C => &["c", "h"],
121            Self::Ruby => &["rb", "rake", "gemspec"],
122            Self::Unknown => &[],
123        }
124    }
125}
126
127impl std::fmt::Display for Language {
128    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
129        let s = match self {
130            Self::Rust => "rust",
131            Self::Python => "python",
132            Self::Go => "go",
133            Self::TypeScript => "typescript",
134            Self::JavaScript => "javascript",
135            Self::Java => "java",
136            Self::Cpp => "cpp",
137            Self::C => "c",
138            Self::Ruby => "ruby",
139            Self::Unknown => "unknown",
140        };
141        write!(f, "{}", s)
142    }
143}
144
145/// An edge in the code graph — represents a relationship between entities.
146#[derive(Debug, Clone, Serialize, Deserialize, PartialEq)]
147pub struct Edge {
148    /// Source node ID
149    pub from_id: i64,
150    /// Target node ID
151    pub to_id: i64,
152    /// Relationship type
153    pub kind: EdgeKind,
154    /// Confidence score (0.0–1.0) for inferred edges
155    pub confidence: f32,
156}
157
158/// Kind of relationship between code entities.
159#[derive(Debug, Clone, Copy, Serialize, Deserialize, PartialEq, Eq, Hash)]
160#[serde(rename_all = "snake_case")]
161pub enum EdgeKind {
162    /// Function/method call
163    Calls,
164    /// Import/use statement
165    Imports,
166    /// Parent contains child (file→function, class→method)
167    Contains,
168    /// Class/struct inheritance
169    Inherits,
170    /// Interface/trait implementation
171    Implements,
172    /// Type reference (parameter type, return type, field type)
173    References,
174    /// Module/package dependency
175    DependsOn,
176}
177
178impl std::fmt::Display for EdgeKind {
179    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
180        let s = match self {
181            Self::Calls => "calls",
182            Self::Imports => "imports",
183            Self::Contains => "contains",
184            Self::Inherits => "inherits",
185            Self::Implements => "implements",
186            Self::References => "references",
187            Self::DependsOn => "depends_on",
188        };
189        write!(f, "{}", s)
190    }
191}
192
193/// Errors from deagle operations.
194#[derive(Debug, thiserror::Error)]
195pub enum DeagleError {
196    #[error("Database error: {0}")]
197    Database(#[from] rusqlite::Error),
198    #[error("IO error: {0}")]
199    Io(#[from] std::io::Error),
200    #[error("Parse error in {file}: {message}")]
201    Parse { file: String, message: String },
202    #[error("{0}")]
203    Other(String),
204}
205
206pub type Result<T> = std::result::Result<T, DeagleError>;
207
208/// SQLite-backed code graph database.
209pub struct GraphDb {
210    conn: rusqlite::Connection,
211}
212
213impl GraphDb {
214    /// Open or create a graph database at the given path.
215    pub fn open(path: &std::path::Path) -> Result<Self> {
216        let conn = rusqlite::Connection::open(path)?;
217        // WAL mode: concurrent reads during writes, faster for indexing workloads
218        conn.pragma_update(None, "journal_mode", "WAL")?;
219        // Synchronous NORMAL: safe with WAL, 2-3x faster than FULL
220        conn.pragma_update(None, "synchronous", "NORMAL")?;
221        let db = Self { conn };
222        db.init_schema()?;
223        Ok(db)
224    }
225
226    /// Create an in-memory graph database (for testing).
227    pub fn in_memory() -> Result<Self> {
228        let conn = rusqlite::Connection::open_in_memory()?;
229        let db = Self { conn };
230        db.init_schema()?;
231        Ok(db)
232    }
233
234    fn init_schema(&self) -> Result<()> {
235        self.conn.execute_batch(
236            "
237            CREATE TABLE IF NOT EXISTS nodes (
238                id INTEGER PRIMARY KEY AUTOINCREMENT,
239                name TEXT NOT NULL,
240                kind TEXT NOT NULL,
241                language TEXT NOT NULL,
242                file_path TEXT NOT NULL,
243                line_start INTEGER NOT NULL,
244                line_end INTEGER NOT NULL,
245                content TEXT
246            );
247            CREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);
248            CREATE INDEX IF NOT EXISTS idx_nodes_kind ON nodes(kind);
249            CREATE INDEX IF NOT EXISTS idx_nodes_file ON nodes(file_path);
250
251            CREATE TABLE IF NOT EXISTS edges (
252                id INTEGER PRIMARY KEY AUTOINCREMENT,
253                from_id INTEGER NOT NULL REFERENCES nodes(id),
254                to_id INTEGER NOT NULL REFERENCES nodes(id),
255                kind TEXT NOT NULL,
256                confidence REAL NOT NULL DEFAULT 1.0
257            );
258            CREATE INDEX IF NOT EXISTS idx_edges_from ON edges(from_id);
259            CREATE INDEX IF NOT EXISTS idx_edges_to ON edges(to_id);
260            CREATE INDEX IF NOT EXISTS idx_edges_kind ON edges(kind);
261
262            CREATE TABLE IF NOT EXISTS metadata (
263                key TEXT PRIMARY KEY,
264                value TEXT NOT NULL
265            );
266
267            CREATE TABLE IF NOT EXISTS file_hashes (
268                file_path TEXT PRIMARY KEY,
269                content_hash TEXT NOT NULL,
270                indexed_at TEXT NOT NULL DEFAULT (datetime('now'))
271            );
272
273            CREATE VIRTUAL TABLE IF NOT EXISTS nodes_fts USING fts5(
274                name, content, file_path,
275                content='nodes',
276                content_rowid='id'
277            );
278            "
279        )?;
280        Ok(())
281    }
282
283    /// Insert a node and return its ID.
284    pub fn insert_node(&self, node: &Node) -> Result<i64> {
285        self.conn.execute(
286            "INSERT INTO nodes (name, kind, language, file_path, line_start, line_end, content)
287             VALUES (?1, ?2, ?3, ?4, ?5, ?6, ?7)",
288            rusqlite::params![
289                node.name,
290                node.kind.to_string(),
291                node.language.to_string(),
292                node.file_path,
293                node.line_start,
294                node.line_end,
295                node.content,
296            ],
297        )?;
298        let id = self.conn.last_insert_rowid();
299        // Populate FTS5 index
300        self.conn.execute(
301            "INSERT INTO nodes_fts(rowid, name, content, file_path) VALUES (?1, ?2, ?3, ?4)",
302            rusqlite::params![id, node.name, node.content, node.file_path],
303        )?;
304        Ok(id)
305    }
306
307    /// Batch insert nodes and edges in a single transaction (much faster for indexing).
308    pub fn insert_batch(&self, nodes: &[Node], edges: &[(i64, i64, EdgeKind)]) -> Result<Vec<i64>> {
309        let tx = self.conn.unchecked_transaction()?;
310        let mut ids = Vec::with_capacity(nodes.len());
311
312        {
313            let mut node_stmt = tx.prepare_cached(
314                "INSERT INTO nodes (name, kind, language, file_path, line_start, line_end, content)
315                 VALUES (?1, ?2, ?3, ?4, ?5, ?6, ?7)"
316            )?;
317            let mut fts_stmt = tx.prepare_cached(
318                "INSERT INTO nodes_fts(rowid, name, content, file_path) VALUES (?1, ?2, ?3, ?4)"
319            )?;
320
321            for node in nodes {
322                node_stmt.execute(rusqlite::params![
323                    node.name, node.kind.to_string(), node.language.to_string(),
324                    node.file_path, node.line_start, node.line_end, node.content,
325                ])?;
326                let id = tx.last_insert_rowid();
327                fts_stmt.execute(rusqlite::params![id, node.name, node.content, node.file_path])?;
328                ids.push(id);
329            }
330        }
331
332        {
333            let mut edge_stmt = tx.prepare_cached(
334                "INSERT INTO edges (from_id, to_id, kind, confidence) VALUES (?1, ?2, ?3, ?4)"
335            )?;
336            for (from_id, to_id, kind) in edges {
337                edge_stmt.execute(rusqlite::params![from_id, to_id, kind.to_string(), 1.0])?;
338            }
339        }
340
341        tx.commit()?;
342        Ok(ids)
343    }
344
345    /// Full-text keyword search using FTS5 BM25 ranking.
346    pub fn keyword_search(&self, query: &str) -> Result<Vec<Node>> {
347        let mut stmt = self.conn.prepare(
348            "SELECT n.id, n.name, n.kind, n.language, n.file_path, n.line_start, n.line_end, n.content
349             FROM nodes_fts f
350             JOIN nodes n ON n.id = f.rowid
351             WHERE nodes_fts MATCH ?1
352             ORDER BY rank
353             LIMIT 50"
354        )?;
355        let rows = stmt.query_map([query], |row| {
356            Ok(Node {
357                id: row.get(0)?,
358                name: row.get(1)?,
359                kind: serde_json::from_str(&format!("\"{}\"", row.get::<_, String>(2)?))
360                    .unwrap_or(NodeKind::Function),
361                language: serde_json::from_str(&format!("\"{}\"", row.get::<_, String>(3)?))
362                    .unwrap_or(Language::Unknown),
363                file_path: row.get(4)?,
364                line_start: row.get(5)?,
365                line_end: row.get(6)?,
366                content: row.get(7)?,
367            })
368        })?;
369        rows.collect::<std::result::Result<Vec<_>, _>>().map_err(DeagleError::from)
370    }
371
372    /// Insert an edge.
373    pub fn insert_edge(&self, edge: &Edge) -> Result<()> {
374        self.conn.execute(
375            "INSERT INTO edges (from_id, to_id, kind, confidence) VALUES (?1, ?2, ?3, ?4)",
376            rusqlite::params![edge.from_id, edge.to_id, edge.kind.to_string(), edge.confidence],
377        )?;
378        Ok(())
379    }
380
381    /// Search nodes by name (case-insensitive substring match).
382    pub fn search_nodes(&self, query: &str) -> Result<Vec<Node>> {
383        let mut stmt = self.conn.prepare(
384            "SELECT id, name, kind, language, file_path, line_start, line_end, content
385             FROM nodes WHERE name LIKE ?1 ORDER BY name"
386        )?;
387        let pattern = format!("%{}%", query);
388        let rows = stmt.query_map([&pattern], |row| {
389            Ok(Node {
390                id: row.get(0)?,
391                name: row.get(1)?,
392                kind: serde_json::from_str(&format!("\"{}\"", row.get::<_, String>(2)?))
393                    .unwrap_or(NodeKind::Function),
394                language: serde_json::from_str(&format!("\"{}\"", row.get::<_, String>(3)?))
395                    .unwrap_or(Language::Unknown),
396                file_path: row.get(4)?,
397                line_start: row.get(5)?,
398                line_end: row.get(6)?,
399                content: row.get(7)?,
400            })
401        })?;
402        rows.collect::<std::result::Result<Vec<_>, _>>().map_err(DeagleError::from)
403    }
404
405    /// Fuzzy search nodes by name — ranked by match score (best first).
406    pub fn fuzzy_search_nodes(&self, query: &str) -> Result<Vec<Node>> {
407        use fuzzy_matcher::skim::SkimMatcherV2;
408        use fuzzy_matcher::FuzzyMatcher;
409
410        let matcher = SkimMatcherV2::default();
411
412        // Get all nodes and score them
413        let mut stmt = self.conn.prepare(
414            "SELECT id, name, kind, language, file_path, line_start, line_end, content FROM nodes"
415        )?;
416        let rows = stmt.query_map([], |row| {
417            Ok(Node {
418                id: row.get(0)?,
419                name: row.get(1)?,
420                kind: serde_json::from_str(&format!("\"{}\"", row.get::<_, String>(2)?))
421                    .unwrap_or(NodeKind::Function),
422                language: serde_json::from_str(&format!("\"{}\"", row.get::<_, String>(3)?))
423                    .unwrap_or(Language::Unknown),
424                file_path: row.get(4)?,
425                line_start: row.get(5)?,
426                line_end: row.get(6)?,
427                content: row.get(7)?,
428            })
429        })?;
430
431        let all_nodes: Vec<Node> = rows.collect::<std::result::Result<Vec<_>, _>>()?;
432
433        let mut scored: Vec<(i64, Node)> = all_nodes
434            .into_iter()
435            .filter_map(|node| {
436                matcher.fuzzy_match(&node.name, query).map(|score| (score, node))
437            })
438            .collect();
439
440        // Sort by score descending (best matches first)
441        scored.sort_by(|a, b| b.0.cmp(&a.0));
442
443        Ok(scored.into_iter().map(|(_, node)| node).collect())
444    }
445
446    /// Get all edges from a node (outgoing relationships).
447    pub fn edges_from(&self, node_id: i64) -> Result<Vec<Edge>> {
448        let mut stmt = self.conn.prepare(
449            "SELECT from_id, to_id, kind, confidence FROM edges WHERE from_id = ?1"
450        )?;
451        let rows = stmt.query_map([node_id], |row| {
452            Ok(Edge {
453                from_id: row.get(0)?,
454                to_id: row.get(1)?,
455                kind: serde_json::from_str(&format!("\"{}\"", row.get::<_, String>(2)?))
456                    .unwrap_or(EdgeKind::Calls),
457                confidence: row.get(3)?,
458            })
459        })?;
460        rows.collect::<std::result::Result<Vec<_>, _>>().map_err(DeagleError::from)
461    }
462
463    /// Get total node count.
464    pub fn node_count(&self) -> Result<usize> {
465        let count: i64 = self.conn.query_row("SELECT COUNT(*) FROM nodes", [], |r| r.get(0))?;
466        Ok(count as usize)
467    }
468
469    /// Get total edge count.
470    pub fn edge_count(&self) -> Result<usize> {
471        let count: i64 = self.conn.query_row("SELECT COUNT(*) FROM edges", [], |r| r.get(0))?;
472        Ok(count as usize)
473    }
474
475    /// Clear all data (for re-indexing).
476    pub fn clear(&self) -> Result<()> {
477        self.conn.execute_batch("DELETE FROM edges; DELETE FROM nodes_fts; DELETE FROM nodes; DELETE FROM file_hashes;")?;
478        Ok(())
479    }
480
481    /// Get the database file path.
482    pub fn path(&self) -> Option<PathBuf> {
483        self.conn.path().map(PathBuf::from)
484    }
485
486    /// Compute SHA-256 hash of content (first 16 hex chars).
487    pub fn content_hash(content: &str) -> String {
488        use sha2::{Sha256, Digest};
489        let hash = Sha256::digest(content.as_bytes());
490        hash.iter().take(8).map(|b| format!("{:02x}", b)).collect()
491    }
492
493    /// Check if a file needs re-indexing (hash changed or new file).
494    pub fn needs_reindex(&self, file_path: &str, content: &str) -> Result<bool> {
495        let current_hash = Self::content_hash(content);
496        let stored: Option<String> = self.conn.query_row(
497            "SELECT content_hash FROM file_hashes WHERE file_path = ?1",
498            [file_path],
499            |row| row.get(0),
500        ).ok();
501
502        Ok(stored.as_deref() != Some(&current_hash))
503    }
504
505    /// Store file hash after indexing.
506    pub fn store_file_hash(&self, file_path: &str, content: &str) -> Result<()> {
507        let hash = Self::content_hash(content);
508        self.conn.execute(
509            "INSERT OR REPLACE INTO file_hashes (file_path, content_hash) VALUES (?1, ?2)",
510            rusqlite::params![file_path, hash],
511        )?;
512        Ok(())
513    }
514
515    /// Remove nodes and edges for a specific file (for re-indexing).
516    pub fn remove_file(&self, file_path: &str) -> Result<()> {
517        // Get node IDs for this file
518        let mut stmt = self.conn.prepare("SELECT id FROM nodes WHERE file_path = ?1")?;
519        let ids: Vec<i64> = stmt.query_map([file_path], |row| row.get(0))?
520            .filter_map(|r| r.ok())
521            .collect();
522
523        // Delete edges referencing these nodes
524        for id in &ids {
525            self.conn.execute("DELETE FROM edges WHERE from_id = ?1 OR to_id = ?1", [id])?;
526        }
527        // Delete nodes
528        self.conn.execute("DELETE FROM nodes WHERE file_path = ?1", [file_path])?;
529        // Delete hash
530        self.conn.execute("DELETE FROM file_hashes WHERE file_path = ?1", [file_path])?;
531        Ok(())
532    }
533}
534
535#[cfg(test)]
536mod tests {
537    use super::*;
538
539    #[test]
540    fn test_language_from_extension() {
541        assert_eq!(Language::from_extension("rs"), Language::Rust);
542        assert_eq!(Language::from_extension("py"), Language::Python);
543        assert_eq!(Language::from_extension("go"), Language::Go);
544        assert_eq!(Language::from_extension("ts"), Language::TypeScript);
545        assert_eq!(Language::from_extension("tsx"), Language::TypeScript);
546        assert_eq!(Language::from_extension("js"), Language::JavaScript);
547        assert_eq!(Language::from_extension("java"), Language::Java);
548        assert_eq!(Language::from_extension("cpp"), Language::Cpp);
549        assert_eq!(Language::from_extension("c"), Language::C);
550        assert_eq!(Language::from_extension("xyz"), Language::Unknown);
551    }
552
553    #[test]
554    fn test_language_display() {
555        assert_eq!(Language::Rust.to_string(), "rust");
556        assert_eq!(Language::Python.to_string(), "python");
557    }
558
559    #[test]
560    fn test_node_kind_display() {
561        assert_eq!(NodeKind::Function.to_string(), "function");
562        assert_eq!(NodeKind::Struct.to_string(), "struct");
563        assert_eq!(NodeKind::TypeAlias.to_string(), "type_alias");
564    }
565
566    #[test]
567    fn test_edge_kind_display() {
568        assert_eq!(EdgeKind::Calls.to_string(), "calls");
569        assert_eq!(EdgeKind::Imports.to_string(), "imports");
570        assert_eq!(EdgeKind::Contains.to_string(), "contains");
571    }
572
573    #[test]
574    fn test_graph_db_in_memory() {
575        let db = GraphDb::in_memory().unwrap();
576        assert_eq!(db.node_count().unwrap(), 0);
577        assert_eq!(db.edge_count().unwrap(), 0);
578    }
579
580    #[test]
581    fn test_insert_and_search_node() {
582        let db = GraphDb::in_memory().unwrap();
583        let node = Node {
584            id: 0,
585            name: "process_request".to_string(),
586            kind: NodeKind::Function,
587            language: Language::Rust,
588            file_path: "src/handler.rs".to_string(),
589            line_start: 42,
590            line_end: 68,
591            content: Some("pub fn process_request() {}".to_string()),
592        };
593        let id = db.insert_node(&node).unwrap();
594        assert!(id > 0);
595        assert_eq!(db.node_count().unwrap(), 1);
596
597        let results = db.search_nodes("process").unwrap();
598        assert_eq!(results.len(), 1);
599        assert_eq!(results[0].name, "process_request");
600        assert_eq!(results[0].kind, NodeKind::Function);
601        assert_eq!(results[0].language, Language::Rust);
602    }
603
604    #[test]
605    fn test_insert_edge_and_query() {
606        let db = GraphDb::in_memory().unwrap();
607        let n1 = Node {
608            id: 0, name: "main".into(), kind: NodeKind::Function,
609            language: Language::Rust, file_path: "src/main.rs".into(),
610            line_start: 1, line_end: 10, content: None,
611        };
612        let n2 = Node {
613            id: 0, name: "handler".into(), kind: NodeKind::Function,
614            language: Language::Rust, file_path: "src/lib.rs".into(),
615            line_start: 5, line_end: 20, content: None,
616        };
617        let id1 = db.insert_node(&n1).unwrap();
618        let id2 = db.insert_node(&n2).unwrap();
619
620        let edge = Edge {
621            from_id: id1, to_id: id2,
622            kind: EdgeKind::Calls, confidence: 1.0,
623        };
624        db.insert_edge(&edge).unwrap();
625        assert_eq!(db.edge_count().unwrap(), 1);
626
627        let edges = db.edges_from(id1).unwrap();
628        assert_eq!(edges.len(), 1);
629        assert_eq!(edges[0].to_id, id2);
630        assert_eq!(edges[0].kind, EdgeKind::Calls);
631    }
632
633    #[test]
634    fn test_search_case_insensitive() {
635        let db = GraphDb::in_memory().unwrap();
636        let node = Node {
637            id: 0, name: "MyStruct".into(), kind: NodeKind::Struct,
638            language: Language::Rust, file_path: "src/types.rs".into(),
639            line_start: 1, line_end: 5, content: None,
640        };
641        db.insert_node(&node).unwrap();
642
643        let results = db.search_nodes("mystruct").unwrap();
644        assert_eq!(results.len(), 1);
645    }
646
647    #[test]
648    fn test_clear_db() {
649        let db = GraphDb::in_memory().unwrap();
650        let node = Node {
651            id: 0, name: "test".into(), kind: NodeKind::Function,
652            language: Language::Rust, file_path: "t.rs".into(),
653            line_start: 1, line_end: 1, content: None,
654        };
655        db.insert_node(&node).unwrap();
656        assert_eq!(db.node_count().unwrap(), 1);
657        db.clear().unwrap();
658        assert_eq!(db.node_count().unwrap(), 0);
659    }
660
661    #[test]
662    fn test_node_serialization() {
663        let node = Node {
664            id: 1, name: "test_fn".into(), kind: NodeKind::Function,
665            language: Language::Python, file_path: "app.py".into(),
666            line_start: 10, line_end: 25, content: Some("def test_fn(): pass".into()),
667        };
668        let json = serde_json::to_string(&node).unwrap();
669        let parsed: Node = serde_json::from_str(&json).unwrap();
670        assert_eq!(parsed.name, "test_fn");
671        assert_eq!(parsed.kind, NodeKind::Function);
672        assert_eq!(parsed.language, Language::Python);
673    }
674
675    #[test]
676    fn test_language_extensions() {
677        assert!(Language::Rust.extensions().contains(&"rs"));
678        assert!(Language::TypeScript.extensions().contains(&"tsx"));
679        assert!(Language::Unknown.extensions().is_empty());
680    }
681
682    #[test]
683    fn test_multiple_nodes_same_name() {
684        let db = GraphDb::in_memory().unwrap();
685        for file in &["a.rs", "b.rs", "c.rs"] {
686            db.insert_node(&Node {
687                id: 0, name: "new".into(), kind: NodeKind::Method,
688                language: Language::Rust, file_path: file.to_string(),
689                line_start: 1, line_end: 5, content: None,
690            }).unwrap();
691        }
692        let results = db.search_nodes("new").unwrap();
693        assert_eq!(results.len(), 3, "Should find all 3 nodes named 'new'");
694    }
695
696    #[test]
697    fn test_search_empty_query() {
698        let db = GraphDb::in_memory().unwrap();
699        db.insert_node(&Node {
700            id: 0, name: "hello".into(), kind: NodeKind::Function,
701            language: Language::Rust, file_path: "t.rs".into(),
702            line_start: 1, line_end: 1, content: None,
703        }).unwrap();
704        // Empty pattern matches everything via LIKE '%%'
705        let results = db.search_nodes("").unwrap();
706        assert_eq!(results.len(), 1);
707    }
708
709    #[test]
710    fn test_edges_from_nonexistent_node() {
711        let db = GraphDb::in_memory().unwrap();
712        let edges = db.edges_from(999).unwrap();
713        assert!(edges.is_empty());
714    }
715
716    #[test]
717    fn test_multiple_edge_types() {
718        let db = GraphDb::in_memory().unwrap();
719        let id1 = db.insert_node(&Node {
720            id: 0, name: "A".into(), kind: NodeKind::Struct,
721            language: Language::Rust, file_path: "a.rs".into(),
722            line_start: 1, line_end: 5, content: None,
723        }).unwrap();
724        let id2 = db.insert_node(&Node {
725            id: 0, name: "B".into(), kind: NodeKind::Trait,
726            language: Language::Rust, file_path: "b.rs".into(),
727            line_start: 1, line_end: 5, content: None,
728        }).unwrap();
729
730        db.insert_edge(&Edge { from_id: id1, to_id: id2, kind: EdgeKind::Implements, confidence: 1.0 }).unwrap();
731        db.insert_edge(&Edge { from_id: id1, to_id: id2, kind: EdgeKind::References, confidence: 0.8 }).unwrap();
732
733        let edges = db.edges_from(id1).unwrap();
734        assert_eq!(edges.len(), 2);
735        assert!(edges.iter().any(|e| e.kind == EdgeKind::Implements));
736        assert!(edges.iter().any(|e| e.kind == EdgeKind::References));
737    }
738
739    #[test]
740    fn test_edge_confidence_stored() {
741        let db = GraphDb::in_memory().unwrap();
742        let id1 = db.insert_node(&Node {
743            id: 0, name: "x".into(), kind: NodeKind::Function,
744            language: Language::Rust, file_path: "x.rs".into(),
745            line_start: 1, line_end: 1, content: None,
746        }).unwrap();
747        let id2 = db.insert_node(&Node {
748            id: 0, name: "y".into(), kind: NodeKind::Function,
749            language: Language::Rust, file_path: "y.rs".into(),
750            line_start: 1, line_end: 1, content: None,
751        }).unwrap();
752
753        db.insert_edge(&Edge { from_id: id1, to_id: id2, kind: EdgeKind::Calls, confidence: 0.75 }).unwrap();
754        let edges = db.edges_from(id1).unwrap();
755        assert!((edges[0].confidence - 0.75).abs() < 0.01);
756    }
757
758    #[test]
759    #[test]
760    fn test_fuzzy_search_basic() {
761        let db = GraphDb::in_memory().unwrap();
762        for name in &["process_request", "handle_response", "parse_input", "validate_data"] {
763            db.insert_node(&Node {
764                id: 0, name: name.to_string(), kind: NodeKind::Function,
765                language: Language::Rust, file_path: "lib.rs".into(),
766                line_start: 1, line_end: 5, content: None,
767            }).unwrap();
768        }
769
770        let results = db.fuzzy_search_nodes("proc").unwrap();
771        assert!(!results.is_empty(), "fuzzy search should find matches");
772        assert_eq!(results[0].name, "process_request", "best match should be first");
773    }
774
775    #[test]
776    fn test_fuzzy_search_typo_tolerance() {
777        let db = GraphDb::in_memory().unwrap();
778        db.insert_node(&Node {
779            id: 0, name: "calculate_total".into(), kind: NodeKind::Function,
780            language: Language::Rust, file_path: "math.rs".into(),
781            line_start: 1, line_end: 5, content: None,
782        }).unwrap();
783        db.insert_node(&Node {
784            id: 0, name: "validate_input".into(), kind: NodeKind::Function,
785            language: Language::Rust, file_path: "input.rs".into(),
786            line_start: 1, line_end: 5, content: None,
787        }).unwrap();
788
789        // "calctot" should fuzzy-match "calculate_total"
790        let results = db.fuzzy_search_nodes("calctot").unwrap();
791        assert!(!results.is_empty());
792        assert_eq!(results[0].name, "calculate_total");
793    }
794
795    #[test]
796    fn test_fuzzy_search_no_match() {
797        let db = GraphDb::in_memory().unwrap();
798        db.insert_node(&Node {
799            id: 0, name: "hello".into(), kind: NodeKind::Function,
800            language: Language::Rust, file_path: "t.rs".into(),
801            line_start: 1, line_end: 1, content: None,
802        }).unwrap();
803
804        let results = db.fuzzy_search_nodes("zzzzz").unwrap();
805        assert!(results.is_empty(), "no fuzzy match for gibberish");
806    }
807
808    #[test]
809    fn test_fuzzy_search_empty_db() {
810        let db = GraphDb::in_memory().unwrap();
811        let results = db.fuzzy_search_nodes("anything").unwrap();
812        assert!(results.is_empty());
813    }
814
815    #[test]
816    fn test_keyword_search() {
817        let db = GraphDb::in_memory().unwrap();
818        db.insert_node(&Node {
819            id: 0, name: "process_data".into(), kind: NodeKind::Function,
820            language: Language::Rust, file_path: "data.rs".into(),
821            line_start: 1, line_end: 10,
822            content: Some("pub fn process_data(input: Vec<String>) -> Result<()>".into()),
823        }).unwrap();
824        db.insert_node(&Node {
825            id: 0, name: "validate".into(), kind: NodeKind::Function,
826            language: Language::Rust, file_path: "val.rs".into(),
827            line_start: 1, line_end: 5, content: Some("fn validate(s: &str) -> bool".into()),
828        }).unwrap();
829
830        let results = db.keyword_search("process").unwrap();
831        assert!(!results.is_empty(), "FTS5 should find 'process'");
832        assert_eq!(results[0].name, "process_data");
833    }
834
835    #[test]
836    fn test_keyword_search_content() {
837        let db = GraphDb::in_memory().unwrap();
838        db.insert_node(&Node {
839            id: 0, name: "handler".into(), kind: NodeKind::Function,
840            language: Language::Rust, file_path: "web.rs".into(),
841            line_start: 1, line_end: 20,
842            content: Some("async fn handler(req: Request) -> Response { authenticate(req) }".into()),
843        }).unwrap();
844
845        // Search by content, not name
846        let results = db.keyword_search("authenticate").unwrap();
847        assert!(!results.is_empty(), "FTS5 should search content too");
848    }
849
850    #[test]
851    fn test_keyword_search_empty() {
852        let db = GraphDb::in_memory().unwrap();
853        db.insert_node(&Node {
854            id: 0, name: "hello".into(), kind: NodeKind::Function,
855            language: Language::Rust, file_path: "h.rs".into(),
856            line_start: 1, line_end: 1, content: None,
857        }).unwrap();
858
859        let results = db.keyword_search("nonexistent_xyz").unwrap();
860        assert!(results.is_empty());
861    }
862
863    #[test]
864    fn test_incremental_hash() {
865        let db = GraphDb::in_memory().unwrap();
866        let content = "fn main() {}";
867        assert!(db.needs_reindex("test.rs", content).unwrap(), "new file needs indexing");
868        db.store_file_hash("test.rs", content).unwrap();
869        assert!(!db.needs_reindex("test.rs", content).unwrap(), "same content skipped");
870        assert!(db.needs_reindex("test.rs", "fn main() { println!() }").unwrap(), "changed content needs re-index");
871    }
872
873    #[test]
874    fn test_node_with_none_content() {
875        let node = Node {
876            id: 0, name: "no_content".into(), kind: NodeKind::Function,
877            language: Language::Go, file_path: "main.go".into(),
878            line_start: 1, line_end: 10, content: None,
879        };
880        let json = serde_json::to_string(&node).unwrap();
881        let parsed: Node = serde_json::from_str(&json).unwrap();
882        assert!(parsed.content.is_none());
883        assert_eq!(parsed.language, Language::Go);
884    }
885}
deagle_core/lib.rs

deagle_core/
lib.rs
