batch-impl 0.2.1

A proc-macro library for batch generating trait impls with a powerful DSL
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
use crate::core::recursion::{span_suffix, RecursionGuard};
use crate::core::tuple::*;
use crate::core::types::{display_tokens, err, ImplSpec, ParseResult, PrefixItem, TargetItem};
use crate::core::utils::*;
use crate::core::dash::{split_by_dash, dash_parse_slots_public, dash_append_public};
use proc_macro2::{Delimiter, Span, TokenStream as TokenStream2, TokenTree};
use quote::quote;

// ===========================================================================
// ^ 运算符相关函数
// ===========================================================================

pub fn split_by_caret(tokens: &[TokenTree]) -> Option<(Vec<TokenTree>, Vec<TokenTree>)> {
    split_at_punct(tokens, '^')
}

pub fn parse_prefix_items(tokens: &[TokenTree]) -> Result<Vec<PrefixItem>, String> {
    if tokens.is_empty() {
        return Err("^ 左侧缺少前缀,期望 &, self, Box 等".into());
    }
    if tokens.len() == 1 {
        if let TokenTree::Group(ref g) = tokens[0] {
            if g.delimiter() == Delimiter::Bracket {
                let inner: Vec<TokenTree> = g.stream().into_iter().collect();
                if inner.is_empty() {
                    return Err("^ 左侧 [] 为空,期望前缀列表,如 [&,Box]".into());
                }
                let (segs, d) = split_raw(inner.into_iter().collect(), ',');
                if d > 0 {
                    return Err("^ 左侧 [] 内尖括号不匹配,检查 <> 是否配对".into());
                }
                return segs
                    .iter()
                    .map(|s| parse_single_prefix(&s.clone().into_iter().collect::<Vec<_>>()))
                    .collect();
            }
        }
    }
    Ok(vec![parse_single_prefix(tokens)?])
}

pub fn parse_single_prefix(tokens: &[TokenTree]) -> Result<PrefixItem, String> {
    // 元组生成:() 或 (<bound>) 或 (A,) 或 (A,B)
    // 注意:(A) 无逗号 = 分组,不是元组
    if let [TokenTree::Group(ref g)] = tokens {
        if g.delimiter() == Delimiter::Parenthesis {
            let inner: Vec<TokenTree> = g.stream().into_iter().collect();
            if inner.is_empty() {
                // () = 空元组
                return Ok(PrefixItem::Tuple {
                    elem: None,
                    bound: None,
                });
            }
            if inner.len() >= 2 && matches!(&inner[0], TokenTree::Punct(p) if p.as_char() == '<') {
                // (<bound>)
                let (result, _) = parse_balanced(&inner, 1);
                let bound_tokens = match result {
                    Ok(args) if args.len() == 1 => args.into_iter().next().unwrap(),
                    _ => return Err("元组 bound 格式错误,期望 (<Trait>) 如 (<Clone>)".to_string()),
                };
                return Ok(PrefixItem::Tuple {
                    elem: None,
                    bound: Some(bound_tokens),
                });
            }
            // 检查是否有顶层逗号:有逗号 = 元组 (A,) 或 (A,B),无逗号 = 分组 (A)
            let inner_ts: TokenStream2 = inner.into_iter().collect();
            if has_top_level_char(&inner_ts, ',') {
                // 去掉尾随逗号:(A,) → elem = A,而非 A,
                let trimmed = strip_trailing_comma(inner_ts);
                return Ok(PrefixItem::Tuple {
                    elem: Some(trimmed),
                    bound: None,
                });
            }
            // (A) 无逗号 → 分组,不作为元组前缀,回退到普通匹配
        }
    }
    match tokens {
        [TokenTree::Ident(id)] if id == "self" => Ok(PrefixItem::Self_),
        [TokenTree::Punct(p)] if p.as_char() == '&' => Ok(PrefixItem::Ref),
        [TokenTree::Punct(p), TokenTree::Ident(id)] if p.as_char() == '&' && id == "mut" => {
            Ok(PrefixItem::RefMut)
        }
        // *const 和 *mut
        [TokenTree::Punct(p), TokenTree::Ident(id)] if p.as_char() == '*' && id == "const" => {
            Ok(PrefixItem::ConstPtr)
        }
        [TokenTree::Punct(p), TokenTree::Ident(id)] if p.as_char() == '*' && id == "mut" => {
            Ok(PrefixItem::MutPtr)
        }
        // #[...] 属性
        [TokenTree::Punct(p), TokenTree::Group(g)] if p.as_char() == '#' && g.delimiter() == Delimiter::Bracket => {
            // 存储完整的 #[...] 包括 # 和 [group]
            let mut attr_ts = TokenStream2::new();
            attr_ts.extend(std::iter::once(TokenTree::Punct(proc_macro2::Punct::new('#', proc_macro2::Spacing::Alone))));
            attr_ts.extend(std::iter::once(TokenTree::Group(g.clone())));
            Ok(PrefixItem::Attribute(attr_ts))
        }
        [TokenTree::Ident(id)] if id == "unsafe" => Ok(PrefixItem::Unsafe),
        [TokenTree::Ident(id)] if id == "fn" => Ok(PrefixItem::Fn),
        [TokenTree::Ident(id)] => Ok(PrefixItem::Container {
            name: id.clone(),
            prefill: None,
        }),
        // 容器带预填泛型:Ident<...>,如 HashMap<K>
        [TokenTree::Ident(id), TokenTree::Punct(p), ..] if p.as_char() == '<' => {
            let (result, _) = parse_balanced(tokens, 2);
            let prefill = match result {
                Ok(args) if !args.is_empty() => Some(args),
                _ => return Err(format!("容器 `{}` 的泛型参数解析失败", id)),
            };
            Ok(PrefixItem::Container {
                name: id.clone(),
                prefill,
            })
        }
        // 检测 (T) 无逗号的情况,提示用户加逗号
        [TokenTree::Group(g)] if g.delimiter() == Delimiter::Parenthesis => {
            let inner: Vec<TokenTree> = g.stream().into_iter().collect();
            if inner.len() == 1 && matches!(&inner[0], TokenTree::Ident(_)) {
                Err(format!(
                    "`({})` 是分组而非元组,若需单元素元组请写 `({},)`",
                    display_tokens(&inner),
                    display_tokens(&inner)
                ))
            } else {
                Err(format!(
                    "无法识别的 ^ 前缀: `{}`。支持: self, &, &mut, unsafe, 标识符(如Box), (), (<bound>)",
                    display_tokens(tokens)
                ))
            }
        }
        _ => Err(format!(
            "无法识别的 ^ 前缀: `{}`。支持: self, &, &mut, unsafe, 标识符(如Box), (), (<bound>)",
            display_tokens(tokens)
        )),
    }
}

pub fn parse_target_items(tokens: &[TokenTree]) -> Result<Vec<TargetItem>, String> {
    if tokens.is_empty() {
        return Err("^ 右侧缺少目标".into());
    }
    if tokens.len() == 1 {
        if let TokenTree::Group(ref g) = tokens[0] {
            if g.delimiter() == Delimiter::Bracket {
                let inner: Vec<TokenTree> = g.stream().into_iter().collect();
                if inner.is_empty() {
                    return Err("^ 右侧 [] 为空,期望类型列表,如 ^[A,B]".into());
                }
                let (segs, d) = split_raw(inner.into_iter().collect(), ',');
                if d > 0 {
                    return Err("^ 右侧 [] 内尖括号不匹配".into());
                }
                if segs.len() == 1 {
                    return Ok(vec![TargetItem::Single(tokens.iter().cloned().collect())]);
                }
                return Ok(segs.into_iter().map(TargetItem::Single).collect());
            }
        }
    }
    if tokens.len() >= 2 && is_punct(&tokens[0], '<') {
        let (r, pos) = parse_balanced(tokens, 1);
        // 如果 > 之后还有内容(如 -String),不能用 Multi,需要保留剩余部分
        if pos < tokens.len() {
            // <> 之后还有内容,将整个序列作为 Single 返回
            return Ok(vec![TargetItem::Single(tokens.iter().cloned().collect())]);
        }
        return r.map(|a| vec![TargetItem::Multi(a)]);
    }
    Ok(vec![TargetItem::Single(tokens.iter().cloned().collect())])
}

/// 应用 `^` 运算符,生成类型
///
/// 支持的模式:
/// - `self^T` → `T`
/// - `&^T` → `&T`
/// - `&mut^T` → `&mut T`
/// - `*const^T` → `*const T`
/// - `*mut^T` → `*mut T`
/// - `unsafe^T` → `T`(标记为 unsafe impl)
/// - `A^B` → `A<B>`
/// - `A^<X,Y>` → `A<X, Y>`
/// - `A<B>^C` → `A<B, C>`(预填泛型追加)
/// - `A<B>^<X,Y>` → `A<B, X, Y>`(预填泛型追加)
/// - `&^A^B` → `&A<B>`(引用类修饰符链式应用)
pub fn apply_caret(prefix: &PrefixItem, target: &TargetItem) -> Result<TokenStream2, String> {
    match (prefix, target) {
        (PrefixItem::Self_, TargetItem::Single(ts)) => Ok(ts.clone()),
        (PrefixItem::Self_, _) => Err("self^ 不能用于多参目标,如 <X,Y>".into()),
        (PrefixItem::Ref, TargetItem::Single(ts)) => Ok(quote! { & #ts }),
        (PrefixItem::Ref, _) => Err("&^ 不能用于多参目标,如 <X,Y>".into()),
        (PrefixItem::RefMut, TargetItem::Single(ts)) => Ok(quote! { &mut #ts }),
        (PrefixItem::RefMut, _) => Err("&mut^ 不能用于多参目标,如 <X,Y>".into()),
        (PrefixItem::ConstPtr, TargetItem::Single(ts)) => Ok(quote! { *const #ts }),
        (PrefixItem::ConstPtr, _) => Err("*const^ 不能用于多参目标,如 <X,Y>".into()),
        (PrefixItem::MutPtr, TargetItem::Single(ts)) => Ok(quote! { *mut #ts }),
        (PrefixItem::MutPtr, _) => Err("*mut^ 不能用于多参目标,如 <X,Y>".into()),
        (PrefixItem::Unsafe, TargetItem::Single(ts)) => Ok(ts.clone()),
        (PrefixItem::Unsafe, _) => Err("unsafe^ 不能用于多参目标".into()),
        // fn^(A,B) → fn(A,B)
        (PrefixItem::Fn, TargetItem::Single(ts)) => Ok(quote! { fn #ts }),
        (PrefixItem::Fn, _) => Err("fn^ 不能用于多参目标".into()),
        (PrefixItem::Container { name, prefill }, TargetItem::Single(ts)) => {
            match prefill {
                Some(args) => {
                    // 有预填泛型:追加参数 A<B>^C → A<B, C>
                    Ok(quote! { #name < #(#args),* , #ts > })
                }
                None => {
                    // 无预填泛型:正常包装 A^B → A<B>
                    Ok(quote! { #name < #ts > })
                }
            }
        }
        (PrefixItem::Container { name, prefill }, TargetItem::Multi(args)) => {
            match prefill {
                Some(prefill_args) => {
                    // 有预填泛型:追加参数 A<B>^<X,Y> → A<B, X, Y>
                    Ok(quote! { #name < #(#prefill_args),* , #(#args),* > })
                }
                None => {
                    // 无预填泛型:正常包装 A^<X,Y> → A<X, Y>
                    Ok(quote! { #name < #(#args),* > })
                }
            }
        }
        (PrefixItem::Tuple { .. }, _) => Err("元组 ^ 的内部错误,这不应该发生,请报告 bug".into()),
        (PrefixItem::Attribute(_), _) => Err("属性 ^ 的内部错误,这不应该发生,请报告 bug".into()),
    }
}

/// 展开带逗号的 bracket:`[A, B^C, D]` → 分割后逐个处理
fn expand_bracket_with_comma(
    inner_ts: TokenStream2,
    types: &[TokenStream2],
    tr: &Option<Vec<TokenStream2>>,
    assoc: &[(TokenStream2, TokenStream2)],
    body: &Option<TokenStream2>,
    span: Span,
    specs: &mut Vec<ImplSpec>,
    simple_targets: &mut Vec<TargetItem>,
) -> ParseResult {
    let (segs, _) = split_raw(inner_ts, ',');
    for seg in segs {
        let stv: Vec<TokenTree> = seg.into_iter().collect();
        if split_by_caret(&stv).is_some() {
            match expand_caret(stv.into_iter().collect(), types, tr, assoc, body.clone(), span) {
                ParseResult::Ok(sub) => specs.extend(sub),
                ParseResult::Err(e) => return ParseResult::Err(e),
            }
        } else {
            simple_targets.push(TargetItem::Single(stv.into_iter().collect()));
        }
    }
    ParseResult::Ok(vec![])
}

/// 展开无逗号的嵌套 bracket:递归解包层级后按逗号分割处理
/// 返回 true 表示有展开发生,false 表示无展开(调用方应将 bracket 作为普通 target)
fn expand_nested_bracket(
    inner_ts: TokenStream2,
    types: &[TokenStream2],
    tr: &Option<Vec<TokenStream2>>,
    assoc: &[(TokenStream2, TokenStream2)],
    body: &Option<TokenStream2>,
    span: Span,
    simple_targets: &mut Vec<TargetItem>,
) -> Result<bool, TokenStream2> {
    // 递归解包 bracket 层级,找到最内层内容后按逗号分割
    let mut unwrap_count = 0usize;
    let mut probe_ts = inner_ts.clone();
    loop {
        let pvec: Vec<TokenTree> = probe_ts.clone().into_iter().collect();
        if pvec.len() == 1 {
            if let TokenTree::Group(ref pg) = pvec[0] {
                if pg.delimiter() == Delimiter::Bracket {
                    let pinner: TokenStream2 = pg.stream();
                    if !has_top_level_char(&pinner, ',') {
                        unwrap_count += 1;
                        probe_ts = pinner;
                        continue;
                    }
                }
            }
        }
        break;
    }
    // 无论是否含 ^,都按逗号分割并逐个处理
    let (inner_segs, _) = split_raw(probe_ts, ',');
    let mut any_expanded = false;
    for seg in inner_segs {
        let stv: Vec<TokenTree> = seg.into_iter().collect();
        if split_by_caret(&stv).is_some() {
            any_expanded = true;
            match expand_caret(stv.into_iter().collect(), types, tr, assoc, body.clone(), span) {
                ParseResult::Ok(sub) => {
                    for spec in sub {
                        let mut target = spec.target;
                        for _ in 0..unwrap_count {
                            let mut wrapped = TokenStream2::new();
                            wrapped.extend(std::iter::once(TokenTree::Group(
                                proc_macro2::Group::new(Delimiter::Bracket, target),
                            )));
                            target = wrapped;
                        }
                        simple_targets.push(TargetItem::Single(target));
                    }
                }
                ParseResult::Err(e) => return Err(e),
            }
        } else if unwrap_count > 0 {
            // 非 ^ segment 但来自嵌套 bracket → 包装 unwrap_count-1 层
            any_expanded = true;
            let mut target: TokenStream2 = stv.into_iter().collect();
            for _ in 0..unwrap_count - 1 {
                let mut wrapped = TokenStream2::new();
                wrapped.extend(std::iter::once(TokenTree::Group(
                    proc_macro2::Group::new(Delimiter::Bracket, target),
                )));
                target = wrapped;
            }
            simple_targets.push(TargetItem::Single(target));
        }
    }
    Ok(any_expanded)
}

pub fn expand_caret(
    tokens: TokenStream2,
    types: &[TokenStream2],
    tr: &Option<Vec<TokenStream2>>,
    assoc: &[(TokenStream2, TokenStream2)],
    body: Option<TokenStream2>,
    span: Span,
) -> ParseResult {
    let _guard = match RecursionGuard::new() {
        Ok(g) => g,
        Err(e) => return e,
    };
    let tv: Vec<TokenTree> = tokens.clone().into_iter().collect();
    let (left, right) = split_by_caret(&tv).unwrap_or_else(|| (vec![], vec![]));

    // 从左侧第一个 token 的 span 生成后缀
    // 这样同一个 (...)^... 中的所有泛型参数共享相同后缀
    let suffix = left.first().map(|t| span_suffix(t.span())).unwrap_or(0);

    let prefixes = match parse_prefix_items(&left) {
        Ok(p) => p,
        Err(e) => return ParseResult::Err(err(span, &e)),
    };

    // 检测 unsafe 前缀并从列表中移除
    let has_unsafe = prefixes.iter().any(|p| matches!(p, PrefixItem::Unsafe));
    let prefixes: Vec<_> = prefixes
        .into_iter()
        .filter(|p| !matches!(p, PrefixItem::Unsafe))
        .collect();

    // 检测属性前缀并从列表中移除
    let mut attrs: Vec<TokenStream2> = Vec::new();
    let prefixes: Vec<_> = prefixes
        .into_iter()
        .filter_map(|p| {
            if let PrefixItem::Attribute(attr_ts) = &p {
                attrs.push(attr_ts.clone());
                None
            } else {
                Some(p)
            }
        })
        .collect();

    // 将右侧在第一个顶层 - 处分割(^ 优先级高于 -)
    // HashMap^K-V → (HashMap^K)-V = HashMap<K>-V = HashMap<K, V>
    // fn^(A,B)-C → fn(A,B)->C
    let (caret_target_right, caret_dash_suffix): (Vec<TokenTree>, Option<Vec<TokenTree>>) = {
        if let Some((args, suffix)) = split_by_dash(&right) {
            (args, Some(suffix))
        } else {
            (right.clone(), None)
        }
    };

    let targets = match parse_target_items(&caret_target_right) {
        Ok(t) => t,
        Err(e) => return ParseResult::Err(err(span, &e)),
    };
    let targets = match expand_targets_recursive(targets, span) {
        Ok(t) => t,
        Err(e) => return e,
    };

    let mut specs = Vec::new();
    let mut simple_targets: Vec<TargetItem> = Vec::new();

    // 展开 bracket list 并递归处理含 ^ 的 target
    for t in &targets {
        if let TargetItem::Single(ts) = t {
            let tv: Vec<TokenTree> = ts.clone().into_iter().collect();
            // bracket group with comma → split and process each
            if tv.len() == 1 {
                if let TokenTree::Group(ref g) = tv[0] {
                    if g.delimiter() == Delimiter::Bracket {
                        let inner_ts: TokenStream2 = g.stream();
                        if has_top_level_char(&inner_ts, ',') {
                            match expand_bracket_with_comma(
                                inner_ts, types, tr, assoc, &body, span,
                                &mut specs, &mut simple_targets,
                            ) {
                                ParseResult::Ok(_) => {},
                                ParseResult::Err(e) => return ParseResult::Err(e),
                            }
                            continue;
                        }
                        // bracket 内无逗号:可能是 expand_single 退化后的结果
                        match expand_nested_bracket(
                            inner_ts.clone(), types, tr, assoc, &body, span,
                            &mut simple_targets,
                        ) {
                            Ok(true) => {}, // 有展开,已完成
                            Ok(false) => {
                                // 无展开,将 bracket 作为普通 target
                                let mut ts = TokenStream2::new();
                                ts.extend(std::iter::once(TokenTree::Group(
                                    proc_macro2::Group::new(Delimiter::Bracket, inner_ts),
                                )));
                                simple_targets.push(TargetItem::Single(ts));
                            }
                            Err(e) => return ParseResult::Err(e),
                        }
                        continue;
                    }
                }
            }
            // caret at top level → recursive expand
            if split_by_caret(&tv).is_some() {
                let has_fn = prefixes.iter().any(|p| matches!(p, PrefixItem::Fn));
                match expand_caret(tv.into_iter().collect(), types, tr, assoc, body.clone(), span) {
                    ParseResult::Ok(sub) => {
                        for spec in sub {
                            // 如果有 Fn 前缀,先应用 fn^
                            let target_ts = if has_fn {
                                match apply_caret(&PrefixItem::Fn, &TargetItem::Single(spec.target)) {
                                    Ok(ts) => ts,
                                    Err(e) => return ParseResult::Err(err(span, &e)),
                                }
                            } else {
                                spec.target
                            };
                            // 应用 dash 后缀
                            if let Some(ref suffix) = caret_dash_suffix {
                                match dash_parse_slots_public(&suffix.clone().into_iter().collect(), span) {
                                    Ok(slots) => {
                                        for slot in slots {
                                            let (new_target, extra_types) = dash_append_public(&target_ts, &slot, 0);
                                            let mut all_types = spec.type_params.clone();
                                            all_types.extend(extra_types);
                                            specs.push(ImplSpec::new(
                                                all_types,
                                                spec.trait_params.clone(),
                                                spec.assoc_bindings.clone(),
                                                new_target,
                                                spec.custom_body.clone(),
                                            ));
                                        }
                                    }
                                    Err(e) => return e,
                                }
                            } else {
                                specs.push(ImplSpec::new(
                                    spec.type_params,
                                    spec.trait_params,
                                    spec.assoc_bindings,
                                    target_ts,
                                    spec.custom_body,
                                ));
                            }
                        }
                    }
                    ParseResult::Err(e) => return ParseResult::Err(e),
                }
                continue;
            }
        }
        simple_targets.push(t.clone());
    }

    // 如果 prefixes 为空(只有 unsafe/attr 前缀被移除),直接使用 targets
    if prefixes.is_empty() {
        for t in &simple_targets {
            let ts: TokenStream2 = match t {
                TargetItem::Single(ts) => ts.clone(),
                TargetItem::Multi(_) => {
                    return ParseResult::Err(err(span, "unsafe^ 后不能直接跟多参目标如 <X,Y>"));
                }
            };
            // 应用 dash 后缀(如果有)
            if let Some(ref suffix) = caret_dash_suffix {
                match dash_parse_slots_public(&suffix.clone().into_iter().collect(), span) {
                    Ok(slots) => {
                        for slot in slots {
                            let (new_target, extra_types) = dash_append_public(&ts, &slot, 0);
                            let mut all_types = types.to_vec();
                            all_types.extend(extra_types);
                            specs.push(ImplSpec::new(
                                all_types,
                                tr.clone(),
                                assoc.to_vec(),
                                new_target,
                                body.clone(),
                            ));
                        }
                    }
                    Err(e) => return e,
                }
            } else {
                specs.push(ImplSpec::new(
                    types.to_vec(),
                    tr.clone(),
                    assoc.to_vec(),
                    ts,
                    body.clone(),
                ));
            }
        }
    } else {
        for p in &prefixes {
            if let PrefixItem::Tuple { elem, bound } = p {
                for t in &simple_targets {
                    // 尝试解析为数字/范围(原有行为:生成多个元组)
                    if let Ok((start, count)) = parse_tuple_count(t) {
                        specs.extend(generate_tuples(
                            elem,
                            bound,
                            start,
                            count,
                            types,
                            tr,
                            body.clone(),
                            suffix,
                        ));
                    } else {
                        // 目标是类型,追加到元组末尾
                        // ()^T = (T), (A,)^T = (A, T), (A,B)^T = (A, B, T)
                        let target_ts = match t {
                            TargetItem::Single(ts) => ts.clone(),
                            TargetItem::Multi(args) => {
                                let mut ts = TokenStream2::new();
                                ts.extend(std::iter::once(TokenTree::Group(
                                    proc_macro2::Group::new(Delimiter::Parenthesis, {
                                        let mut inner = TokenStream2::new();
                                        for (i, arg) in args.iter().enumerate() {
                                            if i > 0 {
                                                inner.extend(std::iter::once(TokenTree::Punct(
                                                    proc_macro2::Punct::new(
                                                        ',',
                                                        proc_macro2::Spacing::Alone,
                                                    ),
                                                )));
                                            }
                                            inner.extend(arg.clone());
                                        }
                                        inner
                                    }),
                                )));
                                ts
                            }
                        };
                        let new_target = match elem {
                            // ()^T = (T,)
                            None => {
                                let mut ts = TokenStream2::new();
                                ts.extend(std::iter::once(TokenTree::Group(
                                    proc_macro2::Group::new(Delimiter::Parenthesis, {
                                        let mut inner = target_ts;
                                        inner.extend(std::iter::once(TokenTree::Punct(
                                            proc_macro2::Punct::new(
                                                ',',
                                                proc_macro2::Spacing::Alone,
                                            ),
                                        )));
                                        inner
                                    }),
                                )));
                                ts
                            }
                            Some(e) => {
                                // (A,)^T = (A, T) 或 (A, B)^T = (A, B, T)
                                let mut ts = TokenStream2::new();
                                ts.extend(std::iter::once(TokenTree::Group(
                                    proc_macro2::Group::new(Delimiter::Parenthesis, {
                                        let mut inner = e.clone();
                                        inner.extend(std::iter::once(TokenTree::Punct(
                                            proc_macro2::Punct::new(
                                                ',',
                                                proc_macro2::Spacing::Alone,
                                            ),
                                        )));
                                        inner.extend(target_ts);
                                        inner
                                    }),
                                )));
                                ts
                            }
                        };
                        let mut all_types = types.to_vec();
                        if let Some(b) = bound {
                            all_types.extend(b.clone().into_iter().map(|tt| {
                                let mut ts = TokenStream2::new();
                                ts.extend(std::iter::once(tt));
                                ts
                            }));
                        }
                        specs.push(ImplSpec::new(
                            all_types,
                            tr.clone(),
                            assoc.to_vec(),
                            new_target,
                            body.clone(),
                        ));
                    }
                }
            } else if caret_dash_suffix.is_some() {
                // 有 dash 后缀:先应用 ^ 前缀,再应用 dash
                // HashMap^K-V → HashMap<K>-V → HashMap<K, V>
                // fn^(A,B)-C → fn(A,B)->C
                let suffix_tokens = caret_dash_suffix.as_ref().unwrap();
                for t in &simple_targets {
                    let ts = match apply_caret(p, t) {
                        Ok(ts) => ts,
                        Err(e) => return ParseResult::Err(err(span, &e)),
                    };
                    match dash_parse_slots_public(&suffix_tokens.clone().into_iter().collect(), span) {
                        Ok(slots) => {
                            for slot in slots {
                                let (new_target, extra_types) = dash_append_public(&ts, &slot, 0);
                                let mut all_types = types.to_vec();
                                all_types.extend(extra_types);
                                specs.push(ImplSpec::new(
                                    all_types,
                                    tr.clone(),
                                    assoc.to_vec(),
                                    new_target,
                                    body.clone(),
                                ));
                            }
                        }
                        Err(e) => return e,
                    }
                }
            } else {
                for t in &simple_targets {
                    let ts = match apply_caret(p, t) {
                        Ok(ts) => ts,
                        Err(e) => return ParseResult::Err(err(span, &e)),
                    };
                    specs.push(ImplSpec::new(
                        types.to_vec(),
                        tr.clone(),
                        assoc.to_vec(),
                        ts,
                        body.clone(),
                    ));
                }
            }
        }
    }
    // 如果有 unsafe 前缀,标记所有 spec
    if has_unsafe {
        for spec in &mut specs {
            spec.is_unsafe = true;
        }
    }
    // 如果有属性前缀,添加到所有 spec
    if !attrs.is_empty() {
        for spec in &mut specs {
            spec.attributes.extend(attrs.clone());
        }
    }
    ParseResult::Ok(specs)
}

pub fn expand_targets_recursive(
    items: Vec<TargetItem>,
    span: Span,
) -> crate::core::types::PResult<Vec<TargetItem>> {
    let mut result = Vec::new();
    for item in items {
        match item {
            TargetItem::Single(ts) => {
                result.extend(expand_single(ts, span)?);
            }
            other => result.push(other),
        }
    }
    Ok(result)
}

pub fn expand_single(ts: TokenStream2, span: Span) -> crate::core::types::PResult<Vec<TargetItem>> {
    let _guard = RecursionGuard::new()?;
    let tokens: Vec<TokenTree> = ts.clone().into_iter().collect();

    // 顶层 ^
    if let Some((left, right)) = split_by_caret(&tokens) {
        let prefixes = parse_prefix_items(&left).map_err(|e| ParseResult::Err(err(span, &e)))?;
        // 如果前缀中有 Tuple,整体交给 expand_caret 递归处理
        if prefixes
            .iter()
            .any(|p| matches!(p, PrefixItem::Tuple { .. }))
        {
            return Ok(vec![TargetItem::Single(ts)]);
        }
        // 过滤 Attribute 和 Unsafe 前缀(它们不能传给 apply_caret)
        let filtered_prefixes: Vec<_> = prefixes
            .into_iter()
            .filter(|p| !matches!(p, PrefixItem::Attribute(_) | PrefixItem::Unsafe))
            .collect();
        let targets = parse_target_items(&right).map_err(|e| ParseResult::Err(err(span, &e)))?;
        let targets = expand_targets_recursive(targets, span)?;
        // 如果过滤后没有前缀,返回 targets 原样
        if filtered_prefixes.is_empty() {
            return Ok(targets);
        }
        let mut r = Vec::new();
        for p in &filtered_prefixes {
            for t in &targets {
                let ts = apply_caret(p, t).map_err(|e| ParseResult::Err(err(span, &e)))?;
                r.push(TargetItem::Single(ts));
            }
        }
        return Ok(r);
    }

    // 顶层 - (左结合元组构建)
    if crate::core::dash::split_by_dash(&tokens).is_some() {
        match crate::core::dash::expand_dash(ts, &[], &None, &[], None, span) {
            ParseResult::Ok(specs) => {
                return Ok(specs
                    .into_iter()
                    .map(|s| TargetItem::Single(s.target))
                    .collect());
            }
            ParseResult::Err(e) => return Err(ParseResult::Err(e)),
        }
    }

    // 穿透 [] 和 {}
    if let [TokenTree::Group(ref g)] = tokens.as_slice() {
        if g.delimiter() == Delimiter::Bracket || g.delimiter() == Delimiter::Brace {
            let inner: TokenStream2 = g.stream();

            // bracket 内含逗号 -> 逗号分隔的并列列表,按项分别展开
            if g.delimiter() == Delimiter::Bracket && has_top_level_char(&inner, ',') {
                let has_caret = has_top_level_char(&inner, '^');
                let (segs, _) = split_raw(inner, ',');
                // 如果含 ^,保留每个 segment 的 bracket 包装(Tuple ^ 退化场景)
                if has_caret {
                    let mut results = Vec::new();
                    for seg in segs {
                        let mut wrapped = TokenStream2::new();
                        wrapped.extend(std::iter::once(TokenTree::Group(proc_macro2::Group::new(
                            Delimiter::Bracket,
                            seg,
                        ))));
                        results.push(TargetItem::Single(wrapped));
                    }
                    return Ok(results);
                }
                let mut results = Vec::new();
                for seg in segs {
                    results.extend(expand_single(seg, span)?);
                }
                return Ok(results);
            }

            let expanded = expand_single(inner, span)?;
            let mut r = Vec::new();
            for item in expanded {
                if let TargetItem::Single(inner_ts) = item {
                    let mut wrapped = TokenStream2::new();
                    wrapped.extend(std::iter::once(TokenTree::Group(proc_macro2::Group::new(
                        g.delimiter(),
                        inner_ts,
                    ))));
                    r.push(TargetItem::Single(wrapped));
                } else {
                    r.push(item);
                }
            }
            return Ok(r);
        }
    }

    Ok(vec![TargetItem::Single(ts)])
}