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

deagle_core/
lib.rs
