ipfrs-tensorlogic 0.2.0

Zero-copy tensor operations and logic programming for content-addressed storage
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
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
//! Hot-reload manager for logic rule sets.
//!
//! Manages live swapping of versioned rule sets without interrupting running
//! inference sessions.  Sessions can be pinned to a specific version and
//! optionally migrated to the latest version on every `commit`.
//!
//! ## Lifecycle
//!
//! ```text
//! load_rule_set(rules)   ──► pending_version set, RuleSetLoaded logged
//!//! commit()               ──► pending → current, sessions migrated, RuleSetSwapped logged
//! ```

use std::collections::HashMap;

// ---------------------------------------------------------------------------
// FNV-1a helpers (pure Rust, no external crate)
// ---------------------------------------------------------------------------

const FNV_OFFSET_BASIS: u64 = 14_695_981_039_346_656_037;
const FNV_PRIME: u64 = 1_099_511_628_211;

/// Compute a 64-bit FNV-1a checksum over a byte slice.
fn fnv1a_64(data: &[u8]) -> u64 {
    let mut hash = FNV_OFFSET_BASIS;
    for &byte in data {
        hash ^= u64::from(byte);
        hash = hash.wrapping_mul(FNV_PRIME);
    }
    hash
}

/// Compute the FNV-1a checksum for a slice of rule-id strings.
///
/// Rule IDs are concatenated in order (no separator) as described in the spec.
fn checksum_rules(rule_ids: &[String]) -> u64 {
    let mut combined: Vec<u8> = Vec::new();
    for id in rule_ids {
        combined.extend_from_slice(id.as_bytes());
    }
    fnv1a_64(&combined)
}

// ---------------------------------------------------------------------------
// ReloadEvent
// ---------------------------------------------------------------------------

/// Events emitted during the hot-reload lifecycle.
#[derive(Clone, Debug)]
pub enum ReloadEvent {
    /// A new rule set has been loaded into the pending slot.
    RuleSetLoaded {
        /// The version number assigned to this rule set.
        version: u64,
        /// How many rules are in the set.
        rule_count: usize,
    },
    /// The pending rule set has been committed and swapped into the active slot.
    RuleSetSwapped {
        /// The version that was previously active.
        old_version: u64,
        /// The version that is now active.
        new_version: u64,
    },
    /// A session has been migrated from one version to another.
    SessionMigrated {
        /// The session that was migrated.
        session_id: String,
        /// The version the session was pinned to before migration.
        from_version: u64,
        /// The version the session is now pinned to.
        to_version: u64,
    },
    /// A reload attempt failed.
    ReloadFailed {
        /// Human-readable description of the failure.
        reason: String,
    },
}

// ---------------------------------------------------------------------------
// VersionedRuleSet
// ---------------------------------------------------------------------------

/// An immutable, versioned snapshot of a rule set.
///
/// The `checksum` is the FNV-1a hash computed over all `rules` concatenated in
/// their original order.
#[derive(Clone, Debug)]
pub struct VersionedRuleSet {
    /// Monotonically increasing version counter.
    pub version: u64,
    /// Rule IDs that belong to this version.
    pub rules: Vec<String>,
    /// Unix timestamp (seconds) when this version was loaded.
    pub loaded_at_secs: u64,
    /// FNV-1a checksum of all rule IDs concatenated in order.
    pub checksum: u64,
}

impl VersionedRuleSet {
    /// Returns the number of rules in this version.
    pub fn rule_count(&self) -> usize {
        self.rules.len()
    }

    /// Returns `true` if `rule_id` is present in this rule set.
    pub fn contains(&self, rule_id: &str) -> bool {
        self.rules.iter().any(|r| r == rule_id)
    }
}

// ---------------------------------------------------------------------------
// LiveSession
// ---------------------------------------------------------------------------

/// Tracks a single running inference session and the rule-set version it uses.
#[derive(Clone, Debug)]
pub struct LiveSession {
    /// Unique identifier for this session.
    pub session_id: String,
    /// The rule-set version this session is currently locked to.
    pub pinned_version: u64,
    /// Unix timestamp (seconds) when the session started.
    pub started_at_secs: u64,
    /// When `true` this session may be automatically migrated to the latest
    /// rule-set version on the next `commit`.
    pub migrateable: bool,
}

// ---------------------------------------------------------------------------
// ReloadStats
// ---------------------------------------------------------------------------

/// Cumulative statistics for the `RuleHotReloadManager`.
#[derive(Clone, Debug, Default)]
pub struct ReloadStats {
    /// Total number of `commit` calls attempted.
    pub total_reloads: u64,
    /// Number of commits that completed successfully.
    pub successful_reloads: u64,
    /// Number of commits that failed.
    pub failed_reloads: u64,
    /// Total number of sessions migrated across all commits.
    pub sessions_migrated: u64,
}

impl ReloadStats {
    /// Returns the fraction of reload attempts that succeeded.
    ///
    /// Returns `0.0` if no reloads have been attempted yet.
    pub fn success_rate(&self) -> f64 {
        if self.total_reloads == 0 {
            0.0
        } else {
            self.successful_reloads as f64 / self.total_reloads as f64
        }
    }
}

// ---------------------------------------------------------------------------
// RuleHotReloadManager
// ---------------------------------------------------------------------------

/// Maximum number of events retained in the in-memory event log.
const MAX_EVENT_LOG: usize = 100;

/// Hot-reload manager that atomically swaps versioned rule sets while
/// keeping running inference sessions stable.
pub struct RuleHotReloadManager {
    /// The rule set that is currently active (served to sessions).
    pub current_version: Option<VersionedRuleSet>,
    /// The next rule set waiting to be committed.
    pub pending_version: Option<VersionedRuleSet>,
    /// All currently registered inference sessions, keyed by session ID.
    pub live_sessions: HashMap<String, LiveSession>,
    /// Bounded ring of the last `MAX_EVENT_LOG` lifecycle events.
    pub event_log: Vec<ReloadEvent>,
    /// Cumulative reload statistics.
    pub stats: ReloadStats,
    /// Counter used to assign the next version number.
    next_version: u64,
}

impl RuleHotReloadManager {
    /// Creates a new, empty manager with no rule sets loaded.
    pub fn new() -> Self {
        Self {
            current_version: None,
            pending_version: None,
            live_sessions: HashMap::new(),
            event_log: Vec::new(),
            stats: ReloadStats::default(),
            next_version: 1,
        }
    }

    // -----------------------------------------------------------------------
    // Internal helpers
    // -----------------------------------------------------------------------

    /// Append an event to the bounded event log.
    ///
    /// When the log reaches `MAX_EVENT_LOG` entries the oldest entry is
    /// discarded to make room for the new one.
    fn push_event(&mut self, event: ReloadEvent) {
        if self.event_log.len() >= MAX_EVENT_LOG {
            self.event_log.remove(0);
        }
        self.event_log.push(event);
    }

    // -----------------------------------------------------------------------
    // Public API
    // -----------------------------------------------------------------------

    /// Load a new rule set into the *pending* slot.
    ///
    /// Computes the FNV-1a checksum over the supplied rule IDs, assigns the
    /// next available version number, stores the result as `pending_version`,
    /// and appends a [`ReloadEvent::RuleSetLoaded`] event.
    ///
    /// Returns the version number assigned to the new rule set.
    pub fn load_rule_set(&mut self, rules: Vec<String>, now_secs: u64) -> u64 {
        let version = self.next_version;
        self.next_version += 1;

        let checksum = checksum_rules(&rules);
        let rule_count = rules.len();

        self.pending_version = Some(VersionedRuleSet {
            version,
            rules,
            loaded_at_secs: now_secs,
            checksum,
        });

        self.push_event(ReloadEvent::RuleSetLoaded {
            version,
            rule_count,
        });

        version
    }

    /// Commit the pending rule set to active.
    ///
    /// - If there is no pending rule set, returns `None` immediately.
    /// - Otherwise the pending set becomes the new `current_version`.
    /// - A [`ReloadEvent::RuleSetSwapped`] event is appended.
    /// - Every *migrateable* session is updated to the new version and a
    ///   [`ReloadEvent::SessionMigrated`] is appended for each one.
    /// - `stats.successful_reloads` and `stats.total_reloads` are incremented.
    ///
    /// Returns the new current version number on success.
    pub fn commit(&mut self) -> Option<u64> {
        let pending = self.pending_version.take()?;
        let new_version = pending.version;
        let old_version = self.current_version.as_ref().map(|v| v.version).unwrap_or(0);

        self.current_version = Some(pending);

        self.push_event(ReloadEvent::RuleSetSwapped {
            old_version,
            new_version,
        });

        // Migrate all migrateable sessions.
        let migrateable_ids: Vec<String> = self
            .live_sessions
            .values()
            .filter(|s| s.migrateable && s.pinned_version != new_version)
            .map(|s| s.session_id.clone())
            .collect();

        for session_id in migrateable_ids {
            if let Some(session) = self.live_sessions.get_mut(&session_id) {
                let from_version = session.pinned_version;
                session.pinned_version = new_version;
                self.stats.sessions_migrated += 1;
                // We must push the event after updating stats; borrow of
                // `self.live_sessions` was already released above.
                let event = ReloadEvent::SessionMigrated {
                    session_id: session_id.clone(),
                    from_version,
                    to_version: new_version,
                };
                // Push event — borrow checker note: `self.live_sessions` is
                // NOT borrowed here because we only borrow `self.event_log`.
                if self.event_log.len() >= MAX_EVENT_LOG {
                    self.event_log.remove(0);
                }
                self.event_log.push(event);
            }
        }

        self.stats.total_reloads += 1;
        self.stats.successful_reloads += 1;

        Some(new_version)
    }

    /// Register a new inference session.
    ///
    /// The session is pinned to `pinned_version`.  When `migrateable` is
    /// `true` the session will be automatically updated to the latest version
    /// on every subsequent `commit`.
    pub fn register_session(
        &mut self,
        session_id: String,
        pinned_version: u64,
        started_at_secs: u64,
        migrateable: bool,
    ) {
        self.live_sessions.insert(
            session_id.clone(),
            LiveSession {
                session_id,
                pinned_version,
                started_at_secs,
                migrateable,
            },
        );
    }

    /// Remove a session by ID.
    ///
    /// Returns `true` if the session existed and was removed, `false` if it
    /// was not found.
    pub fn unregister_session(&mut self, session_id: &str) -> bool {
        self.live_sessions.remove(session_id).is_some()
    }

    /// Returns all sessions whose `pinned_version` differs from the current
    /// active version.
    ///
    /// When no rule set has been committed yet (`current_version` is `None`)
    /// *all* sessions are considered to be on an "old" version.
    pub fn sessions_on_old_version(&self) -> Vec<&LiveSession> {
        match &self.current_version {
            None => self.live_sessions.values().collect(),
            Some(current) => self
                .live_sessions
                .values()
                .filter(|s| s.pinned_version != current.version)
                .collect(),
        }
    }

    /// Returns the version number of the currently active rule set, or `None`
    /// if no rule set has been committed yet.
    pub fn current_version(&self) -> Option<u64> {
        self.current_version.as_ref().map(|v| v.version)
    }

    /// Returns a reference to the cumulative reload statistics.
    pub fn stats(&self) -> &ReloadStats {
        &self.stats
    }

    /// Returns the last `n` events from the event log.
    ///
    /// If `n` exceeds the number of events stored, all stored events are
    /// returned.
    pub fn recent_events(&self, n: usize) -> &[ReloadEvent] {
        let len = self.event_log.len();
        if n >= len {
            &self.event_log
        } else {
            &self.event_log[len - n..]
        }
    }
}

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

// ---------------------------------------------------------------------------
// Tests
// ---------------------------------------------------------------------------

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

    /// Helper: create a manager and load a rule set with deterministic time.
    fn make_manager_with_rules(rules: Vec<&str>) -> (RuleHotReloadManager, u64) {
        let mut mgr = RuleHotReloadManager::new();
        let rule_strings: Vec<String> = rules.into_iter().map(|s| s.to_string()).collect();
        let version = mgr.load_rule_set(rule_strings, 1_000);
        (mgr, version)
    }

    // 1. new() creates an empty manager.
    #[test]
    fn test_new_is_empty() {
        let mgr = RuleHotReloadManager::new();
        assert!(mgr.current_version.is_none());
        assert!(mgr.pending_version.is_none());
        assert!(mgr.live_sessions.is_empty());
        assert!(mgr.event_log.is_empty());
        assert_eq!(mgr.stats.total_reloads, 0);
    }

    // 2. load_rule_set returns the correct version and sets pending.
    #[test]
    fn test_load_rule_set_returns_version_and_sets_pending() {
        let (mgr, version) = make_manager_with_rules(vec!["rule_a", "rule_b"]);
        assert_eq!(version, 1);
        let pending = mgr.pending_version.as_ref().expect("pending should be set");
        assert_eq!(pending.version, 1);
        assert_eq!(pending.rules.len(), 2);
    }

    // 3. load_rule_set computes a non-zero checksum.
    #[test]
    fn test_load_rule_set_checksum_computed() {
        let (mgr, _) = make_manager_with_rules(vec!["rule_a", "rule_b"]);
        let pending = mgr.pending_version.as_ref().expect("test: should succeed");
        // FNV-1a over non-empty input is never 0 in practice; also verify it
        // matches the manually computed value.
        let expected = checksum_rules(&[
            "rule_a".to_string(),
            "rule_b".to_string(),
        ]);
        assert_eq!(pending.checksum, expected);
        assert_ne!(pending.checksum, 0);
    }

    // 4. commit returns None when there is no pending rule set.
    #[test]
    fn test_commit_none_if_no_pending() {
        let mut mgr = RuleHotReloadManager::new();
        assert!(mgr.commit().is_none());
    }

    // 5. commit swaps pending into current.
    #[test]
    fn test_commit_swaps_pending_to_current() {
        let (mut mgr, version) = make_manager_with_rules(vec!["rule_x"]);
        let committed = mgr.commit().expect("commit should succeed");
        assert_eq!(committed, version);
        assert!(mgr.current_version.is_some());
        assert!(mgr.pending_version.is_none());
        assert_eq!(mgr.current_version.as_ref().expect("test: should succeed").version, version);
    }

    // 6. commit logs a RuleSetSwapped event.
    #[test]
    fn test_commit_logs_rule_set_swapped() {
        let (mut mgr, _) = make_manager_with_rules(vec!["rule_y"]);
        mgr.commit();
        let swapped = mgr.event_log.iter().any(|e| {
            matches!(e, ReloadEvent::RuleSetSwapped { new_version: 1, .. })
        });
        assert!(swapped, "expected RuleSetSwapped in event log");
    }

    // 7. commit migrates migrateable sessions.
    #[test]
    fn test_commit_migrates_migrateable_sessions() {
        let (mut mgr, v1) = make_manager_with_rules(vec!["r1"]);
        mgr.commit();

        // Load v2 and register a migrateable session pinned to v1.
        let v2 = mgr.load_rule_set(vec!["r1".to_string(), "r2".to_string()], 2_000);
        mgr.register_session("sess-1".to_string(), v1, 1_000, true);

        mgr.commit();

        let session = mgr.live_sessions.get("sess-1").expect("test: should succeed");
        assert_eq!(session.pinned_version, v2);
    }

    // 8. commit does NOT migrate non-migrateable sessions.
    #[test]
    fn test_commit_does_not_migrate_non_migrateable_sessions() {
        let (mut mgr, v1) = make_manager_with_rules(vec!["r1"]);
        mgr.commit();

        let v2 = mgr.load_rule_set(vec!["r1".to_string(), "r2".to_string()], 2_000);
        mgr.register_session("sess-locked".to_string(), v1, 1_000, false);

        mgr.commit();

        let session = mgr.live_sessions.get("sess-locked").expect("test: should succeed");
        // Should still be pinned to v1, not v2.
        assert_eq!(session.pinned_version, v1);
        assert_ne!(session.pinned_version, v2);
    }

    // 9. register_session adds a session to live_sessions.
    #[test]
    fn test_register_session_adds_to_map() {
        let mut mgr = RuleHotReloadManager::new();
        mgr.register_session("my-session".to_string(), 1, 500, true);
        assert!(mgr.live_sessions.contains_key("my-session"));
    }

    // 10. unregister_session removes and returns true; false for missing.
    #[test]
    fn test_unregister_session_removes_and_returns_correct_bool() {
        let mut mgr = RuleHotReloadManager::new();
        mgr.register_session("s1".to_string(), 1, 100, false);

        assert!(mgr.unregister_session("s1"));
        assert!(!mgr.live_sessions.contains_key("s1"));
        // Removing again should return false.
        assert!(!mgr.unregister_session("s1"));
    }

    // 11. sessions_on_old_version lists sessions with stale pinned_version.
    #[test]
    fn test_sessions_on_old_version_after_commit() {
        let (mut mgr, v1) = make_manager_with_rules(vec!["r1"]);
        mgr.commit();

        // Register an un-migrateable session pinned to v1.
        mgr.register_session("old-sess".to_string(), v1, 1_000, false);

        // Load and commit v2.
        mgr.load_rule_set(vec!["r1".to_string(), "r2".to_string()], 2_000);
        mgr.commit();

        let old = mgr.sessions_on_old_version();
        let ids: Vec<&str> = old.iter().map(|s| s.session_id.as_str()).collect();
        assert!(ids.contains(&"old-sess"), "old-sess should appear in stale list");
    }

    // 12. current_version is None before commit, Some after.
    #[test]
    fn test_current_version_none_before_commit_some_after() {
        let (mut mgr, version) = make_manager_with_rules(vec!["r1"]);
        assert!(mgr.current_version().is_none());
        mgr.commit();
        assert_eq!(mgr.current_version(), Some(version));
    }

    // 13. successful_reloads incremented after each commit.
    #[test]
    fn test_stats_successful_reloads_incremented() {
        let mut mgr = RuleHotReloadManager::new();
        mgr.load_rule_set(vec!["r1".to_string()], 1_000);
        mgr.commit();
        assert_eq!(mgr.stats().successful_reloads, 1);
        mgr.load_rule_set(vec!["r2".to_string()], 2_000);
        mgr.commit();
        assert_eq!(mgr.stats().successful_reloads, 2);
    }

    // 14. success_rate calculation.
    #[test]
    fn test_stats_success_rate() {
        let mut stats = ReloadStats {
            total_reloads: 4,
            successful_reloads: 3,
            failed_reloads: 1,
            sessions_migrated: 0,
        };
        let rate = stats.success_rate();
        assert!((rate - 0.75).abs() < f64::EPSILON);

        stats.total_reloads = 0;
        assert_eq!(stats.success_rate(), 0.0);
    }

    // 15. event_log is bounded at MAX_EVENT_LOG (100).
    #[test]
    fn test_event_log_bounded_at_100() {
        let mut mgr = RuleHotReloadManager::new();
        // Each load_rule_set produces 1 event (RuleSetLoaded).
        // Each commit produces ≥1 event (RuleSetSwapped).
        // Push more than 100 events by alternating load + commit.
        for i in 0u64..60 {
            mgr.load_rule_set(vec![format!("rule_{i}")], i * 10);
            mgr.commit();
        }
        assert!(
            mgr.event_log.len() <= MAX_EVENT_LOG,
            "event log length {} exceeds MAX_EVENT_LOG {}",
            mgr.event_log.len(),
            MAX_EVENT_LOG
        );
    }

    // 16. recent_events returns the last n events.
    #[test]
    fn test_recent_events_returns_last_n() {
        let mut mgr = RuleHotReloadManager::new();
        for i in 0u64..5 {
            mgr.load_rule_set(vec![format!("rule_{i}")], i * 10);
            mgr.commit();
        }
        // 5 loads → 5 RuleSetLoaded events
        // 5 commits → 5 RuleSetSwapped events
        // total = 10 events
        let all = mgr.event_log.len();
        let last3 = mgr.recent_events(3);
        assert_eq!(last3.len(), 3);
        // The 3 events returned should be the same as the last 3 in event_log.
        let expected = &mgr.event_log[all - 3..];
        // Compare discriminants via Debug since ReloadEvent is not PartialEq.
        for (a, b) in last3.iter().zip(expected.iter()) {
            assert_eq!(format!("{a:?}"), format!("{b:?}"));
        }
    }

    // 17. load_rule_set twice increments version counter.
    #[test]
    fn test_load_twice_version_increments() {
        let mut mgr = RuleHotReloadManager::new();
        let v1 = mgr.load_rule_set(vec!["r1".to_string()], 100);
        mgr.commit();
        let v2 = mgr.load_rule_set(vec!["r2".to_string()], 200);
        assert_eq!(v2, v1 + 1, "second load should get next version");
    }

    // Bonus: VersionedRuleSet::contains and rule_count.
    #[test]
    fn test_versioned_ruleset_contains_and_rule_count() {
        let vrs = VersionedRuleSet {
            version: 1,
            rules: vec!["alpha".to_string(), "beta".to_string()],
            loaded_at_secs: 0,
            checksum: 0,
        };
        assert_eq!(vrs.rule_count(), 2);
        assert!(vrs.contains("alpha"));
        assert!(!vrs.contains("gamma"));
    }

    // Bonus: sessions_on_old_version when current is None returns all sessions.
    #[test]
    fn test_sessions_on_old_version_when_no_current_returns_all() {
        let mut mgr = RuleHotReloadManager::new();
        mgr.register_session("s1".to_string(), 1, 0, true);
        mgr.register_session("s2".to_string(), 2, 0, false);
        let old = mgr.sessions_on_old_version();
        assert_eq!(old.len(), 2);
    }
}