reductstore 1.20.6

ReductStore is a time series database designed specifically for storing and managing large amounts of blob data.
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

// Copyright 2021-2026 ReductSoftware UG
// Licensed under the Apache License, Version 2.0

use crate::storage::query::condition::value::Value;
use crate::storage::query::condition::{Boxed, BoxedNode, Context, Node};
use reduct_base::error::ReductError;
use reduct_base::unprocessable_entity;

/// A node representing an `in` operation.
pub(crate) struct In {
    operands: Vec<BoxedNode>,
}

impl Node for In {
    fn apply(&mut self, context: &Context) -> Result<Value, ReductError> {
        let op_value = self.operands[0].apply(context)?;
        for item in self.operands[1..].iter_mut() {
            if item.apply(context)? == op_value {
                return Ok(Value::Bool(true));
            }
        }

        Ok(Value::Bool(false))
    }

    fn print(&self) -> String {
        format!(
            "In({:?}, [{:}])",
            self.operands[0],
            self.operands[1..]
                .iter()
                .map(|op| format!("{:?}", op))
                .reduce(|a, b| format!("{:?}, {:?}", a, b))
                .unwrap()
        )
    }
}

impl Boxed for In {
    fn boxed(operands: Vec<BoxedNode>) -> Result<BoxedNode, ReductError> {
        if operands.len() < 2 {
            return Err(unprocessable_entity!(
                "$in operator requires at least two operands"
            ));
        }
        Ok(Box::new(Self::new(operands)))
    }
}

impl In {
    pub fn new(operands: Vec<BoxedNode>) -> Self {
        Self { operands }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::storage::query::condition::constant::Constant;
    use crate::storage::query::condition::value::Value;
    use rstest::rstest;

    #[rstest]
    #[case(Value::Int(1), vec![Value::Int(0), Value::Int(1)], Value::Bool(true))]
    #[case(Value::Int(1), vec![Value::Int(0), Value::Int(2)], Value::Bool(false))]
    #[case(Value::Int(1), vec![Value::Int(0), Value::Int(2), Value::Float(1.0)], Value::Bool(true))]
    fn apply_ok(#[case] op: Value, #[case] list: Vec<Value>, #[case] expected: Value) {
        let mut operands: Vec<BoxedNode> = vec![Constant::boxed(op)];
        operands.extend(list.iter().map(|v| Constant::boxed(v.clone()) as BoxedNode));

        let mut op = In::new(operands);
        assert_eq!(op.apply(&Context::default()).unwrap(), expected);
    }

    #[rstest]
    fn apply_empty() {
        let op = In::boxed(vec![]);
        assert_eq!(
            op.err().unwrap(),
            unprocessable_entity!("$in operator requires at least two operands")
        );
    }

    #[rstest]
    fn print() {
        let op = In::boxed(vec![
            Constant::boxed(Value::Bool(true)),
            Constant::boxed(Value::Bool(false)),
        ])
        .unwrap();
        assert_eq!(op.print(), "In(Bool(true), [Bool(false)])");
    }
}