Build a dependency-ordered list of changes to insert. Given a set of changes to insert, this function determines the correct order based on their dependencies. # Arguments `changes` - Map of hash to Change # Returns Ordered vector of hashes (dependencies first).
(changes: &HashMap<Hash, Change>)
| 178 | /// |
| 179 | /// Ordered vector of hashes (dependencies first). |
| 180 | pub fn order_changes_by_deps(changes: &HashMap<Hash, Change>) -> InsertResult<Vec<Hash>> { |
| 181 | compute_insert_order(changes) |
| 182 | } |
nothing calls this directly
no test coverage detected