uqa-execution 0.4.0

Volcano physical operators with row-batch pipelines
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

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

//! Ordered private selections retain their allocation leases with every shared view.

use super::{Arc, Change, DocId, DocumentChanges, StorageBackendResult};
use uqa_core::memory::{BudgetedVec, MemoryBudget, MemoryReservation};
use uqa_storage::read_control::StorageReadControl;

pub(super) struct Selection {
    pub(super) rows: BudgetedVec<(DocId, Change)>,
    // Release the shared payload charge after its rows and their source owners.
    allocation: MemoryReservation,
}

impl Selection {
    pub(super) fn into_parts(self) -> (Vec<(DocId, Change)>, MemoryReservation, MemoryReservation) {
        let (rows, capacity) = self.rows.into_parts();
        (rows, capacity, self.allocation)
    }

    fn new(memory: &MemoryBudget, capacity: usize) -> StorageBackendResult<Self> {
        let allocation = memory.reserve(size_of::<Self>())?;
        let mut rows = BudgetedVec::new(memory);
        rows.reserve(capacity)?;
        Ok(Self { rows, allocation })
    }
}

impl DocumentChanges {
    pub(super) fn retention_control(&self, control: &StorageReadControl) -> StorageReadControl {
        let memory = self
            .0
            .as_ref()
            .map_or(control.memory(), |selection| selection.rows.budget());
        StorageReadControl::new(memory, control.cancellation())
    }

    pub(super) fn rows(&self) -> &[(DocId, Change)] {
        self.0.as_ref().map_or(&[], |selection| &selection.rows)
    }

    pub(super) fn get(&self, id: DocId) -> Option<&Change> {
        let rows = self.rows();
        rows.binary_search_by_key(&id, |(id, _)| *id)
            .ok()
            .map(|index| &rows[index].1)
    }

    fn writable(
        &mut self,
        additional: usize,
        control: &StorageReadControl,
    ) -> StorageBackendResult<&mut Selection> {
        control.check()?;
        if self
            .0
            .as_ref()
            .is_none_or(|rows| Arc::strong_count(rows) != 1)
        {
            let memory = self
                .0
                .as_ref()
                .map_or(control.memory(), |selection| selection.rows.budget());
            let capacity = self
                .rows()
                .len()
                .checked_add(additional)
                .ok_or(uqa_core::memory::MemoryError::SizeOverflow)?;
            let mut selection = Selection::new(memory, capacity)?;
            for row in self.rows() {
                control.check()?;
                selection.rows.push(row.clone())?;
            }
            control.check()?;
            self.0 = Some(Arc::new(selection));
        }
        let selection = Arc::get_mut(self.0.as_mut().expect("selection initialized"))
            .expect("selection uniquely owned");
        selection.rows.reserve(additional)?;
        Ok(selection)
    }

    pub(super) fn insert(
        &mut self,
        id: DocId,
        change: Change,
        control: &StorageReadControl,
    ) -> StorageBackendResult<()> {
        let position = self.rows().binary_search_by_key(&id, |(id, _)| *id);
        let selection = self.writable(usize::from(position.is_err()), control)?;
        match position {
            Ok(index) => selection.rows[index].1 = change,
            Err(index) => {
                selection.rows.push((id, change))?;
                selection.rows[index..].rotate_right(1);
            }
        }
        Ok(())
    }

    /// Merge complete ordered views before publication. Failure leaves both the original selection and its charged capacity unchanged.
    pub fn extend(
        &mut self,
        newer: Self,
        control: &StorageReadControl,
    ) -> StorageBackendResult<()> {
        control.check()?;
        if !newer.has_changes() {
            return Ok(());
        }
        let Some(original) = &self.0 else {
            *self = newer;
            return Ok(());
        };
        let mut count = original.rows.len();
        for (id, _) in newer.rows() {
            control.check()?;
            if self.get(*id).is_none() {
                count = count
                    .checked_add(1)
                    .ok_or(uqa_core::memory::MemoryError::SizeOverflow)?;
            }
        }
        let mut selection = Selection::new(original.rows.budget(), count)?;
        let mut old = self.rows().iter().peekable();
        for row in newer.rows() {
            while old.peek().is_some_and(|(id, _)| *id < row.0) {
                control.check()?;
                selection
                    .rows
                    .push(old.next().expect("peeked row").clone())?;
            }
            control.check()?;
            if old.peek().is_some_and(|(id, _)| *id == row.0) {
                old.next();
            }
            selection.rows.push(row.clone())?;
        }
        for row in old {
            control.check()?;
            selection.rows.push(row.clone())?;
        }
        control.check()?;
        self.0 = Some(Arc::new(selection));
        Ok(())
    }
}