Function transitive_dependent_names 

pub fn transitive_dependent_names(
    nodes: &[WorkspaceNode],
    bumped_names: &[String],
) -> HashSet<String>

What: Every package that transitively depends on one of bumped_names. &[String] borrows a list of names; the result owns its names. Why: The walk keeps a work stack of names whose dependents still need visiting, so it ends on cycles and never recurses. A raised package reached from another raised package is in the result; the caller decides what that means.

In TS you’d write (pseudocode):

function transitiveDependentNames({ manifests, bumpedNames }): Set<string>;