greynet 0.11.0

High performance rule and constraint satisfaction engine
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

//! Fixed node_sharing.rs with proper trait bounds

use crate::arena::NodeId;
use crate::stream_def::RetrievalId;
use crate::score::Score;
use std::collections::HashMap;
use std::marker::PhantomData;

#[derive(Debug)]
pub struct NodeSharingManager<S: Score> {
    nodes: HashMap<RetrievalId<S>, NodeId>,
    _phantom: PhantomData<S>,
}

impl<S: Score> NodeSharingManager<S> {
    pub fn new() -> Self {
        Self {
            nodes: HashMap::new(),
            _phantom: PhantomData,
        }
    }

    pub fn get_node(&self, retrieval_id: &RetrievalId<S>) -> Option<NodeId> {
        self.nodes.get(retrieval_id).copied()
    }

    pub fn register_node(&mut self, retrieval_id: RetrievalId<S>, node_id: NodeId) -> Result<(), String> {
        if self.nodes.contains_key(&retrieval_id) {
            Err("Node already registered for this retrieval ID".to_string())
        } else {
            self.nodes.insert(retrieval_id, node_id);
            Ok(())
        }
    }
    
    /// Check if a retrieval ID is already registered
    pub fn contains(&self, retrieval_id: &RetrievalId<S>) -> bool {
        self.nodes.contains_key(retrieval_id)
    }
    
    /// Get the number of registered nodes
    pub fn len(&self) -> usize {
        self.nodes.len()
    }
    
    /// Check if the manager is empty
    pub fn is_empty(&self) -> bool {
        self.nodes.is_empty()
    }
    
    /// Clear all registered nodes
    pub fn clear(&mut self) {
        self.nodes.clear();
    }
    
    /// Get all registered retrieval IDs
    pub fn retrieval_ids(&self) -> impl Iterator<Item = &RetrievalId<S>> {
        self.nodes.keys()
    }
    
    /// Get all registered node IDs
    pub fn node_ids(&self) -> impl Iterator<Item = &NodeId> {
        self.nodes.values()
    }
}

impl<S: Score> Default for NodeSharingManager<S> {
    fn default() -> Self {
        Self::new()
    }
}