snippy 0.1.1

A command-line tool for that makes using LLMs for code generation a breeze
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

use crate::ClipboardError;
use std::collections::HashMap;
use std::path::Path;
use tracing::{debug, trace};

/// Represents a node in a trie.
pub struct TrieNode {
    pub children: HashMap<String, TrieNode>,
    pub token_count: Option<usize>,
}

impl TrieNode {
    pub fn new() -> Self {
        debug!("Creating new TrieNode");
        TrieNode {
            children: HashMap::new(),
            token_count: None,
        }
    }

    /// Calculates the total number of tokens in the subtree.
    pub fn calculate_total_tokens(&self) -> usize {
        trace!("Calculating total tokens for TrieNode");
        self.token_count.unwrap_or(0)
            + self
                .children
                .values()
                .map(|child| child.calculate_total_tokens())
                .sum::<usize>()
    }
}

/// Represents a trie data structure.
pub struct Trie {
    root: TrieNode,
}

impl Trie {
    pub fn new() -> Self {
        debug!("Creating new Trie");
        Trie {
            root: TrieNode::new(),
        }
    }

    /// Inserts a path with its token count into the trie.
    pub fn insert(&mut self, path: &Path, token_count: usize) -> Result<(), ClipboardError> {
        debug!(
            "Inserting path: {:?} with token count: {}",
            path, token_count
        );
        let mut current_node = &mut self.root;
        for component in path.iter() {
            let component_str = component.to_string_lossy().into_owned();
            current_node = current_node
                .children
                .entry(component_str)
                .or_insert_with(TrieNode::new);
        }
        if current_node.token_count.is_some() {
            trace!("Overwriting existing token count for path: {:?}", path);
        }
        current_node.token_count = Some(token_count);
        Ok(())
    }

    /// Returns the root node of the trie.
    pub fn get_root(&self) -> &TrieNode {
        trace!("Getting root of the Trie");
        &self.root
    }
}