reefdb 0.1.0

ReefDB is a minimalistic, in-memory and on-disk database management system written in Rust, implementing basic SQL query capabilities and full-text search.
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

use nom::{
    bytes::complete::{tag, take_while1},
    combinator::opt,
    sequence::tuple,
    IResult,
};
use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Serialize, Deserialize, PartialEq)]
pub struct ColumnValuePair {
    pub column_name: String,
    pub table_name: String,
}

impl ColumnValuePair {
    pub fn new(column_name: &str, table_name: &str) -> Self {
        Self {
            column_name: column_name.to_string(),
            table_name: table_name.to_string(),
        }
    }
}

fn identifier(input: &str) -> IResult<&str, &str> {
    take_while1(|c: char| c.is_alphanumeric() || c == '_')(input)
}

impl ColumnValuePair {
    pub fn parse(input: &str) -> IResult<&str, ColumnValuePair> {
        let (input, (table_part, column)) =
            tuple((opt(tuple((identifier, tag(".")))), identifier))(input)?;

        let table_name = match table_part {
            Some((table, _)) => table.to_string(),
            None => String::new(),
        };

        Ok((
            input,
            ColumnValuePair {
                column_name: column.to_string(),
                table_name,
            },
        ))
    }
}


#[cfg(test)]
mod tests {
    #[test]
    fn parser_test() {
        use super::ColumnValuePair;

        let input = "id";
        let expected = ColumnValuePair::new("id", "");
        let actual = ColumnValuePair::parse(input).unwrap().1;
        assert_eq!(expected, actual);

        let input = "users.id";
        let expected = ColumnValuePair::new("id", "users");
        let actual = ColumnValuePair::parse(input).unwrap().1;
        assert_eq!(expected, actual);
    }
}