Struct RateLimiter 

pub struct RateLimiter {
    pairs: HashMap<(String, String, String, String), u64>,
    windows: HashMap<String, Window>,
    checked: HashMap<(String, String), u64>,
}

Remembers what each agent has been told, so notes stay rare: one per (agent, other agent, repository, path) per PAIR_QUIET_MS, at most WINDOW_NOTES per agent per WINDOW_MS, then one summary and quiet until that window ends. Agents are keyed by name, case-insensitively.

Fields

pairs: HashMap<(String, String, String, String), u64>

windows: HashMap<String, Window>

checked: HashMap<(String, String), u64>

Implementations

impl RateLimiter

fn prune(&mut self, now_ms: u64)

pub fn should_check(&mut self, block: &str, path: &str, now_ms: u64) -> bool

Whether block’s edit of path should be checked now: once per RECHECK_MS per (block, file), so an agent editing one file over and over costs one check.

pub fn decide( &mut self, me: &str, file: &EditedFile, overlaps: &[Overlap], now_ms: u64, ) -> Option<Decision>

The note (if any) to deliver to me about overlaps on file, and the record that it was sent. Overlaps this pair was already told about are dropped first; with none left, nothing is sent.

Trait Implementations

impl Debug for RateLimiter

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RateLimiter

fn default() -> RateLimiter

Returns the “default value” for a type.