inverseDependenciesForModule returns the list of modules depending on the input module, sorted by name.
(mod string)
| 249 | |
| 250 | // inverseDependenciesForModule returns the list of modules depending on the input module, sorted by name. |
| 251 | func (m *Manager) inverseDependenciesForModule(mod string) []string { |
| 252 | result := []string(nil) |
| 253 | |
| 254 | for n := range m.modules { |
| 255 | for _, d := range m.DependenciesForModule(n) { |
| 256 | if d == mod { |
| 257 | result = append(result, n) |
| 258 | break |
| 259 | } |
| 260 | } |
| 261 | } |
| 262 | |
| 263 | sort.Strings(result) |
| 264 | return result |
| 265 | } |
| 266 | |
| 267 | // DependenciesForModule returns transitive dependencies for given module, sorted by name. |
| 268 | func (m *Manager) DependenciesForModule(module string) []string { |