risingwave_common/row/repeat_n.rs
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
// Copyright 2024 RisingWave Labs
//
// 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 super::Row;
use crate::types::{DatumRef, ToDatumRef};
/// Row for the [`repeat_n`] function.
#[derive(Debug, Clone, Copy)]
pub struct RepeatN<D> {
datum: D,
n: usize,
}
impl<D: PartialEq> PartialEq for RepeatN<D> {
fn eq(&self, other: &Self) -> bool {
if self.n == 0 && other.n == 0 {
true
} else {
self.datum == other.datum && self.n == other.n
}
}
}
impl<D: Eq> Eq for RepeatN<D> {}
impl<D: ToDatumRef> Row for RepeatN<D> {
#[inline]
fn datum_at(&self, index: usize) -> crate::types::DatumRef<'_> {
if index < self.n {
self.datum.to_datum_ref()
} else {
panic!(
"index out of bounds: the len is {} but the index is {}",
self.n, index
)
}
}
#[inline]
unsafe fn datum_at_unchecked(&self, _index: usize) -> crate::types::DatumRef<'_> {
// Always ignore the index and return the datum, which is okay for undefined behavior.
self.datum.to_datum_ref()
}
#[inline]
fn len(&self) -> usize {
self.n
}
#[inline]
fn iter(&self) -> impl Iterator<Item = DatumRef<'_>> {
std::iter::repeat(self.datum.to_datum_ref()).take(self.n)
}
}
/// Create a row which contains `n` repetitions of `datum`.
pub fn repeat_n<D: ToDatumRef>(datum: D, n: usize) -> RepeatN<D> {
RepeatN { datum, n }
}