maproom 0.1.0

Semantic code search powered by embeddings and SQLite
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
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
//! String interning for memory deduplication.
//!
//! String interning deduplicates repeated strings by storing only one copy
//! of each unique string value and returning Arc references to it.
//!
//! # Benefits
//!
//! - **Memory Reduction**: Shared strings eliminate duplication
//! - **Fast Comparison**: Arc pointer equality is O(1)
//! - **Thread-Safe**: Arc provides safe shared ownership
//!
//! # Use Cases
//!
//! - File paths (many chunks from same file)
//! - Symbol names (functions, classes, variables)
//! - Language identifiers (limited set: ts/js/rs/py/md/json/yaml/toml)
//! - Repository names and worktree paths
//!
//! # Performance
//!
//! - Intern: O(1) average (HashMap lookup)
//! - Compare: O(1) (pointer equality)
//! - Memory: ~48 bytes overhead per unique string (HashMap entry + Arc)
//!
//! # Example
//!
//! ```no_run
//! use maproom::memory::StringInterner;
//! use std::sync::Arc;
//!
//! let interner = StringInterner::new();
//!
//! let path1 = interner.intern("src/main.rs");
//! let path2 = interner.intern("src/main.rs");
//!
//! // Same Arc pointer - no duplication
//! assert!(Arc::ptr_eq(&path1, &path2));
//!
//! // Stats show deduplication
//! let stats = interner.stats();
//! assert_eq!(stats.unique_strings, 1);
//! assert_eq!(stats.total_interns, 2);
//! ```

use lazy_static::lazy_static;
use std::collections::HashMap;
use std::sync::{Arc, RwLock};

lazy_static! {
    /// Global string interner instance.
    ///
    /// This is used for interning strings that are shared across the entire
    /// application, such as language identifiers and common paths.
    static ref GLOBAL_INTERNER: Arc<StringInterner> = Arc::new(StringInterner::new());
}

/// Get the global StringInterner instance.
///
/// Use this for application-wide string interning.
pub fn get_global_interner() -> Arc<StringInterner> {
    GLOBAL_INTERNER.clone()
}

/// String interner that deduplicates strings using Arc.
///
/// StringInterner maintains a HashMap of unique strings and returns
/// Arc references to them, ensuring each unique string is stored only once.
///
/// # Thread Safety
///
/// This struct uses RwLock for thread-safe concurrent access:
/// - Multiple threads can read simultaneously
/// - Writes are exclusive
///
/// # Memory Model
///
/// ```text
/// HashMap<String, Arc<str>>
//////    ├─ "src/main.rs" → Arc<str> ────┐
///    │                               │
///    ├─ "main" → Arc<str> ────────┐  │
///    │                            │  │
///    └─ "ts" → Arc<str> ─────┐    │  │
///                            │    │  │
/// Multiple references can point to same Arc:
///                            ↓    ↓  ↓
///                         [Shared Memory]
/// ```
pub struct StringInterner {
    /// Map from string values to Arc references
    map: RwLock<HashMap<String, Arc<str>>>,

    /// Statistics counters
    stats: RwLock<InternerStats>,
}

impl StringInterner {
    /// Create a new StringInterner.
    pub fn new() -> Self {
        Self {
            map: RwLock::new(HashMap::new()),
            stats: RwLock::new(InternerStats::default()),
        }
    }

    /// Create a new StringInterner with expected capacity.
    ///
    /// Pre-allocating capacity can improve performance when the number
    /// of unique strings is known in advance.
    pub fn with_capacity(capacity: usize) -> Self {
        Self {
            map: RwLock::new(HashMap::with_capacity(capacity)),
            stats: RwLock::new(InternerStats::default()),
        }
    }

    /// Intern a string, returning an Arc reference.
    ///
    /// If the string has been interned before, returns the existing Arc.
    /// Otherwise, creates a new Arc and stores it.
    ///
    /// # Example
    ///
    /// ```no_run
    /// use maproom::memory::StringInterner;
    ///
    /// let interner = StringInterner::new();
    /// let s1 = interner.intern("hello");
    /// let s2 = interner.intern("hello");
    ///
    /// assert!(std::sync::Arc::ptr_eq(&s1, &s2));
    /// ```
    pub fn intern(&self, s: &str) -> Arc<str> {
        // Fast path: check if already interned (read lock)
        {
            let map = self.map.read().unwrap();
            if let Some(arc) = map.get(s) {
                let mut stats = self.stats.write().unwrap();
                stats.total_interns += 1;
                stats.hits += 1;
                return arc.clone();
            }
        }

        // Slow path: need to insert (write lock)
        let mut map = self.map.write().unwrap();

        // Double-check in case another thread inserted while we waited
        if let Some(arc) = map.get(s) {
            let mut stats = self.stats.write().unwrap();
            stats.total_interns += 1;
            stats.hits += 1;
            return arc.clone();
        }

        // Create new Arc and insert
        let arc: Arc<str> = Arc::from(s);
        map.insert(s.to_string(), arc.clone());

        let mut stats = self.stats.write().unwrap();
        stats.total_interns += 1;
        stats.misses += 1;
        stats.unique_strings = map.len();

        arc
    }

    /// Intern a String, consuming it.
    ///
    /// This is more efficient than intern() when you already have a String,
    /// as it avoids an extra allocation on cache miss.
    pub fn intern_owned(&self, s: String) -> Arc<str> {
        // Fast path: check if already interned
        {
            let map = self.map.read().unwrap();
            if let Some(arc) = map.get(s.as_str()) {
                let mut stats = self.stats.write().unwrap();
                stats.total_interns += 1;
                stats.hits += 1;
                return arc.clone();
            }
        }

        // Slow path: insert owned string
        let mut map = self.map.write().unwrap();

        // Double-check
        if let Some(arc) = map.get(s.as_str()) {
            let mut stats = self.stats.write().unwrap();
            stats.total_interns += 1;
            stats.hits += 1;
            return arc.clone();
        }

        // Create Arc from the owned String
        let arc: Arc<str> = Arc::from(s.as_str());
        map.insert(s, arc.clone());

        let mut stats = self.stats.write().unwrap();
        stats.total_interns += 1;
        stats.misses += 1;
        stats.unique_strings = map.len();

        arc
    }

    /// Get interning statistics.
    pub fn stats(&self) -> InternerStats {
        self.stats.read().unwrap().clone()
    }

    /// Get the number of unique strings interned.
    pub fn len(&self) -> usize {
        self.map.read().unwrap().len()
    }

    /// Check if the interner is empty.
    pub fn is_empty(&self) -> bool {
        self.map.read().unwrap().is_empty()
    }

    /// Clear all interned strings.
    ///
    /// This removes all entries from the interner. Existing Arc references
    /// remain valid but are no longer shared through the interner.
    pub fn clear(&self) {
        let mut map = self.map.write().unwrap();
        map.clear();

        let mut stats = self.stats.write().unwrap();
        stats.unique_strings = 0;
    }

    /// Estimate memory usage in bytes.
    ///
    /// This is an approximation based on:
    /// - HashMap overhead: ~48 bytes per entry
    /// - String data: actual string bytes
    /// - Arc overhead: ~16 bytes per Arc
    pub fn estimated_memory_bytes(&self) -> usize {
        let map = self.map.read().unwrap();
        let mut total = 0;

        for (key, _) in map.iter() {
            // HashMap entry overhead
            total += 48;
            // String key data
            total += key.len();
            // Arc overhead
            total += 16;
        }

        total
    }
}

impl Default for StringInterner {
    fn default() -> Self {
        Self::new()
    }
}

/// Statistics for string interning.
#[derive(Debug, Clone, Default)]
pub struct InternerStats {
    /// Total number of intern() calls
    pub total_interns: usize,

    /// Number of cache hits (string was already interned)
    pub hits: usize,

    /// Number of cache misses (new string interned)
    pub misses: usize,

    /// Number of unique strings currently interned
    pub unique_strings: usize,
}

impl InternerStats {
    /// Calculate the hit rate (0.0-1.0).
    pub fn hit_rate(&self) -> f64 {
        if self.total_interns == 0 {
            0.0
        } else {
            self.hits as f64 / self.total_interns as f64
        }
    }

    /// Calculate the deduplication ratio.
    ///
    /// This shows how many references share each unique string on average.
    /// Higher is better (more deduplication).
    pub fn deduplication_ratio(&self) -> f64 {
        if self.unique_strings == 0 {
            0.0
        } else {
            self.total_interns as f64 / self.unique_strings as f64
        }
    }
}

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

    #[test]
    fn test_basic_interning() {
        let interner = StringInterner::new();

        let s1 = interner.intern("hello");
        let s2 = interner.intern("hello");
        let s3 = interner.intern("world");

        // Same string should return same Arc
        assert!(Arc::ptr_eq(&s1, &s2));

        // Different string should return different Arc
        assert!(!Arc::ptr_eq(&s1, &s3));

        assert_eq!(interner.len(), 2);
    }

    #[test]
    fn test_intern_owned() {
        let interner = StringInterner::new();

        let s1 = interner.intern_owned("hello".to_string());
        let s2 = interner.intern("hello");

        assert!(Arc::ptr_eq(&s1, &s2));
        assert_eq!(interner.len(), 1);
    }

    #[test]
    fn test_stats() {
        let interner = StringInterner::new();

        interner.intern("a");
        interner.intern("a");
        interner.intern("b");
        interner.intern("a");

        let stats = interner.stats();
        assert_eq!(stats.total_interns, 4);
        assert_eq!(stats.hits, 2); // "a" hit twice
        assert_eq!(stats.misses, 2); // "a" and "b" missed once each
        assert_eq!(stats.unique_strings, 2);
        assert_eq!(stats.hit_rate(), 0.5);
        assert_eq!(stats.deduplication_ratio(), 2.0);
    }

    #[test]
    fn test_clear() {
        let interner = StringInterner::new();

        let s1 = interner.intern("hello");
        assert_eq!(interner.len(), 1);

        interner.clear();
        assert_eq!(interner.len(), 0);

        // Old Arc is still valid
        assert_eq!(&*s1, "hello");

        // New intern creates new Arc
        let s2 = interner.intern("hello");
        assert!(!Arc::ptr_eq(&s1, &s2));
    }

    #[test]
    fn test_with_capacity() {
        let interner = StringInterner::with_capacity(100);
        assert_eq!(interner.len(), 0);

        for i in 0..50 {
            interner.intern(&format!("string_{}", i));
        }

        assert_eq!(interner.len(), 50);
    }

    #[test]
    fn test_memory_estimation() {
        let interner = StringInterner::new();

        interner.intern("short");
        interner.intern("a_longer_string");

        let memory = interner.estimated_memory_bytes();
        assert!(memory > 0);
        assert!(memory > 100); // Should account for overhead and string data
    }

    #[test]
    fn test_global_interner() {
        let interner1 = get_global_interner();
        let interner2 = get_global_interner();

        assert!(Arc::ptr_eq(&interner1, &interner2));

        let s1 = interner1.intern("global");
        let s2 = interner2.intern("global");

        assert!(Arc::ptr_eq(&s1, &s2));
    }

    #[test]
    fn test_empty_string() {
        let interner = StringInterner::new();

        let s1 = interner.intern("");
        let s2 = interner.intern("");

        assert!(Arc::ptr_eq(&s1, &s2));
        assert_eq!(&*s1, "");
    }

    #[test]
    fn test_unicode_strings() {
        let interner = StringInterner::new();

        let s1 = interner.intern("你好世界");
        let s2 = interner.intern("你好世界");
        let s3 = interner.intern("こんにちは");

        assert!(Arc::ptr_eq(&s1, &s2));
        assert!(!Arc::ptr_eq(&s1, &s3));
    }

    #[test]
    fn test_concurrent_access() {
        use std::thread;

        let interner = Arc::new(StringInterner::new());
        let mut handles = vec![];

        for i in 0..10 {
            let interner_clone = interner.clone();
            let handle = thread::spawn(move || {
                for j in 0..100 {
                    interner_clone.intern(&format!("thread_{}_{}", i, j % 10));
                }
            });
            handles.push(handle);
        }

        for handle in handles {
            handle.join().unwrap();
        }

        // Should have deduplicated many strings
        let stats = interner.stats();
        assert!(stats.unique_strings <= 100); // 10 threads * 10 unique strings each
        assert!(stats.total_interns == 1000); // 10 threads * 100 calls each
    }

    #[test]
    fn test_deduplication_ratio() {
        let interner = StringInterner::new();

        // Intern same string multiple times
        for _ in 0..100 {
            interner.intern("repeated");
        }

        let stats = interner.stats();
        assert_eq!(stats.unique_strings, 1);
        assert_eq!(stats.deduplication_ratio(), 100.0);
    }
}