GetAllDependencies returns all dependencies for a unit, both satisfied and unsatisfied.
(unit ID)
| 240 | |
| 241 | // GetAllDependencies returns all dependencies for a unit, both satisfied and unsatisfied. |
| 242 | func (m *Manager) GetAllDependencies(unit ID) ([]Dependency, error) { |
| 243 | m.mu.RLock() |
| 244 | defer m.mu.RUnlock() |
| 245 | |
| 246 | if unit == "" { |
| 247 | return nil, xerrors.Errorf("unit ID cannot be empty: %w", ErrUnitIDRequired) |
| 248 | } |
| 249 | |
| 250 | if !m.registered(unit) { |
| 251 | return nil, xerrors.Errorf("checking registration for unit %q: %w", unit, ErrUnitNotFound) |
| 252 | } |
| 253 | |
| 254 | dependencies := m.graph.GetForwardAdjacentVertices(unit) |
| 255 | |
| 256 | var allDependencies []Dependency |
| 257 | |
| 258 | for _, dependency := range dependencies { |
| 259 | dependsOnUnit := m.units[dependency.To] |
| 260 | requiredStatus := dependency.Edge |
| 261 | allDependencies = append(allDependencies, Dependency{ |
| 262 | Unit: unit, |
| 263 | DependsOn: dependency.To, |
| 264 | RequiredStatus: requiredStatus, |
| 265 | CurrentStatus: dependsOnUnit.status, |
| 266 | IsSatisfied: dependsOnUnit.status == requiredStatus, |
| 267 | }) |
| 268 | } |
| 269 | |
| 270 | return allDependencies, nil |
| 271 | } |
| 272 | |
| 273 | // GetUnmetDependencies returns a list of unsatisfied dependencies for a unit. |
| 274 | func (m *Manager) GetUnmetDependencies(unit ID) ([]Dependency, error) { |