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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
use crate::chunked_array::builder::get_large_list_builder;
use crate::prelude::*;
use arrow::array::{Array, ArrayRef, PrimitiveBuilder, StringBuilder};
use std::sync::Arc;

// TODO: Test rechunking properly

pub trait ChunkOps {
    /// Aggregate to chunk id.
    /// A chunk id is a vector of the chunk lengths.
    fn rechunk(&self, chunk_lengths: Option<&[usize]>) -> Result<Self>
    where
        Self: std::marker::Sized;
    /// Only rechunk if lhs and rhs don't match
    fn optional_rechunk<A>(&self, rhs: &ChunkedArray<A>) -> Result<Option<Self>>
    where
        Self: std::marker::Sized;
}

macro_rules! optional_rechunk {
    ($self:tt, $rhs:tt) => {
        if $self.chunk_id != $rhs.chunk_id {
            // we can rechunk ourselves to match
            $self.rechunk(Some(&$rhs.chunk_id)).map(|v| Some(v))
        } else {
            Ok(None)
        }
    };
}

#[inline]
fn mimic_chunks<T>(arr: &ArrayRef, chunk_lengths: &[usize], name: &str) -> Result<ChunkedArray<T>>
where
    T: PolarsDataType,
    ChunkedArray<T>: ChunkOps,
{
    let mut chunks = Vec::with_capacity(chunk_lengths.len());
    let mut offset = 0;
    for chunk_length in chunk_lengths {
        chunks.push(arr.slice(offset, *chunk_length));
        offset += *chunk_length
    }
    Ok(ChunkedArray::new_from_chunks(name, chunks))
}

impl<T> ChunkOps for ChunkedArray<T>
where
    T: PolarsNumericType,
{
    fn rechunk(&self, chunk_lengths: Option<&[usize]>) -> Result<Self> {
        // we aggregate to 1 or chunk_id
        match (self.chunks.len(), chunk_lengths.map(|v| v.len())) {
            // No rechunking needed.
            (1, Some(1)) | (1, None) => Ok(self.clone()),
            // Left contains a single chunk. We can cheaply mimic right as arrow slices are zero copy
            (1, Some(_)) => mimic_chunks(&self.chunks[0], chunk_lengths.unwrap(), self.name()),
            // Left will be aggregated to match right
            (_, Some(_)) | (_, None) => {
                let default = &[self.len()];
                let chunk_id = chunk_lengths.unwrap_or(default);
                let mut iter = self.into_iter();
                let mut chunks: Vec<Arc<dyn Array>> = Vec::with_capacity(chunk_id.len());

                for &chunk_length in chunk_id {
                    let mut builder = PrimitiveBuilder::<T>::new(chunk_length);

                    for _ in 0..chunk_length {
                        builder.append_option(
                            iter.next()
                                .expect("the first option is the iterator bounds"),
                        )?;
                    }
                    chunks.push(Arc::new(builder.finish()))
                }
                Ok(ChunkedArray::new_from_chunks(self.name(), chunks))
            }
        }
    }

    fn optional_rechunk<A>(&self, rhs: &ChunkedArray<A>) -> Result<Option<Self>> {
        optional_rechunk!(self, rhs)
    }
}

impl ChunkOps for BooleanChunked {
    fn rechunk(&self, chunk_lengths: Option<&[usize]>) -> Result<Self> {
        match (self.chunks.len(), chunk_lengths.map(|v| v.len())) {
            (1, Some(1)) | (1, None) => Ok(self.clone()),
            (1, Some(_)) => mimic_chunks(&self.chunks[0], chunk_lengths.unwrap(), self.name()),
            (_, Some(_)) | (_, None) => {
                let default = &[self.len()];
                let chunk_id = chunk_lengths.unwrap_or(default);

                let mut iter = self.into_iter();
                let mut chunks: Vec<Arc<dyn Array>> = Vec::with_capacity(chunk_id.len());

                for &chunk_length in chunk_id {
                    let mut builder = PrimitiveBuilder::<BooleanType>::new(chunk_length);

                    for _ in 0..chunk_length {
                        builder.append_option(
                            iter.next()
                                .expect("the first option is the iterator bounds"),
                        )?;
                    }
                    chunks.push(Arc::new(builder.finish()))
                }
                Ok(ChunkedArray::new_from_chunks(self.name(), chunks))
            }
        }
    }

    fn optional_rechunk<A>(&self, rhs: &ChunkedArray<A>) -> Result<Option<Self>> {
        optional_rechunk!(self, rhs)
    }
}

impl ChunkOps for Utf8Chunked {
    fn rechunk(&self, chunk_lengths: Option<&[usize]>) -> Result<Self> {
        match (self.chunks.len(), chunk_lengths.map(|v| v.len())) {
            (1, Some(1)) | (1, None) => Ok(self.clone()),
            (1, Some(_)) => mimic_chunks(&self.chunks[0], chunk_lengths.unwrap(), self.name()),
            (_, Some(_)) | (_, None) => {
                let default = &[self.len()];
                let chunk_id = chunk_lengths.unwrap_or(default);
                let mut iter = self.into_iter();
                let mut chunks: Vec<Arc<dyn Array>> = Vec::with_capacity(chunk_id.len());

                for &chunk_length in chunk_id {
                    let mut builder = StringBuilder::new(chunk_length);

                    for _ in 0..chunk_length {
                        let opt_val = iter.next().expect("first option is iterator bounds");
                        match opt_val {
                            None => builder.append_null().expect("should not fail"),
                            Some(val) => builder.append_value(val).expect("should not fail"),
                        }
                    }
                    chunks.push(Arc::new(builder.finish()))
                }
                Ok(ChunkedArray::new_from_chunks(self.name(), chunks))
            }
        }
    }

    fn optional_rechunk<A>(&self, rhs: &ChunkedArray<A>) -> Result<Option<Self>> {
        optional_rechunk!(self, rhs)
    }
}
impl ChunkOps for LargeListChunked {
    fn rechunk(&self, chunk_lengths: Option<&[usize]>) -> Result<Self> {
        match (self.chunks.len(), chunk_lengths.map(|v| v.len())) {
            (1, Some(1)) | (1, None) => Ok(self.clone()),
            (1, Some(_)) => mimic_chunks(&self.chunks[0], chunk_lengths.unwrap(), self.name()),
            (_, Some(_)) | (_, None) => {
                let default = &[self.len()];
                let chunk_id = chunk_lengths.unwrap_or(default);
                let mut iter = self.into_iter();
                let mut chunks: Vec<Arc<dyn Array>> = Vec::with_capacity(chunk_id.len());

                for &chunk_length in chunk_id {
                    let mut builder =
                        get_large_list_builder(self.dtype(), chunk_length, self.name());
                    while let Some(v) = iter.next() {
                        builder.append_opt_series(v.as_ref())
                    }
                    let list = builder.finish();
                    // cheap clone of Arc
                    chunks.push(list.chunks[0].clone())
                }
                Ok(ChunkedArray::new_from_chunks(self.name(), chunks))
            }
        }
    }

    fn optional_rechunk<A>(&self, rhs: &ChunkedArray<A>) -> Result<Option<Self>> {
        optional_rechunk!(self, rhs)
    }
}