Update the tree after the winner has been consumed/advanced.
(&mut self, is_gt: impl Fn(usize, usize) -> bool)
| 424 | |
| 425 | /// Update the tree after the winner has been consumed/advanced. |
| 426 | fn update(&mut self, is_gt: impl Fn(usize, usize) -> bool) { |
| 427 | let mut winner = self.nodes[0]; |
| 428 | let mut cmp_node = self.leaf_index(winner); |
| 429 | while cmp_node != 0 { |
| 430 | let challenger = self.nodes[cmp_node]; |
| 431 | if is_gt(winner, challenger) { |
| 432 | self.nodes[cmp_node] = winner; |
| 433 | winner = challenger; |
| 434 | } |
| 435 | cmp_node = Self::parent_index(cmp_node); |
| 436 | } |
| 437 | self.nodes[0] = winner; |
| 438 | } |
| 439 | } |
| 440 | |
| 441 | // --------------------------------------------------------------------------- |