cure-cli 0.4.1

CLI for cure: fault-tolerant Java, TypeScript/JavaScript, Python and Dart simplifier/formatter (source in, source out)
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
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
//! # cure CLI
//!
//! `cure` —— 容错式代码简化 / 格式化命令行工具。CLI 与引擎均语言无关,
//! **当前实现的语言后端:Java、TypeScript/JavaScript**(ts/tsx/mts/cts/
//! js/jsx/mjs/cjs)、**Python**(py/pyi)与 **Dart**(dart,Dart 1/2/3)
//! ——新语言在 [`LANG_BACKENDS`]
//! 登记一条(后缀 + 管线函数)即获得目录遍历 / 并行 / `--check` /
//! `--diff` / `--stats` / 跨平台批量 I/O 的全部基础设施。
//!
//! - 输入:源码文件、目录(递归)、stdin
//! - 单文件默认输出 stdout;目录默认输出到同级 `<目录名>-cure-out/`
//!   (保持内部目录结构),`-o` 可指定输出根,`-w` 原地覆写
//! - 语法错误不阻断:错误区域原文保留,其余照常优化(`--strict` 时非零退出)
//! - 多文件/目录自动多核并行(std::thread::scope)

use std::fs;
use std::io::{Read, Write};
use std::path::{Path, PathBuf};
use std::process::ExitCode;

use cure_engine::Config;
use cure_dart_parser::parse as dart_parse;
use cure_dart_print::print_module as dart_print;
use cure_dart_simplify::simplify_module as dart_simplify;
use cure_java_parser::parse;
use cure_java_print::print_unit;
use cure_java_simplify::simplify_unit;
use cure_python_parser::parse as py_parse;
use cure_python_print::print_module as py_print;
use cure_python_simplify::simplify_module as py_simplify;
use cure_ts_parser::{parse_with_options, ParseOptions};
use cure_ts_print::print_module as ts_print;
use cure_ts_simplify::simplify_unit as ts_simplify_unit;

mod cli_lang;
mod help;
mod io_batch;

/// 语言后端:一条「源 → 简化后源」的完整管线。
struct LangBackend {
    /// 语言名(诊断 / 帮助文本用)。
    name: &'static str,
    /// 源文件后缀(小写、无点)。目录遍历按它分类收集。
    exts: &'static [&'static str],
    /// 管线:parse → simplify → print(含容错语义与三检)。
    process: fn(&str, &Options, Option<PathBuf>, &str) -> Result<FileResult, String>,
}

/// 已实现的语言后端注册表。新语言 = 追加一条登记(CLI/引擎本身语言无关)。
const LANG_BACKENDS: &[LangBackend] = &[
    LangBackend {
        name: "java",
        exts: &["java"],
        process: process_source,
    },
    LangBackend {
        name: "typescript/javascript",
        exts: &["ts", "tsx", "mts", "cts", "js", "jsx", "mjs", "cjs"],
        process: process_source_ts,
    },
    LangBackend {
        name: "python",
        exts: &["py", "pyi"],
        process: process_source_py,
    },
    LangBackend {
        name: "dart",
        exts: &["dart"],
        process: process_source_dart,
    },
];

/// 后缀 → 后端(O(后端数),无哈希)。
fn backend_for_ext(ext: &str) -> Option<&'static LangBackend> {
    LANG_BACKENDS.iter().find(|b| b.exts.contains(&ext))
}

/// 显式语言名/别名 → 后端。
fn backend_for_lang(name: &str) -> Option<&'static LangBackend> {
    match name.trim().to_ascii_lowercase().as_str() {
        "java" => Some(&LANG_BACKENDS[0]),
        "ts" | "tsx" | "mts" | "cts" | "js" | "jsx" | "mjs" | "cjs"
        | "typescript" | "javascript" => Some(&LANG_BACKENDS[1]),
        "py" | "python" | "python3" | "pyi" => Some(&LANG_BACKENDS[2]),
        "dart" | "dart3" => Some(&LANG_BACKENDS[3]),
        _ => None,
    }
}

fn selected_backend(opts: &Options, path: Option<&Path>) -> Result<&'static LangBackend, String> {
    if let Some(lang) = &opts.lang {
        return backend_for_lang(lang).ok_or_else(|| format!("未知语言 `{lang}`"));
    }
    if let Some(p) = path {
        let ext = p
            .extension()
            .and_then(|e| e.to_str())
            .map(|e| e.to_ascii_lowercase())
            .unwrap_or_default();
        if !ext.is_empty() {
            if let Some(b) = backend_for_ext(&ext) {
                return Ok(b);
            }
        }
    }
    Ok(&LANG_BACKENDS[0])
}

/// 全部已实现后端的后缀并集(目录遍历的默认收集集)。
fn supported_exts() -> Vec<&'static str> {
    let mut out: Vec<&'static str> = Vec::new();
    for b in LANG_BACKENDS {
        for e in b.exts {
            if !out.contains(e) {
                out.push(e);
            }
        }
    }
    out
}

/// 当前已实现语言的清单描述(--ext 提示 / 帮助文本用)。
fn lang_list() -> String {
    LANG_BACKENDS
        .iter()
        .map(|b| format!("{}(.{})", b.name, b.exts.join(", .")))
        .collect::<Vec<_>>()
        .join("、")
}


/// `cure ... | head` 之类:读者退出关闭管道时 std 的 println! 会以
/// "failed printing to stdout" panic(std 忽略 SIGPIPE)。恢复默认
/// 处置(静默退出),和其他 CLI 行为一致。signal(2) 在 libc 里、std
/// 已链接——直接 extern 声明,保持零运行时依赖(ddc 同款)。
#[cfg(unix)]
fn restore_sigpipe_default() {
    const SIGPIPE: i32 = 13;
    const SIG_DFL: usize = 0;
    extern "C" {
        fn signal(signum: i32, handler: usize) -> usize;
    }
    unsafe {
        signal(SIGPIPE, SIG_DFL);
    }
}
#[cfg(not(unix))]
fn restore_sigpipe_default() {}

fn main() -> ExitCode {
    restore_sigpipe_default();
    let args: Vec<String> = std::env::args().skip(1).collect();
    // 无参数:帮助即默认动作(stdout,退出 0)——ddc 约定
    if args.is_empty() {
        help::print_help();
        return ExitCode::SUCCESS;
    }
    // help / version 作为首词——先于子命令分派与位置输入解释
    //(`cure help <子命令>` 打印该子命令的帮助)
    match args[0].as_str() {
        "help" | "-h" | "--help" => {
            match args.get(1).map(String::as_str) {
                Some(topic) if !topic.starts_with('-') => {
                    if topic == "rules" {
                        help::print_rules_help();
                    } else {
                        match cli_lang::CliLang::detect() {
                            cli_lang::CliLang::Zh => eprintln!(
                                "cure: 未知帮助主题: {topic}(可用 `cure help`)"
                            ),
                            cli_lang::CliLang::En => eprintln!(
                                "cure: unknown help topic: {topic} (try `cure help`)"
                            ),
                        }
                        return ExitCode::from(2);
                    }
                }
                _ => help::print_help(),
            }
            return ExitCode::SUCCESS;
        }
        "version" | "-V" | "--version" => {
            help::print_version();
            return ExitCode::SUCCESS;
        }
        // rules 子命令:规则目录(--disable 的取值参考;-h 同输出)
        "rules" => {
            help::print_rules_help();
            return ExitCode::SUCCESS;
        }
        _ => {}
    }
    match run(&args) {
        Ok(code) => code,
        Err(msg) => {
            eprintln!("cure: {msg}");
            eprintln!("用法见 `cure --help`");
            ExitCode::from(2)
        }
    }
}

#[derive(Clone)]
struct Options {
    inputs: Vec<PathBuf>,
    output: Option<PathBuf>,
    in_place: bool,
    format_only: bool,
    check: bool,
    exts: Vec<String>,
    copy_other: bool,
    diff: bool,
    stats: bool,
    report: bool,
    disabled: Vec<String>,
    dead_code: bool,
    /// JDK 路径(Class.forName 存在性精确验证;未指定走 java.base 白名单)
    jdk_home: Option<String>,
    strict: bool,
    /// 显式语言后端(`--lang java|ts|js`);未指定时按文件后缀/默认后端。
    lang: Option<String>,
    /// 函数/类/对象字面量源码保真(`Function.prototype.toString` 兼容)。
    preserve_function_source: bool,
    stdin: bool,
    /// 工作线程数(0/None = 自动;见 worker_threads())
    threads: usize,
}

/// 单文件处理结果(聚合统计用)。
#[derive(Default, Clone)]
#[allow(dead_code)] // display 供 per-file 诊断扩展
struct FileResult {
    changed: bool,
    errored: bool,
    edits: usize,
    lines_before: usize,
    lines_after: usize,
    /// 结构指标(--stats/--report 惰性计算;零值 = 未采集)。
    nodes_before: u64,
    nodes_after: u64,
    decisions_before: u64,
    decisions_after: u64,
    depth_before: u32,
    depth_after: u32,
    by_rule: Vec<(&'static str, usize)>,
    /// --diff 生成的差异文本(未启用或差异过大时为空)
    diff_text: String,
    display: String,
}

fn parse_args(args: &[String]) -> Result<Options, String> {
    let mut opts = Options {
        inputs: Vec::new(),
        output: None,
        in_place: false,
        format_only: false,
        check: false,
        exts: Vec::new(),
        copy_other: false,
        diff: false,
        stats: false,
        report: false,
        disabled: Vec::new(),
        dead_code: false,
        jdk_home: None,
        strict: false,
        lang: None,
        preserve_function_source: false,
        stdin: false,
        threads: 0,
    };
    let mut i = 0;
    while i < args.len() {
        let a = &args[i];
        match a.as_str() {
            // 兜底(首词路由已处理常见形态):参数中间出现 -h 也给帮助
            "-h" | "--help" => {
                help::print_help();
                std::process::exit(0);
            }
            "-V" | "--version" => {
                help::print_version();
                std::process::exit(0);
            }
            "-" => opts.stdin = true,
            "-w" | "--write" => opts.in_place = true,
            "--format-only" => opts.format_only = true,
            "--check" => opts.check = true,
            "--copy-other" => opts.copy_other = true,
            "--diff" => opts.diff = true,
            "--stats" => opts.stats = true,
            "--report" => opts.report = true,
            "--strict" => opts.strict = true,
            "--dead-code" => opts.dead_code = true,
            "--preserve-function-source" => opts.preserve_function_source = true,
            "--jdk-home" => {
                i += 1;
                let v = args.get(i).ok_or("missing value for --jdk-home")?;
                opts.jdk_home = Some(v.clone());
            }
            "-o" | "--output" => {
                i += 1;
                let v = args.get(i).ok_or("missing value for --output")?;
                opts.output = Some(PathBuf::from(v));
            }
            "--lang" | "-l" => {
                i += 1;
                let v = args.get(i).ok_or("missing value for --lang")?;
                if backend_for_lang(v).is_none() {
                    return Err(format!(
                        "未知语言 `{v}`(可选:java、ts/js/typescript/javascript、py/python)"
                    ));
                }
                opts.lang = Some(v.to_ascii_lowercase());
            }
            "--ext" => {
                i += 1;
                let v = args.get(i).ok_or("missing value for --ext")?;
                // 逗号或空格分隔;容忍前导点与大写
                for part in v.split(|c: char| c == ',' || c.is_whitespace()) {
                    let p = part.trim().trim_start_matches('.').trim().to_ascii_lowercase();
                    if !p.is_empty() && !opts.exts.contains(&p) {
                        opts.exts.push(p);
                    }
                }
            }
            "--disable" => {
                i += 1;
                let v = args.get(i).ok_or("missing value for --disable")?;
                opts.disabled.push(v.clone());
            }
            "-j" | "--threads" => {
                i += 1;
                let v = args.get(i).ok_or("missing value for --threads")?;
                opts.threads = v
                    .parse::<usize>()
                    .map_err(|_| format!("--threads 需要正整数,得到 `{v}`"))?;
            }
            other if other.starts_with('-') => {
                return Err(format!("未知选项 `{other}`"));
            }
            other => opts.inputs.push(PathBuf::from(other)),
        }
        i += 1;
    }
    if opts.stdin && !opts.inputs.is_empty() {
        return Err("stdin (`-`) 与文件参数不能同时使用".into());
    }
    if opts.stdin && opts.output.is_none() && opts.in_place {
        return Err("stdin 模式不能与 -w 组合".into());
    }
    // --ext 与已实现语言的后缀求交集,提示不受支持的项
    if !opts.exts.is_empty() {
        let supported = supported_exts();
        let unsupported: Vec<String> = opts
            .exts
            .iter()
            .filter(|e| !supported.contains(&e.as_str()))
            .cloned()
            .collect();
        if !unsupported.is_empty() {
            eprintln!(
                "cure: 提示:后缀 {} 暂无已实现的语言后端(当前已实现:{}),已忽略",
                unsupported.join(", "),
                lang_list()
            );
        }
        opts.exts.retain(|e| supported.contains(&e.as_str()));
        if opts.exts.is_empty() {
            return Err("--ext 指定的后缀均无已实现的语言后端".into());
        }
    }
    Ok(opts)
}

/// 工作线程数决策。
///
/// - 用户显式指定(`--threads N` / `-j N`,N≥1):直接采用
/// - 自动(0):CPU 核心数 × 1.5(下取整)。37 万文件实测(18 核,
///   5 轮交错):1:1 中位 17.3s、1.5× 16.0s(−7%,每轮方向一致;
///   CPU 时间与峰值 RSS 持平),2×/3× 无进一步收益。机理:P/E 核
///   异构下动态取号队列 + 适度超订让快核吸收慢核拖尾(1:1 时 E 核
///   线程是关键路径);多余线程无事可做时近零成本。
///
/// 任何情况下不超过任务数(少于一个文件/线程无意义),且至少 1。
fn worker_threads(user: usize, jobs: usize) -> usize {
    let cores = std::thread::available_parallelism().map(|n| n.get()).unwrap_or(4);
    let n = if user >= 1 { user } else { cores + cores / 2 };
    n.min(jobs).max(1)
}

/// 目录模式默认输出根:输入目录的同级 `<名>-cure-out/`。
fn default_out_root(dir: &Path) -> Result<PathBuf, String> {
    let canon = dir
        .canonicalize()
        .map_err(|e| format!("访问 {} 失败: {e}", dir.display()))?;
    let name = canon
        .file_name()
        .and_then(|n| n.to_str())
        .ok_or("无法确定目录名")?;
    let parent = canon
        .parent()
        .ok_or("输入目录没有父目录(无法生成 -cure-out 输出目录)")?;
    Ok(parent.join(format!("{name}-cure-out")))
}

/// 递归收集文件。跳过 `.git` 与输出根(防嵌套自吞)。
/// 并行目录遍历:顶层子目录分派到线程(37 万文件实测单线程 walk 7s →
/// 并行 <1s;深目录树收尾用单线程补扫)。语义与旧递归版一致(顺序
/// 不保证——调用方已按需排序)。
fn walk_files_parallel(
    root: &Path,
    skip: &Path,
    exts: &[String],
) -> (Vec<PathBuf>, Vec<PathBuf>) {
    // 先列根的直接子项(浅层),子目录并行递归
    let mut top_dirs: Vec<PathBuf> = Vec::new();
    let mut sources: Vec<PathBuf> = Vec::new();
    let mut others: Vec<PathBuf> = Vec::new();
    if let Ok(entries) = fs::read_dir(root) {
        for entry in entries.flatten() {
            let p = entry.path();
            if p.is_dir() {
                let name = p.file_name().and_then(|n| n.to_str()).unwrap_or("");
                if name == ".git" {
                    continue;
                }
                if p.canonicalize().map(|c| c == skip).unwrap_or(false) {
                    continue;
                }
                top_dirs.push(p);
            } else {
                classify_file(&p, exts, &mut sources, &mut others);
            }
        }
    }
    // 单目录/少目录:直接串行(避免线程开销)
    if top_dirs.len() < 4 {
        for d in top_dirs {
            let mut s2 = Vec::new();
            let mut o2 = Vec::new();
            walk_files(&d, skip, &mut s2, &mut o2, exts);
            sources.extend(s2);
            others.extend(o2);
        }
        return (sources, others);
    }
    let n = std::thread::available_parallelism()
        .map(|n| n.get())
        .unwrap_or(4)
        .min(top_dirs.len());
    let chunk = top_dirs.len().div_ceil(n);
    let results: Vec<std::sync::Mutex<(Vec<PathBuf>, Vec<PathBuf>)>> =
        (0..n).map(|_| std::sync::Mutex::new((Vec::new(), Vec::new()))).collect();
    std::thread::scope(|sc| {
        let mut handles = Vec::new();
        for (i, dirs) in top_dirs.chunks(chunk).enumerate() {
            let results = &results;
            let exts = exts;
            let skip = skip;
            handles.push(sc.spawn(move || {
                for d in dirs {
                    let mut s2 = Vec::new();
                    let mut o2 = Vec::new();
                    walk_files(d, skip, &mut s2, &mut o2, exts);
                    let mut r = results[i].lock().unwrap();
                    r.0.extend(s2);
                    r.1.extend(o2);
                }
            }));
        }
        for h in handles {
            let _ = h.join();
        }
    });
    for r in results {
        let (s2, o2) = r.into_inner().unwrap();
        sources.extend(s2);
        others.extend(o2);
    }
    (sources, others)
}

fn classify_file(p: &Path, exts: &[String], sources: &mut Vec<PathBuf>, others: &mut Vec<PathBuf>) {
    let ext = p
        .extension()
        .and_then(|e| e.to_str())
        .map(|e| e.to_ascii_lowercase())
        .unwrap_or_default();
    let wanted = exts.is_empty() || exts.contains(&ext);
    if wanted && backend_for_ext(&ext).is_some() {
        sources.push(p.to_path_buf());
    } else {
        others.push(p.to_path_buf());
    }
}

#[allow(dead_code)]
fn walk_files(
    root: &Path,
    skip: &Path,
    sources: &mut Vec<PathBuf>,
    others: &mut Vec<PathBuf>,
    exts: &[String],
) {
    let entries = match fs::read_dir(root) {
        Ok(e) => e,
        Err(_) => return,
    };
    for entry in entries.flatten() {
        let p = entry.path();
        if p.is_dir() {
            let name = p.file_name().and_then(|n| n.to_str()).unwrap_or("");
            if name == ".git" {
                continue;
            }
            if p.canonicalize().map(|c| c == skip).unwrap_or(false) {
                continue;
            }
            walk_files(&p, skip, sources, others, exts);
        } else {
            let ext = p
                .extension()
                .and_then(|e| e.to_str())
                .map(|e| e.to_ascii_lowercase())
                .unwrap_or_default();
            let wanted = exts.is_empty() || exts.contains(&ext);
            if wanted && backend_for_ext(&ext).is_some() {
                sources.push(p);
            } else {
                others.push(p);
            }
        }
    }
}

fn run(args: &[String]) -> Result<ExitCode, String> {
    let opts = parse_args(args)?;

    if opts.stdin {
        let mut src = String::new();
        std::io::stdin()
            .read_to_string(&mut src)
            .map_err(|e| format!("读取 stdin 失败: {e}"))?;
        // stdin 无文件名/后缀:`--lang` 显式选择,否则回退 Java。
        let backend = selected_backend(&opts, None)?;
        let r = (backend.process)(&src, &opts, None, "<stdin>")?;
        return Ok(final_code_opts(r.changed, r.errored, &opts));
    }

    if opts.inputs.is_empty() {
        return Err("缺少输入(文件 / 目录 / `-`)".into());
    }

    // 区分文件与目录输入
    let mut plain_files: Vec<PathBuf> = Vec::new();
    let mut dirs: Vec<PathBuf> = Vec::new();
    for p in &opts.inputs {
        if p.is_dir() {
            dirs.push(p.clone());
        } else if p.is_file() {
            plain_files.push(p.clone());
        } else {
            return Err(format!("输入 {} 不存在", p.display()));
        }
    }
    if !dirs.is_empty() && !plain_files.is_empty() {
        return Err("文件与目录输入不能混用(目录请单独传入;需要多文件用 -w/--check)".into());
    }

    // 工作项:(输入, 输出 None=stdout, 展示名)
    let mut jobs: Vec<(PathBuf, Option<PathBuf>, String)> = Vec::new();
    let mut copy_jobs: Vec<(PathBuf, PathBuf)> = Vec::new();

    if !dirs.is_empty() {
        if dirs.len() > 1 {
            return Err("一次只能处理一个目录".into());
        }
        let dir = &dirs[0];
        let out_root = if opts.in_place {
            None // -w:原地
        } else if let Some(o) = &opts.output {
            Some(o.clone())
        } else {
            Some(default_out_root(dir)?)
        };
        let effective_exts: Vec<String> = if !opts.exts.is_empty() {
            opts.exts.clone()
        } else if let Some(lang) = &opts.lang {
            // 显式 --lang:目录模式只收集该后端的后缀,避免把混合目录
            // 里的 .js 当 Python(或反之)解析。
            backend_for_lang(lang)
                .map(|b| b.exts.iter().map(|s| s.to_string()).collect())
                .unwrap_or_else(|| supported_exts().into_iter().map(|s| s.to_string()).collect())
        } else {
            supported_exts().into_iter().map(|s| s.to_string()).collect()
        };
        let skip = out_root
            .as_ref()
            .and_then(|o| o.canonicalize().ok())
            .unwrap_or_else(|| PathBuf::from("\u{0}nonexistent"));
        let display_root = out_root.clone().unwrap_or_else(|| dir.clone());
        let (mut sources, mut others) = walk_files_parallel(dir, &skip, &effective_exts);
        sources.sort();
        others.sort();
        if sources.is_empty() {
            return Err(format!(
                "目录 {} 中没有匹配的源码文件(--ext 过滤后为空)",
                dir.display()
            ));
        }
        if let Some(root) = &out_root {
            if opts.check {
                eprintln!("cure: --check 目录模式,不写出(输出根 {} 不创建)", root.display());
            } else {
                eprintln!("cure: {} → {}", dir.display(), display_root.display());
            }
        }
        for src in sources {
            let rel = src
                .strip_prefix(dir)
                .map(|r| r.to_path_buf())
                .unwrap_or_else(|_| src.clone());
            let out = if opts.check {
                None
            } else if opts.in_place {
                Some(src.clone())
            } else {
                Some(out_root.as_ref().unwrap().join(&rel))
            };
            jobs.push((src, out, rel.display().to_string()));
        }
        if opts.copy_other && !opts.check && !opts.in_place {
            let root = out_root.as_ref().unwrap();
            for other in others {
                let rel = other
                    .strip_prefix(dir)
                    .map(|r| r.to_path_buf())
                    .unwrap_or_else(|_| other.clone());
                copy_jobs.push((other, root.join(rel)));
            }
        }
    } else {
        // 纯文件输入
        for f in plain_files {
            let out = if opts.in_place {
                Some(f.clone())
            } else {
                opts.output.clone()
            };
            jobs.push((f, out, String::new()));
        }
        // 多文件 + stdout(无 -o/-w)不可行
        if jobs.len() > 1 && jobs.iter().all(|(_, o, _)| o.is_none()) && !opts.check {
            return Err("多个文件输出到 stdout 不受支持:请用 -w / -o / --check".into());
        }
    }

    // 预建输出目录(串行,避免 mkdir 竞争)
    for (_, out, _) in &jobs {
        if let Some(o) = out {
            if let Some(parent) = o.parent() {
                if !parent.exists() {
                    fs::create_dir_all(parent)
                        .map_err(|e| format!("创建 {} 失败: {e}", parent.display()))?;
                }
            }
        }
    }
    for (_, dst) in &copy_jobs {
        if let Some(parent) = dst.parent() {
            if !parent.exists() {
                fs::create_dir_all(parent)
                    .map_err(|e| format!("创建 {} 失败: {e}", parent.display()))?;
            }
        }
    }

    // 单文件 + stdout:串行(保持原行为)
    if jobs.len() == 1 && jobs[0].1.is_none() {
        let (path, _, display) = jobs.pop().unwrap();
        let display = if display.is_empty() {
            path.display().to_string()
        } else {
            display
        };
        let src = fs::read_to_string(&path)
            .map_err(|e| format!("读取 {} 失败: {e}", path.display()))?;
        // 按扩展名分派语言后端;无扩展名(管道临时文件等)回退首个
        let ext = path
            .extension()
            .and_then(|e| e.to_str())
            .map(|e| e.to_ascii_lowercase())
            .unwrap_or_default();
        let backend = if let Some(lang) = &opts.lang {
            backend_for_lang(lang).expect("validated --lang")
        } else if ext.is_empty() {
            &LANG_BACKENDS[0]
        } else if let Some(b) = backend_for_ext(&ext) {
            b
        } else {
            return Err(match cli_lang::CliLang::detect() {
                cli_lang::CliLang::Zh => format!(
                    "{} 后缀 .{ext} 无已实现的语言后端(当前已实现:{})",
                    path.display(),
                    lang_list()
                ),
                cli_lang::CliLang::En => format!(
                    "{}: no language backend for .{ext} (implemented: {})",
                    path.display(),
                    lang_list()
                ),
            });
        };
        let r = (backend.process)(&src, &opts, None, &display)?;
        // --stats/--report:单文件也输出汇总(结构指标随处可得)
        if opts.stats || opts.report {
            print_stats_summary(std::slice::from_ref(&r), &opts);
        }
        return Ok(final_code_opts(r.changed, r.errored, &opts));
    }

    // 多文件:多核并行(文件间完全独立;stderr 诊断按行原子性可接受)。
    // 动态工作队列(AtomicUsize 取号)而非静态连续切片:真实目录里大文件
    // 常聚集(fernflower bd.java 0.3s vs 小文件 1ms),连续切片会把多个
    // 大文件堆进同一线程成为关键路径——3000 文件混合负载实测并行度仅
    // 7.3×/18 核,改队列后取号即做、天然均衡。
    let n_threads = worker_threads(opts.threads, jobs.len());
    let opts2 = opts.clone();
    let next = std::sync::atomic::AtomicUsize::new(0);
    let shared: Vec<(&PathBuf, &Option<PathBuf>, &str)> =
        jobs.iter().map(|(p, o, d)| (p, o, d.as_str())).collect();
    let results: Vec<Result<Vec<(usize, FileResult)>, String>> = std::thread::scope(|s| {
        let handles: Vec<_> = (0..n_threads)
            .map(|_| {
                let opts = opts2.clone();
                let next = &next;
                let shared = &shared;
                s.spawn(move || {
                    let mut my: Vec<(usize, FileResult)> = Vec::new();
                    // 每线程一个批量读取器:Linux+io-uring 特性下为 ring
                    // 实例(按取号组 64 文件批量 open/read/close),其余
                    // 平台退化为逐文件 fs::read_to_string(零开销占位)
                    let mut reader = io_batch::BatchFileReader::new();
                    // 批量取号(64/次):原子争用降 64×(37 万文件 × 16 线程
                    // 逐文件 fetch_add——采样 ~8% ulock_wait)
                    'grab: loop {
                        let base =
                            next.fetch_add(io_batch::BATCH, std::sync::atomic::Ordering::Relaxed);
                        let group: Vec<usize> = (base..base + io_batch::BATCH)
                            .filter(|&i| i < shared.len())
                            .collect();
                        if group.is_empty() {
                            break 'grab;
                        }
                        let paths: Vec<&Path> =
                            group.iter().map(|&i| shared[i].0.as_path()).collect();
                        // 非 UTF-8(ISO-8859-1/Cp1252 等编码测试文件)或读失败:
                        // 告警跳过而非中止整个目录运行(spoon/javaparser 语料
                        // 各含一个编码测试文件——曾让 5000+ 文件的运行整体失败)
                        let contents = reader.read_batch(&paths);
                        for (i, res) in group.into_iter().zip(contents) {
                            let (path, out_path, display_raw) = shared[i];
                            let display = if display_raw.is_empty() {
                                path.display().to_string()
                            } else {
                                display_raw.to_string()
                            };
                            let src = match res {
                                Ok(s) => s,
                                Err(e) => {
                                    eprintln!(
                                        "cure: 读取 {} 失败(跳过): {}",
                                        path.display(),
                                        e
                                    );
                                    continue;
                                }
                            };
                            // 逐文件按后缀分派(多语言目录树混放时各自走各自管线)
                            let ext = path
                                .extension()
                                .and_then(|e| e.to_str())
                                .map(|e| e.to_ascii_lowercase())
                                .unwrap_or_default();
                            let backend = if let Some(lang) = &opts.lang {
                                backend_for_lang(lang).expect("validated --lang")
                            } else {
                                backend_for_ext(&ext).unwrap_or(&LANG_BACKENDS[0])
                            };
                            let r = (backend.process)(&src, &opts, out_path.clone(), &display)?;
                            my.push((i, r));
                        }
                    }
                    Ok(my)
                })
            })
            .collect();
        handles
            .into_iter()
            .map(|h| h.join().expect("cure 线程 panic"))
            .collect()
    });
    // 结果按文件原始顺序稳定输出(诊断/统计确定性)
    let mut all: Vec<(usize, FileResult)> = Vec::new();
    for r in results {
        all.extend(r?);
    }
    all.sort_by_key(|(i, _)| *i);
    let all: Vec<FileResult> = all.into_iter().map(|(_, r)| r).collect();

    // --copy-other:非源文件原样拷贝
    for (src, dst) in copy_jobs {
        if fs::copy(&src, &dst).is_err() {
            eprintln!("cure: 拷贝 {} 失败(跳过)", src.display());
        }
    }

    // --diff:串行打印(保持顺序)
    if opts.diff {
        for r in &all {
            if r.changed && !r.diff_text.is_empty() {
                println!("{}", r.diff_text);
            }
        }
    }

    // --diff:串行打印(保持顺序)
    if opts.diff {
        for r in &all {
            if r.changed && !r.diff_text.is_empty() {
                println!("{}", r.diff_text);
            }
        }
    }

    // 汇总(多文件与单文件共用)
    print_stats_summary(&all, &opts);

    let any_changed = all.iter().any(|r| r.changed);
    let any_error = all.iter().any(|r| r.errored);
    Ok(final_code_opts(any_changed, any_error, &opts))
}

/// 汇总统计(stderr)。单文件 + stdout 路径同样调用——简化效果指标
/// (节点/判定点/嵌套)应当随处可得。
fn print_stats_summary(all: &[FileResult], opts: &Options) {
    {
        let changed = all.iter().filter(|r| r.changed).count();
        let errored = all.iter().filter(|r| r.errored).count();
        let edits: usize = all.iter().map(|r| r.edits).sum();
        let lb: usize = all.iter().map(|r| r.lines_before).sum();
        let la: usize = all.iter().map(|r| r.lines_after).sum();
        eprintln!(
            "cure: {} 个文件(改写 {} / 解析错误 {}),{} 次编辑",
            all.len(),
            changed,
            errored,
            edits
        );
        if opts.stats || opts.report {
            eprintln!("  行数 {lb} → {la}({:+.1}%)", (la as f64 - lb as f64) * 100.0 / lb.max(1) as f64);
            // 结构指标:与行数不同,不受格式化影响——区分「真简化」与
            // 「纯格式归一」,并定位零简化文件(规则缺口线索)
            let nb: u64 = all.iter().map(|r| r.nodes_before).sum();
            let na: u64 = all.iter().map(|r| r.nodes_after).sum();
            let db: u64 = all.iter().map(|r| r.decisions_before).sum();
            let da: u64 = all.iter().map(|r| r.decisions_after).sum();
            let dpb: u32 = all.iter().map(|r| r.depth_before).max().unwrap_or(0);
            let dpa: u32 = all.iter().map(|r| r.depth_after).max().unwrap_or(0);
            eprintln!(
                "  节点 {nb} → {na}({:+.1}%)判定点 {db} → {da}({:+.1}%)",
                (na as f64 - nb as f64) * 100.0 / nb.max(1) as f64,
                (da as f64 - db as f64) * 100.0 / db.max(1) as f64
            );
            eprintln!("  嵌套深度(文件最大值){dpb} → {dpa}");
            let structural: usize = all.iter().filter(|r| r.nodes_after < r.nodes_before).count();
            let fmt_only: usize = all
                .iter()
                .filter(|r| r.changed && r.nodes_after >= r.nodes_before && r.nodes_before > 0)
                .count();
            let untouched: usize = all.iter().filter(|r| !r.changed).count();
            eprintln!(
                "  简化质量:结构简化 {structural} / 仅格式 {fmt_only} / 未变 {untouched}"
            );
            let mut by_rule: std::collections::BTreeMap<&'static str, usize> = Default::default();
            for r in all {
                for (k, v) in &r.by_rule {
                    *by_rule.entry(k).or_insert(0) += v;
                }
            }
            if !by_rule.is_empty() {
                let detail: Vec<String> =
                    by_rule.iter().map(|(k, v)| format!("{k}={v}")).collect();
                eprintln!("  逐规则:{}", detail.join(", "));
            }
        }
    }
}

fn final_code_opts(any_changed: bool, any_error: bool, opts: &Options) -> ExitCode {
    if opts.strict && any_error {
        ExitCode::from(1)
    } else if opts.check && any_changed {
        ExitCode::from(2)
    } else {
        ExitCode::SUCCESS
    }
}

/// 处理单个源码文本。
/// TS/JS 管线(与 [`process_source`] 同构:parse → 门控简化 → 打印)。
fn process_source_ts(
    src: &str,
    opts: &Options,
    out_path: Option<PathBuf>,
    display: &str,
) -> Result<FileResult, String> {
    // 扩展名强制 script/module 目标(`.mjs`/`.mts` = ESM,顶层 await
    // 是运算符;`.cjs`/`.cts` = CommonJS;其余按顶层 import/export
    // 自动判定)。
    let disp = display.to_ascii_lowercase();
    let module_goal = if disp.ends_with(".mjs") || disp.ends_with(".mts") {
        Some(true)
    } else if disp.ends_with(".cjs") || disp.ends_with(".cts") {
        Some(false)
    } else {
        None
    };
    // `.js/.jsx/.mjs/.cjs` 关闭歧义 TS 泛型形态(`a < b > (c)` 是
    // 比较链而非 `a<b>(c)` 调用);`.ts/.tsx/.mts/.cts` 及未知来源
    // 保留 TS 语法。
    let ts_syntax = !(disp.ends_with(".js")
        || disp.ends_with(".jsx")
        || disp.ends_with(".mjs")
        || disp.ends_with(".cjs"));
    // `.ts/.mts/.cts` 里 JSX 不合法:表达式起始的 `<` 是 TS 尖括号类型
    // 断言(`<Foo>z`),不能按 JSX 吞到语句边界;`.tsx/.jsx` 与无扩展
    // 来源保持 JSX 捕获。
    let jsx = !(disp.ends_with(".ts") || disp.ends_with(".mts") || disp.ends_with(".cts"));
    let mut outcome = parse_with_options(
        src,
        ParseOptions {
            module_goal,
            capture_source: opts.preserve_function_source,
            ts_syntax,
            jsx,
        },
    );
    if opts.preserve_function_source {
        outcome.ast.set_preserve_source(true);
    }
    let had_errors = !outcome.errors.is_empty();
    let need_lines = opts.stats || opts.report;
    let lines_before = if need_lines { src.lines().count() } else { 0 };
    let before_metrics = if need_lines {
        cure_ts_ast::unit_metrics(&outcome.ast, &outcome.unit)
    } else {
        Default::default()
    };

    let mut result = FileResult {
        errored: had_errors,
        lines_before,
        nodes_before: before_metrics.nodes,
        decisions_before: before_metrics.decisions,
        depth_before: before_metrics.max_depth,
        display: display.to_string(),
        ..Default::default()
    };

    if !opts.format_only {
        let mut cfg = Config::default();
        for r in &opts.disabled {
            cfg.disabled_rules.insert(r.clone());
        }
        cfg.remove_dead_methods = opts.dead_code;
        cfg.preserve_function_source = opts.preserve_function_source;
        let report = ts_simplify_unit(&mut outcome.ast, &mut outcome.unit, &cfg);
        if need_lines {
            let after_metrics = cure_ts_ast::unit_metrics(&outcome.ast, &outcome.unit);
            result.nodes_after = after_metrics.nodes;
            result.decisions_after = after_metrics.decisions;
            result.depth_after = after_metrics.max_depth;
        }
        result.edits = report.edits;
        result.by_rule = report.by_rule.iter().map(|(k, v)| (*k, *v)).collect();
        if opts.report {
            eprintln!(
                "cure: {display}: {} 次改写 / {} 轮",
                report.edits, report.iterations
            );
            if need_lines {
                eprintln!(
                    "  结构:节点 {}→{} / 判定点 {}→{} / 嵌套 {}→{}",
                    before_metrics.nodes, result.nodes_after,
                    before_metrics.decisions, result.decisions_after,
                    before_metrics.max_depth, result.depth_after
                );
            }
            if !report.by_rule.is_empty() {
                let detail: Vec<String> =
                    report.by_rule.iter().map(|(k, v)| format!("{k}={v}")).collect();
                eprintln!("  逐规则:{}", detail.join(", "));
            }
        }
    }
    let printed = ts_print(&outcome.ast, &outcome.unit);
    if need_lines {
        result.lines_after = printed.lines().count();
        if result.nodes_before > 0 && result.nodes_after == 0 {
            result.nodes_after = result.nodes_before;
            result.decisions_after = result.decisions_before;
            result.depth_after = result.depth_before;
        }
    }

    if had_errors {
        eprintln!(
            "cure: {display}: {} 处语法问题已跳过(保留原文):",
            outcome.errors.len()
        );
        for e in outcome.errors.iter().take(5) {
            eprintln!("  {display}:{}:{}: {}", e.line, e.col, e.message);
        }
        if outcome.errors.len() > 5 {
            eprintln!("  … 其余 {} 处省略", outcome.errors.len() - 5);
        }
    }

    result.changed = printed != src;

    if opts.diff && result.changed {
        result.diff_text = unified_diff(src, &printed, display);
    }

    if opts.check {
        return Ok(result);
    }

    match out_path {
        Some(p) => fs::write(&p, printed).map_err(|e| format!("写入 {} 失败: {e}", p.display()))?,
        None => {
            let mut stdout = std::io::stdout().lock();
            stdout
                .write_all(printed.as_bytes())
                .map_err(|e| format!("写出失败: {e}"))?;
            if !printed.ends_with('\n') {
                let _ = stdout.write_all(b"\n");
            }
        }
    }
    Ok(result)
}

/// Python 管线(parse → 门控简化 → 打印)。
fn process_source_py(
    src: &str,
    opts: &Options,
    out_path: Option<PathBuf>,
    display: &str,
) -> Result<FileResult, String> {
    let mut outcome = py_parse(src);
    let had_errors = !outcome.errors.is_empty();
    let need_lines = opts.stats || opts.report;
    let lines_before = if need_lines { src.lines().count() } else { 0 };
    let (nodes_b, dec_b, depth_b) = if need_lines {
        cure_python_ast::unit_metrics(&outcome.ast, outcome.module)
    } else {
        (0, 0, 0)
    };

    let mut result = FileResult {
        errored: had_errors,
        lines_before,
        nodes_before: nodes_b,
        decisions_before: dec_b,
        depth_before: depth_b,
        display: display.to_string(),
        ..Default::default()
    };

    if !opts.format_only {
        let mut cfg = Config::default();
        for r in &opts.disabled {
            cfg.disabled_rules.insert(r.clone());
        }
        cfg.remove_dead_methods = opts.dead_code;
        let report = py_simplify(&mut outcome.ast, outcome.module, &cfg);
        if need_lines {
            let (n, d, dep) = cure_python_ast::unit_metrics(&outcome.ast, outcome.module);
            result.nodes_after = n;
            result.decisions_after = d;
            result.depth_after = dep;
        }
        result.edits = report.edits;
        result.by_rule = report.by_rule.iter().map(|(k, v)| (*k, *v)).collect();
        if opts.report {
            eprintln!(
                "cure: {display}: {} 次改写 / {} 轮",
                report.edits, report.iterations
            );
            if need_lines {
                eprintln!(
                    "  结构:节点 {}→{} / 判定点 {}→{} / 嵌套 {}→{}",
                    nodes_b,
                    result.nodes_after,
                    dec_b,
                    result.decisions_after,
                    depth_b,
                    result.depth_after
                );
            }
            if !report.by_rule.is_empty() {
                let detail: Vec<String> = report
                    .by_rule
                    .iter()
                    .map(|(k, v)| format!("{k}={v}"))
                    .collect();
                eprintln!("  逐规则:{}", detail.join(", "));
            }
        }
    }
    let printed = py_print(&outcome.ast, outcome.module);
    if need_lines {
        result.lines_after = printed.lines().count();
        if result.nodes_before > 0 && result.nodes_after == 0 {
            result.nodes_after = result.nodes_before;
            result.decisions_after = result.decisions_before;
            result.depth_after = result.depth_before;
        }
    }
    if had_errors {
        eprintln!(
            "cure: {display}: {} 处语法问题已跳过(保留原文):",
            outcome.errors.len()
        );
        for e in outcome.errors.iter().take(5) {
            eprintln!("  {display}:{}:{}: {}", e.line, e.col, e.message);
        }
        if outcome.errors.len() > 5 {
            eprintln!("  … 其余 {} 处省略", outcome.errors.len() - 5);
        }
    }
    result.changed = printed != src;
    if opts.diff && result.changed {
        result.diff_text = unified_diff(src, &printed, display);
    }
    if opts.check {
        return Ok(result);
    }
    match out_path {
        Some(p) => fs::write(&p, printed).map_err(|e| format!("写入 {} 失败: {e}", p.display()))?,
        None => {
            let mut stdout = std::io::stdout().lock();
            stdout
                .write_all(printed.as_bytes())
                .map_err(|e| format!("写出失败: {e}"))?;
            if !printed.ends_with('\n') {
                let _ = stdout.write_all(b"\n");
            }
        }
    }
    Ok(result)
}

fn process_source_dart(
    src: &str,
    opts: &Options,
    out_path: Option<PathBuf>,
    display: &str,
) -> Result<FileResult, String> {
    let mut outcome = dart_parse(src);
    let had_errors = !outcome.errors.is_empty();
    let need_lines = opts.stats || opts.report;
    let lines_before = if need_lines { src.lines().count() } else { 0 };
    let (nodes_b, dec_b, depth_b) = if need_lines {
        cure_dart_ast::unit_metrics(&outcome.ast)
    } else {
        (0, 0, 0)
    };
    let mut result = FileResult {
        errored: had_errors,
        lines_before,
        nodes_before: nodes_b,
        decisions_before: dec_b,
        depth_before: depth_b,
        display: display.to_string(),
        ..Default::default()
    };
    if !opts.format_only {
        let mut cfg = Config::default();
        for r in &opts.disabled {
            cfg.disabled_rules.insert(r.clone());
        }
        cfg.remove_dead_methods = opts.dead_code;
        let report = dart_simplify(&mut outcome.ast, &cfg);
        if need_lines {
            let (n, d, dep) = cure_dart_ast::unit_metrics(&outcome.ast);
            result.nodes_after = n;
            result.decisions_after = d;
            result.depth_after = dep;
        }
        result.edits = report.edits;
        result.by_rule = report.by_rule.iter().map(|(k, v)| (*k, *v)).collect();
        if opts.report {
            eprintln!(
                "cure: {display}: {} 次改写 / {} 轮",
                report.edits, report.iterations
            );
            if need_lines {
                eprintln!(
                    "  结构:节点 {}→{} / 判定点 {}→{} / 嵌套 {}→{}",
                    nodes_b,
                    result.nodes_after,
                    dec_b,
                    result.decisions_after,
                    depth_b,
                    result.depth_after
                );
            }
            if !report.by_rule.is_empty() {
                let detail: Vec<String> = report
                    .by_rule
                    .iter()
                    .map(|(k, v)| format!("{k}={v}"))
                    .collect();
                eprintln!("  逐规则:{}", detail.join(", "));
            }
        }
    }
    let printed = dart_print(&outcome.ast);
    if need_lines {
        result.lines_after = printed.lines().count();
        if result.nodes_before > 0 && result.nodes_after == 0 {
            result.nodes_after = result.nodes_before;
            result.decisions_after = result.decisions_before;
            result.depth_after = result.depth_before;
        }
    }
    if had_errors {
        eprintln!(
            "cure: {display}: {} 处语法问题已跳过(保留原文):",
            outcome.errors.len()
        );
        for e in outcome.errors.iter().take(5) {
            eprintln!("  {display}:{}:{}: {}", e.line, e.col, e.message);
        }
        if outcome.errors.len() > 5 {
            eprintln!("  … 其余 {} 处省略", outcome.errors.len() - 5);
        }
    }
    result.changed = printed != src;
    if opts.diff && result.changed {
        result.diff_text = unified_diff(src, &printed, display);
    }
    if opts.check {
        return Ok(result);
    }
    match out_path {
        Some(p) => fs::write(&p, printed).map_err(|e| format!("写入 {} 失败: {e}", p.display()))?,
        None => {
            let mut stdout = std::io::stdout().lock();
            stdout
                .write_all(printed.as_bytes())
                .map_err(|e| format!("写出失败: {e}"))?;
            if !printed.ends_with('\n') {
                let _ = stdout.write_all(b"\n");
            }
        }
    }
    Ok(result)
}

fn process_source(
    src: &str,
    opts: &Options,
    out_path: Option<PathBuf>,
    display: &str,
) -> Result<FileResult, String> {
    let mut outcome = parse(src);
    let had_errors = !outcome.errors.is_empty();
    // 行数统计延迟到需要时(--stats/--report)——lines() 迭代在 37 万文件
    // 批处理下纯浪费(采样 Lines::next ~2%)
    let need_lines = opts.stats || opts.report;
    let lines_before = if need_lines { src.lines().count() } else { 0 };
    // 结构指标(节点/判定点/嵌套)与行数同门控:37 万文件批处理下
    // 全量 walk 是纯浪费(各 O(节点))
    let before_metrics =
        if need_lines { cure_java_ast::unit_metrics(&outcome.ast, &outcome.unit) } else { Default::default() };

    let mut result = FileResult {
        errored: had_errors,
        lines_before,
        nodes_before: before_metrics.nodes,
        decisions_before: before_metrics.decisions,
        depth_before: before_metrics.max_depth,
        display: display.to_string(),
        ..Default::default()
    };

    if let Some(home) = &opts.jdk_home {
        cure_java_simplify::set_jdk_home(std::path::Path::new(home));
    }
    if !opts.format_only {
        let mut cfg = Config::default();
        for r in &opts.disabled {
            cfg.disabled_rules.insert(r.clone());
        }
        cfg.remove_dead_methods = opts.dead_code;
        let report = simplify_unit(&mut outcome.ast, &mut outcome.unit, &cfg);
        if need_lines {
            let after_metrics = cure_java_ast::unit_metrics(&outcome.ast, &outcome.unit);
            result.nodes_after = after_metrics.nodes;
            result.decisions_after = after_metrics.decisions;
            result.depth_after = after_metrics.max_depth;
        }
        result.edits = report.edits;
        result.by_rule = report.by_rule.iter().map(|(k, v)| (*k, *v)).collect();
        if opts.report {
            eprintln!(
                "cure: {display}: {} 次改写 / {} 轮",
                report.edits, report.iterations
            );
            if need_lines {
                eprintln!(
                    "  结构:节点 {}→{} / 判定点 {}→{} / 嵌套 {}→{}",
                    before_metrics.nodes, result.nodes_after,
                    before_metrics.decisions, result.decisions_after,
                    before_metrics.max_depth, result.depth_after
                );
            }
            if !report.by_rule.is_empty() {
                let detail: Vec<String> =
                    report.by_rule.iter().map(|(k, v)| format!("{k}={v}")).collect();
                eprintln!("  逐规则:{}", detail.join(", "));
            }
        }
    }
    let printed = print_unit(&outcome.ast, &outcome.unit);
    if need_lines {
        result.lines_after = printed.lines().count();
        if result.nodes_before > 0 && result.nodes_after == 0 {
            // format_only(未跑简化):结构视为不变。简化跑过则不可能
            // 归零——有方法体的单元 after 至少含各 Block 根节点
            result.nodes_after = result.nodes_before;
            result.decisions_after = result.decisions_before;
            result.depth_after = result.depth_before;
        }
    }

    if had_errors {
        eprintln!(
            "cure: {display}: {} 处语法问题已跳过(保留原文):",
            outcome.errors.len()
        );
        for e in outcome.errors.iter().take(5) {
            eprintln!("  {display}:{}:{}: {}", e.line, e.col, e.message);
        }
        if outcome.errors.len() > 5 {
            eprintln!("  … 其余 {} 处省略", outcome.errors.len() - 5);
        }
    }

    result.changed = printed != src;

    if opts.diff && result.changed {
        result.diff_text = unified_diff(src, &printed, display);
    }

    if opts.check {
        return Ok(result);
    }

    match out_path {
        Some(p) => fs::write(&p, printed).map_err(|e| format!("写入 {} 失败: {e}", p.display()))?,
        None => {
            let mut stdout = std::io::stdout().lock();
            stdout
                .write_all(printed.as_bytes())
                .map_err(|e| format!("写出失败: {e}"))?;
            if !printed.ends_with('\n') {
                let _ = stdout.write_all(b"\n");
            }
        }
    }
    Ok(result)
}

// ---------------------------------------------------------------------------
// 统一 diff(Myers 最短编辑脚本 + 上下文行)。差异过大(编辑距离超限)时
// 退化为提示文本——反混淆输出与原文差异通常巨大,逐行 diff 无审阅价值。
// ---------------------------------------------------------------------------

const DIFF_MAX_D: usize = 3000;
const DIFF_CONTEXT: usize = 3;

fn unified_diff(old: &str, new: &str, display: &str) -> String {
    let a: Vec<&str> = old.lines().collect();
    let b: Vec<&str> = new.lines().collect();
    // 同首尾裁剪:典型改写只动中间
    let mut lo = 0;
    while lo < a.len() && lo < b.len() && a[lo] == b[lo] {
        lo += 1;
    }
    let mut hi = 0;
    while hi < a.len() - lo && hi < b.len() - lo && a[a.len() - 1 - hi] == b[b.len() - 1 - hi] {
        hi += 1;
    }
    let mid_a = &a[lo..a.len() - hi];
    let mid_b = &b[lo..b.len() - hi];
    if mid_a.is_empty() && mid_b.is_empty() {
        return String::new();
    }
    let Some(script) = myers_script(mid_a, mid_b) else {
        return format!(
            "--- {display}\n+++ {display}\n@@ 差异过大(> {DIFF_MAX_D} 行编辑),省略;旧 {lines_a} 行 / 新 {lines_b} 行 @@\n",
            lines_a = a.len(),
            lines_b = b.len(),
        );
    };
    // script: Vec<(usize a_idx, usize b_idx, op)> 相对 mid
    // 转换为 hunks(带上下文)
    let mut out = format!("--- {display}\n+++ {display}\n");
    let mut hunks: Vec<String> = Vec::new();
    let mut i = 0;
    while i < script.len() {
        if script[i].2 == DiffOp::Equal {
            i += 1;
            continue;
        }
        // 找到本块的编辑跨度(连续非 Equal 段及其间隙 ≤ 2*上下文)
        let start = i;
        let mut j = i;
        let mut last_edit = i;
        while j < script.len() {
            if script[j].2 != DiffOp::Equal {
                last_edit = j;
                j += 1;
            } else {
                // 数连续 Equal;小于 2*ctx 则并入同一 hunk
                let mut k = j;
                while k < script.len() && script[k].2 == DiffOp::Equal {
                    k += 1;
                }
                if k - j > DIFF_CONTEXT * 2 || k == script.len() {
                    break;
                }
                j = k;
            }
        }
        let end = last_edit + 1;
        let ctx_start = start.saturating_sub(DIFF_CONTEXT);
        let ctx_end = (end + DIFF_CONTEXT).min(script.len());
        let a_start = lo + ctx_start;
        let b_start = lo + ctx_start;
        let a_count = script[ctx_start..ctx_end]
            .iter()
            .filter(|(_, _, op)| *op != DiffOp::Insert)
            .count();
        let b_count = script[ctx_start..ctx_end]
            .iter()
            .filter(|(_, _, op)| *op != DiffOp::Delete)
            .count();
        let mut h = format!(
            "@@ -{},{} +{},{} @@\n",
            a_start + 1,
            a_count,
            b_start + 1,
            b_count
        );
        for (ai, bi, op) in &script[ctx_start..ctx_end] {
            match op {
                DiffOp::Equal => h.push_str(&format!(" {}\n", a[lo + *ai])),
                DiffOp::Delete => h.push_str(&format!("-{}\n", a[lo + *ai])),
                DiffOp::Insert => h.push_str(&format!("+{}\n", b[lo + *bi])),
            }
        }
        hunks.push(h);
        i = end;
    }
    for h in hunks {
        out.push_str(&h);
    }
    out
}

#[derive(PartialEq, Eq, Clone, Copy)]
enum DiffOp {
    Equal,
    Delete,
    Insert,
}

/// Myers 贪心算法(前进版 + V 快照回溯)。返回编辑脚本
/// Vec<(a_idx, b_idx, op)>(Equal 的 ai/bi 都有效;Delete 只用 ai;Insert 只用 bi)。
fn myers_script(a: &[&str], b: &[&str]) -> Option<Vec<(usize, usize, DiffOp)>> {
    let n = a.len();
    let m = b.len();
    let max = n + m;
    if max == 0 {
        return Some(Vec::new());
    }
    let offset = max as isize;
    let mut v = vec![0isize; 2 * max + 1];
    let mut trace: Vec<Vec<isize>> = Vec::new();
    let mut found_d: Option<usize> = None;
    'outer: for d in 0..=max {
        if d > DIFF_MAX_D {
            return None;
        }
        trace.push(v.clone());
        let mut k = -(d as isize);
        while k <= d as isize {
            let mut x = if k == -(d as isize)
                || (k != d as isize && v[(k - 1 + offset) as usize] < v[(k + 1 + offset) as usize])
            {
                v[(k + 1 + offset) as usize]
            } else {
                v[(k - 1 + offset) as usize] + 1
            };
            let mut y = x - k;
            while (x as usize) < n && (y as usize) < m && a[x as usize] == b[y as usize] {
                x += 1;
                y += 1;
            }
            v[(k + offset) as usize] = x;
            if x as usize >= n && y as usize >= m {
                found_d = Some(d);
                break 'outer;
            }
            k += 2;
        }
    }
    let d_final = found_d?;
    // 回溯
    let mut ops: Vec<(usize, usize, DiffOp)> = Vec::new();
    let mut x = n as isize;
    let mut y = m as isize;
    for d in (1..=d_final).rev() {
        let v = &trace[d];
        let k = x - y;
        let prev_k = if k == -(d as isize)
            || (k != d as isize && v[(k - 1 + offset) as usize] < v[(k + 1 + offset) as usize])
        {
            k + 1
        } else {
            k - 1
        };
        let prev_x = v[(prev_k + offset) as usize];
        let prev_y = prev_x - prev_k;
        // 从 (prev_x, prev_y) 走到 (x, y):先一步斜/插/删,再对角 Equals
        while x > prev_x && y > prev_y {
            x -= 1;
            y -= 1;
            ops.push((x as usize, y as usize, DiffOp::Equal));
        }
        if x > prev_x {
            x -= 1;
            ops.push((x as usize, y as usize, DiffOp::Delete));
        } else if y > prev_y {
            y -= 1;
            ops.push((x as usize, y as usize, DiffOp::Insert));
        }
    }
    // d == 0:剩余对角
    while x > 0 && y > 0 {
        x -= 1;
        y -= 1;
        ops.push((x as usize, y as usize, DiffOp::Equal));
    }
    ops.reverse();
    Some(ops)
}

// ---------------------------------------------------------------------------
// 集成测试(直接调用 run(),临时目录)
// ---------------------------------------------------------------------------

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn worker_threads_policy() {
        let cores = std::thread::available_parallelism().map(|n| n.get()).unwrap_or(4);
        // 自动 = 1.5× 核心数(任务充足时)
        assert_eq!(worker_threads(0, 10_000), (cores + cores / 2).min(10_000));
        // 用户指定优先;不超过任务数;至少 1
        assert_eq!(worker_threads(3, 10), 3);
        assert_eq!(worker_threads(5, 2), 2);
        assert_eq!(worker_threads(1, 1), 1);
        assert_eq!(worker_threads(0, 1), 1);
    }

    fn tmp(name: &str) -> PathBuf {
        let d = std::env::temp_dir().join(format!("cure_cli_test_{name}_{}", std::process::id()));
        let _ = fs::remove_dir_all(&d);
        fs::create_dir_all(&d).unwrap();
        d
    }

    fn write(p: &Path, content: &str) {
        fs::create_dir_all(p.parent().unwrap()).unwrap();
        fs::write(p, content).unwrap();
    }

    const SRC: &str = "class A{int m(){int x=0;int y=5;return x+y*1;}}";
    const EXPECT_CONTAINS: &str = "return 5;";

    #[test]
    fn dir_mode_creates_sibling_cure_dir_with_structure() {
        let root = tmp("dir");
        write(&root.join("src/com/x/a.java"), SRC);
        write(&root.join("b.java"), "class B{int m(){int x=0;return x;}}");
        let code = run(&[root.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        let out = root.parent().unwrap().join(format!("{}-cure-out", root.file_name().unwrap().to_str().unwrap()));
        let a = fs::read_to_string(out.join("src/com/x/a.java")).unwrap();
        assert!(a.contains(EXPECT_CONTAINS), "{a}");
        assert!(out.join("b.java").exists());
        // 非源码文件默认不拷贝
        assert!(!out.join("src").join("anything.txt").exists());
        let _ = fs::remove_dir_all(&root);
        let _ = fs::remove_dir_all(&out);
    }

    #[test]
    fn dir_mode_copy_other_copies_non_source() {
        let root = tmp("copy");
        write(&root.join("a.java"), SRC);
        write(&root.join("docs/readme.md"), "hello");
        let code = run(&["--copy-other".into(), root.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        let out = root.parent().unwrap().join(format!("{}-cure-out", root.file_name().unwrap().to_str().unwrap()));
        assert_eq!(fs::read_to_string(out.join("docs/readme.md")).unwrap(), "hello");
        let _ = fs::remove_dir_all(&root);
        let _ = fs::remove_dir_all(&out);
    }

    #[test]
    fn check_mode_exit_2_when_changeable() {
        let root = tmp("check");
        write(&root.join("a.java"), SRC);
        let code = run(&["--check".into(), root.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::from(2));
        // 不写出
        let out = root.parent().unwrap().join(format!("{}-cure-out", root.file_name().unwrap().to_str().unwrap()));
        assert!(!out.exists());
        let _ = fs::remove_dir_all(&root);
    }

    #[test]
    fn check_mode_exit_0_when_clean() {
        let root = tmp("check0");
        let clean = "class A {\n    int m() {\n        return 5;\n    }\n}\n";
        write(&root.join("a.java"), clean);
        let code = run(&["--check".into(), "--format-only".into(), root.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        let _ = fs::remove_dir_all(&root);
    }

    #[test]
    fn ext_filter_processes_matching_only() {
        let root = tmp("ext");
        write(&root.join("a.java"), SRC);
        write(&root.join("notjava.txt"), "garbage");
        // --ext java 正常
        let code = run(&["--ext".into(), "java".into(), root.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        // 全是空格分隔 + 前导点 + 大写
        let root2 = tmp("ext2");
        write(&root2.join("a.java"), SRC);
        let code = run(&["--ext".into(), ".JAVA, py".into(), root2.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        let out2 = root2.parent().unwrap().join(format!("{}-cure-out", root2.file_name().unwrap().to_str().unwrap()));
        assert!(fs::read_to_string(out2.join("a.java")).unwrap().contains(EXPECT_CONTAINS));
        let _ = fs::remove_dir_all(&root);
        let _ = fs::remove_dir_all(&root2);
    }

    #[test]
    fn in_place_write() {
        let root = tmp("inplace");
        let f = root.join("a.java");
        write(&f, SRC);
        let code = run(&["-w".into(), f.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        assert!(fs::read_to_string(&f).unwrap().contains(EXPECT_CONTAINS));
        let _ = fs::remove_dir_all(&root);
    }

    #[test]
    fn multiple_files_stdout_rejected() {
        let root = tmp("multiout");
        write(&root.join("a.java"), SRC);
        write(&root.join("b.java"), SRC);
        let r = run(&[root.join("a.java").display().to_string(), root.join("b.java").display().to_string()]);
        assert!(r.is_err());
        let _ = fs::remove_dir_all(&root);
    }

    #[test]
    fn single_file_no_output_writes_no_file() {
        let root = tmp("single");
        let f = root.join("a.java");
        write(&f, SRC);
        // stdout 模式:不落盘(内容校验交由 process_source 的单元路径)
        let code = run(&[f.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        // 原文件不变
        assert_eq!(fs::read_to_string(&f).unwrap(), SRC);
        let _ = fs::remove_dir_all(&root);
    }

    #[test]
    fn myers_diff_basics() {
        let d = unified_diff("a\nb\nc\n", "a\nx\nc\n", "f");
        assert!(d.contains("-b"), "{d}");
        assert!(d.contains("+x"), "{d}");
        assert!(d.contains("@@"), "{d}");
        // 相同 → 空
        assert!(unified_diff("a\n", "a\n", "f").is_empty());
        // 超大差异 → 退化提示
        let big_old: Vec<String> = (0..4000).map(|i| format!("old{i}")).collect();
        let big_new: Vec<String> = (0..4000).map(|i| format!("new{i}")).collect();
        let d = unified_diff(&big_old.join("\n"), &big_new.join("\n"), "f");
        assert!(d.contains("差异过大"), "{}", &d[..80.min(d.len())]);
    }

    #[test]
    fn stdin_and_bad_args() {
        // 未支持后缀全给出 → 报错
        let r = run(&["--ext".into(), "py".into()]);
        assert!(r.is_err());
        // 无输入
        assert!(run(&[]).is_err());
        // 显式语言别名
        assert_eq!(backend_for_lang("ts").unwrap().name, "typescript/javascript");
        assert_eq!(backend_for_lang("js").unwrap().name, "typescript/javascript");
        assert_eq!(backend_for_lang("java").unwrap().name, "java");
        assert_eq!(backend_for_lang("python").unwrap().name, "python");
        assert_eq!(backend_for_lang("py").unwrap().name, "python");
        assert!(backend_for_lang("bogus").is_none());
        let opts = parse_args(&["--lang".into(), "ts".into(), "-".into()]).unwrap();
        assert_eq!(opts.lang.as_deref(), Some("ts"));
    }

    #[test]
    fn lang_filter_limits_dir_extensions() {
        let root = tmp("pydir");
        write(&root.join("a.py"), "x = 1 + 2\nprint(x)\n");
        write(&root.join("b.js"), "const x = 1 + 2; console.log(x);\n");
        let code = run(&["--lang".into(), "py".into(), root.display().to_string()]).unwrap();
        assert_eq!(code, ExitCode::SUCCESS);
        let out = root.parent().unwrap().join(format!(
            "{}-cure-out",
            root.file_name().unwrap().to_str().unwrap()
        ));
        assert!(out.join("a.py").exists(), "python file missing");
        assert!(
            !out.join("b.js").exists(),
            "javascript leaked into --lang py run"
        );
        let a = fs::read_to_string(out.join("a.py")).unwrap();
        assert!(a.contains("x = 3"), "{a}");
        assert!(!a.contains("1 + 2"), "{a}");
        let _ = fs::remove_dir_all(&root);
        let _ = fs::remove_dir_all(&out);
    }

    #[test]
    fn check_reports_converged_python_as_clean() {
        let root = tmp("pycheck");
        let plain = root.join("plain.py");
        write(&plain, "x = -1\nprint(x)\n");
        let code = run(&[
            "--lang".into(),
            "py".into(),
            "--check".into(),
            plain.display().to_string(),
        ])
        .unwrap();
        assert_eq!(
            code,
            ExitCode::SUCCESS,
            "converged file reported rewritable"
        );

        let fold = root.join("fold.py");
        write(&fold, "x = 1 + 2\nprint(x)\n");
        let code = run(&[
            "--lang".into(),
            "py".into(),
            "--check".into(),
            fold.display().to_string(),
        ])
        .unwrap();
        assert_eq!(code, ExitCode::from(2), "rewritable file not reported");
        let _ = fs::remove_dir_all(&root);
    }
}