agdb 0.12.10

Agnesoft Graph Database
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

use crate::DbElement;
use crate::DbError;
use crate::DbId;
use crate::DbImpl;
use crate::QueryId;
use crate::QueryIds;
use crate::QueryMut;
use crate::QueryResult;
use crate::StorageData;
use crate::query::query_values::QueryValues;

/// Query to insert nodes to the database. Only one of
/// `count`, `values` or `aliases` need to be given as the
/// implementation will derive the count from the other
/// parameters. If `values` is set to `Single` either `count`
/// or `aliases` must be provided however. If `values` are not
/// set to `Single` there must be enough value for `count/aliases`
/// unless they are not se and the count is derived from `values.
///
/// If the `ids` member is empty the query will insert new nodes
/// otherwise it will update the existing nodes. The rules for length
/// of `values` still apply and the search yield or static list must
/// have equal length to the `values` (or the `Single` variant must
/// be used).
///
/// The result will contain number of nodes inserted or updated and elements
/// with their ids but no properties.
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
#[cfg_attr(feature = "openapi", derive(utoipa::ToSchema))]
#[cfg_attr(feature = "derive", derive(agdb::DbSerialize))]
#[cfg_attr(feature = "api", derive(agdb::TypeDefImpl))]
#[derive(Clone, Debug, PartialEq)]
pub struct InsertNodesQuery {
    /// Number of nodes to be inserted.
    pub count: u64,

    /// Key value pairs to be associated with
    /// the new nodes.
    pub values: QueryValues,

    /// Aliases of the new nodes.
    pub aliases: Vec<String>,

    /// Optional ids of nodes (optionally a search sub-query).
    /// This can be empty.
    pub ids: QueryIds,
}

impl QueryMut for InsertNodesQuery {
    fn process<Store: StorageData>(&self, db: &mut DbImpl<Store>) -> Result<QueryResult, DbError> {
        let mut result = QueryResult::default();
        let mut ids = vec![];
        let count = std::cmp::max(self.count, self.aliases.len() as u64);
        let query_ids = match &self.ids {
            QueryIds::Ids(ids) => ids
                .iter()
                .map(|query_id| db.db_id(query_id))
                .collect::<Result<Vec<DbId>, DbError>>()?,
            QueryIds::Search(search_query) => search_query.search(db)?,
        };
        let values = match &self.values {
            QueryValues::Single(v) => vec![v; std::cmp::max(query_ids.len(), count as usize)],
            QueryValues::Multi(v) => v.iter().collect(),
        };

        if values.len() < self.aliases.len() {
            return Err(DbError::from(format!(
                "Aliases ({}) and values ({}) must have compatible lenghts ({} <= {})",
                self.aliases.len(),
                values.len(),
                self.aliases.len(),
                values.len(),
            )));
        }

        if !query_ids.is_empty() {
            query_ids.iter().try_for_each(|db_id| {
                if db_id.0 < 0 {
                    Err(DbError::from(format!(
                        "The ids for insert or update must all refer to nodes - edge id '{}' found",
                        db_id.0
                    )))
                } else {
                    Ok(())
                }
            })?;

            if values.len() != query_ids.len() {
                return Err(DbError::from(format!(
                    "Values ({}) and ids ({}) must have the same length",
                    values.len(),
                    query_ids.len()
                )));
            }

            for ((index, db_id), key_values) in query_ids.iter().enumerate().zip(values) {
                db.reserve_key_value_capacity(*db_id, key_values.len() as u64)?;
                for key_value in key_values {
                    db.insert_or_replace_key_value(*db_id, key_value)?;
                }

                if let Some(alias) = self.aliases.get(index) {
                    db.insert_new_alias(*db_id, alias)?;
                }

                ids.push(*db_id);
            }
        } else {
            for (index, key_values) in values.iter().enumerate() {
                if let Some(alias) = self.aliases.get(index)
                    && let Ok(db_id) = db.db_id(&QueryId::Alias(alias.to_string()))
                {
                    ids.push(db_id);

                    db.reserve_key_value_capacity(db_id, key_values.len() as u64)?;

                    for key_value in *key_values {
                        db.insert_or_replace_key_value(db_id, key_value)?;
                    }

                    continue;
                }

                let db_id = db.insert_node()?;
                ids.push(db_id);

                if let Some(alias) = self.aliases.get(index) {
                    db.insert_new_alias(db_id, alias)?;
                }

                db.reserve_key_value_capacity(db_id, key_values.len() as u64)?;

                for key_value in *key_values {
                    db.insert_key_value(db_id, key_value)?;
                }
            }
        }

        result.result = ids.len() as i64;
        result.elements = ids
            .into_iter()
            .map(|id| DbElement {
                id,
                from: None,
                to: None,
                values: vec![],
            })
            .collect();

        Ok(result)
    }
}

impl QueryMut for &InsertNodesQuery {
    fn process<Store: StorageData>(&self, db: &mut DbImpl<Store>) -> Result<QueryResult, DbError> {
        (*self).process(db)
    }
}