Revision 256810de
| ID | 256810de286c67c4ae68acbdb009ec94d4ca7776 |
A small optimization in node computation
Currently we always compute the available node list for moves (for an
instances) based on the nodes of the initial table. This works find,
however is a repeated calculation.
We optimize this by passing a node list (of indexes, not full objects),
which helps in two ways:
- faster to filter later
- allows restriction of target nodes by enforcing only this subset as
target for moves
Files
- added
- modified
- copied
- renamed
- deleted
- src
- Cluster.hs (diff)
- hbal.hs (diff)