hamelin_translation 0.8.0

Lowering and IR for Hamelin query language
Documentation
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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
//! Pipeline pass: Broadcast lowering.
//!
//! Transforms broadcast operations into explicit `transform(array, lambda)` calls.
//!
//! This handles two kinds of broadcasts:
//!
//! 1. **BroadcastApply**: A function call where one argument is an array and the
//!    operation should be applied element-wise.
//!    ```text
//!    [1, 2, 3] * 10  →  transform([1, 2, 3], __broadcast_0 -> __broadcast_0 * 10)
//!    ```
//!
//! 2. **FieldLookup on Array**: Field access on an array broadcasts over elements.
//!    ```text
//!    events.user  →  transform(events, __broadcast_0 -> __broadcast_0.user)
//!    ```
//!    where `events` is `Array<Struct>` or `Array<Variant>`.

use std::sync::Arc;

use hamelin_lib::{
    err::TranslationError,
    tree::{
        ast::expression::{Expression, ExpressionKind},
        builder::{call, field, field_ref, lambda1, pipeline, ExpressionBuilder},
        typed_ast::{
            command::TypedCommand,
            context::StatementTranslationContext,
            environment::TypeEnvironment,
            expression::{
                MapExpressionAlgebra, TypedBroadcastApply, TypedExpression, TypedFieldLookup,
            },
            pipeline::TypedPipeline,
        },
    },
    types::Type,
};

use crate::unique::UniqueNameGenerator;

// ---------------------------------------------------------------------------
// Public Entry Point
// ---------------------------------------------------------------------------

/// Lower BroadcastApply nodes to explicit transform() calls.
///
/// Contract: `(Arc<TypedPipeline>, &mut ctx) -> Result<Arc<TypedPipeline>, ...>`
pub fn lower_broadcast_apply(
    pipeline: Arc<TypedPipeline>,
    ctx: &mut StatementTranslationContext,
) -> Result<Arc<TypedPipeline>, Arc<TranslationError>> {
    // Check if any command has BroadcastApply
    if !pipeline_has_broadcast(&pipeline)? {
        return Ok(pipeline);
    }

    // Transform the pipeline
    let new_ast = transform_pipeline(&pipeline, ctx)?;

    // Re-typecheck using the same context
    Ok(Arc::new(TypedPipeline::from_ast_with_context(
        Arc::new(new_ast),
        ctx,
    )))
}

// ---------------------------------------------------------------------------
// Detection
// ---------------------------------------------------------------------------

/// Check if a pipeline has any BroadcastApply nodes.
fn pipeline_has_broadcast(pipeline: &TypedPipeline) -> Result<bool, Arc<TranslationError>> {
    let valid = pipeline.valid_ref()?;
    Ok(valid.commands.iter().any(command_has_broadcast))
}

/// Check if a command has any broadcast operations (BroadcastApply or FieldLookup on array).
fn command_has_broadcast(cmd: &Arc<TypedCommand>) -> bool {
    use hamelin_lib::tree::typed_ast::expression::TypedExpressionKind;

    cmd.find_expression(&mut |expr| match &expr.kind {
        TypedExpressionKind::BroadcastApply(_) => true,
        TypedExpressionKind::FieldLookup(fl) => {
            matches!(fl.value.resolved_type.as_ref(), Type::Array(_))
        }
        _ => false,
    })
    .is_some()
}

// ---------------------------------------------------------------------------
// Transform Pipeline
// ---------------------------------------------------------------------------

/// Transform a pipeline, lowering all BroadcastApply nodes.
fn transform_pipeline(
    in_pipeline: &TypedPipeline,
    ctx: &mut StatementTranslationContext,
) -> Result<hamelin_lib::tree::ast::pipeline::Pipeline, Arc<TranslationError>> {
    let valid = in_pipeline.valid_ref()?;
    let mut builder = pipeline().at(in_pipeline.ast.span.clone());
    let mut name_gen = UniqueNameGenerator::new("__broadcast");

    for cmd in valid.commands.iter() {
        let transformed_cmd = transform_command(cmd, &mut name_gen, ctx)?;
        builder = builder.command(transformed_cmd);
    }

    Ok(builder.build())
}

/// Transform a single command, lowering BroadcastApply nodes within.
fn transform_command(
    cmd: &Arc<TypedCommand>,
    name_gen: &mut UniqueNameGenerator,
    ctx: &mut StatementTranslationContext,
) -> Result<Arc<hamelin_lib::tree::ast::command::Command>, Arc<TranslationError>> {
    let mut alg = BroadcastLoweringAlgebra {
        name_gen,
        schema: &cmd.input_schema,
        error: None,
    };
    let result = cmd.cata_expressions(&mut alg);
    if let Some(err) = alg.error {
        return Err(ctx.error(err).at(&*cmd.ast).emit());
    }
    Ok(result)
}

// ---------------------------------------------------------------------------
// Expression Transformation Algebra
// ---------------------------------------------------------------------------

/// Algebra for lowering broadcast operations to transform() calls.
struct BroadcastLoweringAlgebra<'a> {
    name_gen: &'a mut UniqueNameGenerator,
    schema: &'a TypeEnvironment,
    error: Option<String>,
}

impl MapExpressionAlgebra for BroadcastLoweringAlgebra<'_> {
    fn broadcast_apply(
        &mut self,
        node: &TypedBroadcastApply,
        expr: &TypedExpression,
        children: hamelin_lib::func::def::ParameterBinding<Arc<Expression>>,
    ) -> Arc<Expression> {
        // Generate a unique parameter name for the lambda
        let param_name = self.name_gen.next(self.schema);

        // Get the array argument by its index position.
        // broadcast_position is validated during type checking, so this should always succeed.
        let array_arg = match children.get_by_index(node.broadcast_position) {
            Ok(arg) => arg.clone(),
            Err(e) => {
                self.error = Some(format!(
                    "broadcast lowering: invalid broadcast_position {}: {e}",
                    node.broadcast_position
                ));
                return node.replace_children_ast(expr, children);
            }
        };

        // Build the lambda body by replacing the broadcast argument with a column
        // reference to the lambda parameter, preserving the original AST structure
        let param_ref = Arc::new(field_ref(param_name.clone()).build());
        let body_children = match children.replace_by_index(node.broadcast_position, param_ref) {
            Ok(c) => c,
            Err(e) => {
                self.error = Some(format!(
                    "broadcast lowering: failed to replace at position {}: {e}",
                    node.broadcast_position
                ));
                return Arc::new(expr.ast.as_ref().clone());
            }
        };

        // Use the existing replace_children_ast to rebuild with original AST structure
        // (preserves BinaryOperator vs FunctionCall distinction)
        let body_ast = node.replace_children_ast(expr, body_children);

        // Build the lambda: param -> body
        let lambda_ast = lambda1(param_name.as_str()).body(body_ast).build();

        // Build transform(array, lambda)
        let transform_call = call("transform").arg(array_arg).arg(lambda_ast).build();

        Arc::new(transform_call)
    }

    fn field_lookup(
        &mut self,
        node: &TypedFieldLookup,
        expr: &TypedExpression,
        child: Arc<Expression>,
    ) -> Arc<Expression> {
        // Only transform if the value is an array (broadcast case)
        if !matches!(node.value.resolved_type.as_ref(), Type::Array(_)) {
            return node.replace_children_ast(expr, child);
        }

        // Extract the raw field name from the original AST.
        // Use valid_ref().as_str() to get the unescaped name — .to_string()
        // adds backtick quoting for reserved words which would embed literal
        // backticks into the generated AST.
        let field_name = match &expr.ast.kind {
            ExpressionKind::FieldLookup(fl) => match fl.field_identifier.valid_ref() {
                Ok(id) => id.as_str().to_string(),
                Err(_) => return node.replace_children_ast(expr, child),
            },
            _ => return node.replace_children_ast(expr, child),
        };

        self.lower_array_field_lookup(child, &field_name, &node.value.resolved_type)
    }
}

impl BroadcastLoweringAlgebra<'_> {
    /// Recursively lower field lookup on (possibly nested) arrays.
    ///
    /// For `Array<Struct>`, produces `transform(arr, x -> x.field)`.
    /// For `Array<Array<Struct>>`, produces `transform(arr, x -> transform(x, y -> y.field))`.
    fn lower_array_field_lookup(
        &mut self,
        child: Arc<Expression>,
        field_name: &str,
        typ: &Type,
    ) -> Arc<Expression> {
        let inner = match typ {
            Type::Array(arr) => arr,
            _ => return child,
        };

        let param_name = self.name_gen.next(self.schema);
        let param_ref = Arc::new(field_ref(param_name.clone()).build());

        let body_ast = match inner.element_type.as_ref() {
            Type::Array(_) => {
                self.lower_array_field_lookup(param_ref, field_name, &inner.element_type)
            }
            _ => Arc::new(field(field_ref(param_name.clone()), field_name).build()),
        };

        // Build the lambda: param -> param.field
        let lambda_ast = lambda1(param_name.as_str()).body(body_ast).build();

        // Build transform(array, lambda)
        let transform_call = call("transform").arg(child).arg(lambda_ast).build();

        Arc::new(transform_call)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use hamelin_lib::{
        provider::EnvironmentProvider,
        tree::{
            ast::{
                identifier::{Identifier, SimpleIdentifier as AstSimpleIdentifier},
                pipeline::Pipeline,
            },
            builder::{
                add, array, call, field_ref, gt, lambda1, multiply, pipeline, query,
                QueryBuilderWithMain,
            },
        },
        type_check_with_provider,
        types::{array::Array, struct_type::Struct, Type, INT, STRING},
    };
    use pretty_assertions::assert_eq;
    use rstest::rstest;
    use std::sync::Arc;

    #[derive(Debug)]
    struct MockProvider;

    impl EnvironmentProvider for MockProvider {
        fn reflect_columns(&self, name: &Identifier) -> anyhow::Result<Struct> {
            let events: Identifier = AstSimpleIdentifier::new("events").into();

            if name == &events {
                Ok(Struct::default()
                    .with_str("x", INT)
                    .with_str("s", STRING)
                    .with_str("arr_col", Array::new(INT).into()))
            } else {
                anyhow::bail!("Table not found: {}", name)
            }
        }

        fn reflect_datasets(&self) -> anyhow::Result<Vec<Identifier>> {
            Ok(vec![])
        }
    }

    fn typed_pipeline(builder: QueryBuilderWithMain) -> Arc<TypedPipeline> {
        let result = type_check_with_provider(builder.build(), Arc::new(MockProvider));
        let statement = result
            .into_result()
            .expect("test fixture should type-check cleanly");
        statement.pipeline.clone()
    }

    fn make_ctx() -> StatementTranslationContext {
        StatementTranslationContext::new(
            Arc::new(hamelin_lib::func::registry::FunctionRegistry::default()),
            Arc::new(MockProvider),
        )
    }

    /// Base schema from events table: x, s, arr_col
    fn base_schema() -> Struct {
        Struct::default()
            .with_str("x", INT)
            .with_str("s", STRING)
            .with_str("arr_col", Array::new(INT).into())
    }

    /// Schema with new field prepended (SET adds fields at beginning)
    fn schema_with_set(field: &str, typ: Type) -> Struct {
        Struct::default()
            .with_str(field, typ)
            .with_str("x", INT)
            .with_str("s", STRING)
            .with_str("arr_col", Array::new(INT).into())
    }

    #[rstest]
    // Case 1: No broadcast - passes through unchanged
    #[case::no_broadcast_passthrough(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("y", add(field_ref("x"), 1)))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("y", add(field_ref("x"), 1)))
            .build(),
        schema_with_set("y", INT)
    )]
    // Case 2: Simple binary broadcast on left: [1,2,3] * 10
    // The lambda body preserves the BinaryOperator AST structure
    #[case::left_broadcast(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", multiply(array().element(1).element(2).element(3), 10)))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", call("transform")
                .arg(array().element(1).element(2).element(3))
                .arg(lambda1("__broadcast_0").body(multiply(field_ref("__broadcast_0"), 10)))))
            .build(),
        schema_with_set("arr", Array::new(INT).into())
    )]
    // Case 3: Binary broadcast on right: 10 * [1,2,3]
    #[case::right_broadcast(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", multiply(10, array().element(1).element(2).element(3))))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", call("transform")
                .arg(array().element(1).element(2).element(3))
                .arg(lambda1("__broadcast_0").body(multiply(10, field_ref("__broadcast_0"))))))
            .build(),
        schema_with_set("arr", Array::new(INT).into())
    )]
    // Case 4: Function broadcast: upper(["a","b"])
    #[case::function_broadcast(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", call("upper").arg(array().element("a").element("b"))))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", call("transform")
                .arg(array().element("a").element("b"))
                .arg(lambda1("__broadcast_0").body(call("upper").arg(field_ref("__broadcast_0"))))))
            .build(),
        schema_with_set("arr", Array::new(STRING).into())
    )]
    // Case 5: Two separate broadcasts in same command
    #[case::two_broadcasts_same_command(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l
                .named_field("a", add(array().element(1).element(2), 5))
                .named_field("b", multiply(array().element(10).element(20), 2)))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l
                .named_field("a", call("transform")
                    .arg(array().element(1).element(2))
                    .arg(lambda1("__broadcast_0").body(add(field_ref("__broadcast_0"), 5))))
                .named_field("b", call("transform")
                    .arg(array().element(10).element(20))
                    .arg(lambda1("__broadcast_1").body(multiply(field_ref("__broadcast_1"), 2)))))
            .build(),
        // Two fields prepended: a first, then b
        Struct::default()
            .with_str("a", Array::new(INT).into())
            .with_str("b", Array::new(INT).into())
            .with_str("x", INT)
            .with_str("s", STRING)
            .with_str("arr_col", Array::new(INT).into())
    )]
    // Case 6: Broadcast over column reference (not literal array)
    // arr_col * 10 where arr_col is Array<Int> from table
    #[case::broadcast_over_column(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("result", multiply(field_ref("arr_col"), 10)))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("result", call("transform")
                .arg(field_ref("arr_col"))
                .arg(lambda1("__broadcast_0").body(multiply(field_ref("__broadcast_0"), 10)))))
            .build(),
        schema_with_set("result", Array::new(INT).into())
    )]
    // Case 7: Broadcast nested inside a non-broadcasting outer expression
    // coalesce(upper(["a","b"]), ["default"]) - the upper broadcasts, coalesce does not
    // Note: coalesce with two Array<String> args doesn't broadcast, just returns first non-null
    #[case::broadcast_nested_in_coalesce(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", call("coalesce")
                .arg(call("upper").arg(array().element("a").element("b")))
                .arg(array().element("default"))))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("arr", call("coalesce")
                .arg(call("transform")
                    .arg(array().element("a").element("b"))
                    .arg(lambda1("__broadcast_0").body(call("upper").arg(field_ref("__broadcast_0")))))
                .arg(array().element("default"))))
            .build(),
        schema_with_set("arr", Array::new(STRING).into())
    )]
    // Case 8: Broadcast in WHERE command (not just SET)
    // WHERE len(arr_col * 10) > 0 - broadcast inside WHERE, result used in comparison
    // The arr_col * 10 broadcasts, len takes the array, then > 0 is a scalar comparison
    #[case::broadcast_in_where(
        pipeline()
            .from(|f| f.table_reference("events"))
            .where_cmd(gt(call("len").arg(multiply(field_ref("arr_col"), 10)), 0))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .where_cmd(gt(
                call("len").arg(
                    call("transform")
                        .arg(field_ref("arr_col"))
                        .arg(lambda1("__broadcast_0").body(multiply(field_ref("__broadcast_0"), 10)))),
                0))
            .build(),
        // WHERE doesn't add fields
        base_schema()
    )]
    // Case 9: Multiple commands with broadcasts - counter increments across commands
    #[case::broadcasts_across_commands(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("a", multiply(array().element(1).element(2), 5)))
            .set_cmd(|l| l.named_field("b", add(array().element(10).element(20), 3)))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("a", call("transform")
                .arg(array().element(1).element(2))
                .arg(lambda1("__broadcast_0").body(multiply(field_ref("__broadcast_0"), 5)))))
            .set_cmd(|l| l.named_field("b", call("transform")
                .arg(array().element(10).element(20))
                .arg(lambda1("__broadcast_1").body(add(field_ref("__broadcast_1"), 3)))))
            .build(),
        // First SET adds "a", second SET adds "b" at beginning
        Struct::default()
            .with_str("b", Array::new(INT).into())
            .with_str("a", Array::new(INT).into())
            .with_str("x", INT)
            .with_str("s", STRING)
            .with_str("arr_col", Array::new(INT).into())
    )]
    // Case 10: Name collision - input has column named __broadcast_0
    // The generator now skips existing names, so it will use __broadcast_1 instead.
    #[case::name_collision_avoided(
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("__broadcast_0", 42))  // Create column with generated name
            .set_cmd(|l| l.named_field("result", multiply(field_ref("arr_col"), 10)))
            .build(),
        pipeline()
            .from(|f| f.table_reference("events"))
            .set_cmd(|l| l.named_field("__broadcast_0", 42))
            .set_cmd(|l| l.named_field("result", call("transform")
                .arg(field_ref("arr_col"))
                // Generator skips __broadcast_0 (exists) and uses __broadcast_1
                .arg(lambda1("__broadcast_1").body(multiply(field_ref("__broadcast_1"), 10)))))
            .build(),
        // __broadcast_0 added first, then result
        Struct::default()
            .with_str("result", Array::new(INT).into())
            .with_str("__broadcast_0", INT)
            .with_str("x", INT)
            .with_str("s", STRING)
            .with_str("arr_col", Array::new(INT).into())
    )]
    fn test_lower_broadcast_apply(
        #[case] input: Pipeline,
        #[case] expected: Pipeline,
        #[case] expected_output_schema: Struct,
    ) -> Result<(), Arc<TranslationError>> {
        let input_typed = typed_pipeline(query().main(input));
        let expected_typed = typed_pipeline(query().main(expected));

        let mut ctx = make_ctx();
        let result = lower_broadcast_apply(input_typed, &mut ctx)?;

        assert_eq!(result.ast, expected_typed.ast);
        assert_eq!(
            result.environment().as_struct().clone(),
            expected_output_schema
        );
        Ok(())
    }
}