Filter dependencies for id with pri < pri_max.
(graph: Graph, vertices: AbstractSet[str], id: str, pri_max: int)
| 5078 | |
| 5079 | |
| 5080 | def deps_filtered(graph: Graph, vertices: AbstractSet[str], id: str, pri_max: int) -> list[str]: |
| 5081 | """Filter dependencies for id with pri < pri_max.""" |
| 5082 | if id not in vertices: |
| 5083 | return [] |
| 5084 | state = graph[id] |
| 5085 | return [ |
| 5086 | dep |
| 5087 | for dep in state.dependencies |
| 5088 | if dep in vertices and state.priorities.get(dep, PRI_HIGH) < pri_max |
| 5089 | ] |
| 5090 | |
| 5091 | |
| 5092 | def transitive_dep_hash(scc: SCC, graph: Graph) -> bytes: |
no test coverage detected
searching dependent graphs…