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

use crate::query::query_values::MultiValues;
use crate::query::query_values::QueryValues;
use crate::query::query_values::SingleValues;
use crate::InsertEdgesQuery;
use crate::QueryIds;

/// Insert edges builder that lets you add `from`
/// (origin) nodes.
pub struct InsertEdges(pub InsertEdgesQuery);

/// Insert edges builder that lets you add values.
pub struct InsertEdgesEach(pub InsertEdgesQuery);

/// Insert edges builder that lets you add `to`
/// (destination) nodes.
pub struct InsertEdgesFrom(pub InsertEdgesQuery);

/// Insert edges builder that lets you add values
/// or set `each`.
pub struct InsertEdgesFromTo(pub InsertEdgesQuery);

/// Final builder that lets you create
/// an actual query object.
pub struct InsertEdgesValues(pub InsertEdgesQuery);

impl InsertEdges {
    /// An id or list of ids or search query from where the edges should come from (origin).
    ///
    /// Options:
    ///
    /// ```
    /// use agdb::QueryBuilder;
    ///
    /// QueryBuilder::insert().edges().from(1).to(2);
    /// QueryBuilder::insert().edges().from(1).to(vec![2, 3]);
    /// QueryBuilder::insert().edges().from(1).to(QueryBuilder::search().from(1).query());
    /// ```
    pub fn from<T: Into<QueryIds>>(mut self, ids: T) -> InsertEdgesFrom {
        self.0.from = ids.into();

        InsertEdgesFrom(self.0)
    }
}

impl InsertEdgesEach {
    /// Returns the built `InsertEdgesQuery` object.
    pub fn query(self) -> InsertEdgesQuery {
        self.0
    }

    /// List of lists of `key_values` to be inserted into the edges. There must be exactly
    /// as many lists as the number of created edges.
    pub fn values<T: Into<MultiValues>>(mut self, key_values: T) -> InsertEdgesValues {
        self.0.values = QueryValues::Multi(Into::<MultiValues>::into(key_values).0);

        InsertEdgesValues(self.0)
    }

    /// List of `key_values` to be inserted into all created edges.
    pub fn values_uniform<T: Into<SingleValues>>(mut self, key_values: T) -> InsertEdgesValues {
        self.0.values = QueryValues::Single(Into::<SingleValues>::into(key_values).0);

        InsertEdgesValues(self.0)
    }
}

impl InsertEdgesFrom {
    /// An id or list of ids or search query to where the edges should go (destination).
    ///
    /// Options:
    ///
    /// ```
    /// use agdb::QueryBuilder;
    ///
    /// QueryBuilder::insert().edges().from(1).to(2).query();
    /// QueryBuilder::insert().edges().from(1).to(2).each();
    /// QueryBuilder::insert().edges().from(1).to(2).values(vec![vec![("k", 1).into()]]);
    /// QueryBuilder::insert().edges().from(1).to(2).values_uniform(vec![("k", 1).into()]);
    /// ```
    pub fn to<T: Into<QueryIds>>(mut self, ids: T) -> InsertEdgesFromTo {
        self.0.to = ids.into();

        InsertEdgesFromTo(self.0)
    }
}

impl InsertEdgesFromTo {
    /// A modifier to create edges from each origin (from) to each destination (to)
    /// even if the number of origins and destinations is the same. This modifier is assumed
    /// and thus not needed if they are already asymmetric.
    ///
    /// Options:
    ///
    /// ```
    /// use agdb::QueryBuilder;
    ///
    /// QueryBuilder::insert().edges().from(1).to(2).each().query();
    /// QueryBuilder::insert().edges().from(1).to(2).each().values(vec![vec![("k", 1).into()]]);
    /// QueryBuilder::insert().edges().from(1).to(2).each().values_uniform(vec![("k", 1).into()]);
    /// ```
    pub fn each(mut self) -> InsertEdgesEach {
        self.0.each = true;

        InsertEdgesEach(self.0)
    }

    /// Returns the built `InsertEdgesQuery` object.
    pub fn query(self) -> InsertEdgesQuery {
        self.0
    }

    /// List of lists of `key_values` to be inserted into the edges. There must be exactly
    /// as many lists as the number of created edges.
    pub fn values<T: Into<MultiValues>>(mut self, key_values: T) -> InsertEdgesValues {
        self.0.values = QueryValues::Multi(Into::<MultiValues>::into(key_values).0);

        InsertEdgesValues(self.0)
    }

    /// List of `key_values` to be inserted into all created edges.
    pub fn values_uniform<T: Into<SingleValues>>(mut self, key_values: T) -> InsertEdgesValues {
        self.0.values = QueryValues::Single(Into::<SingleValues>::into(key_values).0);

        InsertEdgesValues(self.0)
    }
}

impl InsertEdgesValues {
    /// Returns the built `InsertEdgesQuery` object.
    pub fn query(self) -> InsertEdgesQuery {
        self.0
    }
}