/// A simpler but slower variant of the above.
A simpler but slower variant of the above.
A simpler but slower variant of the above .
pub fn slow_derive(&mut self, sys: &SysParam, rng: &mut impl RAND) {
        let mut append_me = match self.bte_nodes.pop_back() {
            None => return,
            Some(mut node) => {
                let mut ks = LinkedList::new();
                loop {
                    if node.d_t.is_empty() {
                        ks.push_back(node);
                        break;
                    }
                    ks.push_back(node_gen(&node, Bit::One, rng, sys));
                    node = node_gen(&node, Bit::Zero, rng, sys);
                }
                ks
            }
        };
        self.bte_nodes.append(&mut append_me);
    }
pub fn slow_derive ( & mut self , sys : & SysParam , rng : & mut impl RAND ) { let mut append_me = match self . bte_nodes . pop_back ( ) { None => return , Some ( mut node ) => { let mut ks = LinkedList :: new ( ) ; loop { if node . d_t . is_empty ( ) { ks . push_back ( node ) ; break ; } ks . push_back ( node_gen ( & node , Bit :: One , rng , sys ) ) ; node = node_gen ( & node , Bit :: Zero , rng , sys ) ; } ks } } ; self . bte_nodes . append ( & mut append_me ) ; }
A simpler but slower variant of the above.
A simpler but slower variant of the above .
&mut self
sys
&SysParam
rng
&mut impl RAND