-
Notifications
You must be signed in to change notification settings - Fork 12
Expand file tree
/
Copy pathvariant_list_insert.rs
More file actions
226 lines (184 loc) · 7.73 KB
/
variant_list_insert.rs
File metadata and controls
226 lines (184 loc) · 7.73 KB
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
use std::sync::Arc;
use arrow::array::StructArray;
use arrow_schema::{DataType, Field, Fields};
use datafusion::{
common::exec_err,
error::{DataFusionError, Result},
logical_expr::{
ColumnarValue, ReturnFieldArgs, ScalarUDFImpl, Signature, TypeSignature, Volatility,
},
scalar::ScalarValue,
};
use parquet_variant::{Variant, VariantBuilder};
use parquet_variant_compute::{VariantArray, VariantType};
use crate::shared::{ensure, try_parse_variant_scalar};
#[derive(Debug, Hash, PartialEq, Eq)]
pub struct VariantListInsert {
signature: Signature,
}
impl Default for VariantListInsert {
fn default() -> Self {
Self {
signature: Signature::new(TypeSignature::Any(2), Volatility::Immutable),
}
}
}
impl ScalarUDFImpl for VariantListInsert {
fn name(&self) -> &str {
"variant_list_insert"
}
fn signature(&self) -> &Signature {
&self.signature
}
fn return_type(&self, _arg_types: &[arrow_schema::DataType]) -> Result<arrow_schema::DataType> {
Err(DataFusionError::Internal(
"implemented return_field_from_args instead".into(),
))
}
fn return_field_from_args(&self, _args: ReturnFieldArgs) -> Result<Arc<Field>> {
let data_type = DataType::Struct(Fields::from(vec![
Field::new("metadata", DataType::BinaryView, false),
Field::new("value", DataType::BinaryView, false),
]));
Ok(Arc::new(
Field::new(self.name(), data_type, true).with_extension_type(VariantType),
))
}
fn invoke_with_args(
&self,
args: datafusion::logical_expr::ScalarFunctionArgs,
) -> Result<ColumnarValue> {
let argument_fields = args.arg_fields;
let argument_values = args.args;
ensure(
argument_fields.len() == argument_values.len(),
"argument fields and values must be of same length",
)?;
let [variant_list_to_update, element_to_append] = argument_values.as_slice() else {
return exec_err!("expected 2 arguments");
};
let all_arguments_variant_field = argument_fields
.iter()
.all(|f| matches!(f.extension_type(), VariantType));
ensure(
all_arguments_variant_field,
"expected all arguments to have the VariantType extension",
)?;
match (variant_list_to_update, element_to_append) {
(
ColumnarValue::Scalar(scalar_variant_list),
ColumnarValue::Scalar(scalar_element_to_append),
) => {
let variant_list = try_parse_variant_scalar(scalar_variant_list)?;
let variant_list = variant_list.value(0);
let variant_to_insert = try_parse_variant_scalar(scalar_element_to_append)?;
let variant_to_insert = variant_to_insert.value(0);
let out: StructArray = {
let (m, v) = create_variant_list_with_new_elements(
variant_list,
[variant_to_insert].into_iter(),
)?;
VariantArray::from_iter([Variant::new(m.as_ref(), v.as_ref())]).into()
};
Ok(ColumnarValue::Scalar(ScalarValue::Struct(Arc::new(out))))
}
(
ColumnarValue::Array(variant_lists),
ColumnarValue::Scalar(scalar_element_to_append),
) => {
let variant_array = VariantArray::try_new(&variant_lists)?;
let variant_to_insert = try_parse_variant_scalar(scalar_element_to_append)?;
let variant_to_insert = variant_to_insert.value(0);
// note: grr lifetimes...
let buffers = variant_array
.iter()
.map(|v| {
v.map(|v| {
create_variant_list_with_new_elements(
v,
[variant_to_insert.clone()].into_iter(),
)
})
.transpose()
})
.collect::<Result<Vec<_>>>()?;
let variants = buffers
.iter()
.map(|opt| {
opt.as_ref()
.map(|(m, v)| Variant::new(m.as_ref(), v.as_ref()))
})
.collect::<Vec<_>>();
let out: StructArray = VariantArray::from_iter(variants).into();
Ok(ColumnarValue::Array(Arc::new(out) as _))
}
(ColumnarValue::Array(variant_lists), ColumnarValue::Array(elements_to_append)) => {
let variant_lists = VariantArray::try_new(&variant_lists)?;
let elements_to_append = VariantArray::try_new(&elements_to_append)?;
ensure(
variant_lists.len() == elements_to_append.len(),
"expected arguments to have the same length",
)?;
let mut buffers = Vec::with_capacity(variant_lists.len());
for (variant_list_to_update, element_to_append) in
variant_lists.iter().zip(elements_to_append.iter())
{
match (variant_list_to_update, element_to_append) {
(Some(variant_list), Some(element_to_append)) => {
let (m, v) = create_variant_list_with_new_elements(
variant_list,
[element_to_append].into_iter(),
)?;
buffers.push(Some((m, v)));
}
(None, None) => buffers.push(None),
(Some(variant_list), None) => {
let mut v = VariantBuilder::new();
v.append_value(variant_list);
buffers.push(Some(v.finish()))
}
(None, Some(element_to_append)) => {
let mut v = VariantBuilder::new();
let mut l = v.new_list();
l.append_value(element_to_append);
l.finish();
buffers.push(Some(v.finish()));
}
};
}
let variants = buffers
.iter()
.map(|opt| {
opt.as_ref()
.map(|(m, v)| Variant::new(m.as_ref(), v.as_ref()))
})
.collect::<Vec<_>>();
let out: StructArray = VariantArray::from_iter(variants).into();
Ok(ColumnarValue::Array(Arc::new(out) as _))
}
(ColumnarValue::Scalar(_), ColumnarValue::Array(_)) => {
exec_err!("unsupported argument")
}
}
}
}
// note: I wonder if we can abstract this away
// it would be good to profile and see if this pocket of code is slow
fn create_variant_list_with_new_elements<'m, 'v>(
variant_list: Variant,
elements_to_insert: impl Iterator<Item = Variant<'m, 'v>>,
) -> Result<(Vec<u8>, Vec<u8>)> {
let Variant::List(variant_list) = variant_list else {
return exec_err!("expected variant list");
};
// note: I wonder if we can abstract this away
// it would be good to profile and see if this pocket of code is slow
let mut v = VariantBuilder::new();
let mut l = v.new_list();
l.extend(variant_list.iter());
for v in elements_to_insert {
l.append_value(v);
}
l.finish();
Ok(v.finish())
}