rust_rule_engine/rete/
grl_loader.rs

1//! GRL to RETE Converter
2//!
3//! This module converts GRL (Grule Rule Language) rules into RETE-UL structures
4//! for efficient pattern matching and rule execution.
5
6use crate::engine::rule::{Condition, ConditionGroup, Rule};
7use crate::parser::GRLParser;
8use crate::rete::{AlphaNode, ReteUlNode, TypedReteUlRule};
9use crate::rete::facts::{TypedFacts, FactValue};
10use crate::rete::propagation::IncrementalEngine;
11use crate::types::{Operator, Value};
12use crate::errors::{Result, RuleEngineError};
13use std::fs;
14use std::path::Path;
15
16/// GRL to RETE Loader
17/// Converts GRL rules into RETE-UL structures
18pub struct GrlReteLoader;
19
20impl GrlReteLoader {
21    /// Load rules from a GRL file into RETE engine
22    pub fn load_from_file<P: AsRef<Path>>(
23        path: P,
24        engine: &mut IncrementalEngine,
25    ) -> Result<usize> {
26        let grl_text = fs::read_to_string(path.as_ref()).map_err(|e| {
27            RuleEngineError::ParseError {
28                message: format!("Failed to read GRL file: {}", e),
29            }
30        })?;
31
32        Self::load_from_string(&grl_text, engine)
33    }
34
35    /// Load rules from GRL string into RETE engine
36    pub fn load_from_string(
37        grl_text: &str,
38        engine: &mut IncrementalEngine,
39    ) -> Result<usize> {
40        // Parse GRL rules
41        let rules = GRLParser::parse_rules(grl_text)?;
42
43        let mut loaded_count = 0;
44
45        for rule in rules {
46            // Convert GRL rule to RETE rule
47            let rete_rule = Self::convert_rule_to_rete(rule)?;
48
49            // Extract dependencies (fact types used in conditions)
50            let dependencies = Self::extract_dependencies(&rete_rule);
51
52            // Add to engine
53            engine.add_rule(rete_rule, dependencies);
54            loaded_count += 1;
55        }
56
57        Ok(loaded_count)
58    }
59
60    /// Convert GRL Rule to TypedReteUlRule
61    fn convert_rule_to_rete(rule: Rule) -> Result<TypedReteUlRule> {
62        // Convert ConditionGroup to ReteUlNode
63        let node = Self::convert_condition_group(&rule.conditions)?;
64
65        // Create RETE rule
66        let rete_rule = TypedReteUlRule {
67            name: rule.name.clone(),
68            node,
69            priority: rule.salience,
70            no_loop: rule.no_loop,
71            action: Self::create_action_closure(rule.actions),
72        };
73
74        Ok(rete_rule)
75    }
76
77    /// Convert ConditionGroup to ReteUlNode
78    fn convert_condition_group(group: &ConditionGroup) -> Result<ReteUlNode> {
79        match group {
80            ConditionGroup::Single(condition) => {
81                Self::convert_condition(condition)
82            }
83            ConditionGroup::Compound { left, operator, right } => {
84                let left_node = Self::convert_condition_group(left)?;
85                let right_node = Self::convert_condition_group(right)?;
86
87                match operator {
88                    crate::types::LogicalOperator::And => {
89                        Ok(ReteUlNode::UlAnd(Box::new(left_node), Box::new(right_node)))
90                    }
91                    crate::types::LogicalOperator::Or => {
92                        Ok(ReteUlNode::UlOr(Box::new(left_node), Box::new(right_node)))
93                    }
94                    crate::types::LogicalOperator::Not => {
95                        // For NOT, we only use left node
96                        Ok(ReteUlNode::UlNot(Box::new(left_node)))
97                    }
98                }
99            }
100            ConditionGroup::Not(inner) => {
101                let inner_node = Self::convert_condition_group(inner)?;
102                Ok(ReteUlNode::UlNot(Box::new(inner_node)))
103            }
104            ConditionGroup::Exists(inner) => {
105                let inner_node = Self::convert_condition_group(inner)?;
106                Ok(ReteUlNode::UlExists(Box::new(inner_node)))
107            }
108            ConditionGroup::Forall(inner) => {
109                let inner_node = Self::convert_condition_group(inner)?;
110                Ok(ReteUlNode::UlForall(Box::new(inner_node)))
111            }
112            ConditionGroup::Accumulate {
113                result_var,
114                source_pattern,
115                extract_field,
116                source_conditions,
117                function,
118                function_arg,
119            } => {
120                Ok(ReteUlNode::UlAccumulate {
121                    result_var: result_var.clone(),
122                    source_pattern: source_pattern.clone(),
123                    extract_field: extract_field.clone(),
124                    source_conditions: source_conditions.clone(),
125                    function: function.clone(),
126                    function_arg: function_arg.clone(),
127                })
128            }
129        }
130    }
131
132    /// Convert single Condition to ReteUlNode (AlphaNode or UlMultiField)
133    fn convert_condition(condition: &Condition) -> Result<ReteUlNode> {
134        use crate::engine::rule::ConditionExpression;
135
136        // Check if this is a multifield condition
137        match &condition.expression {
138            ConditionExpression::MultiField { field, operation, variable } => {
139                // Convert to UlMultiField node
140                let operator_str = Self::operator_to_string(&condition.operator);
141                let value_str = if !matches!(condition.value, Value::Boolean(_)) {
142                    Some(Self::value_to_string(&condition.value))
143                } else {
144                    None
145                };
146
147                // Determine if this is a count operation with comparison
148                let (op, cmp_val) = if operation == "count" && operator_str != "==" {
149                    // Count with comparison: "count > 5"
150                    (Some(operator_str), value_str)
151                } else {
152                    // Other operations
153                    (None, value_str)
154                };
155
156                Ok(ReteUlNode::UlMultiField {
157                    field: field.clone(),
158                    operation: operation.clone(),
159                    value: if operation == "contains" { cmp_val.clone() } else { None },
160                    operator: op,
161                    compare_value: if operation == "count" { cmp_val } else { None },
162                })
163            }
164            _ => {
165                // Standard alpha node for regular conditions
166                let operator_str = Self::operator_to_string(&condition.operator);
167                let value_str = Self::value_to_string(&condition.value);
168
169                let alpha = AlphaNode {
170                    field: condition.field.clone(),
171                    operator: operator_str,
172                    value: value_str,
173                };
174
175                Ok(ReteUlNode::UlAlpha(alpha))
176            }
177        }
178    }
179
180    /// Convert Operator to string
181    fn operator_to_string(op: &Operator) -> String {
182        match op {
183            Operator::Equal => "==".to_string(),
184            Operator::NotEqual => "!=".to_string(),
185            Operator::GreaterThan => ">".to_string(),
186            Operator::GreaterThanOrEqual => ">=".to_string(),
187            Operator::LessThan => "<".to_string(),
188            Operator::LessThanOrEqual => "<=".to_string(),
189            Operator::Contains => "contains".to_string(),
190            Operator::NotContains => "!contains".to_string(),
191            Operator::StartsWith => "startsWith".to_string(),
192            Operator::EndsWith => "endsWith".to_string(),
193            Operator::Matches => "matches".to_string(),
194        }
195    }
196
197    /// Convert Value to string for AlphaNode
198    fn value_to_string(value: &Value) -> String {
199        match value {
200            Value::Number(n) => n.to_string(),
201            Value::Integer(i) => i.to_string(),
202            Value::String(s) => s.clone(),
203            Value::Boolean(b) => b.to_string(),
204            Value::Null => "null".to_string(),
205            Value::Array(arr) => {
206                // Convert array to JSON-like string
207                let items: Vec<String> = arr.iter()
208                    .map(|v| Self::value_to_string(v))
209                    .collect();
210                format!("[{}]", items.join(","))
211            }
212            Value::Object(_) => {
213                // For objects, we'll use a simplified representation
214                "object".to_string()
215            }
216            Value::Expression(expr) => {
217                // For expressions, return the expression string
218                expr.clone()
219            }
220        }
221    }
222
223    /// Create action closure from ActionType list
224    fn create_action_closure(
225        actions: Vec<crate::types::ActionType>,
226    ) -> std::sync::Arc<dyn Fn(&mut TypedFacts, &mut super::ActionResults) + Send + Sync> {
227        std::sync::Arc::new(move |facts: &mut TypedFacts, results: &mut super::ActionResults| {
228            // Execute actions
229            for action in &actions {
230                Self::execute_action(action, facts, results);
231            }
232        })
233    }
234
235    /// Execute a single action
236    fn execute_action(
237        action: &crate::types::ActionType, 
238        facts: &mut TypedFacts,
239        results: &mut super::ActionResults,
240    ) {
241        use crate::types::ActionType;
242
243        match action {
244            ActionType::Set { field, value } => {
245                // Assignment action (from "field = value" syntax in GRL)
246                // Note: Set() function syntax is NOT supported.
247                // Use: Player.score = Player.score + 10;
248                
249                // Check if value is an expression that needs evaluation
250                let evaluated_value = match value {
251                    Value::Expression(expr) => {
252                        // Evaluate expression with current facts
253                        Self::evaluate_expression_for_rete(expr, facts)
254                    }
255                    _ => value.clone(),
256                };
257
258                // Convert evaluated value to FactValue
259                let fact_value = Self::value_to_fact_value(&evaluated_value);
260                facts.set(field, fact_value);
261            }
262            ActionType::Log { message } => {
263                println!("📝 LOG: {}", message);
264            }
265            ActionType::Call { function, args } => {
266                // Queue function call to be executed by engine
267                results.add(super::ActionResult::CallFunction {
268                    function_name: function.clone(),
269                    args: args.iter().map(|v| Self::value_to_string(v)).collect(),
270                });
271                println!("🔧 CALL: {}", function);
272            }
273            ActionType::MethodCall { object, method, args } => {
274                // Method calls can be treated as function calls with object as first arg
275                let mut all_args = vec![object.clone()];
276                all_args.extend(args.iter().map(|v| Self::value_to_string(v)));
277                
278                results.add(super::ActionResult::CallFunction {
279                    function_name: format!("{}.{}", object, method),
280                    args: all_args,
281                });
282                println!("� METHOD: {}.{}", object, method);
283            }
284            ActionType::Retract { object } => {
285                // Strip quotes from object name if present
286                let object_name = object.trim_matches('"');
287                
288                // Try to get the handle for this fact type from metadata
289                if let Some(handle) = facts.get_fact_handle(object_name) {
290                    // Retract specific fact by handle
291                    results.add(super::ActionResult::Retract(handle));
292                    println!("🗑️ RETRACT: {} (handle: {:?})", object_name, handle);
293                } else {
294                    // Fallback: retract by type (first matching fact)
295                    results.add(super::ActionResult::RetractByType(object_name.to_string()));
296                    println!("🗑️ RETRACT: {} (by type, no handle found)", object_name);
297                }
298            }
299            ActionType::Custom { .. } => {
300                // Custom actions ignored - not implemented in RETE-UL
301            }
302            ActionType::ActivateAgendaGroup { group } => {
303                // Queue agenda group activation
304                results.add(super::ActionResult::ActivateAgendaGroup(group.clone()));
305                println!("📋 ACTIVATE GROUP: {}", group);
306            }
307            ActionType::ScheduleRule { rule_name, delay_ms } => {
308                // Queue rule scheduling
309                results.add(super::ActionResult::ScheduleRule {
310                    rule_name: rule_name.clone(),
311                    delay_ms: *delay_ms,
312                });
313                println!("⏰ SCHEDULE: {} (delay: {}ms)", rule_name, delay_ms);
314            }
315            ActionType::CompleteWorkflow { workflow_name } => {
316                // Mark workflow as completed by setting a fact
317                let completion_key = format!("workflow.{}.completed", workflow_name);
318                facts.set(&completion_key, FactValue::Boolean(true));
319                
320                let timestamp_key = format!("workflow.{}.completed_at", workflow_name);
321                facts.set(&timestamp_key, FactValue::Integer(chrono::Utc::now().timestamp()));
322                
323                println!("✔️ WORKFLOW COMPLETED: {}", workflow_name);
324            }
325            ActionType::SetWorkflowData { key, value } => {
326                // Store workflow data as facts with "workflow.data." prefix
327                let data_key = format!("workflow.data.{}", key);
328                let fact_value = Self::value_to_fact_value(value);
329                facts.set(&data_key, fact_value);
330                
331                println!("📊 WORKFLOW DATA SET: {} = {:?}", key, value);
332            }
333        }
334    }
335
336    /// Convert Value to FactValue
337    fn value_to_fact_value(value: &Value) -> FactValue {
338        match value {
339            Value::Number(n) => {
340                // Try integer first, fall back to float
341                if n.fract() == 0.0 {
342                    FactValue::Integer(*n as i64)
343                } else {
344                    FactValue::Float(*n)
345                }
346            }
347            Value::Integer(i) => FactValue::Integer(*i),
348            Value::String(s) => FactValue::String(s.clone()),
349            Value::Boolean(b) => FactValue::Boolean(*b),
350            Value::Null => FactValue::Null,
351            Value::Array(arr) => {
352                let fact_arr: Vec<FactValue> = arr.iter()
353                    .map(Self::value_to_fact_value)
354                    .collect();
355                FactValue::Array(fact_arr)
356            }
357            Value::Object(_) => {
358                // For now, treat objects as strings
359                FactValue::String("object".to_string())
360            }
361            Value::Expression(expr) => {
362                // For expressions, store as string - will be evaluated at runtime
363                FactValue::String(format!("[EXPR: {}]", expr))
364            }
365        }
366    }
367
368    /// Extract fact type dependencies from rule
369    fn extract_dependencies(rule: &TypedReteUlRule) -> Vec<String> {
370        let mut deps = Vec::new();
371        Self::extract_deps_from_node(&rule.node, &mut deps);
372
373        // Deduplicate
374        deps.sort();
375        deps.dedup();
376
377        deps
378    }
379
380    /// Recursively extract dependencies from ReteUlNode
381    fn extract_deps_from_node(node: &ReteUlNode, deps: &mut Vec<String>) {
382        match node {
383            ReteUlNode::UlAlpha(alpha) => {
384                // Extract fact type from field (e.g., "Person.age" -> "Person")
385                if let Some(dot_pos) = alpha.field.find('.') {
386                    let fact_type = alpha.field[..dot_pos].to_string();
387                    deps.push(fact_type);
388                }
389            }
390            ReteUlNode::UlMultiField { field, .. } => {
391                // Extract fact type from field (e.g., "Order.items" -> "Order")
392                if let Some(dot_pos) = field.find('.') {
393                    let fact_type = field[..dot_pos].to_string();
394                    deps.push(fact_type);
395                }
396            }
397            ReteUlNode::UlAnd(left, right) | ReteUlNode::UlOr(left, right) => {
398                Self::extract_deps_from_node(left, deps);
399                Self::extract_deps_from_node(right, deps);
400            }
401            ReteUlNode::UlNot(inner)
402            | ReteUlNode::UlExists(inner)
403            | ReteUlNode::UlForall(inner) => {
404                Self::extract_deps_from_node(inner, deps);
405            }
406            ReteUlNode::UlAccumulate { source_pattern, .. } => {
407                // Add source pattern as a dependency
408                deps.push(source_pattern.clone());
409            }
410            ReteUlNode::UlTerminal(_) => {
411                // Terminal nodes don't have dependencies
412            }
413        }
414    }
415
416    /// Evaluate expression for RETE engine (converts TypedFacts to Facts temporarily)
417    fn evaluate_expression_for_rete(expr: &str, typed_facts: &TypedFacts) -> Value {
418        // Convert TypedFacts to Facts for expression evaluation
419        use crate::engine::facts::Facts;
420
421        let mut facts = Facts::new();
422
423        // Copy all facts from TypedFacts to Facts
424        // RETE stores facts as "quantity" while GRL uses "Order.quantity"
425        // We need to support both formats
426        for (key, value) in typed_facts.get_all() {
427            let converted_value = Self::fact_value_to_value(value);
428
429            // Store both with and without prefix
430            // E.g., "quantity" -> both "quantity" and "Order.quantity"
431            facts.set(key, converted_value.clone());
432
433            // Also try to add with "Order." prefix if not already present
434            if !key.contains('.') {
435                facts.set(&format!("Order.{}", key), converted_value);
436            }
437        }
438
439        // Evaluate expression
440        match crate::expression::evaluate_expression(expr, &facts) {
441            Ok(result) => result,
442            Err(e) => {
443                // Silently fallback - this can happen with chained expressions in RETE
444                // due to working memory complexity
445                Value::String(expr.to_string())
446            }
447        }
448    }
449
450    /// Convert FactValue back to Value (reverse of value_to_fact_value)
451    fn fact_value_to_value(fact_value: &FactValue) -> Value {
452        match fact_value {
453            FactValue::String(s) => {
454                // Try to parse as number first
455                if let Ok(i) = s.parse::<i64>() {
456                    Value::Integer(i)
457                } else if let Ok(f) = s.parse::<f64>() {
458                    Value::Number(f)
459                } else if s == "true" {
460                    Value::Boolean(true)
461                } else if s == "false" {
462                    Value::Boolean(false)
463                } else {
464                    Value::String(s.clone())
465                }
466            }
467            FactValue::Integer(i) => Value::Integer(*i),
468            FactValue::Float(f) => Value::Number(*f),
469            FactValue::Boolean(b) => Value::Boolean(*b),
470            FactValue::Array(arr) => {
471                Value::Array(arr.iter().map(Self::fact_value_to_value).collect())
472            }
473            FactValue::Null => Value::Null,
474        }
475    }
476}
477
478#[cfg(test)]
479mod tests {
480    use super::*;
481
482    #[test]
483    fn test_convert_simple_rule() {
484        let grl = r#"
485        rule "TestRule" salience 10 no-loop {
486            when
487                Person.age > 18
488            then
489                Person.is_adult = true;
490        }
491        "#;
492
493        let rules = GRLParser::parse_rules(grl).unwrap();
494        assert_eq!(rules.len(), 1);
495
496        let rete_rule = GrlReteLoader::convert_rule_to_rete(rules[0].clone()).unwrap();
497        assert_eq!(rete_rule.name, "TestRule");
498        assert_eq!(rete_rule.priority, 10);
499        assert!(rete_rule.no_loop);
500    }
501
502    #[test]
503    fn test_extract_dependencies() {
504        let grl = r#"
505        rule "MultiTypeRule" {
506            when
507                Person.age > 18 && Order.amount > 1000
508            then
509                Person.premium = true;
510        }
511        "#;
512
513        let rules = GRLParser::parse_rules(grl).unwrap();
514        let rete_rule = GrlReteLoader::convert_rule_to_rete(rules[0].clone()).unwrap();
515        let deps = GrlReteLoader::extract_dependencies(&rete_rule);
516
517        assert_eq!(deps.len(), 2);
518        assert!(deps.contains(&"Person".to_string()));
519        assert!(deps.contains(&"Order".to_string()));
520    }
521
522    #[test]
523    fn test_load_from_string() {
524        let grl = r#"
525        rule "Rule1" {
526            when
527                Person.age > 18
528            then
529                Person.is_adult = true;
530        }
531
532        rule "Rule2" {
533            when
534                Order.amount > 1000
535            then
536                Order.high_value = true;
537        }
538        "#;
539
540        let mut engine = IncrementalEngine::new();
541        let count = GrlReteLoader::load_from_string(grl, &mut engine).unwrap();
542
543        assert_eq!(count, 2);
544    }
545}