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

// Copyright 2016 Mozilla
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use
// this file except in compliance with the License. You may obtain a copy of the
// License at http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing, software distributed
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
// specific language governing permissions and limitations under the License.

use std::collections::BTreeMap;

use core_traits::{
    ValueType,
    TypedValue,
};

use edn::query::{
    Variable,
};

use query_algebrizer_traits::errors::{
    AlgebrizerError,
    Result,
};

/// Define the inputs to a query. This is in two parts: a set of values known now, and a set of
/// types known now.
/// The separate map of types is to allow queries to be algebrized without full knowledge of
/// the bindings that will be used at execution time.
/// When built correctly, `types` is guaranteed to contain the types of `values` -- use
/// `QueryInputs::new` or `QueryInputs::with_values` to construct an instance.
pub struct QueryInputs {
    pub(crate) types: BTreeMap<Variable, ValueType>,
    pub(crate) values: BTreeMap<Variable, TypedValue>,
}

impl Default for QueryInputs {
    fn default() -> Self {
        QueryInputs {
            types: BTreeMap::default(),
            values: BTreeMap::default(),
        }
    }
}

impl QueryInputs {
    pub fn with_value_sequence(vals: Vec<(Variable, TypedValue)>) -> QueryInputs {
        let values: BTreeMap<Variable, TypedValue> = vals.into_iter().collect();
        QueryInputs::with_values(values)
    }

    pub fn with_type_sequence(types: Vec<(Variable, ValueType)>) -> QueryInputs {
        QueryInputs {
            types: types.into_iter().collect(),
            values: BTreeMap::default(),
        }
    }

    pub fn with_values(values: BTreeMap<Variable, TypedValue>) -> QueryInputs {
        QueryInputs {
            types: values.iter().map(|(var, val)| (var.clone(), val.value_type())).collect(),
            values: values,
        }
    }

    pub fn new(mut types: BTreeMap<Variable, ValueType>,
               values: BTreeMap<Variable, TypedValue>) -> Result<QueryInputs> {
        // Make sure that the types of the values agree with those in types, and collect.
        for (var, v) in values.iter() {
            let t = v.value_type();
            let old = types.insert(var.clone(), t);
            if let Some(old) = old {
                if old != t {
                    bail!(AlgebrizerError::InputTypeDisagreement(var.name(), old, t));
                }
            }
        }
        Ok(QueryInputs { types: types, values: values })
    }
}