datalogic-rs 4.0.21

A fast, type-safe Rust implementation of JSONLogic for evaluating logical rules as JSON. Perfect for business rules engines and dynamic filtering in Rust applications.
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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
use regex::Regex;
use serde_json::{Value, json};

use super::helpers::to_string_cow;
use super::variable;
use crate::constants::INVALID_ARGS;
use crate::node::{MetadataHint, ReduceHint};
use crate::{CompiledNode, ContextStack, DataLogic, Result, error::Error};

/// String concatenation operator function (cat) - variadic
#[inline]
pub fn evaluate_cat(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    let mut result = String::with_capacity(args.len() * 16);

    for arg in args {
        let value = engine.evaluate_node_cow(arg, context)?;
        // If the value is an array, concatenate its elements
        if let Value::Array(arr) = value.as_ref() {
            for item in arr {
                result.push_str(&to_string_cow(item));
            }
        } else {
            result.push_str(&to_string_cow(value.as_ref()));
        }
    }

    Ok(Value::String(result))
}

/// Substring operator function (substr)
#[inline]
pub fn evaluate_substr(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.is_empty() {
        return Ok(Value::String(String::new()));
    }

    let string_val = engine.evaluate_node(&args[0], context)?;
    let string: std::borrow::Cow<str> = match &string_val {
        Value::String(s) => std::borrow::Cow::Borrowed(s.as_str()),
        _ => std::borrow::Cow::Owned(string_val.to_string()),
    };

    // Get character count for proper bounds checking
    let char_count = string.chars().count();

    // Fast path: read literal integer args directly without evaluate_node dispatch
    let start = if args.len() > 1 {
        if let CompiledNode::Value { value } = &args[1] {
            value.as_i64().unwrap_or(0)
        } else {
            let start_val = engine.evaluate_node(&args[1], context)?;
            start_val.as_i64().unwrap_or(0)
        }
    } else {
        0
    };

    let length = if args.len() > 2 {
        if let CompiledNode::Value { value } = &args[2] {
            value.as_i64()
        } else {
            let length_val = engine.evaluate_node(&args[2], context)?;
            length_val.as_i64()
        }
    } else {
        None
    };

    // Safe bounds checking with overflow protection
    let actual_start = if start < 0 {
        // Safely handle negative indices
        let abs_start = start.saturating_abs() as usize;
        char_count.saturating_sub(abs_start)
    } else {
        // Safely handle positive indices
        (start as usize).min(char_count)
    };

    let result = if let Some(len) = length {
        if len < 0 {
            // Special case: negative length means use it as end position (like slice)
            // This mimics JSONLogic's behavior which differs from JavaScript's substr
            let end_pos = if len < 0 {
                // Negative end position counts from end of string
                let abs_end = len.saturating_abs() as usize;
                char_count.saturating_sub(abs_end)
            } else {
                0
            };

            // Take characters from actual_start to end_pos
            if end_pos > actual_start {
                string
                    .chars()
                    .skip(actual_start)
                    .take(end_pos - actual_start)
                    .collect()
            } else {
                String::new()
            }
        } else if len == 0 {
            // Zero length returns empty string
            String::new()
        } else {
            // Positive length - take from start position
            let take_count = (len as usize).min(char_count.saturating_sub(actual_start));
            string.chars().skip(actual_start).take(take_count).collect()
        }
    } else {
        // No length specified - take rest of string
        string.chars().skip(actual_start).collect()
    };

    Ok(Value::String(result))
}

/// In operator function - checks if a value is in a string or array
#[inline]
pub fn evaluate_in(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.len() < 2 {
        return Ok(Value::Bool(false));
    }

    let needle = engine.evaluate_node_cow(&args[0], context)?;
    let haystack = engine.evaluate_node_cow(&args[1], context)?;

    let result = match haystack.as_ref() {
        Value::String(s) => match needle.as_ref() {
            Value::String(n) => s.contains(n.as_str()),
            _ => false,
        },
        Value::Array(arr) => arr.iter().any(|v| v == needle.as_ref()),
        _ => false,
    };

    Ok(Value::Bool(result))
}

/// Length operator function - returns the length of a string or array
#[inline]
pub fn evaluate_length(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.is_empty() || args.len() > 1 {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    // Fast path: CompiledVar with scope_level 0 — navigate directly, skip clone
    if let CompiledNode::CompiledVar {
        scope_level: 0,
        segments,
        reduce_hint: ReduceHint::None,
        metadata_hint: MetadataHint::None,
        ..
    } = &args[0]
    {
        if let Some(val) = variable::try_traverse_segments(context.current().data(), segments) {
            return match val {
                Value::String(s) => Ok(Value::Number(serde_json::Number::from(
                    s.chars().count() as i64
                ))),
                Value::Array(arr) => Ok(Value::Number(serde_json::Number::from(arr.len() as i64))),
                _ => Err(Error::InvalidArguments(INVALID_ARGS.into())),
            };
        }
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    // Use cow to avoid cloning strings/arrays just to get their length
    let value = engine.evaluate_node_cow(&args[0], context)?;

    match value.as_ref() {
        Value::String(s) => {
            let char_count = s.chars().count();
            if char_count > i64::MAX as usize {
                return Err(Error::InvalidArguments("String too long".to_string()));
            }
            Ok(Value::Number(serde_json::Number::from(char_count as i64)))
        }
        Value::Array(arr) => {
            if arr.len() > i64::MAX as usize {
                return Err(Error::InvalidArguments("Array too long".to_string()));
            }
            Ok(Value::Number(serde_json::Number::from(arr.len() as i64)))
        }
        Value::Null | Value::Number(_) | Value::Bool(_) | Value::Object(_) => {
            Err(Error::InvalidArguments(INVALID_ARGS.into()))
        }
    }
}

/// StartsWithOperator function - checks if a string starts with a prefix
#[inline]
pub fn evaluate_starts_with(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.len() < 2 {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    let text = engine.evaluate_node(&args[0], context)?;
    let text_str = text.as_str().unwrap_or("");

    // Fast path: pattern is a literal string (most common case) — avoid clone
    if let CompiledNode::Value {
        value: Value::String(p),
        ..
    } = &args[1]
    {
        return Ok(Value::Bool(text_str.starts_with(p.as_str())));
    }

    let pattern = engine.evaluate_node(&args[1], context)?;
    let pattern_str = pattern.as_str().unwrap_or("");
    Ok(Value::Bool(text_str.starts_with(pattern_str)))
}

/// EndsWithOperator function - checks if a string ends with a suffix
#[inline]
pub fn evaluate_ends_with(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.len() < 2 {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    let text = engine.evaluate_node(&args[0], context)?;
    let text_str = text.as_str().unwrap_or("");

    // Fast path: pattern is a literal string (most common case) — avoid clone
    if let CompiledNode::Value {
        value: Value::String(p),
        ..
    } = &args[1]
    {
        return Ok(Value::Bool(text_str.ends_with(p.as_str())));
    }

    let pattern = engine.evaluate_node(&args[1], context)?;
    let pattern_str = pattern.as_str().unwrap_or("");
    Ok(Value::Bool(text_str.ends_with(pattern_str)))
}

/// UpperOperator function - converts a string to uppercase
#[inline]
pub fn evaluate_upper(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.is_empty() {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    let value = engine.evaluate_node(&args[0], context)?;
    // Fast path: if ASCII and already uppercase, return original value (no allocation)
    let already_upper = value
        .as_str()
        .is_some_and(|s| s.is_ascii() && !s.bytes().any(|b| b.is_ascii_lowercase()));
    if already_upper {
        return Ok(value);
    }
    let text = value.as_str().unwrap_or("");
    Ok(Value::String(text.to_uppercase()))
}

/// LowerOperator function - converts a string to lowercase
#[inline]
pub fn evaluate_lower(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.is_empty() {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    let value = engine.evaluate_node(&args[0], context)?;
    // Fast path: if ASCII and already lowercase, return original value (no allocation)
    let already_lower = value
        .as_str()
        .is_some_and(|s| s.is_ascii() && !s.bytes().any(|b| b.is_ascii_uppercase()));
    if already_lower {
        return Ok(value);
    }
    let text = value.as_str().unwrap_or("");
    Ok(Value::String(text.to_lowercase()))
}

/// TrimOperator function - removes leading and trailing whitespace from a string
#[inline]
pub fn evaluate_trim(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.is_empty() {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    let value = engine.evaluate_node(&args[0], context)?;
    // Fast path: check if trimming is needed before allocating
    let needs_trim = value.as_str().is_some_and(|s| {
        !s.is_empty() && {
            // chars().next() and next_back() are O(1) for valid UTF-8
            s.starts_with(|c: char| c.is_whitespace()) || s.ends_with(|c: char| c.is_whitespace())
        }
    });
    if !needs_trim {
        return match &value {
            Value::String(_) => Ok(value),
            _ => Ok(Value::String(String::new())),
        };
    }
    let text = value.as_str().unwrap_or("");
    Ok(Value::String(text.trim().to_string()))
}

/// SplitOperator function - splits a string by delimiter or extracts regex groups
#[inline]
pub fn evaluate_split(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
) -> Result<Value> {
    if args.len() < 2 {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    let text = engine.evaluate_node(&args[0], context)?;
    let text_str = text.as_str().unwrap_or("");

    // Fast path: delimiter is a literal string — skip regex check entirely.
    // Valid regex patterns are already handled at compile-time via CompiledSplitRegex,
    // so any remaining literal delimiter is guaranteed to be a plain string split.
    if let CompiledNode::Value {
        value: Value::String(delim),
        ..
    } = &args[1]
    {
        return split_normal(text_str, delim.as_str());
    }

    let delimiter = engine.evaluate_node(&args[1], context)?;
    let delimiter_str = delimiter.as_str().unwrap_or("");

    // Check if delimiter is a regex pattern with named groups (dynamic delimiter case)
    if delimiter_str.contains("(?P<") {
        // Try to parse as regex
        match Regex::new(delimiter_str) {
            Ok(re) => {
                // Check if regex has named groups
                let capture_names: Vec<_> = re.capture_names().flatten().collect();

                if !capture_names.is_empty() {
                    // Extract named groups
                    if let Some(captures) = re.captures(text_str) {
                        let mut result = serde_json::Map::new();

                        for name in capture_names {
                            if let Some(m) = captures.name(name) {
                                result.insert(
                                    name.to_string(),
                                    Value::String(m.as_str().to_string()),
                                );
                            }
                        }

                        return Ok(Value::Object(result));
                    } else {
                        // No match, return empty object
                        return Ok(Value::Object(serde_json::Map::new()));
                    }
                }
            }
            Err(_) => {
                // Invalid regex, fall back to normal split
            }
        }
    }

    // Normal string split
    split_normal(text_str, delimiter_str)
}

/// Split with a pre-compiled regex (used when regex is known at compile time)
#[inline]
pub fn evaluate_split_with_regex(
    args: &[CompiledNode],
    context: &mut ContextStack,
    engine: &DataLogic,
    regex: &Regex,
    capture_names: &[Box<str>],
) -> Result<Value> {
    if args.is_empty() {
        return Err(Error::InvalidArguments(INVALID_ARGS.into()));
    }

    let text = engine.evaluate_node(&args[0], context)?;
    let text_str = text.as_str().unwrap_or("");

    if let Some(captures) = regex.captures(text_str) {
        let mut result = serde_json::Map::new();
        for name in capture_names {
            if let Some(m) = captures.name(name) {
                result.insert(name.to_string(), Value::String(m.as_str().to_string()));
            }
        }
        Ok(Value::Object(result))
    } else {
        Ok(Value::Object(serde_json::Map::new()))
    }
}

#[inline]
fn split_normal(text_str: &str, delimiter_str: &str) -> Result<Value> {
    if text_str.is_empty() {
        Ok(json!([""]))
    } else if delimiter_str.is_empty() {
        let chars: Vec<Value> = text_str
            .chars()
            .map(|c| Value::String(c.to_string()))
            .collect();
        Ok(Value::Array(chars))
    } else {
        let parts: Vec<Value> = text_str
            .split(delimiter_str)
            .map(|s| Value::String(s.to_string()))
            .collect();
        Ok(Value::Array(parts))
    }
}