180     subtree *rebalance_subtree = nullptr;  in insert_at()  local
181     this->insert_internal(&this->d.t.root, value, idx, &rebalance_subtree);  in insert_at()
182     if (rebalance_subtree != nullptr) {  in insert_at()
183         this->rebalance(rebalance_subtree);  in insert_at()
354     subtree *rebalance_subtree = nullptr;  in delete_at()  local
355     this->delete_internal(&this->d.t.root, idx, nullptr, &rebalance_subtree);  in delete_at()
356     if (rebalance_subtree != nullptr) {  in delete_at()
357         this->rebalance(rebalance_subtree);  in delete_at()
627 …*const subtreep, const dmtwriter_t &value, const uint32_t idx, subtree **const rebalance_subtree) {  in insert_internal()  argument
640             if (*rebalance_subtree == nullptr && this->will_need_rebalance(*subtreep, 1, 0)) {  in insert_internal()
641                 *rebalance_subtree = subtreep;  in insert_internal()
643             this->insert_internal(&n.left, value, idx, rebalance_subtree);  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()
649             this->insert_internal(&n.right, value, sub_index, rebalance_subtree);  in insert_internal()
655 … subtreep, const uint32_t idx, subtree *const subtree_replace, subtree **const rebalance_subtree) {  in delete_internal()  argument
657     paranoid_invariant_notnull(rebalance_subtree);  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()
666         this->delete_internal(&n.left, idx, subtree_replace, rebalance_subtree);  in delete_internal()
679                 if (*rebalance_subtree == &ancestor.right) {  in delete_internal()
681                     *rebalance_subtree = &n.right;  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()
713         this->delete_internal(&n.right, idx - leftweight - 1, subtree_replace, rebalance_subtree);  in delete_internal()