Revision 634a1460
b/src/Ganeti/HTools/Program/Hroller.hs | ||
---|---|---|
252 | 252 |
colorings = map (\(v,a) -> (v,(colorVertMap.a) nodeGraph)) colorAlgorithms |
253 | 253 |
smallestColoring = IntMap.elems $ |
254 | 254 |
(snd . minimumBy (comparing (IntMap.size . snd))) colorings |
255 |
allNdx = map Node.idx $ Container.elems nlf |
|
255 |
allNdx = map Node.idx . filter (not . Node.offline) . Container.elems |
|
256 |
$ nlf |
|
256 | 257 |
splitted = mapM (\ grp -> partitionNonRedundant grp allNdx (nlf,ilf)) |
257 | 258 |
smallestColoring |
258 | 259 |
rebootGroups <- if optIgnoreNonRedundant opts |
Also available in: Unified diff