npcrs 0.1.10

Rust core for the NPC system — agent kernel, jinx executor, LLM client
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

use crate::process::Pid;
use chrono::{DateTime, Utc};
use std::collections::VecDeque;

#[derive(Debug)]
pub struct Scheduler {
    ready_queue: VecDeque<SchedulerEntry>,

    cron_table: Vec<CronEntry>,
}

#[derive(Debug, Clone)]
struct SchedulerEntry {
    pid: Pid,
    priority: Priority,
    enqueued_at: DateTime<Utc>,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
pub enum Priority {
    Low = 0,
    Normal = 1,
    High = 2,
    Realtime = 3,
}

#[derive(Debug, Clone)]
pub struct CronEntry {
    pub pid: Pid,
    pub schedule: CronSchedule,
    pub command: String,
    pub last_run: Option<DateTime<Utc>>,
    pub next_run: DateTime<Utc>,
    pub enabled: bool,
}

#[derive(Debug, Clone)]
pub enum CronSchedule {
    Interval(u64),
    Once(DateTime<Utc>),
}

impl Scheduler {
    pub fn new() -> Self {
        Self {
            ready_queue: VecDeque::new(),
            cron_table: Vec::new(),
        }
    }

    pub fn enqueue(&mut self, pid: Pid) {
        self.enqueue_with_priority(pid, Priority::Normal);
    }

    pub fn enqueue_with_priority(&mut self, pid: Pid, priority: Priority) {
        self.ready_queue.retain(|e| e.pid != pid);

        let entry = SchedulerEntry {
            pid,
            priority,
            enqueued_at: Utc::now(),
        };

        let pos = self
            .ready_queue
            .iter()
            .position(|e| e.priority < priority)
            .unwrap_or(self.ready_queue.len());

        self.ready_queue.insert(pos, entry);
    }

    pub fn next(&mut self) -> Option<Pid> {
        self.ready_queue.pop_front().map(|e| e.pid)
    }

    pub fn peek(&self) -> Option<Pid> {
        self.ready_queue.front().map(|e| e.pid)
    }

    pub fn queue_len(&self) -> usize {
        self.ready_queue.len()
    }

    pub fn add_cron(&mut self, pid: Pid, schedule: CronSchedule, command: String) {
        let next_run = match &schedule {
            CronSchedule::Interval(secs) => Utc::now() + chrono::Duration::seconds(*secs as i64),
            CronSchedule::Once(at) => *at,
        };

        self.cron_table.push(CronEntry {
            pid,
            schedule,
            command,
            last_run: None,
            next_run,
            enabled: true,
        });
    }

    pub fn check_cron(&mut self) -> Vec<(Pid, String)> {
        let now = Utc::now();
        let mut due = Vec::new();

        for entry in &mut self.cron_table {
            if !entry.enabled {
                continue;
            }
            if now >= entry.next_run {
                due.push((entry.pid, entry.command.clone()));
                entry.last_run = Some(now);

                match &entry.schedule {
                    CronSchedule::Interval(secs) => {
                        entry.next_run = now + chrono::Duration::seconds(*secs as i64);
                    }
                    CronSchedule::Once(_) => {
                        entry.enabled = false;
                    }
                }
            }
        }

        due
    }

    pub fn cron_entries(&self) -> &[CronEntry] {
        &self.cron_table
    }
}

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