assert-struct-macros 0.4.2

Procedural macro implementation for assert-struct
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
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
mod nodes;

use crate::AssertStruct;
use crate::pattern::{
    ComparisonOp, FieldAssertion, FieldOperation, Pattern, PatternClosure, PatternComparison,
    PatternEnum, PatternMap, PatternRange, PatternSet, PatternSimple, PatternSlice, PatternString,
    PatternStruct, PatternTuple, PatternWildcard, TupleElement,
};
#[cfg(feature = "regex")]
use crate::pattern::{PatternLike, PatternRegex};
use proc_macro2::{Ident, Span, TokenStream};
use quote::{quote, quote_spanned};
use std::collections::HashSet;
use syn::{Token, punctuated::Punctuated, spanned::Spanned};

use nodes::{expand_pattern_node_ident, generate_pattern_nodes};

pub fn expand(assert: &AssertStruct) -> TokenStream {
    let value = &assert.value;
    let pattern = &assert.pattern;

    // Generate pattern nodes using the node IDs from the patterns
    let mut node_defs = Vec::new();
    let root_ref = generate_pattern_nodes(pattern, &mut node_defs, None);

    // Generate static declarations for all nodes
    let node_constants: Vec<TokenStream> = node_defs
        .iter()
        .map(|(id, def)| {
            let ident = Ident::new(&format!("__PATTERN_NODE_{}", id), Span::call_site());
            quote! {
                static #ident: ::assert_struct::__macro_support::PatternNode = #def;
            }
        })
        .collect();

    let assertion = expand_pattern_assertion(&quote! { #value }, pattern);

    // Wrap in a block to avoid variable name conflicts
    quote! {
        {
            // Suppress clippy warnings that are expected in macro-generated code
            #[allow(unused_assignments, clippy::neg_cmp_op_on_partial_ord, clippy::op_ref, clippy::zero_prefixed_literal, clippy::bool_comparison, clippy::redundant_pattern_matching, clippy::useless_asref)]
            let __assert_struct_result = {
                use std::convert::AsRef;

                // Generate all node constants
                #(#node_constants)*

                // Store the pattern tree root
                const __PATTERN_TREE: &::assert_struct::__macro_support::PatternNode = &#root_ref;

                // Create error report. Both values are compile-time constants:
                // - CARGO_MANIFEST_DIR: absolute path to this package's root
                // - file!(): path relative to the workspace root
                // Together they let us derive the absolute source path at runtime
                // without relying on the working directory.
                let mut __report = ::assert_struct::__macro_support::ErrorReport::new(
                    ::std::env!("CARGO_MANIFEST_DIR"),
                    ::std::file!(),
                );

                #assertion

                // Check if any errors were collected
                if !__report.is_empty() {
                    panic!("{}", __report);
                }
            };
            __assert_struct_result
        }
    }
}

/// Generate assertion code with error collection instead of immediate panic.
fn expand_pattern_assertion(value_expr: &TokenStream, pattern: &Pattern) -> TokenStream {
    match pattern {
        Pattern::Simple(simple_pattern) => expand_simple_assertion(value_expr, simple_pattern),
        Pattern::String(string_pattern) => expand_string_assertion(value_expr, string_pattern),
        Pattern::Struct(struct_pattern) => expand_struct_assertion(value_expr, struct_pattern),
        Pattern::Comparison(comparison_pattern) => {
            expand_comparison_assertion(value_expr, comparison_pattern)
        }
        Pattern::Enum(enum_pattern) => {
            // Enum tuple variant - use collection version
            expand_enum_assertion(value_expr, enum_pattern)
        }
        Pattern::Tuple(tuple_pattern) => {
            // Plain tuple - use collection version for proper error collection
            expand_tuple_assertion(value_expr, tuple_pattern)
        }
        Pattern::Wildcard(_) => {
            // Wildcard patterns generate no assertions - they just verify the field exists
            // which is already handled by the struct/tuple destructuring
            quote! {}
        }
        Pattern::Range(range_pattern) => {
            // Generate improved range assertion with error collection
            expand_range_assertion(value_expr, range_pattern)
        }
        Pattern::Slice(slice_pattern) => {
            // Generate slice assertion with error collection
            expand_slice_assertion(value_expr, slice_pattern)
        }
        #[cfg(feature = "regex")]
        Pattern::Regex(regex_pattern) => {
            // Generate regex assertion with error collection
            expand_regex_assertion(value_expr, regex_pattern)
        }
        #[cfg(feature = "regex")]
        Pattern::Like(like_pattern) => {
            // Generate Like trait assertion with error collection
            expand_like_assertion(value_expr, like_pattern)
        }
        Pattern::Closure(closure_pattern) => {
            // Generate closure assertion with error collection
            expand_closure_assertion(value_expr, closure_pattern)
        }
        Pattern::Map(map_pattern) => {
            // Generate map assertion with error collection
            expand_map_assertion(value_expr, map_pattern)
        }
        Pattern::Set(set_pattern) => {
            // Generate set assertion with backtracking
            expand_set_assertion(value_expr, set_pattern)
        }
    }
}

/// Generate struct assertion with error collection for multiple field failures
fn expand_struct_assertion(value_expr: &TokenStream, pattern: &PatternStruct) -> TokenStream {
    let struct_path = &pattern.path;
    let fields = &pattern.fields;
    let rest = pattern.rest;

    // If struct_path is None, it's a wildcard pattern - use field access
    let Some(struct_path) = struct_path.as_ref() else {
        return expand_struct_wildcard_assertion(value_expr, fields);
    };

    // For nested field access, we need to collect unique field names only
    // If we have middle.inner.value and middle.count, we only want "middle" once
    let mut unique_field_names = HashSet::new();
    let field_names: Vec<_> = fields
        .iter()
        .filter_map(|f| {
            let field_name = f.operations.root_field_name();
            if unique_field_names.insert(field_name.clone()) {
                Some(field_name)
            } else {
                None
            }
        })
        .collect();

    let rest_pattern = if rest {
        quote! { , .. }
    } else {
        quote! {}
    };

    let field_assertions: Vec<_> = fields
        .iter()
        .map(|f| {
            let field_name = f.operations.root_field_name();

            // Expand the FieldAssertion starting from the bound field name
            let assertion = expand_field_assertion(&quote! { #field_name }, f);

            // Wrap the assertion with the span of the field pattern if available
            if let Some(span) = f.pattern.span() {
                quote_spanned! {span=> #assertion }
            } else {
                assertion
            }
        })
        .collect();

    let span = struct_path.span();

    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", #value_expr)),
        quote!(None),
        pattern.node_id,
    );

    quote_spanned! {span=>
        #[allow(unreachable_patterns)]
        match &#value_expr {
            #struct_path { #(#field_names),* #rest_pattern } => {
                #(#field_assertions)*
            },
            _ => {
                #error_push
            }
        }
    }
}

/// Generate wildcard struct assertion using direct field access
fn expand_struct_wildcard_assertion(
    value_expr: &TokenStream,
    fields: &Punctuated<FieldAssertion, Token![,]>,
) -> TokenStream {
    let field_assertions: Vec<_> = fields
        .iter()
        .map(|f| {
            let field_name = f.operations.root_field_name();
            let field_pattern = &f.pattern;
            let field_operations = &f.operations;

            // Access the field and apply tail operations
            let base_field_access = quote! { (#value_expr).#field_name };

            let expr = if let Some(tail_ops) = field_operations.tail_operations() {
                // Wrap in & to match the reference context expected by apply_field_operations
                // (which adds count+1 dereferences, accounting for one leading &)
                let base_ref = quote! { &#base_field_access };
                apply_field_operations(&base_ref, &tail_ops)
            } else {
                // No additional operations, take a reference to the field for comparison
                quote! { &#base_field_access }
            };

            // Recursively expand the pattern for this field
            expand_pattern_assertion(&expr, field_pattern)
        })
        .collect();

    quote! {
        #(#field_assertions)*
    }
}

/// Expand a FieldAssertion starting from a bound field name
///
/// This assumes the base field (root field name from the FieldOperation) is already bound
/// to `base`. It applies any tail operations and generates the pattern assertion.
///
/// # Parameters
/// - `base`: Expression for the bound field (e.g., `field_name` or `__tuple_elem_0`)
/// - `field_assertion`: The FieldAssertion to expand
/// - `is_ref_context`: Whether we're in a reference context (from destructuring)
/// - `base_field_path`: The field path up to the base field
fn expand_field_assertion(base: &TokenStream, field_assertion: &FieldAssertion) -> TokenStream {
    let field_operations = &field_assertion.operations;
    let field_pattern = &field_assertion.pattern;

    // Apply tail operations and determine final reference context
    let expr = if let Some(tail_ops) = field_operations.tail_operations() {
        apply_field_operations(base, &tail_ops)
    } else {
        base.clone()
    };

    // Generate the pattern assertion
    expand_pattern_assertion(&expr, field_pattern)
}

/// Apply field operations to a value expression
/// This generates the appropriate dereferencing, method calls, nested field access, index operations, or await
///
/// # Parameters
/// - `base_expr`: The base expression to apply operations to
/// - `operation`: The field operation to apply
/// - `in_ref_context`: Whether we're in a reference context (from destructuring `&value`)
fn apply_field_operations(base_expr: &TokenStream, operation: &FieldOperation) -> TokenStream {
    match operation {
        FieldOperation::Deref { count, span } => {
            let mut expr = base_expr.clone();
            // In reference context, we need one extra dereference
            let total_count = count + 1;
            for _ in 0..total_count {
                expr = quote_spanned! { *span=> *#expr };
            }
            expr
        }
        FieldOperation::Method { name, args, span } => {
            if args.is_empty() {
                quote_spanned! { *span=> #base_expr.#name() }
            } else {
                quote_spanned! { *span=> #base_expr.#name(#(#args),*) }
            }
        }
        FieldOperation::Await { span } => {
            quote_spanned! { *span=> #base_expr.await }
        }
        FieldOperation::NamedField { name, span } => {
            quote_spanned! { *span=> #base_expr.#name }
        }
        FieldOperation::UnnamedField { index, span } => {
            let idx = syn::Index::from(*index);
            quote_spanned! { *span=> #base_expr.#idx }
        }
        FieldOperation::Index { index, span } => {
            quote_spanned! { *span=> #base_expr[#index] }
        }
        FieldOperation::Chained { operations, .. } => {
            let mut expr = base_expr.clone();
            for op in operations {
                expr = apply_field_operations(&expr, op);
            }
            expr
        }
    }
}

/// Helper function to process tuple elements and generate match patterns and assertions.
///
/// This function handles the common pattern of iterating through elements and:
/// - Creating `_` patterns for wildcards (which need no assertions)
/// - Creating named bindings for other patterns and generating their assertions
/// - Handling field operations like dereferencing
///
/// # Parameters
/// - `elements`: The tuple elements to process (can be positional or indexed)
/// - `prefix`: Prefix for generated binding names (e.g., "__elem_", "__tuple_elem_")
/// - `is_ref`: Whether the bindings are already references
/// - `field_path`: Path components for error messages
///
/// # Returns
/// A tuple of (match_patterns, assertions) where:
/// - `match_patterns`: TokenStreams for use in match arms or destructuring
/// - `assertions`: TokenStreams for the generated assertion code
fn process_tuple_elements(
    elements: &[TupleElement],
    prefix: &str,
) -> (Vec<TokenStream>, Vec<TokenStream>) {
    let mut match_patterns = Vec::new();
    let mut assertions = Vec::new();

    for (i, tuple_element) in elements.iter().enumerate() {
        match tuple_element {
            TupleElement::Positional(pattern) => {
                match &**pattern {
                    Pattern::Wildcard(PatternWildcard { .. }) => {
                        // Wildcard patterns use `_` in the match pattern
                        match_patterns.push(quote! { _ });
                    }
                    _ => {
                        // Non-wildcard patterns need a binding and assertion
                        let name = quote::format_ident!("{}{}", prefix, i);
                        match_patterns.push(quote! { #name });

                        // Generate assertion with error collection
                        let assertion = expand_pattern_assertion(&quote! { #name }, pattern);
                        assertions.push(assertion);
                    }
                }
            }
            TupleElement::Indexed(boxed_elem) => {
                let pattern = &boxed_elem.pattern;

                match pattern {
                    Pattern::Wildcard(PatternWildcard { .. }) => {
                        // Wildcard patterns use `_` in the match pattern
                        match_patterns.push(quote! { _ });
                    }
                    _ => {
                        // Non-wildcard patterns need a binding and assertion
                        let name = quote::format_ident!("{}{}", prefix, i);
                        match_patterns.push(quote! { #name });

                        // Expand the indexed FieldAssertion starting from the bound element name
                        let assertion = expand_field_assertion(&quote! { #name }, boxed_elem);
                        assertions.push(assertion);
                    }
                }
            }
        }
    }

    (match_patterns, assertions)
}

/// Generate assertion for plain tuples with error collection.
/// Uses match expressions for consistency with enum tuple handling.
fn expand_tuple_assertion(value_expr: &TokenStream, pattern: &PatternTuple) -> TokenStream {
    let elements = &pattern.elements;
    // Use helper to process elements with collection strategy
    let (match_patterns, element_assertions) = process_tuple_elements(elements, "__tuple_elem_");

    quote! {
        #[allow(unreachable_patterns)]
        match #value_expr {
            (#(#match_patterns),*) => {
                #(#element_assertions)*
            },
            _ => unreachable!("Plain tuple match should always succeed"),
        }
    }
}

// Check if a path refers to Option::Some

/// Generate comparison assertion with error collection
fn expand_comparison_assertion(
    value_expr: &TokenStream,
    pattern: &PatternComparison,
) -> TokenStream {
    let op = &pattern.op;
    let expected = &pattern.expr;

    let span = expected.span();

    let comparison = {
        // For index operations, avoid references on both sides
        match &pattern.op {
            ComparisonOp::Less(_) => quote_spanned! {span=> (#value_expr).lt(&(#expected)) },
            ComparisonOp::LessEqual(_) => quote_spanned! {span=> (#value_expr).le(&(#expected)) },
            ComparisonOp::Greater(_) => quote_spanned! {span=> (#value_expr).gt(&(#expected)) },
            ComparisonOp::GreaterEqual(_) => {
                quote_spanned! {span=> (#value_expr).ge(&(#expected)) }
            }
            ComparisonOp::Equal(_) => quote_spanned! {span=> (#value_expr).eq(&(#expected)) },
            ComparisonOp::NotEqual(_) => quote_spanned! {span=> (#value_expr).ne(&(#expected)) },
        }
    };

    let expected_value = if matches!(op, ComparisonOp::Equal(_)) {
        let expected_str = quote! { #expected }.to_string();
        quote!(Some(#expected_str.to_string()))
    } else {
        quote!(None)
    };

    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", #value_expr)),
        expected_value,
        pattern.node_id,
    );

    quote_spanned! {span=>
        #[allow(clippy::nonminimal_bool)]
        if !(#comparison) {
            #error_push
        }
    }
}

/// Generate assertion for enum tuple variants with error collection
fn expand_enum_assertion(value_expr: &TokenStream, pattern: &PatternEnum) -> TokenStream {
    let variant_path = &pattern.path;
    let elements = &pattern.elements;
    let span = variant_path.span();

    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", #value_expr)),
        quote!(None),
        pattern.node_id,
    );

    // Special handling for unit variants (empty elements)
    if elements.is_empty() {
        quote_spanned! {span=>
            if !matches!(#value_expr, #variant_path) {
                #error_push
            }
        }
    } else {
        // Use helper to process elements with appropriate path
        let (match_patterns, element_assertions) = process_tuple_elements(elements, "__elem_");

        quote_spanned! {span=>
            #[allow(unreachable_patterns)]
            match &#value_expr {
                #variant_path(#(#match_patterns),*) => {
                    #(#element_assertions)*
                },
                _ => {
                    #error_push
                }
            }
        }
    }
}

/// Generate range assertion with error collection
fn expand_range_assertion(value_expr: &TokenStream, pattern: &PatternRange) -> TokenStream {
    let range = &pattern.expr;

    let span = range.span();
    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", #value_expr)),
        quote!(None),
        pattern.node_id,
    );

    quote_spanned! {span=>
        match &#value_expr {
            #range => {},
            _ => {
                #error_push
            }
        }
    }
}

/// Generate string literal assertion with error collection
/// String literals always use .as_ref() to handle String/&str matching
fn expand_string_assertion(value_expr: &TokenStream, pattern: &PatternString) -> TokenStream {
    let lit = &pattern.lit;

    // String patterns always use .as_ref() to handle String/&str matching
    let span = lit.span();
    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", actual)),
        quote!(None),
        pattern.node_id,
    );

    quote_spanned! {span=> {
        // Take a reference to the expression result so that:
        // 1. Temporaries (e.g. from method calls returning String) live for the
        //    entire block - fixes E0716 "temporary dropped while borrowed".
        // 2. Reference-typed expressions (e.g. from index operations) are not
        //    moved - fixes E0507 "cannot move out of shared reference".
        let __assert_struct_tmp = &#value_expr;
        let actual = (*__assert_struct_tmp).as_ref();
        if !matches!(actual, #lit) {
            #error_push
        }
    }}
}

/// Generate simple assertion with error collection
fn expand_simple_assertion(actual: &TokenStream, pattern: &PatternSimple) -> TokenStream {
    let expected = &pattern.expr;
    let span = expected.span();
    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", #actual)),
        quote!(None),
        pattern.node_id,
    );

    quote_spanned! {span=>
        if !matches!(#actual, #expected) {
            #error_push
        }
    }
}

/// Generate slice assertion with error collection
fn expand_slice_assertion(value_expr: &TokenStream, pattern: &PatternSlice) -> TokenStream {
    let mut pattern_parts = Vec::new();
    let mut bindings_and_assertions = Vec::new();

    for (i, elem) in pattern.elements.iter().enumerate() {
        match elem {
            Pattern::Range(PatternRange {
                expr: syn::Expr::Range(r),
                ..
            }) if r.start.is_none() && r.end.is_none() => {
                // RangeFull (..) in slice context is a rest pattern
                pattern_parts.push(quote! { .. });
            }
            Pattern::Wildcard(PatternWildcard { .. }) => {
                // Wildcard pattern matches any single element without binding
                pattern_parts.push(quote! { _ });
            }
            _ => {
                let binding = quote::format_ident!("__elem_{}", i);
                pattern_parts.push(quote! { #binding });

                let assertion = expand_pattern_assertion(&quote! { #binding }, elem);
                bindings_and_assertions.push(assertion);
            }
        }
    }

    // Convert Vec to slice for matching
    let slice_expr = quote! { (#value_expr).as_slice() };

    let error_push = generate_error_push(
        proc_macro2::Span::call_site(),
        quote!(format!("{:?}", &#value_expr)),
        quote!(None),
        pattern.node_id,
    );

    quote! {
        match #slice_expr {
            [#(#pattern_parts),*] => {
                #(#bindings_and_assertions)*
            }
            _ => {
                #error_push
            }
        }
    }
}

#[cfg(feature = "regex")]
/// Generate regex assertion with error collection
fn expand_regex_assertion(value_expr: &TokenStream, pattern: &PatternRegex) -> TokenStream {
    let pattern_str = &pattern.pattern;
    let span = pattern.span;

    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", #value_expr)),
        quote!(None),
        pattern.node_id,
    );

    quote_spanned! {span=>
        {
            use ::assert_struct::Like;
            let re = ::assert_struct::__macro_support::Regex::new(#pattern_str)
                .expect(concat!("Invalid regex pattern: ", #pattern_str));
            if !#value_expr.like(&re) {
                #error_push
            }
        }
    }
}

#[cfg(feature = "regex")]
/// Generate Like trait assertion with error collection
fn expand_like_assertion(value_expr: &TokenStream, pattern: &PatternLike) -> TokenStream {
    let pattern_expr = &pattern.expr;

    let span = pattern_expr.span();
    let actual_value = quote!(format!("{:?}", #value_expr));

    let error_push = generate_error_push(span, actual_value, quote!(None), pattern.node_id);

    quote_spanned! {span=>
        {
            use ::assert_struct::Like;
            if !#value_expr.like(&#pattern_expr) {
                #error_push
            }
        }
    }
}

/// Generate closure assertion with error collection
fn expand_closure_assertion(value_expr: &TokenStream, pattern: &PatternClosure) -> TokenStream {
    let closure = &pattern.closure;
    let span = closure.span();

    let error_push = generate_error_push(
        span,
        quote!(format!("{:?}", #value_expr)),
        quote!(None),
        pattern.node_id,
    );

    quote_spanned! {span=>
        {
            if !::assert_struct::__macro_support::check_closure_condition(#value_expr, #closure) {
                #error_push
            }
        }
    }
}

/// Generate map assertion with error collection using duck typing
/// Assumes map types have len() -> usize and get(&K) -> Option<&V> methods
fn expand_map_assertion(value_expr: &TokenStream, pattern: &PatternMap) -> TokenStream {
    let entries = &pattern.entries;
    let rest = pattern.rest;

    // Use span from first entry or default span if empty
    let map_span = entries
        .first()
        .map(|(key, _)| key.span())
        .unwrap_or_else(proc_macro2::Span::call_site);

    // Generate length check assertion for exact matching (when no rest pattern)
    let len_check = if !rest {
        let expected_len = entries.len();
        let error_push = generate_error_push(
            map_span,
            quote!(format!("map with {} entries", (#value_expr).len())),
            quote!(Some(format!("{} entries", #expected_len))),
            pattern.node_id,
        );
        quote_spanned! {map_span=>
            // Check exact length for maps without rest pattern
            if (#value_expr).len() != #expected_len {
                #error_push
            }
        }
    } else {
        quote! {}
    };

    // Generate key-value assertions
    let key_value_assertions: Vec<TokenStream> = entries
        .iter()
        .map(|(key, value_pattern)| {
            let key_str = quote! { #key }.to_string();

            let span = key.span();
            let pattern_assertion =
                expand_pattern_assertion(&quote! { __map_value }, value_pattern);

            let missing_key_error = generate_error_push(
                span,
                quote!("missing key".to_string()),
                quote!(Some(format!("key present: {}", #key_str))),
                pattern.node_id,
            );

            // Handle different key types for duck typing
            let get_expr = if matches!(
                key,
                syn::Expr::Lit(syn::ExprLit {
                    lit: syn::Lit::Str(_),
                    ..
                })
            ) {
                // For string literals, convert to String to match HashMap<String, V>
                quote_spanned! {span=> (#value_expr).get(&(#key).to_string()) }
            } else {
                // For other expressions, try as-is
                quote_spanned! {span=> (#value_expr).get(&#key) }
            };

            quote_spanned! {span=>
                // Check if key exists and apply pattern to the value
                match #get_expr {
                    Some(__map_value) => {
                        // Apply pattern assertion to the value
                        #pattern_assertion
                    }
                    None => {
                        #missing_key_error
                    }
                }
            }
        })
        .collect();

    quote! {
        #len_check
        #(#key_value_assertions)*
    }
}

/// Generate set assertion using backtracking to match patterns in any order.
///
/// Each element pattern becomes a predicate closure that shadows `__report` with a
/// probe report, allowing the existing assertion code to be reused unchanged. The
/// runtime `set_match` function owns the length check and backtracking algorithm.
fn expand_set_assertion(value_expr: &TokenStream, pattern: &PatternSet) -> TokenStream {
    let elements = &pattern.elements;
    let rest = pattern.rest;
    let node_ident = expand_pattern_node_ident(pattern.node_id);

    // Generate one named predicate binding per element pattern.
    // Each closure:
    //   1. Looks up the element by index from __set_coll (captured by ref)
    //   2. Shadows __report with a fresh probe report
    //   3. Runs the generated assertion (which writes to the local __report)
    //   4. Returns true iff no errors were pushed (i.e. the pattern matched)
    let pred_names: Vec<_> = (0..elements.len())
        .map(|i| quote::format_ident!("__set_pred_{}", i))
        .collect();

    let pred_defs: Vec<TokenStream> = elements
        .iter()
        .zip(pred_names.iter())
        .map(|(elem, name)| {
            let assertion = expand_pattern_assertion(&quote! { __set_elem }, elem);
            quote! {
                let #name = |__set_idx: usize| -> bool {
                    let __set_elem = __set_coll[__set_idx];
                    #[allow(unused_mut)]
                    let mut __report = ::assert_struct::__macro_support::ErrorReport::new_probe();
                    #assertion
                    __report.is_empty()
                };
            }
        })
        .collect();

    quote! {
        {
            let __set_coll: ::std::vec::Vec<_> = (&(#value_expr)).into_iter().collect();
            #(#pred_defs)*
            let __set_preds: &[&dyn ::std::ops::Fn(usize) -> bool] = &[#(&#pred_names),*];
            ::assert_struct::__macro_support::set_match(
                __set_coll.len(),
                #rest,
                __set_preds,
                &mut __report,
                &#node_ident,
            );
        }
    }
}

/// Generate the error context creation and push code
fn generate_error_push(
    span: proc_macro2::Span,
    actual_value: TokenStream,
    expected_value: TokenStream,
    node_id: usize,
) -> TokenStream {
    let node_ident = expand_pattern_node_ident(node_id);
    quote_spanned! {span=>
        __report.push(&#node_ident, #actual_value, #expected_value);
    }
}