| computeAssignments(Set, List) |  | 0% | | 0% | 11 | 11 | 51 | 51 | 1 | 1 |
| chooseLeastBusyNode(SplitWeight, List, ToLongFunction, OptionalInt, long, NodeAssignmentStats) | | 0% | | 0% | 13 | 13 | 23 | 23 | 1 | 1 |
| SimpleNodeSelector(InternalNodeManager, NodeSelectionStats, NodeTaskMap, boolean, Supplier, int, long, long, int, int, int) | | 0% | | 0% | 2 | 2 | 14 | 14 | 1 | 1 |
| getEligibleNodes(int, NodeMap, List) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| computeAssignments(Set, List, BucketNodeMap) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| selectRandomNodes(int, Set) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lockDownNodes() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getActiveNodes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getAllNodes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$getEligibleNodes$0(NodeMap, RemoteTask) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| selectCurrentNode() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |