zirql 0.1.0

Bounded native query programs and nominal/keyed value comprehensions
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
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
//! Shared patterns for lets, parameters, predicates, generators and value matches.
use super::execution::{Data, Host, NativeStep, Value};
use super::*;

pub type Pattern = Located<PatternKind>;
type BindingFacts<'a> = Vec<(&'a Located<String>, Vec<ValueType>)>;
type PatternBindings<'a, N, K> = Vec<(&'a str, Value<'a, N, K>)>;

/// Tuples require exact arity. Lists require exact length unless `ignore_rest`
/// discards a final remainder. Records inspect stored fields. `ignore_rest` permits other labels;
/// it never creates a rest value. Native structure requires an explicit host view.
#[derive(Debug, PartialEq)]
pub enum PatternKind {
    Name(Located<String>),
    Wildcard,
    Tuple(Vec<Pattern>),
    /// Positional list; a final discarded remainder accepts a longer list.
    List {
        elements: Vec<Pattern>,
        ignore_rest: bool,
    },
    Record {
        fields: Vec<(Located<String>, Pattern)>,
        ignore_rest: bool,
    },
    Literal(ConstructedValue),
    Present(Box<Pattern>),
    Absent,
}

#[derive(Clone, Copy)]
pub(crate) enum PatternRef<'a> {
    Name(&'a Located<String>),
    Pattern(&'a Pattern),
}
impl<'a> PatternRef<'a> {
    pub fn range(self) -> &'a std::ops::Range<usize> {
        match self {
            Self::Name(n) => &n.range,
            Self::Pattern(p) => &p.range,
        }
    }
}

pub(crate) fn names<'a>(
    pattern: &'a Pattern,
    result: &mut Vec<&'a str>,
    budget: &mut Budget,
) -> Result<(), QueryError> {
    for (name, _) in facts(pattern, &[ValueType::Unestablished], budget)? {
        push_metadata(
            result,
            name.value.as_str(),
            budget,
            &Location::Query(name.range.clone()),
        )?;
    }
    Ok(())
}

/// Read bound names in written pattern order, borrowing their original ranges.
/// Validation and metadata allocations share the active allowance. No value is
/// matched and no native structure is inspected.
///
/// # Errors
/// Invalid pattern literals/fields, nesting and metadata limits are located.
/// The lexical owner still checks duplicate names and outer-scope collisions.
pub fn pattern_names<'a>(
    pattern: &'a Pattern,
    budget: &mut Budget,
) -> Result<Vec<&'a Located<String>>, QueryError> {
    let mut names = Vec::new();
    for (name, _) in facts(pattern, &[ValueType::Unestablished], budget)? {
        push_metadata(
            &mut names,
            name,
            budget,
            &Location::Query(name.range.clone()),
        )?;
    }
    Ok(names)
}

pub(crate) fn facts<'a>(
    pattern: &'a Pattern,
    types: &[ValueType],
    budget: &mut Budget,
) -> Result<BindingFacts<'a>, QueryError> {
    binding_facts(pattern, types, false, budget)
}

pub(crate) fn required_facts<'a>(
    pattern: &'a Pattern,
    types: &[ValueType],
    budget: &mut Budget,
) -> Result<BindingFacts<'a>, QueryError> {
    binding_facts(pattern, types, true, budget)
}

fn binding_facts<'a>(
    pattern: &'a Pattern,
    types: &[ValueType],
    required: bool,
    budget: &mut Budget,
) -> Result<BindingFacts<'a>, QueryError> {
    let location = Location::Query(pattern.range.clone());
    budget.within_evaluation(1, location.clone(), |budget| {
        budget.charge(1, location.clone())?;
        if required
            && matches!(
                pattern.value,
                PatternKind::Tuple(_) | PatternKind::List { .. } | PatternKind::Record { .. }
            )
        {
            for ty in types {
                let ty = shape_type(copy_type(ty, budget, &location)?, budget, &location)?;
                let compatible = matches!(ty, ValueType::Unestablished)
                    || matches!(
                        (&pattern.value, &ty),
                        (
                            PatternKind::Tuple(_),
                            ValueType::Tuple(_) | ValueType::TupleKind
                        ) | (
                            PatternKind::List { .. },
                            ValueType::Array(_) | ValueType::ArrayKind(_)
                        ) | (
                            PatternKind::Record { .. },
                            ValueType::Record(_) | ValueType::RecordKind
                        )
                    );
                if !compatible {
                    return Err(error(
                        &location,
                        "required pattern has an incompatible subject shape",
                    ));
                }
            }
        }
        let mut result = Vec::new();
        match &pattern.value {
            PatternKind::Name(name) => {
                budget.charge(name.value.len() + 1, Location::Query(name.range.clone()))?;
                if name.value == "_" {
                    return Err(error(&location, "use a wildcard to discard a value"));
                }
                push_metadata(
                    &mut result,
                    (name, copy_types(types, budget, &location)?),
                    budget,
                    &location,
                )?;
            }
            PatternKind::Wildcard | PatternKind::Absent => {}
            PatternKind::Literal(value) => {
                constructed_value_type(value, budget, location.clone())?;
                if !matches!(
                    value,
                    ConstructedValue::Boolean(_)
                        | ConstructedValue::Integer(_)
                        | ConstructedValue::Float(_)
                        | ConstructedValue::String(_)
                        | ConstructedValue::Member(_)
                ) {
                    return Err(error(&location, "literal pattern needs a present scalar"));
                }
            }
            PatternKind::Present(child) => {
                let present = present_types(types, budget, &location)?;
                result = binding_facts(child, &present, required, budget)?;
            }
            PatternKind::Tuple(children) => {
                for (position, child) in children.iter().enumerate() {
                    let child_types = child_facts(types, Some(position), None, budget, &location)?;
                    for binding in binding_facts(child, &child_types, required, budget)? {
                        push_metadata(&mut result, binding, budget, &location)?;
                    }
                }
            }
            PatternKind::List { elements, .. } => {
                for (position, child) in elements.iter().enumerate() {
                    let mut child_types = Vec::new();
                    for ty in types {
                        let ty = shape_type(copy_type(ty, budget, &location)?, budget, &location)?;
                        match ty {
                            ValueType::Array(ArrayType::Positions(children)) => {
                                push_metadata(
                                    &mut child_types,
                                    children
                                        .into_iter()
                                        .nth(position)
                                        .unwrap_or(ValueType::Unestablished),
                                    budget,
                                    &location,
                                )?;
                            }
                            ValueType::Array(ArrayType::Elements(children))
                            | ValueType::ArrayKind(children) => {
                                append_types(&mut child_types, children, budget, &location)?;
                            }
                            _ => push_metadata(
                                &mut child_types,
                                ValueType::Unestablished,
                                budget,
                                &location,
                            )?,
                        }
                    }
                    if child_types.is_empty() {
                        push_metadata(
                            &mut child_types,
                            ValueType::Unestablished,
                            budget,
                            &location,
                        )?;
                    }
                    for binding in binding_facts(child, &child_types, required, budget)? {
                        push_metadata(&mut result, binding, budget, &location)?;
                    }
                }
            }
            PatternKind::Record { fields, .. } => {
                for (index, (label, child)) in fields.iter().enumerate() {
                    budget.charge(label.value.len() + 1, Location::Query(label.range.clone()))?;
                    for (previous, _) in &fields[..index] {
                        budget.charge(
                            1 + previous.value.len().min(label.value.len()),
                            Location::Query(label.range.clone()),
                        )?;
                        if previous.value == label.value {
                            return Err(error(
                                &Location::Query(label.range.clone()),
                                "record pattern field is already defined",
                            ));
                        }
                    }
                    let child_types =
                        child_facts(types, None, Some(&label.value), budget, &location)?;
                    for binding in binding_facts(child, &child_types, required, budget)? {
                        push_metadata(&mut result, binding, budget, &location)?;
                    }
                }
            }
        }
        // Name conflicts are checked by the lexical owner, including names in
        // separate parameters. Admit the collected metadata before growth above.
        Ok(result)
    })
}

pub(crate) fn present_types(
    types: &[ValueType],
    budget: &mut Budget,
    location: &Location,
) -> Result<Vec<ValueType>, QueryError> {
    let mut present = Vec::new();
    for ty in types {
        let ty = match copy_type(ty, budget, location)? {
            ValueType::Absent => continue,
            ValueType::Declared {
                actual,
                declaration: DeclaredType::Optional(child),
            } => ValueType::Declared {
                actual: if matches!(actual.as_ref(), ValueType::Absent) {
                    Box::new(ValueType::Unestablished)
                } else {
                    actual
                },
                declaration: *child,
            },
            other => other,
        };
        push_metadata(&mut present, ty, budget, location)?;
    }
    if present.is_empty() {
        push_metadata(&mut present, ValueType::Unestablished, budget, location)?;
    }
    Ok(present)
}

fn child_facts(
    types: &[ValueType],
    position: Option<usize>,
    label: Option<&str>,
    budget: &mut Budget,
    location: &Location,
) -> Result<Vec<ValueType>, QueryError> {
    let mut result = Vec::new();
    for ty in types {
        let ty = shape_type(copy_type(ty, budget, location)?, budget, location)?;
        let child = match (&ty, position, label) {
            (ValueType::Tuple(children), Some(i), _) => children.get(i),
            (ValueType::Record(fields), _, Some(label)) => {
                let mut child = None;
                for (name, ty) in fields {
                    budget.charge(1 + name.len().min(label.len()), location.clone())?;
                    if name == label {
                        child = Some(ty);
                        break;
                    }
                }
                child
            }
            _ => None,
        };
        push_metadata(
            &mut result,
            match child {
                Some(ty) => copy_type(ty, budget, location)?,
                None => ValueType::Unestablished,
            },
            budget,
            location,
        )?;
    }
    if result.is_empty() {
        push_metadata(&mut result, ValueType::Unestablished, budget, location)?;
    }
    Ok(result)
}

/// Stage all names before the caller changes its lexical slots. Ordinary shape,
/// literal and presence mismatches are separate from host/admission/work errors.
#[expect(
    clippy::type_complexity,
    reason = "Staged bindings retain the adapter native value, contract kind and error types"
)]
pub(crate) fn bind<'a, Q, H: Host<'a, Q> + ?Sized>(
    pattern: PatternRef<'a>,
    value: Value<'a, H::Native, H::Kind>,
    host: &mut H,
    budget: &mut Budget,
) -> Result<Option<PatternBindings<'a, H::Native, H::Kind>>, H::Error> {
    let location = Location::Query(pattern.range().clone());
    let mut pending = metadata_vec(1, budget, &location)?;
    pending.push((pattern, value));
    let mut bindings = Vec::new();
    while let Some((pattern, mut value)) = pending.pop() {
        let location = Location::Query(pattern.range().clone());
        budget.charge(1, location.clone())?;
        let pattern = match pattern {
            PatternRef::Name(name) => {
                push_metadata(
                    &mut bindings,
                    (name.value.as_str(), value),
                    budget,
                    &location,
                )?;
                continue;
            }
            PatternRef::Pattern(pattern) => pattern,
        };
        match &pattern.value {
            PatternKind::Name(name) => push_metadata(
                &mut bindings,
                (name.value.as_str(), value),
                budget,
                &location,
            )?,
            PatternKind::Wildcard => {}
            PatternKind::Absent | PatternKind::Present(_) => {
                let present = host.occurs(&value, budget, &location)?;
                match &pattern.value {
                    PatternKind::Absent if present => return Ok(None),
                    PatternKind::Present(child) if present => {
                        if let Some(DeclaredType::Optional(inner)) = value.contract {
                            value.contract = Some(inner);
                        }
                        let declaration = if matches!(value.data, Data::Native(_)) {
                            host.constructed(&value, budget, &location)?
                                .and_then(|v| v.declaration)
                                .map(underlying)
                                .map(|d| copy_declaration(d, budget, &location))
                                .transpose()?
                        } else {
                            None
                        };
                        match &mut value.data {
                            Data::Constructed(_) => {
                                let Data::Constructed(data) = value.data else {
                                    unreachable!()
                                };
                                value.data =
                                    Data::Constructed(data.into_present(budget, &location)?);
                            }
                            Data::Native(view) => {
                                if let Some(d) = declaration {
                                    view.retain_declaration(
                                        std::sync::Arc::new(d),
                                        budget,
                                        &location,
                                    )?;
                                }
                            }
                        }
                        push_metadata(
                            &mut pending,
                            (PatternRef::Pattern(child), value),
                            budget,
                            &location,
                        )?;
                    }
                    PatternKind::Present(_) => return Ok(None),
                    _ => {}
                }
            }
            PatternKind::Literal(literal) => {
                let Some(data) = host.constructed(&value, budget, &location)? else {
                    return Ok(None);
                };
                let actual = data.value.data();
                let compatible = matches!(
                    (literal, actual),
                    (ConstructedValue::Boolean(_), ConstructedValue::Boolean(_))
                        | (ConstructedValue::Integer(_), ConstructedValue::Integer(_))
                        | (ConstructedValue::Float(_), ConstructedValue::Float(_))
                        | (ConstructedValue::String(_), ConstructedValue::String(_))
                ) || matches!((literal, actual), (ConstructedValue::Member(a), ConstructedValue::Member(b)) if a.type_id == b.type_id);
                if !compatible || !equal_values(literal, actual, budget, &location)? {
                    return Ok(None);
                }
            }
            PatternKind::Tuple(children) => {
                let len = match host.constructed(&value, budget, &location)? {
                    Some(data) => match data.value.data() {
                        ConstructedValue::Tuple(v) => Some(v.len()),
                        _ => None,
                    },
                    None => {
                        let Data::Native(view) = &value.data else {
                            unreachable!()
                        };
                        host.native_tuple(host.native_data(view, budget, &location)?)
                            .map(<[_]>::len)
                    }
                };
                if len != Some(children.len()) {
                    return Ok(None);
                }
                for (index, child) in children.iter().enumerate().rev() {
                    let child_value = select(
                        &mut value,
                        NativeStep::Tuple(index),
                        host,
                        budget,
                        &location,
                    )?;
                    push_metadata(
                        &mut pending,
                        (PatternRef::Pattern(child), child_value),
                        budget,
                        &location,
                    )?;
                }
            }
            PatternKind::List {
                elements,
                ignore_rest,
            } => {
                let len = match host.constructed(&value, budget, &location)? {
                    Some(data) => match data.value.data() {
                        ConstructedValue::Array(values) => Some(values.len()),
                        _ => None,
                    },
                    None => {
                        let Data::Native(view) = &value.data else {
                            unreachable!()
                        };
                        host.native_list(host.native_data(view, budget, &location)?)
                            .map(<[_]>::len)
                    }
                };
                let Some(len) = len else { return Ok(None) };
                if len < elements.len() || (!ignore_rest && len != elements.len()) {
                    return Ok(None);
                }
                for (index, child) in elements.iter().enumerate().rev() {
                    let child_value =
                        select(&mut value, NativeStep::List(index), host, budget, &location)?;
                    push_metadata(
                        &mut pending,
                        (PatternRef::Pattern(child), child_value),
                        budget,
                        &location,
                    )?;
                }
            }
            PatternKind::Record {
                fields,
                ignore_rest,
            } => {
                let len = match host.constructed(&value, budget, &location)? {
                    Some(data) => match data.value.data() {
                        ConstructedValue::Record(v) => Some(v.len()),
                        _ => None,
                    },
                    None => {
                        let Data::Native(view) = &value.data else {
                            unreachable!()
                        };
                        host.native_record(host.native_data(view, budget, &location)?)
                            .map(|r| r.fields.len())
                    }
                };
                let Some(len) = len else {
                    return Ok(None);
                };
                if (!ignore_rest && len != fields.len()) || len < fields.len() {
                    return Ok(None);
                }
                // Select in written order, then push in reverse so bindings have
                // the same slot order as preparation.
                let mut selected = metadata_vec(fields.len(), budget, &location)?;
                for (label, child) in fields {
                    let mut found = None;
                    for index in 0..len {
                        let actual = match host.constructed(&value, budget, &location)? {
                            Some(data) => {
                                let ConstructedValue::Record(fields) = data.value.data() else {
                                    unreachable!()
                                };
                                &fields[index].0
                            }
                            None => {
                                let Data::Native(view) = &value.data else {
                                    unreachable!()
                                };
                                &host
                                    .native_record(host.native_data(view, budget, &location)?)
                                    .expect("record view")
                                    .fields[index]
                                    .0
                            }
                        };
                        budget.charge(
                            1 + actual.len().min(label.value.len()),
                            Location::Query(label.range.clone()),
                        )?;
                        if actual == &label.value {
                            found = Some(index);
                            break;
                        }
                    }
                    let Some(index) = found else {
                        return Ok(None);
                    };
                    selected.push((
                        PatternRef::Pattern(child),
                        select(
                            &mut value,
                            NativeStep::Record(index),
                            host,
                            budget,
                            &location,
                        )?,
                    ));
                }
                for child in selected.into_iter().rev() {
                    push_metadata(&mut pending, child, budget, &location)?;
                }
            }
        }
    }
    Ok(Some(bindings))
}
pub(crate) fn select<'a, Q, H: Host<'a, Q> + ?Sized>(
    value: &mut Value<'a, H::Native, H::Kind>,
    step: NativeStep,
    host: &H,
    budget: &mut Budget,
    location: &Location,
) -> Result<Value<'a, H::Native, H::Kind>, H::Error> {
    let mut contract = value.contract;
    while let Some(DeclaredType::Optional(inner)) = contract {
        contract = Some(inner);
    }
    let contract = match (contract, &step) {
        (Some(DeclaredType::Tuple(children)), NativeStep::Tuple(index)) => children.get(*index),
        (Some(DeclaredType::Array(child) | DeclaredType::Sequence(child)), NativeStep::List(_)) => {
            Some(child.as_ref())
        }
        (Some(DeclaredType::Record(fields)), NativeStep::Record(index)) => {
            let label = match host.constructed(value, budget, location)? {
                Some(data) => {
                    let ConstructedValue::Record(fields) = data.value.data() else {
                        unreachable!()
                    };
                    &fields[*index].0
                }
                None => {
                    let Data::Native(view) = &value.data else {
                        unreachable!()
                    };
                    &host
                        .native_record(host.native_data(view, budget, location)?)
                        .expect("record view")
                        .fields[*index]
                        .0
                }
            };
            Some(record_declaration(fields, label, budget, location)?)
        }
        _ => None,
    };
    let constructed = if matches!(value.data, Data::Native(_)) {
        host.constructed(value, budget, location)?
    } else {
        None
    };
    let is_constructed = constructed.is_some();
    let constructed_child = match constructed {
        Some(data) => data
            .child(step.index(), budget, location)?
            .declaration
            .map(|d| copy_declaration(d, budget, location))
            .transpose()?,
        None => None,
    };
    let data = match &mut value.data {
        Data::Constructed(data) => {
            Data::Constructed(data.pattern_child(step.index(), budget, location)?)
        }
        Data::Native(view) => {
            let mut selected = view.child(
                if is_constructed {
                    NativeStep::Constructed(step.index())
                } else {
                    step
                },
                budget,
                location,
            )?;
            if let Some(d) = constructed_child {
                selected.retain_declaration(std::sync::Arc::new(d), budget, location)?;
            }
            Data::Native(selected)
        }
    };
    Ok(Value { data, contract })
}

/// Copy reusable pattern metadata under the active allowance, retaining every
/// original query range. This never reads or copies a matched native value.
///
/// # Errors
/// Metadata, scalar-copy and nesting limits fail at the original pattern.
pub fn copy_pattern(pattern: &Pattern, budget: &mut Budget) -> Result<Pattern, QueryError> {
    let location = Location::Query(pattern.range.clone());
    budget.within_evaluation(1, location.clone(), |budget| {
        budget.charge(1, location.clone())?;
        budget.charge_results(1, location.clone())?;
        let copy_name = |name: &Located<String>, budget: &mut Budget| {
            budget.charge(name.value.len() + 1, Location::Query(name.range.clone()))?;
            Ok::<_, QueryError>(name.clone())
        };
        let value = match &pattern.value {
            PatternKind::Name(name) => PatternKind::Name(copy_name(name, budget)?),
            PatternKind::Wildcard => PatternKind::Wildcard,
            PatternKind::Absent => PatternKind::Absent,
            PatternKind::Literal(value) => {
                PatternKind::Literal(copy_constructed_value(value, budget, location.clone())?)
            }
            PatternKind::Present(child) => {
                PatternKind::Present(Box::new(copy_pattern(child, budget)?))
            }
            PatternKind::Tuple(children) => {
                let mut copied = Vec::new();
                for child in children {
                    let child = copy_pattern(child, budget)?;
                    push_metadata(&mut copied, child, budget, &location)?;
                }
                PatternKind::Tuple(copied)
            }
            PatternKind::List {
                elements,
                ignore_rest,
            } => {
                let mut copied = metadata_vec(elements.len(), budget, &location)?;
                for child in elements {
                    copied.push(copy_pattern(child, budget)?);
                }
                PatternKind::List {
                    elements: copied,
                    ignore_rest: *ignore_rest,
                }
            }
            PatternKind::Record {
                fields,
                ignore_rest,
            } => {
                let mut copied = Vec::new();
                for (label, child) in fields {
                    let label = copy_name(label, budget)?;
                    let child = copy_pattern(child, budget)?;
                    push_metadata(&mut copied, (label, child), budget, &location)?;
                }
                PatternKind::Record {
                    fields: copied,
                    ignore_rest: *ignore_rest,
                }
            }
        };
        Ok(Located::new(value, pattern.range.clone()))
    })
}

pub fn dispose_pattern(pattern: Pattern) {
    let mut pending = vec![pattern];
    while let Some(pattern) = pending.pop() {
        match pattern.value {
            PatternKind::Tuple(children)
            | PatternKind::List {
                elements: children, ..
            } => pending.extend(children),
            PatternKind::Record { fields, .. } => {
                pending.extend(fields.into_iter().map(|(_, p)| p))
            }
            PatternKind::Present(child) => pending.push(*child),
            PatternKind::Literal(value) => dispose_constructed_value(value),
            PatternKind::Name(_) | PatternKind::Wildcard | PatternKind::Absent => {}
        }
    }
}