627 void dmt<dmtdata_t, dmtdataout_t, dmtwriter_t>::insert_internal(subtree *const subtreep, const dmtw…  in insert_internal()  argument
628     if (subtreep->is_null()) {  in insert_internal()
635         subtreep->set_offset(newoffset);  in insert_internal()
637         dmt_node &n = get_node(*subtreep);  in insert_internal()
640             if (*rebalance_subtree == nullptr && this->will_need_rebalance(*subtreep, 1, 0)) {  in insert_internal()
641                 *rebalance_subtree = subtreep;  in insert_internal()
645             if (*rebalance_subtree == nullptr && this->will_need_rebalance(*subtreep, 0, 1)) {  in insert_internal()
646                 *rebalance_subtree = subtreep;  in insert_internal()
655 void dmt<dmtdata_t, dmtdataout_t, dmtwriter_t>::delete_internal(subtree *const subtreep, const uint…  in delete_internal()  argument
656     paranoid_invariant_notnull(subtreep);  in delete_internal()
658     paranoid_invariant(!subtreep->is_null());  in delete_internal()
659     dmt_node &n = get_node(*subtreep);  in delete_internal()
663         if (*rebalance_subtree == nullptr && this->will_need_rebalance(*subtreep, -1, 0)) {  in delete_internal()
664             *rebalance_subtree = subtreep;  in delete_internal()
672             subtree ptr_this = *subtreep;  in delete_internal()
673             *subtreep = n.right;  in delete_internal()
693             subtree to_free = *subtreep;  in delete_internal()
694             *subtreep = n.left;  in delete_internal()
699             if (*rebalance_subtree == nullptr && this->will_need_rebalance(*subtreep, 0, -1)) {  in delete_internal()
700                 *rebalance_subtree = subtreep;  in delete_internal()
706             this->delete_internal(&n.right, 0, subtreep, rebalance_subtree);  in delete_internal()
710         if (*rebalance_subtree == nullptr && this->will_need_rebalance(*subtreep, 0, -1)) {  in delete_internal()
711             *rebalance_subtree = subtreep;  in delete_internal()