mps-rs 1.6.0

MPS — plain-text personal productivity CLI (Rust)
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172

//! Bidirectional epoch-ref ↔ human-ref translator.
//!
//! Mirrors Ruby's `MPS::RefResolver` exactly.
//!
//! Human ref format:
//!   Top-level:  `{type}-{n}`           e.g. `task-1`, `note-2`, `mps-1`
//!   Nested:     `{parent_human}.{idx}` e.g. `mps-1.1`, `task-2.3`
//!
//! The resolver is ephemeral — instantiated per-request from a parsed elements map.

use std::collections::HashMap;
use indexmap::IndexMap;
use crate::elements::{Element, ElementKind};

pub struct RefResolver {
    epoch_to_human: HashMap<String, String>,
    human_to_epoch: HashMap<String, String>,
}

impl RefResolver {
    /// Build a resolver from a parsed elements map (as produced by `parser::parse_file`).
    pub fn new(elements: &IndexMap<String, Element>) -> Self {
        let mut r = RefResolver {
            epoch_to_human: HashMap::new(),
            human_to_epoch: HashMap::new(),
        };
        r.build_maps(elements);
        r
    }

    /// Return the human ref for an epoch ref, or None if not mapped.
    pub fn to_human(&self, epoch_ref: &str) -> Option<&str> {
        self.epoch_to_human.get(epoch_ref).map(|s| s.as_str())
    }

    /// Return the epoch ref for a human ref, or None if not mapped.
    pub fn to_epoch(&self, human_ref: &str) -> Option<&str> {
        self.human_to_epoch.get(human_ref).map(|s| s.as_str())
    }

    /// Resolve either form. Human refs are translated; epoch refs are validated and returned as-is.
    #[allow(dead_code)]
    pub fn resolve<'a>(&'a self, ref_str: &'a str) -> Option<&'a str> {
        if let Some(epoch) = self.human_to_epoch.get(ref_str) {
            return Some(epoch.as_str());
        }
        if self.epoch_to_human.contains_key(ref_str) {
            return Some(ref_str);
        }
        None
    }

    fn build_maps(&mut self, elements: &IndexMap<String, Element>) {
        if elements.is_empty() { return; }

        // Sort by ref-path parts numerically (mirrors Ruby's sort_by { k.split(".").map(&:to_i) })
        let mut sorted: Vec<(&String, &Element)> = elements.iter().collect();
        sorted.sort_by(|(a, _), (b, _)| {
            let a_parts: Vec<u64> = a.split('.').filter_map(|s| s.parse().ok()).collect();
            let b_parts: Vec<u64> = b.split('.').filter_map(|s| s.parse().ok()).collect();
            a_parts.cmp(&b_parts)
        });

        // root_depth = number of segments in the synthetic root wrapper ref (always 1: just the epoch)
        let root_depth = sorted.first().map(|(k, _)| k.split('.').count()).unwrap_or(1);
        let mut type_counters: HashMap<String, usize> = HashMap::new();

        for (epoch_ref, el) in &sorted {
            let seg_count = epoch_ref.split('.').count();
            let depth = seg_count - root_depth; // 0 = root, 1 = top-level, 2+ = nested

            if depth == 0 { continue; } // skip synthetic root @mps wrapper

            let human = if depth == 1 {
                // Top-level: skip Unknown elements (mirrors Ruby behaviour)
                if el.kind() == ElementKind::Unknown { continue; }
                let type_name = el.sign().to_string();
                let n = type_counters.entry(type_name.clone()).or_insert(0);
                *n += 1;
                format!("{}-{}", type_name, n)
            } else {
                // Nested: parent_epoch is all segments except the last
                let parts: Vec<&str> = epoch_ref.splitn(seg_count, '.').collect();
                let parent_epoch = parts[..parts.len() - 1].join(".");
                let child_idx = parts[parts.len() - 1];
                match self.epoch_to_human.get(&parent_epoch) {
                    Some(parent_human) => format!("{}.{}", parent_human, child_idx),
                    None => continue, // parent not mapped → skip
                }
            };

            self.epoch_to_human.insert(epoch_ref.to_string(), human.clone());
            self.human_to_epoch.insert(human, epoch_ref.to_string());
        }
    }
}

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

    fn parse(content: &str) -> IndexMap<String, Element> {
        let wrapped = format!("@mps[]{{\n{}\n}}", content);
        parser::parse_wrapped(&wrapped, 20260101).unwrap()
    }

    #[test]
    fn test_empty_elements() {
        let els = parse("");
        let r = RefResolver::new(&els);
        // Only root wrapper — nothing mapped (depth 0 skipped)
        assert!(r.epoch_to_human.is_empty());
    }

    #[test]
    fn test_top_level_task() {
        let els = parse("@task[work]{ Do thing }");
        let r = RefResolver::new(&els);
        assert_eq!(r.to_human("20260101.1"), Some("task-1"));
        assert_eq!(r.to_epoch("task-1"), Some("20260101.1"));
    }

    #[test]
    fn test_sequential_types() {
        let els = parse("@task{ A }\n@note{ B }\n@task{ C }");
        let r = RefResolver::new(&els);
        assert_eq!(r.to_human("20260101.1"), Some("task-1"));
        assert_eq!(r.to_human("20260101.2"), Some("note-1"));
        assert_eq!(r.to_human("20260101.3"), Some("task-2"));
    }

    #[test]
    fn test_nested_inside_mps() {
        let els = parse("@mps{\n  @task{ Nested }\n  @note{ also }\n}");
        let r = RefResolver::new(&els);
        // mps-1 is the @mps group
        assert_eq!(r.to_human("20260101.1"), Some("mps-1"));
        // task inside = mps-1.1, note inside = mps-1.2
        assert_eq!(r.to_human("20260101.1.1"), Some("mps-1.1"));
        assert_eq!(r.to_human("20260101.1.2"), Some("mps-1.2"));
    }

    #[test]
    fn test_resolve_accepts_both_forms() {
        let els = parse("@task{ A }");
        let r = RefResolver::new(&els);
        assert_eq!(r.resolve("task-1"), Some("20260101.1"));
        assert_eq!(r.resolve("20260101.1"), Some("20260101.1"));
        assert_eq!(r.resolve("bogus"), None);
    }

    #[test]
    fn test_unknown_element_skipped() {
        let els = parse("@widget{ unknown }\n@task{ real }");
        let r = RefResolver::new(&els);
        // widget at .1 should be skipped; task at .2 should be task-1
        assert!(r.to_human("20260101.1").is_none());
        assert_eq!(r.to_human("20260101.2"), Some("task-1"));
    }

    #[test]
    fn test_roundtrip() {
        let els = parse("@task[work]{ A }\n@note{ B }");
        let r = RefResolver::new(&els);
        for epoch_ref in r.epoch_to_human.keys() {
            let human = r.to_human(epoch_ref).unwrap();
            let back  = r.to_epoch(human).unwrap();
            assert_eq!(back, epoch_ref.as_str());
        }
    }
}