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
//! Type-specific infer pattern matching helpers.
//!
//! Contains specialized pattern matchers for different type structures:
//! - Function type patterns
//! - Constructor type patterns
//! - Callable type patterns
//! - Object type patterns
//! - Object with index patterns
//! - Union type patterns
//! - Template literal patterns
use crate::subtype::{SubtypeChecker, TypeResolver};
use crate::types::{
CallableShapeId, FunctionShape, FunctionShapeId, ObjectShapeId, ParamInfo, TemplateSpan,
TupleElement, TypeData, TypeId, TypeListId, TypeParamInfo,
};
use crate::utils;
use rustc_hash::{FxHashMap, FxHashSet};
use tsz_common::interner::Atom;
use super::super::evaluate::TypeEvaluator;
impl<'a, R: TypeResolver> TypeEvaluator<'a, R> {
pub(crate) fn match_infer_function_pattern(
&self,
source: TypeId,
pattern_fn_id: FunctionShapeId,
pattern: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>,
_visited: &mut FxHashSet<(TypeId, TypeId)>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
let pattern_fn = self.interner().function_shape(pattern_fn_id);
let has_param_infer = pattern_fn
.params
.iter()
.any(|param| self.type_contains_infer(param.type_id));
let has_return_infer = self.type_contains_infer(pattern_fn.return_type);
if pattern_fn.this_type.is_none() && has_param_infer && has_return_infer {
// Check if pattern has a single rest parameter (e.g., (...args: any[]) => infer R)
// This should match any function signature and only extract the return type
let has_single_rest_param = pattern_fn.params.len() == 1 && pattern_fn.params[0].rest;
let mut match_params_and_return = |_source_type: TypeId,
source_params: &[ParamInfo],
source_return: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>|
-> bool {
let mut local_visited = FxHashSet::default();
if has_single_rest_param {
// For a pattern like (...args: any[]) => infer R, we only care about
// matching the return type. The parameters are ignored.
// However, if the pattern parameter type contains infer, we still need to match it.
if self.type_contains_infer(pattern_fn.params[0].type_id) {
let pattern_param = &pattern_fn.params[0];
for source_param in source_params {
let source_param_type = if source_param.optional {
self.interner()
.union2(source_param.type_id, TypeId::UNDEFINED)
} else {
source_param.type_id
};
if !self.match_infer_pattern(
source_param_type,
pattern_param.type_id,
bindings,
&mut local_visited,
checker,
) {
return false;
}
}
}
// If the pattern param doesn't contain infer, skip parameter matching entirely
} else if !self.match_signature_params(
source_params,
&pattern_fn.params,
bindings,
&mut local_visited,
checker,
) {
return false;
}
if !self.match_infer_pattern(
source_return,
pattern_fn.return_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
// For infer pattern matching, once parameters and return type match successfully,
// the pattern is considered successful. The final subtype check is too strict
// because of function parameter contravariance (e.g., any vs concrete type).
// We've already matched the signature components above, which is sufficient.
true
};
return match self.interner().lookup(source) {
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
match_params_and_return(
source,
&source_fn.params,
source_fn.return_type,
bindings,
)
}
Some(TypeData::Callable(source_shape_id)) => {
// Match against the last call signature (TypeScript behavior)
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty() {
return false;
}
// Use the last call signature (TypeScript's behavior for overloads)
// Safe to use last() here as we've verified the vector is not empty
let source_sig = match source_shape.call_signatures.last() {
Some(sig) => sig,
None => return false,
};
match_params_and_return(
source,
&source_sig.params,
source_sig.return_type,
bindings,
)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
match self.interner().lookup(member) {
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
if !match_params_and_return(
member,
&source_fn.params,
source_fn.return_type,
&mut member_bindings,
) {
return false;
}
}
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty() {
return false;
}
// Safe to use last() here as we've verified the vector is not empty
let source_sig = match source_shape.call_signatures.last() {
Some(sig) => sig,
None => return false,
};
if !match_params_and_return(
member,
&source_sig.params,
source_sig.return_type,
&mut member_bindings,
) {
return false;
}
}
_ => return false,
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
};
}
if pattern_fn.this_type.is_none() && has_param_infer && !has_return_infer {
// Handle constructor function patterns differently
if pattern_fn.is_constructor {
return self.match_infer_constructor_pattern(
source,
&pattern_fn,
bindings,
checker,
);
}
// Regular function parameter inference
let mut match_function_params = |_source_type: TypeId,
source_fn_id: FunctionShapeId,
bindings: &mut FxHashMap<Atom, TypeId>|
-> bool {
let source_fn = self.interner().function_shape(source_fn_id);
if source_fn.params.len() != pattern_fn.params.len() {
return false;
}
let mut local_visited = FxHashSet::default();
for (source_param, pattern_param) in
source_fn.params.iter().zip(pattern_fn.params.iter())
{
if source_param.optional != pattern_param.optional
|| source_param.rest != pattern_param.rest
{
return false;
}
let source_param_type = if source_param.optional {
self.interner()
.union2(source_param.type_id, TypeId::UNDEFINED)
} else {
source_param.type_id
};
if !self.match_infer_pattern(
source_param_type,
pattern_param.type_id,
bindings,
&mut local_visited,
checker,
) {
return false;
}
}
// For param-only inference, parameter matching is sufficient.
// Skipping the final subtype check avoids issues with optional
// param widening (undefined added twice).
true
};
return match self.interner().lookup(source) {
Some(TypeData::Function(source_fn_id)) => {
match_function_params(source, source_fn_id, bindings)
}
Some(TypeData::Callable(source_shape_id)) => {
// Match against the last call signature (TypeScript behavior for overloads)
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty() {
return false;
}
let source_sig = source_shape.call_signatures.last().unwrap();
// Allow source to have more params than pattern (structural subtyping)
if source_sig.params.len() < pattern_fn.params.len() {
return false;
}
let mut local_visited = FxHashSet::default();
// Only match the first N params where N = pattern param count
for (source_param, pattern_param) in
source_sig.params.iter().zip(pattern_fn.params.iter())
{
// For optional params, strip undefined/null from the source type.
// Optional callback params like `onfulfilled?: ((value: T) => ...) | undefined | null`
// should match against `(value: infer V) => any` by stripping the nullish parts.
let source_param_type = if source_param.optional {
crate::narrowing::remove_nullish(self.interner(), source_param.type_id)
} else {
source_param.type_id
};
if !self.match_infer_pattern(
source_param_type,
pattern_param.type_id,
bindings,
&mut local_visited,
checker,
) {
return false;
}
}
true
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let Some(TypeData::Function(source_fn_id)) = self.interner().lookup(member)
else {
return false;
};
let mut member_bindings = FxHashMap::default();
if !match_function_params(member, source_fn_id, &mut member_bindings) {
return false;
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
};
}
if pattern_fn.this_type.is_none() && !has_param_infer && has_return_infer {
let mut match_return = |_source_type: TypeId,
source_return: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>|
-> bool {
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
source_return,
pattern_fn.return_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
// For return-only infer patterns, the return type match is sufficient.
// Skipping the final subtype check avoids issues with contravariance.
true
};
return match self.interner().lookup(source) {
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
match_return(source, source_fn.return_type, bindings)
}
Some(TypeData::Callable(source_shape_id)) => {
// Match against the last call signature (TypeScript behavior)
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty() {
return false;
}
// Safe to use last() here as we've verified the vector is not empty
let source_sig = match source_shape.call_signatures.last() {
Some(sig) => sig,
None => return false,
};
match_return(source, source_sig.return_type, bindings)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
match self.interner().lookup(member) {
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
if !match_return(
member,
source_fn.return_type,
&mut member_bindings,
) {
return false;
}
}
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty() {
return false;
}
// Safe to use last() here as we've verified the vector is not empty
let source_sig = match source_shape.call_signatures.last() {
Some(sig) => sig,
None => return false,
};
if !match_return(
member,
source_sig.return_type,
&mut member_bindings,
) {
return false;
}
}
_ => return false,
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
};
}
let Some(pattern_this) = pattern_fn.this_type else {
return checker.is_subtype_of(source, pattern);
};
if !self.type_contains_infer(pattern_this) {
return checker.is_subtype_of(source, pattern);
}
if has_param_infer || has_return_infer {
return false;
}
let mut match_function_this = |_source_type: TypeId,
source_fn_id: FunctionShapeId,
bindings: &mut FxHashMap<Atom, TypeId>|
-> bool {
let source_fn = self.interner().function_shape(source_fn_id);
// Use Unknown instead of Any for stricter type checking
// When this parameter type is not specified, use Unknown
let source_this = source_fn.this_type.unwrap_or(TypeId::UNKNOWN);
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
source_this,
pattern_this,
bindings,
&mut local_visited,
checker,
) {
return false;
}
// For this-type infer patterns, the this type match is sufficient.
// Skipping the final subtype check avoids contravariance issues.
true
};
match self.interner().lookup(source) {
Some(TypeData::Function(source_fn_id)) => {
match_function_this(source, source_fn_id, bindings)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let Some(TypeData::Function(source_fn_id)) = self.interner().lookup(member)
else {
return false;
};
let mut member_bindings = FxHashMap::default();
if !match_function_this(member, source_fn_id, &mut member_bindings) {
return false;
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
}
}
/// Helper for matching constructor function patterns.
pub(crate) fn match_infer_constructor_pattern(
&self,
source: TypeId,
pattern_fn: &FunctionShape,
bindings: &mut FxHashMap<Atom, TypeId>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
// Check if pattern has a single rest parameter with infer type
// e.g., new (...args: infer P) => any
let has_single_rest_infer = pattern_fn.params.len() == 1
&& pattern_fn.params[0].rest
&& self.type_contains_infer(pattern_fn.params[0].type_id);
if has_single_rest_infer {
let infer_ty = pattern_fn.params[0].type_id;
let mut match_construct_params_tuple = |source_params: &[ParamInfo],
bindings: &mut FxHashMap<Atom, TypeId>|
-> bool {
// Build a tuple type from all source parameters
let tuple_elems: Vec<TupleElement> = source_params
.iter()
.map(|p| TupleElement {
type_id: p.type_id,
name: p.name,
optional: p.optional,
rest: false,
})
.collect();
let tuple_ty = self.interner().tuple(tuple_elems);
// Match the tuple against the infer type
let mut local_visited = FxHashSet::default();
self.match_infer_pattern(tuple_ty, infer_ty, bindings, &mut local_visited, checker)
};
return match self.interner().lookup(source) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.construct_signatures.is_empty() {
return false;
}
let source_sig = &source_shape.construct_signatures[0];
match_construct_params_tuple(&source_sig.params, bindings)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
match self.interner().lookup(member) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.construct_signatures.is_empty() {
return false;
}
let source_sig = &source_shape.construct_signatures[0];
if !match_construct_params_tuple(
&source_sig.params,
&mut member_bindings,
) {
return false;
}
}
_ => return false,
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
};
}
// General case: match parameters individually
let mut match_construct_params =
|source_params: &[ParamInfo], bindings: &mut FxHashMap<Atom, TypeId>| -> bool {
let mut local_visited = FxHashSet::default();
self.match_signature_params(
source_params,
&pattern_fn.params,
bindings,
&mut local_visited,
checker,
)
};
match self.interner().lookup(source) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.construct_signatures.is_empty() {
return false;
}
let source_sig = &source_shape.construct_signatures[0];
match_construct_params(&source_sig.params, bindings)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
match self.interner().lookup(member) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.construct_signatures.is_empty() {
return false;
}
let source_sig = &source_shape.construct_signatures[0];
if !match_construct_params(&source_sig.params, &mut member_bindings) {
return false;
}
}
_ => return false,
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
}
}
/// Helper for matching callable type patterns.
pub(crate) fn match_infer_callable_pattern(
&self,
source: TypeId,
pattern_shape_id: CallableShapeId,
pattern: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>,
_visited: &mut FxHashSet<(TypeId, TypeId)>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
let pattern_shape = self.interner().callable_shape(pattern_shape_id);
if pattern_shape.call_signatures.len() != 1
|| !pattern_shape.construct_signatures.is_empty()
|| !pattern_shape.properties.is_empty()
{
return checker.is_subtype_of(source, pattern);
}
let pattern_sig = &pattern_shape.call_signatures[0];
let has_param_infer = pattern_sig
.params
.iter()
.any(|param| self.type_contains_infer(param.type_id));
let has_return_infer = self.type_contains_infer(pattern_sig.return_type);
if pattern_sig.this_type.is_none() && has_param_infer && has_return_infer {
let mut match_params_and_return = |_source_type: TypeId,
source_params: &[ParamInfo],
source_return: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>|
-> bool {
let mut local_visited = FxHashSet::default();
if !self.match_signature_params(
source_params,
&pattern_sig.params,
bindings,
&mut local_visited,
checker,
) {
return false;
}
if !self.match_infer_pattern(
source_return,
pattern_sig.return_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
// For infer pattern matching, once parameters and return type match successfully,
// the pattern is considered successful. Skipping the final subtype check avoids
// contravariance issues.
true
};
return match self.interner().lookup(source) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty()
|| !source_shape.construct_signatures.is_empty()
|| !source_shape.properties.is_empty()
{
return false;
}
let Some(source_sig) = source_shape.call_signatures.last() else {
return false;
};
match_params_and_return(
source,
&source_sig.params,
source_sig.return_type,
bindings,
)
}
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
match_params_and_return(
source,
&source_fn.params,
source_fn.return_type,
bindings,
)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
match self.interner().lookup(member) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty()
|| !source_shape.construct_signatures.is_empty()
|| !source_shape.properties.is_empty()
{
return false;
}
let Some(source_sig) = source_shape.call_signatures.last() else {
return false;
};
if !match_params_and_return(
member,
&source_sig.params,
source_sig.return_type,
&mut member_bindings,
) {
return false;
}
}
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
if !match_params_and_return(
member,
&source_fn.params,
source_fn.return_type,
&mut member_bindings,
) {
return false;
}
}
_ => return false,
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
};
}
if pattern_sig.this_type.is_none() && has_param_infer && !has_return_infer {
let mut match_params =
|source_params: &[ParamInfo], bindings: &mut FxHashMap<Atom, TypeId>| -> bool {
let mut local_visited = FxHashSet::default();
// Match params and infer types. Skip subtype check since pattern matching
// success implies compatibility. The subtype check can fail for optional
// params due to contravariance issues with undefined.
self.match_signature_params(
source_params,
&pattern_sig.params,
bindings,
&mut local_visited,
checker,
)
};
return match self.interner().lookup(source) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty()
|| !source_shape.construct_signatures.is_empty()
|| !source_shape.properties.is_empty()
{
return false;
}
let Some(source_sig) = source_shape.call_signatures.last() else {
return false;
};
match_params(&source_sig.params, bindings)
}
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
match_params(&source_fn.params, bindings)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
match self.interner().lookup(member) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty()
|| !source_shape.construct_signatures.is_empty()
|| !source_shape.properties.is_empty()
{
return false;
}
let Some(source_sig) = source_shape.call_signatures.last() else {
return false;
};
if !match_params(&source_sig.params, &mut member_bindings) {
return false;
}
}
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
if !match_params(&source_fn.params, &mut member_bindings) {
return false;
}
}
_ => return false,
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
};
}
if pattern_sig.this_type.is_none() && !has_param_infer && has_return_infer {
let mut match_return = |_source_type: TypeId,
source_return: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>|
-> bool {
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
source_return,
pattern_sig.return_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
// For return-only infer patterns, the return type match is sufficient.
// Skipping the final subtype check avoids contravariance issues.
true
};
return match self.interner().lookup(source) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty()
|| !source_shape.construct_signatures.is_empty()
|| !source_shape.properties.is_empty()
{
return false;
}
let Some(source_sig) = source_shape.call_signatures.last() else {
return false;
};
match_return(source, source_sig.return_type, bindings)
}
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
match_return(source, source_fn.return_type, bindings)
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
match self.interner().lookup(member) {
Some(TypeData::Callable(source_shape_id)) => {
let source_shape = self.interner().callable_shape(source_shape_id);
if source_shape.call_signatures.is_empty()
|| !source_shape.construct_signatures.is_empty()
|| !source_shape.properties.is_empty()
{
return false;
}
let Some(source_sig) = source_shape.call_signatures.last() else {
return false;
};
if !match_return(
member,
source_sig.return_type,
&mut member_bindings,
) {
return false;
}
}
Some(TypeData::Function(source_fn_id)) => {
let source_fn = self.interner().function_shape(source_fn_id);
if !match_return(
member,
source_fn.return_type,
&mut member_bindings,
) {
return false;
}
}
_ => return false,
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
};
}
checker.is_subtype_of(source, pattern)
}
/// Helper for matching object type patterns.
pub(crate) fn match_infer_object_pattern(
&self,
source: TypeId,
pattern_shape_id: ObjectShapeId,
pattern: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>,
visited: &mut FxHashSet<(TypeId, TypeId)>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
match self.interner().lookup(source) {
Some(
TypeData::Object(source_shape_id) | TypeData::ObjectWithIndex(source_shape_id),
) => {
let source_shape = self.interner().object_shape(source_shape_id);
let pattern_shape = self.interner().object_shape(pattern_shape_id);
for pattern_prop in &pattern_shape.properties {
let source_prop = source_shape
.properties
.iter()
.find(|prop| prop.name == pattern_prop.name);
let Some(source_prop) = source_prop else {
if pattern_prop.optional {
if self.type_contains_infer(pattern_prop.type_id)
&& !self.match_infer_pattern(
TypeId::UNDEFINED,
pattern_prop.type_id,
bindings,
visited,
checker,
)
{
return false;
}
continue;
}
return false;
};
let source_type = self.optional_property_type(source_prop);
if !self.match_infer_pattern(
source_type,
pattern_prop.type_id,
bindings,
visited,
checker,
) {
return false;
}
}
true
}
Some(TypeData::Intersection(members)) => {
let members = self.interner().type_list(members);
let pattern_shape = self.interner().object_shape(pattern_shape_id);
for pattern_prop in &pattern_shape.properties {
let mut merged_type = None;
for &member in members.iter() {
let shape_id = match self.interner().lookup(member) {
Some(
TypeData::Object(shape_id) | TypeData::ObjectWithIndex(shape_id),
) => shape_id,
_ => return false,
};
let shape = self.interner().object_shape(shape_id);
if let Some(source_prop) = shape
.properties
.iter()
.find(|prop| prop.name == pattern_prop.name)
{
let source_type = self.optional_property_type(source_prop);
merged_type = Some(match merged_type {
Some(existing) => {
self.interner().intersection2(existing, source_type)
}
None => source_type,
});
}
}
let Some(source_type) = merged_type else {
if pattern_prop.optional {
if self.type_contains_infer(pattern_prop.type_id)
&& !self.match_infer_pattern(
TypeId::UNDEFINED,
pattern_prop.type_id,
bindings,
visited,
checker,
)
{
return false;
}
continue;
}
return false;
};
if !self.match_infer_pattern(
source_type,
pattern_prop.type_id,
bindings,
visited,
checker,
) {
return false;
}
}
true
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
member,
pattern,
&mut member_bindings,
&mut local_visited,
checker,
) {
return false;
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
}
}
/// Helper for matching object with index type patterns.
pub(crate) fn match_infer_object_with_index_pattern(
&self,
source: TypeId,
pattern_shape_id: ObjectShapeId,
pattern: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>,
visited: &mut FxHashSet<(TypeId, TypeId)>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
match self.interner().lookup(source) {
Some(
TypeData::Object(source_shape_id) | TypeData::ObjectWithIndex(source_shape_id),
) => {
let source_shape = self.interner().object_shape(source_shape_id);
let pattern_shape = self.interner().object_shape(pattern_shape_id);
for pattern_prop in &pattern_shape.properties {
let source_prop = source_shape
.properties
.iter()
.find(|prop| prop.name == pattern_prop.name);
let Some(source_prop) = source_prop else {
if pattern_prop.optional {
if self.type_contains_infer(pattern_prop.type_id)
&& !self.match_infer_pattern(
TypeId::UNDEFINED,
pattern_prop.type_id,
bindings,
visited,
checker,
)
{
return false;
}
continue;
}
return false;
};
let source_type = self.optional_property_type(source_prop);
if !self.match_infer_pattern(
source_type,
pattern_prop.type_id,
bindings,
visited,
checker,
) {
return false;
}
}
if let Some(pattern_index) = &pattern_shape.string_index {
if let Some(source_index) = &source_shape.string_index {
if !self.match_infer_pattern(
source_index.key_type,
pattern_index.key_type,
bindings,
visited,
checker,
) {
return false;
}
if !self.match_infer_pattern(
source_index.value_type,
pattern_index.value_type,
bindings,
visited,
checker,
) {
return false;
}
} else {
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
TypeId::STRING,
pattern_index.key_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
let values: Vec<TypeId> = source_shape
.properties
.iter()
.map(|prop| self.optional_property_type(prop))
.collect();
let value_type = if values.is_empty() {
TypeId::NEVER
} else if values.len() == 1 {
values[0]
} else {
self.interner().union(values)
};
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
value_type,
pattern_index.value_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
}
}
if let Some(pattern_index) = &pattern_shape.number_index {
if let Some(source_index) = &source_shape.number_index {
if !self.match_infer_pattern(
source_index.key_type,
pattern_index.key_type,
bindings,
visited,
checker,
) {
return false;
}
if !self.match_infer_pattern(
source_index.value_type,
pattern_index.value_type,
bindings,
visited,
checker,
) {
return false;
}
} else {
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
TypeId::NUMBER,
pattern_index.key_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
let values: Vec<TypeId> = source_shape
.properties
.iter()
.filter(|prop| {
utils::is_numeric_property_name(self.interner(), prop.name)
})
.map(|prop| self.optional_property_type(prop))
.collect();
let value_type = if values.is_empty() {
TypeId::NEVER
} else if values.len() == 1 {
values[0]
} else {
self.interner().union(values)
};
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
value_type,
pattern_index.value_type,
bindings,
&mut local_visited,
checker,
) {
return false;
}
}
}
true
}
Some(TypeData::Union(members)) => {
let members = self.interner().type_list(members);
let mut combined = FxHashMap::default();
for &member in members.iter() {
let mut member_bindings = FxHashMap::default();
let mut local_visited = FxHashSet::default();
if !self.match_infer_pattern(
member,
pattern,
&mut member_bindings,
&mut local_visited,
checker,
) {
return false;
}
for (name, ty) in member_bindings {
combined
.entry(name)
.and_modify(|existing| {
*existing = self.interner().union2(*existing, ty);
})
.or_insert(ty);
}
}
bindings.extend(combined);
true
}
_ => false,
}
}
/// Helper for matching union type patterns containing infer.
pub(crate) fn match_infer_union_pattern(
&self,
source: TypeId,
pattern_members: TypeListId,
pattern: TypeId,
bindings: &mut FxHashMap<Atom, TypeId>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
let pattern_members = self.interner().type_list(pattern_members);
// Find infer members and non-infer members in the pattern
let mut infer_members: Vec<(Atom, Option<TypeId>)> = Vec::new();
let mut non_infer_pattern_members: Vec<TypeId> = Vec::new();
for &pattern_member in pattern_members.iter() {
if let Some(TypeData::Infer(info)) = self.interner().lookup(pattern_member) {
infer_members.push((info.name, info.constraint));
} else {
non_infer_pattern_members.push(pattern_member);
}
}
// If no infer members, just do subtype check
if infer_members.is_empty() {
return checker.is_subtype_of(source, pattern);
}
// Currently only handle single infer in union pattern
if infer_members.len() != 1 {
return checker.is_subtype_of(source, pattern);
}
let (infer_name, infer_constraint) = infer_members[0];
// Handle both union and non-union sources
match self.interner().lookup(source) {
Some(TypeData::Union(source_members)) => {
let source_members = self.interner().type_list(source_members);
// Find source members that DON'T match non-infer pattern members
let mut remaining_source_members: Vec<TypeId> = Vec::new();
for &source_member in source_members.iter() {
let mut matched = false;
for &non_infer in &non_infer_pattern_members {
if checker.is_subtype_of(source_member, non_infer)
&& checker.is_subtype_of(non_infer, source_member)
{
matched = true;
break;
}
}
if !matched {
remaining_source_members.push(source_member);
}
}
// Bind infer to the remaining source members
let inferred_type = if remaining_source_members.is_empty() {
TypeId::NEVER
} else if remaining_source_members.len() == 1 {
remaining_source_members[0]
} else {
self.interner().union(remaining_source_members)
};
self.bind_infer(
&TypeParamInfo {
is_const: false,
name: infer_name,
constraint: infer_constraint,
default: None,
},
inferred_type,
bindings,
checker,
)
}
_ => {
// Source is not a union - check if source matches any non-infer pattern member
for &non_infer in &non_infer_pattern_members {
if checker.is_subtype_of(source, non_infer)
&& checker.is_subtype_of(non_infer, source)
{
// Source is exactly a non-infer member, so infer gets never
return self.bind_infer(
&TypeParamInfo {
is_const: false,
name: infer_name,
constraint: infer_constraint,
default: None,
},
TypeId::NEVER,
bindings,
checker,
);
}
}
// Source doesn't match non-infer members, so infer = source
self.bind_infer(
&TypeParamInfo {
is_const: false,
name: infer_name,
constraint: infer_constraint,
default: None,
},
source,
bindings,
checker,
)
}
}
}
/// Match a template literal string against a pattern.
pub(crate) fn match_template_literal_string(
&self,
source: &str,
pattern: &[TemplateSpan],
bindings: &mut FxHashMap<Atom, TypeId>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
let mut pos = 0;
let mut index = 0;
while index < pattern.len() {
match pattern[index] {
TemplateSpan::Text(text) => {
let text_value = self.interner().resolve_atom_ref(text);
let text_value = text_value.as_ref();
if !source[pos..].starts_with(text_value) {
return false;
}
pos += text_value.len();
index += 1;
}
TemplateSpan::Type(type_id) => {
let next_text = pattern[index + 1..].iter().find_map(|span| match span {
TemplateSpan::Text(text) => Some(*text),
TemplateSpan::Type(_) => None,
});
let end = if let Some(next_text) = next_text {
let next_value = self.interner().resolve_atom_ref(next_text);
// When there are no more Type (infer) spans after the next text
// separator, the text must match at the END of the remaining string.
// Use rfind (last occurrence) so the infer captures greedily.
// Example: `${infer R} ` matching "hello " → R = "hello " (rfind)
//
// When more Type spans follow, use find (first occurrence) so each
// infer captures minimally, leaving content for later infers.
// Example: `${infer A}.${infer B}` matching "a.b.c" → A = "a" (find)
let has_more_types_after_separator = pattern[index + 1..]
.iter()
.skip_while(|s| !matches!(s, TemplateSpan::Text(_)))
.skip(1) // skip the text separator itself
.any(|s| matches!(s, TemplateSpan::Type(_)));
let search_fn = if has_more_types_after_separator {
str::find
} else {
str::rfind
};
match search_fn(&source[pos..], next_value.as_ref()) {
Some(offset) => pos + offset,
None => return false,
}
} else {
source.len()
};
let captured = &source[pos..end];
pos = end;
let captured_type = self.interner().literal_string(captured);
if let Some(TypeData::Infer(info)) = self.interner().lookup(type_id) {
if !self.bind_infer(&info, captured_type, bindings, checker) {
return false;
}
} else if !checker.is_subtype_of(captured_type, type_id) {
return false;
}
index += 1;
}
}
}
pos == source.len()
}
/// Match template literal spans against a pattern.
pub(crate) fn match_template_literal_spans(
&self,
source: TypeId,
source_spans: &[TemplateSpan],
pattern_spans: &[TemplateSpan],
bindings: &mut FxHashMap<Atom, TypeId>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
if pattern_spans.len() == 1
&& let TemplateSpan::Type(type_id) = pattern_spans[0]
{
if let Some(TypeData::Infer(info)) = self.interner().lookup(type_id) {
let inferred = if source_spans
.iter()
.all(|span| matches!(span, TemplateSpan::Type(_)))
{
TypeId::STRING
} else {
source
};
return self.bind_infer(&info, inferred, bindings, checker);
}
return checker.is_subtype_of(source, type_id);
}
if source_spans.len() != pattern_spans.len() {
return false;
}
for (source_span, pattern_span) in source_spans.iter().zip(pattern_spans.iter()) {
match pattern_span {
TemplateSpan::Text(text) => match source_span {
TemplateSpan::Text(source_text) if source_text == text => {}
_ => return false,
},
TemplateSpan::Type(type_id) => {
let inferred = match source_span {
TemplateSpan::Text(text) => {
let text_value = self.interner().resolve_atom_ref(*text);
self.interner().literal_string(text_value.as_ref())
}
TemplateSpan::Type(source_type) => *source_type,
};
if let Some(TypeData::Infer(info)) = self.interner().lookup(*type_id) {
if !self.bind_infer(&info, inferred, bindings, checker) {
return false;
}
} else if !checker.is_subtype_of(inferred, *type_id) {
return false;
}
}
}
}
true
}
/// Match a string type against a template literal pattern.
pub(crate) fn match_template_literal_string_type(
&self,
pattern_spans: &[TemplateSpan],
bindings: &mut FxHashMap<Atom, TypeId>,
checker: &mut SubtypeChecker<'_, R>,
) -> bool {
if pattern_spans
.iter()
.any(|span| matches!(span, TemplateSpan::Text(_)))
{
return false;
}
for span in pattern_spans {
if let TemplateSpan::Type(type_id) = span {
if let Some(TypeData::Infer(info)) = self.interner().lookup(*type_id) {
if !self.bind_infer(&info, TypeId::STRING, bindings, checker) {
return false;
}
} else if !checker.is_subtype_of(TypeId::STRING, *type_id) {
return false;
}
}
}
true
}
}