dart-decimate 0.0.41 → 0.0.42

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/Cargo.lock CHANGED
@@ -102,7 +102,7 @@ checksum = "a31eee39dddec8330830986fcd7625edb5a24ec90ea038215273bbc3adb08ac6"
102
102
 
103
103
  [[package]]
104
104
  name = "dart-decimate"
105
- version = "0.0.41"
105
+ version = "0.0.42"
106
106
  dependencies = [
107
107
  "clap",
108
108
  "glob",
package/Cargo.toml CHANGED
@@ -1,6 +1,6 @@
1
1
  [package]
2
2
  name = "dart-decimate"
3
- version = "0.0.41"
3
+ version = "0.0.42"
4
4
  edition = "2024"
5
5
  rust-version = "1.90"
6
6
  description = "Rust-native codebase intelligence for Dart and Flutter module graphs."
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "dart-decimate",
3
- "version": "0.0.41",
3
+ "version": "0.0.42",
4
4
  "description": "Rust-native codebase intelligence for Dart and Flutter module graphs.",
5
5
  "license": "MIT",
6
6
  "bin": {
@@ -712,7 +712,7 @@ fn normalize_dot_shorthands(source: &mut String) -> bool {
712
712
  apply_text_replacements(source, replacements)
713
713
  }
714
714
 
715
- fn is_dot_shorthand_start(bytes: &[u8], cursor: usize) -> bool {
715
+ pub(crate) fn is_dot_shorthand_start(bytes: &[u8], cursor: usize) -> bool {
716
716
  if cursor > 0 && bytes[cursor - 1] == b'?' {
717
717
  return false;
718
718
  }
@@ -731,7 +731,24 @@ fn is_dot_shorthand_start(bytes: &[u8], cursor: usize) -> bool {
731
731
  matches!(
732
732
  previous,
733
733
  b'=' | b'(' | b'[' | b'{' | b',' | b':' | b'?' | b'!' | b'>' | b'|'
734
- )
734
+ ) || preceding_keyword(bytes, cursor).is_some_and(|keyword| {
735
+ matches!(
736
+ keyword,
737
+ b"await" | b"case" | b"const" | b"return" | b"throw" | b"yield"
738
+ )
739
+ })
740
+ }
741
+
742
+ fn preceding_keyword(bytes: &[u8], cursor: usize) -> Option<&[u8]> {
743
+ let mut end = cursor;
744
+ while end > 0 && bytes[end - 1].is_ascii_whitespace() {
745
+ end -= 1;
746
+ }
747
+ let mut start = end;
748
+ while start > 0 && (bytes[start - 1].is_ascii_alphanumeric() || bytes[start - 1] == b'_') {
749
+ start -= 1;
750
+ }
751
+ (start < end).then(|| &bytes[start..end])
735
752
  }
736
753
 
737
754
  fn normalize_null_aware_collection_elements(source: &mut String) -> bool {
@@ -1,6 +1,87 @@
1
1
  use tree_sitter::Node;
2
2
 
3
- use super::{IdentifierReference, Location};
3
+ use super::{DOT_SHORTHAND_QUALIFIER, IdentifierReference, Location};
4
+
5
+ pub(super) fn extract_dot_shorthand_references(source: &str) -> Vec<IdentifierReference> {
6
+ let bytes = source.as_bytes();
7
+ let mut references = Vec::new();
8
+ collect_dot_shorthand_references(source, 0, bytes.len(), &mut references);
9
+ references
10
+ }
11
+
12
+ fn collect_dot_shorthand_references(
13
+ source: &str,
14
+ start: usize,
15
+ end: usize,
16
+ references: &mut Vec<IdentifierReference>,
17
+ ) {
18
+ let bytes = source.as_bytes();
19
+ let mut cursor = start;
20
+ while cursor < end {
21
+ if line_comment_start(bytes, cursor) {
22
+ cursor = line_comment_end(bytes, cursor);
23
+ continue;
24
+ }
25
+ if block_comment_start(bytes, cursor) {
26
+ cursor = block_comment_end(bytes, cursor);
27
+ continue;
28
+ }
29
+ if matches!(bytes[cursor], b'r' | b'R') && raw_quoted_segment_start(bytes, cursor).is_some()
30
+ {
31
+ cursor = raw_quoted_segment_end(bytes, cursor);
32
+ continue;
33
+ }
34
+ if matches!(bytes[cursor], b'\'' | b'"') {
35
+ let string_end = quoted_segment_end(bytes, cursor).min(end);
36
+ collect_dot_shorthand_interpolations(source, cursor, string_end, references);
37
+ cursor = string_end;
38
+ continue;
39
+ }
40
+ if bytes[cursor] != b'.' || !crate::dart_parser::is_dot_shorthand_start(bytes, cursor) {
41
+ cursor += 1;
42
+ continue;
43
+ }
44
+ let start = cursor + 1;
45
+ let Some(end) = identifier_end(bytes, start) else {
46
+ cursor += 1;
47
+ continue;
48
+ };
49
+ references.push(IdentifierReference {
50
+ name: source[start..end].to_owned(),
51
+ qualifier: Some(DOT_SHORTHAND_QUALIFIER.to_owned()),
52
+ location: location_at(source, start),
53
+ });
54
+ cursor = end;
55
+ }
56
+ }
57
+
58
+ fn collect_dot_shorthand_interpolations(
59
+ source: &str,
60
+ start: usize,
61
+ end: usize,
62
+ references: &mut Vec<IdentifierReference>,
63
+ ) {
64
+ let bytes = source.as_bytes();
65
+ let mut cursor = start;
66
+ while cursor < end {
67
+ let Some(relative) = bytes[cursor..end].iter().position(|byte| *byte == b'$') else {
68
+ return;
69
+ };
70
+ let dollar = cursor + relative;
71
+ cursor = dollar + 1;
72
+ if is_escaped_dollar(bytes, dollar) || bytes.get(cursor) != Some(&b'{') {
73
+ continue;
74
+ }
75
+ let body_start = cursor + 1;
76
+ let Some(body_end) =
77
+ interpolation_body_end(source, body_start).filter(|body_end| *body_end < end)
78
+ else {
79
+ return;
80
+ };
81
+ collect_dot_shorthand_references(source, body_start, body_end, references);
82
+ cursor = body_end + 1;
83
+ }
84
+ }
4
85
 
5
86
  pub(super) fn extract_identifier_references(
6
87
  root: Node<'_>,
@@ -108,6 +189,9 @@ fn collect_string_segment_interpolation_references(
108
189
 
109
190
  fn simple_member_qualifier(node: Node<'_>, source: &str) -> Option<String> {
110
191
  let parent = node.parent()?;
192
+ if parent.kind() == "static_member_shorthand" {
193
+ return Some(DOT_SHORTHAND_QUALIFIER.to_owned());
194
+ }
111
195
  if parent.kind() == "constant_pattern" {
112
196
  let text = parent.utf8_text(source.as_bytes()).ok()?;
113
197
  let (qualifier, property) = text.rsplit_once('.')?;
@@ -456,3 +540,52 @@ fn same_node(left: Node<'_>, right: Node<'_>) -> bool {
456
540
  && left.start_byte() == right.start_byte()
457
541
  && left.end_byte() == right.end_byte()
458
542
  }
543
+
544
+ #[cfg(test)]
545
+ mod tests {
546
+ use super::*;
547
+
548
+ #[test]
549
+ fn dot_shorthand_references_ignore_non_code_and_member_access() {
550
+ let source = r#"
551
+ final values = [.loading, .new(), object.ready, object?.failed];
552
+ final selected = switch (state) { .ready => true, _ => false };
553
+ final returned = return .returned;
554
+ final thrown = throw .thrown;
555
+ final yielded = yield .yielded;
556
+ final matched = case .matched;
557
+ final awaited = await .awaited;
558
+ final constant = const .new<Thing>();
559
+ final label = '${.interpolated}';
560
+ // .commented
561
+ /* .blocked */
562
+ final text = '.quoted';
563
+ final raw = r".raw";
564
+ "#;
565
+
566
+ let references = extract_dot_shorthand_references(source);
567
+ assert_eq!(
568
+ references
569
+ .iter()
570
+ .map(|reference| reference.name.as_str())
571
+ .collect::<Vec<_>>(),
572
+ vec![
573
+ "loading",
574
+ "new",
575
+ "ready",
576
+ "returned",
577
+ "thrown",
578
+ "yielded",
579
+ "matched",
580
+ "awaited",
581
+ "new",
582
+ "interpolated",
583
+ ]
584
+ );
585
+ assert!(
586
+ references
587
+ .iter()
588
+ .all(|reference| reference.qualifier.as_deref() == Some(DOT_SHORTHAND_QUALIFIER))
589
+ );
590
+ }
591
+ }
package/src/extract.rs CHANGED
@@ -20,7 +20,7 @@ use primary_constructors::{
20
20
  extract_primary_constructor_identifier_references,
21
21
  extract_primary_constructor_signature_references,
22
22
  };
23
- use references::extract_identifier_references;
23
+ use references::{extract_dot_shorthand_references, extract_identifier_references};
24
24
  pub use routes::DartRouteDeclaration;
25
25
  use routes::extract_route_declarations;
26
26
  pub use signatures::SignatureReference;
@@ -242,6 +242,8 @@ pub struct IdentifierReference {
242
242
  pub location: Location,
243
243
  }
244
244
 
245
+ pub(crate) const DOT_SHORTHAND_QUALIFIER: &str = "$dot-shorthand";
246
+
245
247
  /// Top-level declaration categories extracted in Phase 1.
246
248
  #[derive(Debug, Clone, Copy, PartialEq, Eq, Serialize, Deserialize)]
247
249
  #[serde(rename_all = "kebab-case")]
@@ -356,6 +358,7 @@ pub fn extract_dart_source(path: impl AsRef<Path>, source: &str) -> Result<DartF
356
358
  let mut declarations = Vec::new();
357
359
  let mut members = Vec::new();
358
360
  let mut references = extract_identifier_references(root, parse_source);
361
+ references.extend(extract_dot_shorthand_references(source));
359
362
  references.extend(extract_primary_constructor_identifier_references(source));
360
363
  sort_identifier_references(&mut references);
361
364
  let mut signature_references = extract_signature_references(root, parse_source);
@@ -2,6 +2,7 @@ use std::collections::{BTreeMap, BTreeSet};
2
2
  use std::path::{Path, PathBuf};
3
3
 
4
4
  use crate::ScannedProject;
5
+ use crate::extract::DOT_SHORTHAND_QUALIFIER;
5
6
  use crate::graph::normalize_against;
6
7
 
7
8
  use super::{
@@ -89,6 +90,14 @@ impl SymbolIndex {
89
90
  })
90
91
  }
91
92
 
93
+ pub(super) fn dot_shorthand_reference_count(
94
+ &self,
95
+ name: &str,
96
+ reachable_files: &BTreeSet<PathBuf>,
97
+ ) -> usize {
98
+ self.qualified_reference_count(DOT_SHORTHAND_QUALIFIER, name, reachable_files)
99
+ }
100
+
92
101
  pub(super) fn reference_count(&self, name: &str, reachable_files: &BTreeSet<PathBuf>) -> usize {
93
102
  self.references_by_name.get(name).map_or(0, |references| {
94
103
  references
@@ -270,6 +270,40 @@ fn skips_enum_constants_on_public_api_enums() -> Result<(), Box<dyn std::error::
270
270
  Ok(())
271
271
  }
272
272
 
273
+ #[test]
274
+ fn counts_native_dot_shorthand_enum_references() -> Result<(), Box<dyn std::error::Error>> {
275
+ let fixture = tempfile::tempdir()?;
276
+ write(&fixture, "pubspec.yaml", "name: app\n")?;
277
+ write(
278
+ &fixture,
279
+ "lib/main.dart",
280
+ r"enum Readiness { loading, signedOut, ready }
281
+
282
+ String label(Readiness readiness) => switch (readiness) {
283
+ .loading => 'loading',
284
+ .signedOut => 'signed-out',
285
+ .ready => 'ready',
286
+ };
287
+
288
+ void main() => print(label(.loading));
289
+ ",
290
+ )?;
291
+ let project = scan_project(fixture.path())?;
292
+ let dead_code = find_dead_code(&project.graph, ["lib/main.dart"]);
293
+
294
+ let report = analyze_unused_exports(&project, &dead_code);
295
+
296
+ assert!(
297
+ report
298
+ .unused_members
299
+ .iter()
300
+ .all(|unused| unused.owner != "Readiness"),
301
+ "{:?}",
302
+ report.unused_members
303
+ );
304
+ Ok(())
305
+ }
306
+
273
307
  #[test]
274
308
  fn member_references_are_scoped_to_dart_library_parts() -> Result<(), Box<dyn std::error::Error>> {
275
309
  let fixture = tempfile::tempdir()?;
package/src/symbols.rs CHANGED
@@ -358,7 +358,8 @@ fn unused_member_from_declaration(
358
358
  &indexed.member.owner,
359
359
  &indexed.member.name,
360
360
  reachable_files,
361
- ) + index.qualified_reference_count(&indexed.member.owner, "values", reachable_files)
361
+ ) + index.dot_shorthand_reference_count(&indexed.member.name, reachable_files)
362
+ + index.qualified_reference_count(&indexed.member.owner, "values", reachable_files)
362
363
  } else {
363
364
  let library = index.library_path(&indexed.path);
364
365
  index.library_reference_count(&indexed.member.name, library, reachable_files)
@@ -20,9 +20,29 @@ pub(super) struct FileReachabilityFacts {
20
20
  pub(super) class_names: BTreeSet<String>,
21
21
  pub(super) widgets: Vec<UnrenderedWidgetClass>,
22
22
  pub(super) object_constructors: Vec<String>,
23
+ contextual_constructors: Vec<ContextualConstructor>,
24
+ typed_fields: Vec<TypedField>,
23
25
  pub(super) superclasses: BTreeMap<String, String>,
24
26
  }
25
27
 
28
+ #[derive(Debug, Clone, PartialEq, Eq)]
29
+ enum ContextualConstructor {
30
+ NamedArgument {
31
+ owner_constructor: String,
32
+ argument: String,
33
+ },
34
+ TypedInitializer {
35
+ target: String,
36
+ },
37
+ }
38
+
39
+ #[derive(Debug, Clone, PartialEq, Eq)]
40
+ struct TypedField {
41
+ owner: String,
42
+ field: String,
43
+ target: String,
44
+ }
45
+
26
46
  pub(super) fn unrendered_widgets(
27
47
  project: &ScannedProject,
28
48
  files: &[WidgetFileFacts],
@@ -94,6 +114,8 @@ pub(super) fn reachability_facts(
94
114
  .collect(),
95
115
  widgets: widget_classes(path, classes, source),
96
116
  object_constructors: object_constructor_names(root, source),
117
+ contextual_constructors: contextual_constructor_names(root, source),
118
+ typed_fields: typed_fields(classes, source),
97
119
  superclasses: class_superclasses(classes, source),
98
120
  }
99
121
  }
@@ -150,6 +172,237 @@ fn object_constructor_names(root: Node<'_>, source: &str) -> Vec<String> {
150
172
  constructors
151
173
  }
152
174
 
175
+ fn contextual_constructor_names(root: Node<'_>, source: &str) -> Vec<ContextualConstructor> {
176
+ let mut constructors = Vec::new();
177
+ visit_named(root, &mut |node| {
178
+ if node.kind() == "named_argument" && contains_dot_new(node, source) {
179
+ let Some(argument) = node.named_child(0).and_then(|label| {
180
+ label
181
+ .utf8_text(source.as_bytes())
182
+ .ok()
183
+ .map(|name| name.trim_end_matches(':').to_owned())
184
+ }) else {
185
+ return;
186
+ };
187
+ let Some(call) = node.parent().and_then(|arguments| arguments.parent()) else {
188
+ return;
189
+ };
190
+ if let Some(owner_constructor) = constructor_type_name(call, source) {
191
+ constructors.push(ContextualConstructor::NamedArgument {
192
+ owner_constructor,
193
+ argument,
194
+ });
195
+ }
196
+ return;
197
+ }
198
+
199
+ if node.kind() == "local_variable_declaration" {
200
+ let mut cursor = node.walk();
201
+ for definition in node
202
+ .named_children(&mut cursor)
203
+ .filter(|child| child.kind() == "initialized_variable_definition")
204
+ {
205
+ if let Some(target) = contextual_initialized_variable_target(definition, source) {
206
+ constructors.push(ContextualConstructor::TypedInitializer { target });
207
+ }
208
+ }
209
+ return;
210
+ }
211
+
212
+ if node.kind() == "declaration" {
213
+ constructors.extend(
214
+ contextual_declaration_targets(node, source)
215
+ .map(|target| ContextualConstructor::TypedInitializer { target }),
216
+ );
217
+ }
218
+ });
219
+ constructors
220
+ }
221
+
222
+ fn contextual_initialized_variable_target(definition: Node<'_>, source: &str) -> Option<String> {
223
+ let type_node = direct_named_child(definition, "type")?;
224
+ let value = definition.child_by_field_name("value")?;
225
+ contextual_initializer_target(type_node, value, source)
226
+ }
227
+
228
+ fn contextual_declaration_targets<'tree>(
229
+ declaration: Node<'tree>,
230
+ source: &'tree str,
231
+ ) -> impl Iterator<Item = String> + 'tree {
232
+ let Some(type_node) = direct_named_child(declaration, "type") else {
233
+ return Vec::new().into_iter();
234
+ };
235
+ let Some(target) = type_node
236
+ .utf8_text(source.as_bytes())
237
+ .ok()
238
+ .and_then(contextual_target_type)
239
+ else {
240
+ return Vec::new().into_iter();
241
+ };
242
+ let mut cursor = declaration.walk();
243
+ declaration
244
+ .named_children(&mut cursor)
245
+ .filter(|child| {
246
+ matches!(
247
+ child.kind(),
248
+ "identifier_list" | "initialized_identifier_list"
249
+ )
250
+ })
251
+ .flat_map(|list| initialized_identifiers(list))
252
+ .filter(move |identifier| {
253
+ identifier
254
+ .child_by_field_name("value")
255
+ .is_some_and(|value| is_contextual_initializer(value, source))
256
+ })
257
+ .map(move |_| target.clone())
258
+ .collect::<Vec<_>>()
259
+ .into_iter()
260
+ }
261
+
262
+ fn contextual_initializer_target(
263
+ type_node: Node<'_>,
264
+ value: Node<'_>,
265
+ source: &str,
266
+ ) -> Option<String> {
267
+ is_contextual_initializer(value, source).then_some(())?;
268
+ type_node
269
+ .utf8_text(source.as_bytes())
270
+ .ok()
271
+ .and_then(contextual_target_type)
272
+ }
273
+
274
+ fn is_contextual_initializer(value: Node<'_>, source: &str) -> bool {
275
+ let Ok(value_text) = value.utf8_text(source.as_bytes()) else {
276
+ return false;
277
+ };
278
+ let value_text = value_text.trim_start();
279
+ let is_direct_constructor =
280
+ value_text.starts_with(".new") || value_text.starts_with("const .new");
281
+ let is_collection_literal = value_text.starts_with('[')
282
+ || value_text.starts_with('{')
283
+ || value_text.starts_with("const [")
284
+ || value_text.starts_with("const {")
285
+ || value_text.starts_with("List.unmodifiable(")
286
+ || value_text.starts_with("List.of(")
287
+ || value_text.starts_with("Set.of(");
288
+ (is_direct_constructor || is_collection_literal) && contains_dot_new(value, source)
289
+ }
290
+
291
+ fn contains_dot_new(node: Node<'_>, source: &str) -> bool {
292
+ if node.kind() == "static_member_shorthand"
293
+ && node.utf8_text(source.as_bytes()).ok() == Some(".new")
294
+ {
295
+ return true;
296
+ }
297
+ if is_object_constructor(node) && constructor_type_name(node, source).as_deref() == Some("New_")
298
+ {
299
+ return true;
300
+ }
301
+ let mut cursor = node.walk();
302
+ node.named_children(&mut cursor)
303
+ .any(|child| contains_dot_new(child, source))
304
+ }
305
+
306
+ fn typed_fields(classes: &[Node<'_>], source: &str) -> Vec<TypedField> {
307
+ let mut fields = Vec::new();
308
+ for class in classes {
309
+ let Some(owner) = class
310
+ .child_by_field_name("name")
311
+ .and_then(|name| name.utf8_text(source.as_bytes()).ok())
312
+ else {
313
+ continue;
314
+ };
315
+ let Some(body) = class.child_by_field_name("body") else {
316
+ continue;
317
+ };
318
+ let mut cursor = body.walk();
319
+ for member in body.named_children(&mut cursor) {
320
+ let Some(declaration) = direct_named_child(member, "declaration") else {
321
+ continue;
322
+ };
323
+ for (field, target) in typed_fields_in_declaration(declaration, source) {
324
+ fields.push(TypedField {
325
+ owner: owner.to_owned(),
326
+ field,
327
+ target,
328
+ });
329
+ }
330
+ }
331
+ }
332
+ fields
333
+ }
334
+
335
+ fn typed_fields_in_declaration(declaration: Node<'_>, source: &str) -> Vec<(String, String)> {
336
+ let Some(type_node) = direct_named_child(declaration, "type") else {
337
+ return Vec::new();
338
+ };
339
+ let Some(type_text) = type_node.utf8_text(source.as_bytes()).ok() else {
340
+ return Vec::new();
341
+ };
342
+ let Some(target) = contextual_target_type(type_text) else {
343
+ return Vec::new();
344
+ };
345
+ let mut cursor = declaration.walk();
346
+ declaration
347
+ .named_children(&mut cursor)
348
+ .filter(|child| {
349
+ matches!(
350
+ child.kind(),
351
+ "identifier_list" | "initialized_identifier_list"
352
+ )
353
+ })
354
+ .flat_map(initialized_identifiers)
355
+ .filter_map(|identifier| {
356
+ identifier
357
+ .child_by_field_name("name")
358
+ .or_else(|| (identifier.kind() == "identifier").then_some(identifier))
359
+ .and_then(|name| name.utf8_text(source.as_bytes()).ok())
360
+ .map(|name| (name.to_owned(), target.clone()))
361
+ })
362
+ .collect()
363
+ }
364
+
365
+ fn direct_named_child<'tree>(node: Node<'tree>, kind: &str) -> Option<Node<'tree>> {
366
+ let mut cursor = node.walk();
367
+ node.named_children(&mut cursor)
368
+ .find(|child| child.kind() == kind)
369
+ }
370
+
371
+ fn initialized_identifiers(list: Node<'_>) -> Vec<Node<'_>> {
372
+ let mut cursor = list.walk();
373
+ list.named_children(&mut cursor).collect()
374
+ }
375
+
376
+ fn contextual_target_type(type_text: &str) -> Option<String> {
377
+ let mut target = type_text.trim().trim_end_matches('?').trim();
378
+ while let Some(open) = target.find('<') {
379
+ let close = target.rfind('>')?;
380
+ let inner = target.get(open + 1..close)?.trim();
381
+ if has_top_level_comma(inner) {
382
+ return None;
383
+ }
384
+ target = inner.trim_end_matches('?').trim();
385
+ }
386
+ (!target.is_empty()
387
+ && target
388
+ .bytes()
389
+ .all(|byte| byte.is_ascii_alphanumeric() || matches!(byte, b'_' | b'$' | b'.')))
390
+ .then(|| target.to_owned())
391
+ }
392
+
393
+ fn has_top_level_comma(text: &str) -> bool {
394
+ let mut depth = 0usize;
395
+ for byte in text.bytes() {
396
+ match byte {
397
+ b'<' => depth += 1,
398
+ b'>' => depth = depth.saturating_sub(1),
399
+ b',' if depth == 0 => return true,
400
+ _ => {}
401
+ }
402
+ }
403
+ false
404
+ }
405
+
153
406
  fn is_object_constructor(node: Node<'_>) -> bool {
154
407
  matches!(
155
408
  node.kind(),
@@ -300,32 +553,87 @@ fn render_counts(
300
553
  ) -> BTreeMap<ClassKey, usize> {
301
554
  let superclasses = resolved_superclasses(files, resolver);
302
555
  let mut counts = BTreeMap::<ClassKey, usize>::new();
556
+ let typed_fields = files
557
+ .iter()
558
+ .flat_map(|file| {
559
+ file.typed_fields.iter().map(|field| {
560
+ (
561
+ (
562
+ ClassKey {
563
+ path: file.path.clone(),
564
+ name: field.owner.clone(),
565
+ },
566
+ field.field.clone(),
567
+ ),
568
+ field.target.clone(),
569
+ )
570
+ })
571
+ })
572
+ .collect::<BTreeMap<_, _>>();
303
573
  for file in files {
304
574
  for constructed in &file.object_constructors {
305
- let mut pending = resolver
306
- .resolve(&file.path, constructed)
307
- .into_iter()
308
- .collect::<Vec<_>>();
309
- let mut visited = BTreeSet::new();
310
- while let Some(class) = pending.pop() {
311
- if !visited.insert(class.clone()) {
312
- continue;
313
- }
314
- if candidate_keys.contains(&class) {
315
- *counts.entry(class.clone()).or_default() += 1;
575
+ increment_render_counts(
576
+ resolver.resolve(&file.path, constructed),
577
+ candidate_keys,
578
+ &superclasses,
579
+ &mut counts,
580
+ );
581
+ }
582
+ for contextual in &file.contextual_constructors {
583
+ match contextual {
584
+ ContextualConstructor::NamedArgument {
585
+ owner_constructor,
586
+ argument,
587
+ } => {
588
+ for owner in resolver.resolve(&file.path, owner_constructor) {
589
+ let Some(target) = typed_fields.get(&(owner.clone(), argument.clone()))
590
+ else {
591
+ continue;
592
+ };
593
+ increment_render_counts(
594
+ resolver.resolve(&owner.path, target),
595
+ candidate_keys,
596
+ &superclasses,
597
+ &mut counts,
598
+ );
599
+ }
316
600
  }
317
- pending.extend(
318
- superclasses
319
- .get(&class)
320
- .into_iter()
321
- .flat_map(|parents| parents.iter().cloned()),
322
- );
601
+ ContextualConstructor::TypedInitializer { target } => increment_render_counts(
602
+ resolver.resolve(&file.path, target),
603
+ candidate_keys,
604
+ &superclasses,
605
+ &mut counts,
606
+ ),
323
607
  }
324
608
  }
325
609
  }
326
610
  counts
327
611
  }
328
612
 
613
+ fn increment_render_counts(
614
+ classes: BTreeSet<ClassKey>,
615
+ candidate_keys: &BTreeSet<ClassKey>,
616
+ superclasses: &BTreeMap<ClassKey, BTreeSet<ClassKey>>,
617
+ counts: &mut BTreeMap<ClassKey, usize>,
618
+ ) {
619
+ let mut pending = classes.into_iter().collect::<Vec<_>>();
620
+ let mut visited = BTreeSet::new();
621
+ while let Some(class) = pending.pop() {
622
+ if !visited.insert(class.clone()) {
623
+ continue;
624
+ }
625
+ if candidate_keys.contains(&class) {
626
+ *counts.entry(class.clone()).or_default() += 1;
627
+ }
628
+ pending.extend(
629
+ superclasses
630
+ .get(&class)
631
+ .into_iter()
632
+ .flat_map(|parents| parents.iter().cloned()),
633
+ );
634
+ }
635
+ }
636
+
329
637
  fn resolved_superclasses(
330
638
  files: &[&FileReachabilityFacts],
331
639
  resolver: &DeclarationResolver,