mz_repr/adt/

array.rs

// Copyright Materialize, Inc. and contributors. All rights reserved.
//
// Use of this software is governed by the Business Source License
// included in the LICENSE file.
//
// As of the Change Date specified in that file, in accordance with
// the Business Source License, use of this software will be governed
// by the Apache License, Version 2.0.

//! A multi-dimensional array data type.

use std::cmp::Ordering;
use std::error::Error;
use std::{fmt, mem};

use mz_lowertest::MzReflect;
use mz_ore::cast::CastFrom;
use mz_persist_types::columnar::FixedSizeCodec;
use mz_proto::{RustType, TryFromProtoError};
#[cfg(any(test, feature = "proptest"))]
use proptest_derive::Arbitrary;
use serde::{Deserialize, Serialize};

use crate::Datum;
use crate::row::DatumList;
use crate::scalar::SqlScalarType;

include!(concat!(env!("OUT_DIR"), "/mz_repr.adt.array.rs"));

/// The maximum number of dimensions permitted in an array.
pub const MAX_ARRAY_DIMENSIONS: u8 = 6;

/// A variable-length multi-dimensional array.
///
/// The type parameter `T` represents the element type of the array. It is a
/// phantom parameter propagated through the inner [`DatumList`] — the actual
/// elements are stored as serialized bytes and `T` is not enforced at
/// runtime. It is up to the caller to ensure `T` matches the actual element
/// type. The default `T = Datum<'a>` means existing code that writes
/// `Array<'a>` continues to work unchanged.
#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
pub struct Array<'a, T = Datum<'a>> {
    /// The elements in the array.
    pub(crate) elements: DatumList<'a, T>,
    /// The dimensions of the array.
    pub(crate) dims: ArrayDimensions<'a>,
}

impl<'a, T> Array<'a, T> {
    /// Returns the dimensions of the array.
    pub fn dims(&self) -> ArrayDimensions<'a> {
        self.dims
    }

    /// Returns the elements of the array.
    pub fn elements(&self) -> DatumList<'a, T> {
        self.elements
    }

    /// Returns true if this array's dimensions are valid for the Int2Vector type.
    /// Int2Vector is 1-D; empty arrays use 0 dimensions (PostgreSQL convention).
    pub fn has_int2vector_dims(&self) -> bool {
        self.dims().len() == 1
            || (self.dims().len() == 0 && self.elements().iter().next().is_none())
    }
}

impl<'a> crate::scalar::SqlContainerType for Array<'a, Datum<'a>> {
    fn unwrap_element_type(container: &SqlScalarType) -> &SqlScalarType {
        container.unwrap_array_element_type()
    }
    fn wrap_element_type(element: SqlScalarType) -> SqlScalarType {
        SqlScalarType::Array(Box::new(element))
    }
}

/// The dimensions of an [`Array`].
#[derive(Clone, Copy, Eq, PartialEq, Hash)]
pub struct ArrayDimensions<'a> {
    pub(crate) data: &'a [u8],
}

impl Default for ArrayDimensions<'static> {
    fn default() -> Self {
        Self { data: &[] }
    }
}

impl ArrayDimensions<'_> {
    /// Returns the number of dimensions in the array as a [`u8`].
    pub fn ndims(&self) -> u8 {
        let ndims = self.data.len() / (mem::size_of::<usize>() * 2);
        ndims.try_into().expect("ndims is known to fit in a u8")
    }

    /// Returns the number of the dimensions in the array as a [`usize`].
    pub fn len(&self) -> usize {
        self.ndims().into()
    }

    /// Reports whether the number of dimensions in the array is zero.
    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }
}

impl Ord for ArrayDimensions<'_> {
    fn cmp(&self, other: &Self) -> Ordering {
        self.ndims().cmp(&other.ndims())
    }
}

impl PartialOrd for ArrayDimensions<'_> {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl fmt::Debug for ArrayDimensions<'_> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        f.debug_list().entries(*self).finish()
    }
}

impl<'a> IntoIterator for ArrayDimensions<'a> {
    type Item = ArrayDimension;
    type IntoIter = ArrayDimensionsIter<'a>;

    fn into_iter(self) -> ArrayDimensionsIter<'a> {
        ArrayDimensionsIter { data: self.data }
    }
}

/// An iterator over the dimensions in an [`ArrayDimensions`].
#[derive(Debug)]
pub struct ArrayDimensionsIter<'a> {
    data: &'a [u8],
}

impl Iterator for ArrayDimensionsIter<'_> {
    type Item = ArrayDimension;

    fn next(&mut self) -> Option<ArrayDimension> {
        if self.data.is_empty() {
            None
        } else {
            let sz = mem::size_of::<usize>();
            let lower_bound = isize::from_ne_bytes(self.data[..sz].try_into().unwrap());
            self.data = &self.data[sz..];
            let length = usize::from_ne_bytes(self.data[..sz].try_into().unwrap());
            self.data = &self.data[sz..];
            Some(ArrayDimension {
                lower_bound,
                length,
            })
        }
    }
}

/// The specification of one dimension of an [`Array`].
#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
pub struct ArrayDimension {
    /// The "logical" index at which this dimension begins. This value has no bearing on the
    /// physical layout of the data, only how users want to use its indices (which may be negative).
    pub lower_bound: isize,
    /// The number of elements in this array.
    pub length: usize,
}

impl ArrayDimension {
    /// Presents the "logical indices" of the array, i.e. those that are revealed to the user.
    ///
    /// # Panics
    /// - If the array contain more than [`isize::MAX`] elements (i.e. more than 9EB of data).
    pub fn dimension_bounds(&self) -> (isize, isize) {
        (
            self.lower_bound,
            self.lower_bound
                + isize::try_from(self.length).expect("fewer than isize::MAX elements")
                - 1,
        )
    }
}

/// An error that can occur when constructing an array.
#[derive(
    Clone,
    Copy,
    Debug,
    Eq,
    PartialEq,
    Hash,
    Ord,
    PartialOrd,
    Serialize,
    Deserialize,
    MzReflect
)]
#[cfg_attr(any(test, feature = "proptest"), derive(Arbitrary))]
pub enum InvalidArrayError {
    /// The number of dimensions in the array exceeds [`MAX_ARRAY_DIMENSIONS]`.
    TooManyDimensions(usize),
    /// The number of array elements does not match the cardinality derived from
    /// its dimensions.
    WrongCardinality { actual: usize, expected: usize },
}

impl fmt::Display for InvalidArrayError {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        match self {
            InvalidArrayError::TooManyDimensions(n) => write!(
                f,
                "number of array dimensions ({}) exceeds the maximum allowed ({})",
                n, MAX_ARRAY_DIMENSIONS
            ),
            InvalidArrayError::WrongCardinality { actual, expected } => write!(
                f,
                "number of array elements ({}) does not match declared cardinality ({})",
                actual, expected
            ),
        }
    }
}

impl Error for InvalidArrayError {
    fn source(&self) -> Option<&(dyn Error + 'static)> {
        None
    }
}

impl RustType<ProtoInvalidArrayError> for InvalidArrayError {
    fn into_proto(&self) -> ProtoInvalidArrayError {
        use Kind::*;
        use proto_invalid_array_error::*;
        let kind = match self {
            InvalidArrayError::TooManyDimensions(dims) => TooManyDimensions(dims.into_proto()),
            InvalidArrayError::WrongCardinality { actual, expected } => {
                WrongCardinality(ProtoWrongCardinality {
                    actual: actual.into_proto(),
                    expected: expected.into_proto(),
                })
            }
        };
        ProtoInvalidArrayError { kind: Some(kind) }
    }

    fn from_proto(proto: ProtoInvalidArrayError) -> Result<Self, TryFromProtoError> {
        use proto_invalid_array_error::Kind::*;
        match proto.kind {
            Some(kind) => match kind {
                TooManyDimensions(dims) => Ok(InvalidArrayError::TooManyDimensions(
                    usize::from_proto(dims)?,
                )),
                WrongCardinality(v) => Ok(InvalidArrayError::WrongCardinality {
                    actual: usize::from_proto(v.actual)?,
                    expected: usize::from_proto(v.expected)?,
                }),
            },
            None => Err(TryFromProtoError::missing_field(
                "`ProtoInvalidArrayError::kind`",
            )),
        }
    }
}

/// An encoded packed variant of [`ArrayDimension`].
///
/// We uphold the variant that [`PackedArrayDimension`] sorts the same as
/// [`ArrayDimension`].
#[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord)]
pub struct PackedArrayDimension([u8; Self::SIZE]);

// `as` conversions are okay here because we're doing bit level logic to make
// sure the sort order of the packed binary is correct. This is implementation
// is proptest-ed below.
#[allow(clippy::as_conversions)]
impl FixedSizeCodec<ArrayDimension> for PackedArrayDimension {
    const SIZE: usize = 16;

    fn as_bytes(&self) -> &[u8] {
        &self.0
    }

    fn from_bytes(slice: &[u8]) -> Result<Self, String> {
        let buf: [u8; Self::SIZE] = slice.try_into().map_err(|_| {
            format!(
                "size for PackedArrayDimension is {} bytes, got {}",
                Self::SIZE,
                slice.len()
            )
        })?;
        Ok(PackedArrayDimension(buf))
    }

    fn from_value(value: ArrayDimension) -> Self {
        let mut buf = [0; 16];

        let lower_bound = (i64::cast_from(value.lower_bound) as u64) ^ (0x8000_0000_0000_0000u64);
        buf[..8].copy_from_slice(&lower_bound.to_be_bytes());
        let length = u64::cast_from(value.length);
        buf[8..].copy_from_slice(&length.to_be_bytes());

        PackedArrayDimension(buf)
    }

    fn into_value(self) -> ArrayDimension {
        let mut lower_bound: [u8; 8] = self.0[..8].try_into().unwrap();
        lower_bound.copy_from_slice(&self.0[..8]);
        let lower_bound = u64::from_be_bytes(lower_bound) ^ 0x8000_0000_0000_0000u64;

        let mut length: [u8; 8] = self.0[8..].try_into().unwrap();
        length.copy_from_slice(&self.0[8..]);
        let length = u64::from_be_bytes(length);

        ArrayDimension {
            lower_bound: isize::cast_from(lower_bound as i64),
            length: usize::cast_from(length),
        }
    }
}

#[cfg(test)]
mod tests {
    use std::iter::empty;

    use mz_ore::assert_ok;
    use mz_proto::protobuf_roundtrip;
    use proptest::prelude::*;

    use crate::Datum;
    use crate::row::Row;

    use super::*;

    #[mz_ore::test]
    fn test_has_int2vector_dims() {
        // 1-D array with elements: valid for int2vector
        let mut row = Row::default();
        row.packer()
            .try_push_array(
                &[ArrayDimension {
                    lower_bound: 1,
                    length: 2,
                }],
                [Datum::Int16(1), Datum::Int16(2)],
            )
            .unwrap();
        let arr = row.unpack_first().unwrap_array();
        assert!(
            arr.has_int2vector_dims(),
            "1-D array should have int2vector dims"
        );

        // 1-D empty array (length 0): valid
        let mut row = Row::default();
        row.packer()
            .try_push_array(
                &[ArrayDimension {
                    lower_bound: 1,
                    length: 0,
                }],
                empty::<Datum>(),
            )
            .unwrap();
        let arr = row.unpack_first().unwrap_array();
        assert!(
            arr.has_int2vector_dims(),
            "1-D empty array should have int2vector dims"
        );

        // 0-D empty array (PostgreSQL convention for empty): valid
        let mut row = Row::default();
        row.packer().try_push_array(&[], empty::<Datum>()).unwrap();
        let arr = row.unpack_first().unwrap_array();
        assert!(
            arr.has_int2vector_dims(),
            "0-D empty array should have int2vector dims"
        );

        // 2-D array: invalid for int2vector
        let mut row = Row::default();
        row.packer()
            .try_push_array(
                &[
                    ArrayDimension {
                        lower_bound: 1,
                        length: 1,
                    },
                    ArrayDimension {
                        lower_bound: 1,
                        length: 2,
                    },
                ],
                [Datum::Int16(1), Datum::Int16(2)],
            )
            .unwrap();
        let arr = row.unpack_first().unwrap_array();
        assert!(
            !arr.has_int2vector_dims(),
            "2-D array should not have int2vector dims"
        );
    }

    proptest! {
        #[mz_ore::test]
        fn invalid_array_error_protobuf_roundtrip(expect in any::<InvalidArrayError>()) {
            let actual = protobuf_roundtrip::<_, ProtoInvalidArrayError>(&expect);
            assert_ok!(actual);
            assert_eq!(actual.unwrap(), expect);
        }
    }

    fn arb_array_dimension() -> impl Strategy<Value = ArrayDimension> {
        (any::<isize>(), any::<usize>()).prop_map(|(lower, length)| ArrayDimension {
            lower_bound: lower,
            length,
        })
    }

    #[mz_ore::test]
    fn proptest_packed_array_dimension_roundtrip() {
        fn test(og: ArrayDimension) {
            let packed = PackedArrayDimension::from_value(og);
            let rnd = packed.into_value();
            assert_eq!(og, rnd);
        }

        proptest!(|(dim in arb_array_dimension())| test(dim))
    }

    #[mz_ore::test]
    fn proptest_packed_array_dimension_sorts() {
        fn test(mut og: Vec<ArrayDimension>) {
            let mut packed: Vec<_> = og
                .iter()
                .copied()
                .map(PackedArrayDimension::from_value)
                .collect();

            packed.sort();
            og.sort();

            let rnd: Vec<_> = packed
                .into_iter()
                .map(PackedArrayDimension::into_value)
                .collect();
            assert_eq!(og, rnd);
        }

        let strat = proptest::collection::vec(arb_array_dimension(), 0..16);
        proptest!(|(dim in strat)| test(dim))
    }
}