polydat 0.2.0

Polydat — a variates construction 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
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225

// Copyright 2024-2026 Jonathan Shook
// SPDX-License-Identifier: Apache-2.0

//! Bitwise and two-wire integer arithmetic nodes.
//!
//! These nodes operate on pairs of u64 wire inputs (no constants).
//! They complement the existing const-param arithmetic nodes (`add`,
//! `mul`, `div`, `mod`) which take one wire and one constant.
//!
//! All nodes support P2 (compiled_u64) and P3 (JIT) execution.

// SRD-80 PR B.7: imports of `CompiledU64Op` / `NodeMeta` / `Port` /
// `Slot` / `Value` / `PolydatNode` are now generated by the
// proc-macro inside `const _: () = { ... }` scopes; the
// library file's top-level use list shrinks accordingly.

// SRD-80 PR B.7 — `binary_u64_node!` declarative macro retired.
// `#[polydat_node]` auto-emits identical Phase 2 closure +
// jit_constants from the typed function signature. Phase 3
// classifier dispatch by name is unaffected. Struct names
// follow the macro's snake_case → PascalCase rule
// (`u64_add` → `U64Add`, no more `2` suffix).

#[crate::polydat_node(category = Arithmetic)]
fn u64_add(a: u64, b: u64) -> u64 { a.wrapping_add(b) }

#[crate::polydat_node(category = Arithmetic)]
fn u64_sub(a: u64, b: u64) -> u64 { a.wrapping_sub(b) }

#[crate::polydat_node(category = Arithmetic)]
fn u64_mul(a: u64, b: u64) -> u64 { a.wrapping_mul(b) }

#[crate::polydat_node(category = Arithmetic)]
fn u64_div(a: u64, b: u64) -> u64 { if b != 0 { a / b } else { 0 } }

#[crate::polydat_node(category = Arithmetic)]
fn u64_mod(a: u64, b: u64) -> u64 { if b != 0 { a % b } else { 0 } }

#[crate::polydat_node(category = Arithmetic)]
fn u64_and(a: u64, b: u64) -> u64 { a & b }

#[crate::polydat_node(category = Arithmetic)]
fn u64_or(a: u64, b: u64) -> u64 { a | b }

#[crate::polydat_node(category = Arithmetic)]
fn u64_xor(a: u64, b: u64) -> u64 { a ^ b }

#[crate::polydat_node(category = Arithmetic)]
fn u64_shl(a: u64, b: u64) -> u64 { a.wrapping_shl(b as u32) }

#[crate::polydat_node(category = Arithmetic)]
fn u64_shr(a: u64, b: u64) -> u64 { a.wrapping_shr(b as u32) }

#[crate::polydat_node(category = Arithmetic)]
fn u64_not(input: u64) -> u64 { !input }

#[crate::polydat_node(category = Arithmetic)]
fn checked_add(a: u64, b: u64) -> u64 { a.checked_add(b).unwrap_or(0) }

#[crate::polydat_node(category = Arithmetic)]
fn checked_sub(a: u64, b: u64) -> u64 { a.saturating_sub(b) }

#[crate::polydat_node(category = Arithmetic)]
fn checked_mul(a: u64, b: u64) -> u64 { a.checked_mul(b).unwrap_or(0) }

// ---------------------------------------------------------------------------
// Signature declarations for the DSL registry
// ---------------------------------------------------------------------------

// SRD-80 PR B.7 — every node in this module is registered
// link-time via the proc-macro-emitted NodeRegistration; the
// hand-maintained signatures()/build_node() and the
// `register_nodes!` call below it have been retired.

#[cfg(any())]  // dead-code preserved verbatim for diff readability; never compiled

#[cfg(test)]
mod tests {
    use super::*;
    use crate::ast::{PolydatNode, Value};

    #[test]
    fn checked_add_normal() {
        let node = CheckedAdd::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(100), Value::U64(42)], &mut out);
        assert_eq!(out[0].as_u64(), 142);
    }

    #[test]
    fn checked_add_overflow_returns_zero() {
        let node = CheckedAdd::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(u64::MAX), Value::U64(1)], &mut out);
        assert_eq!(out[0].as_u64(), 0);
    }

    #[test]
    fn checked_sub_normal() {
        let node = CheckedSub::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(42), Value::U64(10)], &mut out);
        assert_eq!(out[0].as_u64(), 32);
    }

    #[test]
    fn checked_sub_underflow_returns_zero() {
        let node = CheckedSub::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(0), Value::U64(1)], &mut out);
        assert_eq!(out[0].as_u64(), 0);
    }

    #[test]
    fn checked_mul_normal() {
        let node = CheckedMul::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(7), Value::U64(6)], &mut out);
        assert_eq!(out[0].as_u64(), 42);
    }

    #[test]
    fn checked_mul_overflow_returns_zero() {
        let node = CheckedMul::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(u64::MAX), Value::U64(2)], &mut out);
        assert_eq!(out[0].as_u64(), 0);
    }

    #[test]
    fn u64_and_basic() {
        let node = U64And::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(0xFF00), Value::U64(0x0FF0)], &mut out);
        assert_eq!(out[0].as_u64(), 0x0F00);
    }

    #[test]
    fn u64_or_basic() {
        let node = U64Or::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(0xF0), Value::U64(0x0F)], &mut out);
        assert_eq!(out[0].as_u64(), 0xFF);
    }

    #[test]
    fn u64_xor_basic() {
        let node = U64Xor::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(0xFF), Value::U64(0x0F)], &mut out);
        assert_eq!(out[0].as_u64(), 0xF0);
    }

    #[test]
    fn u64_shl_basic() {
        let node = U64Shl::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(1), Value::U64(8)], &mut out);
        assert_eq!(out[0].as_u64(), 256);
    }

    #[test]
    fn u64_shr_basic() {
        let node = U64Shr::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(256), Value::U64(4)], &mut out);
        assert_eq!(out[0].as_u64(), 16);
    }

    #[test]
    fn u64_not_basic() {
        let node = U64Not::new();
        let mut out = [Value::None];
        node.eval(&[Value::U64(0)], &mut out);
        assert_eq!(out[0].as_u64(), u64::MAX);
    }

    #[test]
    fn u64_add2_wrapping() {
        let node = U64Add::default();
        let mut out = [Value::None];
        node.eval(&[Value::U64(u64::MAX), Value::U64(1)], &mut out);
        assert_eq!(out[0].as_u64(), 0);
    }

    #[test]
    fn u64_div2_zero_divisor() {
        let node = U64Div::default();
        let mut out = [Value::None];
        node.eval(&[Value::U64(42), Value::U64(0)], &mut out);
        assert_eq!(out[0].as_u64(), 0);
    }

    #[test]
    fn u64_sub2_wrapping() {
        let node = U64Sub::default();
        let mut out = [Value::None];
        node.eval(&[Value::U64(0), Value::U64(1)], &mut out);
        assert_eq!(out[0].as_u64(), u64::MAX);
    }

    #[test]
    fn u64_mul2_basic() {
        let node = U64Mul::default();
        let mut out = [Value::None];
        node.eval(&[Value::U64(7), Value::U64(6)], &mut out);
        assert_eq!(out[0].as_u64(), 42);
    }

    #[test]
    fn u64_mod2_basic() {
        let node = U64Mod::default();
        let mut out = [Value::None];
        node.eval(&[Value::U64(42), Value::U64(10)], &mut out);
        assert_eq!(out[0].as_u64(), 2);
    }

    #[test]
    fn u64_mod2_zero_divisor() {
        let node = U64Mod::default();
        let mut out = [Value::None];
        node.eval(&[Value::U64(42), Value::U64(0)], &mut out);
        assert_eq!(out[0].as_u64(), 0);
    }
}