Method new

src/expr/src/row/collection.rs:70–89

Create a new [`RowCollection`] from a collection of [`Row`]s. Sorts data by `order_by`. Note that all row collections to be merged must be constructed with the same `order_by` to ensure a consistent sort order. Anything else is undefined behavior. TODO: Remember the `order_by` and assert that it is the same for all collections.

(mut rows: Vec<(Row, NonZeroUsize)>, order_by: &[ColumnOrder])

    /// to ensure a consistent sort order. Anything else is undefined behavior.
    // TODO: Remember the `order_by` and assert that it is the same for all collections.
    pub fn new(mut rows: Vec<(Row, NonZeroUsize)>, order_by: &[ColumnOrder]) -> Self {
        let comparator = RowComparator::new(order_by);
        // Sort data to maintain sortedness invariants.
        rows.sort_by(|(row1, _diff1), (row2, _diff2)| {
            comparator.compare_rows(row1, row2, || row1.cmp(row2))
        });

        // Pre-sizing our buffer should allow us to make just 1 allocation, and
        // use the perfect amount of memory.
        //
        // Note(parkmycar): I didn't do any benchmarking to determine if this
        // is faster, so feel free to change this if you'd like.
        let encoded_size = rows.iter().map(|(row, _diff)| row.data_len()).sum();

        let mut builder = Self::builder(encoded_size, rows.len());
        for (row, diff) in rows {
            builder.push(row.as_row_ref(), diff);
        }
        builder.build()
    }

    fn iter(&self) -> impl Iterator<Item = (&RowRef, NonZeroUsize)> {
        self.rows.iter().zip_eq(self.diffs.iter().copied())