codd 0.1.0

codd is a minimal in-memory database with relational algebraic expressions as queries.
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

use crate::{
    expression::{Difference, Expression, Visitor},
    Error, Tuple,
};

/// Is a `crate::expression::Visitor` that validates if an expression can be turned into
/// a [`View`]. Currently, expressions containing `Difference` are not supported.
///
/// [`View`]: ../../struct.View.html
/// [`Difference`]: ../../struct.Difference.html
pub(crate) struct ViewExpressionValidator(Option<Error>);

impl ViewExpressionValidator {
    pub fn new() -> Self {
        Self(None)
    }

    #[inline]
    pub fn into_error(self) -> Option<Error> {
        self.0
    }
}

impl Visitor for ViewExpressionValidator {
    fn visit_difference<T, L, R>(&mut self, _: &Difference<T, L, R>)
    where
        T: Tuple,
        L: Expression<T>,
        R: Expression<T>,
    {
        self.0 = Some(Error::UnsupportedExpression {
            name: "Difference".to_string(),
            operation: "Create View".to_string(),
        })
    }
}

/// Validates `expression` and returns an error if it cannot be turned into a [`View`].
pub(super) fn validate_view_expression<T, E>(expression: &E) -> Result<(), Error>
where
    T: Tuple,
    E: Expression<T>,
{
    let mut validator = ViewExpressionValidator::new();
    expression.visit(&mut validator);
    if let Some(e) = validator.into_error() {
        Err(e)
    } else {
        Ok(())
    }
}