codeskeleton 0.1.0

Turn any folder of code into a queryable knowledge graph. Single binary, zero runtime dependencies, blazing fast.
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

//! File discovery — walk directories, respect .gitignore and .cographignore.

use ignore::WalkBuilder;
use std::path::{Path, PathBuf};

/// Code file extensions we know how to parse via tree-sitter.
const CODE_EXTENSIONS: &[&str] = &[
    "py", "js", "jsx", "ts", "tsx", "rs", "go", "java", "c", "h",
];

/// Collect all parseable source files under `root`.
///
/// Respects `.gitignore` and `.cographignore` (same syntax as .gitignore).
/// Returns a sorted list for deterministic processing order.
pub fn collect_files(root: &Path) -> Vec<PathBuf> {
    let mut builder = WalkBuilder::new(root);
    builder.standard_filters(true); // respects .gitignore
    builder.hidden(true); // skip hidden files/dirs

    // Add .cographignore if present
    let ignore_file = root.join(".cographignore");
    if ignore_file.exists() {
        builder.add_ignore(ignore_file);
    }

    let mut files: Vec<PathBuf> = builder
        .build()
        .filter_map(|entry| entry.ok())
        .filter(|entry| entry.file_type().map_or(false, |ft| ft.is_file()))
        .filter(|entry| {
            entry
                .path()
                .extension()
                .and_then(|ext| ext.to_str())
                .map_or(false, |ext| CODE_EXTENSIONS.contains(&ext))
        })
        .map(|entry| entry.into_path())
        .collect();

    files.sort();
    files
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_code_extensions_coverage() {
        assert!(CODE_EXTENSIONS.contains(&"py"));
        assert!(CODE_EXTENSIONS.contains(&"rs"));
        assert!(CODE_EXTENSIONS.contains(&"go"));
        assert!(!CODE_EXTENSIONS.contains(&"txt"));
        assert!(!CODE_EXTENSIONS.contains(&"md"));
    }
}