(&mut self, node: Node<'t>, depth: u32)
| 1337 | } |
| 1338 | |
| 1339 | fn scan_fn_ref_subtree(&mut self, node: Node<'t>, depth: u32) { |
| 1340 | if depth > 12 { |
| 1341 | return; |
| 1342 | } |
| 1343 | // Halts at functionTypes (function_definition) + arrow_function (in |
| 1344 | // the fixed list); anonymous_function is NOT halted — scans descend |
| 1345 | // into closures. |
| 1346 | if depth > 0 |
| 1347 | && matches!( |
| 1348 | node.kind(), |
| 1349 | "function_definition" | "arrow_function" | "function_expression" | "lambda_literal" |
| 1350 | | "lambda_expression" |
| 1351 | ) |
| 1352 | { |
| 1353 | return; |
| 1354 | } |
| 1355 | self.maybe_capture_fn_refs(node); |
| 1356 | for i in 0..node.named_child_count() { |
| 1357 | if let Some(c) = node.named_child(i) { |
| 1358 | self.scan_fn_ref_subtree(c, depth + 1); |
| 1359 | } |
| 1360 | } |
| 1361 | } |
| 1362 | |
| 1363 | fn flush_fn_ref_candidates(&mut self) { |
| 1364 | let cands = std::mem::take(&mut self.fn_ref_cands); |
no test coverage detected