selen 0.15.5

Constraint Satisfaction Problem (CSP) solver
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

use selen::prelude::*;

fn main() {
    let mut model = Model::new();
    
    println!("🧹 Cleaned up constraint macros - using only clean syntax!");
    
    // Test variables
    let a = m.int(0, 1);
    let b = m.int(0, 1);
    let c = m.int(0, 1);
    let x = m.int(1, 10);
    let y = m.int(1, 10);
    let fx = m.float(1.0, 10.0);
    
    println!("\n✅ CLEAN LOGICAL OPERATORS:");
    println!("   and(a, b) instead of bool_and(a, b)");
    post!(m, and(a, b) == c);
    
    println!("   or(a, b) instead of bool_or(a, b)");  
    post!(m, or(a, b) == c);
    
    println!("   not(a) instead of bool_not(a)");
    post!(m, not(a) == b);
    
    println!("\n✅ OTHER CLEAN FEATURES WE KEPT:");
    println!("   sum() function");
    post!(m, sum([x, y]) <= int(15));
    
    println!("   Float constants with math functions");
    post!(m, abs(fx) <= float(5.5));
    post!(m, min(fx, float(3.0)) >= float(1.0));
    
    println!("   Enhanced modulo operations");
    post!(m, x % y <= int(5));
    
    println!("   Complex nested expressions");
    post!(m, sum([x, y]) + abs(fx) >= float(10.0));
    post!(m, and(a, or(b, c)) == not(c));
    
    println!("\n🎉 RESULT: Clean, consistent constraint macro syntax!");
    println!("   - Removed redundant bool_* functions");
    println!("   - Using traditional and(), or(), not() operators");
    println!("   - Kept all powerful functionality");
    println!("   - Much cleaner and more readable!");
}