foster/denoland-deno
1
0
Fork 0
mirror of https://github.com/denoland/deno.git synced 2025-01-03 04:48:52 -05:00
Code Issues Packages 1 Wiki Activity

chore(lsp): remove recursion in recurse_dependents (#23153)

Browse source 
Was investigating a separate stack overflow (that I've now found in the
node resolution code) and came across this. We should avoid recursion
(this is very old code).
This commit is contained in:
David Sherret 2024-03-31 13:04:42 -04:00 committed by GitHub
parent eb6f6ff33d
commit db89ce33f4
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 12 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
cli/lsp/documents.rs
View file

@ -648,16 +648,20 @@ pub fn to_lsp_range(range: &deno_graph::Range) -> lsp::Range {
fn recurse_dependents(
specifier: &ModuleSpecifier,
map: &HashMap<ModuleSpecifier, HashSet<ModuleSpecifier>>,
dependents: &mut HashSet<ModuleSpecifier>,
) {
if let Some(deps) = map.get(specifier) {
for dep in deps {
if !dependents.contains(dep) {
dependents.insert(dep.clone());
recurse_dependents(dep, map, dependents);
) -> Vec<ModuleSpecifier> {
let mut dependents = HashSet::new();
let mut pending = VecDeque::new();
pending.push_front(specifier);
while let Some(specifier) = pending.pop_front() {
if let Some(deps) = map.get(specifier) {
for dep in deps {
if dependents.insert(dep) {
pending.push_front(dep);
}
}
}
}
dependents.into_iter().cloned().collect()
}
#[derive(Debug)]
@ -1106,10 +1110,8 @@ impl Documents {
specifier: &ModuleSpecifier,
) -> Vec<ModuleSpecifier> {
self.calculate_dependents_if_dirty();
let mut dependents = HashSet::new();
if let Some(specifier) = self.resolve_specifier(specifier) {
recurse_dependents(&specifier, &self.dependents_map, &mut dependents);
dependents.into_iter().collect()
recurse_dependents(&specifier, &self.dependents_map)
} else {
vec![]
}