uqa-sql 0.4.9

PostgreSQL-compatible SQL compiler built on libpg_query
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189

//
// Unified Query Algebra
//
// Copyright (c) 2023-2026 Cognica, Inc.
//

use super::*;
use crate::schema::constraint_metadata::{CatalogObjectAllocator, CatalogOidClass};

struct Allocator(u8);

impl CatalogObjectAllocator for Allocator {
    fn allocate_object_id(&mut self, _kind: &str) -> ConstraintMetadataResult<[u8; 16]> {
        self.0 += 1;
        Ok([self.0; 16])
    }

    fn allocate_catalog_oid(
        &mut self,
        _class: CatalogOidClass,
        object_id: &[u8; 16],
    ) -> ConstraintMetadataResult<i64> {
        Ok(16_384 + i64::from(object_id[0]))
    }
}

const fn partition(id: u8, parent: Option<u8>) -> ReferencedPartition {
    ReferencedPartition {
        partition: [id; 16],
        parent: match parent {
            Some(parent) => Some([parent; 16]),
            None => None,
        },
    }
}

fn names(constraints: &[ReferencedPartitionConstraint]) -> Vec<(&str, u8)> {
    constraints
        .iter()
        .map(|constraint| (constraint.name.as_str(), constraint.partition[0]))
        .collect()
}

const fn valid(name: &str) -> ReferencingConstraint<'_> {
    ReferencingConstraint {
        name,
        validated: true,
        enforced: true,
    }
}

#[test]
fn creation_names_every_partition_from_the_foreign_key_and_later_partitions_from_their_parent() {
    let mut constraints = Vec::new();
    let mut used = BTreeSet::from(["fk_a_fkey".to_string(), "fk_a_fkey_2".to_string()]);
    let mut allocate = Allocator(0);
    // pk1, then pk2 with its partition pk21; a name the schema holds is skipped.
    let tree = [
        partition(1, None),
        partition(2, None),
        partition(21, Some(2)),
    ];
    assert!(reconcile_referenced_partition_constraints(
        &mut constraints,
        valid("fk_a_fkey"),
        &tree,
        &mut used,
        &mut allocate,
    )
    .unwrap());
    assert_eq!(
        names(&constraints),
        [("fk_a_fkey_1", 1), ("fk_a_fkey_3", 2), ("fk_a_fkey_4", 21)]
    );
    assert!(constraints
        .iter()
        .all(|constraint| constraint.catalog_identity.is_valid() && constraint.validated));
    assert!(!reconcile_referenced_partition_constraints(
        &mut constraints,
        valid("fk_a_fkey"),
        &tree,
        &mut used,
        &mut allocate,
    )
    .unwrap());
    // A partition that joins pk2 later takes its name from pk2's constraint, and a partitioned partition that joins pk names its whole subtree from the foreign key.
    let tree = [
        partition(1, None),
        partition(2, None),
        partition(21, Some(2)),
        partition(22, Some(2)),
        partition(3, None),
        partition(31, Some(3)),
    ];
    reconcile_referenced_partition_constraints(
        &mut constraints,
        valid("fk_a_fkey"),
        &tree,
        &mut used,
        &mut allocate,
    )
    .unwrap();
    assert_eq!(
        names(&constraints)[3..],
        [
            ("fk_a_fkey_3_1", 22),
            ("fk_a_fkey_5", 3),
            ("fk_a_fkey_6", 31)
        ]
    );
    // Detaching pk2 removes the constraints of its subtree.
    assert!(reconcile_referenced_partition_constraints(
        &mut constraints,
        valid("fk_a_fkey"),
        &[
            partition(1, None),
            partition(3, None),
            partition(31, Some(3))
        ],
        &mut used,
        &mut allocate,
    )
    .unwrap());
    assert_eq!(
        names(&constraints),
        [("fk_a_fkey_1", 1), ("fk_a_fkey_5", 3), ("fk_a_fkey_6", 31)]
    );
}

#[test]
fn derived_constraints_follow_the_validity_of_the_constraint_they_join() {
    let mut constraints = Vec::new();
    let mut used = BTreeSet::new();
    let mut allocate = Allocator(0);
    let unvalidated = ReferencingConstraint {
        name: "fk_a_fkey",
        validated: false,
        enforced: true,
    };
    let tree = [partition(1, None), partition(2, None)];
    reconcile_referenced_partition_constraints(
        &mut constraints,
        unvalidated,
        &tree,
        &mut used,
        &mut allocate,
    )
    .unwrap();
    assert!(constraints.iter().all(|constraint| !constraint.validated));
    // Validating one derived constraint keeps the others unvalidated, and a partition joining it inherits its validity.
    constraints[1].validated = true;
    reconcile_referenced_partition_constraints(
        &mut constraints,
        unvalidated,
        &[
            partition(1, None),
            partition(2, None),
            partition(21, Some(2)),
        ],
        &mut used,
        &mut allocate,
    )
    .unwrap();
    assert_eq!(
        constraints
            .iter()
            .map(|constraint| constraint.validated)
            .collect::<Vec<_>>(),
        [false, true, true]
    );
    // A foreign key that is no longer enforced validates none of them.
    reconcile_referenced_partition_constraints(
        &mut constraints,
        ReferencingConstraint {
            name: "fk_a_fkey",
            validated: false,
            enforced: false,
        },
        &[
            partition(1, None),
            partition(2, None),
            partition(21, Some(2)),
        ],
        &mut used,
        &mut allocate,
    )
    .unwrap();
    assert!(constraints.iter().all(|constraint| !constraint.validated));
}