fn insert_root(&mut self, new_root: Handle) {
        let idx = self.roots.len();
        self.roots.push(new_root);
        self.node_mut(new_root).pos = Position::root(idx);
        self.update_min(new_root);
    }
/// Inserts a new root into the `PairingHeap` and checks whether it is the new minimum element.
Inserts a new root into the `PairingHeap` and checks whether it is the new minimum element.
Inserts a new root into the ` PairingHeap ` and checks whether it is the new minimum element .
fn insert_root(&mut self, new_root: Handle) {
        let idx = self.roots.len();
        self.roots.push(new_root);
        self.node_mut(new_root).pos = Position::root(idx);
        self.update_min(new_root);
    }
fn insert_root ( & mut self , new_root : Handle ) { let idx = self . roots . len ( ) ; self . roots . push ( new_root ) ; self . node_mut ( new_root ) . pos = Position :: root ( idx ) ; self . update_min ( new_root ) ; }
Inserts a new root into the `PairingHeap` and checks whether it is the new minimum element.
Inserts a new root into the ` PairingHeap ` and checks whether it is the new minimum element .
&mut self
new_root
Handle
&mut self
new_root
Handle