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
//! Destructuring pattern type resolution and validation.
use crate::query_boundaries::state_checking as query;
use crate::state::CheckerState;
use tsz_parser::parser::NodeIndex;
use tsz_parser::parser::syntax_kind_ext;
use tsz_scanner::SyntaxKind;
use tsz_solver::TypeId;
impl<'a> CheckerState<'a> {
pub(crate) fn report_empty_array_destructuring_bounds(
&mut self,
pattern_idx: NodeIndex,
initializer_idx: NodeIndex,
) {
let Some(init_node) = self.ctx.arena.get(initializer_idx) else {
return;
};
if init_node.kind != syntax_kind_ext::ARRAY_LITERAL_EXPRESSION {
return;
}
let Some(init_lit) = self.ctx.arena.get_literal_expr(init_node) else {
return;
};
if !init_lit.elements.nodes.is_empty() {
return;
}
let Some(pattern_node) = self.ctx.arena.get(pattern_idx) else {
return;
};
let Some(pattern) = self.ctx.arena.get_binding_pattern(pattern_node) else {
return;
};
for (index, &element_idx) in pattern.elements.nodes.iter().enumerate() {
if element_idx.is_none() {
continue;
}
let Some(element_node) = self.ctx.arena.get(element_idx) else {
continue;
};
if element_node.kind == syntax_kind_ext::OMITTED_EXPRESSION {
continue;
}
let Some(element_data) = self.ctx.arena.get_binding_element(element_node) else {
continue;
};
if element_data.dot_dot_dot_token {
break;
}
// TS doesn't report tuple out-of-bounds for empty array destructuring
// when the element has a default value.
if element_data.initializer.is_some() {
continue;
}
self.error_at_node(
element_data.name,
&format!("Tuple type '[]' of length '0' has no element at index '{index}'."),
crate::diagnostics::diagnostic_codes::TUPLE_TYPE_OF_LENGTH_HAS_NO_ELEMENT_AT_INDEX,
);
}
}
/// Check binding pattern elements and their default values for type correctness.
///
/// This function traverses a binding pattern (object or array destructuring) and verifies
/// that any default values provided in binding elements are assignable to their expected types.
/// Assign inferred types to binding element symbols (destructuring).
///
/// The binder creates symbols for identifiers inside binding patterns (e.g., `const [x] = arr;`),
/// but their `value_declaration` is the identifier node, not the enclosing variable declaration.
/// We infer the binding element type from the destructured value type and cache it on the symbol.
pub(crate) fn assign_binding_pattern_symbol_types(
&mut self,
pattern_idx: NodeIndex,
parent_type: TypeId,
) {
let Some(pattern_node) = self.ctx.arena.get(pattern_idx) else {
return;
};
let Some(pattern_data) = self.ctx.arena.get_binding_pattern(pattern_node) else {
return;
};
for (i, &element_idx) in pattern_data.elements.nodes.iter().enumerate() {
if element_idx.is_none() {
continue;
}
let Some(element_node) = self.ctx.arena.get(element_idx) else {
continue;
};
if element_node.kind == syntax_kind_ext::OMITTED_EXPRESSION {
continue;
}
let Some(element_data) = self.ctx.arena.get_binding_element(element_node) else {
continue;
};
let mut element_type = if parent_type == TypeId::ANY {
TypeId::ANY
} else {
self.get_binding_element_type(pattern_idx, i, parent_type, element_data)
};
// If there's an initializer, the type incorporates it.
// TypeScript widens the inferred type with the initializer type.
// Set contextual type for function-like defaults so parameter types
// are inferred from the expected element type (e.g., `{ f: id = arg => arg }: T`).
if element_data.initializer.is_some() {
let prev_context = self.ctx.contextual_type;
if element_type != TypeId::ANY
&& let Some(init_node) = self.ctx.arena.get(element_data.initializer)
&& (init_node.kind == syntax_kind_ext::ARROW_FUNCTION
|| init_node.kind == syntax_kind_ext::FUNCTION_EXPRESSION)
{
self.ctx.contextual_type = Some(element_type);
}
let init_type = self.get_type_of_node(element_data.initializer);
self.ctx.contextual_type = prev_context;
if element_type == TypeId::ANY || element_type == TypeId::UNKNOWN {
element_type = init_type;
} else if !self.is_assignable_to(init_type, element_type) {
element_type = self
.ctx
.types
.factory()
.union(vec![element_type, init_type]);
}
}
let Some(name_node) = self.ctx.arena.get(element_data.name) else {
continue;
};
// Identifier binding: cache the inferred type on the symbol.
if name_node.kind == SyntaxKind::Identifier as u16
&& let Some(sym_id) = self.ctx.binder.get_node_symbol(element_data.name)
{
// When strictNullChecks is off, undefined and null widen to any
// for mutable destructured bindings (var/let).
// This includes unions like `undefined | null`.
let final_type = if !self.ctx.strict_null_checks()
&& query::is_only_null_or_undefined(self.ctx.types, element_type)
{
TypeId::ANY
} else {
element_type
};
self.cache_symbol_type(sym_id, final_type);
}
// Nested binding patterns: check iterability for array patterns, then recurse
if name_node.kind == syntax_kind_ext::ARRAY_BINDING_PATTERN {
// Check iterability for nested array destructuring
self.check_destructuring_iterability(
element_data.name,
element_type,
NodeIndex::NONE,
);
self.assign_binding_pattern_symbol_types(element_data.name, element_type);
} else if name_node.kind == syntax_kind_ext::OBJECT_BINDING_PATTERN {
self.assign_binding_pattern_symbol_types(element_data.name, element_type);
}
}
}
/// Record destructured binding group information for correlated narrowing.
/// When `const { data, isSuccess } = useQuery()`, this records that both `data` and
/// `isSuccess` come from the same union source and can be used for correlated narrowing.
pub(crate) fn record_destructured_binding_group(
&mut self,
pattern_idx: NodeIndex,
source_type: TypeId,
is_const: bool,
pattern_kind: u16,
) {
use crate::context::DestructuredBindingInfo;
let group_id = self.ctx.next_binding_group_id;
self.ctx.next_binding_group_id += 1;
let mut stack: Vec<(NodeIndex, TypeId, u16, String)> =
vec![(pattern_idx, source_type, pattern_kind, String::new())];
while let Some((curr_pattern_idx, curr_source_type, curr_kind, base_path)) = stack.pop() {
let Some(curr_pattern_node) = self.ctx.arena.get(curr_pattern_idx) else {
continue;
};
let Some(curr_pattern_data) = self.ctx.arena.get_binding_pattern(curr_pattern_node)
else {
continue;
};
let curr_is_object = curr_kind == syntax_kind_ext::OBJECT_BINDING_PATTERN;
for (i, &element_idx) in curr_pattern_data.elements.nodes.iter().enumerate() {
if element_idx.is_none() {
continue;
}
let Some(element_node) = self.ctx.arena.get(element_idx) else {
continue;
};
if element_node.kind == syntax_kind_ext::OMITTED_EXPRESSION {
continue;
}
let Some(element_data) = self.ctx.arena.get_binding_element(element_node) else {
continue;
};
let Some(name_node) = self.ctx.arena.get(element_data.name) else {
continue;
};
let path_segment = if curr_is_object {
if element_data.property_name.is_some() {
if let Some(prop_node) = self.ctx.arena.get(element_data.property_name) {
self.ctx
.arena
.get_identifier(prop_node)
.map(|ident| ident.escaped_text.clone())
.unwrap_or_default()
} else {
String::new()
}
} else {
self.ctx
.arena
.get_identifier(name_node)
.map(|ident| ident.escaped_text.clone())
.unwrap_or_default()
}
} else {
String::new()
};
let property_name = if curr_is_object {
if base_path.is_empty() {
path_segment
} else if path_segment.is_empty() {
base_path.clone()
} else {
format!("{base_path}.{path_segment}")
}
} else {
String::new()
};
if name_node.kind == SyntaxKind::Identifier as u16 {
if let Some(sym_id) = self.ctx.binder.get_node_symbol(element_data.name) {
self.ctx.destructured_bindings.insert(
sym_id,
DestructuredBindingInfo {
source_type,
property_name: property_name.clone(),
element_index: i as u32,
group_id,
is_const,
},
);
}
continue;
}
if name_node.kind == syntax_kind_ext::OBJECT_BINDING_PATTERN
|| name_node.kind == syntax_kind_ext::ARRAY_BINDING_PATTERN
{
let nested_source_type = self.get_binding_element_type(
curr_pattern_idx,
i,
curr_source_type,
element_data,
);
stack.push((
element_data.name,
nested_source_type,
name_node.kind,
property_name,
));
}
}
}
}
/// Get the expected type for a binding element from its parent type.
pub(crate) fn get_binding_element_type(
&mut self,
pattern_idx: NodeIndex,
element_index: usize,
parent_type: TypeId,
element_data: &tsz_parser::parser::node::BindingElementData,
) -> TypeId {
let pattern_kind = self.ctx.arena.get(pattern_idx).map_or(0, |n| n.kind);
// Resolve Application/Lazy types to their concrete form so that
// union members, object shapes, and tuple elements are accessible.
let parent_type = self.evaluate_type_for_assignability(parent_type);
// Array binding patterns use the element position.
if pattern_kind == syntax_kind_ext::ARRAY_BINDING_PATTERN {
if parent_type == TypeId::UNKNOWN || parent_type == TypeId::ERROR {
return parent_type;
}
// For union types of tuples/arrays, resolve element type from each member
if let Some(members) = query::union_members(self.ctx.types, parent_type) {
let mut elem_types = Vec::new();
let factory = self.ctx.types.factory();
for member in members {
let member = query::unwrap_readonly_deep(self.ctx.types, member);
if element_data.dot_dot_dot_token {
let elem_type = if let Some(elem) =
query::array_element_type(self.ctx.types, member)
{
factory.array(elem)
} else if let Some(elems) = query::tuple_elements(self.ctx.types, member) {
let rest_elem = elems
.iter()
.find(|e| e.rest)
.or_else(|| elems.last())
.map_or(TypeId::ANY, |e| e.type_id);
self.rest_binding_array_type(rest_elem)
} else {
continue;
};
elem_types.push(elem_type);
} else if let Some(elem) = query::array_element_type(self.ctx.types, member) {
elem_types.push(elem);
} else if let Some(elems) = query::tuple_elements(self.ctx.types, member)
&& let Some(e) = elems.get(element_index)
{
elem_types.push(e.type_id);
}
}
return if elem_types.is_empty() {
TypeId::ANY
} else if elem_types.len() == 1 {
elem_types[0]
} else {
factory.union(elem_types)
};
}
// Unwrap readonly wrappers for destructuring element access
let array_like = query::unwrap_readonly_deep(self.ctx.types, parent_type);
// Rest element: ...rest
if element_data.dot_dot_dot_token {
let elem_type =
if let Some(elem) = query::array_element_type(self.ctx.types, array_like) {
elem
} else if let Some(elems) = query::tuple_elements(self.ctx.types, array_like) {
// Best-effort: if the tuple has a rest element, use it; otherwise, fall back to last.
elems
.iter()
.find(|e| e.rest)
.or_else(|| elems.last())
.map_or(TypeId::ANY, |e| e.type_id)
} else {
TypeId::ANY
};
return self.rest_binding_array_type(elem_type);
}
return if let Some(elem) = query::array_element_type(self.ctx.types, array_like) {
elem
} else if let Some(elems) = query::tuple_elements(self.ctx.types, array_like) {
if let Some(e) = elems.get(element_index) {
e.type_id
} else {
let has_rest_tail = elems.last().is_some_and(|element| element.rest);
if !has_rest_tail {
self.error_at_node(
element_data.name,
&format!(
"Tuple type of length '{}' has no element at index '{}'.",
elems.len(),
element_index
),
crate::diagnostics::diagnostic_codes::TUPLE_TYPE_OF_LENGTH_HAS_NO_ELEMENT_AT_INDEX,
);
}
TypeId::ANY
}
} else {
TypeId::ANY
};
}
// Get the property name or index
if element_data.property_name.is_some() {
// For computed keys in object binding patterns (e.g. `{ [k]: v }`),
// check index signatures when the key is not a simple identifier key.
// This aligns with TS2537 behavior for destructuring from `{}`.
let computed_expr = self
.ctx
.arena
.get(element_data.property_name)
.and_then(|prop_node| self.ctx.arena.get_computed_property(prop_node))
.map(|computed| computed.expression);
let computed_is_identifier = computed_expr
.and_then(|expr_idx| {
self.ctx
.arena
.get(expr_idx)
.and_then(|expr_node| self.ctx.arena.get_identifier(expr_node))
})
.is_some();
if !computed_is_identifier {
let key_type =
computed_expr.map_or(TypeId::ANY, |expr_idx| self.get_type_of_node(expr_idx));
let key_is_string = key_type == TypeId::STRING;
let key_is_number = key_type == TypeId::NUMBER;
if key_is_string || key_is_number {
let has_matching_index = |ty: TypeId| {
query::object_shape(self.ctx.types, ty).is_some_and(|shape| {
if key_is_string {
shape.string_index.is_some()
} else {
shape.number_index.is_some() || shape.string_index.is_some()
}
})
};
let has_index_signature =
if let Some(members) = query::union_members(self.ctx.types, parent_type) {
members.into_iter().all(has_matching_index)
} else {
has_matching_index(parent_type)
};
if !has_index_signature
&& parent_type != TypeId::ANY
&& parent_type != TypeId::ERROR
&& parent_type != TypeId::UNKNOWN
{
let mut formatter = self.ctx.create_type_formatter();
let object_str = formatter.format(parent_type);
let index_str = formatter.format(key_type);
let message = crate::diagnostics::format_message(
crate::diagnostics::diagnostic_messages::TYPE_HAS_NO_MATCHING_INDEX_SIGNATURE_FOR_TYPE,
&[&object_str, &index_str],
);
let error_node = self
.ctx
.arena
.get(element_data.property_name)
.and_then(|prop_node| self.ctx.arena.get_computed_property(prop_node))
.map_or(element_data.property_name, |computed| computed.expression);
self.error_at_node(
error_node,
&message,
crate::diagnostics::diagnostic_codes::TYPE_HAS_NO_MATCHING_INDEX_SIGNATURE_FOR_TYPE,
);
}
}
}
}
let property_name = if element_data.property_name.is_some() {
// { x: a } - property_name is "x"
if let Some(prop_node) = self.ctx.arena.get(element_data.property_name) {
self.ctx
.arena
.get_identifier(prop_node)
.map(|ident| ident.escaped_text.clone())
} else {
None
}
} else {
// { x } - the name itself is the property name
if let Some(name_node) = self.ctx.arena.get(element_data.name) {
self.ctx
.arena
.get_identifier(name_node)
.map(|ident| ident.escaped_text.clone())
} else {
None
}
};
if element_data.dot_dot_dot_token {
// TODO: compute actual object rest type omitting non-rest properties
return parent_type;
}
if parent_type == TypeId::UNKNOWN {
if let Some(prop_name_str) = property_name.as_deref() {
let error_node = if element_data.property_name.is_some() {
element_data.property_name
} else if element_data.name.is_some() {
element_data.name
} else {
NodeIndex::NONE
};
if element_data.initializer.is_none() {
self.error_property_not_exist_at(prop_name_str, parent_type, error_node);
}
}
return TypeId::UNKNOWN;
}
if let Some(ref prop_name_str) = property_name {
use tsz_solver::operations::property::PropertyAccessResult;
let prop_access_result =
self.resolve_property_access_with_env(parent_type, prop_name_str);
match prop_access_result {
PropertyAccessResult::Success { type_id, .. } => type_id,
PropertyAccessResult::PropertyNotFound { .. } => {
let error_node = if element_data.property_name.is_some() {
element_data.property_name
} else if element_data.name.is_some() {
element_data.name
} else {
NodeIndex::NONE
};
if element_data.initializer.is_none() {
self.error_property_not_exist_at(prop_name_str, parent_type, error_node);
}
TypeId::ANY
}
PropertyAccessResult::PossiblyNullOrUndefined { property_type, .. } => {
property_type.unwrap_or(TypeId::ANY)
}
PropertyAccessResult::IsUnknown => TypeId::ANY,
}
} else {
TypeId::ANY
}
}
/// Rest bindings from tuple members should produce an array type.
/// Variadic tuple members can already carry array types (`...T[]`), so avoid
/// wrapping those into nested arrays.
fn rest_binding_array_type(&self, tuple_member_type: TypeId) -> TypeId {
let tuple_member_type = query::unwrap_readonly_deep(self.ctx.types, tuple_member_type);
if query::array_element_type(self.ctx.types, tuple_member_type).is_some() {
tuple_member_type
} else {
self.ctx.types.factory().array(tuple_member_type)
}
}
}