vortex-layout 0.89.0

Vortex layouts provide a way to perform lazy push-down scans over abstract storage
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

// SPDX-License-Identifier: Apache-2.0
// SPDX-FileCopyrightText: Copyright the Vortex contributors

//! Concatenating inlets in order.

use vortex_error::VortexResult;
use vortex_error::vortex_err;

use crate::plan::physical::operator::Cx;
use crate::plan::physical::operator::Input;
use crate::plan::physical::operator::Operator;
use crate::plan::physical::operator::Source;
use crate::plan::physical::operator::SourceBlocked;
use crate::plan::physical::operator::SourceReady;
use crate::plan::physical::operator::Step;

/// Emits its inlets one after another, each to its end.
pub(crate) struct ConcatSource {
    inlets: usize,
    /// The inlet being emitted; those before it have ended.
    current: usize,
}

impl ConcatSource {
    pub(crate) fn new(inlets: usize) -> Self {
        Self { inlets, current: 0 }
    }
}

impl Source for ConcatSource {
    fn ready(&mut self, cx: &mut Cx<'_>) -> VortexResult<SourceReady> {
        while self.current < self.inlets {
            let inlet = cx.inlet(self.current);
            if !inlet.is_empty() {
                return Ok(SourceReady::Ready);
            }
            if !inlet.closed() {
                return Ok(SourceReady::Blocked(SourceBlocked::Inlet(self.current)));
            }
            self.current += 1;
        }
        Ok(SourceReady::Ready)
    }
}

impl Operator for ConcatSource {
    fn compute(&mut self, _input: Input, cx: &mut Cx<'_>) -> VortexResult<Step> {
        Ok(if self.current == self.inlets {
            Step::End
        } else {
            Step::Final(
                cx.inlet(self.current)
                    .take()
                    .ok_or_else(|| vortex_err!("Concat computed before its inlet was ready"))?,
            )
        })
    }
}