LLVMFuzzerTestOneInput:
   26|  7.87k|{
   27|  7.87k|    auto guard = immer::gc_disable_guard{};
   28|       |
   29|  7.87k|    constexpr auto var_count = 4;
   30|  7.87k|    constexpr auto bits      = 2;
   31|       |
   32|  7.87k|    using vector_t    = immer::flex_vector<int, gc_memory, bits, bits>;
   33|  7.87k|    using transient_t = typename vector_t::transient_type;
   34|  7.87k|    using size_t      = std::uint8_t;
   35|       |
   36|  7.87k|    auto vs = std::array<vector_t, var_count>{};
   37|  7.87k|    auto ts = std::array<transient_t, var_count>{};
   38|       |
   39|  7.87k|    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
   40|  7.87k|    auto is_valid_var_neq = [](auto other) {
   41|  7.87k|        return [=](auto idx) {
   42|  7.87k|            return idx >= 0 && idx < var_count && idx != other;
   43|  7.87k|        };
   44|  7.87k|    };
   45|  7.87k|    auto is_valid_index = [](auto& v) {
   46|  7.87k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  7.87k|    };
   48|  7.87k|    auto is_valid_size = [](auto& v) {
   49|  7.87k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  7.87k|    };
   51|  7.87k|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  7.87k|        return v1.size() + v2.size() < vector_t::max_size();
   53|  7.87k|    };
   54|       |
   55|  7.87k|    return fuzzer_input{data, size}.run([&](auto& in) {
   56|  7.87k|        enum ops
   57|  7.87k|        {
   58|  7.87k|            op_transient,
   59|  7.87k|            op_persistent,
   60|  7.87k|            op_push_back,
   61|  7.87k|            op_update,
   62|  7.87k|            op_take,
   63|  7.87k|            op_drop,
   64|  7.87k|            op_concat,
   65|  7.87k|            op_push_back_mut,
   66|  7.87k|            op_update_mut,
   67|  7.87k|            op_take_mut,
   68|  7.87k|            op_drop_mut,
   69|  7.87k|            op_prepend_mut,
   70|  7.87k|            op_prepend_mut_move,
   71|  7.87k|            op_append_mut,
   72|  7.87k|            op_append_mut_move,
   73|  7.87k|        };
   74|  7.87k|        auto dst = read<char>(in, is_valid_var);
   75|  7.87k|        switch (read<char>(in)) {
   76|  7.87k|        case op_transient: {
   77|  7.87k|            auto src = read<char>(in, is_valid_var);
   78|  7.87k|            ts[dst]  = vs[src].transient();
   79|  7.87k|            break;
   80|  7.87k|        }
   81|  7.87k|        case op_persistent: {
   82|  7.87k|            auto src = read<char>(in, is_valid_var);
   83|  7.87k|            vs[dst]  = ts[src].persistent();
   84|  7.87k|            break;
   85|  7.87k|        }
   86|  7.87k|        case op_push_back: {
   87|  7.87k|            auto src = read<char>(in, is_valid_var);
   88|  7.87k|            vs[dst]  = vs[src].push_back(42);
   89|  7.87k|            break;
   90|  7.87k|        }
   91|  7.87k|        case op_update: {
   92|  7.87k|            auto src = read<char>(in, is_valid_var);
   93|  7.87k|            auto idx = read<size_t>(in, is_valid_index(vs[src]));
   94|  7.87k|            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
   95|  7.87k|            break;
   96|  7.87k|        }
   97|  7.87k|        case op_take: {
   98|  7.87k|            auto src = read<char>(in, is_valid_var);
   99|  7.87k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  100|  7.87k|            vs[dst]  = vs[src].take(idx);
  101|  7.87k|            break;
  102|  7.87k|        }
  103|  7.87k|        case op_drop: {
  104|  7.87k|            auto src = read<char>(in, is_valid_var);
  105|  7.87k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  106|  7.87k|            vs[dst]  = vs[src].drop(idx);
  107|  7.87k|            break;
  108|  7.87k|        }
  109|  7.87k|        case op_concat: {
  110|  7.87k|            auto src  = read<char>(in, is_valid_var);
  111|  7.87k|            auto src2 = read<char>(in, is_valid_var);
  112|  7.87k|            if (can_concat(vs[src], vs[src2]))
  113|  7.87k|                vs[dst] = vs[src] + vs[src2];
  114|  7.87k|            break;
  115|  7.87k|        }
  116|  7.87k|        case op_push_back_mut: {
  117|  7.87k|            ts[dst].push_back(13);
  118|  7.87k|            break;
  119|  7.87k|        }
  120|  7.87k|        case op_update_mut: {
  121|  7.87k|            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
  122|  7.87k|            ts[dst].update(idx, [](auto x) { return x + 1; });
  123|  7.87k|            break;
  124|  7.87k|        }
  125|  7.87k|        case op_take_mut: {
  126|  7.87k|            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
  127|  7.87k|            ts[dst].take(idx);
  128|  7.87k|            break;
  129|  7.87k|        }
  130|  7.87k|        case op_prepend_mut: {
  131|  7.87k|            auto src = read<char>(in, is_valid_var_neq(dst));
  132|  7.87k|            if (can_concat(ts[dst], ts[src]))
  133|  7.87k|                ts[dst].prepend(ts[src]);
  134|  7.87k|            break;
  135|  7.87k|        }
  136|  7.87k|        case op_prepend_mut_move: {
  137|  7.87k|            auto src = read<char>(in, is_valid_var_neq(dst));
  138|  7.87k|            if (can_concat(ts[dst], ts[src])) {
  139|  7.87k|                ts[dst].prepend(std::move(ts[src]));
  140|  7.87k|                ts[src] = {};
  141|  7.87k|            }
  142|  7.87k|            break;
  143|  7.87k|        }
  144|  7.87k|        case op_append_mut: {
  145|  7.87k|            auto src = read<char>(in, is_valid_var_neq(dst));
  146|  7.87k|            if (can_concat(ts[dst], ts[src]))
  147|  7.87k|                ts[dst].append(ts[src]);
  148|  7.87k|            break;
  149|  7.87k|        }
  150|  7.87k|        case op_append_mut_move: {
  151|  7.87k|            auto src = read<char>(in, is_valid_var_neq(dst));
  152|  7.87k|            if (can_concat(ts[dst], ts[src])) {
  153|  7.87k|                ts[dst].append(std::move(ts[src]));
  154|  7.87k|                ts[src] = {};
  155|  7.87k|            }
  156|  7.87k|            break;
  157|  7.87k|        }
  158|  7.87k|        default:
  159|  7.87k|            break;
  160|  7.87k|        };
  161|  7.87k|        return true;
  162|  7.87k|    });
  163|  7.87k|}
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_:
   55|  2.33M|    return fuzzer_input{data, size}.run([&](auto& in) {
   56|  2.33M|        enum ops
   57|  2.33M|        {
   58|  2.33M|            op_transient,
   59|  2.33M|            op_persistent,
   60|  2.33M|            op_push_back,
   61|  2.33M|            op_update,
   62|  2.33M|            op_take,
   63|  2.33M|            op_drop,
   64|  2.33M|            op_concat,
   65|  2.33M|            op_push_back_mut,
   66|  2.33M|            op_update_mut,
   67|  2.33M|            op_take_mut,
   68|  2.33M|            op_drop_mut,
   69|  2.33M|            op_prepend_mut,
   70|  2.33M|            op_prepend_mut_move,
   71|  2.33M|            op_append_mut,
   72|  2.33M|            op_append_mut_move,
   73|  2.33M|        };
   74|  2.33M|        auto dst = read<char>(in, is_valid_var);
   75|  2.33M|        switch (read<char>(in)) {
   76|  94.9k|        case op_transient: {
  ------------------
  |  Branch (76:9): [True: 94.9k, False: 2.24M]
  ------------------
   77|  94.9k|            auto src = read<char>(in, is_valid_var);
   78|  94.9k|            ts[dst]  = vs[src].transient();
   79|  94.9k|            break;
   80|      0|        }
   81|  22.2k|        case op_persistent: {
  ------------------
  |  Branch (81:9): [True: 22.2k, False: 2.31M]
  ------------------
   82|  22.2k|            auto src = read<char>(in, is_valid_var);
   83|  22.2k|            vs[dst]  = ts[src].persistent();
   84|  22.2k|            break;
   85|      0|        }
   86|  71.1k|        case op_push_back: {
  ------------------
  |  Branch (86:9): [True: 71.1k, False: 2.26M]
  ------------------
   87|  71.1k|            auto src = read<char>(in, is_valid_var);
   88|  71.1k|            vs[dst]  = vs[src].push_back(42);
   89|  71.1k|            break;
   90|      0|        }
   91|  6.08k|        case op_update: {
  ------------------
  |  Branch (91:9): [True: 6.08k, False: 2.33M]
  ------------------
   92|  6.08k|            auto src = read<char>(in, is_valid_var);
   93|  6.08k|            auto idx = read<size_t>(in, is_valid_index(vs[src]));
   94|  6.08k|            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
   95|  6.08k|            break;
   96|      0|        }
   97|  12.4k|        case op_take: {
  ------------------
  |  Branch (97:9): [True: 12.4k, False: 2.32M]
  ------------------
   98|  12.4k|            auto src = read<char>(in, is_valid_var);
   99|  12.4k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  100|  12.4k|            vs[dst]  = vs[src].take(idx);
  101|  12.4k|            break;
  102|      0|        }
  103|  19.6k|        case op_drop: {
  ------------------
  |  Branch (103:9): [True: 19.6k, False: 2.31M]
  ------------------
  104|  19.6k|            auto src = read<char>(in, is_valid_var);
  105|  19.6k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  106|  19.6k|            vs[dst]  = vs[src].drop(idx);
  107|  19.6k|            break;
  108|      0|        }
  109|  60.0k|        case op_concat: {
  ------------------
  |  Branch (109:9): [True: 60.0k, False: 2.27M]
  ------------------
  110|  60.0k|            auto src  = read<char>(in, is_valid_var);
  111|  60.0k|            auto src2 = read<char>(in, is_valid_var);
  112|  60.0k|            if (can_concat(vs[src], vs[src2]))
  ------------------
  |  Branch (112:17): [True: 58.7k, False: 1.25k]
  ------------------
  113|  58.7k|                vs[dst] = vs[src] + vs[src2];
  114|  60.0k|            break;
  115|      0|        }
  116|  50.1k|        case op_push_back_mut: {
  ------------------
  |  Branch (116:9): [True: 50.1k, False: 2.28M]
  ------------------
  117|  50.1k|            ts[dst].push_back(13);
  118|  50.1k|            break;
  119|      0|        }
  120|  11.5k|        case op_update_mut: {
  ------------------
  |  Branch (120:9): [True: 11.5k, False: 2.32M]
  ------------------
  121|  11.5k|            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
  122|  11.5k|            ts[dst].update(idx, [](auto x) { return x + 1; });
  123|  11.5k|            break;
  124|      0|        }
  125|  40.2k|        case op_take_mut: {
  ------------------
  |  Branch (125:9): [True: 40.2k, False: 2.29M]
  ------------------
  126|  40.2k|            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
  127|  40.2k|            ts[dst].take(idx);
  128|  40.2k|            break;
  129|      0|        }
  130|  35.7k|        case op_prepend_mut: {
  ------------------
  |  Branch (130:9): [True: 35.7k, False: 2.30M]
  ------------------
  131|  35.7k|            auto src = read<char>(in, is_valid_var_neq(dst));
  132|  35.7k|            if (can_concat(ts[dst], ts[src]))
  ------------------
  |  Branch (132:17): [True: 33.1k, False: 2.52k]
  ------------------
  133|  33.1k|                ts[dst].prepend(ts[src]);
  134|  35.7k|            break;
  135|      0|        }
  136|  4.53k|        case op_prepend_mut_move: {
  ------------------
  |  Branch (136:9): [True: 4.53k, False: 2.33M]
  ------------------
  137|  4.53k|            auto src = read<char>(in, is_valid_var_neq(dst));
  138|  4.53k|            if (can_concat(ts[dst], ts[src])) {
  ------------------
  |  Branch (138:17): [True: 3.89k, False: 636]
  ------------------
  139|  3.89k|                ts[dst].prepend(std::move(ts[src]));
  140|  3.89k|                ts[src] = {};
  141|  3.89k|            }
  142|  4.53k|            break;
  143|      0|        }
  144|  1.86M|        case op_append_mut: {
  ------------------
  |  Branch (144:9): [True: 1.86M, False: 477k]
  ------------------
  145|  1.86M|            auto src = read<char>(in, is_valid_var_neq(dst));
  146|  1.86M|            if (can_concat(ts[dst], ts[src]))
  ------------------
  |  Branch (146:17): [True: 1.83M, False: 26.8k]
  ------------------
  147|  1.83M|                ts[dst].append(ts[src]);
  148|  1.86M|            break;
  149|      0|        }
  150|  5.77k|        case op_append_mut_move: {
  ------------------
  |  Branch (150:9): [True: 5.77k, False: 2.33M]
  ------------------
  151|  5.77k|            auto src = read<char>(in, is_valid_var_neq(dst));
  152|  5.77k|            if (can_concat(ts[dst], ts[src])) {
  ------------------
  |  Branch (152:17): [True: 5.38k, False: 394]
  ------------------
  153|  5.38k|                ts[dst].append(std::move(ts[src]));
  154|  5.38k|                ts[src] = {};
  155|  5.38k|            }
  156|  5.77k|            break;
  157|      0|        }
  158|  36.4k|        default:
  ------------------
  |  Branch (158:9): [True: 36.4k, False: 2.30M]
  ------------------
  159|  36.4k|            break;
  160|  2.33M|        };
  161|  2.33M|        return true;
  162|  2.33M|    });
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_:
   39|  2.95M|    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
  ------------------
  |  Branch (39:48): [True: 2.86M, False: 93.4k]
  |  Branch (39:60): [True: 2.67M, False: 182k]
  ------------------
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_:
   46|  7.07k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (46:39): [True: 7.07k, False: 0]
  |  Branch (46:51): [True: 5.99k, False: 1.07k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   45|  6.03k|    auto is_valid_index = [](auto& v) {
   46|  6.03k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  6.03k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_:
   94|  5.99k|            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_:
   49|  54.4k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (49:39): [True: 54.4k, False: 0]
  |  Branch (49:51): [True: 31.9k, False: 22.4k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   48|  32.0k|    auto is_valid_size = [](auto& v) {
   49|  32.0k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  32.0k|    };
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEESC_EEDaOT_OT0_:
   51|  59.9k|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  59.9k|        return v1.size() + v2.size() < vector_t::max_size();
   53|  59.9k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_:
   46|  14.8k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (46:39): [True: 14.8k, False: 0]
  |  Branch (46:51): [True: 11.5k, False: 3.35k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   45|  11.5k|    auto is_valid_index = [](auto& v) {
   46|  11.5k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  11.5k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_:
  122|  11.5k|            ts[dst].update(idx, [](auto x) { return x + 1; });
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_ENKUlSC_E_clIhEEDaSC_:
   49|  41.9k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (49:39): [True: 41.9k, False: 0]
  |  Branch (49:51): [True: 40.1k, False: 1.73k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   48|  40.2k|    auto is_valid_size = [](auto& v) {
   49|  40.2k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  40.2k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_:
   41|  1.96M|        return [=](auto idx) {
   42|  1.96M|            return idx >= 0 && idx < var_count && idx != other;
  ------------------
  |  Branch (42:20): [True: 1.94M, False: 15.0k]
  |  Branch (42:32): [True: 1.92M, False: 28.5k]
  |  Branch (42:51): [True: 1.90M, False: 13.8k]
  ------------------
   43|  1.96M|        };
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_:
   40|  1.90M|    auto is_valid_var_neq = [](auto other) {
   41|  1.90M|        return [=](auto idx) {
   42|  1.90M|            return idx >= 0 && idx < var_count && idx != other;
   43|  1.90M|        };
   44|  1.90M|    };
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIRN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEESC_EEDaOT_OT0_:
   51|  1.90M|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  1.90M|        return v1.size() + v2.size() < vector_t::max_size();
   53|  1.90M|    };

flex-vector-gc.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_5EEiT_:
   50|  7.87k|    {
   51|  7.87k|        if (size_ > fuzzer_input_max_size)
  ------------------
  |  Branch (51:13): [True: 12, False: 7.85k]
  ------------------
   52|     12|            return 0;
   53|  7.85k|        try {
   54|  2.33M|            while (step(*this))
  ------------------
  |  Branch (54:20): [True: 2.33M, False: 7.85k]
  ------------------
   55|  2.33M|                continue;
   56|  7.85k|        } catch (const no_more_input&) {
   57|  7.85k|        };
   58|  7.85k|        return 0;
   59|  7.85k|    }
flex-vector-gc.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_:
   70|  2.68M|{
   71|  2.68M|    auto x = read<T>(fz);
   72|  2.96M|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 276k, False: 2.68M]
  ------------------
   73|   276k|        x = read<T>(fz);
   74|  2.68M|    return x;
   75|  2.68M|}
_Z4readIcERKT_R12fuzzer_input:
   64|  7.25M|{
   65|  7.25M|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|  7.25M|}
_ZN12fuzzer_input4nextEmm:
   40|  7.37M|    {
   41|  7.37M|        auto& p = const_cast<void*&>(reinterpret_cast<const void*&>(data_));
   42|  7.37M|        auto r  = std::align(align, size, p, size_);
   43|  7.37M|        if (r == nullptr)
  ------------------
  |  Branch (43:13): [True: 7.85k, False: 7.37M]
  ------------------
   44|  7.85k|            throw no_more_input{};
   45|  7.37M|        return next(size);
   46|  7.37M|    }
_ZN12fuzzer_input4nextEm:
   30|  7.37M|    {
   31|  7.37M|        if (size_ < size)
  ------------------
  |  Branch (31:13): [True: 0, False: 7.37M]
  ------------------
   32|      0|            throw no_more_input{};
   33|  7.37M|        auto r = data_;
   34|  7.37M|        data_ += size;
   35|  7.37M|        size_ -= size;
   36|  7.37M|        return r;
   37|  7.37M|    }
flex-vector-gc.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_7gc_heapEEENS2_18no_refcount_policyENS2_15spinlock_policyENS2_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_:
   70|  6.03k|{
   71|  6.03k|    auto x = read<T>(fz);
   72|  7.11k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 1.07k, False: 6.03k]
  ------------------
   73|  1.07k|        x = read<T>(fz);
   74|  6.03k|    return x;
   75|  6.03k|}
_Z4readIhERKT_R12fuzzer_input:
   64|   118k|{
   65|   118k|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|   118k|}
flex-vector-gc.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS2_13memory_policyINS2_11heap_policyINS2_7gc_heapEEENS2_18no_refcount_policyENS2_15spinlock_policyENS2_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_:
   70|  32.0k|{
   71|  32.0k|    auto x = read<T>(fz);
   72|  54.4k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 22.4k, False: 32.0k]
  ------------------
   73|  22.4k|        x = read<T>(fz);
   74|  32.0k|    return x;
   75|  32.0k|}
flex-vector-gc.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer21flex_vector_transientIiNS2_13memory_policyINS2_11heap_policyINS2_7gc_heapEEENS2_18no_refcount_policyENS2_15spinlock_policyENS2_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_:
   70|  11.5k|{
   71|  11.5k|    auto x = read<T>(fz);
   72|  14.9k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 3.35k, False: 11.5k]
  ------------------
   73|  3.35k|        x = read<T>(fz);
   74|  11.5k|    return x;
   75|  11.5k|}
flex-vector-gc.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer21flex_vector_transientIiNS2_13memory_policyINS2_11heap_policyINS2_7gc_heapEEENS2_18no_refcount_policyENS2_15spinlock_policyENS2_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_:
   70|  40.2k|{
   71|  40.2k|    auto x = read<T>(fz);
   72|  41.9k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 1.73k, False: 40.2k]
  ------------------
   73|  1.73k|        x = read<T>(fz);
   74|  40.2k|    return x;
   75|  40.2k|}
flex-vector-gc.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_:
   70|  1.90M|{
   71|  1.90M|    auto x = read<T>(fz);
   72|  1.96M|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 57.4k, False: 1.90M]
  ------------------
   73|  57.4k|        x = read<T>(fz);
   74|  1.90M|    return x;
   75|  1.90M|}

_ZN5immer6detail3csl3getINS_18no_refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEES3_NS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11impl_data_tENS1_7inheritIS3_NS1_6memberINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE:
  170|  20.9M|        {
  171|  20.9M|            return x.get_(type_t<U>{});
  172|  20.9M|        }
_ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11impl_data_tENS1_7inheritIS9_NS1_6memberINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE:
  184|  20.9M|        {
  185|  20.9M|            return n.get_(t);
  186|  20.9M|        }
_ZNK5immer6detail3csl7inheritINS_18no_refcount_policyENS1_6memberINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE:
   82|  22.4M|        const T& get_(type_t<T>) const { return *this; }
_ZN5immer6detail3csl3getINS_18no_refcount_policyEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEES3_NS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14relaxed_data_tENS1_7inheritIS3_NS1_6memberINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE:
  170|  1.49M|        {
  171|  1.49M|            return x.get_(type_t<U>{});
  172|  1.49M|        }
_ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14relaxed_data_tENS1_7inheritIS9_NS1_6memberINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE:
  184|  1.49M|        {
  185|  1.49M|            return n.get_(t);
  186|  1.49M|        }
_ZN5immer6detail3csl3getINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_18no_refcount_policyENS_15spinlock_policyES3_Lb0ELb0EEELj2ELj2EE14relaxed_data_tENS1_7inheritISF_NS1_6memberISA_vE4typeEE4typeEE4typeE:
  165|  2.87M|        {
  166|  2.87M|            return x.get_(type_t<U>{});
  167|  2.87M|        }
_ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14relaxed_data_tENS1_7inheritIS9_NS1_6memberINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE:
  179|  2.87M|        {
  180|  2.87M|            return n.get_(t);
  181|  2.87M|        }
_ZN5immer6detail3csl6memberINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  150|  5.90M|        T& get_(type_t<T>) { return d; }
_ZN5immer6detail3csl3getINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEEEDcRNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_18no_refcount_policyENS_15spinlock_policyES3_Lb0ELb0EEELj2ELj2EE11impl_data_tENS1_7inheritISF_NS1_6memberISA_vE4typeEE4typeEE4typeE:
  165|  3.03M|        {
  166|  3.03M|            return x.get_(type_t<U>{});
  167|  3.03M|        }
_ZN5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11impl_data_tENS1_7inheritIS9_NS1_6memberINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE:
  179|  3.03M|        {
  180|  3.03M|            return n.get_(t);
  181|  3.03M|        }
_ZN5immer6detail3csl3getINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEEEDcRKNS1_10member_twoINS0_4rbts4nodeIiNS_13memory_policyIS7_NS_18no_refcount_policyENS_15spinlock_policyES3_Lb0ELb0EEELj2ELj2EE11impl_data_tENS1_7inheritISF_NS1_6memberISA_vE4typeEE4typeEE4typeE:
  170|  14.8M|        {
  171|  14.8M|            return x.get_(type_t<U>{});
  172|  14.8M|        }
_ZNK5immer6detail3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11impl_data_tENS1_7inheritIS9_NS1_6memberINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE:
  184|  14.8M|        {
  185|  14.8M|            return n.get_(t);
  186|  14.8M|        }
_ZNK5immer6detail3csl6memberINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  151|  14.8M|        const T& get_(type_t<T>) const { return d; }

_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE17make_inner_n_intoEPvmj:
  213|  71.3k|    {
  214|  71.3k|        assert(n <= branches<B>);
  ------------------
  |  Branch (214:9): [True: 71.3k, False: 0]
  ------------------
  215|  71.3k|        assert(size >= sizeof_inner_n(n));
  ------------------
  |  Branch (215:9): [True: 71.3k, False: 0]
  ------------------
  216|  71.3k|        auto p                       = new (buffer) node_t;
  217|  71.3k|        p->impl.d.data.inner.relaxed = nullptr;
  218|  71.3k|#if IMMER_TAGGED_NODE
  219|  71.3k|        p->impl.d.kind = node_t::kind_t::inner;
  220|  71.3k|#endif
  221|  71.3k|        return p;
  222|  71.3k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14sizeof_inner_nEj:
  145|   214k|    {
  146|   214k|        return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n);
  ------------------
  |  Branch (146:16): [Folded, False: 214k]
  ------------------
  147|   214k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE21sizeof_packed_inner_nEj:
  114|   926k|    {
  115|       |        return immer_offsetof(impl_t, d.data.inner) +
  ------------------
  |  |   19|   926k|#define immer_offsetof offsetof
  ------------------
  116|   926k|               inner_t::get_storage_offset() +
  117|   926k|               sizeof(typename inner_t::storage_type) * count;
  118|   926k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3incEv:
  956|  3.38M|    {
  957|  3.38M|        refs(this).inc();
  958|  3.38M|        return this;
  959|  3.38M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4refsEPKSB_:
  203|  20.9M|    {
  204|  20.9M|        return auto_const_cast(get<refs_t>(x->impl));
  205|  20.9M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE16make_leaf_n_intoEPvmj:
  330|   127k|    {
  331|   127k|        assert(n <= branches<BL>);
  ------------------
  |  Branch (331:9): [True: 127k, False: 0]
  ------------------
  332|   127k|        assert(size >= sizeof_leaf_n(n));
  ------------------
  |  Branch (332:9): [True: 127k, False: 0]
  ------------------
  333|   127k|        auto p = new (buffer) node_t;
  334|   127k|#if IMMER_TAGGED_NODE
  335|   127k|        p->impl.d.kind = node_t::kind_t::leaf;
  336|   127k|#endif
  337|   127k|        return p;
  338|   127k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13sizeof_leaf_nEj:
  160|   383k|    {
  161|   383k|        return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n);
  ------------------
  |  Branch (161:16): [Folded, False: 383k]
  ------------------
  162|   383k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE20sizeof_packed_leaf_nEj:
  107|   383k|    {
  108|       |        return immer_offsetof(impl_t, d.data.leaf) +
  ------------------
  |  |   19|   383k|#define immer_offsetof offsetof
  ------------------
  109|   383k|               leaf_t::get_storage_offset() +
  110|   383k|               sizeof(typename leaf_t::storage_type) * count;
  111|   383k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7relaxedEv:
  172|  30.7M|    {
  173|  30.7M|        IMMER_ASSERT_TAGGED(kind() == kind_t::inner);
  ------------------
  |  |   68|  30.7M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (173:9): [True: 30.7M, False: 0]
  ------------------
  174|  30.7M|        return impl.d.data.inner.relaxed;
  175|  30.7M|    }
_ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4kindEv:
  168|  82.5M|    kind_t kind() const { return impl.d.kind; }
_ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3decEv:
  967|  2.07M|    bool dec() const { return refs(this).dec(); }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5innerEv:
  184|  37.0M|    {
  185|  37.0M|        IMMER_ASSERT_TAGGED(kind() == kind_t::inner);
  ------------------
  |  |   68|  37.0M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (185:9): [True: 37.0M, False: 0]
  ------------------
  186|  37.0M|        return impl.d.data.inner.get_storage_ptr();
  187|  37.0M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4refsEPKNS0_3csl10member_twoINSB_14relaxed_data_tENSC_7inheritIS7_NSC_6memberINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE:
  196|  1.49M|    {
  197|  1.49M|        return auto_const_cast(get<refs_t>(*x));
  198|  1.49M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5owneeEPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_7inheritIS7_NSC_6memberINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE:
  200|  2.87M|    static ownee_t& ownee(relaxed_t* x) { return get<ownee_t>(*x); }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE16sizeof_relaxed_nEj:
  155|   682k|    {
  156|   682k|        return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n);
  ------------------
  |  Branch (156:16): [Folded, False: 682k]
  ------------------
  157|   682k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE23sizeof_packed_relaxed_nEj:
  121|   682k|    {
  122|       |        return immer_offsetof(relaxed_t, d.sizes) + sizeof(size_t) * count;
  ------------------
  |  |   19|   682k|#define immer_offsetof offsetof
  ------------------
  123|   682k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5owneeEPSB_:
  210|  3.03M|    static ownee_t& ownee(node_t* x) { return get<ownee_t>(x->impl); }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE16sizeof_inner_r_nEj:
  150|   712k|    {
  151|   712k|        return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n);
  ------------------
  |  Branch (151:16): [Folded, False: 712k]
  ------------------
  152|   712k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE23sizeof_packed_inner_r_nEj:
  126|   712k|    {
  127|   712k|        return embed_relaxed ? sizeof_packed_inner_n(count) +
  ------------------
  |  Branch (127:16): [Folded, False: 712k]
  ------------------
  128|      0|                                   sizeof_packed_relaxed_n(count)
  129|   712k|                             : sizeof_packed_inner_n(count);
  130|   712k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4leafEv:
  190|  8.95M|    {
  191|  8.95M|        IMMER_ASSERT_TAGGED(kind() == kind_t::leaf);
  ------------------
  |  |   68|  8.95M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (191:9): [True: 8.95M, False: 0]
  ------------------
  192|  8.95M|        return impl.d.data.leaf.get_storage_ptr();
  193|  8.95M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_:
  794|  52.7k|    {
  795|  52.7k|        auto dst = copy_leaf_n(n + 1, src, n);
  796|  52.7k|        IMMER_TRY {
  ------------------
  |  |   49|  52.7k|#define IMMER_TRY try
  ------------------
  797|  52.7k|            new (dst->leaf() + n) T(std::forward<U>(x));
  798|  52.7k|        }
  799|  52.7k|        IMMER_CATCH (...) {
  800|      0|            detail::destroy_n(dst->leaf(), n);
  801|      0|            heap::deallocate(node_t::sizeof_leaf_n(n + 1), dst);
  802|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  803|      0|        }
  804|  52.7k|        return dst;
  805|  52.7k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_nEjPSB_j:
  696|  52.7k|    {
  697|  52.7k|        assert(allocn >= n);
  ------------------
  |  Branch (697:9): [True: 52.7k, False: 0]
  ------------------
  698|  52.7k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  52.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (698:9): [True: 52.7k, False: 0]
  ------------------
  699|  52.7k|        auto dst = make_leaf_n(allocn);
  700|  52.7k|        IMMER_TRY {
  ------------------
  |  |   49|  52.7k|#define IMMER_TRY try
  ------------------
  701|  52.7k|            detail::uninitialized_copy(
  702|  52.7k|                src->leaf(), src->leaf() + n, dst->leaf());
  703|  52.7k|        }
  704|  52.7k|        IMMER_CATCH (...) {
  705|      0|            heap::deallocate(node_t::sizeof_leaf_n(allocn), dst);
  706|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  707|      0|        }
  708|  52.7k|        return dst;
  709|  52.7k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_nEj:
  341|   127k|    {
  342|   127k|        assert(n <= branches<BL>);
  ------------------
  |  Branch (342:9): [True: 127k, False: 0]
  ------------------
  343|   127k|        auto m = heap::allocate(sizeof_leaf_n(n));
  344|   127k|        return make_leaf_n_into(m, sizeof_leaf_n(n), n);
  345|   127k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_:
  470|  18.3k|    {
  471|  18.3k|        assert(n >= 1);
  ------------------
  |  Branch (471:9): [True: 18.3k, False: 0]
  ------------------
  472|  18.3k|        auto p = make_leaf_n(n);
  473|  18.3k|        IMMER_TRY {
  ------------------
  |  |   49|  18.3k|#define IMMER_TRY try
  ------------------
  474|  18.3k|            new (p->leaf()) T(std::forward<U>(x));
  475|  18.3k|        }
  476|  18.3k|        IMMER_CATCH (...) {
  477|      0|            heap::deallocate(node_t::sizeof_leaf_n(n), p);
  478|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  479|      0|        }
  480|  18.3k|        return p;
  481|  18.3k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13do_copy_innerEPSB_SC_j:
  558|  94.1k|    {
  559|  94.1k|        IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner);
  ------------------
  |  |   68|  94.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (559:9): [True: 94.1k, False: 0]
  ------------------
  560|  94.1k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  94.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (560:9): [True: 94.1k, False: 0]
  ------------------
  561|  94.1k|        auto p = src->inner();
  562|  94.1k|        inc_nodes(p, n);
  563|  94.1k|        std::copy(p, p + n, dst->inner());
  564|  94.1k|        return dst;
  565|  94.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9inc_nodesEPPSB_j:
  970|   413k|    {
  971|  1.06M|        for (auto i = p, e = i + n; i != e; ++i)
  ------------------
  |  Branch (971:37): [True: 646k, False: 413k]
  ------------------
  972|   646k|            refs(*i).inc();
  973|   413k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14copy_inner_r_nEjPSB_j:
  588|  54.1k|    {
  589|  54.1k|        assert(allocn >= n);
  ------------------
  |  Branch (589:9): [True: 54.1k, False: 0]
  ------------------
  590|  54.1k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  54.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (590:9): [True: 54.1k, False: 0]
  ------------------
  591|  54.1k|        auto dst = make_inner_r_n(allocn);
  592|  54.1k|        return do_copy_inner_r(dst, src, n);
  593|  54.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j:
  610|  92.1k|    {
  611|  92.1k|        IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner);
  ------------------
  |  |   68|  92.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (611:9): [True: 92.1k, False: 0]
  ------------------
  612|  92.1k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  92.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (612:9): [True: 92.1k, False: 0]
  ------------------
  613|  92.1k|        auto src_r = src->relaxed();
  614|  92.1k|        auto dst_r = dst->relaxed();
  615|  92.1k|        inc_nodes(src->inner(), n);
  616|  92.1k|        std::copy(src->inner(), src->inner() + n, dst->inner());
  617|  92.1k|        std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  618|  92.1k|        dst_r->d.count = n;
  619|  92.1k|        return dst;
  620|  92.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14make_inner_r_nEj:
  243|   682k|    {
  244|   682k|        assert(n <= branches<B>);
  ------------------
  |  Branch (244:9): [True: 682k, False: 0]
  ------------------
  245|   682k|        auto mp = heap::allocate(sizeof_inner_r_n(n));
  246|   682k|        auto mr = static_cast<void*>(nullptr);
  247|   682k|        if (embed_relaxed) {
  ------------------
  |  Branch (247:13): [Folded, False: 682k]
  ------------------
  248|      0|            mr = reinterpret_cast<unsigned char*>(mp) + sizeof_inner_n(n);
  249|   682k|        } else {
  250|   682k|            IMMER_TRY {
  ------------------
  |  |   49|   682k|#define IMMER_TRY try
  ------------------
  251|   682k|                mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{});
  252|   682k|            }
  253|   682k|            IMMER_CATCH (...) {
  254|      0|                heap::deallocate(sizeof_inner_r_n(n), mp);
  255|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  256|      0|            }
  257|   682k|        }
  258|   682k|        auto p                       = new (mp) node_t;
  259|   682k|        auto r                       = new (mr) relaxed_t;
  260|   682k|        r->d.count                   = 0;
  261|   682k|        p->impl.d.data.inner.relaxed = r;
  262|   682k|#if IMMER_TAGGED_NODE
  263|   682k|        p->impl.d.kind = node_t::kind_t::inner;
  264|   682k|#endif
  265|   682k|        return p;
  266|   682k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9make_pathEjPSB_:
  498|  40.2k|    {
  499|  40.2k|        IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf);
  ------------------
  |  |   68|  40.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (499:9): [True: 40.2k, False: 0]
  ------------------
  500|  40.2k|        if (shift == endshift<B, BL>)
  ------------------
  |  Branch (500:13): [True: 26.4k, False: 13.8k]
  ------------------
  501|  26.4k|            return node;
  502|  13.8k|        else {
  503|  13.8k|            auto n = node_t::make_inner_n(1);
  504|  13.8k|            IMMER_TRY {
  ------------------
  |  |   49|  13.8k|#define IMMER_TRY try
  ------------------
  505|  13.8k|                n->inner()[0] = make_path(shift - B, node);
  506|  13.8k|            }
  507|  13.8k|            IMMER_CATCH (...) {
  508|      0|                heap::deallocate(node_t::sizeof_inner_n(1), n);
  509|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  510|      0|            }
  511|  13.8k|            return n;
  512|  13.8k|        }
  513|  40.2k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12make_inner_nEj:
  224|  71.3k|    {
  225|  71.3k|        assert(n <= branches<B>);
  ------------------
  |  Branch (225:9): [True: 71.3k, False: 0]
  ------------------
  226|  71.3k|        auto m = heap::allocate(sizeof_inner_n(n));
  227|  71.3k|        return make_inner_n_into(m, sizeof_inner_n(n), n);
  228|  71.3k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9copy_leafEPSB_j:
  666|  13.1k|    {
  667|  13.1k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  13.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (667:9): [True: 13.1k, False: 0]
  ------------------
  668|  13.1k|        auto dst = make_leaf_n(n);
  669|  13.1k|        IMMER_TRY {
  ------------------
  |  |   49|  13.1k|#define IMMER_TRY try
  ------------------
  670|  13.1k|            detail::uninitialized_copy(
  671|  13.1k|                src->leaf(), src->leaf() + n, dst->leaf());
  672|  13.1k|        }
  673|  13.1k|        IMMER_CATCH (...) {
  674|      0|            heap::deallocate(node_t::sizeof_leaf_n(n), dst);
  675|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  676|      0|        }
  677|  13.1k|        return dst;
  678|  13.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15make_inner_sr_nEjPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_7inheritIS7_NSC_6memberINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeE:
  269|  30.1k|    {
  270|  30.1k|        return static_if<embed_relaxed, node_t*>(
  271|  30.1k|            [&](auto) { return node_t::make_inner_r_n(n); },
  272|  30.1k|            [&](auto) {
  273|  30.1k|                auto p =
  274|  30.1k|                    new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t;
  275|  30.1k|                assert(r->d.count >= n);
  276|  30.1k|                node_t::refs(r).inc();
  277|  30.1k|                p->impl.d.data.inner.relaxed = r;
  278|  30.1k|#if IMMER_TAGGED_NODE
  279|  30.1k|                p->impl.d.kind = node_t::kind_t::inner;
  280|  30.1k|#endif
  281|  30.1k|                return p;
  282|  30.1k|            });
  283|  30.1k|    }
_ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15make_inner_sr_nEjPNS0_3csl10member_twoINSB_14relaxed_data_tENSC_7inheritIS7_NSC_6memberINS9_5applyIS6_E4type5owneeEvE4typeEE4typeEE4typeEENKUlT_E0_clINS0_7empty_tEEEDaSS_:
  272|  30.1k|            [&](auto) {
  273|  30.1k|                auto p =
  274|  30.1k|                    new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t;
  275|  30.1k|                assert(r->d.count >= n);
  ------------------
  |  Branch (275:17): [True: 30.1k, False: 0]
  ------------------
  276|  30.1k|                node_t::refs(r).inc();
  277|  30.1k|                p->impl.d.data.inner.relaxed = r;
  278|  30.1k|#if IMMER_TAGGED_NODE
  279|  30.1k|                p->impl.d.kind = node_t::kind_t::inner;
  280|  30.1k|#endif
  281|  30.1k|                return p;
  282|  30.1k|            });
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_:
  652|  30.1k|    {
  653|  30.1k|        if (embed_relaxed)
  ------------------
  |  Branch (653:13): [Folded, False: 30.1k]
  ------------------
  654|      0|            return do_copy_inner_replace_r(dst, src, n, offset, child);
  655|  30.1k|        else {
  656|  30.1k|            auto p = src->inner();
  657|  30.1k|            inc_nodes(p, offset);
  658|  30.1k|            inc_nodes(p + offset + 1, n - offset - 1);
  659|  30.1k|            std::copy(p, p + n, dst->inner());
  660|  30.1k|            dst->inner()[offset] = child;
  661|  30.1k|            return dst;
  662|  30.1k|        }
  663|  30.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE21do_copy_inner_replaceEPSB_SC_jjSC_:
  569|  4.44k|    {
  570|  4.44k|        IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner);
  ------------------
  |  |   68|  4.44k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (570:9): [True: 4.44k, False: 0]
  ------------------
  571|  4.44k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  4.44k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (571:9): [True: 4.44k, False: 0]
  ------------------
  572|  4.44k|        auto p = src->inner();
  573|  4.44k|        inc_nodes(p, offset);
  574|  4.44k|        inc_nodes(p + offset + 1, n - offset - 1);
  575|  4.44k|        std::copy(p, p + n, dst->inner());
  576|  4.44k|        dst->inner()[offset] = child;
  577|  4.44k|        return dst;
  578|  4.44k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12copy_inner_nEjPSB_j:
  543|  5.30k|    {
  544|  5.30k|        assert(allocn >= n);
  ------------------
  |  Branch (544:9): [True: 5.30k, False: 0]
  ------------------
  545|  5.30k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  5.30k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (545:9): [True: 5.30k, False: 0]
  ------------------
  546|  5.30k|        auto dst = make_inner_n(allocn);
  547|  5.30k|        return do_copy_inner(dst, src, n);
  548|  5.30k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12copy_inner_rEPSB_j:
  581|  3.02k|    {
  582|  3.02k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  3.02k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (582:9): [True: 3.02k, False: 0]
  ------------------
  583|  3.02k|        auto dst = make_inner_r_n(n);
  584|  3.02k|        return do_copy_inner_r(dst, src, n);
  585|  3.02k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13compute_shiftEv:
  977|  1.42M|    {
  978|  1.42M|        if (kind() == kind_t::leaf)
  ------------------
  |  Branch (978:13): [True: 181k, False: 1.24M]
  ------------------
  979|   181k|            return endshift<B, BL>;
  980|  1.24M|        else
  981|  1.24M|            return B + inner()[0]->compute_shift();
  982|  1.42M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5checkEjm:
  986|  61.4k|    {
  987|       |#if IMMER_DEBUG_DEEP_CHECK
  988|       |        assert(size > 0);
  989|       |        if (shift == endshift<B, BL>) {
  990|       |            IMMER_ASSERT_TAGGED(kind() == kind_t::leaf);
  991|       |            assert(size <= branches<BL>);
  992|       |        } else if (auto r = relaxed()) {
  993|       |            auto count = r->d.count;
  994|       |            assert(count > 0);
  995|       |            assert(count <= branches<B>);
  996|       |            if (r->d.sizes[count - 1] != size) {
  997|       |                IMMER_TRACE_F("check");
  998|       |                IMMER_TRACE_E(r->d.sizes[count - 1]);
  999|       |                IMMER_TRACE_E(size);
 1000|       |            }
 1001|       |            assert(r->d.sizes[count - 1] == size);
 1002|       |            for (auto i = 1u; i < count; ++i)
 1003|       |                assert(r->d.sizes[i - 1] < r->d.sizes[i]);
 1004|       |            auto last_size = size_t{};
 1005|       |            for (auto i = 0u; i < count; ++i) {
 1006|       |                assert(inner()[i]->check(shift - B, r->d.sizes[i] - last_size));
 1007|       |                last_size = r->d.sizes[i];
 1008|       |            }
 1009|       |        } else {
 1010|       |            assert(size <= branches<B> << shift);
 1011|       |            auto count =
 1012|       |                (size >> shift) + (size - ((size >> shift) << shift) > 0);
 1013|       |            assert(count <= branches<B>);
 1014|       |            if (count) {
 1015|       |                for (auto i = 1u; i < count - 1; ++i)
 1016|       |                    assert(inner()[i]->check(shift - B, 1 << shift));
 1017|       |                assert(inner()[count - 1]->check(
 1018|       |                    shift - B, size - ((count - 1) << shift)));
 1019|       |            }
 1020|       |        }
 1021|       |#endif // IMMER_DEBUG_DEEP_CHECK
 1022|  61.4k|        return true;
 1023|  61.4k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9copy_leafEPSB_jj:
  778|  19.3k|    {
  779|  19.3k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  19.3k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (779:9): [True: 19.3k, False: 0]
  ------------------
  780|  19.3k|        auto dst = make_leaf_n(last - idx);
  781|  19.3k|        IMMER_TRY {
  ------------------
  |  |   49|  19.3k|#define IMMER_TRY try
  ------------------
  782|  19.3k|            detail::uninitialized_copy(
  783|  19.3k|                src->leaf() + idx, src->leaf() + last, dst->leaf());
  784|  19.3k|        }
  785|  19.3k|        IMMER_CATCH (...) {
  786|      0|            heap::deallocate(node_t::sizeof_leaf_n(last - idx), dst);
  787|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  788|      0|        }
  789|  19.3k|        return dst;
  790|  19.3k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9copy_leafEPSB_jSC_j:
  712|  8.01k|    {
  713|  8.01k|        IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf);
  ------------------
  |  |   68|  8.01k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (713:9): [True: 8.01k, False: 0]
  ------------------
  714|  8.01k|        IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf);
  ------------------
  |  |   68|  8.01k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (714:9): [True: 8.01k, False: 0]
  ------------------
  715|  8.01k|        auto dst = make_leaf_n(n1 + n2);
  716|  8.01k|        IMMER_TRY {
  ------------------
  |  |   49|  8.01k|#define IMMER_TRY try
  ------------------
  717|  8.01k|            detail::uninitialized_copy(
  718|  8.01k|                src1->leaf(), src1->leaf() + n1, dst->leaf());
  719|  8.01k|        }
  720|  8.01k|        IMMER_CATCH (...) {
  721|      0|            heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst);
  722|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  723|      0|        }
  724|  8.01k|        IMMER_TRY {
  ------------------
  |  |   49|  8.01k|#define IMMER_TRY try
  ------------------
  725|  8.01k|            detail::uninitialized_copy(
  726|  8.01k|                src2->leaf(), src2->leaf() + n2, dst->leaf() + n1);
  727|  8.01k|        }
  728|  8.01k|        IMMER_CATCH (...) {
  729|      0|            detail::destroy_n(dst->leaf(), n1);
  730|      0|            heap::deallocate(node_t::sizeof_leaf_n(n1 + n2), dst);
  731|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  732|      0|        }
  733|  8.01k|        return dst;
  734|  8.01k|    }
_ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE:
  870|  14.8M|    {
  871|  14.8M|        return refs(this).unique() || ownee(this).can_mutate(e);
  ------------------
  |  Branch (871:16): [True: 0, False: 14.8M]
  |  Branch (871:39): [True: 13.7M, False: 1.03M]
  ------------------
  872|  14.8M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5owneeEPKSB_:
  207|  14.8M|    {
  208|  14.8M|        return get<ownee_t>(x->impl);
  209|  14.8M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j:
  681|  47.0k|    {
  682|  47.0k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  47.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (682:9): [True: 47.0k, False: 0]
  ------------------
  683|  47.0k|        auto dst = make_leaf_e(e);
  684|  47.0k|        IMMER_TRY {
  ------------------
  |  |   49|  47.0k|#define IMMER_TRY try
  ------------------
  685|  47.0k|            detail::uninitialized_copy(
  686|  47.0k|                src->leaf(), src->leaf() + n, dst->leaf());
  687|  47.0k|        }
  688|  47.0k|        IMMER_CATCH (...) {
  689|      0|            heap::deallocate(node_t::max_sizeof_leaf, dst);
  690|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  691|      0|        }
  692|  47.0k|        return dst;
  693|  47.0k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE:
  348|  1.45M|    {
  349|  1.45M|        auto p   = new (heap::allocate(max_sizeof_leaf)) node_t;
  350|  1.45M|        ownee(p) = e;
  351|  1.45M|#if IMMER_TAGGED_NODE
  352|  1.45M|        p->impl.d.kind = node_t::kind_t::leaf;
  353|  1.45M|#endif
  354|  1.45M|        return p;
  355|  1.45M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_:
  485|  18.0k|    {
  486|  18.0k|        auto p = make_leaf_e(e);
  487|  18.0k|        IMMER_TRY {
  ------------------
  |  |   49|  18.0k|#define IMMER_TRY try
  ------------------
  488|  18.0k|            new (p->leaf()) T(std::forward<U>(x));
  489|  18.0k|        }
  490|  18.0k|        IMMER_CATCH (...) {
  491|      0|            heap::deallocate(node_t::max_sizeof_leaf, p);
  492|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  493|      0|        }
  494|  18.0k|        return p;
  495|  18.0k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj:
  930|   894k|    {
  931|   894k|        auto src_r = relaxed();
  932|   894k|        return static_if<embed_relaxed, relaxed_t*>(
  933|   894k|            [&](auto) { return src_r; },
  934|   894k|            [&](auto) {
  935|   894k|                if (node_t::refs(src_r).unique() ||
  936|   894k|                    node_t::ownee(src_r).can_mutate(e))
  937|   894k|                    return src_r;
  938|   894k|                else {
  939|   894k|                    auto dst_r =
  940|   894k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  941|   894k|                    if (src_r) {
  942|   894k|                        std::copy(
  943|   894k|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  944|   894k|                        if (node_t::refs(src_r).dec())
  945|   894k|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  946|   894k|                                             src_r);
  947|   894k|                    }
  948|   894k|                    dst_r->d.count                   = n;
  949|   894k|                    node_t::ownee(dst_r)             = e;
  950|   894k|                    return impl.d.data.inner.relaxed = dst_r;
  951|   894k|                }
  952|   894k|            });
  953|   894k|    }
_ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEjENKUlT_E0_clINS0_7empty_tEEEDaSG_:
  934|   894k|            [&](auto) {
  935|   894k|                if (node_t::refs(src_r).unique() ||
  ------------------
  |  Branch (935:21): [True: 0, False: 894k]
  ------------------
  936|   894k|                    node_t::ownee(src_r).can_mutate(e))
  ------------------
  |  Branch (936:21): [True: 892k, False: 2.46k]
  ------------------
  937|   892k|                    return src_r;
  938|  2.46k|                else {
  939|  2.46k|                    auto dst_r =
  940|  2.46k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  941|  2.46k|                    if (src_r) {
  ------------------
  |  Branch (941:25): [True: 2.46k, False: 0]
  ------------------
  942|  2.46k|                        std::copy(
  943|  2.46k|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  944|  2.46k|                        if (node_t::refs(src_r).dec())
  ------------------
  |  Branch (944:29): [True: 0, False: 2.46k]
  ------------------
  945|      0|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  946|      0|                                             src_r);
  947|  2.46k|                    }
  948|  2.46k|                    dst_r->d.count                   = n;
  949|  2.46k|                    node_t::ownee(dst_r)             = e;
  950|  2.46k|                    return impl.d.data.inner.relaxed = dst_r;
  951|  2.46k|                }
  952|   894k|            });
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j:
  596|  34.9k|    {
  597|  34.9k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  34.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (597:9): [True: 34.9k, False: 0]
  ------------------
  598|  34.9k|        auto dst = make_inner_r_e(e);
  599|  34.9k|        return do_copy_inner_r(dst, src, n);
  600|  34.9k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editE:
  286|   875k|    {
  287|   875k|        auto mp = heap::allocate(max_sizeof_inner_r);
  288|   875k|        auto mr = static_cast<void*>(nullptr);
  289|   875k|        if (embed_relaxed) {
  ------------------
  |  Branch (289:13): [Folded, False: 875k]
  ------------------
  290|      0|            mr = reinterpret_cast<unsigned char*>(mp) + max_sizeof_inner;
  291|   875k|        } else {
  292|   875k|            IMMER_TRY {
  ------------------
  |  |   49|   875k|#define IMMER_TRY try
  ------------------
  293|   875k|                mr = heap::allocate(max_sizeof_relaxed, norefs_tag{});
  294|   875k|            }
  295|   875k|            IMMER_CATCH (...) {
  296|      0|                heap::deallocate(max_sizeof_inner_r, mp);
  297|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  298|      0|            }
  299|   875k|        }
  300|   875k|        auto p   = new (mp) node_t;
  301|   875k|        auto r   = new (mr) relaxed_t;
  302|   875k|        ownee(p) = e;
  303|   875k|        static_if<!embed_relaxed>([&](auto) { node_t::ownee(r) = e; });
  304|   875k|        r->d.count                   = 0;
  305|   875k|        p->impl.d.data.inner.relaxed = r;
  306|   875k|#if IMMER_TAGGED_NODE
  307|   875k|        p->impl.d.kind = node_t::kind_t::inner;
  308|   875k|#endif
  309|   875k|        return p;
  310|   875k|    }
_ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editEENKUlT_E_clINS0_7empty_tEEEDaSG_:
  303|   875k|        static_if<!embed_relaxed>([&](auto) { node_t::ownee(r) = e; });
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_path_eENS9_5applyIS6_E4type4editEjPSB_:
  516|  2.32M|    {
  517|  2.32M|        IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf);
  ------------------
  |  |   68|  2.32M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (517:9): [True: 2.32M, False: 0]
  ------------------
  518|  2.32M|        if (shift == endshift<B, BL>)
  ------------------
  |  Branch (518:13): [True: 1.73M, False: 585k]
  ------------------
  519|  1.73M|            return node;
  520|   585k|        else {
  521|   585k|            auto n = node_t::make_inner_e(e);
  522|   585k|            IMMER_TRY {
  ------------------
  |  |   49|   585k|#define IMMER_TRY try
  ------------------
  523|   585k|                n->inner()[0] = make_path_e(e, shift - B, node);
  524|   585k|            }
  525|   585k|            IMMER_CATCH (...) {
  526|      0|                heap::deallocate(node_t::max_sizeof_inner, n);
  527|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  528|      0|            }
  529|   585k|            return n;
  530|   585k|        }
  531|  2.32M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12make_inner_eENS9_5applyIS6_E4type4editE:
  231|   632k|    {
  232|   632k|        auto m                       = heap::allocate(max_sizeof_inner);
  233|   632k|        auto p                       = new (m) node_t;
  234|   632k|        ownee(p)                     = e;
  235|   632k|        p->impl.d.data.inner.relaxed = nullptr;
  236|   632k|#if IMMER_TAGGED_NODE
  237|   632k|        p->impl.d.kind = node_t::kind_t::inner;
  238|   632k|#endif
  239|   632k|        return p;
  240|   632k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j:
  551|  25.5k|    {
  552|  25.5k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  25.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (552:9): [True: 25.5k, False: 0]
  ------------------
  553|  25.5k|        auto dst = make_inner_e(e);
  554|  25.5k|        return do_copy_inner(dst, src, n);
  555|  25.5k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j:
  603|  18.9k|    {
  604|  18.9k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  18.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (604:9): [True: 18.9k, False: 0]
  ------------------
  605|  18.9k|        auto dst = make_inner_sr_e(e, src->relaxed());
  606|  18.9k|        return do_copy_inner_sr(dst, src, n);
  607|  18.9k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl10member_twoINSB_14relaxed_data_tENSG_7inheritIS7_NSG_6memberINSE_5owneeEvE4typeEE4typeEE4typeE:
  313|  18.9k|    {
  314|  18.9k|        return static_if<embed_relaxed, node_t*>(
  315|  18.9k|            [&](auto) { return node_t::make_inner_r_e(e); },
  316|  18.9k|            [&](auto) {
  317|  18.9k|                auto p =
  318|  18.9k|                    new (heap::allocate(node_t::max_sizeof_inner_r)) node_t;
  319|  18.9k|                node_t::refs(r).inc();
  320|  18.9k|                p->impl.d.data.inner.relaxed = r;
  321|  18.9k|                node_t::ownee(p)             = e;
  322|  18.9k|#if IMMER_TAGGED_NODE
  323|  18.9k|                p->impl.d.kind = node_t::kind_t::inner;
  324|  18.9k|#endif
  325|  18.9k|                return p;
  326|  18.9k|            });
  327|  18.9k|    }
_ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15make_inner_sr_eENS9_5applyIS6_E4type4editEPNS0_3csl10member_twoINSB_14relaxed_data_tENSG_7inheritIS7_NSG_6memberINSE_5owneeEvE4typeEE4typeEE4typeEENKUlT_E0_clINS0_7empty_tEEEDaST_:
  316|  18.9k|            [&](auto) {
  317|  18.9k|                auto p =
  318|  18.9k|                    new (heap::allocate(node_t::max_sizeof_inner_r)) node_t;
  319|  18.9k|                node_t::refs(r).inc();
  320|  18.9k|                p->impl.d.data.inner.relaxed = r;
  321|  18.9k|                node_t::ownee(p)             = e;
  322|  18.9k|#if IMMER_TAGGED_NODE
  323|  18.9k|                p->impl.d.kind = node_t::kind_t::inner;
  324|  18.9k|#endif
  325|  18.9k|                return p;
  326|  18.9k|            });
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j:
  640|  18.9k|    {
  641|  18.9k|        if (embed_relaxed)
  ------------------
  |  Branch (641:13): [Folded, False: 18.9k]
  ------------------
  642|      0|            return do_copy_inner_r(dst, src, n);
  643|  18.9k|        else {
  644|  18.9k|            inc_nodes(src->inner(), n);
  645|  18.9k|            std::copy(src->inner(), src->inner() + n, dst->inner());
  646|  18.9k|            return dst;
  647|  18.9k|        }
  648|  18.9k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j:
  738|  2.49k|    {
  739|  2.49k|        IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf);
  ------------------
  |  |   68|  2.49k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (739:9): [True: 2.49k, False: 0]
  ------------------
  740|  2.49k|        IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf);
  ------------------
  |  |   68|  2.49k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (740:9): [True: 2.49k, False: 0]
  ------------------
  741|  2.49k|        auto dst = make_leaf_e(e);
  742|  2.49k|        IMMER_TRY {
  ------------------
  |  |   49|  2.49k|#define IMMER_TRY try
  ------------------
  743|  2.49k|            detail::uninitialized_copy(
  744|  2.49k|                src1->leaf(), src1->leaf() + n1, dst->leaf());
  745|  2.49k|        }
  746|  2.49k|        IMMER_CATCH (...) {
  747|      0|            heap::deallocate(max_sizeof_leaf, dst);
  748|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  749|      0|        }
  750|  2.49k|        IMMER_TRY {
  ------------------
  |  |   49|  2.49k|#define IMMER_TRY try
  ------------------
  751|  2.49k|            detail::uninitialized_copy(
  752|  2.49k|                src2->leaf(), src2->leaf() + n2, dst->leaf() + n1);
  753|  2.49k|        }
  754|  2.49k|        IMMER_CATCH (...) {
  755|      0|            detail::destroy_n(dst->leaf(), n1);
  756|      0|            heap::deallocate(max_sizeof_leaf, dst);
  757|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  758|      0|        }
  759|  2.49k|        return dst;
  760|  2.49k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj:
  763|  1.36M|    {
  764|  1.36M|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  1.36M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (764:9): [True: 1.36M, False: 0]
  ------------------
  765|  1.36M|        auto dst = make_leaf_e(e);
  766|  1.36M|        IMMER_TRY {
  ------------------
  |  |   49|  1.36M|#define IMMER_TRY try
  ------------------
  767|  1.36M|            detail::uninitialized_copy(
  768|  1.36M|                src->leaf() + idx, src->leaf() + last, dst->leaf());
  769|  1.36M|        }
  770|  1.36M|        IMMER_CATCH (...) {
  771|      0|            heap::deallocate(max_sizeof_leaf, dst);
  772|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  773|      0|        }
  774|  1.36M|        return dst;
  775|  1.36M|    }
_ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9can_relaxEv:
  874|  1.50M|    bool can_relax() const { return !embed_relaxed || relaxed(); }
  ------------------
  |  Branch (874:37): [True: 1.50M, Folded]
  |  Branch (874:55): [True: 0, False: 0]
  ------------------
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE24ensure_mutable_relaxed_eENS9_5applyIS6_E4type4editESF_:
  903|   555k|    {
  904|   555k|        auto src_r = relaxed();
  905|   555k|        return static_if<embed_relaxed, relaxed_t*>(
  906|   555k|            [&](auto) { return src_r; },
  907|   555k|            [&](auto) {
  908|   555k|                if (src_r && (node_t::refs(src_r).unique() ||
  909|   555k|                              node_t::ownee(src_r).can_mutate(e))) {
  910|   555k|                    node_t::ownee(src_r) = ec;
  911|   555k|                    return src_r;
  912|   555k|                } else {
  913|   555k|                    auto dst_r = impl.d.data.inner.relaxed =
  914|   555k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  915|   555k|                    if (src_r) {
  916|   555k|                        auto n = dst_r->d.count = src_r->d.count;
  917|   555k|                        std::copy(
  918|   555k|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  919|   555k|                        if (node_t::refs(src_r).dec())
  920|   555k|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  921|   555k|                                             src_r);
  922|   555k|                    }
  923|   555k|                    node_t::ownee(dst_r) = ec;
  924|   555k|                    return dst_r;
  925|   555k|                }
  926|   555k|            });
  927|   555k|    }
_ZZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE24ensure_mutable_relaxed_eENS9_5applyIS6_E4type4editESF_ENKUlT_E0_clINS0_7empty_tEEEDaSG_:
  907|   555k|            [&](auto) {
  908|   555k|                if (src_r && (node_t::refs(src_r).unique() ||
  ------------------
  |  Branch (908:21): [True: 547k, False: 8.37k]
  |  Branch (908:31): [True: 0, False: 547k]
  ------------------
  909|   547k|                              node_t::ownee(src_r).can_mutate(e))) {
  ------------------
  |  Branch (909:31): [True: 546k, False: 836]
  ------------------
  910|   546k|                    node_t::ownee(src_r) = ec;
  911|   546k|                    return src_r;
  912|   546k|                } else {
  913|  9.20k|                    auto dst_r = impl.d.data.inner.relaxed =
  914|  9.20k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  915|  9.20k|                    if (src_r) {
  ------------------
  |  Branch (915:25): [True: 836, False: 8.37k]
  ------------------
  916|    836|                        auto n = dst_r->d.count = src_r->d.count;
  917|    836|                        std::copy(
  918|    836|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  919|    836|                        if (node_t::refs(src_r).dec())
  ------------------
  |  Branch (919:29): [True: 0, False: 836]
  ------------------
  920|      0|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  921|      0|                                             src_r);
  922|    836|                    }
  923|  9.20k|                    node_t::ownee(dst_r) = ec;
  924|  9.20k|                    return dst_r;
  925|  9.20k|                }
  926|   555k|            });

_ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  523|   638k|    {
  524|   638k|        using node_t = node_type<Pos>;
  525|   638k|        auto node    = p.node();
  526|   638k|        if (node->dec()) {
  ------------------
  |  Branch (526:13): [True: 0, False: 638k]
  ------------------
  527|      0|            p.each(this_t{});
  528|      0|            node_t::delete_inner_r(node, p.count());
  529|      0|        }
  530|   638k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  54.8k|    {
  535|  54.8k|        using node_t = node_type<Pos>;
  536|  54.8k|        auto node    = p.node();
  537|  54.8k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 54.8k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  54.8k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|  6.60k|    {
  546|  6.60k|        using node_t = node_type<Pos>;
  547|  6.60k|        auto node    = p.node();
  548|  6.60k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 6.60k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|  6.60k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|  2.51k|    {
  546|  2.51k|        using node_t = node_type<Pos>;
  547|  2.51k|        auto node    = p.node();
  548|  2.51k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 2.51k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|  2.51k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  10.6k|    {
  535|  10.6k|        using node_t = node_type<Pos>;
  536|  10.6k|        auto node    = p.node();
  537|  10.6k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 10.6k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  10.6k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  4.40k|    {
  535|  4.40k|        using node_t = node_type<Pos>;
  536|  4.40k|        auto node    = p.node();
  537|  4.40k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 4.40k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  4.40k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|   420k|    {
  535|   420k|        using node_t = node_type<Pos>;
  536|   420k|        auto node    = p.node();
  537|   420k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 420k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|   420k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|   506k|    {
  546|   506k|        using node_t = node_type<Pos>;
  547|   506k|        auto node    = p.node();
  548|   506k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 506k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|   506k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|   367k|    {
  546|   367k|        using node_t = node_type<Pos>;
  547|   367k|        auto node    = p.node();
  548|   367k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 367k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|   367k|    }
_ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_SI_j:
  791|  51.5k|    {
  792|  51.5k|        auto level    = pos.shift();
  793|  51.5k|        auto idx      = pos.count() - 1;
  794|  51.5k|        auto children = pos.size(idx);
  795|  51.5k|        auto new_idx =
  796|  51.5k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (796:13): [True: 5.72k, False: 45.7k]
  |  Branch (796:47): [True: 474, False: 45.3k]
  ------------------
  797|  51.5k|        auto new_child = static_cast<node_t*>(nullptr);
  798|  51.5k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (798:13): [True: 1.01k, False: 50.4k]
  ------------------
  799|  1.01k|            return nullptr;
  800|  50.4k|        else if (idx == new_idx) {
  ------------------
  |  Branch (800:18): [True: 45.3k, False: 5.19k]
  ------------------
  801|  45.3k|            new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts);
  802|  45.3k|            if (!new_child) {
  ------------------
  |  Branch (802:17): [True: 1.09k, False: 44.2k]
  ------------------
  803|  1.09k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (803:21): [True: 390, False: 701]
  ------------------
  804|    390|                    new_child = node_t::make_path(level - B, tail);
  805|    701|                else
  806|    701|                    return nullptr;
  807|  1.09k|            }
  808|  45.3k|        } else
  809|  5.19k|            new_child = node_t::make_path(level - B, tail);
  810|  49.7k|        IMMER_TRY {
  ------------------
  |  |   49|  49.7k|#define IMMER_TRY try
  ------------------
  811|  49.7k|            auto count = new_idx + 1;
  812|  49.7k|            auto new_parent =
  813|  49.7k|                node_t::copy_inner_r_n(count, pos.node(), new_idx);
  814|  49.7k|            auto new_relaxed              = new_parent->relaxed();
  815|  49.7k|            new_parent->inner()[new_idx]  = new_child;
  816|  49.7k|            new_relaxed->d.sizes[new_idx] = pos.size() + ts;
  817|  49.7k|            new_relaxed->d.count          = count;
  818|  49.7k|            assert(new_relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (818:13): [True: 49.7k, False: 0]
  ------------------
  819|  49.7k|            return new_parent;
  820|  49.7k|        }
  821|  49.7k|        IMMER_CATCH (...) {
  822|      0|            auto shift = pos.shift();
  823|      0|            auto size  = new_idx == idx ? children + ts : ts;
  ------------------
  |  Branch (823:26): [True: 0, False: 0]
  ------------------
  824|      0|            if (shift > BL) {
  ------------------
  |  Branch (824:17): [True: 0, False: 0]
  ------------------
  825|      0|                tail->inc();
  826|      0|                dec_inner(new_child, shift - B, size);
  827|      0|            }
  828|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  829|      0|        }
  830|  49.7k|    }
_ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_SJ_DpOT0_:
  834|  8.59k|    {
  835|  8.59k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 8.59k, False: 0]
  ------------------
  836|  8.59k|        auto idx        = pos.index(pos.size() - 1);
  837|  8.59k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  8.59k|        auto count      = new_idx + 1;
  839|  8.59k|        auto new_parent = node_t::make_inner_n(count);
  840|  8.59k|        IMMER_TRY {
  ------------------
  |  |   49|  8.59k|#define IMMER_TRY try
  ------------------
  841|  8.59k|            new_parent->inner()[new_idx] =
  842|  8.59k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 7.02k, False: 1.57k]
  ------------------
  843|       |                               /* otherwise */
  844|  8.59k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  8.59k|        }
  846|  8.59k|        IMMER_CATCH (...) {
  847|      0|            node_t::delete_inner(new_parent, count);
  848|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  849|      0|        }
  850|  8.59k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  8.59k|    }
_ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_SI_DpOT0_:
  834|  34.0k|    {
  835|  34.0k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 34.0k, False: 0]
  ------------------
  836|  34.0k|        auto idx        = pos.index(pos.size() - 1);
  837|  34.0k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  34.0k|        auto count      = new_idx + 1;
  839|  34.0k|        auto new_parent = node_t::make_inner_n(count);
  840|  34.0k|        IMMER_TRY {
  ------------------
  |  |   49|  34.0k|#define IMMER_TRY try
  ------------------
  841|  34.0k|            new_parent->inner()[new_idx] =
  842|  34.0k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 24.8k, False: 9.14k]
  ------------------
  843|       |                               /* otherwise */
  844|  34.0k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  34.0k|        }
  846|  34.0k|        IMMER_CATCH (...) {
  847|      0|            node_t::delete_inner(new_parent, count);
  848|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  849|      0|        }
  850|  34.0k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  34.0k|    }
_ZN5immer6detail4rbts17push_tail_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_SI_DpOT0_:
  834|  4.17k|    {
  835|  4.17k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 4.17k, False: 0]
  ------------------
  836|  4.17k|        auto idx        = pos.index(pos.size() - 1);
  837|  4.17k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  4.17k|        auto count      = new_idx + 1;
  839|  4.17k|        auto new_parent = node_t::make_inner_n(count);
  840|  4.17k|        IMMER_TRY {
  ------------------
  |  |   49|  4.17k|#define IMMER_TRY try
  ------------------
  841|  4.17k|            new_parent->inner()[new_idx] =
  842|  4.17k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 2.11k, False: 2.05k]
  ------------------
  843|       |                               /* otherwise */
  844|  4.17k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  4.17k|        }
  846|  4.17k|        IMMER_CATCH (...) {
  847|      0|            node_t::delete_inner(new_parent, count);
  848|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  849|      0|        }
  850|  4.17k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  4.17k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_:
  502|  4.01k|    {
  503|  4.01k|        auto offset = pos.index(idx);
  504|  4.01k|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|  4.01k|        IMMER_TRY {
  ------------------
  |  |   49|  4.01k|#define IMMER_TRY try
  ------------------
  506|  4.01k|            node->leaf()[offset] =
  507|  4.01k|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|  4.01k|            return node;
  509|  4.01k|        }
  510|  4.01k|        IMMER_CATCH (...) {
  511|      0|            node_t::delete_leaf(node, pos.count());
  512|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  513|      0|        }
  514|  4.01k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_:
  466|  30.1k|    {
  467|  30.1k|        auto offset = pos.index(idx);
  468|  30.1k|        auto count  = pos.count();
  469|  30.1k|        auto node   = node_t::make_inner_sr_n(count, pos.relaxed());
  470|  30.1k|        IMMER_TRY {
  ------------------
  |  |   49|  30.1k|#define IMMER_TRY try
  ------------------
  471|  30.1k|            auto child = pos.towards_oh(this_t{}, idx, offset, fn);
  472|  30.1k|            node_t::do_copy_inner_replace_sr(
  473|  30.1k|                node, pos.node(), count, offset, child);
  474|  30.1k|            return node;
  475|  30.1k|        }
  476|  30.1k|        IMMER_CATCH (...) {
  477|      0|            node_t::delete_inner_r(node, count);
  478|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  479|      0|        }
  480|  30.1k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_:
  484|  1.98k|    {
  485|  1.98k|        auto offset = pos.index(idx);
  486|  1.98k|        auto count  = pos.count();
  487|  1.98k|        auto node   = node_t::make_inner_n(count);
  488|  1.98k|        IMMER_TRY {
  ------------------
  |  |   49|  1.98k|#define IMMER_TRY try
  ------------------
  489|  1.98k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.98k|            node_t::do_copy_inner_replace(
  491|  1.98k|                node, pos.node(), count, offset, child);
  492|  1.98k|            return node;
  493|  1.98k|        }
  494|  1.98k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.98k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_:
  502|  1.40k|    {
  503|  1.40k|        auto offset = pos.index(idx);
  504|  1.40k|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|  1.40k|        IMMER_TRY {
  ------------------
  |  |   49|  1.40k|#define IMMER_TRY try
  ------------------
  506|  1.40k|            node->leaf()[offset] =
  507|  1.40k|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|  1.40k|            return node;
  509|  1.40k|        }
  510|  1.40k|        IMMER_CATCH (...) {
  511|      0|            node_t::delete_leaf(node, pos.count());
  512|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  513|      0|        }
  514|  1.40k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_:
  484|  1.28k|    {
  485|  1.28k|        auto offset = pos.index(idx);
  486|  1.28k|        auto count  = pos.count();
  487|  1.28k|        auto node   = node_t::make_inner_n(count);
  488|  1.28k|        IMMER_TRY {
  ------------------
  |  |   49|  1.28k|#define IMMER_TRY try
  ------------------
  489|  1.28k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.28k|            node_t::do_copy_inner_replace(
  491|  1.28k|                node, pos.node(), count, offset, child);
  492|  1.28k|            return node;
  493|  1.28k|        }
  494|  1.28k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.28k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_8leaf_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_:
  502|    583|    {
  503|    583|        auto offset = pos.index(idx);
  504|    583|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|    583|        IMMER_TRY {
  ------------------
  |  |   49|    583|#define IMMER_TRY try
  ------------------
  506|    583|            node->leaf()[offset] =
  507|    583|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|    583|            return node;
  509|    583|        }
  510|    583|        IMMER_CATCH (...) {
  511|      0|            node_t::delete_leaf(node, pos.count());
  512|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  513|      0|        }
  514|    583|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts14update_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EERZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEPSC_OSL_mOT0_:
  484|  1.17k|    {
  485|  1.17k|        auto offset = pos.index(idx);
  486|  1.17k|        auto count  = pos.count();
  487|  1.17k|        auto node   = node_t::make_inner_n(count);
  488|  1.17k|        IMMER_TRY {
  ------------------
  |  |   49|  1.17k|#define IMMER_TRY try
  ------------------
  489|  1.17k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.17k|            node_t::do_copy_inner_replace(
  491|  1.17k|                node, pos.node(), count, offset, child);
  492|  1.17k|            return node;
  493|  1.17k|        }
  494|  1.17k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.17k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1096|  15.2k|    {
 1097|  15.2k|        auto idx = pos.index(last);
 1098|  15.2k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1098:13): [True: 15.2k, Folded]
  |  Branch (1098:25): [True: 10.4k, False: 4.83k]
  ------------------
 1099|  10.4k|            return pos.towards_oh(this_t{}, last, idx);
 1100|  10.4k|        } else {
 1101|  4.83k|            using std::get;
 1102|  4.83k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1103|  4.83k|            auto next = get<1>(subs);
 1104|  4.83k|            auto ts   = get<2>(subs);
 1105|  4.83k|            auto tail = get<3>(subs);
 1106|  4.83k|            IMMER_TRY {
  ------------------
  |  |   49|  4.83k|#define IMMER_TRY try
  ------------------
 1107|  4.83k|                if (next) {
  ------------------
  |  Branch (1107:21): [True: 1.90k, False: 2.93k]
  ------------------
 1108|  1.90k|                    auto count = idx + 1;
 1109|  1.90k|                    auto newn  = node_t::copy_inner_r_n(count, pos.node(), idx);
 1110|  1.90k|                    auto newr  = newn->relaxed();
 1111|  1.90k|                    newn->inner()[idx] = next;
 1112|  1.90k|                    newr->d.sizes[idx] = last + 1 - ts;
 1113|  1.90k|                    newr->d.count      = count;
 1114|  1.90k|                    assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (1114:21): [True: 1.90k, False: 0]
  ------------------
 1115|  1.90k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1116|  2.93k|                } else if (idx == 0) {
  ------------------
  |  Branch (1116:28): [True: 0, False: 2.93k]
  ------------------
 1117|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1118|  2.93k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1118:28): [True: 2.93k, Folded]
  |  Branch (1118:40): [True: 2.58k, False: 346]
  |  Branch (1118:52): [True: 931, False: 1.65k]
  ------------------
 1119|    931|                    auto newn = pos.node()->inner()[0];
 1120|    931|                    return std::make_tuple(
 1121|    931|                        pos.shift() - B, newn->inc(), ts, tail);
 1122|  2.00k|                } else {
 1123|  2.00k|                    auto newn = node_t::copy_inner_r(pos.node(), idx);
 1124|  2.00k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1125|  2.00k|                }
 1126|  4.83k|            }
 1127|  4.83k|            IMMER_CATCH (...) {
 1128|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1128:17): [True: 0, False: 0]
  |  Branch (1128:17): [True: 0, False: 0]
  |  Branch (1128:17): [True: 0, False: 0]
  ------------------
 1129|      0|                if (next)
  ------------------
  |  Branch (1129:21): [True: 0, False: 0]
  ------------------
 1130|      0|                    dec_inner(next,
 1131|      0|                              pos.shift() - B,
 1132|      0|                              last + 1 - ts - pos.size_before(idx));
 1133|      0|                if (tail)
  ------------------
  |  Branch (1133:21): [True: 0, False: 0]
  ------------------
 1134|      0|                    dec_leaf(tail, ts);
 1135|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1136|      0|            }
 1137|  4.83k|        }
 1138|  15.2k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1181|    725|    {
 1182|    725|        auto old_tail_size = pos.count();
 1183|    725|        auto new_tail_size = pos.index(last) + 1;
 1184|    725|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 230, False: 495]
  ------------------
 1185|    725|                                 ? pos.node()->inc()
 1186|    725|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|    725|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|    725|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1181|  3.47k|    {
 1182|  3.47k|        auto old_tail_size = pos.count();
 1183|  3.47k|        auto new_tail_size = pos.index(last) + 1;
 1184|  3.47k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 853, False: 2.62k]
  ------------------
 1185|  3.47k|                                 ? pos.node()->inc()
 1186|  3.47k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  3.47k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  3.47k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1096|  4.64k|    {
 1097|  4.64k|        auto idx = pos.index(last);
 1098|  4.64k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1098:13): [Folded, False: 4.64k]
  |  Branch (1098:25): [True: 0, False: 0]
  ------------------
 1099|      0|            return pos.towards_oh(this_t{}, last, idx);
 1100|  4.64k|        } else {
 1101|  4.64k|            using std::get;
 1102|  4.64k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1103|  4.64k|            auto next = get<1>(subs);
 1104|  4.64k|            auto ts   = get<2>(subs);
 1105|  4.64k|            auto tail = get<3>(subs);
 1106|  4.64k|            IMMER_TRY {
  ------------------
  |  |   49|  4.64k|#define IMMER_TRY try
  ------------------
 1107|  4.64k|                if (next) {
  ------------------
  |  Branch (1107:21): [True: 2.44k, False: 2.19k]
  ------------------
 1108|  2.44k|                    auto count = idx + 1;
 1109|  2.44k|                    auto newn  = node_t::copy_inner_r_n(count, pos.node(), idx);
 1110|  2.44k|                    auto newr  = newn->relaxed();
 1111|  2.44k|                    newn->inner()[idx] = next;
 1112|  2.44k|                    newr->d.sizes[idx] = last + 1 - ts;
 1113|  2.44k|                    newr->d.count      = count;
 1114|  2.44k|                    assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (1114:21): [True: 2.44k, False: 0]
  ------------------
 1115|  2.44k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1116|  2.44k|                } else if (idx == 0) {
  ------------------
  |  Branch (1116:28): [True: 1.17k, False: 1.02k]
  ------------------
 1117|  1.17k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1118|  1.17k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1118:28): [Folded, False: 1.02k]
  |  Branch (1118:40): [True: 0, False: 0]
  |  Branch (1118:52): [True: 0, False: 0]
  ------------------
 1119|      0|                    auto newn = pos.node()->inner()[0];
 1120|      0|                    return std::make_tuple(
 1121|      0|                        pos.shift() - B, newn->inc(), ts, tail);
 1122|  1.02k|                } else {
 1123|  1.02k|                    auto newn = node_t::copy_inner_r(pos.node(), idx);
 1124|  1.02k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1125|  1.02k|                }
 1126|  4.64k|            }
 1127|  4.64k|            IMMER_CATCH (...) {
 1128|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1128:17): [True: 0, False: 0]
  |  Branch (1128:17): [True: 0, False: 0]
  |  Branch (1128:17): [True: 0, False: 0]
  ------------------
 1129|      0|                if (next)
  ------------------
  |  Branch (1129:21): [True: 0, False: 0]
  ------------------
 1130|      0|                    dec_inner(next,
 1131|      0|                              pos.shift() - B,
 1132|      0|                              last + 1 - ts - pos.size_before(idx));
 1133|      0|                if (tail)
  ------------------
  |  Branch (1133:21): [True: 0, False: 0]
  ------------------
 1134|      0|                    dec_leaf(tail, ts);
 1135|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1136|      0|            }
 1137|  4.64k|        }
 1138|  4.64k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1142|  1.36k|    {
 1143|  1.36k|        auto idx = pos.index(last);
 1144|  1.36k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 1.36k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.36k|        } else {
 1147|  1.36k|            using std::get;
 1148|  1.36k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.36k|            auto next = get<1>(subs);
 1150|  1.36k|            auto ts   = get<2>(subs);
 1151|  1.36k|            auto tail = get<3>(subs);
 1152|  1.36k|            IMMER_TRY {
  ------------------
  |  |   49|  1.36k|#define IMMER_TRY try
  ------------------
 1153|  1.36k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 460, False: 903]
  ------------------
 1154|    460|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    460|                    newn->inner()[idx] = next;
 1156|    460|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|    903|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 483, False: 420]
  ------------------
 1158|    483|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    483|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 420]
  |  Branch (1159:40): [True: 0, False: 0]
  |  Branch (1159:52): [True: 0, False: 0]
  ------------------
 1160|      0|                    auto newn = pos.node()->inner()[0];
 1161|      0|                    return std::make_tuple(
 1162|      0|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    420|                } else {
 1164|    420|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    420|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    420|                }
 1167|  1.36k|            }
 1168|  1.36k|            IMMER_CATCH (...) {
 1169|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  ------------------
 1170|      0|                assert(tail);
  ------------------
  |  Branch (1170:17): [True: 0, False: 0]
  ------------------
 1171|      0|                if (next)
  ------------------
  |  Branch (1171:21): [True: 0, False: 0]
  ------------------
 1172|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1173|      0|                dec_leaf(tail, ts);
 1174|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1175|      0|            }
 1176|  1.36k|        }
 1177|  1.36k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1181|  2.90k|    {
 1182|  2.90k|        auto old_tail_size = pos.count();
 1183|  2.90k|        auto new_tail_size = pos.index(last) + 1;
 1184|  2.90k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 1.21k, False: 1.69k]
  ------------------
 1185|  2.90k|                                 ? pos.node()->inc()
 1186|  2.90k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  2.90k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  2.90k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1142|  1.99k|    {
 1143|  1.99k|        auto idx = pos.index(last);
 1144|  1.99k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 1.99k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.99k|        } else {
 1147|  1.99k|            using std::get;
 1148|  1.99k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.99k|            auto next = get<1>(subs);
 1150|  1.99k|            auto ts   = get<2>(subs);
 1151|  1.99k|            auto tail = get<3>(subs);
 1152|  1.99k|            IMMER_TRY {
  ------------------
  |  |   49|  1.99k|#define IMMER_TRY try
  ------------------
 1153|  1.99k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 362, False: 1.63k]
  ------------------
 1154|    362|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    362|                    newn->inner()[idx] = next;
 1156|    362|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  1.63k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 801, False: 833]
  ------------------
 1158|    801|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    833|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 833]
  |  Branch (1159:40): [True: 0, False: 0]
  |  Branch (1159:52): [True: 0, False: 0]
  ------------------
 1160|      0|                    auto newn = pos.node()->inner()[0];
 1161|      0|                    return std::make_tuple(
 1162|      0|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    833|                } else {
 1164|    833|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    833|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    833|                }
 1167|  1.99k|            }
 1168|  1.99k|            IMMER_CATCH (...) {
 1169|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  ------------------
 1170|      0|                assert(tail);
  ------------------
  |  Branch (1170:17): [True: 0, False: 0]
  ------------------
 1171|      0|                if (next)
  ------------------
  |  Branch (1171:21): [True: 0, False: 0]
  ------------------
 1172|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1173|      0|                dec_leaf(tail, ts);
 1174|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1175|      0|            }
 1176|  1.99k|        }
 1177|  1.99k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1181|  1.86k|    {
 1182|  1.86k|        auto old_tail_size = pos.count();
 1183|  1.86k|        auto new_tail_size = pos.index(last) + 1;
 1184|  1.86k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 652, False: 1.21k]
  ------------------
 1185|  1.86k|                                 ? pos.node()->inc()
 1186|  1.86k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  1.86k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  1.86k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1142|  2.54k|    {
 1143|  2.54k|        auto idx = pos.index(last);
 1144|  2.54k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 2.54k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  2.54k|        } else {
 1147|  2.54k|            using std::get;
 1148|  2.54k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  2.54k|            auto next = get<1>(subs);
 1150|  2.54k|            auto ts   = get<2>(subs);
 1151|  2.54k|            auto tail = get<3>(subs);
 1152|  2.54k|            IMMER_TRY {
  ------------------
  |  |   49|  2.54k|#define IMMER_TRY try
  ------------------
 1153|  2.54k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 420, False: 2.12k]
  ------------------
 1154|    420|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    420|                    newn->inner()[idx] = next;
 1156|    420|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  2.12k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 1.50k, False: 612]
  ------------------
 1158|  1.50k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|  1.50k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 612]
  |  Branch (1159:40): [True: 0, False: 0]
  |  Branch (1159:52): [True: 0, False: 0]
  ------------------
 1160|      0|                    auto newn = pos.node()->inner()[0];
 1161|      0|                    return std::make_tuple(
 1162|      0|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    612|                } else {
 1164|    612|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    612|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    612|                }
 1167|  2.54k|            }
 1168|  2.54k|            IMMER_CATCH (...) {
 1169|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  ------------------
 1170|      0|                assert(tail);
  ------------------
  |  Branch (1170:17): [True: 0, False: 0]
  ------------------
 1171|      0|                if (next)
  ------------------
  |  Branch (1171:21): [True: 0, False: 0]
  ------------------
 1172|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1173|      0|                dec_leaf(tail, ts);
 1174|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1175|      0|            }
 1176|  2.54k|        }
 1177|  2.54k|    }
_ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEvPT_j:
  556|  58.5k|{
  557|  58.5k|    make_leaf_sub_pos(node, n).visit(dec_visitor{});
  558|  58.5k|}
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1142|  4.91k|    {
 1143|  4.91k|        auto idx = pos.index(last);
 1144|  4.91k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [True: 4.91k, Folded]
  |  Branch (1144:25): [True: 2.58k, False: 2.32k]
  ------------------
 1145|  2.58k|            return pos.towards_oh(this_t{}, last, idx);
 1146|  2.58k|        } else {
 1147|  2.32k|            using std::get;
 1148|  2.32k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  2.32k|            auto next = get<1>(subs);
 1150|  2.32k|            auto ts   = get<2>(subs);
 1151|  2.32k|            auto tail = get<3>(subs);
 1152|  2.32k|            IMMER_TRY {
  ------------------
  |  |   49|  2.32k|#define IMMER_TRY try
  ------------------
 1153|  2.32k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 763, False: 1.56k]
  ------------------
 1154|    763|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    763|                    newn->inner()[idx] = next;
 1156|    763|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  1.56k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 0, False: 1.56k]
  ------------------
 1158|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|  1.56k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [True: 1.56k, Folded]
  |  Branch (1159:40): [True: 1.23k, False: 325]
  |  Branch (1159:52): [True: 868, False: 370]
  ------------------
 1160|    868|                    auto newn = pos.node()->inner()[0];
 1161|    868|                    return std::make_tuple(
 1162|    868|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    868|                } else {
 1164|    695|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    695|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    695|                }
 1167|  2.32k|            }
 1168|  2.32k|            IMMER_CATCH (...) {
 1169|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  ------------------
 1170|      0|                assert(tail);
  ------------------
  |  Branch (1170:17): [True: 0, False: 0]
  ------------------
 1171|      0|                if (next)
  ------------------
  |  Branch (1171:21): [True: 0, False: 0]
  ------------------
 1172|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1173|      0|                dec_leaf(tail, ts);
 1174|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1175|      0|            }
 1176|  2.32k|        }
 1177|  4.91k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1181|  1.10k|    {
 1182|  1.10k|        auto old_tail_size = pos.count();
 1183|  1.10k|        auto new_tail_size = pos.index(last) + 1;
 1184|  1.10k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 473, False: 628]
  ------------------
 1185|  1.10k|                                 ? pos.node()->inc()
 1186|  1.10k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  1.10k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  1.10k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1142|  1.95k|    {
 1143|  1.95k|        auto idx = pos.index(last);
 1144|  1.95k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [True: 1.95k, Folded]
  |  Branch (1144:25): [True: 874, False: 1.08k]
  ------------------
 1145|    874|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.08k|        } else {
 1147|  1.08k|            using std::get;
 1148|  1.08k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.08k|            auto next = get<1>(subs);
 1150|  1.08k|            auto ts   = get<2>(subs);
 1151|  1.08k|            auto tail = get<3>(subs);
 1152|  1.08k|            IMMER_TRY {
  ------------------
  |  |   49|  1.08k|#define IMMER_TRY try
  ------------------
 1153|  1.08k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 222, False: 858]
  ------------------
 1154|    222|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    222|                    newn->inner()[idx] = next;
 1156|    222|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|    858|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 0, False: 858]
  ------------------
 1158|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    858|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [True: 858, Folded]
  |  Branch (1159:40): [True: 661, False: 197]
  |  Branch (1159:52): [True: 336, False: 325]
  ------------------
 1160|    336|                    auto newn = pos.node()->inner()[0];
 1161|    336|                    return std::make_tuple(
 1162|    336|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    522|                } else {
 1164|    522|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    522|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    522|                }
 1167|  1.08k|            }
 1168|  1.08k|            IMMER_CATCH (...) {
 1169|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  ------------------
 1170|      0|                assert(tail);
  ------------------
  |  Branch (1170:17): [True: 0, False: 0]
  ------------------
 1171|      0|                if (next)
  ------------------
  |  Branch (1171:21): [True: 0, False: 0]
  ------------------
 1172|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1173|      0|                dec_leaf(tail, ts);
 1174|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1175|      0|            }
 1176|  1.08k|        }
 1177|  1.95k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1181|    404|    {
 1182|    404|        auto old_tail_size = pos.count();
 1183|    404|        auto new_tail_size = pos.index(last) + 1;
 1184|    404|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 195, False: 209]
  ------------------
 1185|    404|                                 ? pos.node()->inc()
 1186|    404|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|    404|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|    404|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1414|  16.0k|    {
 1415|  16.0k|        auto idx                = pos.subindex(first);
 1416|  16.0k|        auto count              = pos.count();
 1417|  16.0k|        auto left_size          = pos.size_before(idx);
 1418|  16.0k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  16.0k|        auto dropped_size       = first;
 1420|  16.0k|        auto child_dropped_size = dropped_size - left_size;
 1421|  16.0k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 16.0k, Folded]
  |  Branch (1421:25): [True: 14.9k, False: 1.06k]
  |  Branch (1421:45): [True: 1.36k, False: 13.5k]
  ------------------
 1422|  1.36k|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  14.6k|        } else {
 1424|  14.6k|            using std::get;
 1425|  14.6k|            auto n    = pos.node();
 1426|  14.6k|            auto newc = count - idx;
 1427|  14.6k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  14.6k|            IMMER_TRY {
  ------------------
  |  |   49|  14.6k|#define IMMER_TRY try
  ------------------
 1429|  14.6k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  14.6k|                auto newr     = newn->relaxed();
 1431|  14.6k|                newr->d.count = count - idx;
 1432|  14.6k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  14.6k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 14.6k, False: 0]
  ------------------
 1434|  14.6k|                pos.copy_sizes(idx + 1,
 1435|  14.6k|                               newr->d.count - 1,
 1436|  14.6k|                               newr->d.sizes[0],
 1437|  14.6k|                               newr->d.sizes + 1);
 1438|  14.6k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 14.6k, False: 0]
  ------------------
 1439|  14.6k|                       pos.size() - dropped_size);
 1440|  14.6k|                newn->inner()[0] = get<1>(subs);
 1441|  14.6k|                std::copy(n->inner() + idx + 1,
 1442|  14.6k|                          n->inner() + count,
 1443|  14.6k|                          newn->inner() + 1);
 1444|  14.6k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  14.6k|                return std::make_tuple(pos.shift(), newn);
 1446|  14.6k|            }
 1447|  14.6k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  14.6k|        }
 1452|  16.0k|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1456|  13.1k|    {
 1457|  13.1k|        auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count());
 1458|  13.1k|        return std::make_tuple(0, n);
 1459|  13.1k|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE11visit_innerIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1414|  99.2k|    {
 1415|  99.2k|        auto idx                = pos.subindex(first);
 1416|  99.2k|        auto count              = pos.count();
 1417|  99.2k|        auto left_size          = pos.size_before(idx);
 1418|  99.2k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  99.2k|        auto dropped_size       = first;
 1420|  99.2k|        auto child_dropped_size = dropped_size - left_size;
 1421|  99.2k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 99.2k]
  |  Branch (1421:25): [True: 0, False: 0]
  |  Branch (1421:45): [True: 0, False: 0]
  ------------------
 1422|      0|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  99.2k|        } else {
 1424|  99.2k|            using std::get;
 1425|  99.2k|            auto n    = pos.node();
 1426|  99.2k|            auto newc = count - idx;
 1427|  99.2k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  99.2k|            IMMER_TRY {
  ------------------
  |  |   49|  99.2k|#define IMMER_TRY try
  ------------------
 1429|  99.2k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  99.2k|                auto newr     = newn->relaxed();
 1431|  99.2k|                newr->d.count = count - idx;
 1432|  99.2k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  99.2k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 99.2k, False: 0]
  ------------------
 1434|  99.2k|                pos.copy_sizes(idx + 1,
 1435|  99.2k|                               newr->d.count - 1,
 1436|  99.2k|                               newr->d.sizes[0],
 1437|  99.2k|                               newr->d.sizes + 1);
 1438|  99.2k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 99.2k, False: 0]
  ------------------
 1439|  99.2k|                       pos.size() - dropped_size);
 1440|  99.2k|                newn->inner()[0] = get<1>(subs);
 1441|  99.2k|                std::copy(n->inner() + idx + 1,
 1442|  99.2k|                          n->inner() + count,
 1443|  99.2k|                          newn->inner() + 1);
 1444|  99.2k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  99.2k|                return std::make_tuple(pos.shift(), newn);
 1446|  99.2k|            }
 1447|  99.2k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  99.2k|        }
 1452|  99.2k|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1414|  1.49k|    {
 1415|  1.49k|        auto idx                = pos.subindex(first);
 1416|  1.49k|        auto count              = pos.count();
 1417|  1.49k|        auto left_size          = pos.size_before(idx);
 1418|  1.49k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  1.49k|        auto dropped_size       = first;
 1420|  1.49k|        auto child_dropped_size = dropped_size - left_size;
 1421|  1.49k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 1.49k]
  |  Branch (1421:25): [True: 0, False: 0]
  |  Branch (1421:45): [True: 0, False: 0]
  ------------------
 1422|      0|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  1.49k|        } else {
 1424|  1.49k|            using std::get;
 1425|  1.49k|            auto n    = pos.node();
 1426|  1.49k|            auto newc = count - idx;
 1427|  1.49k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  1.49k|            IMMER_TRY {
  ------------------
  |  |   49|  1.49k|#define IMMER_TRY try
  ------------------
 1429|  1.49k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  1.49k|                auto newr     = newn->relaxed();
 1431|  1.49k|                newr->d.count = count - idx;
 1432|  1.49k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  1.49k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 1.49k, False: 0]
  ------------------
 1434|  1.49k|                pos.copy_sizes(idx + 1,
 1435|  1.49k|                               newr->d.count - 1,
 1436|  1.49k|                               newr->d.sizes[0],
 1437|  1.49k|                               newr->d.sizes + 1);
 1438|  1.49k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 1.49k, False: 0]
  ------------------
 1439|  1.49k|                       pos.size() - dropped_size);
 1440|  1.49k|                newn->inner()[0] = get<1>(subs);
 1441|  1.49k|                std::copy(n->inner() + idx + 1,
 1442|  1.49k|                          n->inner() + count,
 1443|  1.49k|                          newn->inner() + 1);
 1444|  1.49k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  1.49k|                return std::make_tuple(pos.shift(), newn);
 1446|  1.49k|            }
 1447|  1.49k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  1.49k|        }
 1452|  1.49k|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1456|  4.05k|    {
 1457|  4.05k|        auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count());
 1458|  4.05k|        return std::make_tuple(0, n);
 1459|  4.05k|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1414|  2.59k|    {
 1415|  2.59k|        auto idx                = pos.subindex(first);
 1416|  2.59k|        auto count              = pos.count();
 1417|  2.59k|        auto left_size          = pos.size_before(idx);
 1418|  2.59k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  2.59k|        auto dropped_size       = first;
 1420|  2.59k|        auto child_dropped_size = dropped_size - left_size;
 1421|  2.59k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 2.59k]
  |  Branch (1421:25): [True: 0, False: 0]
  |  Branch (1421:45): [True: 0, False: 0]
  ------------------
 1422|      0|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  2.59k|        } else {
 1424|  2.59k|            using std::get;
 1425|  2.59k|            auto n    = pos.node();
 1426|  2.59k|            auto newc = count - idx;
 1427|  2.59k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  2.59k|            IMMER_TRY {
  ------------------
  |  |   49|  2.59k|#define IMMER_TRY try
  ------------------
 1429|  2.59k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  2.59k|                auto newr     = newn->relaxed();
 1431|  2.59k|                newr->d.count = count - idx;
 1432|  2.59k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  2.59k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 2.59k, False: 0]
  ------------------
 1434|  2.59k|                pos.copy_sizes(idx + 1,
 1435|  2.59k|                               newr->d.count - 1,
 1436|  2.59k|                               newr->d.sizes[0],
 1437|  2.59k|                               newr->d.sizes + 1);
 1438|  2.59k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 2.59k, False: 0]
  ------------------
 1439|  2.59k|                       pos.size() - dropped_size);
 1440|  2.59k|                newn->inner()[0] = get<1>(subs);
 1441|  2.59k|                std::copy(n->inner() + idx + 1,
 1442|  2.59k|                          n->inner() + count,
 1443|  2.59k|                          newn->inner() + 1);
 1444|  2.59k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  2.59k|                return std::make_tuple(pos.shift(), newn);
 1446|  2.59k|            }
 1447|  2.59k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  2.59k|        }
 1452|  2.59k|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE11visit_innerIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1414|  2.92k|    {
 1415|  2.92k|        auto idx                = pos.subindex(first);
 1416|  2.92k|        auto count              = pos.count();
 1417|  2.92k|        auto left_size          = pos.size_before(idx);
 1418|  2.92k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  2.92k|        auto dropped_size       = first;
 1420|  2.92k|        auto child_dropped_size = dropped_size - left_size;
 1421|  2.92k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 2.92k, Folded]
  |  Branch (1421:25): [True: 2.01k, False: 912]
  |  Branch (1421:45): [True: 1.35k, False: 658]
  ------------------
 1422|  1.35k|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  1.57k|        } else {
 1424|  1.57k|            using std::get;
 1425|  1.57k|            auto n    = pos.node();
 1426|  1.57k|            auto newc = count - idx;
 1427|  1.57k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  1.57k|            IMMER_TRY {
  ------------------
  |  |   49|  1.57k|#define IMMER_TRY try
  ------------------
 1429|  1.57k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  1.57k|                auto newr     = newn->relaxed();
 1431|  1.57k|                newr->d.count = count - idx;
 1432|  1.57k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  1.57k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 1.57k, False: 0]
  ------------------
 1434|  1.57k|                pos.copy_sizes(idx + 1,
 1435|  1.57k|                               newr->d.count - 1,
 1436|  1.57k|                               newr->d.sizes[0],
 1437|  1.57k|                               newr->d.sizes + 1);
 1438|  1.57k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 1.57k, False: 0]
  ------------------
 1439|  1.57k|                       pos.size() - dropped_size);
 1440|  1.57k|                newn->inner()[0] = get<1>(subs);
 1441|  1.57k|                std::copy(n->inner() + idx + 1,
 1442|  1.57k|                          n->inner() + count,
 1443|  1.57k|                          newn->inner() + 1);
 1444|  1.57k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  1.57k|                return std::make_tuple(pos.shift(), newn);
 1446|  1.57k|            }
 1447|  1.57k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  1.57k|        }
 1452|  2.92k|    }
_ZN5immer6detail4rbts18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE11visit_innerIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_EEEOT_m:
 1414|  1.26k|    {
 1415|  1.26k|        auto idx                = pos.subindex(first);
 1416|  1.26k|        auto count              = pos.count();
 1417|  1.26k|        auto left_size          = pos.size_before(idx);
 1418|  1.26k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  1.26k|        auto dropped_size       = first;
 1420|  1.26k|        auto child_dropped_size = dropped_size - left_size;
 1421|  1.26k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 1.26k, Folded]
  |  Branch (1421:25): [True: 495, False: 774]
  |  Branch (1421:45): [True: 279, False: 216]
  ------------------
 1422|    279|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|    990|        } else {
 1424|    990|            using std::get;
 1425|    990|            auto n    = pos.node();
 1426|    990|            auto newc = count - idx;
 1427|    990|            auto newn = node_t::make_inner_r_n(newc);
 1428|    990|            IMMER_TRY {
  ------------------
  |  |   49|    990|#define IMMER_TRY try
  ------------------
 1429|    990|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|    990|                auto newr     = newn->relaxed();
 1431|    990|                newr->d.count = count - idx;
 1432|    990|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|    990|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 990, False: 0]
  ------------------
 1434|    990|                pos.copy_sizes(idx + 1,
 1435|    990|                               newr->d.count - 1,
 1436|    990|                               newr->d.sizes[0],
 1437|    990|                               newr->d.sizes + 1);
 1438|    990|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 990, False: 0]
  ------------------
 1439|    990|                       pos.size() - dropped_size);
 1440|    990|                newn->inner()[0] = get<1>(subs);
 1441|    990|                std::copy(n->inner() + idx + 1,
 1442|    990|                          n->inner() + count,
 1443|    990|                          newn->inner() + 1);
 1444|    990|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|    990|                return std::make_tuple(pos.shift(), newn);
 1446|    990|            }
 1447|    990|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|    990|        }
 1452|  1.26k|    }
_ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm:
 2001|  3.22k|{
 2002|  3.22k|    return make_singleton_regular_sub_pos(ltail, ltcount)
 2003|  3.22k|        .visit(concat_trees_left_visitor<Node>{},
 2004|  3.22k|               empty_leaf_pos<Node>{},
 2005|  3.22k|               rroot,
 2006|  3.22k|               rshift,
 2007|  3.22k|               rsize)
 2008|  3.22k|        .realize();
 2009|  3.22k|}
_ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_25singleton_regular_sub_posISC_EENS1_14empty_leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_:
 1971|  3.22k|    {
 1972|  3.22k|        return visit_maybe_relaxed_sub(
 1973|  3.22k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  3.22k|    }
_ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1958|  1.90k|    {
 1959|  1.90k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  1.90k|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  7.54k|{
 1873|  7.54k|    auto lshift = lpos.shift();
 1874|  7.54k|    auto rshift = rpos.shift();
 1875|  7.54k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 7.54k]
  ------------------
 1876|      0|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|      0|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  7.54k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 5.88k, False: 1.66k]
  ------------------
 1879|  5.88k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  5.88k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  5.88k|    } else {
 1882|  1.66k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.66k, False: 0]
  ------------------
 1883|  1.66k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.66k]
  |  Branch (1883:9): [True: 1.66k, False: 0]
  |  Branch (1883:9): [True: 1.66k, False: 0]
  ------------------
 1884|  1.66k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.66k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.66k|    }
 1887|  7.54k|}
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
 1512|  1.19M|    {
 1513|  1.19M|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 173k, False: 1.02M]
  ------------------
 1514|   173k|            auto s = size_t{};
 1515|   681k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 508k, False: 173k]
  ------------------
 1516|   508k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   508k|                s = sizes_[i];
 1518|   508k|            }
 1519|  1.02M|        } else {
 1520|  2.59M|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 1.57M, False: 1.02M]
  ------------------
 1521|  1.57M|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|  1.57M|                    .visit(v, args...);
 1523|  1.02M|        }
 1524|  1.19M|    }
_ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_:
 1733|   961k|    {
 1734|   961k|        auto count = p.count();
 1735|   961k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 961k, False: 0]
  ------------------
 1736|   961k|        plan.counts[plan.n++] = count;
 1737|   961k|        plan.total += count;
 1738|   961k|    }
_ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_:
 1733|  4.15M|    {
 1734|  4.15M|        auto count = p.count();
 1735|  4.15M|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 4.15M, False: 0]
  ------------------
 1736|  4.15M|        plan.counts[plan.n++] = count;
 1737|  4.15M|        plan.total += count;
 1738|  4.15M|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj:
 1762|  1.19M|    {
 1763|       |        // gcc seems to not really understand this code... :(
 1764|  1.19M|#if !defined(_MSC_VER)
 1765|  1.19M|#pragma GCC diagnostic push
 1766|  1.19M|#pragma GCC diagnostic ignored "-Warray-bounds"
 1767|  1.19M|#endif
 1768|  1.19M|        constexpr count_t rrb_extras    = 2;
 1769|  1.19M|        constexpr count_t rrb_invariant = 1;
 1770|  1.19M|        const auto bits                 = shift == BL ? BL : B;
  ------------------
  |  Branch (1770:43): [True: 173k, False: 1.02M]
  ------------------
 1771|  1.19M|        const auto branches             = count_t{1} << bits;
 1772|  1.19M|        const auto optimal              = ((total - 1) >> bits) + 1;
 1773|  1.19M|        count_t i                       = 0;
 1774|  1.26M|        while (n >= optimal + rrb_extras) {
  ------------------
  |  Branch (1774:16): [True: 73.5k, False: 1.19M]
  ------------------
 1775|       |            // skip ok nodes
 1776|   142k|            while (counts[i] > branches - rrb_invariant)
  ------------------
  |  Branch (1776:20): [True: 69.3k, False: 73.5k]
  ------------------
 1777|  69.3k|                i++;
 1778|  73.5k|            assert(i < n);
  ------------------
  |  Branch (1778:13): [True: 73.5k, False: 0]
  ------------------
 1779|       |            // short node, redistribute
 1780|  73.5k|            auto remaining = counts[i];
 1781|   125k|            do {
 1782|   125k|                auto next  = counts[i + 1];
 1783|   125k|                auto count = std::min(remaining + next, branches);
 1784|   125k|                counts[i]  = count;
 1785|   125k|                assert(counts[i]);
  ------------------
  |  Branch (1785:17): [True: 125k, False: 0]
  ------------------
 1786|   125k|                remaining += next - count;
 1787|   125k|                ++i;
 1788|   125k|            } while (remaining > 0);
  ------------------
  |  Branch (1788:22): [True: 52.0k, False: 73.5k]
  ------------------
 1789|       |            // remove node
 1790|  73.5k|            std::move(counts + i + 1, counts + n, counts + i);
 1791|  73.5k|            --n;
 1792|  73.5k|            --i;
 1793|  73.5k|        }
 1794|  1.19M|#if !defined(_MSC_VER)
 1795|  1.19M|#pragma GCC diagnostic pop
 1796|  1.19M|#endif
 1797|  1.19M|    }
_ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1478|  2.39M|    auto shift() const { return shift_; }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPjj:
 1577|   252k|        : curr_{counts}
 1578|   252k|        , n_{n}
 1579|   252k|        , result_{
 1580|   252k|              shift + B, node_t::make_inner_r_n(std::min(n_, branches<B>)), 0}
 1581|   252k|    {
 1582|   252k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPSC_m:
 1481|  1.19M|        : shift_{s}
 1482|  1.19M|        , count_{1}
 1483|  1.19M|        , nodes_{n0}
 1484|  1.19M|        , sizes_{s0}
 1485|  1.19M|    {
 1486|  1.19M|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8each_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_:
 1512|   252k|    {
 1513|   252k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 51.1k, False: 201k]
  ------------------
 1514|  51.1k|            auto s = size_t{};
 1515|   201k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 150k, False: 51.1k]
  ------------------
 1516|   150k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   150k|                s = sizes_[i];
 1518|   150k|            }
 1519|   201k|        } else {
 1520|   599k|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 398k, False: 201k]
  ------------------
 1521|   398k|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|   398k|                    .visit(v, args...);
 1523|   201k|        }
 1524|   252k|    }
_ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_:
 1721|   334k|    {
 1722|   334k|        merger.merge_leaf(p);
 1723|   334k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_:
 1614|   334k|    {
 1615|   334k|        auto from       = p.node();
 1616|   334k|        auto from_size  = p.size();
 1617|   334k|        auto from_count = p.count();
 1618|   334k|        assert(from_size);
  ------------------
  |  Branch (1618:9): [True: 334k, False: 0]
  ------------------
 1619|   334k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1619:13): [True: 317k, False: 16.4k]
  |  Branch (1619:21): [True: 309k, False: 8.03k]
  ------------------
 1620|   309k|            add_child(from, from_size);
 1621|   309k|            from->inc();
 1622|   309k|        } else {
 1623|  24.4k|            auto from_offset = count_t{};
 1624|  24.4k|            auto from_data   = from->leaf();
 1625|  32.6k|            do {
 1626|  32.6k|                if (!to_) {
  ------------------
  |  Branch (1626:21): [True: 16.2k, False: 16.4k]
  ------------------
 1627|  16.2k|                    to_        = node_t::make_leaf_n(*curr_);
 1628|  16.2k|                    to_offset_ = 0;
 1629|  16.2k|                }
 1630|  32.6k|                auto data = to_->leaf();
 1631|  32.6k|                auto to_copy =
 1632|  32.6k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1633|  32.6k|                detail::uninitialized_copy(from_data + from_offset,
 1634|  32.6k|                                           from_data + from_offset + to_copy,
 1635|  32.6k|                                           data + to_offset_);
 1636|  32.6k|                to_offset_ += to_copy;
 1637|  32.6k|                from_offset += to_copy;
 1638|  32.6k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1638:21): [True: 16.2k, False: 16.4k]
  ------------------
 1639|  16.2k|                    add_child(to_, to_offset_);
 1640|  16.2k|                    to_ = nullptr;
 1641|  16.2k|                }
 1642|  32.6k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1642:22): [True: 8.21k, False: 24.4k]
  ------------------
 1643|  24.4k|        }
 1644|   334k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9add_childEPSC_m:
 1589|  1.73M|    {
 1590|  1.73M|        assert(size);
  ------------------
  |  Branch (1590:9): [True: 1.73M, False: 0]
  ------------------
 1591|  1.73M|        ++curr_;
 1592|  1.73M|        auto parent  = result_.nodes_[result_.count_ - 1];
 1593|  1.73M|        auto relaxed = parent->relaxed();
 1594|  1.73M|        if (relaxed->d.count == branches<B>) {
  ------------------
  |  Branch (1594:13): [True: 220k, False: 1.51M]
  ------------------
 1595|   220k|            assert(result_.count_ < result_t::max_children);
  ------------------
  |  Branch (1595:13): [True: 220k, False: 0]
  ------------------
 1596|   220k|            n_ -= branches<B>;
 1597|   220k|            parent  = node_t::make_inner_r_n(std::min(n_, branches<B>));
 1598|   220k|            relaxed = parent->relaxed();
 1599|   220k|            result_.nodes_[result_.count_] = parent;
 1600|   220k|            result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1];
 1601|   220k|            assert(result_.sizes_[result_.count_]);
  ------------------
  |  Branch (1601:13): [True: 220k, False: 0]
  ------------------
 1602|   220k|            ++result_.count_;
 1603|   220k|        }
 1604|  1.73M|        auto idx = relaxed->d.count++;
 1605|  1.73M|        result_.sizes_[result_.count_ - 1] += size;
 1606|  1.73M|        assert(result_.sizes_[result_.count_ - 1]);
  ------------------
  |  Branch (1606:9): [True: 1.73M, False: 0]
  ------------------
 1607|  1.73M|        relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0);
  ------------------
  |  Branch (1607:41): [True: 1.25M, False: 472k]
  ------------------
 1608|  1.73M|        assert(relaxed->d.sizes[idx]);
  ------------------
  |  Branch (1608:9): [True: 1.73M, False: 0]
  ------------------
 1609|  1.73M|        parent->inner()[idx] = p;
 1610|  1.73M|    };
_ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_:
 1715|  1.34M|    {
 1716|  1.34M|        merger.merge_inner(p);
 1717|  1.34M|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_:
 1648|  1.34M|    {
 1649|  1.34M|        auto from       = p.node();
 1650|  1.34M|        auto from_size  = p.size();
 1651|  1.34M|        auto from_count = p.count();
 1652|  1.34M|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 1.34M, False: 0]
  ------------------
 1653|  1.34M|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 1.33M, False: 8.88k]
  |  Branch (1653:21): [True: 1.32M, False: 4.44k]
  ------------------
 1654|  1.32M|            add_child(from, from_size);
 1655|  1.32M|            from->inc();
 1656|  1.32M|        } else {
 1657|  13.3k|            auto from_offset = count_t{};
 1658|  13.3k|            auto from_data   = from->inner();
 1659|  17.5k|            do {
 1660|  17.5k|                if (!to_) {
  ------------------
  |  Branch (1660:21): [True: 8.61k, False: 8.88k]
  ------------------
 1661|  8.61k|                    to_        = node_t::make_inner_r_n(*curr_);
 1662|  8.61k|                    to_offset_ = 0;
 1663|  8.61k|                    to_size_   = 0;
 1664|  8.61k|                }
 1665|  17.5k|                auto data = to_->inner();
 1666|  17.5k|                auto to_copy =
 1667|  17.5k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1668|  17.5k|                std::copy(from_data + from_offset,
 1669|  17.5k|                          from_data + from_offset + to_copy,
 1670|  17.5k|                          data + to_offset_);
 1671|  17.5k|                node_t::inc_nodes(from_data + from_offset, to_copy);
 1672|  17.5k|                auto sizes = to_->relaxed()->d.sizes;
 1673|  17.5k|                p.copy_sizes(
 1674|  17.5k|                    from_offset, to_copy, to_size_, sizes + to_offset_);
 1675|  17.5k|                to_offset_ += to_copy;
 1676|  17.5k|                from_offset += to_copy;
 1677|  17.5k|                to_size_ = sizes[to_offset_ - 1];
 1678|  17.5k|                assert(to_size_);
  ------------------
  |  Branch (1678:17): [True: 17.5k, False: 0]
  ------------------
 1679|  17.5k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1679:21): [True: 8.61k, False: 8.88k]
  ------------------
 1680|  8.61k|                    to_->relaxed()->d.count = to_offset_;
 1681|  8.61k|                    add_child(to_, to_size_);
 1682|  8.61k|                    to_ = nullptr;
 1683|  8.61k|                }
 1684|  17.5k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1684:22): [True: 4.17k, False: 13.3k]
  ------------------
 1685|  13.3k|        }
 1686|  1.34M|    }
_ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6finishEv:
 1689|   252k|    {
 1690|   252k|        assert(!to_);
  ------------------
  |  Branch (1690:9): [True: 252k, False: 0]
  ------------------
 1691|   252k|        return result_;
 1692|   252k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_:
 1512|   252k|    {
 1513|   252k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 51.1k, False: 201k]
  ------------------
 1514|  51.1k|            auto s = size_t{};
 1515|   201k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 150k, False: 51.1k]
  ------------------
 1516|   150k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   150k|                s = sizes_[i];
 1518|   150k|            }
 1519|   201k|        } else {
 1520|   599k|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 398k, False: 201k]
  ------------------
 1521|   398k|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|   398k|                    .visit(v, args...);
 1523|   201k|        }
 1524|   252k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m:
 1503|   162k|        : shift_{s}
 1504|   162k|        , count_{3}
 1505|   162k|        , nodes_{n0, n1, n2}
 1506|   162k|        , sizes_{s0, s0 + s1, s0 + s1 + s2}
 1507|   162k|    {
 1508|   162k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPSC_mSE_m:
 1489|  10.7k|        : shift_{s}
 1490|  10.7k|        , count_{2}
 1491|  10.7k|        , nodes_{n0, n1}
 1492|  10.7k|        , sizes_{s0, s0 + s1}
 1493|  10.7k|    {
 1494|  10.7k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  5.64k|    {
 1918|  5.64k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  5.64k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|    243|    {
 1918|    243|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|    243|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  1.55k|{
 1873|  1.55k|    auto lshift = lpos.shift();
 1874|  1.55k|    auto rshift = rpos.shift();
 1875|  1.55k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.55k]
  ------------------
 1876|      0|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|      0|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  1.55k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 756, False: 802]
  ------------------
 1879|    756|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    756|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|    802|    } else {
 1882|    802|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 802, False: 0]
  ------------------
 1883|    802|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 802]
  |  Branch (1883:9): [True: 802, False: 0]
  |  Branch (1883:9): [True: 802, False: 0]
  ------------------
 1884|    802|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|    802|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|    802|    }
 1887|  1.55k|}
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  1.33k|    {
 1918|  1.33k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.33k|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  1.33k|{
 1873|  1.33k|    auto lshift = lpos.shift();
 1874|  1.33k|    auto rshift = rpos.shift();
 1875|  1.33k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.33k]
  ------------------
 1876|      0|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|      0|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  1.33k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 580, False: 756]
  ------------------
 1879|    580|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    580|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|    756|    } else {
 1882|    756|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 756, False: 0]
  ------------------
 1883|    756|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 756]
  |  Branch (1883:9): [True: 756, False: 0]
  |  Branch (1883:9): [True: 756, False: 0]
  ------------------
 1884|    756|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|    756|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|    756|    }
 1887|  1.33k|}
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSE_IT_EEOT0_OT1_OT2_:
 1823|  1.08k|{
 1824|  1.08k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.08k|    plan.fill(lpos, cpos, rpos);
 1826|  1.08k|    plan.shuffle(cpos.shift());
 1827|  1.08k|    IMMER_TRY {
  ------------------
  |  |   49|  1.08k|#define IMMER_TRY try
  ------------------
 1828|  1.08k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.08k|    }
 1830|  1.08k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.08k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_8full_posISH_EEEEvOT_OT0_OT1_:
 1752|  2.31k|    {
 1753|  2.31k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 2.31k, False: 0]
  ------------------
 1754|  2.31k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 2.31k, False: 0]
  ------------------
 1755|  2.31k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  2.31k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  2.31k|        cpos.each_sub(visitor_t{}, *this);
 1758|  2.31k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  2.31k|    }
_ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_:
 1733|   119k|    {
 1734|   119k|        auto count = p.count();
 1735|   119k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 119k, False: 0]
  ------------------
 1736|   119k|        plan.counts[plan.n++] = count;
 1737|   119k|        plan.total += count;
 1738|   119k|    }
_ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_:
 1733|   235k|    {
 1734|   235k|        auto count = p.count();
 1735|   235k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 235k, False: 0]
  ------------------
 1736|   235k|        plan.counts[plan.n++] = count;
 1737|   235k|        plan.total += count;
 1738|   235k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_8full_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_:
 1802|  1.08k|    {
 1803|  1.08k|        using node_t    = node_type<CPos>;
 1804|  1.08k|        using merger_t  = concat_merger<node_t>;
 1805|  1.08k|        using visitor_t = concat_merger_visitor;
 1806|  1.08k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.08k|        IMMER_TRY {
  ------------------
  |  |   49|  1.08k|#define IMMER_TRY try
  ------------------
 1808|  1.08k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.08k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.08k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.08k|            cpos.each_sub(dec_visitor{});
 1812|  1.08k|            return merger.finish();
 1813|  1.08k|        }
 1814|  1.08k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.08k|    }
_ZN5immer6detail4rbts21concat_merger_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_:
 1721|  23.1k|    {
 1722|  23.1k|        merger.merge_leaf(p);
 1723|  23.1k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_:
 1614|  23.1k|    {
 1615|  23.1k|        auto from       = p.node();
 1616|  23.1k|        auto from_size  = p.size();
 1617|  23.1k|        auto from_count = p.count();
 1618|  23.1k|        assert(from_size);
  ------------------
  |  Branch (1618:9): [True: 23.1k, False: 0]
  ------------------
 1619|  23.1k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1619:13): [True: 23.1k, False: 0]
  |  Branch (1619:21): [True: 23.1k, False: 0]
  ------------------
 1620|  23.1k|            add_child(from, from_size);
 1621|  23.1k|            from->inc();
 1622|  23.1k|        } else {
 1623|      0|            auto from_offset = count_t{};
 1624|      0|            auto from_data   = from->leaf();
 1625|      0|            do {
 1626|      0|                if (!to_) {
  ------------------
  |  Branch (1626:21): [True: 0, False: 0]
  ------------------
 1627|      0|                    to_        = node_t::make_leaf_n(*curr_);
 1628|      0|                    to_offset_ = 0;
 1629|      0|                }
 1630|      0|                auto data = to_->leaf();
 1631|      0|                auto to_copy =
 1632|      0|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1633|      0|                detail::uninitialized_copy(from_data + from_offset,
 1634|      0|                                           from_data + from_offset + to_copy,
 1635|      0|                                           data + to_offset_);
 1636|      0|                to_offset_ += to_copy;
 1637|      0|                from_offset += to_copy;
 1638|      0|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1638:21): [True: 0, False: 0]
  ------------------
 1639|      0|                    add_child(to_, to_offset_);
 1640|      0|                    to_ = nullptr;
 1641|      0|                }
 1642|      0|            } while (from_offset != from_count);
  ------------------
  |  Branch (1642:22): [True: 0, False: 0]
  ------------------
 1643|      0|        }
 1644|  23.1k|    }
_ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_:
 1715|  28.1k|    {
 1716|  28.1k|        merger.merge_inner(p);
 1717|  28.1k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_:
 1648|  28.1k|    {
 1649|  28.1k|        auto from       = p.node();
 1650|  28.1k|        auto from_size  = p.size();
 1651|  28.1k|        auto from_count = p.count();
 1652|  28.1k|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 28.1k, False: 0]
  ------------------
 1653|  28.1k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 28.1k, False: 0]
  |  Branch (1653:21): [True: 28.1k, False: 0]
  ------------------
 1654|  28.1k|            add_child(from, from_size);
 1655|  28.1k|            from->inc();
 1656|  28.1k|        } else {
 1657|      0|            auto from_offset = count_t{};
 1658|      0|            auto from_data   = from->inner();
 1659|      0|            do {
 1660|      0|                if (!to_) {
  ------------------
  |  Branch (1660:21): [True: 0, False: 0]
  ------------------
 1661|      0|                    to_        = node_t::make_inner_r_n(*curr_);
 1662|      0|                    to_offset_ = 0;
 1663|      0|                    to_size_   = 0;
 1664|      0|                }
 1665|      0|                auto data = to_->inner();
 1666|      0|                auto to_copy =
 1667|      0|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1668|      0|                std::copy(from_data + from_offset,
 1669|      0|                          from_data + from_offset + to_copy,
 1670|      0|                          data + to_offset_);
 1671|      0|                node_t::inc_nodes(from_data + from_offset, to_copy);
 1672|      0|                auto sizes = to_->relaxed()->d.sizes;
 1673|      0|                p.copy_sizes(
 1674|      0|                    from_offset, to_copy, to_size_, sizes + to_offset_);
 1675|      0|                to_offset_ += to_copy;
 1676|      0|                from_offset += to_copy;
 1677|      0|                to_size_ = sizes[to_offset_ - 1];
 1678|      0|                assert(to_size_);
  ------------------
  |  Branch (1678:17): [True: 0, False: 0]
  ------------------
 1679|      0|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1679:21): [True: 0, False: 0]
  ------------------
 1680|      0|                    to_->relaxed()->d.count = to_offset_;
 1681|      0|                    add_child(to_, to_size_);
 1682|      0|                    to_ = nullptr;
 1683|      0|                }
 1684|      0|            } while (from_offset != from_count);
  ------------------
  |  Branch (1684:22): [True: 0, False: 0]
  ------------------
 1685|      0|        }
 1686|  28.1k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1944|    756|    {
 1945|    756|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|    756|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1924|  1.55k|    {
 1925|  1.55k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  1.55k|    }
_ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1838|  1.55k|{
 1839|  1.55k|    static_assert(Node::bits >= 2, "");
 1840|  1.55k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 1.55k, False: 0]
  ------------------
 1841|  1.55k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 1.55k, False: 0]
  ------------------
 1842|  1.55k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 1.55k, False: 0]
  ------------------
 1843|  1.55k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 0, False: 1.55k]
  ------------------
 1844|      0|        return {
 1845|      0|            Node::bits_leaf,
 1846|      0|            lpos.node()->inc(),
 1847|      0|            lpos.count(),
 1848|      0|            tpos.node()->inc(),
 1849|      0|            tpos.count(),
 1850|      0|            rpos.node()->inc(),
 1851|      0|            rpos.count(),
 1852|      0|        };
 1853|  1.55k|    else
 1854|  1.55k|        return {
 1855|  1.55k|            Node::bits_leaf,
 1856|  1.55k|            lpos.node()->inc(),
 1857|  1.55k|            lpos.count(),
 1858|  1.55k|            rpos.node()->inc(),
 1859|  1.55k|            rpos.count(),
 1860|  1.55k|        };
 1861|  1.55k|}
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_:
 1823|    756|{
 1824|    756|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|    756|    plan.fill(lpos, cpos, rpos);
 1826|    756|    plan.shuffle(cpos.shift());
 1827|    756|    IMMER_TRY {
  ------------------
  |  |   49|    756|#define IMMER_TRY try
  ------------------
 1828|    756|        return plan.merge(lpos, cpos, rpos);
 1829|    756|    }
 1830|    756|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|    756|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_:
 1752|  1.70k|    {
 1753|  1.70k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 1.70k, False: 0]
  ------------------
 1754|  1.70k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 1.70k, False: 0]
  ------------------
 1755|  1.70k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  1.70k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  1.70k|        cpos.each_sub(visitor_t{}, *this);
 1758|  1.70k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  1.70k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_:
 1802|    756|    {
 1803|    756|        using node_t    = node_type<CPos>;
 1804|    756|        using merger_t  = concat_merger<node_t>;
 1805|    756|        using visitor_t = concat_merger_visitor;
 1806|    756|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|    756|        IMMER_TRY {
  ------------------
  |  |   49|    756|#define IMMER_TRY try
  ------------------
 1808|    756|            lpos.each_left_sub(visitor_t{}, merger);
 1809|    756|            cpos.each_sub(visitor_t{}, merger);
 1810|    756|            rpos.each_right_sub(visitor_t{}, merger);
 1811|    756|            cpos.each_sub(dec_visitor{});
 1812|    756|            return merger.finish();
 1813|    756|        }
 1814|    756|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|    756|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSE_IT_EEOT0_OT1_OT2_:
 1823|  2.06k|{
 1824|  2.06k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  2.06k|    plan.fill(lpos, cpos, rpos);
 1826|  2.06k|    plan.shuffle(cpos.shift());
 1827|  2.06k|    IMMER_TRY {
  ------------------
  |  |   49|  2.06k|#define IMMER_TRY try
  ------------------
 1828|  2.06k|        return plan.merge(lpos, cpos, rpos);
 1829|  2.06k|    }
 1830|  2.06k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  2.06k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_15regular_sub_posISH_EEEEvOT_OT0_OT1_:
 1752|  4.29k|    {
 1753|  4.29k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 4.29k, False: 0]
  ------------------
 1754|  4.29k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 4.29k, False: 0]
  ------------------
 1755|  4.29k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  4.29k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  4.29k|        cpos.each_sub(visitor_t{}, *this);
 1758|  4.29k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  4.29k|    }
_ZN5immer6detail4rbts34concat_rebalance_plan_fill_visitor10visit_nodeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21concat_rebalance_planILj2ELj2EEEEEvOT_RT0_:
 1733|   115k|    {
 1734|   115k|        auto count = p.count();
 1735|   115k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 115k, False: 0]
  ------------------
 1736|   115k|        plan.counts[plan.n++] = count;
 1737|   115k|        plan.total += count;
 1738|   115k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_:
 1802|  2.06k|    {
 1803|  2.06k|        using node_t    = node_type<CPos>;
 1804|  2.06k|        using merger_t  = concat_merger<node_t>;
 1805|  2.06k|        using visitor_t = concat_merger_visitor;
 1806|  2.06k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  2.06k|        IMMER_TRY {
  ------------------
  |  |   49|  2.06k|#define IMMER_TRY try
  ------------------
 1808|  2.06k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  2.06k|            cpos.each_sub(visitor_t{}, merger);
 1810|  2.06k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  2.06k|            cpos.each_sub(dec_visitor{});
 1812|  2.06k|            return merger.finish();
 1813|  2.06k|        }
 1814|  2.06k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  2.06k|    }
_ZN5immer6detail4rbts21concat_merger_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_13concat_mergerISE_EEEEvOT_RT0_:
 1715|  17.8k|    {
 1716|  17.8k|        merger.merge_inner(p);
 1717|  17.8k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_:
 1648|  17.8k|    {
 1649|  17.8k|        auto from       = p.node();
 1650|  17.8k|        auto from_size  = p.size();
 1651|  17.8k|        auto from_count = p.count();
 1652|  17.8k|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 17.8k, False: 0]
  ------------------
 1653|  17.8k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 17.2k, False: 612]
  |  Branch (1653:21): [True: 17.2k, False: 0]
  ------------------
 1654|  17.2k|            add_child(from, from_size);
 1655|  17.2k|            from->inc();
 1656|  17.2k|        } else {
 1657|    612|            auto from_offset = count_t{};
 1658|    612|            auto from_data   = from->inner();
 1659|  1.22k|            do {
 1660|  1.22k|                if (!to_) {
  ------------------
  |  Branch (1660:21): [True: 612, False: 612]
  ------------------
 1661|    612|                    to_        = node_t::make_inner_r_n(*curr_);
 1662|    612|                    to_offset_ = 0;
 1663|    612|                    to_size_   = 0;
 1664|    612|                }
 1665|  1.22k|                auto data = to_->inner();
 1666|  1.22k|                auto to_copy =
 1667|  1.22k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1668|  1.22k|                std::copy(from_data + from_offset,
 1669|  1.22k|                          from_data + from_offset + to_copy,
 1670|  1.22k|                          data + to_offset_);
 1671|  1.22k|                node_t::inc_nodes(from_data + from_offset, to_copy);
 1672|  1.22k|                auto sizes = to_->relaxed()->d.sizes;
 1673|  1.22k|                p.copy_sizes(
 1674|  1.22k|                    from_offset, to_copy, to_size_, sizes + to_offset_);
 1675|  1.22k|                to_offset_ += to_copy;
 1676|  1.22k|                from_offset += to_copy;
 1677|  1.22k|                to_size_ = sizes[to_offset_ - 1];
 1678|  1.22k|                assert(to_size_);
  ------------------
  |  Branch (1678:17): [True: 1.22k, False: 0]
  ------------------
 1679|  1.22k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1679:21): [True: 612, False: 612]
  ------------------
 1680|    612|                    to_->relaxed()->d.count = to_offset_;
 1681|    612|                    add_child(to_, to_size_);
 1682|    612|                    to_ = nullptr;
 1683|    612|                }
 1684|  1.22k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1684:22): [True: 612, False: 612]
  ------------------
 1685|    612|        }
 1686|  17.8k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1944|    802|    {
 1945|    802|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|    802|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1924|  1.66k|    {
 1925|  1.66k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  1.66k|    }
_ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1838|  1.66k|{
 1839|  1.66k|    static_assert(Node::bits >= 2, "");
 1840|  1.66k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 1.66k, False: 0]
  ------------------
 1841|  1.66k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 1.66k, False: 0]
  ------------------
 1842|  1.66k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 1.66k, False: 0]
  ------------------
 1843|  1.66k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 0, False: 1.66k]
  ------------------
 1844|      0|        return {
 1845|      0|            Node::bits_leaf,
 1846|      0|            lpos.node()->inc(),
 1847|      0|            lpos.count(),
 1848|      0|            tpos.node()->inc(),
 1849|      0|            tpos.count(),
 1850|      0|            rpos.node()->inc(),
 1851|      0|            rpos.count(),
 1852|      0|        };
 1853|  1.66k|    else
 1854|  1.66k|        return {
 1855|  1.66k|            Node::bits_leaf,
 1856|  1.66k|            lpos.node()->inc(),
 1857|  1.66k|            lpos.count(),
 1858|  1.66k|            rpos.node()->inc(),
 1859|  1.66k|            rpos.count(),
 1860|  1.66k|        };
 1861|  1.66k|}
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_:
 1823|    802|{
 1824|    802|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|    802|    plan.fill(lpos, cpos, rpos);
 1826|    802|    plan.shuffle(cpos.shift());
 1827|    802|    IMMER_TRY {
  ------------------
  |  |   49|    802|#define IMMER_TRY try
  ------------------
 1828|    802|        return plan.merge(lpos, cpos, rpos);
 1829|    802|    }
 1830|    802|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|    802|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_:
 1752|  3.52k|    {
 1753|  3.52k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 3.52k, False: 0]
  ------------------
 1754|  3.52k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 3.52k, False: 0]
  ------------------
 1755|  3.52k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  3.52k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  3.52k|        cpos.each_sub(visitor_t{}, *this);
 1758|  3.52k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  3.52k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_:
 1802|    802|    {
 1803|    802|        using node_t    = node_type<CPos>;
 1804|    802|        using merger_t  = concat_merger<node_t>;
 1805|    802|        using visitor_t = concat_merger_visitor;
 1806|    802|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|    802|        IMMER_TRY {
  ------------------
  |  |   49|    802|#define IMMER_TRY try
  ------------------
 1808|    802|            lpos.each_left_sub(visitor_t{}, merger);
 1809|    802|            cpos.each_sub(visitor_t{}, merger);
 1810|    802|            rpos.each_right_sub(visitor_t{}, merger);
 1811|    802|            cpos.each_sub(dec_visitor{});
 1812|    802|            return merger.finish();
 1813|    802|        }
 1814|    802|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|    802|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSE_IT_EEOT0_OT1_OT2_:
 1823|  9.49k|{
 1824|  9.49k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  9.49k|    plan.fill(lpos, cpos, rpos);
 1826|  9.49k|    plan.shuffle(cpos.shift());
 1827|  9.49k|    IMMER_TRY {
  ------------------
  |  |   49|  9.49k|#define IMMER_TRY try
  ------------------
 1828|  9.49k|        return plan.merge(lpos, cpos, rpos);
 1829|  9.49k|    }
 1830|  9.49k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  9.49k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_11relaxed_posISH_EEEEvOT_OT0_OT1_:
 1752|  79.0k|    {
 1753|  79.0k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 79.0k, False: 0]
  ------------------
 1754|  79.0k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 79.0k, False: 0]
  ------------------
 1755|  79.0k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  79.0k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  79.0k|        cpos.each_sub(visitor_t{}, *this);
 1758|  79.0k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  79.0k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_11relaxed_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_:
 1802|  9.49k|    {
 1803|  9.49k|        using node_t    = node_type<CPos>;
 1804|  9.49k|        using merger_t  = concat_merger<node_t>;
 1805|  9.49k|        using visitor_t = concat_merger_visitor;
 1806|  9.49k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  9.49k|        IMMER_TRY {
  ------------------
  |  |   49|  9.49k|#define IMMER_TRY try
  ------------------
 1808|  9.49k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  9.49k|            cpos.each_sub(visitor_t{}, merger);
 1810|  9.49k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  9.49k|            cpos.each_sub(dec_visitor{});
 1812|  9.49k|            return merger.finish();
 1813|  9.49k|        }
 1814|  9.49k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  9.49k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1944|  1.66k|    {
 1945|  1.66k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  1.66k|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  1.66k|{
 1824|  1.66k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.66k|    plan.fill(lpos, cpos, rpos);
 1826|  1.66k|    plan.shuffle(cpos.shift());
 1827|  1.66k|    IMMER_TRY {
  ------------------
  |  |   49|  1.66k|#define IMMER_TRY try
  ------------------
 1828|  1.66k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.66k|    }
 1830|  1.66k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.66k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_:
 1752|  5.49k|    {
 1753|  5.49k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 5.49k, False: 0]
  ------------------
 1754|  5.49k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 5.49k, False: 0]
  ------------------
 1755|  5.49k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  5.49k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  5.49k|        cpos.each_sub(visitor_t{}, *this);
 1758|  5.49k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  5.49k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_:
 1802|  1.66k|    {
 1803|  1.66k|        using node_t    = node_type<CPos>;
 1804|  1.66k|        using merger_t  = concat_merger<node_t>;
 1805|  1.66k|        using visitor_t = concat_merger_visitor;
 1806|  1.66k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.66k|        IMMER_TRY {
  ------------------
  |  |   49|  1.66k|#define IMMER_TRY try
  ------------------
 1808|  1.66k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.66k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.66k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.66k|            cpos.each_sub(dec_visitor{});
 1812|  1.66k|            return merger.finish();
 1813|  1.66k|        }
 1814|  1.66k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.66k|    }
_ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1958|  1.31k|    {
 1959|  1.31k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  1.31k|    }
_ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7realizeEv:
 1527|  51.1k|    {
 1528|  51.1k|        if (count_ > 1) {
  ------------------
  |  Branch (1528:13): [True: 22.5k, False: 28.6k]
  ------------------
 1529|  22.5k|            IMMER_TRY {
  ------------------
  |  |   49|  22.5k|#define IMMER_TRY try
  ------------------
 1530|  22.5k|                auto result = node_t::make_inner_r_n(count_);
 1531|  22.5k|                auto r      = result->relaxed();
 1532|  22.5k|                r->d.count  = count_;
 1533|  22.5k|                std::copy(nodes_, nodes_ + count_, result->inner());
 1534|  22.5k|                std::copy(sizes_, sizes_ + count_, r->d.sizes);
 1535|  22.5k|                return {result, shift_, r};
 1536|  22.5k|            }
 1537|  22.5k|            IMMER_CATCH (...) {
 1538|      0|                each_sub(dec_visitor{});
 1539|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1540|      0|            }
 1541|  28.6k|        } else {
 1542|  28.6k|            assert(shift_ >= B + BL);
  ------------------
  |  Branch (1542:13): [True: 28.6k, False: 0]
  ------------------
 1543|  28.6k|            return {nodes_[0], shift_ - B, nodes_[0]->relaxed()};
 1544|  28.6k|        }
 1545|  51.1k|    }
_ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm:
 1986|  47.9k|{
 1987|  47.9k|    return visit_maybe_relaxed_sub(lroot,
 1988|  47.9k|                                   lshift,
 1989|  47.9k|                                   lsize,
 1990|  47.9k|                                   concat_trees_left_visitor<Node>{},
 1991|  47.9k|                                   make_leaf_pos(ltail, ltcount),
 1992|  47.9k|                                   rroot,
 1993|  47.9k|                                   rshift,
 1994|  47.9k|                                   rsize)
 1995|  47.9k|        .realize();
 1996|  47.9k|}
_ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_:
 1971|  41.9k|    {
 1972|  41.9k|        return visit_maybe_relaxed_sub(
 1973|  41.9k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  41.9k|    }
_ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1958|  39.4k|    {
 1959|  39.4k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  39.4k|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|   210k|{
 1873|   210k|    auto lshift = lpos.shift();
 1874|   210k|    auto rshift = rpos.shift();
 1875|   210k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 2.79k, False: 207k]
  ------------------
 1876|  2.79k|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|  2.79k|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|   207k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 2.47k, False: 204k]
  ------------------
 1879|  2.47k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  2.47k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|   204k|    } else {
 1882|   204k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 204k, False: 0]
  ------------------
 1883|   204k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 204k]
  |  Branch (1883:9): [True: 204k, False: 0]
  |  Branch (1883:9): [True: 204k, False: 0]
  ------------------
 1884|   204k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|   204k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|   204k|    }
 1887|   210k|}
_ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1897|  2.47k|    {
 1898|  2.47k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  2.47k|    }
_ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1897|    780|    {
 1898|    780|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|    780|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  13.3k|{
 1873|  13.3k|    auto lshift = lpos.shift();
 1874|  13.3k|    auto rshift = rpos.shift();
 1875|  13.3k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 455, False: 12.8k]
  ------------------
 1876|    455|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|    455|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  12.8k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 1.12k, False: 11.7k]
  ------------------
 1879|  1.12k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  1.12k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  11.7k|    } else {
 1882|  11.7k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 11.7k, False: 0]
  ------------------
 1883|  11.7k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 11.7k]
  |  Branch (1883:9): [True: 11.7k, False: 0]
  |  Branch (1883:9): [True: 11.7k, False: 0]
  ------------------
 1884|  11.7k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  11.7k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  11.7k|    }
 1887|  13.3k|}
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  1.56k|{
 1824|  1.56k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.56k|    plan.fill(lpos, cpos, rpos);
 1826|  1.56k|    plan.shuffle(cpos.shift());
 1827|  1.56k|    IMMER_TRY {
  ------------------
  |  |   49|  1.56k|#define IMMER_TRY try
  ------------------
 1828|  1.56k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.56k|    }
 1830|  1.56k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.56k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_:
 1752|  5.96k|    {
 1753|  5.96k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 5.96k, False: 0]
  ------------------
 1754|  5.96k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 5.96k, False: 0]
  ------------------
 1755|  5.96k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  5.96k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  5.96k|        cpos.each_sub(visitor_t{}, *this);
 1758|  5.96k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  5.96k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_:
 1802|  1.56k|    {
 1803|  1.56k|        using node_t    = node_type<CPos>;
 1804|  1.56k|        using merger_t  = concat_merger<node_t>;
 1805|  1.56k|        using visitor_t = concat_merger_visitor;
 1806|  1.56k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.56k|        IMMER_TRY {
  ------------------
  |  |   49|  1.56k|#define IMMER_TRY try
  ------------------
 1808|  1.56k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.56k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.56k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.56k|            cpos.each_sub(dec_visitor{});
 1812|  1.56k|            return merger.finish();
 1813|  1.56k|        }
 1814|  1.56k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.56k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  11.5k|    {
 1918|  11.5k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  11.5k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  1.37k|    {
 1918|  1.37k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.37k|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  7.93k|{
 1873|  7.93k|    auto lshift = lpos.shift();
 1874|  7.93k|    auto rshift = rpos.shift();
 1875|  7.93k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 1.10k, False: 6.82k]
  ------------------
 1876|  1.10k|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|  1.10k|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  6.82k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 612, False: 6.21k]
  ------------------
 1879|    612|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    612|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  6.21k|    } else {
 1882|  6.21k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 6.21k, False: 0]
  ------------------
 1883|  6.21k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 6.21k]
  |  Branch (1883:9): [True: 6.21k, False: 0]
  |  Branch (1883:9): [True: 6.21k, False: 0]
  ------------------
 1884|  6.21k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  6.21k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  6.21k|    }
 1887|  7.93k|}
_ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1897|  1.51k|    {
 1898|  1.51k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  1.51k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  4.39k|    {
 1918|  4.39k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  4.39k|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  4.39k|{
 1873|  4.39k|    auto lshift = lpos.shift();
 1874|  4.39k|    auto rshift = rpos.shift();
 1875|  4.39k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 4.39k]
  ------------------
 1876|      0|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|      0|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  4.39k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 216, False: 4.17k]
  ------------------
 1879|    216|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    216|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  4.17k|    } else {
 1882|  4.17k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 4.17k, False: 0]
  ------------------
 1883|  4.17k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 4.17k]
  |  Branch (1883:9): [True: 4.17k, False: 0]
  |  Branch (1883:9): [True: 4.17k, False: 0]
  ------------------
 1884|  4.17k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  4.17k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  4.17k|    }
 1887|  4.39k|}
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1944|  3.33k|    {
 1945|  3.33k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  3.33k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1924|  9.09k|    {
 1925|  9.09k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  9.09k|    }
_ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1838|  9.09k|{
 1839|  9.09k|    static_assert(Node::bits >= 2, "");
 1840|  9.09k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 9.09k, False: 0]
  ------------------
 1841|  9.09k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 9.09k, False: 0]
  ------------------
 1842|  9.09k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 9.09k, False: 0]
  ------------------
 1843|  9.09k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 9.09k, False: 0]
  ------------------
 1844|  9.09k|        return {
 1845|  9.09k|            Node::bits_leaf,
 1846|  9.09k|            lpos.node()->inc(),
 1847|  9.09k|            lpos.count(),
 1848|  9.09k|            tpos.node()->inc(),
 1849|  9.09k|            tpos.count(),
 1850|  9.09k|            rpos.node()->inc(),
 1851|  9.09k|            rpos.count(),
 1852|  9.09k|        };
 1853|      0|    else
 1854|      0|        return {
 1855|      0|            Node::bits_leaf,
 1856|      0|            lpos.node()->inc(),
 1857|      0|            lpos.count(),
 1858|      0|            rpos.node()->inc(),
 1859|      0|            rpos.count(),
 1860|      0|        };
 1861|  9.09k|}
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1937|  2.01k|    {
 1938|  2.01k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  2.01k|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  4.17k|{
 1824|  4.17k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  4.17k|    plan.fill(lpos, cpos, rpos);
 1826|  4.17k|    plan.shuffle(cpos.shift());
 1827|  4.17k|    IMMER_TRY {
  ------------------
  |  |   49|  4.17k|#define IMMER_TRY try
  ------------------
 1828|  4.17k|        return plan.merge(lpos, cpos, rpos);
 1829|  4.17k|    }
 1830|  4.17k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  4.17k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_:
 1752|  24.8k|    {
 1753|  24.8k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 24.8k, False: 0]
  ------------------
 1754|  24.8k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 24.8k, False: 0]
  ------------------
 1755|  24.8k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  24.8k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  24.8k|        cpos.each_sub(visitor_t{}, *this);
 1758|  24.8k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  24.8k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_:
 1802|  4.17k|    {
 1803|  4.17k|        using node_t    = node_type<CPos>;
 1804|  4.17k|        using merger_t  = concat_merger<node_t>;
 1805|  4.17k|        using visitor_t = concat_merger_visitor;
 1806|  4.17k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  4.17k|        IMMER_TRY {
  ------------------
  |  |   49|  4.17k|#define IMMER_TRY try
  ------------------
 1808|  4.17k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  4.17k|            cpos.each_sub(visitor_t{}, merger);
 1810|  4.17k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  4.17k|            cpos.each_sub(dec_visitor{});
 1812|  4.17k|            return merger.finish();
 1813|  4.17k|        }
 1814|  4.17k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  4.17k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1944|  5.76k|    {
 1945|  5.76k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  5.76k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1924|  38.8k|    {
 1925|  38.8k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  38.8k|    }
_ZN5immer6detail4rbts12concat_leafsINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1838|  38.8k|{
 1839|  38.8k|    static_assert(Node::bits >= 2, "");
 1840|  38.8k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 38.8k, False: 0]
  ------------------
 1841|  38.8k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 38.8k, False: 0]
  ------------------
 1842|  38.8k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 38.8k, False: 0]
  ------------------
 1843|  38.8k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 38.8k, False: 0]
  ------------------
 1844|  38.8k|        return {
 1845|  38.8k|            Node::bits_leaf,
 1846|  38.8k|            lpos.node()->inc(),
 1847|  38.8k|            lpos.count(),
 1848|  38.8k|            tpos.node()->inc(),
 1849|  38.8k|            tpos.count(),
 1850|  38.8k|            rpos.node()->inc(),
 1851|  38.8k|            rpos.count(),
 1852|  38.8k|        };
 1853|      0|    else
 1854|      0|        return {
 1855|      0|            Node::bits_leaf,
 1856|      0|            lpos.node()->inc(),
 1857|      0|            lpos.count(),
 1858|      0|            rpos.node()->inc(),
 1859|      0|            rpos.count(),
 1860|      0|        };
 1861|  38.8k|}
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1937|  1.54k|    {
 1938|  1.54k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  1.54k|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_:
 1823|  6.21k|{
 1824|  6.21k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  6.21k|    plan.fill(lpos, cpos, rpos);
 1826|  6.21k|    plan.shuffle(cpos.shift());
 1827|  6.21k|    IMMER_TRY {
  ------------------
  |  |   49|  6.21k|#define IMMER_TRY try
  ------------------
 1828|  6.21k|        return plan.merge(lpos, cpos, rpos);
 1829|  6.21k|    }
 1830|  6.21k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  6.21k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_:
 1752|  13.1k|    {
 1753|  13.1k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 13.1k, False: 0]
  ------------------
 1754|  13.1k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 13.1k, False: 0]
  ------------------
 1755|  13.1k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  13.1k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  13.1k|        cpos.each_sub(visitor_t{}, *this);
 1758|  13.1k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  13.1k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_:
 1802|  6.21k|    {
 1803|  6.21k|        using node_t    = node_type<CPos>;
 1804|  6.21k|        using merger_t  = concat_merger<node_t>;
 1805|  6.21k|        using visitor_t = concat_merger_visitor;
 1806|  6.21k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  6.21k|        IMMER_TRY {
  ------------------
  |  |   49|  6.21k|#define IMMER_TRY try
  ------------------
 1808|  6.21k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  6.21k|            cpos.each_sub(visitor_t{}, merger);
 1810|  6.21k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  6.21k|            cpos.each_sub(dec_visitor{});
 1812|  6.21k|            return merger.finish();
 1813|  6.21k|        }
 1814|  6.21k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  6.21k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1944|  38.8k|    {
 1945|  38.8k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  38.8k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1937|  11.8k|    {
 1938|  11.8k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  11.8k|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  11.7k|{
 1824|  11.7k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  11.7k|    plan.fill(lpos, cpos, rpos);
 1826|  11.7k|    plan.shuffle(cpos.shift());
 1827|  11.7k|    IMMER_TRY {
  ------------------
  |  |   49|  11.7k|#define IMMER_TRY try
  ------------------
 1828|  11.7k|        return plan.merge(lpos, cpos, rpos);
 1829|  11.7k|    }
 1830|  11.7k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  11.7k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEEvOT_OT0_OT1_:
 1752|   130k|    {
 1753|   130k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 130k, False: 0]
  ------------------
 1754|   130k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 130k, False: 0]
  ------------------
 1755|   130k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   130k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   130k|        cpos.each_sub(visitor_t{}, *this);
 1758|   130k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   130k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_:
 1802|  11.7k|    {
 1803|  11.7k|        using node_t    = node_type<CPos>;
 1804|  11.7k|        using merger_t  = concat_merger<node_t>;
 1805|  11.7k|        using visitor_t = concat_merger_visitor;
 1806|  11.7k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  11.7k|        IMMER_TRY {
  ------------------
  |  |   49|  11.7k|#define IMMER_TRY try
  ------------------
 1808|  11.7k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  11.7k|            cpos.each_sub(visitor_t{}, merger);
 1810|  11.7k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  11.7k|            cpos.each_sub(dec_visitor{});
 1812|  11.7k|            return merger.finish();
 1813|  11.7k|        }
 1814|  11.7k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  11.7k|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  4.74k|{
 1824|  4.74k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  4.74k|    plan.fill(lpos, cpos, rpos);
 1826|  4.74k|    plan.shuffle(cpos.shift());
 1827|  4.74k|    IMMER_TRY {
  ------------------
  |  |   49|  4.74k|#define IMMER_TRY try
  ------------------
 1828|  4.74k|        return plan.merge(lpos, cpos, rpos);
 1829|  4.74k|    }
 1830|  4.74k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  4.74k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_:
 1752|   417k|    {
 1753|   417k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 417k, False: 0]
  ------------------
 1754|   417k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 417k, False: 0]
  ------------------
 1755|   417k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   417k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   417k|        cpos.each_sub(visitor_t{}, *this);
 1758|   417k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   417k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSP_OT1_:
 1802|  4.74k|    {
 1803|  4.74k|        using node_t    = node_type<CPos>;
 1804|  4.74k|        using merger_t  = concat_merger<node_t>;
 1805|  4.74k|        using visitor_t = concat_merger_visitor;
 1806|  4.74k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  4.74k|        IMMER_TRY {
  ------------------
  |  |   49|  4.74k|#define IMMER_TRY try
  ------------------
 1808|  4.74k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  4.74k|            cpos.each_sub(visitor_t{}, merger);
 1810|  4.74k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  4.74k|            cpos.each_sub(dec_visitor{});
 1812|  4.74k|            return merger.finish();
 1813|  4.74k|        }
 1814|  4.74k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  4.74k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|   168k|    {
 1918|   168k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|   168k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|    199|    {
 1918|    199|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|    199|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  4.21k|{
 1873|  4.21k|    auto lshift = lpos.shift();
 1874|  4.21k|    auto rshift = rpos.shift();
 1875|  4.21k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 1.94k, False: 2.26k]
  ------------------
 1876|  1.94k|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|  1.94k|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  2.26k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 699, False: 1.56k]
  ------------------
 1879|    699|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    699|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  1.56k|    } else {
 1882|  1.56k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.56k, False: 0]
  ------------------
 1883|  1.56k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.56k]
  |  Branch (1883:9): [True: 1.56k, False: 0]
  |  Branch (1883:9): [True: 1.56k, False: 0]
  ------------------
 1884|  1.56k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.56k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.56k|    }
 1887|  4.21k|}
_ZN5immer6detail4rbts19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1897|  1.54k|    {
 1898|  1.54k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  1.54k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  1.86k|    {
 1918|  1.86k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.86k|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  1.86k|{
 1873|  1.86k|    auto lshift = lpos.shift();
 1874|  1.86k|    auto rshift = rpos.shift();
 1875|  1.86k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.86k]
  ------------------
 1876|      0|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|      0|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  1.86k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 291, False: 1.57k]
  ------------------
 1879|    291|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    291|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  1.57k|    } else {
 1882|  1.57k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.57k, False: 0]
  ------------------
 1883|  1.57k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.57k]
  |  Branch (1883:9): [True: 1.57k, False: 0]
  |  Branch (1883:9): [True: 1.57k, False: 0]
  ------------------
 1884|  1.57k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.57k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.57k|    }
 1887|  1.86k|}
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1937|    395|    {
 1938|    395|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|    395|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  1.57k|{
 1824|  1.57k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.57k|    plan.fill(lpos, cpos, rpos);
 1826|  1.57k|    plan.shuffle(cpos.shift());
 1827|  1.57k|    IMMER_TRY {
  ------------------
  |  |   49|  1.57k|#define IMMER_TRY try
  ------------------
 1828|  1.57k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.57k|    }
 1830|  1.57k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.57k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEEvOT_OT0_OT1_:
 1752|  3.57k|    {
 1753|  3.57k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 3.57k, False: 0]
  ------------------
 1754|  3.57k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 3.57k, False: 0]
  ------------------
 1755|  3.57k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  3.57k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  3.57k|        cpos.each_sub(visitor_t{}, *this);
 1758|  3.57k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  3.57k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_:
 1802|  1.57k|    {
 1803|  1.57k|        using node_t    = node_type<CPos>;
 1804|  1.57k|        using merger_t  = concat_merger<node_t>;
 1805|  1.57k|        using visitor_t = concat_merger_visitor;
 1806|  1.57k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.57k|        IMMER_TRY {
  ------------------
  |  |   49|  1.57k|#define IMMER_TRY try
  ------------------
 1808|  1.57k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.57k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.57k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.57k|            cpos.each_sub(dec_visitor{});
 1812|  1.57k|            return merger.finish();
 1813|  1.57k|        }
 1814|  1.57k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.57k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1937|    477|    {
 1938|    477|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|    477|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  1.56k|{
 1824|  1.56k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.56k|    plan.fill(lpos, cpos, rpos);
 1826|  1.56k|    plan.shuffle(cpos.shift());
 1827|  1.56k|    IMMER_TRY {
  ------------------
  |  |   49|  1.56k|#define IMMER_TRY try
  ------------------
 1828|  1.56k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.56k|    }
 1830|  1.56k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.56k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEEvOT_OT0_OT1_:
 1752|  38.6k|    {
 1753|  38.6k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 38.6k, False: 0]
  ------------------
 1754|  38.6k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 38.6k, False: 0]
  ------------------
 1755|  38.6k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  38.6k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  38.6k|        cpos.each_sub(visitor_t{}, *this);
 1758|  38.6k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  38.6k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSQ_OT1_:
 1802|  1.56k|    {
 1803|  1.56k|        using node_t    = node_type<CPos>;
 1804|  1.56k|        using merger_t  = concat_merger<node_t>;
 1805|  1.56k|        using visitor_t = concat_merger_visitor;
 1806|  1.56k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.56k|        IMMER_TRY {
  ------------------
  |  |   49|  1.56k|#define IMMER_TRY try
  ------------------
 1808|  1.56k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.56k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.56k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.56k|            cpos.each_sub(dec_visitor{});
 1812|  1.56k|            return merger.finish();
 1813|  1.56k|        }
 1814|  1.56k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.56k|    }
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1937|   165k|    {
 1938|   165k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|   165k|    }
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EEOT0_OT1_OT2_:
 1823|   204k|{
 1824|   204k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|   204k|    plan.fill(lpos, cpos, rpos);
 1826|   204k|    plan.shuffle(cpos.shift());
 1827|   204k|    IMMER_TRY {
  ------------------
  |  |   49|   204k|#define IMMER_TRY try
  ------------------
 1828|   204k|        return plan.merge(lpos, cpos, rpos);
 1829|   204k|    }
 1830|   204k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|   204k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EEvOT_OT0_OT1_:
 1752|   464k|    {
 1753|   464k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 464k, False: 0]
  ------------------
 1754|   464k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 464k, False: 0]
  ------------------
 1755|   464k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   464k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   464k|        cpos.each_sub(visitor_t{}, *this);
 1758|   464k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   464k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_:
 1802|   204k|    {
 1803|   204k|        using node_t    = node_type<CPos>;
 1804|   204k|        using merger_t  = concat_merger<node_t>;
 1805|   204k|        using visitor_t = concat_merger_visitor;
 1806|   204k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|   204k|        IMMER_TRY {
  ------------------
  |  |   49|   204k|#define IMMER_TRY try
  ------------------
 1808|   204k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|   204k|            cpos.each_sub(visitor_t{}, merger);
 1810|   204k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|   204k|            cpos.each_sub(dec_visitor{});
 1812|   204k|            return merger.finish();
 1813|   204k|        }
 1814|   204k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|   204k|    }
_ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1958|  2.47k|    {
 1959|  2.47k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  2.47k|    }
_ZN5immer6detail4rbts25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_OT0_DpOT1_:
 1971|  6.03k|    {
 1972|  6.03k|        return visit_maybe_relaxed_sub(
 1973|  6.03k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  6.03k|    }
_ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1958|    982|    {
 1959|    982|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|    982|    }
_ZN5immer6detail4rbts26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1958|  5.04k|    {
 1959|  5.04k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  5.04k|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j:
  680|   888k|    {
  681|   888k|        auto node     = pos.node();
  682|   888k|        auto level    = pos.shift();
  683|   888k|        auto idx      = pos.count() - 1;
  684|   888k|        auto children = pos.size(idx);
  685|   888k|        auto new_idx =
  686|   888k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (686:13): [True: 5.99k, False: 882k]
  |  Branch (686:47): [True: 1.41k, False: 881k]
  ------------------
  687|   888k|        auto new_child = static_cast<node_t*>(nullptr);
  688|   888k|        auto mutate    = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (688:26): [True: 888k, Folded]
  |  Branch (688:38): [True: 882k, False: 6.05k]
  ------------------
  689|       |
  690|   888k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (690:13): [True: 3.82k, False: 885k]
  ------------------
  691|  3.82k|            return nullptr;
  692|   885k|        else if (idx == new_idx) {
  ------------------
  |  Branch (692:18): [True: 881k, False: 3.57k]
  ------------------
  693|   881k|            new_child =
  694|   881k|                mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts)
  ------------------
  |  Branch (694:17): [True: 876k, False: 5.28k]
  ------------------
  695|   881k|                       : pos.last_oh_csh(
  696|  5.28k|                             this_no_mut_t{}, idx, children, e, tail, ts);
  697|   881k|            if (!new_child) {
  ------------------
  |  Branch (697:17): [True: 4.93k, False: 876k]
  ------------------
  698|  4.93k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (698:21): [True: 2.82k, False: 2.11k]
  ------------------
  699|  2.82k|                    new_child = node_t::make_path_e(e, level - B, tail);
  700|  2.11k|                else
  701|  2.11k|                    return nullptr;
  702|  4.93k|            }
  703|   881k|        } else
  704|  3.57k|            new_child = node_t::make_path_e(e, level - B, tail);
  705|       |
  706|   882k|        if (mutate) {
  ------------------
  |  Branch (706:13): [True: 877k, False: 5.30k]
  ------------------
  707|   877k|            auto count             = new_idx + 1;
  708|   877k|            auto relaxed           = node->ensure_mutable_relaxed_n(e, new_idx);
  709|   877k|            node->inner()[new_idx] = new_child;
  710|   877k|            relaxed->d.sizes[new_idx] = pos.size() + ts;
  711|   877k|            relaxed->d.count          = count;
  712|   877k|            assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (712:13): [True: 877k, False: 0]
  ------------------
  713|   877k|            return node;
  714|   877k|        } else {
  715|  5.30k|            IMMER_TRY {
  ------------------
  |  |   49|  5.30k|#define IMMER_TRY try
  ------------------
  716|  5.30k|                auto count    = new_idx + 1;
  717|  5.30k|                auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx);
  718|  5.30k|                auto relaxed  = new_node->relaxed();
  719|  5.30k|                new_node->inner()[new_idx] = new_child;
  720|  5.30k|                relaxed->d.sizes[new_idx]  = pos.size() + ts;
  721|  5.30k|                relaxed->d.count           = count;
  722|  5.30k|                assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (722:17): [True: 5.30k, False: 0]
  ------------------
  723|  5.30k|                if (Mutating)
  ------------------
  |  Branch (723:21): [True: 5.30k, Folded]
  ------------------
  724|  5.30k|                    pos.visit(dec_visitor{});
  725|  5.30k|                return new_node;
  726|  5.30k|            }
  727|  5.30k|            IMMER_CATCH (...) {
  728|      0|                auto shift = pos.shift();
  729|      0|                auto size  = new_idx == idx ? children + ts : ts;
  ------------------
  |  Branch (729:30): [True: 0, False: 0]
  ------------------
  730|      0|                if (shift > BL) {
  ------------------
  |  Branch (730:21): [True: 0, False: 0]
  ------------------
  731|      0|                    tail->inc();
  732|      0|                    dec_inner(new_child, shift - B, size);
  733|      0|                }
  734|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  735|      0|            }
  736|  5.30k|        }
  737|   882k|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_:
  741|   667k|    {
  742|   667k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 667k, False: 0]
  ------------------
  743|   667k|        auto node    = pos.node();
  744|   667k|        auto idx     = pos.index(pos.size() - 1);
  745|   667k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|   667k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 667k, Folded]
  |  Branch (746:36): [True: 666k, False: 760]
  ------------------
  747|   667k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 666k, False: 760]
  ------------------
  748|   666k|            node->inner()[new_idx] =
  749|   666k|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 659k, False: 6.93k]
  ------------------
  750|       |                               /* otherwise */
  751|   666k|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|   666k|            return node;
  753|   666k|        } else {
  754|    760|            auto new_parent = node_t::make_inner_e(e);
  755|    760|            IMMER_TRY {
  ------------------
  |  |   49|    760|#define IMMER_TRY try
  ------------------
  756|    760|                new_parent->inner()[new_idx] =
  757|    760|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 401, False: 359]
  ------------------
  758|    760|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|    760|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|    760|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|    760|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 760, Folded]
  ------------------
  763|    760|                    pos.visit(dec_visitor{});
  764|    760|                return new_parent;
  765|    760|            }
  766|    760|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|    760|        }
  771|   667k|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_:
  741|  9.09M|    {
  742|  9.09M|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 9.09M, False: 0]
  ------------------
  743|  9.09M|        auto node    = pos.node();
  744|  9.09M|        auto idx     = pos.index(pos.size() - 1);
  745|  9.09M|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  9.09M|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 9.09M, Folded]
  |  Branch (746:36): [True: 9.09M, False: 396]
  ------------------
  747|  9.09M|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 9.09M, False: 396]
  ------------------
  748|  9.09M|            node->inner()[new_idx] =
  749|  9.09M|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 7.40M, False: 1.68M]
  ------------------
  750|       |                               /* otherwise */
  751|  9.09M|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|  9.09M|            return node;
  753|  9.09M|        } else {
  754|    396|            auto new_parent = node_t::make_inner_e(e);
  755|    396|            IMMER_TRY {
  ------------------
  |  |   49|    396|#define IMMER_TRY try
  ------------------
  756|    396|                new_parent->inner()[new_idx] =
  757|    396|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 199, False: 197]
  ------------------
  758|    396|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|    396|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|    396|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|    396|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 396, Folded]
  ------------------
  763|    396|                    pos.visit(dec_visitor{});
  764|    396|                return new_parent;
  765|    396|            }
  766|    396|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|    396|        }
  771|  9.09M|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_:
  741|  8.50k|    {
  742|  8.50k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 8.50k, False: 0]
  ------------------
  743|  8.50k|        auto node    = pos.node();
  744|  8.50k|        auto idx     = pos.index(pos.size() - 1);
  745|  8.50k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  8.50k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [Folded, False: 8.50k]
  |  Branch (746:36): [True: 0, False: 0]
  ------------------
  747|  8.50k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 0, False: 8.50k]
  ------------------
  748|      0|            node->inner()[new_idx] =
  749|      0|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 0, False: 0]
  ------------------
  750|       |                               /* otherwise */
  751|      0|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|      0|            return node;
  753|  8.50k|        } else {
  754|  8.50k|            auto new_parent = node_t::make_inner_e(e);
  755|  8.50k|            IMMER_TRY {
  ------------------
  |  |   49|  8.50k|#define IMMER_TRY try
  ------------------
  756|  8.50k|                new_parent->inner()[new_idx] =
  757|  8.50k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 4.37k, False: 4.12k]
  ------------------
  758|  8.50k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  8.50k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  8.50k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  8.50k|                if (Mutating)
  ------------------
  |  Branch (762:21): [Folded, False: 8.50k]
  ------------------
  763|      0|                    pos.visit(dec_visitor{});
  764|  8.50k|                return new_parent;
  765|  8.50k|            }
  766|  8.50k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  8.50k|        }
  771|  8.50k|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEEPSC_OT_NSA_5applyIS7_E4type4editESI_j:
  680|  18.8k|    {
  681|  18.8k|        auto node     = pos.node();
  682|  18.8k|        auto level    = pos.shift();
  683|  18.8k|        auto idx      = pos.count() - 1;
  684|  18.8k|        auto children = pos.size(idx);
  685|  18.8k|        auto new_idx =
  686|  18.8k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (686:13): [True: 2.00k, False: 16.8k]
  |  Branch (686:47): [True: 210, False: 16.6k]
  ------------------
  687|  18.8k|        auto new_child = static_cast<node_t*>(nullptr);
  688|  18.8k|        auto mutate    = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (688:26): [Folded, False: 18.8k]
  |  Branch (688:38): [True: 0, False: 0]
  ------------------
  689|       |
  690|  18.8k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (690:13): [True: 750, False: 18.0k]
  ------------------
  691|    750|            return nullptr;
  692|  18.0k|        else if (idx == new_idx) {
  ------------------
  |  Branch (692:18): [True: 16.6k, False: 1.46k]
  ------------------
  693|  16.6k|            new_child =
  694|  16.6k|                mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts)
  ------------------
  |  Branch (694:17): [True: 0, False: 16.6k]
  ------------------
  695|  16.6k|                       : pos.last_oh_csh(
  696|  16.6k|                             this_no_mut_t{}, idx, children, e, tail, ts);
  697|  16.6k|            if (!new_child) {
  ------------------
  |  Branch (697:17): [True: 1.70k, False: 14.9k]
  ------------------
  698|  1.70k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (698:21): [True: 260, False: 1.44k]
  ------------------
  699|    260|                    new_child = node_t::make_path_e(e, level - B, tail);
  700|  1.44k|                else
  701|  1.44k|                    return nullptr;
  702|  1.70k|            }
  703|  16.6k|        } else
  704|  1.46k|            new_child = node_t::make_path_e(e, level - B, tail);
  705|       |
  706|  16.6k|        if (mutate) {
  ------------------
  |  Branch (706:13): [True: 0, False: 16.6k]
  ------------------
  707|      0|            auto count             = new_idx + 1;
  708|      0|            auto relaxed           = node->ensure_mutable_relaxed_n(e, new_idx);
  709|      0|            node->inner()[new_idx] = new_child;
  710|      0|            relaxed->d.sizes[new_idx] = pos.size() + ts;
  711|      0|            relaxed->d.count          = count;
  712|      0|            assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (712:13): [True: 0, False: 0]
  ------------------
  713|      0|            return node;
  714|  16.6k|        } else {
  715|  16.6k|            IMMER_TRY {
  ------------------
  |  |   49|  16.6k|#define IMMER_TRY try
  ------------------
  716|  16.6k|                auto count    = new_idx + 1;
  717|  16.6k|                auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx);
  718|  16.6k|                auto relaxed  = new_node->relaxed();
  719|  16.6k|                new_node->inner()[new_idx] = new_child;
  720|  16.6k|                relaxed->d.sizes[new_idx]  = pos.size() + ts;
  721|  16.6k|                relaxed->d.count           = count;
  722|  16.6k|                assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (722:17): [True: 16.6k, False: 0]
  ------------------
  723|  16.6k|                if (Mutating)
  ------------------
  |  Branch (723:21): [Folded, False: 16.6k]
  ------------------
  724|      0|                    pos.visit(dec_visitor{});
  725|  16.6k|                return new_node;
  726|  16.6k|            }
  727|  16.6k|            IMMER_CATCH (...) {
  728|      0|                auto shift = pos.shift();
  729|      0|                auto size  = new_idx == idx ? children + ts : ts;
  ------------------
  |  Branch (729:30): [True: 0, False: 0]
  ------------------
  730|      0|                if (shift > BL) {
  ------------------
  |  Branch (730:21): [True: 0, False: 0]
  ------------------
  731|      0|                    tail->inc();
  732|      0|                    dec_inner(new_child, shift - B, size);
  733|      0|                }
  734|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  735|      0|            }
  736|  16.6k|        }
  737|  16.6k|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEJRjEEEPSC_OT_NSA_5applyIS7_E4type4editESJ_DpOT0_:
  741|  3.06k|    {
  742|  3.06k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 3.06k, False: 0]
  ------------------
  743|  3.06k|        auto node    = pos.node();
  744|  3.06k|        auto idx     = pos.index(pos.size() - 1);
  745|  3.06k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  3.06k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [Folded, False: 3.06k]
  |  Branch (746:36): [True: 0, False: 0]
  ------------------
  747|  3.06k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 0, False: 3.06k]
  ------------------
  748|      0|            node->inner()[new_idx] =
  749|      0|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 0, False: 0]
  ------------------
  750|       |                               /* otherwise */
  751|      0|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|      0|            return node;
  753|  3.06k|        } else {
  754|  3.06k|            auto new_parent = node_t::make_inner_e(e);
  755|  3.06k|            IMMER_TRY {
  ------------------
  |  |   49|  3.06k|#define IMMER_TRY try
  ------------------
  756|  3.06k|                new_parent->inner()[new_idx] =
  757|  3.06k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 1.72k, False: 1.33k]
  ------------------
  758|  3.06k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  3.06k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  3.06k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  3.06k|                if (Mutating)
  ------------------
  |  Branch (762:21): [Folded, False: 3.06k]
  ------------------
  763|      0|                    pos.visit(dec_visitor{});
  764|  3.06k|                return new_parent;
  765|  3.06k|            }
  766|  3.06k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  3.06k|        }
  771|  3.06k|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_:
  741|  1.04M|    {
  742|  1.04M|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 1.04M, False: 0]
  ------------------
  743|  1.04M|        auto node    = pos.node();
  744|  1.04M|        auto idx     = pos.index(pos.size() - 1);
  745|  1.04M|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  1.04M|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 1.04M, Folded]
  |  Branch (746:36): [True: 1.04M, False: 3.76k]
  ------------------
  747|  1.04M|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 1.04M, False: 3.76k]
  ------------------
  748|  1.04M|            node->inner()[new_idx] =
  749|  1.04M|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 1.02M, False: 11.4k]
  ------------------
  750|       |                               /* otherwise */
  751|  1.04M|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|  1.04M|            return node;
  753|  1.04M|        } else {
  754|  3.76k|            auto new_parent = node_t::make_inner_e(e);
  755|  3.76k|            IMMER_TRY {
  ------------------
  |  |   49|  3.76k|#define IMMER_TRY try
  ------------------
  756|  3.76k|                new_parent->inner()[new_idx] =
  757|  3.76k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 1.80k, False: 1.95k]
  ------------------
  758|  3.76k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  3.76k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  3.76k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  3.76k|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 3.76k, Folded]
  ------------------
  763|  3.76k|                    pos.visit(dec_visitor{});
  764|  3.76k|                return new_parent;
  765|  3.76k|            }
  766|  3.76k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  3.76k|        }
  771|  1.04M|    }
_ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEvPT_:
  580|  5.08k|{
  581|  5.08k|    make_empty_regular_pos(node).visit(dec_visitor());
  582|  5.08k|}
_ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_relaxedIRNS1_11relaxed_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_:
  595|  23.5k|    {
  596|  23.5k|        auto offset = pos.index(idx);
  597|  23.5k|        auto count  = pos.count();
  598|  23.5k|        auto node   = pos.node();
  599|  23.5k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (599:13): [True: 4.58k, False: 18.9k]
  ------------------
  600|  4.58k|            return pos.towards_oh(
  601|  4.58k|                this_t{}, idx, offset, e, &node->inner()[offset]);
  602|  18.9k|        } else {
  603|  18.9k|            auto new_node = node_t::copy_inner_sr_e(e, node, count);
  604|  18.9k|            IMMER_TRY {
  ------------------
  |  |   49|  18.9k|#define IMMER_TRY try
  ------------------
  605|  18.9k|                auto& res = pos.towards_oh(
  606|  18.9k|                    this_t{}, idx, offset, e, &new_node->inner()[offset]);
  607|  18.9k|                pos.visit(dec_visitor{});
  608|  18.9k|                *location = new_node;
  609|  18.9k|                return res;
  610|  18.9k|            }
  611|  18.9k|            IMMER_CATCH (...) {
  612|      0|                dec_relaxed(new_node, pos.shift());
  613|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  614|      0|            }
  615|  18.9k|        }
  616|  23.5k|    }
_ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_:
  652|  3.35k|    {
  653|  3.35k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 3.35k, False: 0]
  ------------------
  654|  3.35k|        auto node = pos.node();
  655|  3.35k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 702, False: 2.65k]
  ------------------
  656|    702|            return node->leaf()[pos.index(idx)];
  657|  2.65k|        } else {
  658|  2.65k|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|  2.65k|            pos.visit(dec_visitor{});
  660|  2.65k|            *location = new_node;
  661|  2.65k|            return new_node->leaf()[pos.index(idx)];
  662|  2.65k|        }
  663|  3.35k|    }
_ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_15regular_sub_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_:
  621|  7.50k|    {
  622|  7.50k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 7.50k, False: 0]
  ------------------
  623|  7.50k|        auto offset = pos.index(idx);
  624|  7.50k|        auto count  = pos.count();
  625|  7.50k|        auto node   = pos.node();
  626|  7.50k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 2.96k, False: 4.53k]
  ------------------
  627|  2.96k|            return pos.towards_oh_ch(
  628|  2.96k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  4.53k|        } else {
  630|  4.53k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  4.53k|            IMMER_TRY {
  ------------------
  |  |   49|  4.53k|#define IMMER_TRY try
  ------------------
  632|  4.53k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  4.53k|                                              idx,
  634|  4.53k|                                              offset,
  635|  4.53k|                                              count,
  636|  4.53k|                                              e,
  637|  4.53k|                                              &new_node->inner()[offset]);
  638|  4.53k|                pos.visit(dec_visitor{});
  639|  4.53k|                *location = new_node;
  640|  4.53k|                return res;
  641|  4.53k|            }
  642|  4.53k|            IMMER_CATCH (...) {
  643|      0|                dec_regular(new_node, pos.shift(), pos.size());
  644|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  645|      0|            }
  646|  4.53k|        }
  647|  7.50k|    }
_ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_:
  652|  6.11k|    {
  653|  6.11k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 6.11k, False: 0]
  ------------------
  654|  6.11k|        auto node = pos.node();
  655|  6.11k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 1.75k, False: 4.36k]
  ------------------
  656|  1.75k|            return node->leaf()[pos.index(idx)];
  657|  4.36k|        } else {
  658|  4.36k|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|  4.36k|            pos.visit(dec_visitor{});
  660|  4.36k|            *location = new_node;
  661|  4.36k|            return new_node->leaf()[pos.index(idx)];
  662|  4.36k|        }
  663|  6.11k|    }
_ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_8full_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_:
  621|  6.76k|    {
  622|  6.76k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 6.76k, False: 0]
  ------------------
  623|  6.76k|        auto offset = pos.index(idx);
  624|  6.76k|        auto count  = pos.count();
  625|  6.76k|        auto node   = pos.node();
  626|  6.76k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 1.21k, False: 5.54k]
  ------------------
  627|  1.21k|            return pos.towards_oh_ch(
  628|  1.21k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  5.54k|        } else {
  630|  5.54k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  5.54k|            IMMER_TRY {
  ------------------
  |  |   49|  5.54k|#define IMMER_TRY try
  ------------------
  632|  5.54k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  5.54k|                                              idx,
  634|  5.54k|                                              offset,
  635|  5.54k|                                              count,
  636|  5.54k|                                              e,
  637|  5.54k|                                              &new_node->inner()[offset]);
  638|  5.54k|                pos.visit(dec_visitor{});
  639|  5.54k|                *location = new_node;
  640|  5.54k|                return res;
  641|  5.54k|            }
  642|  5.54k|            IMMER_CATCH (...) {
  643|      0|                dec_regular(new_node, pos.shift(), pos.size());
  644|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  645|      0|            }
  646|  5.54k|        }
  647|  6.76k|    }
_ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_8leaf_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_:
  652|  1.39k|    {
  653|  1.39k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 1.39k, False: 0]
  ------------------
  654|  1.39k|        auto node = pos.node();
  655|  1.39k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 916, False: 474]
  ------------------
  656|    916|            return node->leaf()[pos.index(idx)];
  657|    916|        } else {
  658|    474|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|    474|            pos.visit(dec_visitor{});
  660|    474|            *location = new_node;
  661|    474|            return new_node->leaf()[pos.index(idx)];
  662|    474|        }
  663|  1.39k|    }
_ZN5immer6detail4rbts15get_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13visit_regularIRNS1_11regular_posISC_EEEERiOT_mNSA_5applyIS7_E4type4editEPPSC_:
  621|  3.05k|    {
  622|  3.05k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 3.05k, False: 0]
  ------------------
  623|  3.05k|        auto offset = pos.index(idx);
  624|  3.05k|        auto count  = pos.count();
  625|  3.05k|        auto node   = pos.node();
  626|  3.05k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 1.77k, False: 1.28k]
  ------------------
  627|  1.77k|            return pos.towards_oh_ch(
  628|  1.77k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  1.77k|        } else {
  630|  1.28k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  1.28k|            IMMER_TRY {
  ------------------
  |  |   49|  1.28k|#define IMMER_TRY try
  ------------------
  632|  1.28k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  1.28k|                                              idx,
  634|  1.28k|                                              offset,
  635|  1.28k|                                              count,
  636|  1.28k|                                              e,
  637|  1.28k|                                              &new_node->inner()[offset]);
  638|  1.28k|                pos.visit(dec_visitor{});
  639|  1.28k|                *location = new_node;
  640|  1.28k|                return res;
  641|  1.28k|            }
  642|  1.28k|            IMMER_CATCH (...) {
  643|      0|                dec_regular(new_node, pos.shift(), pos.size());
  644|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  645|      0|            }
  646|  1.28k|        }
  647|  3.05k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  913|  55.3k|    {
  914|  55.3k|        auto idx    = pos.index(last);
  915|  55.3k|        auto node   = pos.node();
  916|  55.3k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [True: 55.3k, Folded]
  |  Branch (916:35): [True: 46.3k, False: 9.00k]
  ------------------
  917|  55.3k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [True: 55.3k, Folded]
  |  Branch (917:25): [True: 42.8k, False: 12.4k]
  ------------------
  918|  42.8k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 36.5k, False: 6.31k]
  ------------------
  919|  42.8k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|  42.8k|            if (Mutating)
  ------------------
  |  Branch (920:17): [True: 42.8k, Folded]
  ------------------
  921|  42.8k|                pos.visit(dec_right_visitor{}, count_t{1});
  922|  42.8k|            return res;
  923|  42.8k|        } else {
  924|  12.4k|            using std::get;
  925|  12.4k|            auto subs =
  926|  12.4k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 9.74k, False: 2.68k]
  ------------------
  927|  12.4k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  12.4k|            auto next = get<1>(subs);
  929|  12.4k|            auto ts   = get<2>(subs);
  930|  12.4k|            auto tail = get<3>(subs);
  931|  12.4k|            IMMER_TRY {
  ------------------
  |  |   49|  12.4k|#define IMMER_TRY try
  ------------------
  932|  12.4k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 9.18k, False: 3.24k]
  ------------------
  933|  9.18k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 7.23k, False: 1.94k]
  ------------------
  934|  7.23k|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|  7.23k|                        pos.each_right(dec_visitor{}, idx + 1);
  936|  7.23k|                        node->inner()[idx] = next;
  937|  7.23k|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|  7.23k|                        nodr->d.count      = idx + 1;
  939|  7.23k|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 7.23k, False: 0]
  ------------------
  940|  7.23k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  7.23k|                    } else {
  942|  1.94k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  1.94k|                        auto newr = newn->relaxed();
  944|  1.94k|                        newn->inner()[idx] = next;
  945|  1.94k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  1.94k|                        newr->d.count      = idx + 1;
  947|  1.94k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 1.94k, False: 0]
  ------------------
  948|  1.94k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [True: 1.94k, Folded]
  ------------------
  949|  1.94k|                            pos.visit(dec_visitor{});
  950|  1.94k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  1.94k|                    }
  952|  9.18k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 0, False: 3.24k]
  ------------------
  953|      0|                    if (Mutating)
  ------------------
  |  Branch (953:25): [True: 0, Folded]
  ------------------
  954|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  3.24k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [True: 3.24k, Folded]
  |  Branch (956:40): [True: 2.22k, False: 1.02k]
  |  Branch (956:52): [True: 1.44k, False: 783]
  ------------------
  957|  1.44k|                    auto newn = pos.node()->inner()[0];
  958|  1.44k|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 244, False: 1.20k]
  ------------------
  959|    244|                        newn->inc();
  960|  1.44k|                    if (Mutating)
  ------------------
  |  Branch (960:25): [True: 1.44k, Folded]
  ------------------
  961|  1.44k|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|  1.44k|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|  1.80k|                } else {
  964|  1.80k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 1.30k, False: 498]
  ------------------
  965|  1.30k|                        pos.each_right(dec_visitor{}, idx + 1);
  966|  1.30k|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|  1.30k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  1.30k|                    } else {
  969|    498|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    498|                        if (Mutating)
  ------------------
  |  Branch (970:29): [True: 498, Folded]
  ------------------
  971|    498|                            pos.visit(dec_visitor{});
  972|    498|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    498|                    }
  974|  1.80k|                }
  975|  12.4k|            }
  976|  12.4k|            IMMER_CATCH (...) {
  977|      0|                assert(!mutate);
  ------------------
  |  Branch (977:17): [True: 0, False: 0]
  ------------------
  978|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  ------------------
  979|      0|                if (next)
  ------------------
  |  Branch (979:21): [True: 0, False: 0]
  ------------------
  980|      0|                    dec_inner(next,
  981|      0|                              pos.shift() - B,
  982|      0|                              last + 1 - ts - pos.size_before(idx));
  983|      0|                dec_leaf(tail, ts);
  984|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  985|      0|            }
  986|  12.4k|        }
  987|  55.3k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  2.58k|    {
 1060|  2.58k|        auto old_tail_size = pos.count();
 1061|  2.58k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.58k|        auto node          = pos.node();
 1063|  2.58k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.58k, Folded]
  |  Branch (1063:42): [True: 1.86k, False: 722]
  ------------------
 1064|  2.58k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.96k, False: 623]
  ------------------
 1065|  1.96k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.96k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.96k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.96k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 337, False: 286]
  ------------------
 1069|    337|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    337|                              old_tail_size - new_tail_size);
 1071|    337|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    337|        } else {
 1073|    286|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    286|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 286, Folded]
  ------------------
 1075|    286|                pos.visit(dec_visitor{});
 1076|    286|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    286|        }
 1078|  2.58k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  1.53k|    {
 1060|  1.53k|        auto old_tail_size = pos.count();
 1061|  1.53k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.53k|        auto node          = pos.node();
 1063|  1.53k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 1.53k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  1.53k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 388, False: 1.15k]
  ------------------
 1065|    388|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 388, Folded]
  ------------------
 1066|    388|                node->inc();
 1067|    388|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.15k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 1.15k]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  1.15k|        } else {
 1073|  1.15k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  1.15k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 1.15k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  1.15k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  1.15k|        }
 1078|  1.53k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  913|  34.3k|    {
  914|  34.3k|        auto idx    = pos.index(last);
  915|  34.3k|        auto node   = pos.node();
  916|  34.3k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [Folded, False: 34.3k]
  |  Branch (916:35): [True: 0, False: 0]
  ------------------
  917|  34.3k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [True: 34.3k, Folded]
  |  Branch (917:25): [True: 30.7k, False: 3.65k]
  ------------------
  918|  30.7k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 0, False: 30.7k]
  ------------------
  919|  30.7k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|  30.7k|            if (Mutating)
  ------------------
  |  Branch (920:17): [Folded, False: 30.7k]
  ------------------
  921|      0|                pos.visit(dec_right_visitor{}, count_t{1});
  922|  30.7k|            return res;
  923|  30.7k|        } else {
  924|  3.65k|            using std::get;
  925|  3.65k|            auto subs =
  926|  3.65k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 0, False: 3.65k]
  ------------------
  927|  3.65k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  3.65k|            auto next = get<1>(subs);
  929|  3.65k|            auto ts   = get<2>(subs);
  930|  3.65k|            auto tail = get<3>(subs);
  931|  3.65k|            IMMER_TRY {
  ------------------
  |  |   49|  3.65k|#define IMMER_TRY try
  ------------------
  932|  3.65k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 1.64k, False: 2.00k]
  ------------------
  933|  1.64k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 0, False: 1.64k]
  ------------------
  934|      0|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|      0|                        pos.each_right(dec_visitor{}, idx + 1);
  936|      0|                        node->inner()[idx] = next;
  937|      0|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|      0|                        nodr->d.count      = idx + 1;
  939|      0|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 0, False: 0]
  ------------------
  940|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  1.64k|                    } else {
  942|  1.64k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  1.64k|                        auto newr = newn->relaxed();
  944|  1.64k|                        newn->inner()[idx] = next;
  945|  1.64k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  1.64k|                        newr->d.count      = idx + 1;
  947|  1.64k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 1.64k, False: 0]
  ------------------
  948|  1.64k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [Folded, False: 1.64k]
  ------------------
  949|      0|                            pos.visit(dec_visitor{});
  950|  1.64k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  1.64k|                    }
  952|  2.00k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 0, False: 2.00k]
  ------------------
  953|      0|                    if (Mutating)
  ------------------
  |  Branch (953:25): [Folded, False: 0]
  ------------------
  954|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  2.00k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [True: 2.00k, Folded]
  |  Branch (956:40): [True: 1.18k, False: 818]
  |  Branch (956:52): [True: 875, False: 311]
  ------------------
  957|    875|                    auto newn = pos.node()->inner()[0];
  958|    875|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 875, False: 0]
  ------------------
  959|    875|                        newn->inc();
  960|    875|                    if (Mutating)
  ------------------
  |  Branch (960:25): [Folded, False: 875]
  ------------------
  961|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|    875|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|  1.12k|                } else {
  964|  1.12k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 0, False: 1.12k]
  ------------------
  965|      0|                        pos.each_right(dec_visitor{}, idx + 1);
  966|      0|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  1.12k|                    } else {
  969|  1.12k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|  1.12k|                        if (Mutating)
  ------------------
  |  Branch (970:29): [Folded, False: 1.12k]
  ------------------
  971|      0|                            pos.visit(dec_visitor{});
  972|  1.12k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|  1.12k|                    }
  974|  1.12k|                }
  975|  3.65k|            }
  976|  3.65k|            IMMER_CATCH (...) {
  977|      0|                assert(!mutate);
  ------------------
  |  Branch (977:17): [True: 0, False: 0]
  ------------------
  978|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  ------------------
  979|      0|                if (next)
  ------------------
  |  Branch (979:21): [True: 0, False: 0]
  ------------------
  980|      0|                    dec_inner(next,
  981|      0|                              pos.shift() - B,
  982|      0|                              last + 1 - ts - pos.size_before(idx));
  983|      0|                dec_leaf(tail, ts);
  984|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  985|      0|            }
  986|  3.65k|        }
  987|  34.3k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  1.12k|    {
  992|  1.12k|        auto idx    = pos.index(last);
  993|  1.12k|        auto node   = pos.node();
  994|  1.12k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 1.12k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  1.12k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 1.12k, Folded]
  |  Branch (995:25): [True: 271, False: 856]
  ------------------
  996|    271|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 271]
  ------------------
  997|    271|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|    271|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 271]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|    271|            return res;
 1001|    856|        } else {
 1002|    856|            using std::get;
 1003|    856|            auto subs =
 1004|    856|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 856]
  ------------------
 1005|    856|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|    856|            auto next = get<1>(subs);
 1007|    856|            auto ts   = get<2>(subs);
 1008|    856|            auto tail = get<3>(subs);
 1009|    856|            IMMER_TRY {
  ------------------
  |  |   49|    856|#define IMMER_TRY try
  ------------------
 1010|    856|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 220, False: 636]
  ------------------
 1011|    220|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 220]
  ------------------
 1012|      0|                        node->inner()[idx] = next;
 1013|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    220|                    } else {
 1016|    220|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    220|                        newn->inner()[idx] = next;
 1018|    220|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 220]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    220|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    220|                    }
 1022|    636|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 636]
  ------------------
 1023|      0|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 0]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|    636|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 636, Folded]
  |  Branch (1026:40): [True: 434, False: 202]
  |  Branch (1026:52): [True: 190, False: 244]
  ------------------
 1027|    190|                    auto newn = pos.node()->inner()[0];
 1028|    190|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 190, False: 0]
  ------------------
 1029|    190|                        newn->inc();
 1030|    190|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 190]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    190|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    446|                } else {
 1034|    446|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 446]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    446|                    } else {
 1038|    446|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    446|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 446]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    446|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    446|                    }
 1043|    446|                }
 1044|    856|            }
 1045|    856|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|    856|        }
 1055|  1.12k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  1.50k|    {
 1060|  1.50k|        auto old_tail_size = pos.count();
 1061|  1.50k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.50k|        auto node          = pos.node();
 1063|  1.50k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 1.50k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  1.50k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 644, False: 862]
  ------------------
 1065|    644|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 644, Folded]
  ------------------
 1066|    644|                node->inc();
 1067|    644|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    862|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 862]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    862|        } else {
 1073|    862|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    862|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 862]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    862|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    862|        }
 1078|  1.50k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  2.54k|    {
  992|  2.54k|        auto idx    = pos.index(last);
  993|  2.54k|        auto node   = pos.node();
  994|  2.54k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 2.54k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  2.54k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 2.54k, Folded]
  |  Branch (995:25): [True: 1.35k, False: 1.18k]
  ------------------
  996|  1.35k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 1.35k]
  ------------------
  997|  1.35k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  1.35k|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 1.35k]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  1.35k|            return res;
 1001|  1.35k|        } else {
 1002|  1.18k|            using std::get;
 1003|  1.18k|            auto subs =
 1004|  1.18k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 1.18k]
  ------------------
 1005|  1.18k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.18k|            auto next = get<1>(subs);
 1007|  1.18k|            auto ts   = get<2>(subs);
 1008|  1.18k|            auto tail = get<3>(subs);
 1009|  1.18k|            IMMER_TRY {
  ------------------
  |  |   49|  1.18k|#define IMMER_TRY try
  ------------------
 1010|  1.18k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 335, False: 848]
  ------------------
 1011|    335|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 335]
  ------------------
 1012|      0|                        node->inner()[idx] = next;
 1013|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    335|                    } else {
 1016|    335|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    335|                        newn->inner()[idx] = next;
 1018|    335|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 335]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    335|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    335|                    }
 1022|    848|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 848]
  ------------------
 1023|      0|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 0]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|    848|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 848, Folded]
  |  Branch (1026:40): [True: 626, False: 222]
  |  Branch (1026:52): [True: 258, False: 368]
  ------------------
 1027|    258|                    auto newn = pos.node()->inner()[0];
 1028|    258|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 258, False: 0]
  ------------------
 1029|    258|                        newn->inc();
 1030|    258|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 258]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    258|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    590|                } else {
 1034|    590|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 590]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    590|                    } else {
 1038|    590|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    590|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 590]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    590|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    590|                    }
 1043|    590|                }
 1044|  1.18k|            }
 1045|  1.18k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  1.18k|        }
 1055|  2.54k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  2.78k|    {
 1060|  2.78k|        auto old_tail_size = pos.count();
 1061|  2.78k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.78k|        auto node          = pos.node();
 1063|  2.78k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.78k, Folded]
  |  Branch (1063:42): [True: 1.11k, False: 1.67k]
  ------------------
 1064|  2.78k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.08k, False: 1.70k]
  ------------------
 1065|  1.08k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.08k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.08k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.70k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 786, False: 922]
  ------------------
 1069|    786|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    786|                              old_tail_size - new_tail_size);
 1071|    786|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    922|        } else {
 1073|    922|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    922|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 922, Folded]
  ------------------
 1075|    922|                pos.visit(dec_visitor{});
 1076|    922|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    922|        }
 1078|  2.78k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  3.41k|    {
  992|  3.41k|        auto idx    = pos.index(last);
  993|  3.41k|        auto node   = pos.node();
  994|  3.41k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 3.41k, Folded]
  |  Branch (994:35): [True: 1.09k, False: 2.31k]
  ------------------
  995|  3.41k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 3.41k]
  |  Branch (995:25): [True: 0, False: 0]
  ------------------
  996|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 0]
  ------------------
  997|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|      0|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 0, Folded]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|      0|            return res;
 1001|  3.41k|        } else {
 1002|  3.41k|            using std::get;
 1003|  3.41k|            auto subs =
 1004|  3.41k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 1.09k, False: 2.31k]
  ------------------
 1005|  3.41k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  3.41k|            auto next = get<1>(subs);
 1007|  3.41k|            auto ts   = get<2>(subs);
 1008|  3.41k|            auto tail = get<3>(subs);
 1009|  3.41k|            IMMER_TRY {
  ------------------
  |  |   49|  3.41k|#define IMMER_TRY try
  ------------------
 1010|  3.41k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 852, False: 2.56k]
  ------------------
 1011|    852|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 420, False: 432]
  ------------------
 1012|    420|                        node->inner()[idx] = next;
 1013|    420|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    420|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    432|                    } else {
 1016|    432|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    432|                        newn->inner()[idx] = next;
 1018|    432|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 432, Folded]
  ------------------
 1019|    432|                            pos.visit(dec_visitor{});
 1020|    432|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    432|                    }
 1022|  2.56k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 362, False: 2.19k]
  ------------------
 1023|    362|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 362, Folded]
  ------------------
 1024|    362|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    362|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  2.19k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 2.19k]
  |  Branch (1026:40): [True: 0, False: 0]
  |  Branch (1026:52): [True: 0, False: 0]
  ------------------
 1027|      0|                    auto newn = pos.node()->inner()[0];
 1028|      0|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 0, False: 0]
  ------------------
 1029|      0|                        newn->inc();
 1030|      0|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 0, Folded]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  2.19k|                } else {
 1034|  2.19k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 642, False: 1.55k]
  ------------------
 1035|    642|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    642|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  1.55k|                    } else {
 1038|  1.55k|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|  1.55k|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 1.55k, Folded]
  ------------------
 1040|  1.55k|                            pos.visit(dec_visitor{});
 1041|  1.55k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|  1.55k|                    }
 1043|  2.19k|                }
 1044|  3.41k|            }
 1045|  3.41k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  3.41k|        }
 1055|  3.41k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  878|  1.99k|    {
  879|  1.99k|        using node_t = node_type<Pos>;
  880|  1.99k|        auto node    = p.node();
  881|  1.99k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 1.99k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  1.99k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  8.30k|    {
 1060|  8.30k|        auto old_tail_size = pos.count();
 1061|  8.30k|        auto new_tail_size = pos.index(last) + 1;
 1062|  8.30k|        auto node          = pos.node();
 1063|  8.30k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 8.30k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  8.30k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 3.45k, False: 4.84k]
  ------------------
 1065|  3.45k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 3.45k, Folded]
  ------------------
 1066|  3.45k|                node->inc();
 1067|  3.45k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  4.84k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 4.84k]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  4.84k|        } else {
 1073|  4.84k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  4.84k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 4.84k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  4.84k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  4.84k|        }
 1078|  8.30k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  4.76k|    {
  992|  4.76k|        auto idx    = pos.index(last);
  993|  4.76k|        auto node   = pos.node();
  994|  4.76k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 4.76k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  4.76k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 4.76k]
  |  Branch (995:25): [True: 0, False: 0]
  ------------------
  996|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 0]
  ------------------
  997|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|      0|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 0]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|      0|            return res;
 1001|  4.76k|        } else {
 1002|  4.76k|            using std::get;
 1003|  4.76k|            auto subs =
 1004|  4.76k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 4.76k]
  ------------------
 1005|  4.76k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  4.76k|            auto next = get<1>(subs);
 1007|  4.76k|            auto ts   = get<2>(subs);
 1008|  4.76k|            auto tail = get<3>(subs);
 1009|  4.76k|            IMMER_TRY {
  ------------------
  |  |   49|  4.76k|#define IMMER_TRY try
  ------------------
 1010|  4.76k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 1.00k, False: 3.76k]
  ------------------
 1011|  1.00k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 1.00k]
  ------------------
 1012|      0|                        node->inner()[idx] = next;
 1013|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|  1.00k|                    } else {
 1016|  1.00k|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|  1.00k|                        newn->inner()[idx] = next;
 1018|  1.00k|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 1.00k]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|  1.00k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|  1.00k|                    }
 1022|  3.76k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.12k, False: 2.63k]
  ------------------
 1023|  1.12k|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 1.12k]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|  1.12k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  2.63k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 2.63k]
  |  Branch (1026:40): [True: 0, False: 0]
  |  Branch (1026:52): [True: 0, False: 0]
  ------------------
 1027|      0|                    auto newn = pos.node()->inner()[0];
 1028|      0|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 0, False: 0]
  ------------------
 1029|      0|                        newn->inc();
 1030|      0|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 0]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  2.63k|                } else {
 1034|  2.63k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 2.63k]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  2.63k|                    } else {
 1038|  2.63k|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|  2.63k|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 2.63k]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|  2.63k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|  2.63k|                    }
 1043|  2.63k|                }
 1044|  4.76k|            }
 1045|  4.76k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  4.76k|        }
 1055|  4.76k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|    799|    {
 1060|    799|        auto old_tail_size = pos.count();
 1061|    799|        auto new_tail_size = pos.index(last) + 1;
 1062|    799|        auto node          = pos.node();
 1063|    799|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 799]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|    799|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 320, False: 479]
  ------------------
 1065|    320|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 320, Folded]
  ------------------
 1066|    320|                node->inc();
 1067|    320|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    479|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 479]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    479|        } else {
 1073|    479|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    479|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 479]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    479|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    479|        }
 1078|    799|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  2.51k|    {
 1060|  2.51k|        auto old_tail_size = pos.count();
 1061|  2.51k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.51k|        auto node          = pos.node();
 1063|  2.51k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.51k, Folded]
  |  Branch (1063:42): [True: 979, False: 1.54k]
  ------------------
 1064|  2.51k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.58k, False: 939]
  ------------------
 1065|  1.58k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.58k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.58k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.58k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 462, False: 477]
  ------------------
 1069|    462|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    462|                              old_tail_size - new_tail_size);
 1071|    462|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    477|        } else {
 1073|    477|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    477|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 477, Folded]
  ------------------
 1075|    477|                pos.visit(dec_visitor{});
 1076|    477|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    477|        }
 1078|  2.51k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  4.74k|    {
  992|  4.74k|        auto idx    = pos.index(last);
  993|  4.74k|        auto node   = pos.node();
  994|  4.74k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 4.74k, Folded]
  |  Branch (994:35): [True: 4.17k, False: 570]
  ------------------
  995|  4.74k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 4.74k]
  |  Branch (995:25): [True: 0, False: 0]
  ------------------
  996|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 0]
  ------------------
  997|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|      0|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 0, Folded]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|      0|            return res;
 1001|  4.74k|        } else {
 1002|  4.74k|            using std::get;
 1003|  4.74k|            auto subs =
 1004|  4.74k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 4.17k, False: 570]
  ------------------
 1005|  4.74k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  4.74k|            auto next = get<1>(subs);
 1007|  4.74k|            auto ts   = get<2>(subs);
 1008|  4.74k|            auto tail = get<3>(subs);
 1009|  4.74k|            IMMER_TRY {
  ------------------
  |  |   49|  4.74k|#define IMMER_TRY try
  ------------------
 1010|  4.74k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 2.10k, False: 2.63k]
  ------------------
 1011|  2.10k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 1.85k, False: 249]
  ------------------
 1012|  1.85k|                        node->inner()[idx] = next;
 1013|  1.85k|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|  1.85k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|  1.85k|                    } else {
 1016|    249|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    249|                        newn->inner()[idx] = next;
 1018|    249|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 249, Folded]
  ------------------
 1019|    249|                            pos.visit(dec_visitor{});
 1020|    249|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    249|                    }
 1022|  2.63k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.09k, False: 1.53k]
  ------------------
 1023|  1.09k|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 1.09k, Folded]
  ------------------
 1024|  1.09k|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|  1.09k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.53k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 1.53k]
  |  Branch (1026:40): [True: 0, False: 0]
  |  Branch (1026:52): [True: 0, False: 0]
  ------------------
 1027|      0|                    auto newn = pos.node()->inner()[0];
 1028|      0|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 0, False: 0]
  ------------------
 1029|      0|                        newn->inc();
 1030|      0|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 0, Folded]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  1.53k|                } else {
 1034|  1.53k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 1.33k, False: 206]
  ------------------
 1035|  1.33k|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|  1.33k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  1.33k|                    } else {
 1038|    206|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    206|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 206, Folded]
  ------------------
 1040|    206|                            pos.visit(dec_visitor{});
 1041|    206|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    206|                    }
 1043|  1.53k|                }
 1044|  4.74k|            }
 1045|  4.74k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  4.74k|        }
 1055|  4.74k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  878|  1.09k|    {
  879|  1.09k|        using node_t = node_type<Pos>;
  880|  1.09k|        auto node    = p.node();
  881|  1.09k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 1.09k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  1.09k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  2.88k|    {
 1060|  2.88k|        auto old_tail_size = pos.count();
 1061|  2.88k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.88k|        auto node          = pos.node();
 1063|  2.88k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 2.88k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  2.88k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.03k, False: 1.85k]
  ------------------
 1065|  1.03k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 1.03k, Folded]
  ------------------
 1066|  1.03k|                node->inc();
 1067|  1.03k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.85k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 1.85k]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  1.85k|        } else {
 1073|  1.85k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  1.85k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 1.85k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  1.85k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  1.85k|        }
 1078|  2.88k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_11regular_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  2.85k|    {
  992|  2.85k|        auto idx    = pos.index(last);
  993|  2.85k|        auto node   = pos.node();
  994|  2.85k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 2.85k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  2.85k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 2.85k]
  |  Branch (995:25): [True: 0, False: 0]
  ------------------
  996|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 0]
  ------------------
  997|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|      0|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 0]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|      0|            return res;
 1001|  2.85k|        } else {
 1002|  2.85k|            using std::get;
 1003|  2.85k|            auto subs =
 1004|  2.85k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 2.85k]
  ------------------
 1005|  2.85k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  2.85k|            auto next = get<1>(subs);
 1007|  2.85k|            auto ts   = get<2>(subs);
 1008|  2.85k|            auto tail = get<3>(subs);
 1009|  2.85k|            IMMER_TRY {
  ------------------
  |  |   49|  2.85k|#define IMMER_TRY try
  ------------------
 1010|  2.85k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 925, False: 1.93k]
  ------------------
 1011|    925|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 925]
  ------------------
 1012|      0|                        node->inner()[idx] = next;
 1013|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    925|                    } else {
 1016|    925|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    925|                        newn->inner()[idx] = next;
 1018|    925|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 925]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    925|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    925|                    }
 1022|  1.93k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.03k, False: 898]
  ------------------
 1023|  1.03k|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 1.03k]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|  1.03k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.03k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 898]
  |  Branch (1026:40): [True: 0, False: 0]
  |  Branch (1026:52): [True: 0, False: 0]
  ------------------
 1027|      0|                    auto newn = pos.node()->inner()[0];
 1028|      0|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 0, False: 0]
  ------------------
 1029|      0|                        newn->inc();
 1030|      0|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 0]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    898|                } else {
 1034|    898|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 898]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    898|                    } else {
 1038|    898|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    898|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 898]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    898|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    898|                    }
 1043|    898|                }
 1044|  2.85k|            }
 1045|  2.85k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  2.85k|        }
 1055|  2.85k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  867|  45.6k|    {
  868|  45.6k|        using node_t = node_type<Pos>;
  869|  45.6k|        auto node    = p.node();
  870|  45.6k|        if (node->dec()) {
  ------------------
  |  Branch (870:13): [True: 0, False: 45.6k]
  ------------------
  871|      0|            p.each_right(dec_t{}, idx);
  872|      0|            node_t::delete_inner_r(node, p.count());
  873|      0|        }
  874|  45.6k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb1EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  4.69k|    {
 1060|  4.69k|        auto old_tail_size = pos.count();
 1061|  4.69k|        auto new_tail_size = pos.index(last) + 1;
 1062|  4.69k|        auto node          = pos.node();
 1063|  4.69k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 4.69k, Folded]
  |  Branch (1063:42): [True: 2.08k, False: 2.60k]
  ------------------
 1064|  4.69k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 2.73k, False: 1.95k]
  ------------------
 1065|  2.73k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 2.73k]
  ------------------
 1066|      0|                node->inc();
 1067|  2.73k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  2.73k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 1.02k, False: 937]
  ------------------
 1069|  1.02k|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|  1.02k|                              old_tail_size - new_tail_size);
 1071|  1.02k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  1.02k|        } else {
 1073|    937|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    937|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 937, Folded]
  ------------------
 1075|    937|                pos.visit(dec_visitor{});
 1076|    937|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    937|        }
 1078|  4.69k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb1EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  913|  11.3k|    {
  914|  11.3k|        auto idx    = pos.index(last);
  915|  11.3k|        auto node   = pos.node();
  916|  11.3k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [True: 11.3k, Folded]
  |  Branch (916:35): [True: 9.74k, False: 1.63k]
  ------------------
  917|  11.3k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [Folded, False: 11.3k]
  |  Branch (917:25): [True: 0, False: 0]
  ------------------
  918|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 0, False: 0]
  ------------------
  919|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|      0|            if (Mutating)
  ------------------
  |  Branch (920:17): [True: 0, Folded]
  ------------------
  921|      0|                pos.visit(dec_right_visitor{}, count_t{1});
  922|      0|            return res;
  923|  11.3k|        } else {
  924|  11.3k|            using std::get;
  925|  11.3k|            auto subs =
  926|  11.3k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 9.74k, False: 1.63k]
  ------------------
  927|  11.3k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  11.3k|            auto next = get<1>(subs);
  929|  11.3k|            auto ts   = get<2>(subs);
  930|  11.3k|            auto tail = get<3>(subs);
  931|  11.3k|            IMMER_TRY {
  ------------------
  |  |   49|  11.3k|#define IMMER_TRY try
  ------------------
  932|  11.3k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 6.34k, False: 5.03k]
  ------------------
  933|  6.34k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 5.48k, False: 856]
  ------------------
  934|  5.48k|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|  5.48k|                        pos.each_right(dec_visitor{}, idx + 1);
  936|  5.48k|                        node->inner()[idx] = next;
  937|  5.48k|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|  5.48k|                        nodr->d.count      = idx + 1;
  939|  5.48k|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 5.48k, False: 0]
  ------------------
  940|  5.48k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  5.48k|                    } else {
  942|    856|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|    856|                        auto newr = newn->relaxed();
  944|    856|                        newn->inner()[idx] = next;
  945|    856|                        newr->d.sizes[idx] = last + 1 - ts;
  946|    856|                        newr->d.count      = idx + 1;
  947|    856|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 856, False: 0]
  ------------------
  948|    856|                        if (Mutating)
  ------------------
  |  Branch (948:29): [True: 856, Folded]
  ------------------
  949|    856|                            pos.visit(dec_visitor{});
  950|    856|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|    856|                    }
  952|  6.34k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 1.35k, False: 3.67k]
  ------------------
  953|  1.35k|                    if (Mutating)
  ------------------
  |  Branch (953:25): [True: 1.35k, Folded]
  ------------------
  954|  1.35k|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|  1.35k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  3.67k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [Folded, False: 3.67k]
  |  Branch (956:40): [True: 0, False: 0]
  |  Branch (956:52): [True: 0, False: 0]
  ------------------
  957|      0|                    auto newn = pos.node()->inner()[0];
  958|      0|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 0, False: 0]
  ------------------
  959|      0|                        newn->inc();
  960|      0|                    if (Mutating)
  ------------------
  |  Branch (960:25): [True: 0, Folded]
  ------------------
  961|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|  3.67k|                } else {
  964|  3.67k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 3.08k, False: 591]
  ------------------
  965|  3.08k|                        pos.each_right(dec_visitor{}, idx + 1);
  966|  3.08k|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|  3.08k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  3.08k|                    } else {
  969|    591|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    591|                        if (Mutating)
  ------------------
  |  Branch (970:29): [True: 591, Folded]
  ------------------
  971|    591|                            pos.visit(dec_visitor{});
  972|    591|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    591|                    }
  974|  3.67k|                }
  975|  11.3k|            }
  976|  11.3k|            IMMER_CATCH (...) {
  977|      0|                assert(!mutate);
  ------------------
  |  Branch (977:17): [True: 0, False: 0]
  ------------------
  978|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  ------------------
  979|      0|                if (next)
  ------------------
  |  Branch (979:21): [True: 0, False: 0]
  ------------------
  980|      0|                    dec_inner(next,
  981|      0|                              pos.shift() - B,
  982|      0|                              last + 1 - ts - pos.size_before(idx));
  983|      0|                dec_leaf(tail, ts);
  984|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  985|      0|            }
  986|  11.3k|        }
  987|  11.3k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  3.41k|    {
  992|  3.41k|        auto idx    = pos.index(last);
  993|  3.41k|        auto node   = pos.node();
  994|  3.41k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 3.41k, Folded]
  |  Branch (994:35): [True: 2.26k, False: 1.14k]
  ------------------
  995|  3.41k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 3.41k]
  |  Branch (995:25): [True: 0, False: 0]
  ------------------
  996|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 0]
  ------------------
  997|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|      0|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 0, Folded]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|      0|            return res;
 1001|  3.41k|        } else {
 1002|  3.41k|            using std::get;
 1003|  3.41k|            auto subs =
 1004|  3.41k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 2.26k, False: 1.14k]
  ------------------
 1005|  3.41k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  3.41k|            auto next = get<1>(subs);
 1007|  3.41k|            auto ts   = get<2>(subs);
 1008|  3.41k|            auto tail = get<3>(subs);
 1009|  3.41k|            IMMER_TRY {
  ------------------
  |  |   49|  3.41k|#define IMMER_TRY try
  ------------------
 1010|  3.41k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 1.58k, False: 1.83k]
  ------------------
 1011|  1.58k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 1.11k, False: 463]
  ------------------
 1012|  1.11k|                        node->inner()[idx] = next;
 1013|  1.11k|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|  1.11k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|  1.11k|                    } else {
 1016|    463|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    463|                        newn->inner()[idx] = next;
 1018|    463|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 463, Folded]
  ------------------
 1019|    463|                            pos.visit(dec_visitor{});
 1020|    463|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    463|                    }
 1022|  1.83k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 712, False: 1.12k]
  ------------------
 1023|    712|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 712, Folded]
  ------------------
 1024|    712|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    712|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.12k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 1.12k]
  |  Branch (1026:40): [True: 0, False: 0]
  |  Branch (1026:52): [True: 0, False: 0]
  ------------------
 1027|      0|                    auto newn = pos.node()->inner()[0];
 1028|      0|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 0, False: 0]
  ------------------
 1029|      0|                        newn->inc();
 1030|      0|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 0, Folded]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  1.12k|                } else {
 1034|  1.12k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 488, False: 636]
  ------------------
 1035|    488|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    488|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    636|                    } else {
 1038|    636|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    636|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 636, Folded]
  ------------------
 1040|    636|                            pos.visit(dec_visitor{});
 1041|    636|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    636|                    }
 1043|  1.12k|                }
 1044|  3.41k|            }
 1045|  3.41k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  3.41k|        }
 1055|  3.41k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  878|  9.54k|    {
  879|  9.54k|        using node_t = node_type<Pos>;
  880|  9.54k|        auto node    = p.node();
  881|  9.54k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 9.54k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  9.54k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb0EE10visit_leafIRNS1_12leaf_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  6.19k|    {
 1060|  6.19k|        auto old_tail_size = pos.count();
 1061|  6.19k|        auto new_tail_size = pos.index(last) + 1;
 1062|  6.19k|        auto node          = pos.node();
 1063|  6.19k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 6.19k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  6.19k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.80k, False: 4.38k]
  ------------------
 1065|  1.80k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 1.80k, Folded]
  ------------------
 1066|  1.80k|                node->inc();
 1067|  1.80k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  4.38k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 4.38k]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  4.38k|        } else {
 1073|  4.38k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  4.38k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 4.38k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  4.38k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  4.38k|        }
 1078|  6.19k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb0EE13visit_relaxedIRNS1_11relaxed_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  913|  8.74k|    {
  914|  8.74k|        auto idx    = pos.index(last);
  915|  8.74k|        auto node   = pos.node();
  916|  8.74k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [Folded, False: 8.74k]
  |  Branch (916:35): [True: 0, False: 0]
  ------------------
  917|  8.74k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [Folded, False: 8.74k]
  |  Branch (917:25): [True: 0, False: 0]
  ------------------
  918|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 0, False: 0]
  ------------------
  919|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|      0|            if (Mutating)
  ------------------
  |  Branch (920:17): [Folded, False: 0]
  ------------------
  921|      0|                pos.visit(dec_right_visitor{}, count_t{1});
  922|      0|            return res;
  923|  8.74k|        } else {
  924|  8.74k|            using std::get;
  925|  8.74k|            auto subs =
  926|  8.74k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 0, False: 8.74k]
  ------------------
  927|  8.74k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  8.74k|            auto next = get<1>(subs);
  929|  8.74k|            auto ts   = get<2>(subs);
  930|  8.74k|            auto tail = get<3>(subs);
  931|  8.74k|            IMMER_TRY {
  ------------------
  |  |   49|  8.74k|#define IMMER_TRY try
  ------------------
  932|  8.74k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 3.29k, False: 5.45k]
  ------------------
  933|  3.29k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 0, False: 3.29k]
  ------------------
  934|      0|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|      0|                        pos.each_right(dec_visitor{}, idx + 1);
  936|      0|                        node->inner()[idx] = next;
  937|      0|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|      0|                        nodr->d.count      = idx + 1;
  939|      0|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 0, False: 0]
  ------------------
  940|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  3.29k|                    } else {
  942|  3.29k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  3.29k|                        auto newr = newn->relaxed();
  944|  3.29k|                        newn->inner()[idx] = next;
  945|  3.29k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  3.29k|                        newr->d.count      = idx + 1;
  947|  3.29k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 3.29k, False: 0]
  ------------------
  948|  3.29k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [Folded, False: 3.29k]
  ------------------
  949|      0|                            pos.visit(dec_visitor{});
  950|  3.29k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  3.29k|                    }
  952|  5.45k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 2.38k, False: 3.06k]
  ------------------
  953|  2.38k|                    if (Mutating)
  ------------------
  |  Branch (953:25): [Folded, False: 2.38k]
  ------------------
  954|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|  2.38k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  3.06k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [Folded, False: 3.06k]
  |  Branch (956:40): [True: 0, False: 0]
  |  Branch (956:52): [True: 0, False: 0]
  ------------------
  957|      0|                    auto newn = pos.node()->inner()[0];
  958|      0|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 0, False: 0]
  ------------------
  959|      0|                        newn->inc();
  960|      0|                    if (Mutating)
  ------------------
  |  Branch (960:25): [Folded, False: 0]
  ------------------
  961|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|  3.06k|                } else {
  964|  3.06k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 0, False: 3.06k]
  ------------------
  965|      0|                        pos.each_right(dec_visitor{}, idx + 1);
  966|      0|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  3.06k|                    } else {
  969|  3.06k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|  3.06k|                        if (Mutating)
  ------------------
  |  Branch (970:29): [Folded, False: 3.06k]
  ------------------
  971|      0|                            pos.visit(dec_visitor{});
  972|  3.06k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|  3.06k|                    }
  974|  3.06k|                }
  975|  8.74k|            }
  976|  8.74k|            IMMER_CATCH (...) {
  977|      0|                assert(!mutate);
  ------------------
  |  Branch (977:17): [True: 0, False: 0]
  ------------------
  978|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  ------------------
  979|      0|                if (next)
  ------------------
  |  Branch (979:21): [True: 0, False: 0]
  ------------------
  980|      0|                    dec_inner(next,
  981|      0|                              pos.shift() - B,
  982|      0|                              last + 1 - ts - pos.size_before(idx));
  983|      0|                dec_leaf(tail, ts);
  984|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  985|      0|            }
  986|  8.74k|        }
  987|  8.74k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  1.77k|    {
  992|  1.77k|        auto idx    = pos.index(last);
  993|  1.77k|        auto node   = pos.node();
  994|  1.77k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 1.77k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  1.77k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 1.77k]
  |  Branch (995:25): [True: 0, False: 0]
  ------------------
  996|      0|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 0]
  ------------------
  997|      0|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|      0|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 0]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|      0|            return res;
 1001|  1.77k|        } else {
 1002|  1.77k|            using std::get;
 1003|  1.77k|            auto subs =
 1004|  1.77k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 1.77k]
  ------------------
 1005|  1.77k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.77k|            auto next = get<1>(subs);
 1007|  1.77k|            auto ts   = get<2>(subs);
 1008|  1.77k|            auto tail = get<3>(subs);
 1009|  1.77k|            IMMER_TRY {
  ------------------
  |  |   49|  1.77k|#define IMMER_TRY try
  ------------------
 1010|  1.77k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 743, False: 1.03k]
  ------------------
 1011|    743|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 743]
  ------------------
 1012|      0|                        node->inner()[idx] = next;
 1013|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    743|                    } else {
 1016|    743|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    743|                        newn->inner()[idx] = next;
 1018|    743|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 743]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    743|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    743|                    }
 1022|  1.03k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 395, False: 636]
  ------------------
 1023|    395|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 395]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    395|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|    636|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 636]
  |  Branch (1026:40): [True: 0, False: 0]
  |  Branch (1026:52): [True: 0, False: 0]
  ------------------
 1027|      0|                    auto newn = pos.node()->inner()[0];
 1028|      0|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 0, False: 0]
  ------------------
 1029|      0|                        newn->inc();
 1030|      0|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 0]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    636|                } else {
 1034|    636|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 636]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    636|                    } else {
 1038|    636|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    636|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 636]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    636|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    636|                    }
 1043|    636|                }
 1044|  1.77k|            }
 1045|  1.77k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  1.77k|        }
 1055|  1.77k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  14.5k|    {
  992|  14.5k|        auto idx    = pos.index(last);
  993|  14.5k|        auto node   = pos.node();
  994|  14.5k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 14.5k, Folded]
  |  Branch (994:35): [True: 8.91k, False: 5.68k]
  ------------------
  995|  14.5k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 14.5k, Folded]
  |  Branch (995:25): [True: 6.85k, False: 7.73k]
  ------------------
  996|  6.85k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 3.86k, False: 2.99k]
  ------------------
  997|  6.85k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  6.85k|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 6.85k, Folded]
  ------------------
  999|  6.85k|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  6.85k|            return res;
 1001|  7.73k|        } else {
 1002|  7.73k|            using std::get;
 1003|  7.73k|            auto subs =
 1004|  7.73k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 5.05k, False: 2.68k]
  ------------------
 1005|  7.73k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  7.73k|            auto next = get<1>(subs);
 1007|  7.73k|            auto ts   = get<2>(subs);
 1008|  7.73k|            auto tail = get<3>(subs);
 1009|  7.73k|            IMMER_TRY {
  ------------------
  |  |   49|  7.73k|#define IMMER_TRY try
  ------------------
 1010|  7.73k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 3.76k, False: 3.97k]
  ------------------
 1011|  3.76k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 2.89k, False: 871]
  ------------------
 1012|  2.89k|                        node->inner()[idx] = next;
 1013|  2.89k|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|  2.89k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|  2.89k|                    } else {
 1016|    871|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    871|                        newn->inner()[idx] = next;
 1018|    871|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 871, Folded]
  ------------------
 1019|    871|                            pos.visit(dec_visitor{});
 1020|    871|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    871|                    }
 1022|  3.97k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 3.97k]
  ------------------
 1023|      0|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 0, Folded]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  3.97k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 3.97k, Folded]
  |  Branch (1026:40): [True: 3.38k, False: 585]
  |  Branch (1026:52): [True: 1.97k, False: 1.41k]
  ------------------
 1027|  1.97k|                    auto newn = pos.node()->inner()[0];
 1028|  1.97k|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 908, False: 1.06k]
  ------------------
 1029|    908|                        newn->inc();
 1030|  1.97k|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 1.97k, Folded]
  ------------------
 1031|  1.97k|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|  1.97k|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  1.99k|                } else {
 1034|  1.99k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 1.08k, False: 908]
  ------------------
 1035|  1.08k|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|  1.08k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  1.08k|                    } else {
 1038|    908|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    908|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 908, Folded]
  ------------------
 1040|    908|                            pos.visit(dec_visitor{});
 1041|    908|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    908|                    }
 1043|  1.99k|                }
 1044|  7.73k|            }
 1045|  7.73k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  7.73k|        }
 1055|  14.5k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_13full_leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|  1.37k|    {
 1060|  1.37k|        auto old_tail_size = pos.count();
 1061|  1.37k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.37k|        auto node          = pos.node();
 1063|  1.37k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 1.37k, Folded]
  |  Branch (1063:42): [True: 762, False: 612]
  ------------------
 1064|  1.37k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 388, False: 986]
  ------------------
 1065|    388|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 388]
  ------------------
 1066|      0|                node->inc();
 1067|    388|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    986|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 558, False: 428]
  ------------------
 1069|    558|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    558|                              old_tail_size - new_tail_size);
 1071|    558|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    558|        } else {
 1073|    428|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    428|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 428, Folded]
  ------------------
 1075|    428|                pos.visit(dec_visitor{});
 1076|    428|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    428|        }
 1078|  1.37k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  2.92k|    {
  992|  2.92k|        auto idx    = pos.index(last);
  993|  2.92k|        auto node   = pos.node();
  994|  2.92k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 2.92k, Folded]
  |  Branch (994:35): [True: 2.04k, False: 879]
  ------------------
  995|  2.92k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 2.92k, Folded]
  |  Branch (995:25): [True: 1.39k, False: 1.53k]
  ------------------
  996|  1.39k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 1.17k, False: 222]
  ------------------
  997|  1.39k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  1.39k|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 1.39k, Folded]
  ------------------
  999|  1.39k|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  1.39k|            return res;
 1001|  1.53k|        } else {
 1002|  1.53k|            using std::get;
 1003|  1.53k|            auto subs =
 1004|  1.53k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 874, False: 657]
  ------------------
 1005|  1.53k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.53k|            auto next = get<1>(subs);
 1007|  1.53k|            auto ts   = get<2>(subs);
 1008|  1.53k|            auto tail = get<3>(subs);
 1009|  1.53k|            IMMER_TRY {
  ------------------
  |  |   49|  1.53k|#define IMMER_TRY try
  ------------------
 1010|  1.53k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 626, False: 905]
  ------------------
 1011|    626|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 405, False: 221]
  ------------------
 1012|    405|                        node->inner()[idx] = next;
 1013|    405|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    405|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    405|                    } else {
 1016|    221|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    221|                        newn->inner()[idx] = next;
 1018|    221|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 221, Folded]
  ------------------
 1019|    221|                            pos.visit(dec_visitor{});
 1020|    221|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    221|                    }
 1022|    905|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 905]
  ------------------
 1023|      0|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 0, Folded]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|    905|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 905, Folded]
  |  Branch (1026:40): [True: 657, False: 248]
  |  Branch (1026:52): [True: 241, False: 416]
  ------------------
 1027|    241|                    auto newn = pos.node()->inner()[0];
 1028|    241|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 193, False: 48]
  ------------------
 1029|    193|                        newn->inc();
 1030|    241|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 241, Folded]
  ------------------
 1031|    241|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    241|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    664|                } else {
 1034|    664|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 421, False: 243]
  ------------------
 1035|    421|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    421|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    421|                    } else {
 1038|    243|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    243|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 243, Folded]
  ------------------
 1040|    243|                            pos.visit(dec_visitor{});
 1041|    243|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    243|                    }
 1043|    664|                }
 1044|  1.53k|            }
 1045|  1.53k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  1.53k|        }
 1055|  2.92k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE10visit_leafIRNS1_8leaf_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
 1059|    733|    {
 1060|    733|        auto old_tail_size = pos.count();
 1061|    733|        auto new_tail_size = pos.index(last) + 1;
 1062|    733|        auto node          = pos.node();
 1063|    733|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 733, Folded]
  |  Branch (1063:42): [True: 510, False: 223]
  ------------------
 1064|    733|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 260, False: 473]
  ------------------
 1065|    260|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 260]
  ------------------
 1066|      0|                node->inc();
 1067|    260|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    473|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 257, False: 216]
  ------------------
 1069|    257|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    257|                              old_tail_size - new_tail_size);
 1071|    257|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    257|        } else {
 1073|    216|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    216|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 216, Folded]
  ------------------
 1075|    216|                pos.visit(dec_visitor{});
 1076|    216|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    216|        }
 1078|    733|    }
_ZN5immer6detail4rbts16concat_trees_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EENSt3__15decayISE_E4type6node_t6edit_tESL_PSE_jSL_SM_jm:
 2498|  7.50k|{
 2499|  7.50k|    return make_singleton_regular_sub_pos(ltail, ltcount)
 2500|  7.50k|        .visit(concat_trees_left_mut_visitor<Node>{},
 2501|  7.50k|               ec,
 2502|  7.50k|               el,
 2503|  7.50k|               empty_leaf_pos<Node>{},
 2504|  7.50k|               er,
 2505|  7.50k|               rroot,
 2506|  7.50k|               rshift,
 2507|  7.50k|               rsize)
 2508|  7.50k|        .realize_e(ec);
 2509|  7.50k|}
_ZN5immer6detail4rbts29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_25singleton_regular_sub_posISC_EENS1_14empty_leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_DpOT1_:
 2451|  7.50k|    {
 2452|  7.50k|        return visit_maybe_relaxed_sub(args...,
 2453|  7.50k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|  7.50k|                                       ec,
 2455|  7.50k|                                       el,
 2456|  7.50k|                                       lpos,
 2457|  7.50k|                                       tpos,
 2458|  7.50k|                                       er);
 2459|  7.50k|    }
_ZN5immer6detail4rbts30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2432|  4.10k|    {
 2433|  4.10k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  4.10k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2333|  18.9k|{
 2334|  18.9k|    auto lshift = lpos.shift();
 2335|  18.9k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|  18.9k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 18.9k]
  ------------------
 2339|      0|        auto cpos = lpos.last_sub(
 2340|      0|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|      0|        return concat_rebalance_mut<Node>(
 2342|      0|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  18.9k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 15.1k, False: 3.83k]
  ------------------
 2344|  15.1k|        auto cpos = rpos.first_sub(
 2345|  15.1k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  15.1k|        return concat_rebalance_mut<Node>(
 2347|  15.1k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  15.1k|    } else {
 2349|  3.83k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 3.83k, False: 0]
  ------------------
 2350|  3.83k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 3.83k]
  |  Branch (2350:9): [True: 3.83k, False: 0]
  |  Branch (2350:9): [True: 3.83k, False: 0]
  ------------------
 2351|  3.83k|        auto cpos = lpos.last_sub(
 2352|  3.83k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  3.83k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  3.83k|    }
 2355|  18.9k|}
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2ENSA_5applyIS7_E4type4editEjPjjSH_PSC_:
 2040|   943k|        : ec_{ec}
 2041|   943k|        , curr_{counts}
 2042|   943k|        , n_{n}
 2043|   943k|        , result_{shift + B, nullptr, 0}
 2044|   943k|    {
 2045|   943k|        if (candidate) {
  ------------------
  |  Branch (2045:13): [True: 489k, False: 453k]
  ------------------
 2046|   489k|            candidate->ensure_mutable_relaxed_e(candidate_e, ec);
 2047|   489k|            result_.nodes_[0] = candidate;
 2048|   489k|        } else {
 2049|   453k|            result_.nodes_[0] = node_t::make_inner_r_e(ec);
 2050|   453k|        }
 2051|   943k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8each_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_DpOT0_:
 1512|   943k|    {
 1513|   943k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 121k, False: 821k]
  ------------------
 1514|   121k|            auto s = size_t{};
 1515|   479k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 358k, False: 121k]
  ------------------
 1516|   358k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   358k|                s = sizes_[i];
 1518|   358k|            }
 1519|   821k|        } else {
 1520|  1.99M|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 1.17M, False: 821k]
  ------------------
 1521|  1.17M|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|  1.17M|                    .visit(v, args...);
 1523|   821k|        }
 1524|   943k|    }
_ZN5immer6detail4rbts25concat_merger_mut_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17concat_merger_mutISE_EEEEvOT_RT0_NSt3__15decayISJ_E4type6node_t6edit_tE:
 2227|   626k|    {
 2228|   626k|        merger.merge_leaf(p, e);
 2229|   626k|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_NSA_5applyIS7_E4type4editE:
 2097|   626k|    {
 2098|   626k|        auto from       = p.node();
 2099|   626k|        auto from_size  = p.size();
 2100|   626k|        auto from_count = p.count();
 2101|   626k|        assert(from);
  ------------------
  |  Branch (2101:9): [True: 626k, False: 0]
  ------------------
 2102|   626k|        assert(from_size);
  ------------------
  |  Branch (2102:9): [True: 626k, False: 0]
  ------------------
 2103|   626k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2103:13): [True: 598k, False: 28.3k]
  |  Branch (2103:21): [True: 584k, False: 13.8k]
  ------------------
 2104|   584k|            add_child(from, from_size);
 2105|   584k|        } else {
 2106|  42.1k|            auto from_offset = count_t{};
 2107|  42.1k|            auto from_data   = from->leaf();
 2108|  42.1k|            auto from_mutate = from->can_mutate(e);
 2109|  55.7k|            do {
 2110|  55.7k|                if (!to_) {
  ------------------
  |  Branch (2110:21): [True: 27.4k, False: 28.3k]
  ------------------
 2111|  27.4k|                    if (from_mutate) {
  ------------------
  |  Branch (2111:25): [True: 2.98k, False: 24.4k]
  ------------------
 2112|  2.98k|                        node_t::ownee(from) = ec_;
 2113|  2.98k|                        to_                 = from->inc();
 2114|  2.98k|                        assert(from_count);
  ------------------
  |  Branch (2114:25): [True: 2.98k, False: 0]
  ------------------
 2115|  24.4k|                    } else {
 2116|  24.4k|                        to_ = node_t::make_leaf_e(ec_);
 2117|  24.4k|                    }
 2118|  27.4k|                    to_offset_ = 0;
 2119|  27.4k|                }
 2120|  55.7k|                auto data = to_->leaf();
 2121|  55.7k|                auto to_copy =
 2122|  55.7k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2123|  55.7k|                if (from == to_) {
  ------------------
  |  Branch (2123:21): [True: 2.98k, False: 52.7k]
  ------------------
 2124|  2.98k|                    if (from_offset != to_offset_)
  ------------------
  |  Branch (2124:25): [True: 390, False: 2.59k]
  ------------------
 2125|    390|                        std::move(from_data + from_offset,
 2126|    390|                                  from_data + from_offset + to_copy,
 2127|    390|                                  data + to_offset_);
 2128|  52.7k|                } else {
 2129|  52.7k|                    if (!from_mutate)
  ------------------
  |  Branch (2129:25): [True: 51.7k, False: 1.01k]
  ------------------
 2130|  51.7k|                        detail::uninitialized_copy(from_data + from_offset,
 2131|  51.7k|                                                   from_data + from_offset +
 2132|  51.7k|                                                       to_copy,
 2133|  51.7k|                                                   data + to_offset_);
 2134|  1.01k|                    else
 2135|  1.01k|                        detail::uninitialized_move(from_data + from_offset,
 2136|  1.01k|                                                   from_data + from_offset +
 2137|  1.01k|                                                       to_copy,
 2138|  1.01k|                                                   data + to_offset_);
 2139|  52.7k|                }
 2140|  55.7k|                to_offset_ += to_copy;
 2141|  55.7k|                from_offset += to_copy;
 2142|  55.7k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2142:21): [True: 27.4k, False: 28.3k]
  ------------------
 2143|  27.4k|                    add_child(to_, to_offset_);
 2144|  27.4k|                    to_ = nullptr;
 2145|  27.4k|                }
 2146|  55.7k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2146:22): [True: 13.5k, False: 42.1k]
  ------------------
 2147|  42.1k|        }
 2148|   626k|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9add_childEPSC_m:
 2064|  3.77M|    {
 2065|  3.77M|        assert(size);
  ------------------
  |  Branch (2065:9): [True: 3.77M, False: 0]
  ------------------
 2066|  3.77M|        ++curr_;
 2067|  3.77M|        auto parent  = result_.nodes_[result_.count_ - 1];
 2068|  3.77M|        auto relaxed = parent->relaxed();
 2069|  3.77M|        if (count_ == branches<B>) {
  ------------------
  |  Branch (2069:13): [True: 369k, False: 3.40M]
  ------------------
 2070|   369k|            parent->relaxed()->d.count = count_;
 2071|   369k|            assert(result_.count_ < result_t::max_children);
  ------------------
  |  Branch (2071:13): [True: 369k, False: 0]
  ------------------
 2072|   369k|            n_ -= branches<B>;
 2073|   369k|            if (candidate_) {
  ------------------
  |  Branch (2073:17): [True: 19.6k, False: 350k]
  ------------------
 2074|  19.6k|                parent = candidate_;
 2075|  19.6k|                parent->ensure_mutable_relaxed_e(candidate_e_, ec_);
 2076|  19.6k|                candidate_ = nullptr;
 2077|  19.6k|            } else
 2078|   350k|                parent = node_t::make_inner_r_e(ec_);
 2079|   369k|            count_                         = 0;
 2080|   369k|            relaxed                        = parent->relaxed();
 2081|   369k|            result_.nodes_[result_.count_] = parent;
 2082|   369k|            result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1];
 2083|   369k|            assert(result_.sizes_[result_.count_]);
  ------------------
  |  Branch (2083:13): [True: 369k, False: 0]
  ------------------
 2084|   369k|            ++result_.count_;
 2085|   369k|        }
 2086|  3.77M|        auto idx = count_++;
 2087|  3.77M|        result_.sizes_[result_.count_ - 1] += size;
 2088|  3.77M|        assert(size);
  ------------------
  |  Branch (2088:9): [True: 3.77M, False: 0]
  ------------------
 2089|  3.77M|        assert(result_.sizes_[result_.count_ - 1]);
  ------------------
  |  Branch (2089:9): [True: 3.77M, False: 0]
  ------------------
 2090|  3.77M|        relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0);
  ------------------
  |  Branch (2090:41): [True: 2.46M, False: 1.31M]
  ------------------
 2091|  3.77M|        assert(relaxed->d.sizes[idx]);
  ------------------
  |  Branch (2091:9): [True: 3.77M, False: 0]
  ------------------
 2092|  3.77M|        parent->inner()[idx] = p;
 2093|  3.77M|    };
_ZN5immer6detail4rbts25concat_merger_mut_visitor11visit_innerIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17concat_merger_mutISE_EEEEvOT_RT0_NSt3__15decayISJ_E4type6node_t6edit_tE:
 2221|  2.80M|    {
 2222|  2.80M|        merger.merge_inner(p, e);
 2223|  2.80M|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_NSA_5applyIS7_E4type4editE:
 2152|  2.80M|    {
 2153|  2.80M|        auto from       = p.node();
 2154|  2.80M|        auto from_size  = p.size();
 2155|  2.80M|        auto from_count = p.count();
 2156|  2.80M|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 2.80M, False: 0]
  ------------------
 2157|  2.80M|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 2.73M, False: 69.6k]
  |  Branch (2157:21): [True: 2.69M, False: 43.9k]
  ------------------
 2158|  2.69M|            add_child(from, from_size);
 2159|  2.69M|        } else {
 2160|   113k|            auto from_offset = count_t{};
 2161|   113k|            auto from_data   = from->inner();
 2162|   113k|            auto from_mutate = from->can_relax() && from->can_mutate(e);
  ------------------
  |  Branch (2162:32): [True: 113k, False: 0]
  |  Branch (2162:53): [True: 70.7k, False: 42.8k]
  ------------------
 2163|   137k|            do {
 2164|   137k|                if (!to_) {
  ------------------
  |  Branch (2164:21): [True: 67.7k, False: 69.6k]
  ------------------
 2165|  67.7k|                    if (from_mutate) {
  ------------------
  |  Branch (2165:25): [True: 46.8k, False: 20.8k]
  ------------------
 2166|  46.8k|                        node_t::ownee(from) = ec_;
 2167|  46.8k|                        from->ensure_mutable_relaxed_e(e, ec_);
 2168|  46.8k|                        to_ = from;
 2169|  46.8k|                    } else {
 2170|  20.8k|                        to_ = node_t::make_inner_r_e(ec_);
 2171|  20.8k|                    }
 2172|  67.7k|                    to_offset_ = 0;
 2173|  67.7k|                    to_size_   = 0;
 2174|  67.7k|                }
 2175|   137k|                auto data = to_->inner();
 2176|   137k|                auto to_copy =
 2177|   137k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2178|   137k|                auto sizes = to_->relaxed()->d.sizes;
 2179|   137k|                if (from != to_ || from_offset != to_offset_) {
  ------------------
  |  Branch (2179:21): [True: 90.5k, False: 46.8k]
  |  Branch (2179:36): [True: 19.4k, False: 27.4k]
  ------------------
 2180|   109k|                    std::copy(from_data + from_offset,
 2181|   109k|                              from_data + from_offset + to_copy,
 2182|   109k|                              data + to_offset_);
 2183|   109k|                    p.copy_sizes(
 2184|   109k|                        from_offset, to_copy, to_size_, sizes + to_offset_);
 2185|   109k|                }
 2186|   137k|                to_offset_ += to_copy;
 2187|   137k|                from_offset += to_copy;
 2188|   137k|                to_size_ = sizes[to_offset_ - 1];
 2189|   137k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2189:21): [True: 67.7k, False: 69.6k]
  ------------------
 2190|  67.7k|                    to_->relaxed()->d.count = to_offset_;
 2191|  67.7k|                    add_child(to_, to_size_);
 2192|  67.7k|                    to_ = nullptr;
 2193|  67.7k|                }
 2194|   137k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2194:22): [True: 23.8k, False: 113k]
  ------------------
 2195|   113k|        }
 2196|  2.80M|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13set_candidateENSA_5applyIS7_E4type4editEPSC_:
 2058|  46.6k|    {
 2059|  46.6k|        candidate_   = candidate;
 2060|  46.6k|        candidate_e_ = candidate_e;
 2061|  46.6k|    }
_ZNK5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6finishEv:
 2199|   943k|    {
 2200|   943k|        assert(!to_);
  ------------------
  |  Branch (2200:9): [True: 943k, False: 0]
  ------------------
 2201|   943k|        result_.nodes_[result_.count_ - 1]->relaxed()->d.count = count_;
 2202|   943k|        return result_;
 2203|   943k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2387|  14.8k|    {
 2388|  14.8k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  14.8k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2387|    275|    {
 2388|    275|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|    275|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2333|  3.67k|{
 2334|  3.67k|    auto lshift = lpos.shift();
 2335|  3.67k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|  3.67k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 3.67k]
  ------------------
 2339|      0|        auto cpos = lpos.last_sub(
 2340|      0|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|      0|        return concat_rebalance_mut<Node>(
 2342|      0|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  3.67k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 949, False: 2.72k]
  ------------------
 2344|    949|        auto cpos = rpos.first_sub(
 2345|    949|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    949|        return concat_rebalance_mut<Node>(
 2347|    949|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  2.72k|    } else {
 2349|  2.72k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 2.72k, False: 0]
  ------------------
 2350|  2.72k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 2.72k]
  |  Branch (2350:9): [True: 2.72k, False: 0]
  |  Branch (2350:9): [True: 2.72k, False: 0]
  ------------------
 2351|  2.72k|        auto cpos = lpos.last_sub(
 2352|  2.72k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  2.72k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  2.72k|    }
 2355|  3.67k|}
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2387|  1.65k|    {
 2388|  1.65k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  1.65k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2333|  1.65k|{
 2334|  1.65k|    auto lshift = lpos.shift();
 2335|  1.65k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|  1.65k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 1.65k]
  ------------------
 2339|      0|        auto cpos = lpos.last_sub(
 2340|      0|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|      0|        return concat_rebalance_mut<Node>(
 2342|      0|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  1.65k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 709, False: 949]
  ------------------
 2344|    709|        auto cpos = rpos.first_sub(
 2345|    709|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    709|        return concat_rebalance_mut<Node>(
 2347|    709|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|    949|    } else {
 2349|    949|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 949, False: 0]
  ------------------
 2350|    949|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 949]
  |  Branch (2350:9): [True: 949, False: 0]
  |  Branch (2350:9): [True: 949, False: 0]
  ------------------
 2351|    949|        auto cpos = lpos.last_sub(
 2352|    949|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|    949|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|    949|    }
 2355|  1.65k|}
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSE_IT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2280|  1.22k|{
 2281|  1.22k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  1.22k|    plan.fill(lpos, cpos, rpos);
 2283|  1.22k|    plan.shuffle(cpos.shift());
 2284|  1.22k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  1.22k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_8full_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEENSS_6edit_tESU_OT_OSP_SU_OT1_:
 2244|  1.22k|    {
 2245|  1.22k|        using node_t    = node_type<CPos>;
 2246|  1.22k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  1.22k|        using visitor_t = concat_merger_mut_visitor;
 2248|  1.22k|        auto lnode      = ((node_t*) lpos.node());
 2249|  1.22k|        auto rnode      = ((node_t*) rpos.node());
 2250|  1.22k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 1.22k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  1.22k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 1.22k, False: 0]
  |  Branch (2251:36): [True: 1.22k, False: 0]
  |  Branch (2251:58): [True: 228, False: 999]
  ------------------
 2252|  1.22k|        auto merger     = merger_t{ec,
 2253|  1.22k|                               cpos.shift(),
 2254|  1.22k|                               this->counts,
 2255|  1.22k|                               this->n,
 2256|  1.22k|                               el,
 2257|  1.22k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 1.22k]
  ------------------
 2258|  1.22k|        IMMER_TRY {
  ------------------
  |  |   49|  1.22k|#define IMMER_TRY try
  ------------------
 2259|  1.22k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  1.22k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  1.22k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 228, False: 999]
  ------------------
 2262|    228|                merger.set_candidate(er, rnode);
 2263|  1.22k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  1.22k|            return merger.finish();
 2265|  1.22k|        }
 2266|  1.22k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  1.22k|    }
_ZN5immer6detail4rbts25concat_merger_mut_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17concat_merger_mutISE_EEEEvOT_RT0_NSt3__15decayISJ_E4type6node_t6edit_tE:
 2227|  96.4k|    {
 2228|  96.4k|        merger.merge_leaf(p, e);
 2229|  96.4k|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_NSA_5applyIS7_E4type4editE:
 2097|  96.4k|    {
 2098|  96.4k|        auto from       = p.node();
 2099|  96.4k|        auto from_size  = p.size();
 2100|  96.4k|        auto from_count = p.count();
 2101|  96.4k|        assert(from);
  ------------------
  |  Branch (2101:9): [True: 96.4k, False: 0]
  ------------------
 2102|  96.4k|        assert(from_size);
  ------------------
  |  Branch (2102:9): [True: 96.4k, False: 0]
  ------------------
 2103|  96.4k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2103:13): [True: 96.4k, False: 0]
  |  Branch (2103:21): [True: 96.4k, False: 0]
  ------------------
 2104|  96.4k|            add_child(from, from_size);
 2105|  96.4k|        } else {
 2106|      0|            auto from_offset = count_t{};
 2107|      0|            auto from_data   = from->leaf();
 2108|      0|            auto from_mutate = from->can_mutate(e);
 2109|      0|            do {
 2110|      0|                if (!to_) {
  ------------------
  |  Branch (2110:21): [True: 0, False: 0]
  ------------------
 2111|      0|                    if (from_mutate) {
  ------------------
  |  Branch (2111:25): [True: 0, False: 0]
  ------------------
 2112|      0|                        node_t::ownee(from) = ec_;
 2113|      0|                        to_                 = from->inc();
 2114|      0|                        assert(from_count);
  ------------------
  |  Branch (2114:25): [True: 0, False: 0]
  ------------------
 2115|      0|                    } else {
 2116|      0|                        to_ = node_t::make_leaf_e(ec_);
 2117|      0|                    }
 2118|      0|                    to_offset_ = 0;
 2119|      0|                }
 2120|      0|                auto data = to_->leaf();
 2121|      0|                auto to_copy =
 2122|      0|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2123|      0|                if (from == to_) {
  ------------------
  |  Branch (2123:21): [True: 0, False: 0]
  ------------------
 2124|      0|                    if (from_offset != to_offset_)
  ------------------
  |  Branch (2124:25): [True: 0, False: 0]
  ------------------
 2125|      0|                        std::move(from_data + from_offset,
 2126|      0|                                  from_data + from_offset + to_copy,
 2127|      0|                                  data + to_offset_);
 2128|      0|                } else {
 2129|      0|                    if (!from_mutate)
  ------------------
  |  Branch (2129:25): [True: 0, False: 0]
  ------------------
 2130|      0|                        detail::uninitialized_copy(from_data + from_offset,
 2131|      0|                                                   from_data + from_offset +
 2132|      0|                                                       to_copy,
 2133|      0|                                                   data + to_offset_);
 2134|      0|                    else
 2135|      0|                        detail::uninitialized_move(from_data + from_offset,
 2136|      0|                                                   from_data + from_offset +
 2137|      0|                                                       to_copy,
 2138|      0|                                                   data + to_offset_);
 2139|      0|                }
 2140|      0|                to_offset_ += to_copy;
 2141|      0|                from_offset += to_copy;
 2142|      0|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2142:21): [True: 0, False: 0]
  ------------------
 2143|      0|                    add_child(to_, to_offset_);
 2144|      0|                    to_ = nullptr;
 2145|      0|                }
 2146|      0|            } while (from_offset != from_count);
  ------------------
  |  Branch (2146:22): [True: 0, False: 0]
  ------------------
 2147|      0|        }
 2148|  96.4k|    }
_ZN5immer6detail4rbts25concat_merger_mut_visitor11visit_innerIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17concat_merger_mutISE_EEEEvOT_RT0_NSt3__15decayISJ_E4type6node_t6edit_tE:
 2221|   207k|    {
 2222|   207k|        merger.merge_inner(p, e);
 2223|   207k|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_NSA_5applyIS7_E4type4editE:
 2152|   207k|    {
 2153|   207k|        auto from       = p.node();
 2154|   207k|        auto from_size  = p.size();
 2155|   207k|        auto from_count = p.count();
 2156|   207k|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 207k, False: 0]
  ------------------
 2157|   207k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 207k, False: 0]
  |  Branch (2157:21): [True: 207k, False: 0]
  ------------------
 2158|   207k|            add_child(from, from_size);
 2159|   207k|        } else {
 2160|      0|            auto from_offset = count_t{};
 2161|      0|            auto from_data   = from->inner();
 2162|      0|            auto from_mutate = from->can_relax() && from->can_mutate(e);
  ------------------
  |  Branch (2162:32): [True: 0, False: 0]
  |  Branch (2162:53): [True: 0, False: 0]
  ------------------
 2163|      0|            do {
 2164|      0|                if (!to_) {
  ------------------
  |  Branch (2164:21): [True: 0, False: 0]
  ------------------
 2165|      0|                    if (from_mutate) {
  ------------------
  |  Branch (2165:25): [True: 0, False: 0]
  ------------------
 2166|      0|                        node_t::ownee(from) = ec_;
 2167|      0|                        from->ensure_mutable_relaxed_e(e, ec_);
 2168|      0|                        to_ = from;
 2169|      0|                    } else {
 2170|      0|                        to_ = node_t::make_inner_r_e(ec_);
 2171|      0|                    }
 2172|      0|                    to_offset_ = 0;
 2173|      0|                    to_size_   = 0;
 2174|      0|                }
 2175|      0|                auto data = to_->inner();
 2176|      0|                auto to_copy =
 2177|      0|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2178|      0|                auto sizes = to_->relaxed()->d.sizes;
 2179|      0|                if (from != to_ || from_offset != to_offset_) {
  ------------------
  |  Branch (2179:21): [True: 0, False: 0]
  |  Branch (2179:36): [True: 0, False: 0]
  ------------------
 2180|      0|                    std::copy(from_data + from_offset,
 2181|      0|                              from_data + from_offset + to_copy,
 2182|      0|                              data + to_offset_);
 2183|      0|                    p.copy_sizes(
 2184|      0|                        from_offset, to_copy, to_size_, sizes + to_offset_);
 2185|      0|                }
 2186|      0|                to_offset_ += to_copy;
 2187|      0|                from_offset += to_copy;
 2188|      0|                to_size_ = sizes[to_offset_ - 1];
 2189|      0|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2189:21): [True: 0, False: 0]
  ------------------
 2190|      0|                    to_->relaxed()->d.count = to_offset_;
 2191|      0|                    add_child(to_, to_size_);
 2192|      0|                    to_ = nullptr;
 2193|      0|                }
 2194|      0|            } while (from_offset != from_count);
  ------------------
  |  Branch (2194:22): [True: 0, False: 0]
  ------------------
 2195|      0|        }
 2196|   207k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|    949|    {
 2417|    949|        return rpos.first_sub_leaf(
 2418|    949|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|    949|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2394|  3.67k|    {
 2395|  3.67k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  3.67k|    }
_ZN5immer6detail4rbts16concat_leafs_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2294|  3.67k|{
 2295|  3.67k|    static_assert(Node::bits >= 2, "");
 2296|  3.67k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 3.67k, False: 0]
  ------------------
 2297|  3.67k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 3.67k, False: 0]
  ------------------
 2298|  3.67k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 3.67k, False: 0]
  ------------------
 2299|  3.67k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 0, False: 3.67k]
  ------------------
 2300|      0|        return {
 2301|      0|            Node::bits_leaf,
 2302|      0|            lpos.node(),
 2303|      0|            lpos.count(),
 2304|      0|            tpos.node(),
 2305|      0|            tpos.count(),
 2306|      0|            rpos.node(),
 2307|      0|            rpos.count(),
 2308|      0|        };
 2309|  3.67k|    else
 2310|  3.67k|        return {
 2311|  3.67k|            Node::bits_leaf,
 2312|  3.67k|            lpos.node(),
 2313|  3.67k|            lpos.count(),
 2314|  3.67k|            rpos.node(),
 2315|  3.67k|            rpos.count(),
 2316|  3.67k|        };
 2317|  3.67k|}
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|    949|{
 2281|    949|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|    949|    plan.fill(lpos, cpos, rpos);
 2283|    949|    plan.shuffle(cpos.shift());
 2284|    949|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|    949|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEENST_6edit_tESV_OT_OSQ_SV_OT1_:
 2244|    949|    {
 2245|    949|        using node_t    = node_type<CPos>;
 2246|    949|        using merger_t  = concat_merger_mut<node_t>;
 2247|    949|        using visitor_t = concat_merger_mut_visitor;
 2248|    949|        auto lnode      = ((node_t*) lpos.node());
 2249|    949|        auto rnode      = ((node_t*) rpos.node());
 2250|    949|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 949]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|    949|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 949, False: 0]
  |  Branch (2251:36): [True: 949, False: 0]
  |  Branch (2251:58): [True: 330, False: 619]
  ------------------
 2252|    949|        auto merger     = merger_t{ec,
 2253|    949|                               cpos.shift(),
 2254|    949|                               this->counts,
 2255|    949|                               this->n,
 2256|    949|                               el,
 2257|    949|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 949]
  ------------------
 2258|    949|        IMMER_TRY {
  ------------------
  |  |   49|    949|#define IMMER_TRY try
  ------------------
 2259|    949|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|    949|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|    949|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 330, False: 619]
  ------------------
 2262|    330|                merger.set_candidate(er, rnode);
 2263|    949|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|    949|            return merger.finish();
 2265|    949|        }
 2266|    949|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|    949|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSE_IT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2280|  2.22k|{
 2281|  2.22k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.22k|    plan.fill(lpos, cpos, rpos);
 2283|  2.22k|    plan.shuffle(cpos.shift());
 2284|  2.22k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.22k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEENSS_6edit_tESU_OT_OSP_SU_OT1_:
 2244|  2.22k|    {
 2245|  2.22k|        using node_t    = node_type<CPos>;
 2246|  2.22k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.22k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.22k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.22k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.22k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 2.22k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  2.22k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.22k, False: 0]
  |  Branch (2251:36): [True: 2.22k, False: 0]
  |  Branch (2251:58): [True: 389, False: 1.84k]
  ------------------
 2252|  2.22k|        auto merger     = merger_t{ec,
 2253|  2.22k|                               cpos.shift(),
 2254|  2.22k|                               this->counts,
 2255|  2.22k|                               this->n,
 2256|  2.22k|                               el,
 2257|  2.22k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 2.22k]
  ------------------
 2258|  2.22k|        IMMER_TRY {
  ------------------
  |  |   49|  2.22k|#define IMMER_TRY try
  ------------------
 2259|  2.22k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.22k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.22k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 389, False: 1.84k]
  ------------------
 2262|    389|                merger.set_candidate(er, rnode);
 2263|  2.22k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.22k|            return merger.finish();
 2265|  2.22k|        }
 2266|  2.22k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.22k|    }
_ZN5immer6detail4rbts25concat_merger_mut_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17concat_merger_mutISE_EEEEvOT_RT0_NSt3__15decayISJ_E4type6node_t6edit_tE:
 2221|  98.1k|    {
 2222|  98.1k|        merger.merge_inner(p, e);
 2223|  98.1k|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_NSA_5applyIS7_E4type4editE:
 2152|  98.1k|    {
 2153|  98.1k|        auto from       = p.node();
 2154|  98.1k|        auto from_size  = p.size();
 2155|  98.1k|        auto from_count = p.count();
 2156|  98.1k|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 98.1k, False: 0]
  ------------------
 2157|  98.1k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 96.4k, False: 1.69k]
  |  Branch (2157:21): [True: 96.4k, False: 0]
  ------------------
 2158|  96.4k|            add_child(from, from_size);
 2159|  96.4k|        } else {
 2160|  1.69k|            auto from_offset = count_t{};
 2161|  1.69k|            auto from_data   = from->inner();
 2162|  1.69k|            auto from_mutate = from->can_relax() && from->can_mutate(e);
  ------------------
  |  Branch (2162:32): [True: 1.69k, False: 0]
  |  Branch (2162:53): [True: 195, False: 1.50k]
  ------------------
 2163|  3.39k|            do {
 2164|  3.39k|                if (!to_) {
  ------------------
  |  Branch (2164:21): [True: 1.69k, False: 1.69k]
  ------------------
 2165|  1.69k|                    if (from_mutate) {
  ------------------
  |  Branch (2165:25): [True: 195, False: 1.50k]
  ------------------
 2166|    195|                        node_t::ownee(from) = ec_;
 2167|    195|                        from->ensure_mutable_relaxed_e(e, ec_);
 2168|    195|                        to_ = from;
 2169|  1.50k|                    } else {
 2170|  1.50k|                        to_ = node_t::make_inner_r_e(ec_);
 2171|  1.50k|                    }
 2172|  1.69k|                    to_offset_ = 0;
 2173|  1.69k|                    to_size_   = 0;
 2174|  1.69k|                }
 2175|  3.39k|                auto data = to_->inner();
 2176|  3.39k|                auto to_copy =
 2177|  3.39k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2178|  3.39k|                auto sizes = to_->relaxed()->d.sizes;
 2179|  3.39k|                if (from != to_ || from_offset != to_offset_) {
  ------------------
  |  Branch (2179:21): [True: 3.20k, False: 195]
  |  Branch (2179:36): [True: 195, False: 0]
  ------------------
 2180|  3.39k|                    std::copy(from_data + from_offset,
 2181|  3.39k|                              from_data + from_offset + to_copy,
 2182|  3.39k|                              data + to_offset_);
 2183|  3.39k|                    p.copy_sizes(
 2184|  3.39k|                        from_offset, to_copy, to_size_, sizes + to_offset_);
 2185|  3.39k|                }
 2186|  3.39k|                to_offset_ += to_copy;
 2187|  3.39k|                from_offset += to_copy;
 2188|  3.39k|                to_size_ = sizes[to_offset_ - 1];
 2189|  3.39k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2189:21): [True: 1.69k, False: 1.69k]
  ------------------
 2190|  1.69k|                    to_->relaxed()->d.count = to_offset_;
 2191|  1.69k|                    add_child(to_, to_size_);
 2192|  1.69k|                    to_ = nullptr;
 2193|  1.69k|                }
 2194|  3.39k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2194:22): [True: 1.69k, False: 1.69k]
  ------------------
 2195|  1.69k|        }
 2196|  98.1k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|  2.72k|    {
 2417|  2.72k|        return rpos.first_sub_leaf(
 2418|  2.72k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  2.72k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_OT1_SS_:
 2394|  3.83k|    {
 2395|  3.83k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  3.83k|    }
_ZN5immer6detail4rbts16concat_leafs_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESF_EENS1_17concat_center_posIT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2294|  3.83k|{
 2295|  3.83k|    static_assert(Node::bits >= 2, "");
 2296|  3.83k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 3.83k, False: 0]
  ------------------
 2297|  3.83k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 3.83k, False: 0]
  ------------------
 2298|  3.83k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 3.83k, False: 0]
  ------------------
 2299|  3.83k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 0, False: 3.83k]
  ------------------
 2300|      0|        return {
 2301|      0|            Node::bits_leaf,
 2302|      0|            lpos.node(),
 2303|      0|            lpos.count(),
 2304|      0|            tpos.node(),
 2305|      0|            tpos.count(),
 2306|      0|            rpos.node(),
 2307|      0|            rpos.count(),
 2308|      0|        };
 2309|  3.83k|    else
 2310|  3.83k|        return {
 2311|  3.83k|            Node::bits_leaf,
 2312|  3.83k|            lpos.node(),
 2313|  3.83k|            lpos.count(),
 2314|  3.83k|            rpos.node(),
 2315|  3.83k|            rpos.count(),
 2316|  3.83k|        };
 2317|  3.83k|}
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  2.72k|{
 2281|  2.72k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.72k|    plan.fill(lpos, cpos, rpos);
 2283|  2.72k|    plan.shuffle(cpos.shift());
 2284|  2.72k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.72k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEENST_6edit_tESV_OT_OSQ_SV_OT1_:
 2244|  2.72k|    {
 2245|  2.72k|        using node_t    = node_type<CPos>;
 2246|  2.72k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.72k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.72k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.72k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.72k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 2.72k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  2.72k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.72k, False: 0]
  |  Branch (2251:36): [True: 2.72k, False: 0]
  |  Branch (2251:58): [True: 376, False: 2.34k]
  ------------------
 2252|  2.72k|        auto merger     = merger_t{ec,
 2253|  2.72k|                               cpos.shift(),
 2254|  2.72k|                               this->counts,
 2255|  2.72k|                               this->n,
 2256|  2.72k|                               el,
 2257|  2.72k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 2.72k]
  ------------------
 2258|  2.72k|        IMMER_TRY {
  ------------------
  |  |   49|  2.72k|#define IMMER_TRY try
  ------------------
 2259|  2.72k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.72k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.72k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 376, False: 2.34k]
  ------------------
 2262|    376|                merger.set_candidate(er, rnode);
 2263|  2.72k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.72k|            return merger.finish();
 2265|  2.72k|        }
 2266|  2.72k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.72k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSE_IT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2280|  69.5k|{
 2281|  69.5k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  69.5k|    plan.fill(lpos, cpos, rpos);
 2283|  69.5k|    plan.shuffle(cpos.shift());
 2284|  69.5k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  69.5k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_11relaxed_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEENSS_6edit_tESU_OT_OSP_SU_OT1_:
 2244|  69.5k|    {
 2245|  69.5k|        using node_t    = node_type<CPos>;
 2246|  69.5k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  69.5k|        using visitor_t = concat_merger_mut_visitor;
 2248|  69.5k|        auto lnode      = ((node_t*) lpos.node());
 2249|  69.5k|        auto rnode      = ((node_t*) rpos.node());
 2250|  69.5k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 69.5k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  69.5k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 69.5k, False: 0]
  |  Branch (2251:36): [True: 69.5k, False: 0]
  |  Branch (2251:58): [True: 28.3k, False: 41.2k]
  ------------------
 2252|  69.5k|        auto merger     = merger_t{ec,
 2253|  69.5k|                               cpos.shift(),
 2254|  69.5k|                               this->counts,
 2255|  69.5k|                               this->n,
 2256|  69.5k|                               el,
 2257|  69.5k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 69.5k]
  ------------------
 2258|  69.5k|        IMMER_TRY {
  ------------------
  |  |   49|  69.5k|#define IMMER_TRY try
  ------------------
 2259|  69.5k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  69.5k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  69.5k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 28.3k, False: 41.2k]
  ------------------
 2262|  28.3k|                merger.set_candidate(er, rnode);
 2263|  69.5k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  69.5k|            return merger.finish();
 2265|  69.5k|        }
 2266|  69.5k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  69.5k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|  3.83k|    {
 2417|  3.83k|        return rpos.first_sub_leaf(
 2418|  3.83k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  3.83k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_25singleton_regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  3.83k|{
 2281|  3.83k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  3.83k|    plan.fill(lpos, cpos, rpos);
 2283|  3.83k|    plan.shuffle(cpos.shift());
 2284|  3.83k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  3.83k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEENST_6edit_tESV_OT_OSQ_SV_OT1_:
 2244|  3.83k|    {
 2245|  3.83k|        using node_t    = node_type<CPos>;
 2246|  3.83k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  3.83k|        using visitor_t = concat_merger_mut_visitor;
 2248|  3.83k|        auto lnode      = ((node_t*) lpos.node());
 2249|  3.83k|        auto rnode      = ((node_t*) rpos.node());
 2250|  3.83k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 3.83k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  3.83k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 3.83k, False: 0]
  |  Branch (2251:36): [True: 3.83k, False: 0]
  |  Branch (2251:58): [True: 1.86k, False: 1.96k]
  ------------------
 2252|  3.83k|        auto merger     = merger_t{ec,
 2253|  3.83k|                               cpos.shift(),
 2254|  3.83k|                               this->counts,
 2255|  3.83k|                               this->n,
 2256|  3.83k|                               el,
 2257|  3.83k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 3.83k]
  ------------------
 2258|  3.83k|        IMMER_TRY {
  ------------------
  |  |   49|  3.83k|#define IMMER_TRY try
  ------------------
 2259|  3.83k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  3.83k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  3.83k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 1.86k, False: 1.96k]
  ------------------
 2262|  1.86k|                merger.set_candidate(er, rnode);
 2263|  3.83k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  3.83k|            return merger.finish();
 2265|  3.83k|        }
 2266|  3.83k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  3.83k|    }
_ZN5immer6detail4rbts30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2432|  3.39k|    {
 2433|  3.39k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.39k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9realize_eENSA_5applyIS7_E4type4editE:
 1548|   121k|    {
 1549|   121k|        if (count_ > 1) {
  ------------------
  |  Branch (1549:13): [True: 12.2k, False: 109k]
  ------------------
 1550|  12.2k|            auto result = node_t::make_inner_r_e(e);
 1551|  12.2k|            auto r      = result->relaxed();
 1552|  12.2k|            r->d.count  = count_;
 1553|  12.2k|            std::copy(nodes_, nodes_ + count_, result->inner());
 1554|  12.2k|            std::copy(sizes_, sizes_ + count_, r->d.sizes);
 1555|  12.2k|            return {result, shift_, r};
 1556|   109k|        } else {
 1557|   109k|            assert(shift_ >= B + BL);
  ------------------
  |  Branch (1557:13): [True: 109k, False: 0]
  ------------------
 1558|   109k|            return {nodes_[0], shift_ - B, nodes_[0]->relaxed()};
 1559|   109k|        }
 1560|   121k|    }
_ZN5immer6detail4rbts16concat_trees_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EENSt3__15decayISE_E4type6node_t6edit_tESL_PSE_jmSM_jSL_SM_jm:
 2474|   114k|{
 2475|   114k|    return visit_maybe_relaxed_sub(lroot,
 2476|   114k|                                   lshift,
 2477|   114k|                                   lsize,
 2478|   114k|                                   concat_trees_left_mut_visitor<Node>{},
 2479|   114k|                                   ec,
 2480|   114k|                                   el,
 2481|   114k|                                   make_leaf_pos(ltail, ltcount),
 2482|   114k|                                   er,
 2483|   114k|                                   rroot,
 2484|   114k|                                   rshift,
 2485|   114k|                                   rsize)
 2486|   114k|        .realize_e(ec);
 2487|   114k|}
_ZN5immer6detail4rbts29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_DpOT1_:
 2451|   108k|    {
 2452|   108k|        return visit_maybe_relaxed_sub(args...,
 2453|   108k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|   108k|                                       ec,
 2455|   108k|                                       el,
 2456|   108k|                                       lpos,
 2457|   108k|                                       tpos,
 2458|   108k|                                       er);
 2459|   108k|    }
_ZN5immer6detail4rbts30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_OT1_SS_:
 2432|  70.5k|    {
 2433|  70.5k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  70.5k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2333|   501k|{
 2334|   501k|    auto lshift = lpos.shift();
 2335|   501k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|   501k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 195k, False: 306k]
  ------------------
 2339|   195k|        auto cpos = lpos.last_sub(
 2340|   195k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|   195k|        return concat_rebalance_mut<Node>(
 2342|   195k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   306k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 46.0k, False: 260k]
  ------------------
 2344|  46.0k|        auto cpos = rpos.first_sub(
 2345|  46.0k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  46.0k|        return concat_rebalance_mut<Node>(
 2347|  46.0k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|   260k|    } else {
 2349|   260k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 260k, False: 0]
  ------------------
 2350|   260k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 260k]
  |  Branch (2350:9): [True: 260k, False: 0]
  |  Branch (2350:9): [True: 260k, False: 0]
  ------------------
 2351|   260k|        auto cpos = lpos.last_sub(
 2352|   260k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|   260k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|   260k|    }
 2355|   501k|}
_ZN5immer6detail4rbts23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_SS_OT1_:
 2366|   193k|    {
 2367|   193k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|   193k|    }
_ZN5immer6detail4rbts23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2366|  4.40k|    {
 2367|  4.40k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|  4.40k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2333|   129k|{
 2334|   129k|    auto lshift = lpos.shift();
 2335|   129k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|   129k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 2.51k, False: 126k]
  ------------------
 2339|  2.51k|        auto cpos = lpos.last_sub(
 2340|  2.51k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|  2.51k|        return concat_rebalance_mut<Node>(
 2342|  2.51k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   126k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 8.39k, False: 118k]
  ------------------
 2344|  8.39k|        auto cpos = rpos.first_sub(
 2345|  8.39k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  8.39k|        return concat_rebalance_mut<Node>(
 2347|  8.39k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|   118k|    } else {
 2349|   118k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 118k, False: 0]
  ------------------
 2350|   118k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 118k]
  |  Branch (2350:9): [True: 118k, False: 0]
  |  Branch (2350:9): [True: 118k, False: 0]
  ------------------
 2351|   118k|        auto cpos = lpos.last_sub(
 2352|   118k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|   118k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|   118k|    }
 2355|   129k|}
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2280|  4.40k|{
 2281|  4.40k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  4.40k|    plan.fill(lpos, cpos, rpos);
 2283|  4.40k|    plan.shuffle(cpos.shift());
 2284|  4.40k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  4.40k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEENSS_6edit_tESU_OT_OSP_SU_OT1_:
 2244|  4.40k|    {
 2245|  4.40k|        using node_t    = node_type<CPos>;
 2246|  4.40k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  4.40k|        using visitor_t = concat_merger_mut_visitor;
 2248|  4.40k|        auto lnode      = ((node_t*) lpos.node());
 2249|  4.40k|        auto rnode      = ((node_t*) rpos.node());
 2250|  4.40k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 4.40k, False: 0]
  |  Branch (2250:36): [True: 4.40k, False: 0]
  |  Branch (2250:58): [True: 638, False: 3.76k]
  ------------------
 2251|  4.40k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 0, False: 4.40k]
  |  Branch (2251:36): [True: 0, False: 0]
  |  Branch (2251:58): [True: 0, False: 0]
  ------------------
 2252|  4.40k|        auto merger     = merger_t{ec,
 2253|  4.40k|                               cpos.shift(),
 2254|  4.40k|                               this->counts,
 2255|  4.40k|                               this->n,
 2256|  4.40k|                               el,
 2257|  4.40k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 638, False: 3.76k]
  ------------------
 2258|  4.40k|        IMMER_TRY {
  ------------------
  |  |   49|  4.40k|#define IMMER_TRY try
  ------------------
 2259|  4.40k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  4.40k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  4.40k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 0, False: 4.40k]
  ------------------
 2262|      0|                merger.set_candidate(er, rnode);
 2263|  4.40k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  4.40k|            return merger.finish();
 2265|  4.40k|        }
 2266|  4.40k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  4.40k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2387|   121k|    {
 2388|   121k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|   121k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_OT1_SS_:
 2387|  3.66k|    {
 2388|  3.66k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  3.66k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2333|  9.36k|{
 2334|  9.36k|    auto lshift = lpos.shift();
 2335|  9.36k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|  9.36k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 1.88k, False: 7.47k]
  ------------------
 2339|  1.88k|        auto cpos = lpos.last_sub(
 2340|  1.88k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|  1.88k|        return concat_rebalance_mut<Node>(
 2342|  1.88k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  7.47k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 507, False: 6.96k]
  ------------------
 2344|    507|        auto cpos = rpos.first_sub(
 2345|    507|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    507|        return concat_rebalance_mut<Node>(
 2347|    507|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  6.96k|    } else {
 2349|  6.96k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 6.96k, False: 0]
  ------------------
 2350|  6.96k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 6.96k]
  |  Branch (2350:9): [True: 6.96k, False: 0]
  |  Branch (2350:9): [True: 6.96k, False: 0]
  ------------------
 2351|  6.96k|        auto cpos = lpos.last_sub(
 2352|  6.96k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  6.96k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  6.96k|    }
 2355|  9.36k|}
_ZN5immer6detail4rbts23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_SS_OT1_:
 2366|  2.89k|    {
 2367|  2.89k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|  2.89k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2387|  20.9k|    {
 2388|  20.9k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  20.9k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2333|  20.9k|{
 2334|  20.9k|    auto lshift = lpos.shift();
 2335|  20.9k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|  20.9k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 20.9k]
  ------------------
 2339|      0|        auto cpos = lpos.last_sub(
 2340|      0|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|      0|        return concat_rebalance_mut<Node>(
 2342|      0|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  20.9k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 281, False: 20.6k]
  ------------------
 2344|    281|        auto cpos = rpos.first_sub(
 2345|    281|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    281|        return concat_rebalance_mut<Node>(
 2347|    281|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  20.6k|    } else {
 2349|  20.6k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 20.6k, False: 0]
  ------------------
 2350|  20.6k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 20.6k]
  |  Branch (2350:9): [True: 20.6k, False: 0]
  |  Branch (2350:9): [True: 20.6k, False: 0]
  ------------------
 2351|  20.6k|        auto cpos = lpos.last_sub(
 2352|  20.6k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  20.6k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  20.6k|    }
 2355|  20.9k|}
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|  8.46k|    {
 2417|  8.46k|        return rpos.first_sub_leaf(
 2418|  8.46k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  8.46k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_13full_leaf_posISC_EERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2394|  45.3k|    {
 2395|  45.3k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  45.3k|    }
_ZN5immer6detail4rbts16concat_leafs_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2294|  45.3k|{
 2295|  45.3k|    static_assert(Node::bits >= 2, "");
 2296|  45.3k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 45.3k, False: 0]
  ------------------
 2297|  45.3k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 45.3k, False: 0]
  ------------------
 2298|  45.3k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 45.3k, False: 0]
  ------------------
 2299|  45.3k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 45.3k, False: 0]
  ------------------
 2300|  45.3k|        return {
 2301|  45.3k|            Node::bits_leaf,
 2302|  45.3k|            lpos.node(),
 2303|  45.3k|            lpos.count(),
 2304|  45.3k|            tpos.node(),
 2305|  45.3k|            tpos.count(),
 2306|  45.3k|            rpos.node(),
 2307|  45.3k|            rpos.count(),
 2308|  45.3k|        };
 2309|      0|    else
 2310|      0|        return {
 2311|      0|            Node::bits_leaf,
 2312|      0|            lpos.node(),
 2313|      0|            lpos.count(),
 2314|      0|            rpos.node(),
 2315|      0|            rpos.count(),
 2316|      0|        };
 2317|  45.3k|}
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2408|  13.7k|    {
 2409|  13.7k|        return rpos.first_sub(
 2410|  13.7k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  13.7k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  20.6k|{
 2281|  20.6k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  20.6k|    plan.fill(lpos, cpos, rpos);
 2283|  20.6k|    plan.shuffle(cpos.shift());
 2284|  20.6k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  20.6k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEENST_6edit_tESV_OT_OSQ_SV_OT1_:
 2244|  20.6k|    {
 2245|  20.6k|        using node_t    = node_type<CPos>;
 2246|  20.6k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  20.6k|        using visitor_t = concat_merger_mut_visitor;
 2248|  20.6k|        auto lnode      = ((node_t*) lpos.node());
 2249|  20.6k|        auto rnode      = ((node_t*) rpos.node());
 2250|  20.6k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 20.6k, False: 0]
  |  Branch (2250:36): [True: 20.6k, False: 0]
  |  Branch (2250:58): [True: 467, False: 20.1k]
  ------------------
 2251|  20.6k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 20.6k, False: 0]
  |  Branch (2251:36): [True: 20.6k, False: 0]
  |  Branch (2251:58): [True: 216, False: 20.4k]
  ------------------
 2252|  20.6k|        auto merger     = merger_t{ec,
 2253|  20.6k|                               cpos.shift(),
 2254|  20.6k|                               this->counts,
 2255|  20.6k|                               this->n,
 2256|  20.6k|                               el,
 2257|  20.6k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 467, False: 20.1k]
  ------------------
 2258|  20.6k|        IMMER_TRY {
  ------------------
  |  |   49|  20.6k|#define IMMER_TRY try
  ------------------
 2259|  20.6k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  20.6k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  20.6k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 216, False: 20.4k]
  ------------------
 2262|    216|                merger.set_candidate(er, rnode);
 2263|  20.6k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  20.6k|            return merger.finish();
 2265|  20.6k|        }
 2266|  20.6k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  20.6k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|  36.8k|    {
 2417|  36.8k|        return rpos.first_sub_leaf(
 2418|  36.8k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  36.8k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_OT1_SS_:
 2394|  68.9k|    {
 2395|  68.9k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  68.9k|    }
_ZN5immer6detail4rbts16concat_leafs_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESF_EENS1_17concat_center_posIT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2294|  68.9k|{
 2295|  68.9k|    static_assert(Node::bits >= 2, "");
 2296|  68.9k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 68.9k, False: 0]
  ------------------
 2297|  68.9k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 68.9k, False: 0]
  ------------------
 2298|  68.9k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 68.9k, False: 0]
  ------------------
 2299|  68.9k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 68.9k, False: 0]
  ------------------
 2300|  68.9k|        return {
 2301|  68.9k|            Node::bits_leaf,
 2302|  68.9k|            lpos.node(),
 2303|  68.9k|            lpos.count(),
 2304|  68.9k|            tpos.node(),
 2305|  68.9k|            tpos.count(),
 2306|  68.9k|            rpos.node(),
 2307|  68.9k|            rpos.count(),
 2308|  68.9k|        };
 2309|      0|    else
 2310|      0|        return {
 2311|      0|            Node::bits_leaf,
 2312|      0|            lpos.node(),
 2313|      0|            lpos.count(),
 2314|      0|            rpos.node(),
 2315|      0|            rpos.count(),
 2316|      0|        };
 2317|  68.9k|}
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_SS_OT1_:
 2408|  6.34k|    {
 2409|  6.34k|        return rpos.first_sub(
 2410|  6.34k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  6.34k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EENSt3__15decayISJ_E4type6node_t6edit_tESQ_OT0_OT1_SQ_OT2_:
 2280|  6.96k|{
 2281|  6.96k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  6.96k|    plan.fill(lpos, cpos, rpos);
 2283|  6.96k|    plan.shuffle(cpos.shift());
 2284|  6.96k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  6.96k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEENSQ_6edit_tESS_OT_OSN_SS_OT1_:
 2244|  6.96k|    {
 2245|  6.96k|        using node_t    = node_type<CPos>;
 2246|  6.96k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  6.96k|        using visitor_t = concat_merger_mut_visitor;
 2248|  6.96k|        auto lnode      = ((node_t*) lpos.node());
 2249|  6.96k|        auto rnode      = ((node_t*) rpos.node());
 2250|  6.96k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 6.96k, False: 0]
  |  Branch (2250:36): [True: 6.96k, False: 0]
  |  Branch (2250:58): [True: 935, False: 6.02k]
  ------------------
 2251|  6.96k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 6.96k, False: 0]
  |  Branch (2251:36): [True: 6.96k, False: 0]
  |  Branch (2251:58): [True: 735, False: 6.22k]
  ------------------
 2252|  6.96k|        auto merger     = merger_t{ec,
 2253|  6.96k|                               cpos.shift(),
 2254|  6.96k|                               this->counts,
 2255|  6.96k|                               this->n,
 2256|  6.96k|                               el,
 2257|  6.96k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 935, False: 6.02k]
  ------------------
 2258|  6.96k|        IMMER_TRY {
  ------------------
  |  |   49|  6.96k|#define IMMER_TRY try
  ------------------
 2259|  6.96k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  6.96k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  6.96k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 735, False: 6.22k]
  ------------------
 2262|    735|                merger.set_candidate(er, rnode);
 2263|  6.96k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  6.96k|            return merger.finish();
 2265|  6.96k|        }
 2266|  6.96k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  6.96k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|  68.9k|    {
 2417|  68.9k|        return rpos.first_sub_leaf(
 2418|  68.9k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  68.9k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2408|   116k|    {
 2409|   116k|        return rpos.first_sub(
 2410|   116k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|   116k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|   118k|{
 2281|   118k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|   118k|    plan.fill(lpos, cpos, rpos);
 2283|   118k|    plan.shuffle(cpos.shift());
 2284|   118k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|   118k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_11relaxed_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEENST_6edit_tESV_OT_OSQ_SV_OT1_:
 2244|   118k|    {
 2245|   118k|        using node_t    = node_type<CPos>;
 2246|   118k|        using merger_t  = concat_merger_mut<node_t>;
 2247|   118k|        using visitor_t = concat_merger_mut_visitor;
 2248|   118k|        auto lnode      = ((node_t*) lpos.node());
 2249|   118k|        auto rnode      = ((node_t*) rpos.node());
 2250|   118k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 118k, False: 0]
  |  Branch (2250:36): [True: 118k, False: 0]
  |  Branch (2250:58): [True: 4.38k, False: 113k]
  ------------------
 2251|   118k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 118k, False: 0]
  |  Branch (2251:36): [True: 118k, False: 0]
  |  Branch (2251:58): [True: 3.55k, False: 114k]
  ------------------
 2252|   118k|        auto merger     = merger_t{ec,
 2253|   118k|                               cpos.shift(),
 2254|   118k|                               this->counts,
 2255|   118k|                               this->n,
 2256|   118k|                               el,
 2257|   118k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 4.38k, False: 113k]
  ------------------
 2258|   118k|        IMMER_TRY {
  ------------------
  |  |   49|   118k|#define IMMER_TRY try
  ------------------
 2259|   118k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|   118k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|   118k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 3.55k, False: 114k]
  ------------------
 2262|  3.55k|                merger.set_candidate(er, rnode);
 2263|   118k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|   118k|            return merger.finish();
 2265|   118k|        }
 2266|   118k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|   118k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2280|   412k|{
 2281|   412k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|   412k|    plan.fill(lpos, cpos, rpos);
 2283|   412k|    plan.shuffle(cpos.shift());
 2284|   412k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|   412k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEENSI_INSt3__15decayIT0_E4type6node_tEEENSS_6edit_tESU_OT_OSP_SU_OT1_:
 2244|   412k|    {
 2245|   412k|        using node_t    = node_type<CPos>;
 2246|   412k|        using merger_t  = concat_merger_mut<node_t>;
 2247|   412k|        using visitor_t = concat_merger_mut_visitor;
 2248|   412k|        auto lnode      = ((node_t*) lpos.node());
 2249|   412k|        auto rnode      = ((node_t*) rpos.node());
 2250|   412k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 412k, False: 0]
  |  Branch (2250:36): [True: 412k, False: 0]
  |  Branch (2250:58): [True: 393k, False: 19.4k]
  ------------------
 2251|   412k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 0, False: 412k]
  |  Branch (2251:36): [True: 0, False: 0]
  |  Branch (2251:58): [True: 0, False: 0]
  ------------------
 2252|   412k|        auto merger     = merger_t{ec,
 2253|   412k|                               cpos.shift(),
 2254|   412k|                               this->counts,
 2255|   412k|                               this->n,
 2256|   412k|                               el,
 2257|   412k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 393k, False: 19.4k]
  ------------------
 2258|   412k|        IMMER_TRY {
  ------------------
  |  |   49|   412k|#define IMMER_TRY try
  ------------------
 2259|   412k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|   412k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|   412k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 0, False: 412k]
  ------------------
 2262|      0|                merger.set_candidate(er, rnode);
 2263|   412k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|   412k|            return merger.finish();
 2265|   412k|        }
 2266|   412k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|   412k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_OT1_SS_:
 2387|   237k|    {
 2388|   237k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|   237k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2387|  1.23k|    {
 2388|  1.23k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  1.23k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2333|   255k|{
 2334|   255k|    auto lshift = lpos.shift();
 2335|   255k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|   255k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 217k, False: 37.8k]
  ------------------
 2339|   217k|        auto cpos = lpos.last_sub(
 2340|   217k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|   217k|        return concat_rebalance_mut<Node>(
 2342|   217k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   217k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 773, False: 37.1k]
  ------------------
 2344|    773|        auto cpos = rpos.first_sub(
 2345|    773|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    773|        return concat_rebalance_mut<Node>(
 2347|    773|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  37.1k|    } else {
 2349|  37.1k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 37.1k, False: 0]
  ------------------
 2350|  37.1k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 37.1k]
  |  Branch (2350:9): [True: 37.1k, False: 0]
  |  Branch (2350:9): [True: 37.1k, False: 0]
  ------------------
 2351|  37.1k|        auto cpos = lpos.last_sub(
 2352|  37.1k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  37.1k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  37.1k|    }
 2355|   255k|}
_ZN5immer6detail4rbts23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2366|   216k|    {
 2367|   216k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|   216k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2387|  2.24k|    {
 2388|  2.24k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  2.24k|    }
_ZN5immer6detail4rbts17concat_inners_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2333|  2.24k|{
 2334|  2.24k|    auto lshift = lpos.shift();
 2335|  2.24k|    auto rshift = rpos.shift();
 2336|       |    // lpos.node() can be null it is a singleton_regular_sub_pos<...>,
 2337|       |    // this is, when the tree is just a tail...
 2338|  2.24k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 2.24k]
  ------------------
 2339|      0|        auto cpos = lpos.last_sub(
 2340|      0|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|      0|        return concat_rebalance_mut<Node>(
 2342|      0|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  2.24k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 237, False: 2.00k]
  ------------------
 2344|    237|        auto cpos = rpos.first_sub(
 2345|    237|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    237|        return concat_rebalance_mut<Node>(
 2347|    237|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  2.00k|    } else {
 2349|  2.00k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 2.00k, False: 0]
  ------------------
 2350|  2.00k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 2.00k]
  |  Branch (2350:9): [True: 2.00k, False: 0]
  |  Branch (2350:9): [True: 2.00k, False: 0]
  ------------------
 2351|  2.00k|        auto cpos = lpos.last_sub(
 2352|  2.00k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  2.00k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  2.00k|    }
 2355|  2.24k|}
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2408|    389|    {
 2409|    389|        return rpos.first_sub(
 2410|    389|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|    389|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_8full_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  2.00k|{
 2281|  2.00k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.00k|    plan.fill(lpos, cpos, rpos);
 2283|  2.00k|    plan.shuffle(cpos.shift());
 2284|  2.00k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.00k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_8full_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEENST_6edit_tESV_OT_OSQ_SV_OT1_:
 2244|  2.00k|    {
 2245|  2.00k|        using node_t    = node_type<CPos>;
 2246|  2.00k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.00k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.00k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.00k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.00k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 2.00k, False: 0]
  |  Branch (2250:36): [True: 2.00k, False: 0]
  |  Branch (2250:58): [True: 883, False: 1.12k]
  ------------------
 2251|  2.00k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.00k, False: 0]
  |  Branch (2251:36): [True: 2.00k, False: 0]
  |  Branch (2251:58): [True: 201, False: 1.80k]
  ------------------
 2252|  2.00k|        auto merger     = merger_t{ec,
 2253|  2.00k|                               cpos.shift(),
 2254|  2.00k|                               this->counts,
 2255|  2.00k|                               this->n,
 2256|  2.00k|                               el,
 2257|  2.00k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 883, False: 1.12k]
  ------------------
 2258|  2.00k|        IMMER_TRY {
  ------------------
  |  |   49|  2.00k|#define IMMER_TRY try
  ------------------
 2259|  2.00k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.00k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.00k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 201, False: 1.80k]
  ------------------
 2262|    201|                merger.set_candidate(er, rnode);
 2263|  2.00k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.00k|            return merger.finish();
 2265|  2.00k|        }
 2266|  2.00k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.00k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2408|    843|    {
 2409|    843|        return rpos.first_sub(
 2410|    843|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|    843|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  37.1k|{
 2281|  37.1k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  37.1k|    plan.fill(lpos, cpos, rpos);
 2283|  37.1k|    plan.shuffle(cpos.shift());
 2284|  37.1k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  37.1k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_15regular_sub_posISF_EEEENSI_INSt3__15decayIT0_E4type6node_tEEENST_6edit_tESV_OT_OSQ_SV_OT1_:
 2244|  37.1k|    {
 2245|  37.1k|        using node_t    = node_type<CPos>;
 2246|  37.1k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  37.1k|        using visitor_t = concat_merger_mut_visitor;
 2248|  37.1k|        auto lnode      = ((node_t*) lpos.node());
 2249|  37.1k|        auto rnode      = ((node_t*) rpos.node());
 2250|  37.1k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 37.1k, False: 0]
  |  Branch (2250:36): [True: 37.1k, False: 0]
  |  Branch (2250:58): [True: 34.6k, False: 2.43k]
  ------------------
 2251|  37.1k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 37.1k, False: 0]
  |  Branch (2251:36): [True: 37.1k, False: 0]
  |  Branch (2251:58): [True: 389, False: 36.7k]
  ------------------
 2252|  37.1k|        auto merger     = merger_t{ec,
 2253|  37.1k|                               cpos.shift(),
 2254|  37.1k|                               this->counts,
 2255|  37.1k|                               this->n,
 2256|  37.1k|                               el,
 2257|  37.1k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 34.6k, False: 2.43k]
  ------------------
 2258|  37.1k|        IMMER_TRY {
  ------------------
  |  |   49|  37.1k|#define IMMER_TRY try
  ------------------
 2259|  37.1k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  37.1k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  37.1k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 389, False: 36.7k]
  ------------------
 2262|    389|                merger.set_candidate(er, rnode);
 2263|  37.1k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  37.1k|            return merger.finish();
 2265|  37.1k|        }
 2266|  37.1k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  37.1k|    }
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESH_EENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_SS_OT1_:
 2408|   192k|    {
 2409|   192k|        return rpos.first_sub(
 2410|   192k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|   192k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_17concat_center_posISC_EESF_EENSG_IT_EENSt3__15decayISJ_E4type6node_t6edit_tESQ_OT0_OT1_SQ_OT2_:
 2280|   260k|{
 2281|   260k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|   260k|    plan.fill(lpos, cpos, rpos);
 2283|   260k|    plan.shuffle(cpos.shift());
 2284|   260k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|   260k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEENSQ_6edit_tESS_OT_OSN_SS_OT1_:
 2244|   260k|    {
 2245|   260k|        using node_t    = node_type<CPos>;
 2246|   260k|        using merger_t  = concat_merger_mut<node_t>;
 2247|   260k|        using visitor_t = concat_merger_mut_visitor;
 2248|   260k|        auto lnode      = ((node_t*) lpos.node());
 2249|   260k|        auto rnode      = ((node_t*) rpos.node());
 2250|   260k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 260k, False: 0]
  |  Branch (2250:36): [True: 260k, False: 0]
  |  Branch (2250:58): [True: 53.7k, False: 206k]
  ------------------
 2251|   260k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 260k, False: 0]
  |  Branch (2251:36): [True: 260k, False: 0]
  |  Branch (2251:58): [True: 10.0k, False: 250k]
  ------------------
 2252|   260k|        auto merger     = merger_t{ec,
 2253|   260k|                               cpos.shift(),
 2254|   260k|                               this->counts,
 2255|   260k|                               this->n,
 2256|   260k|                               el,
 2257|   260k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 53.7k, False: 206k]
  ------------------
 2258|   260k|        IMMER_TRY {
  ------------------
  |  |   49|   260k|#define IMMER_TRY try
  ------------------
 2259|   260k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|   260k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|   260k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 10.0k, False: 250k]
  ------------------
 2262|  10.0k|                merger.set_candidate(er, rnode);
 2263|   260k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|   260k|            return merger.finish();
 2265|   260k|        }
 2266|   260k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|   260k|    }
_ZN5immer6detail4rbts30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2432|  37.6k|    {
 2433|  37.6k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  37.6k|    }
_ZN5immer6detail4rbts29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EENS1_8leaf_posISC_EEJRPSC_RjRmEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_DpOT1_:
 2451|  6.18k|    {
 2452|  6.18k|        return visit_maybe_relaxed_sub(args...,
 2453|  6.18k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|  6.18k|                                       ec,
 2455|  6.18k|                                       el,
 2456|  6.18k|                                       lpos,
 2457|  6.18k|                                       tpos,
 2458|  6.18k|                                       er);
 2459|  6.18k|    }
_ZN5immer6detail4rbts30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_11relaxed_posISC_EERNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_OT1_SV_:
 2432|  3.37k|    {
 2433|  3.37k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.37k|    }
_ZN5immer6detail4rbts30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_nodeIRNS1_15regular_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_OT1_SS_:
 2432|  2.80k|    {
 2433|  2.80k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  2.80k|    }

_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_:
 1838|   254k|{
 1839|   254k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 254k, False: 0]
  ------------------
 1840|   254k|    auto relaxed = node->relaxed();
 1841|   254k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 211k, False: 42.9k]
  ------------------
 1842|   211k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 211k, False: 0]
  ------------------
 1843|   211k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   211k|            .visit(v, std::forward<Args>(args)...);
 1845|   211k|    } else {
 1846|  42.9k|        return make_regular_sub_pos(node, shift, size)
 1847|  42.9k|            .visit(v, std::forward<Args>(args)...);
 1848|  42.9k|    }
 1849|   254k|}
_ZN5immer6detail4rbts16make_relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jPNSE_9relaxed_tE:
 1828|  11.7M|{
 1829|  11.7M|    assert(node);
  ------------------
  |  Branch (1829:5): [True: 11.7M, False: 0]
  ------------------
 1830|  11.7M|    assert(relaxed);
  ------------------
  |  Branch (1830:5): [True: 11.7M, False: 0]
  ------------------
 1831|  11.7M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1831:5): [True: 11.7M, False: 0]
  ------------------
 1832|  11.7M|    return {node, shift, relaxed};
 1833|  11.7M|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1813|   638k|    {
 1814|   638k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   638k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
 1431|  7.56M|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
 1430|  10.3M|    count_t count() const { return relaxed_->d.count; }
_ZN5immer6detail4rbts20make_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_15regular_sub_posIT_EEPSE_jm:
 1044|  2.27M|{
 1045|  2.27M|    assert(node);
  ------------------
  |  Branch (1045:5): [True: 2.27M, False: 0]
  ------------------
 1046|  2.27M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1046:5): [True: 2.27M, False: 0]
  ------------------
 1047|  2.27M|    assert(size > 0);
  ------------------
  |  Branch (1047:5): [True: 2.27M, False: 0]
  ------------------
 1048|  2.27M|    assert(size <= (branches<NodeT::bits, size_t> << shift));
  ------------------
  |  Branch (1048:5): [True: 2.27M, False: 0]
  ------------------
 1049|  2.27M|    return {node, shift, size};
 1050|  2.27M|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1036|  54.8k|    {
 1037|  54.8k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  54.8k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  785|  4.34M|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  787|  4.63M|    shift_t shift() const { return shift_; }
_ZN5immer6detail4rbts18make_full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_13full_leaf_posIT_EEPSE_:
  214|   329k|{
  215|   329k|    assert(node);
  ------------------
  |  Branch (215:5): [True: 329k, False: 0]
  ------------------
  216|   329k|    return {node};
  217|   329k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  207|  6.60k|    {
  208|  6.60k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  6.60k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  199|   225k|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
  198|   326k|    count_t count() const { return branches<BL>; }
_ZN5immer6detail4rbts13make_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_8leaf_posIT_EEPSE_m:
  119|   174k|{
  120|   174k|    assert(node);
  ------------------
  |  Branch (120:5): [True: 174k, False: 0]
  ------------------
  121|   174k|    assert(size > 0);
  ------------------
  |  Branch (121:5): [True: 174k, False: 0]
  ------------------
  122|   174k|    return {node, size};
  123|   174k|}
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  786|  7.02M|    size_t size() const { return size_; }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  112|  2.51k|    {
  113|  2.51k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.51k|    }
_ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  104|   177k|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
  103|   334k|    count_t count() const { return index(size_ - 1) + 1; }
_ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  107|   346k|    count_t index(size_t idx) const { return idx & mask<BL>; }
_ZN5immer6detail4rbts13make_full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_8full_posIT_EEPSE_j:
 1412|   536k|{
 1413|   536k|    assert(node);
  ------------------
  |  Branch (1413:5): [True: 536k, False: 0]
  ------------------
 1414|   536k|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1414:5): [True: 536k, False: 0]
  ------------------
 1415|   536k|    return {node, shift};
 1416|   536k|}
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1405|  10.6k|    {
 1406|  10.6k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  10.6k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
 1159|   308k|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
 1158|   484k|    count_t count() const { return branches<B>; }
_ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11regular_posIT_EEPSE_jm:
  690|  9.15M|{
  691|  9.15M|    assert(node);
  ------------------
  |  Branch (691:5): [True: 9.15M, False: 0]
  ------------------
  692|  9.15M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (692:5): [True: 9.15M, False: 0]
  ------------------
  693|  9.15M|    assert(size > 0);
  ------------------
  |  Branch (693:5): [True: 9.15M, False: 0]
  ------------------
  694|  9.15M|    return {node, shift, size};
  695|  9.15M|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  336|  4.40k|    {
  337|  4.40k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  4.40k|    }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  231|  16.6M|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  233|  16.6M|    shift_t shift() const { return shift_; }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  232|  34.8M|    size_t size() const { return size_; }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
  230|  7.47M|    count_t count() const { return index(size_ - 1) + 1; }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  234|  25.7M|    count_t index(size_t idx) const { return (idx >> shift_) & mask<B>; }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
  784|  3.06M|    count_t count() const { return subindex(size_ - 1) + 1; }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8subindexEm:
  789|  3.07M|    count_t subindex(size_t idx) const { return idx >> shift_; }
_ZN5immer6detail4rbts22make_empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17empty_regular_posIT_EEPSE_:
   64|   420k|{
   65|   420k|    return {node};
   66|   420k|}
_ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
   57|   420k|    {
   58|   420k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
   59|   420k|    }
_ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
   41|   420k|    node_t* node() const { return node_; }
_ZN5immer6detail4rbts17make_leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_12leaf_sub_posIT_EEPSE_j:
  151|  2.75M|{
  152|  2.75M|    assert(node);
  ------------------
  |  Branch (152:5): [True: 2.75M, False: 0]
  ------------------
  153|  2.75M|    assert(count <= branches<NodeT::bits_leaf>);
  ------------------
  |  Branch (153:5): [True: 2.75M, False: 0]
  ------------------
  154|  2.75M|    return {node, count};
  155|  2.75M|}
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  144|   506k|    {
  145|   506k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   506k|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  136|  1.79M|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
  135|  2.24M|    count_t count() const { return count_; }
_ZN5immer6detail4rbts19make_empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_14empty_leaf_posIT_EEPSE_:
   88|   367k|{
   89|   367k|    assert(node);
  ------------------
  |  Branch (89:5): [True: 367k, False: 0]
  ------------------
   90|   367k|    return {node};
   91|   367k|}
_ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
   81|   367k|    {
   82|   367k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
   83|   367k|    }
_ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
   75|   367k|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
   74|  10.7k|    count_t count() const { return 0; }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_:
 1813|  51.5k|    {
 1814|  51.5k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  51.5k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1433|  3.29M|    shift_t shift() const { return shift_; }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEj:
 1443|  2.82M|    {
 1444|  2.82M|        return size_sbh(offset, size_before(offset));
 1445|  2.82M|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
 1448|  2.94M|    {
 1449|  2.94M|        assert(size_before_hint == size_before(offset));
  ------------------
  |  Branch (1449:9): [True: 2.94M, False: 0]
  ------------------
 1450|  2.94M|        return relaxed_->d.sizes[offset] - size_before_hint;
 1451|  2.94M|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11size_beforeEj:
 1438|  6.12M|    {
 1439|  6.12M|        return offset ? relaxed_->d.sizes[offset - 1] : 0;
  ------------------
  |  Branch (1439:16): [True: 5.01M, False: 1.10M]
  ------------------
 1440|  6.12M|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11last_oh_cshINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_jmDpOT0_:
 1737|  45.3k|    {
 1738|  45.3k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 45.3k, False: 0]
  ------------------
 1739|  45.3k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 45.3k, False: 0]
  ------------------
 1740|  45.3k|        auto child   = node_->inner()[offset_hint];
 1741|  45.3k|        auto is_leaf = shift_ == BL;
 1742|  45.3k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 45.3k]
  ------------------
 1743|  45.3k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|  45.3k|                   : visit_maybe_relaxed_sub(
 1745|  45.3k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|  45.3k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcPT_jmT0_DpOT1_:
 1838|  45.3k|{
 1839|  45.3k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 45.3k, False: 0]
  ------------------
 1840|  45.3k|    auto relaxed = node->relaxed();
 1841|  45.3k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 36.7k, False: 8.59k]
  ------------------
 1842|  36.7k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 36.7k, False: 0]
  ------------------
 1843|  36.7k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  36.7k|            .visit(v, std::forward<Args>(args)...);
 1845|  36.7k|    } else {
 1846|  8.59k|        return make_regular_sub_pos(node, shift, size)
 1847|  8.59k|            .visit(v, std::forward<Args>(args)...);
 1848|  8.59k|    }
 1849|  45.3k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_:
 1036|  8.59k|    {
 1037|  8.59k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  8.59k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  788|  3.53M|    count_t index(size_t idx) const { return (idx >> shift_) & mask<B>; }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_:
  952|  9.14k|    {
  953|  9.14k|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  9.14k|    }
_ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_:
  677|  9.14k|{
  678|  9.14k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 9.14k, False: 0]
  ------------------
  679|  9.14k|    constexpr auto B  = bits<Pos>;
  680|  9.14k|    constexpr auto BL = bits_leaf<Pos>;
  681|  9.14k|    auto child        = p.node()->inner()[offset_hint];
  682|  9.14k|    auto is_leaf      = p.shift() == BL;
  683|  9.14k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 9.14k]
  ------------------
  684|  9.14k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  9.14k|                         .visit(v, args...);
  686|  9.14k|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_:
  336|  34.0k|    {
  337|  34.0k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  34.0k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7last_ohINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_jDpOT0_:
  330|  24.8k|    {
  331|  24.8k|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  24.8k|    }
_ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17push_tail_visitorISD_EEJRPSD_EEEDcOT_T0_jDpOT1_:
  677|  24.8k|{
  678|  24.8k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 24.8k, False: 0]
  ------------------
  679|  24.8k|    constexpr auto B  = bits<Pos>;
  680|  24.8k|    constexpr auto BL = bits_leaf<Pos>;
  681|  24.8k|    auto child        = p.node()->inner()[offset_hint];
  682|  24.8k|    auto is_leaf      = p.shift() == BL;
  683|  24.8k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 24.8k]
  ------------------
  684|  24.8k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  24.8k|                         .visit(v, args...);
  686|  24.8k|}
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
 1432|  5.21M|    size_t size() const { return relaxed_->d.sizes[relaxed_->d.count - 1]; }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_:
 1036|  4.17k|    {
 1037|  4.17k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.17k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_DpOT0_:
  144|    524|    {
  145|    524|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    524|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  139|  39.7k|    count_t index(size_t idx) const { return idx & mask<BL>; }
flex-vector-gc.cpp:_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSJ_E_EEEDcPSJ_jmT0_DpOT1_:
 1838|  32.0k|{
 1839|  32.0k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 32.0k, False: 0]
  ------------------
 1840|  32.0k|    auto relaxed = node->relaxed();
 1841|  32.0k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 30.1k, False: 1.98k]
  ------------------
 1842|  30.1k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 30.1k, False: 0]
  ------------------
 1843|  30.1k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  30.1k|            .visit(v, std::forward<Args>(args)...);
 1845|  30.1k|    } else {
 1846|  1.98k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.98k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.98k|    }
 1849|  32.0k|}
flex-vector-gc.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_:
 1813|  30.1k|    {
 1814|  30.1k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  30.1k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
 1454|   895k|    {
 1455|   895k|        auto offset = idx >> shift_;
 1456|  1.05M|        while (relaxed_->d.sizes[offset] <= idx)
  ------------------
  |  Branch (1456:16): [True: 159k, False: 895k]
  ------------------
 1457|   159k|            ++offset;
 1458|   895k|        return offset;
 1459|   895k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7relaxedEv:
 1435|  30.1k|    relaxed_t* relaxed() const { return relaxed_; }
flex-vector-gc.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_:
 1686|  30.1k|    {
 1687|  30.1k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 30.1k, False: 0]
  ------------------
 1688|  30.1k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 2.61k, False: 27.4k]
  ------------------
 1689|  30.1k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  30.1k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_:
 1698|  30.1k|    {
 1699|  30.1k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  30.1k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjmDpOT0_:
 1717|  30.1k|    {
 1718|  30.1k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 30.1k, False: 0]
  ------------------
 1719|  30.1k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 2.61k, False: 27.4k]
  |  Branch (1719:9): [True: 30.1k, False: 0]
  ------------------
 1720|  30.1k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  30.1k|        auto child     = node_->inner()[offset_hint];
 1722|  30.1k|        auto is_leaf   = shift_ == BL;
 1723|  30.1k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  30.1k|        auto next_idx  = idx - left_size_hint;
 1725|  30.1k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 3.48k, False: 26.6k]
  ------------------
 1726|  30.1k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  3.48k|                         .visit(v, next_idx, args...)
 1728|  30.1k|                   : visit_maybe_relaxed_sub(
 1729|  26.6k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  30.1k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_:
  144|  3.48k|    {
  145|  3.48k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.48k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_:
 1036|  1.98k|    {
 1037|  1.98k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.98k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_:
  938|  1.98k|    {
  939|  1.98k|        return towards_oh_ch_regular(
  940|  1.98k|            *this, v, idx, offset_hint, count(), args...);
  941|  1.98k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_:
  632|  1.98k|{
  633|  1.98k|    constexpr auto B  = bits<Pos>;
  634|  1.98k|    constexpr auto BL = bits_leaf<Pos>;
  635|  1.98k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 1.98k, False: 0]
  ------------------
  636|  1.98k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 1.98k, False: 0]
  ------------------
  637|  1.98k|    auto is_leaf = p.shift() == BL;
  638|  1.98k|    auto child   = p.node()->inner()[offset_hint];
  639|  1.98k|    auto is_full = offset_hint + 1 != count_hint;
  640|  1.98k|    return is_full
  ------------------
  |  Branch (640:12): [True: 961, False: 1.02k]
  ------------------
  641|  1.98k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 379, False: 582]
  ------------------
  642|    961|                          : make_full_pos(child, p.shift() - B)
  643|    582|                                .visit(v, idx, args...))
  644|  1.98k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 252, False: 775]
  ------------------
  645|  1.02k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.02k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    775|                            .visit(v, idx, args...));
  648|  1.98k|}
flex-vector-gc.cpp:_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_:
  207|  1.40k|    {
  208|  1.40k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.40k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  202|  29.5k|    count_t index(size_t idx) const { return idx & mask<BL>; }
flex-vector-gc.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_:
 1405|  1.28k|    {
 1406|  1.28k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.28k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
 1162|  55.1k|    count_t index(size_t idx) const { return (idx >> shift_) & mask<B>; }
flex-vector-gc.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_:
 1329|  1.28k|    {
 1330|  1.28k|        return towards_oh(v, idx, offset_hint, args...);
 1331|  1.28k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjDpOT0_:
 1336|  1.28k|    {
 1337|  1.28k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.28k, False: 0]
  ------------------
 1338|  1.28k|        auto is_leaf = shift_ == BL;
 1339|  1.28k|        auto child   = node_->inner()[offset_hint];
 1340|  1.28k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 785, False: 502]
  ------------------
 1341|  1.28k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.28k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.28k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_:
  112|    583|    {
  113|    583|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    583|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_14update_visitorISC_EEJRmRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcSL_DpOT0_:
  336|  1.17k|    {
  337|  1.17k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  1.17k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13towards_oh_chINS1_14update_visitorISC_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSK_E_EEEDcSK_mjjDpOT0_:
  316|  1.17k|    {
  317|  1.17k|        return towards_oh_ch_regular(
  318|  1.17k|            *this, v, idx, offset_hint, count(), args...);
  319|  1.17k|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_14update_visitorISD_EEJRZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSL_E_EEEDcOSL_T0_mjjDpOT1_:
  632|  1.17k|{
  633|  1.17k|    constexpr auto B  = bits<Pos>;
  634|  1.17k|    constexpr auto BL = bits_leaf<Pos>;
  635|  1.17k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 1.17k, False: 0]
  ------------------
  636|  1.17k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 1.17k, False: 0]
  ------------------
  637|  1.17k|    auto is_leaf = p.shift() == BL;
  638|  1.17k|    auto child   = p.node()->inner()[offset_hint];
  639|  1.17k|    auto is_full = offset_hint + 1 != count_hint;
  640|  1.17k|    return is_full
  ------------------
  |  Branch (640:12): [True: 444, False: 726]
  ------------------
  641|  1.17k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 241, False: 203]
  ------------------
  642|    444|                          : make_full_pos(child, p.shift() - B)
  643|    203|                                .visit(v, idx, args...))
  644|  1.17k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 331, False: 395]
  ------------------
  645|    726|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    726|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    395|                            .visit(v, idx, args...));
  648|  1.17k|}
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_:
 1838|  20.1k|{
 1839|  20.1k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 20.1k, False: 0]
  ------------------
 1840|  20.1k|    auto relaxed = node->relaxed();
 1841|  20.1k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 15.2k, False: 4.91k]
  ------------------
 1842|  15.2k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 15.2k, False: 0]
  ------------------
 1843|  15.2k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  15.2k|            .visit(v, std::forward<Args>(args)...);
 1845|  15.2k|    } else {
 1846|  4.91k|        return make_regular_sub_pos(node, shift, size)
 1847|  4.91k|            .visit(v, std::forward<Args>(args)...);
 1848|  4.91k|    }
 1849|  20.1k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1813|  15.2k|    {
 1814|  15.2k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  15.2k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1686|  10.4k|    {
 1687|  10.4k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 10.4k, False: 0]
  ------------------
 1688|  10.4k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 10.4k]
  ------------------
 1689|  10.4k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  10.4k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_:
 1698|  10.4k|    {
 1699|  10.4k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  10.4k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_:
 1717|  10.4k|    {
 1718|  10.4k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 10.4k, False: 0]
  ------------------
 1719|  10.4k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 10.4k]
  |  Branch (1719:9): [True: 10.4k, False: 0]
  ------------------
 1720|  10.4k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  10.4k|        auto child     = node_->inner()[offset_hint];
 1722|  10.4k|        auto is_leaf   = shift_ == BL;
 1723|  10.4k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  10.4k|        auto next_idx  = idx - left_size_hint;
 1725|  10.4k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 725, False: 9.72k]
  ------------------
 1726|  10.4k|                   ? make_leaf_sub_pos(child, next_size)
 1727|    725|                         .visit(v, next_idx, args...)
 1728|  10.4k|                   : visit_maybe_relaxed_sub(
 1729|  9.72k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  10.4k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
  144|    725|    {
  145|    725|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    725|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1686|  9.48k|    {
 1687|  9.48k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 9.48k, False: 0]
  ------------------
 1688|  9.48k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 6.77k, False: 2.70k]
  ------------------
 1689|  9.48k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  9.48k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_:
 1698|  9.48k|    {
 1699|  9.48k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  9.48k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_:
 1717|  9.48k|    {
 1718|  9.48k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 9.48k, False: 0]
  ------------------
 1719|  9.48k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 6.77k, False: 2.70k]
  |  Branch (1719:9): [True: 9.48k, False: 0]
  ------------------
 1720|  9.48k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  9.48k|        auto child     = node_->inner()[offset_hint];
 1722|  9.48k|        auto is_leaf   = shift_ == BL;
 1723|  9.48k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  9.48k|        auto next_idx  = idx - left_size_hint;
 1725|  9.48k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 3.47k, False: 6.00k]
  ------------------
 1726|  9.48k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  3.47k|                         .visit(v, next_idx, args...)
 1728|  9.48k|                   : visit_maybe_relaxed_sub(
 1729|  6.00k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  9.48k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  144|  3.47k|    {
  145|  3.47k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.47k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_:
 1838|  6.00k|{
 1839|  6.00k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 6.00k, False: 0]
  ------------------
 1840|  6.00k|    auto relaxed = node->relaxed();
 1841|  6.00k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 4.64k, False: 1.36k]
  ------------------
 1842|  4.64k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 4.64k, False: 0]
  ------------------
 1843|  4.64k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  4.64k|            .visit(v, std::forward<Args>(args)...);
 1845|  4.64k|    } else {
 1846|  1.36k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.36k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.36k|    }
 1849|  6.00k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1813|  4.64k|    {
 1814|  4.64k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.64k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1036|  1.36k|    {
 1037|  1.36k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.36k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
  927|  3.68k|    {
  928|  3.68k|        return towards_oh_ch_regular(
  929|  3.68k|            *this, v, idx, offset_hint, count(), args...);
  930|  3.68k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_:
  632|  3.68k|{
  633|  3.68k|    constexpr auto B  = bits<Pos>;
  634|  3.68k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.68k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.68k, False: 0]
  ------------------
  636|  3.68k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.68k, False: 0]
  ------------------
  637|  3.68k|    auto is_leaf = p.shift() == BL;
  638|  3.68k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.68k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.68k|    return is_full
  ------------------
  |  Branch (640:12): [True: 1.13k, False: 2.55k]
  ------------------
  641|  3.68k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 428, False: 708]
  ------------------
  642|  1.13k|                          : make_full_pos(child, p.shift() - B)
  643|    708|                                .visit(v, idx, args...))
  644|  3.68k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 882, False: 1.67k]
  ------------------
  645|  2.55k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.55k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.67k|                            .visit(v, idx, args...));
  648|  3.68k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  207|  2.90k|    {
  208|  2.90k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  2.90k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1405|  1.99k|    {
 1406|  1.99k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.99k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1336|  3.07k|    {
 1337|  3.07k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 3.07k, False: 0]
  ------------------
 1338|  3.07k|        auto is_leaf = shift_ == BL;
 1339|  3.07k|        auto child   = node_->inner()[offset_hint];
 1340|  3.07k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 2.00k, False: 1.06k]
  ------------------
 1341|  3.07k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  3.07k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  3.07k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1161|  53.1k|    shift_t shift() const { return shift_; }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  112|  1.86k|    {
  113|  1.86k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  1.86k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  336|  2.54k|    {
  337|  2.54k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.54k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
  305|  2.54k|    {
  306|  2.54k|        return towards_oh_ch_regular(
  307|  2.54k|            *this, v, idx, offset_hint, count(), args...);
  308|  2.54k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb0EEEJEEEDcOT_T0_mjjDpOT1_:
  632|  2.54k|{
  633|  2.54k|    constexpr auto B  = bits<Pos>;
  634|  2.54k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.54k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.54k, False: 0]
  ------------------
  636|  2.54k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.54k, False: 0]
  ------------------
  637|  2.54k|    auto is_leaf = p.shift() == BL;
  638|  2.54k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.54k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.54k|    return is_full
  ------------------
  |  Branch (640:12): [True: 689, False: 1.85k]
  ------------------
  641|  2.54k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 469, False: 220]
  ------------------
  642|    689|                          : make_full_pos(child, p.shift() - B)
  643|    220|                                .visit(v, idx, args...))
  644|  2.54k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 982, False: 869]
  ------------------
  645|  1.85k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.85k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    869|                            .visit(v, idx, args...));
  648|  2.54k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1036|  4.91k|    {
 1037|  4.91k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.91k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
  927|  2.58k|    {
  928|  2.58k|        return towards_oh_ch_regular(
  929|  2.58k|            *this, v, idx, offset_hint, count(), args...);
  930|  2.58k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_19slice_right_visitorISD_Lb1EEEJEEEDcOT_T0_mjjDpOT1_:
  632|  2.58k|{
  633|  2.58k|    constexpr auto B  = bits<Pos>;
  634|  2.58k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.58k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.58k, False: 0]
  ------------------
  636|  2.58k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.58k, False: 0]
  ------------------
  637|  2.58k|    auto is_leaf = p.shift() == BL;
  638|  2.58k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.58k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.58k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.18k, False: 404]
  ------------------
  641|  2.58k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 608, False: 1.57k]
  ------------------
  642|  2.18k|                          : make_full_pos(child, p.shift() - B)
  643|  1.57k|                                .visit(v, idx, args...))
  644|  2.58k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 404, False: 0]
  ------------------
  645|    404|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    404|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .visit(v, idx, args...));
  648|  2.58k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
  207|  1.10k|    {
  208|  1.10k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.10k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1405|  1.95k|    {
 1406|  1.95k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.95k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1336|    874|    {
 1337|    874|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 874, False: 0]
  ------------------
 1338|    874|        auto is_leaf = shift_ == BL;
 1339|    874|        auto child   = node_->inner()[offset_hint];
 1340|    874|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 493, False: 381]
  ------------------
 1341|    874|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|    874|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|    874|    }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
  112|    404|    {
  113|    404|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    404|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcPT_jmT0_DpOT1_:
 1838|  18.5k|{
 1839|  18.5k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 18.5k, False: 0]
  ------------------
 1840|  18.5k|    auto relaxed = node->relaxed();
 1841|  18.5k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 16.0k, False: 2.56k]
  ------------------
 1842|  16.0k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 16.0k, False: 0]
  ------------------
 1843|  16.0k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  16.0k|            .visit(v, std::forward<Args>(args)...);
 1845|  16.0k|    } else {
 1846|  2.56k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.56k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.56k|    }
 1849|  18.5k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1813|  16.0k|    {
 1814|  16.0k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  16.0k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8subindexEm:
 1434|   115k|    count_t subindex(size_t idx) const { return index(idx); }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1705|  1.36k|    {
 1706|  1.36k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1706:9): [True: 1.36k, False: 0]
  ------------------
 1707|  1.36k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1707:26): [True: 868, False: 493]
  ------------------
 1708|  1.36k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...);
 1709|  1.36k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_:
 1717|  1.36k|    {
 1718|  1.36k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 1.36k, False: 0]
  ------------------
 1719|  1.36k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 868, False: 493]
  |  Branch (1719:9): [True: 1.36k, False: 0]
  ------------------
 1720|  1.36k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  1.36k|        auto child     = node_->inner()[offset_hint];
 1722|  1.36k|        auto is_leaf   = shift_ == BL;
 1723|  1.36k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  1.36k|        auto next_idx  = idx - left_size_hint;
 1725|  1.36k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 0, False: 1.36k]
  ------------------
 1726|  1.36k|                   ? make_leaf_sub_pos(child, next_size)
 1727|      0|                         .visit(v, next_idx, args...)
 1728|  1.36k|                   : visit_maybe_relaxed_sub(
 1729|  1.36k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  1.36k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1705|   113k|    {
 1706|   113k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1706:9): [True: 113k, False: 0]
  ------------------
 1707|   113k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1707:26): [True: 21.6k, False: 92.1k]
  ------------------
 1708|   113k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...);
 1709|   113k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjmDpOT0_:
 1717|   113k|    {
 1718|   113k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 113k, False: 0]
  ------------------
 1719|   113k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 21.6k, False: 92.1k]
  |  Branch (1719:9): [True: 113k, False: 0]
  ------------------
 1720|   113k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|   113k|        auto child     = node_->inner()[offset_hint];
 1722|   113k|        auto is_leaf   = shift_ == BL;
 1723|   113k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|   113k|        auto next_idx  = idx - left_size_hint;
 1725|   113k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 13.1k, False: 100k]
  ------------------
 1726|   113k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  13.1k|                         .visit(v, next_idx, args...)
 1728|   113k|                   : visit_maybe_relaxed_sub(
 1729|   100k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|   113k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  144|  13.1k|    {
  145|  13.1k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  13.1k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcPT_jmT0_DpOT1_:
 1838|   100k|{
 1839|   100k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 100k, False: 0]
  ------------------
 1840|   100k|    auto relaxed = node->relaxed();
 1841|   100k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 99.2k, False: 1.49k]
  ------------------
 1842|  99.2k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 99.2k, False: 0]
  ------------------
 1843|  99.2k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  99.2k|            .visit(v, std::forward<Args>(args)...);
 1845|  99.2k|    } else {
 1846|  1.49k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.49k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.49k|    }
 1849|   100k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1813|  99.2k|    {
 1814|  99.2k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  99.2k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1036|  1.49k|    {
 1037|  1.49k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.49k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11size_beforeEj:
  791|  13.3k|    {
  792|  13.3k|        return size_t{offset} << shift_;
  793|  13.3k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
  803|  4.42k|    {
  804|  4.42k|        assert(size_before_hint == size_before(offset));
  ------------------
  |  Branch (804:9): [True: 4.42k, False: 0]
  ------------------
  805|  4.42k|        return offset == subindex(size_ - 1) ? size_ - size_before_hint
  ------------------
  |  Branch (805:16): [True: 2.26k, False: 2.15k]
  ------------------
  806|  4.42k|                                             : size_t{1} << shift_;
  807|  4.42k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
  946|  3.06k|    {
  947|  3.06k|        return towards_sub_oh_regular(*this, v, idx, offset_hint, args...);
  948|  3.06k|    }
_ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_18slice_left_visitorISD_Lb0EEEJEEEDcOT_T0_mjDpOT1_:
  653|  3.06k|{
  654|  3.06k|    constexpr auto B  = bits<Pos>;
  655|  3.06k|    constexpr auto BL = bits_leaf<Pos>;
  656|  3.06k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (656:5): [True: 3.06k, False: 0]
  ------------------
  657|  3.06k|    auto is_leaf = p.shift() == BL;
  658|  3.06k|    auto child   = p.node()->inner()[offset_hint];
  659|  3.06k|    auto lsize   = offset_hint << p.shift();
  660|  3.06k|    auto size    = p.this_size();
  661|  3.06k|    auto is_full = (size - lsize) >= (size_t{1} << p.shift());
  662|  3.06k|    return is_full
  ------------------
  |  Branch (662:12): [True: 3.06k, False: 0]
  ------------------
  663|  3.06k|               ? (is_leaf
  ------------------
  |  Branch (663:19): [True: 1.85k, False: 1.20k]
  ------------------
  664|  3.06k|                      ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
  665|  3.06k|                      : make_full_pos(child, p.shift() - B)
  666|  1.20k|                            .visit(v, idx - lsize, args...))
  667|  3.06k|               : (is_leaf
  ------------------
  |  Branch (667:19): [True: 0, False: 0]
  ------------------
  668|      0|                      ? make_leaf_sub_pos(child, size - lsize)
  669|      0|                            .visit(v, idx - lsize, args...)
  670|      0|                      : make_regular_sub_pos(child, p.shift() - B, size - lsize)
  671|      0|                            .visit(v, idx - lsize, args...));
  672|  3.06k|}
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9this_sizeEv:
  794|  4.42k|    size_t this_size() const { return size_; }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_:
  207|  4.05k|    {
  208|  4.05k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  4.05k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_:
 1405|  2.59k|    {
 1406|  2.59k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.59k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8subindexEm:
 1163|  3.86k|    count_t subindex(size_t idx) const { return idx >> shift_; }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11size_beforeEj:
 1170|  3.86k|    {
 1171|  3.86k|        return size_t{offset} << shift_;
 1172|  3.86k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
 1166|  3.86k|    {
 1167|  3.86k|        return size_t{1} << shift_;
 1168|  3.86k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1348|  3.58k|    {
 1349|  3.58k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1349:9): [True: 3.58k, False: 0]
  ------------------
 1350|  3.58k|        auto is_leaf = shift_ == BL;
 1351|  3.58k|        auto child   = node_->inner()[offset_hint];
 1352|  3.58k|        auto lsize   = size_t{offset_hint} << shift_;
 1353|  3.58k|        return is_leaf
  ------------------
  |  Branch (1353:16): [True: 2.19k, False: 1.39k]
  ------------------
 1354|  3.58k|                   ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
 1355|  3.58k|                   : make_full_pos(child, shift_ - B)
 1356|  1.39k|                         .visit(v, idx - lsize, args...);
 1357|  3.58k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10copy_sizesEjjmPm:
 1175|  3.58k|    {
 1176|  3.58k|        auto e = sizes + n;
 1177|  9.66k|        for (; sizes != e; ++sizes) {
  ------------------
  |  Branch (1177:16): [True: 6.07k, False: 3.58k]
  ------------------
 1178|  6.07k|            init = *sizes = init + (size_t{1} << shift_);
 1179|       |            assert(init);
  ------------------
  |  Branch (1179:13): [True: 6.07k, False: 0]
  ------------------
 1180|  6.07k|        }
 1181|  3.58k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
 1160|   239k|    size_t size() const { return branches<B, size_t> << shift_; }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10copy_sizesEjjmPm:
  810|  7.68k|    {
  811|  7.68k|        if (n) {
  ------------------
  |  Branch (811:13): [True: 6.77k, False: 911]
  ------------------
  812|  6.77k|            auto last = offset + n - 1;
  813|  6.77k|            auto e    = sizes + n - 1;
  814|  13.4k|            for (; sizes != e; ++sizes) {
  ------------------
  |  Branch (814:20): [True: 6.66k, False: 6.77k]
  ------------------
  815|  6.66k|                init = *sizes = init + (size_t{1} << shift_);
  816|  6.66k|                assert(init);
  ------------------
  |  Branch (816:17): [True: 6.66k, False: 0]
  ------------------
  817|  6.66k|            }
  818|  6.77k|            *sizes = init + size(last);
  819|       |            assert(*sizes);
  ------------------
  |  Branch (819:13): [True: 6.77k, False: 0]
  ------------------
  820|  6.77k|        }
  821|  7.68k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEj:
  797|  6.77k|    {
  798|  6.77k|        return offset == subindex(size_ - 1) ? size_ - size_before(offset)
  ------------------
  |  Branch (798:16): [True: 4.46k, False: 2.31k]
  ------------------
  799|  6.77k|                                             : size_t{1} << shift_;
  800|  6.77k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10copy_sizesEjjmPm:
 1462|   241k|    {
 1463|   241k|        auto e     = sizes + n;
 1464|   241k|        auto prev  = size_before(offset);
 1465|   241k|        auto these = relaxed_->d.sizes + offset;
 1466|   645k|        for (; sizes != e; ++sizes, ++these) {
  ------------------
  |  Branch (1466:16): [True: 404k, False: 241k]
  ------------------
 1467|   404k|            auto this_size = *these;
 1468|   404k|            init = *sizes = init + (this_size - prev);
 1469|   404k|            assert(init);
  ------------------
  |  Branch (1469:13): [True: 404k, False: 0]
  ------------------
 1470|   404k|            prev = this_size;
 1471|   404k|        }
 1472|   241k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1036|  2.56k|    {
 1037|  2.56k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.56k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
  946|  1.35k|    {
  947|  1.35k|        return towards_sub_oh_regular(*this, v, idx, offset_hint, args...);
  948|  1.35k|    }
_ZN5immer6detail4rbts22towards_sub_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_18slice_left_visitorISD_Lb1EEEJEEEDcOT_T0_mjDpOT1_:
  653|  1.35k|{
  654|  1.35k|    constexpr auto B  = bits<Pos>;
  655|  1.35k|    constexpr auto BL = bits_leaf<Pos>;
  656|  1.35k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (656:5): [True: 1.35k, False: 0]
  ------------------
  657|  1.35k|    auto is_leaf = p.shift() == BL;
  658|  1.35k|    auto child   = p.node()->inner()[offset_hint];
  659|  1.35k|    auto lsize   = offset_hint << p.shift();
  660|  1.35k|    auto size    = p.this_size();
  661|  1.35k|    auto is_full = (size - lsize) >= (size_t{1} << p.shift());
  662|  1.35k|    return is_full
  ------------------
  |  Branch (662:12): [True: 990, False: 365]
  ------------------
  663|  1.35k|               ? (is_leaf
  ------------------
  |  Branch (663:19): [True: 0, False: 990]
  ------------------
  664|    990|                      ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
  665|    990|                      : make_full_pos(child, p.shift() - B)
  666|    990|                            .visit(v, idx - lsize, args...))
  667|  1.35k|               : (is_leaf
  ------------------
  |  Branch (667:19): [True: 0, False: 365]
  ------------------
  668|    365|                      ? make_leaf_sub_pos(child, size - lsize)
  669|      0|                            .visit(v, idx - lsize, args...)
  670|    365|                      : make_regular_sub_pos(child, p.shift() - B, size - lsize)
  671|    365|                            .visit(v, idx - lsize, args...));
  672|  1.35k|}
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_:
 1405|  1.26k|    {
 1406|  1.26k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.26k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1348|    279|    {
 1349|    279|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1349:9): [True: 279, False: 0]
  ------------------
 1350|    279|        auto is_leaf = shift_ == BL;
 1351|    279|        auto child   = node_->inner()[offset_hint];
 1352|    279|        auto lsize   = size_t{offset_hint} << shift_;
 1353|    279|        return is_leaf
  ------------------
  |  Branch (1353:16): [True: 0, False: 279]
  ------------------
 1354|    279|                   ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
 1355|    279|                   : make_full_pos(child, shift_ - B)
 1356|    279|                         .visit(v, idx - lsize, args...);
 1357|    279|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_:
 1036|    365|    {
 1037|    365|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    365|    }
_ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaPT_j:
  766|  10.7k|{
  767|  10.7k|    assert(leaf);
  ------------------
  |  Branch (767:5): [True: 10.7k, False: 0]
  ------------------
  768|  10.7k|    IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf);
  ------------------
  |  |   68|  10.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (768:5): [True: 10.7k, False: 0]
  ------------------
  769|  10.7k|    assert(count > 0);
  ------------------
  |  Branch (769:5): [True: 10.7k, False: 0]
  ------------------
  770|  10.7k|    return singleton_regular_sub_pos<NodeT>{leaf, count};
  771|  10.7k|}
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_14empty_leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_:
  759|  3.22k|    {
  760|  3.22k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  761|  3.22k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  3.22k|{
 1839|  3.22k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 3.22k, False: 0]
  ------------------
 1840|  3.22k|    auto relaxed = node->relaxed();
 1841|  3.22k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.90k, False: 1.31k]
  ------------------
 1842|  1.90k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.90k, False: 0]
  ------------------
 1843|  1.90k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.90k|            .visit(v, std::forward<Args>(args)...);
 1845|  1.90k|    } else {
 1846|  1.31k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.31k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.31k|    }
 1849|  3.22k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1813|  1.90k|    {
 1814|  1.90k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.90k|    }
_ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  735|  34.7k|    shift_t shift() const { return BL; }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  744|  10.7k|    {
  745|  10.7k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_:
  144|   961k|    {
  145|   961k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   961k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_:
 1813|  4.15M|    {
 1814|  4.15M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.15M|    }
_ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  707|   423k|    {
  708|   423k|    }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_:
  744|  3.22k|    {
  745|  3.22k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_:
  144|   334k|    {
  145|   334k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   334k|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  137|   961k|    size_t size() const { return count_; }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_:
 1813|  1.34M|    {
 1814|  1.34M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.34M|    }
_ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEEvT_DpOT0_:
  707|  6.30k|    {
  708|  6.30k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1762|  5.88k|    {
 1763|  5.88k|        auto child      = node_->inner()[0];
 1764|  5.88k|        auto child_size = relaxed_->d.sizes[0];
 1765|  5.88k|        auto is_leaf    = shift_ == BL;
 1766|  5.88k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 5.88k, False: 0]
  ------------------
 1767|  5.88k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 5.88k]
  ------------------
 1768|  5.88k|                       : visit_maybe_relaxed_sub(
 1769|  5.88k|                             child, shift_ - B, child_size, v, args...);
 1770|  5.88k|    }
_ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
   76|  10.7k|    shift_t shift() const { return 0; }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  138|   632k|    shift_t shift() const { return 0; }
_ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  733|  7.50k|    node_t* node() const { return nullptr; }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  5.88k|{
 1839|  5.88k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 5.88k, False: 0]
  ------------------
 1840|  5.88k|    auto relaxed = node->relaxed();
 1841|  5.88k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 5.64k, False: 243]
  ------------------
 1842|  5.64k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 5.64k, False: 0]
  ------------------
 1843|  5.64k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  5.64k|            .visit(v, std::forward<Args>(args)...);
 1845|  5.64k|    } else {
 1846|    243|        return make_regular_sub_pos(node, shift, size)
 1847|    243|            .visit(v, std::forward<Args>(args)...);
 1848|    243|    }
 1849|  5.88k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1813|  5.64k|    {
 1814|  5.64k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  5.64k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1036|    243|    {
 1037|    243|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    243|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
  970|    756|    {
  971|    756|        auto is_leaf = shift_ == BL;
  972|    756|        auto child   = node_->inner()[0];
  973|    756|        auto is_full = size_ >= (size_t{1} << shift_);
  974|    756|        return is_full
  ------------------
  |  Branch (974:16): [True: 756, False: 0]
  ------------------
  975|    756|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 756]
  ------------------
  976|    756|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|    756|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|    756|                   : (is_leaf
  ------------------
  |  Branch (978:23): [True: 0, False: 0]
  ------------------
  979|      0|                          ? make_leaf_sub_pos(child, size_).visit(v, args...)
  980|      0|                          : make_regular_sub_pos(child, shift_ - B, size_)
  981|      0|                                .visit(v, args...));
  982|    756|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  201|  59.6k|    shift_t shift() const { return 0; }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1405|  1.33k|    {
 1406|  1.33k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.33k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1361|    580|    {
 1362|    580|        auto is_leaf = shift_ == BL;
 1363|    580|        auto child   = node_->inner()[0];
 1364|    580|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 580]
  ------------------
 1365|    580|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    580|    }
_ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  711|  85.6k|    {
  712|  85.6k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
 1304|  32.4k|    {
 1305|  32.4k|        each_i(v, 1, branches<B>, args...);
 1306|  32.4k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6each_iINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jjDpOT0_:
 1263|  32.4k|    {
 1264|  32.4k|        auto p = node_->inner() + i;
 1265|  32.4k|        auto e = node_->inner() + n;
 1266|  32.4k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 13.5k, False: 18.9k]
  ------------------
 1267|  54.0k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 40.5k, False: 13.5k]
  ------------------
 1268|  40.5k|                IMMER_PREFETCH(p + 1);
 1269|  40.5k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  40.5k|            }
 1271|  18.9k|        } else {
 1272|  18.9k|            auto ss = shift_ - B;
 1273|  75.6k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 56.7k, False: 18.9k]
  ------------------
 1274|  56.7k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  18.9k|        }
 1276|  32.4k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_:
  207|   119k|    {
  208|   119k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|   119k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_:
 1405|   235k|    {
 1406|   235k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|   235k|    }
_ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEEvT_DpOT0_:
  711|  12.6k|    {
  712|  12.6k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_:
 1304|  7.58k|    {
 1305|  7.58k|        each_i(v, 1, branches<B>, args...);
 1306|  7.58k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6each_iINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jjDpOT0_:
 1263|  7.58k|    {
 1264|  7.58k|        auto p = node_->inner() + i;
 1265|  7.58k|        auto e = node_->inner() + n;
 1266|  7.58k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 4.09k, False: 3.49k]
  ------------------
 1267|  16.3k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 12.2k, False: 4.09k]
  ------------------
 1268|  12.2k|                IMMER_PREFETCH(p + 1);
 1269|  12.2k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  12.2k|            }
 1271|  4.09k|        } else {
 1272|  3.49k|            auto ss = shift_ - B;
 1273|  13.9k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 10.4k, False: 3.49k]
  ------------------
 1274|  10.4k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  3.49k|        }
 1276|  7.58k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_:
  207|  23.1k|    {
  208|  23.1k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  23.1k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  200|   119k|    size_t size() const { return branches<BL>; }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_:
 1405|  28.1k|    {
 1406|  28.1k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  28.1k|    }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_:
  753|    756|    {
  754|    756|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    756|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_:
  144|    756|    {
  145|    756|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    756|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1370|    756|    {
 1371|    756|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 756, False: 0]
  ------------------
 1372|    756|        auto child = node_->inner()[0];
 1373|    756|        return make_full_leaf_pos(child).visit(v, args...);
 1374|    756|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
  207|  1.55k|    {
  208|  1.55k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.55k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  906|  59.6k|    {
  907|  59.6k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 21.5k, False: 38.1k]
  ------------------
  908|  21.5k|            each_right_sub_(v, 1, args...);
  909|  59.6k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE15each_right_sub_INS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_:
  879|  21.5k|    {
  880|  21.5k|        auto last  = count() - 1;
  881|  21.5k|        auto lsize = size_ - (last << shift_);
  882|  21.5k|        auto n     = node()->inner() + i;
  883|  21.5k|        auto e     = node()->inner() + last;
  884|  21.5k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 8.06k, False: 13.5k]
  ------------------
  885|  16.6k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 8.58k, False: 8.06k]
  ------------------
  886|  8.58k|                IMMER_PREFETCH(n + 1);
  887|  8.58k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  8.58k|            }
  889|  8.06k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  13.5k|        } else {
  891|  13.5k|            auto ss = shift_ - B;
  892|  25.0k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 11.5k, False: 13.5k]
  ------------------
  893|  11.5k|                make_full_pos(*n, ss).visit(v, args...);
  894|  13.5k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  13.5k|        }
  896|  21.5k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_:
 1036|   115k|    {
 1037|   115k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   115k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_:
  906|  10.6k|    {
  907|  10.6k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 6.78k, False: 3.86k]
  ------------------
  908|  6.78k|            each_right_sub_(v, 1, args...);
  909|  10.6k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE15each_right_sub_INS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_:
  879|  6.78k|    {
  880|  6.78k|        auto last  = count() - 1;
  881|  6.78k|        auto lsize = size_ - (last << shift_);
  882|  6.78k|        auto n     = node()->inner() + i;
  883|  6.78k|        auto e     = node()->inner() + last;
  884|  6.78k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 2.69k, False: 4.09k]
  ------------------
  885|  6.14k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 3.45k, False: 2.69k]
  ------------------
  886|  3.45k|                IMMER_PREFETCH(n + 1);
  887|  3.45k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  3.45k|            }
  889|  2.69k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  4.09k|        } else {
  891|  4.09k|            auto ss = shift_ - B;
  892|  5.85k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 1.75k, False: 4.09k]
  ------------------
  893|  1.75k|                make_full_pos(*n, ss).visit(v, args...);
  894|  4.09k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  4.09k|        }
  896|  6.78k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcT_DpOT0_:
 1036|  17.8k|    {
 1037|  17.8k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  17.8k|    }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
  753|    802|    {
  754|    802|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    802|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
  144|    802|    {
  145|    802|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    802|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
  986|    802|    {
  987|    802|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 802, False: 0]
  ------------------
  988|    802|        auto child   = node_->inner()[0];
  989|    802|        auto is_full = size_ >= branches<BL>;
  990|    802|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 802, False: 0]
  ------------------
  991|    802|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|    802|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
  144|  1.66k|    {
  145|  1.66k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.66k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
 1647|   679k|    {
 1648|   679k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   679k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_:
 1653|   679k|    {
 1654|   679k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 679k, False: 0]
  ------------------
 1655|   679k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 679k, False: 0]
  ------------------
 1656|   679k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   679k|        auto p = node_->inner();
 1658|   679k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 113k, False: 566k]
  ------------------
 1659|   389k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 275k, False: 113k]
  ------------------
 1660|   275k|                IMMER_PREFETCH(p + i + 1);
 1661|   275k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   275k|                    .visit(v, args...);
 1663|   275k|                s = relaxed_->d.sizes[i];
 1664|   275k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 275k, False: 0]
  ------------------
 1665|   275k|            }
 1666|   566k|        } else {
 1667|   566k|            auto ss = shift_ - B;
 1668|  1.92M|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 1.35M, False: 566k]
  ------------------
 1669|  1.35M|                visit_maybe_relaxed_sub(
 1670|  1.35M|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|  1.35M|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 1.35M, False: 0]
  ------------------
 1673|  1.35M|            }
 1674|   566k|        }
 1675|   679k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcPT_jmT0_DpOT1_:
 1838|  2.67M|{
 1839|  2.67M|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 2.67M, False: 0]
  ------------------
 1840|  2.67M|    auto relaxed = node->relaxed();
 1841|  2.67M|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 2.57M, False: 102k]
  ------------------
 1842|  2.57M|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 2.57M, False: 0]
  ------------------
 1843|  2.57M|        return make_relaxed_pos(node, shift, relaxed)
 1844|  2.57M|            .visit(v, std::forward<Args>(args)...);
 1845|  2.57M|    } else {
 1846|   102k|        return make_regular_sub_pos(node, shift, size)
 1847|   102k|            .visit(v, std::forward<Args>(args)...);
 1848|   102k|    }
 1849|  2.67M|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_:
 1647|   227k|    {
 1648|   227k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   227k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_:
 1653|   227k|    {
 1654|   227k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 227k, False: 0]
  ------------------
 1655|   227k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 227k, False: 0]
  ------------------
 1656|   227k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   227k|        auto p = node_->inner();
 1658|   227k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 40.5k, False: 187k]
  ------------------
 1659|   151k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 111k, False: 40.5k]
  ------------------
 1660|   111k|                IMMER_PREFETCH(p + i + 1);
 1661|   111k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   111k|                    .visit(v, args...);
 1663|   111k|                s = relaxed_->d.sizes[i];
 1664|   111k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 111k, False: 0]
  ------------------
 1665|   111k|            }
 1666|   187k|        } else {
 1667|   187k|            auto ss = shift_ - B;
 1668|   691k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 504k, False: 187k]
  ------------------
 1669|   504k|                visit_maybe_relaxed_sub(
 1670|   504k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|   504k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 504k, False: 0]
  ------------------
 1673|   504k|            }
 1674|   187k|        }
 1675|   227k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|   956k|{
 1839|   956k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 956k, False: 0]
  ------------------
 1840|   956k|    auto relaxed = node->relaxed();
 1841|   956k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 942k, False: 13.7k]
  ------------------
 1842|   942k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 942k, False: 0]
  ------------------
 1843|   942k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   942k|            .visit(v, std::forward<Args>(args)...);
 1845|   942k|    } else {
 1846|  13.7k|        return make_regular_sub_pos(node, shift, size)
 1847|  13.7k|            .visit(v, std::forward<Args>(args)...);
 1848|  13.7k|    }
 1849|   956k|}
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  753|  1.66k|    {
  754|  1.66k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  1.66k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_14empty_leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  144|  1.66k|    {
  145|  1.66k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.66k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1774|  1.66k|    {
 1775|  1.66k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 1.66k, False: 0]
  ------------------
 1776|  1.66k|        auto child      = node_->inner()[0];
 1777|  1.66k|        auto child_size = relaxed_->d.sizes[0];
 1778|  1.66k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  1.66k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EEEEEDcT_DpOT0_:
 1036|  1.31k|    {
 1037|  1.31k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.31k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcPT_jmT0_DpOT1_:
 1838|  47.9k|{
 1839|  47.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 47.9k, False: 0]
  ------------------
 1840|  47.9k|    auto relaxed = node->relaxed();
 1841|  47.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 41.9k, False: 6.03k]
  ------------------
 1842|  41.9k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 41.9k, False: 0]
  ------------------
 1843|  41.9k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  41.9k|            .visit(v, std::forward<Args>(args)...);
 1845|  41.9k|    } else {
 1846|  6.03k|        return make_regular_sub_pos(node, shift, size)
 1847|  6.03k|            .visit(v, std::forward<Args>(args)...);
 1848|  6.03k|    }
 1849|  47.9k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_:
 1813|  41.9k|    {
 1814|  41.9k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  41.9k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  41.9k|{
 1839|  41.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 41.9k, False: 0]
  ------------------
 1840|  41.9k|    auto relaxed = node->relaxed();
 1841|  41.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 39.4k, False: 2.47k]
  ------------------
 1842|  39.4k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 39.4k, False: 0]
  ------------------
 1843|  39.4k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  39.4k|            .visit(v, std::forward<Args>(args)...);
 1845|  39.4k|    } else {
 1846|  2.47k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.47k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.47k|    }
 1849|  41.9k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1813|  39.4k|    {
 1814|  39.4k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  39.4k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
 1750|  2.79k|    {
 1751|  2.79k|        auto offset     = relaxed_->d.count - 1;
 1752|  2.79k|        auto child      = node_->inner()[offset];
 1753|  2.79k|        auto child_size = size(offset);
 1754|  2.79k|        auto is_leaf    = shift_ == BL;
 1755|  2.79k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 2.79k]
  ------------------
 1756|  2.79k|                       : visit_maybe_relaxed_sub(
 1757|  2.79k|                             child, shift_ - B, child_size, v, args...);
 1758|  2.79k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  2.79k|{
 1839|  2.79k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 2.79k, False: 0]
  ------------------
 1840|  2.79k|    auto relaxed = node->relaxed();
 1841|  2.79k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 2.47k, False: 325]
  ------------------
 1842|  2.47k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 2.47k, False: 0]
  ------------------
 1843|  2.47k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  2.47k|            .visit(v, std::forward<Args>(args)...);
 1845|  2.47k|    } else {
 1846|    325|        return make_regular_sub_pos(node, shift, size)
 1847|    325|            .visit(v, std::forward<Args>(args)...);
 1848|    325|    }
 1849|  2.79k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
 1813|  2.47k|    {
 1814|  2.47k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  2.47k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
 1036|    780|    {
 1037|    780|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    780|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  958|    455|    {
  959|    455|        auto offset  = count() - 1;
  960|    455|        auto child   = node_->inner()[offset];
  961|    455|        auto is_leaf = shift_ == BL;
  962|    455|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|    455|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 455]
  ------------------
  964|    455|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|    455|                             .visit(v, args...);
  966|    455|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  913|   174k|    {
  914|   174k|        each_left(v, count() - 1, args...);
  915|   174k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_:
  873|   174k|    {
  874|   174k|        return each_left_regular(*this, v, last, args...);
  875|   174k|    }
_ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvOT_T0_jDpOT1_:
  575|   174k|{
  576|   174k|    constexpr auto B  = bits<Pos>;
  577|   174k|    constexpr auto BL = bits_leaf<Pos>;
  578|   174k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 174k, False: 0]
  ------------------
  579|   174k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 58.7k, False: 115k]
  ------------------
  580|  58.7k|        auto n = p.node()->inner();
  581|  58.7k|        auto e = n + last;
  582|   129k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 70.5k, False: 58.7k]
  ------------------
  583|  70.5k|            IMMER_PREFETCH(n + 1);
  584|  70.5k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  70.5k|        }
  586|   115k|    } else {
  587|   115k|        auto n  = p.node()->inner();
  588|   115k|        auto e  = n + last;
  589|   115k|        auto ss = p.shift() - B;
  590|   282k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 167k, False: 115k]
  ------------------
  591|   167k|            make_full_pos(*n, ss).visit(v, args...);
  592|   115k|    }
  593|   174k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_:
  913|  23.7k|    {
  914|  23.7k|        each_left(v, count() - 1, args...);
  915|  23.7k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_:
  873|  23.7k|    {
  874|  23.7k|        return each_left_regular(*this, v, last, args...);
  875|  23.7k|    }
_ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21concat_merger_visitorEJRNS1_13concat_mergerISD_EEEEEvOT_T0_jDpOT1_:
  575|  23.7k|{
  576|  23.7k|    constexpr auto B  = bits<Pos>;
  577|  23.7k|    constexpr auto BL = bits_leaf<Pos>;
  578|  23.7k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 23.7k, False: 0]
  ------------------
  579|  23.7k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 11.1k, False: 12.6k]
  ------------------
  580|  11.1k|        auto n = p.node()->inner();
  581|  11.1k|        auto e = n + last;
  582|  18.5k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 7.44k, False: 11.1k]
  ------------------
  583|  7.44k|            IMMER_PREFETCH(n + 1);
  584|  7.44k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  7.44k|        }
  586|  12.6k|    } else {
  587|  12.6k|        auto n  = p.node()->inner();
  588|  12.6k|        auto e  = n + last;
  589|  12.6k|        auto ss = p.shift() - B;
  590|  28.4k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 15.8k, False: 12.6k]
  ------------------
  591|  15.8k|            make_full_pos(*n, ss).visit(v, args...);
  592|  12.6k|    }
  593|  23.7k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1762|  12.9k|    {
 1763|  12.9k|        auto child      = node_->inner()[0];
 1764|  12.9k|        auto child_size = relaxed_->d.sizes[0];
 1765|  12.9k|        auto is_leaf    = shift_ == BL;
 1766|  12.9k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 12.9k, False: 0]
  ------------------
 1767|  12.9k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 12.9k]
  ------------------
 1768|  12.9k|                       : visit_maybe_relaxed_sub(
 1769|  12.9k|                             child, shift_ - B, child_size, v, args...);
 1770|  12.9k|    }
_ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  106|   162k|    shift_t shift() const { return 0; }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  12.9k|{
 1839|  12.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 12.9k, False: 0]
  ------------------
 1840|  12.9k|    auto relaxed = node->relaxed();
 1841|  12.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 11.5k, False: 1.37k]
  ------------------
 1842|  11.5k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 11.5k, False: 0]
  ------------------
 1843|  11.5k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  11.5k|            .visit(v, std::forward<Args>(args)...);
 1845|  11.5k|    } else {
 1846|  1.37k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.37k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.37k|    }
 1849|  12.9k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1813|  11.5k|    {
 1814|  11.5k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  11.5k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1036|  1.37k|    {
 1037|  1.37k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.37k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
  958|  1.10k|    {
  959|  1.10k|        auto offset  = count() - 1;
  960|  1.10k|        auto child   = node_->inner()[offset];
  961|  1.10k|        auto is_leaf = shift_ == BL;
  962|  1.10k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  1.10k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 1.10k]
  ------------------
  964|  1.10k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.10k|                             .visit(v, args...);
  966|  1.10k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
 1036|  1.51k|    {
 1037|  1.51k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.51k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
  970|  2.16k|    {
  971|  2.16k|        auto is_leaf = shift_ == BL;
  972|  2.16k|        auto child   = node_->inner()[0];
  973|  2.16k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  2.16k|        return is_full
  ------------------
  |  Branch (974:16): [True: 2.16k, False: 0]
  ------------------
  975|  2.16k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 2.16k]
  ------------------
  976|  2.16k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  2.16k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  2.16k|                   : (is_leaf
  ------------------
  |  Branch (978:23): [True: 0, False: 0]
  ------------------
  979|      0|                          ? make_leaf_sub_pos(child, size_).visit(v, args...)
  980|      0|                          : make_regular_sub_pos(child, shift_ - B, size_)
  981|      0|                                .visit(v, args...));
  982|  2.16k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1405|  4.39k|    {
 1406|  4.39k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  4.39k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1361|  2.23k|    {
 1362|  2.23k|        auto is_leaf = shift_ == BL;
 1363|  2.23k|        auto child   = node_->inner()[0];
 1364|  2.23k|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 2.23k]
  ------------------
 1365|  2.23k|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|  2.23k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_:
  958|  4.17k|    {
  959|  4.17k|        auto offset  = count() - 1;
  960|  4.17k|        auto child   = node_->inner()[offset];
  961|  4.17k|        auto is_leaf = shift_ == BL;
  962|  4.17k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  4.17k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 2.36k, False: 1.81k]
  ------------------
  964|  4.17k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.81k|                             .visit(v, args...);
  966|  4.17k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_:
  144|  3.33k|    {
  145|  3.33k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.33k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1370|  3.33k|    {
 1371|  3.33k|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 3.33k, False: 0]
  ------------------
 1372|  3.33k|        auto child = node_->inner()[0];
 1373|  3.33k|        return make_full_leaf_pos(child).visit(v, args...);
 1374|  3.33k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
  207|  9.09k|    {
  208|  9.09k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  9.09k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_:
 1036|  2.01k|    {
 1037|  2.01k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.01k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
  958|  6.21k|    {
  959|  6.21k|        auto offset  = count() - 1;
  960|  6.21k|        auto child   = node_->inner()[offset];
  961|  6.21k|        auto is_leaf = shift_ == BL;
  962|  6.21k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  6.21k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 5.06k, False: 1.14k]
  ------------------
  964|  6.21k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.14k|                             .visit(v, args...);
  966|  6.21k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
  144|  5.76k|    {
  145|  5.76k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  5.76k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
  986|  5.76k|    {
  987|  5.76k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 5.76k, False: 0]
  ------------------
  988|  5.76k|        auto child   = node_->inner()[0];
  989|  5.76k|        auto is_full = size_ >= branches<BL>;
  990|  5.76k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 5.76k, False: 0]
  ------------------
  991|  5.76k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  5.76k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
  144|  38.8k|    {
  145|  38.8k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  38.8k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
 1036|  1.54k|    {
 1037|  1.54k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.54k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  958|  11.7k|    {
  959|  11.7k|        auto offset  = count() - 1;
  960|  11.7k|        auto child   = node_->inner()[offset];
  961|  11.7k|        auto is_leaf = shift_ == BL;
  962|  11.7k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  11.7k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 3.67k, False: 8.09k]
  ------------------
  964|  11.7k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  8.09k|                             .visit(v, args...);
  966|  11.7k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  144|  38.8k|    {
  145|  38.8k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  38.8k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_20concat_right_visitorISC_EEJRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1774|  38.8k|    {
 1775|  38.8k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 38.8k, False: 0]
  ------------------
 1776|  38.8k|        auto child      = node_->inner()[0];
 1777|  38.8k|        auto child_size = relaxed_->d.sizes[0];
 1778|  38.8k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  38.8k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
 1036|  11.8k|    {
 1037|  11.8k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  11.8k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
 1617|   924k|    {
 1618|   924k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   924k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9each_leftINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_jDpOT0_:
 1623|   924k|    {
 1624|   924k|        auto p = node_->inner();
 1625|   924k|        auto s = size_t{};
 1626|   924k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 103k, False: 821k]
  ------------------
 1627|   272k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 168k, False: 103k]
  ------------------
 1628|   168k|                IMMER_PREFETCH(p + i + 1);
 1629|   168k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|   168k|                    .visit(v, args...);
 1631|   168k|                s = relaxed_->d.sizes[i];
 1632|   168k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 168k, False: 0]
  ------------------
 1633|   168k|            }
 1634|   821k|        } else {
 1635|   821k|            auto ss = shift_ - B;
 1636|  2.13M|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 1.31M, False: 821k]
  ------------------
 1637|  1.31M|                visit_maybe_relaxed_sub(
 1638|  1.31M|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|  1.31M|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 1.31M, False: 0]
  ------------------
 1641|  1.31M|            }
 1642|   821k|        }
 1643|   924k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_DpOT0_:
 1617|   212k|    {
 1618|   212k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   212k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9each_leftINS1_21concat_merger_visitorEJRNS1_13concat_mergerISC_EEEEEvT_jDpOT0_:
 1623|   212k|    {
 1624|   212k|        auto p = node_->inner();
 1625|   212k|        auto s = size_t{};
 1626|   212k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 36.8k, False: 175k]
  ------------------
 1627|   106k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 69.9k, False: 36.8k]
  ------------------
 1628|  69.9k|                IMMER_PREFETCH(p + i + 1);
 1629|  69.9k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|  69.9k|                    .visit(v, args...);
 1631|  69.9k|                s = relaxed_->d.sizes[i];
 1632|  69.9k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 69.9k, False: 0]
  ------------------
 1633|  69.9k|            }
 1634|   175k|        } else {
 1635|   175k|            auto ss = shift_ - B;
 1636|   628k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 452k, False: 175k]
  ------------------
 1637|   452k|                visit_maybe_relaxed_sub(
 1638|   452k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|   452k|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 452k, False: 0]
  ------------------
 1641|   452k|            }
 1642|   175k|        }
 1643|   212k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1762|   168k|    {
 1763|   168k|        auto child      = node_->inner()[0];
 1764|   168k|        auto child_size = relaxed_->d.sizes[0];
 1765|   168k|        auto is_leaf    = shift_ == BL;
 1766|   168k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 168k, False: 0]
  ------------------
 1767|   168k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 168k]
  ------------------
 1768|   168k|                       : visit_maybe_relaxed_sub(
 1769|   168k|                             child, shift_ - B, child_size, v, args...);
 1770|   168k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|   168k|{
 1839|   168k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 168k, False: 0]
  ------------------
 1840|   168k|    auto relaxed = node->relaxed();
 1841|   168k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 168k, False: 199]
  ------------------
 1842|   168k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 168k, False: 0]
  ------------------
 1843|   168k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   168k|            .visit(v, std::forward<Args>(args)...);
 1845|   168k|    } else {
 1846|    199|        return make_regular_sub_pos(node, shift, size)
 1847|    199|            .visit(v, std::forward<Args>(args)...);
 1848|    199|    }
 1849|   168k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1813|   168k|    {
 1814|   168k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   168k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1036|    199|    {
 1037|    199|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    199|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1750|  1.94k|    {
 1751|  1.94k|        auto offset     = relaxed_->d.count - 1;
 1752|  1.94k|        auto child      = node_->inner()[offset];
 1753|  1.94k|        auto child_size = size(offset);
 1754|  1.94k|        auto is_leaf    = shift_ == BL;
 1755|  1.94k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 1.94k]
  ------------------
 1756|  1.94k|                       : visit_maybe_relaxed_sub(
 1757|  1.94k|                             child, shift_ - B, child_size, v, args...);
 1758|  1.94k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  1.94k|{
 1839|  1.94k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 1.94k, False: 0]
  ------------------
 1840|  1.94k|    auto relaxed = node->relaxed();
 1841|  1.94k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.54k, False: 404]
  ------------------
 1842|  1.54k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.54k, False: 0]
  ------------------
 1843|  1.54k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.54k|            .visit(v, std::forward<Args>(args)...);
 1845|  1.54k|    } else {
 1846|    404|        return make_regular_sub_pos(node, shift, size)
 1847|    404|            .visit(v, std::forward<Args>(args)...);
 1848|    404|    }
 1849|  1.94k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_left_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1813|  1.54k|    {
 1814|  1.54k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.54k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
  970|  1.17k|    {
  971|  1.17k|        auto is_leaf = shift_ == BL;
  972|  1.17k|        auto child   = node_->inner()[0];
  973|  1.17k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  1.17k|        return is_full
  ------------------
  |  Branch (974:16): [True: 1.17k, False: 0]
  ------------------
  975|  1.17k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 1.17k]
  ------------------
  976|  1.17k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  1.17k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  1.17k|                   : (is_leaf
  ------------------
  |  Branch (978:23): [True: 0, False: 0]
  ------------------
  979|      0|                          ? make_leaf_sub_pos(child, size_).visit(v, args...)
  980|      0|                          : make_regular_sub_pos(child, shift_ - B, size_)
  981|      0|                                .visit(v, args...));
  982|  1.17k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1405|  1.86k|    {
 1406|  1.86k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.86k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1361|    686|    {
 1362|    686|        auto is_leaf = shift_ == BL;
 1363|    686|        auto child   = node_->inner()[0];
 1364|    686|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 686]
  ------------------
 1365|    686|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    686|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_:
 1750|  1.57k|    {
 1751|  1.57k|        auto offset     = relaxed_->d.count - 1;
 1752|  1.57k|        auto child      = node_->inner()[offset];
 1753|  1.57k|        auto child_size = size(offset);
 1754|  1.57k|        auto is_leaf    = shift_ == BL;
 1755|  1.57k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 976, False: 595]
  ------------------
 1756|  1.57k|                       : visit_maybe_relaxed_sub(
 1757|    595|                             child, shift_ - B, child_size, v, args...);
 1758|  1.57k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|    595|{
 1839|    595|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 595, False: 0]
  ------------------
 1840|    595|    auto relaxed = node->relaxed();
 1841|    595|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 395, False: 200]
  ------------------
 1842|    395|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 395, False: 0]
  ------------------
 1843|    395|        return make_relaxed_pos(node, shift, relaxed)
 1844|    395|            .visit(v, std::forward<Args>(args)...);
 1845|    395|    } else {
 1846|    200|        return make_regular_sub_pos(node, shift, size)
 1847|    200|            .visit(v, std::forward<Args>(args)...);
 1848|    200|    }
 1849|    595|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_8full_posISC_EEEEEDcT_DpOT0_:
 1813|    395|    {
 1814|    395|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    395|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1750|  1.56k|    {
 1751|  1.56k|        auto offset     = relaxed_->d.count - 1;
 1752|  1.56k|        auto child      = node_->inner()[offset];
 1753|  1.56k|        auto child_size = size(offset);
 1754|  1.56k|        auto is_leaf    = shift_ == BL;
 1755|  1.56k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 692, False: 877]
  ------------------
 1756|  1.56k|                       : visit_maybe_relaxed_sub(
 1757|    877|                             child, shift_ - B, child_size, v, args...);
 1758|  1.56k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|    877|{
 1839|    877|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 877, False: 0]
  ------------------
 1840|    877|    auto relaxed = node->relaxed();
 1841|    877|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 477, False: 400]
  ------------------
 1842|    477|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 477, False: 0]
  ------------------
 1843|    477|        return make_relaxed_pos(node, shift, relaxed)
 1844|    477|            .visit(v, std::forward<Args>(args)...);
 1845|    477|    } else {
 1846|    400|        return make_regular_sub_pos(node, shift, size)
 1847|    400|            .visit(v, std::forward<Args>(args)...);
 1848|    400|    }
 1849|    877|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1813|    477|    {
 1814|    477|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    477|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
 1750|   204k|    {
 1751|   204k|        auto offset     = relaxed_->d.count - 1;
 1752|   204k|        auto child      = node_->inner()[offset];
 1753|   204k|        auto child_size = size(offset);
 1754|   204k|        auto is_leaf    = shift_ == BL;
 1755|   204k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 35.1k, False: 169k]
  ------------------
 1756|   204k|                       : visit_maybe_relaxed_sub(
 1757|   169k|                             child, shift_ - B, child_size, v, args...);
 1758|   204k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|   169k|{
 1839|   169k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 169k, False: 0]
  ------------------
 1840|   169k|    auto relaxed = node->relaxed();
 1841|   169k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 165k, False: 3.74k]
  ------------------
 1842|   165k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 165k, False: 0]
  ------------------
 1843|   165k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   165k|            .visit(v, std::forward<Args>(args)...);
 1845|   165k|    } else {
 1846|  3.74k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.74k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.74k|    }
 1849|   169k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERSD_EEEDcT_DpOT0_:
 1813|   165k|    {
 1814|   165k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   165k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1036|  2.47k|    {
 1037|  2.47k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.47k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_trees_left_visitorISC_EEJNS1_8leaf_posISC_EERPSC_RjRmEEEDcT_DpOT0_:
 1036|  6.03k|    {
 1037|  6.03k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  6.03k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  6.03k|{
 1839|  6.03k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 6.03k, False: 0]
  ------------------
 1840|  6.03k|    auto relaxed = node->relaxed();
 1841|  6.03k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 982, False: 5.04k]
  ------------------
 1842|    982|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 982, False: 0]
  ------------------
 1843|    982|        return make_relaxed_pos(node, shift, relaxed)
 1844|    982|            .visit(v, std::forward<Args>(args)...);
 1845|  5.04k|    } else {
 1846|  5.04k|        return make_regular_sub_pos(node, shift, size)
 1847|  5.04k|            .visit(v, std::forward<Args>(args)...);
 1848|  5.04k|    }
 1849|  6.03k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1813|    982|    {
 1814|    982|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    982|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_26concat_trees_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1036|  5.04k|    {
 1037|  5.04k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  5.04k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_:
 1813|   888k|    {
 1814|   888k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   888k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_:
 1737|   876k|    {
 1738|   876k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 876k, False: 0]
  ------------------
 1739|   876k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 876k, False: 0]
  ------------------
 1740|   876k|        auto child   = node_->inner()[offset_hint];
 1741|   876k|        auto is_leaf = shift_ == BL;
 1742|   876k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 876k]
  ------------------
 1743|   876k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|   876k|                   : visit_maybe_relaxed_sub(
 1745|   876k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|   876k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_:
 1838|   876k|{
 1839|   876k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 876k, False: 0]
  ------------------
 1840|   876k|    auto relaxed = node->relaxed();
 1841|   876k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 208k, False: 667k]
  ------------------
 1842|   208k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 208k, False: 0]
  ------------------
 1843|   208k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   208k|            .visit(v, std::forward<Args>(args)...);
 1845|   667k|    } else {
 1846|   667k|        return make_regular_sub_pos(node, shift, size)
 1847|   667k|            .visit(v, std::forward<Args>(args)...);
 1848|   667k|    }
 1849|   876k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_:
 1036|   667k|    {
 1037|   667k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   667k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_:
  952|  1.68M|    {
  953|  1.68M|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  1.68M|    }
_ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_:
  677|  1.68M|{
  678|  1.68M|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 1.68M, False: 0]
  ------------------
  679|  1.68M|    constexpr auto B  = bits<Pos>;
  680|  1.68M|    constexpr auto BL = bits_leaf<Pos>;
  681|  1.68M|    auto child        = p.node()->inner()[offset_hint];
  682|  1.68M|    auto is_leaf      = p.shift() == BL;
  683|  1.68M|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 1.68M]
  ------------------
  684|  1.68M|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  1.68M|                         .visit(v, args...);
  686|  1.68M|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_:
  336|  9.09M|    {
  337|  9.09M|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  9.09M|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_:
  330|  7.40M|    {
  331|  7.40M|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  7.40M|    }
_ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb1EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_:
  677|  7.40M|{
  678|  7.40M|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 7.40M, False: 0]
  ------------------
  679|  7.40M|    constexpr auto B  = bits<Pos>;
  680|  7.40M|    constexpr auto BL = bits_leaf<Pos>;
  681|  7.40M|    auto child        = p.node()->inner()[offset_hint];
  682|  7.40M|    auto is_leaf      = p.shift() == BL;
  683|  7.40M|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 7.40M]
  ------------------
  684|  7.40M|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  7.40M|                         .visit(v, args...);
  686|  7.40M|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_:
  330|  4.57k|    {
  331|  4.57k|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  4.57k|    }
_ZN5immer6detail4rbts15last_oh_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_:
  677|  4.57k|{
  678|  4.57k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 4.57k, False: 0]
  ------------------
  679|  4.57k|    constexpr auto B  = bits<Pos>;
  680|  4.57k|    constexpr auto BL = bits_leaf<Pos>;
  681|  4.57k|    auto child        = p.node()->inner()[offset_hint];
  682|  4.57k|    auto is_leaf      = p.shift() == BL;
  683|  4.57k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 4.57k]
  ------------------
  684|  4.57k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  4.57k|                         .visit(v, args...);
  686|  4.57k|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_:
  336|  8.50k|    {
  337|  8.50k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  8.50k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_:
  952|  3.93k|    {
  953|  3.93k|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  3.93k|    }
_ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_:
  677|  3.93k|{
  678|  3.93k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 3.93k, False: 0]
  ------------------
  679|  3.93k|    constexpr auto B  = bits<Pos>;
  680|  3.93k|    constexpr auto BL = bits_leaf<Pos>;
  681|  3.93k|    auto child        = p.node()->inner()[offset_hint];
  682|  3.93k|    auto is_leaf      = p.shift() == BL;
  683|  3.93k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 3.93k]
  ------------------
  684|  3.93k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  3.93k|                         .visit(v, args...);
  686|  3.93k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11last_oh_cshINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_jmDpOT0_:
 1737|  21.9k|    {
 1738|  21.9k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 21.9k, False: 0]
  ------------------
 1739|  21.9k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 21.9k, False: 0]
  ------------------
 1740|  21.9k|        auto child   = node_->inner()[offset_hint];
 1741|  21.9k|        auto is_leaf = shift_ == BL;
 1742|  21.9k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 21.9k]
  ------------------
 1743|  21.9k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|  21.9k|                   : visit_maybe_relaxed_sub(
 1745|  21.9k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|  21.9k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcPT_jmT0_DpOT1_:
 1838|  21.9k|{
 1839|  21.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 21.9k, False: 0]
  ------------------
 1840|  21.9k|    auto relaxed = node->relaxed();
 1841|  21.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 18.8k, False: 3.06k]
  ------------------
 1842|  18.8k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 18.8k, False: 0]
  ------------------
 1843|  18.8k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  18.8k|            .visit(v, std::forward<Args>(args)...);
 1845|  18.8k|    } else {
 1846|  3.06k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.06k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.06k|    }
 1849|  21.9k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_:
 1813|  18.8k|    {
 1814|  18.8k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  18.8k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_RjEEEDcT_DpOT0_:
 1036|  3.06k|    {
 1037|  3.06k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.06k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_:
 1036|  1.04M|    {
 1037|  1.04M|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.04M|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcPT_jmT0_DpOT1_:
 1838|  10.8k|{
 1839|  10.8k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 10.8k, False: 0]
  ------------------
 1840|  10.8k|    auto relaxed = node->relaxed();
 1841|  10.8k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 5.29k, False: 5.56k]
  ------------------
 1842|  5.29k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 5.29k, False: 0]
  ------------------
 1843|  5.29k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  5.29k|            .visit(v, std::forward<Args>(args)...);
 1845|  5.56k|    } else {
 1846|  5.56k|        return make_regular_sub_pos(node, shift, size)
 1847|  5.56k|            .visit(v, std::forward<Args>(args)...);
 1848|  5.56k|    }
 1849|  10.8k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_:
 1813|  5.29k|    {
 1814|  5.29k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  5.29k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjDpOT0_:
 1686|  23.5k|    {
 1687|  23.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 23.5k, False: 0]
  ------------------
 1688|  23.5k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 4.64k, False: 18.9k]
  ------------------
 1689|  23.5k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  23.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_:
 1698|  23.5k|    {
 1699|  23.5k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  23.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjmDpOT0_:
 1717|  23.5k|    {
 1718|  23.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 23.5k, False: 0]
  ------------------
 1719|  23.5k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 4.64k, False: 18.9k]
  |  Branch (1719:9): [True: 23.5k, False: 0]
  ------------------
 1720|  23.5k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  23.5k|        auto child     = node_->inner()[offset_hint];
 1722|  23.5k|        auto is_leaf   = shift_ == BL;
 1723|  23.5k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  23.5k|        auto next_idx  = idx - left_size_hint;
 1725|  23.5k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 3.35k, False: 20.2k]
  ------------------
 1726|  23.5k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  3.35k|                         .visit(v, next_idx, args...)
 1728|  23.5k|                   : visit_maybe_relaxed_sub(
 1729|  20.2k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  23.5k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_:
  144|  3.35k|    {
  145|  3.35k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.35k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcPT_jmT0_DpOT1_:
 1838|  20.2k|{
 1839|  20.2k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 20.2k, False: 0]
  ------------------
 1840|  20.2k|    auto relaxed = node->relaxed();
 1841|  20.2k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 18.2k, False: 1.94k]
  ------------------
 1842|  18.2k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 18.2k, False: 0]
  ------------------
 1843|  18.2k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  18.2k|            .visit(v, std::forward<Args>(args)...);
 1845|  18.2k|    } else {
 1846|  1.94k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.94k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.94k|    }
 1849|  20.2k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_:
 1813|  18.2k|    {
 1814|  18.2k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  18.2k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_:
 1036|  1.94k|    {
 1037|  1.94k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.94k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_:
  938|  7.50k|    {
  939|  7.50k|        return towards_oh_ch_regular(
  940|  7.50k|            *this, v, idx, offset_hint, count(), args...);
  941|  7.50k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_:
  632|  7.50k|{
  633|  7.50k|    constexpr auto B  = bits<Pos>;
  634|  7.50k|    constexpr auto BL = bits_leaf<Pos>;
  635|  7.50k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 7.50k, False: 0]
  ------------------
  636|  7.50k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 7.50k, False: 0]
  ------------------
  637|  7.50k|    auto is_leaf = p.shift() == BL;
  638|  7.50k|    auto child   = p.node()->inner()[offset_hint];
  639|  7.50k|    auto is_full = offset_hint + 1 != count_hint;
  640|  7.50k|    return is_full
  ------------------
  |  Branch (640:12): [True: 4.84k, False: 2.65k]
  ------------------
  641|  7.50k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 1.10k, False: 3.73k]
  ------------------
  642|  4.84k|                          : make_full_pos(child, p.shift() - B)
  643|  3.73k|                                .visit(v, idx, args...))
  644|  7.50k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 666, False: 1.99k]
  ------------------
  645|  2.65k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.65k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.99k|                            .visit(v, idx, args...));
  648|  7.50k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_:
  207|  6.11k|    {
  208|  6.11k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  6.11k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_:
 1405|  6.76k|    {
 1406|  6.76k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  6.76k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_:
 1329|  6.76k|    {
 1330|  6.76k|        return towards_oh(v, idx, offset_hint, args...);
 1331|  6.76k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_mjDpOT0_:
 1336|  6.76k|    {
 1337|  6.76k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 6.76k, False: 0]
  ------------------
 1338|  6.76k|        auto is_leaf = shift_ == BL;
 1339|  6.76k|        auto child   = node_->inner()[offset_hint];
 1340|  6.76k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 4.19k, False: 2.56k]
  ------------------
 1341|  6.76k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  6.76k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  6.76k|    }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_:
  112|  1.39k|    {
  113|  1.39k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  1.39k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editERPPSC_EEEDcT_DpOT0_:
  336|  3.05k|    {
  337|  3.05k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  3.05k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_:
  316|  3.05k|    {
  317|  3.05k|        return towards_oh_ch_regular(
  318|  3.05k|            *this, v, idx, offset_hint, count(), args...);
  319|  3.05k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_15get_mut_visitorISD_EEJRNSB_5applyIS8_E4type4editERPPSD_EEEDcOT_T0_mjjDpOT1_:
  632|  3.05k|{
  633|  3.05k|    constexpr auto B  = bits<Pos>;
  634|  3.05k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.05k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.05k, False: 0]
  ------------------
  636|  3.05k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.05k, False: 0]
  ------------------
  637|  3.05k|    auto is_leaf = p.shift() == BL;
  638|  3.05k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.05k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.05k|    return is_full
  ------------------
  |  Branch (640:12): [True: 1.26k, False: 1.79k]
  ------------------
  641|  3.05k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 814, False: 455]
  ------------------
  642|  1.26k|                          : make_full_pos(child, p.shift() - B)
  643|    455|                                .visit(v, idx, args...))
  644|  3.05k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 724, False: 1.06k]
  ------------------
  645|  1.79k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.79k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.06k|                            .visit(v, idx, args...));
  648|  3.05k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_15get_mut_visitorISC_EEJRmRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_DpOT0_:
 1036|  5.56k|    {
 1037|  5.56k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  5.56k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_:
 1838|  69.9k|{
 1839|  69.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 69.9k, False: 0]
  ------------------
 1840|  69.9k|    auto relaxed = node->relaxed();
 1841|  69.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 55.3k, False: 14.5k]
  ------------------
 1842|  55.3k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 55.3k, False: 0]
  ------------------
 1843|  55.3k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  55.3k|            .visit(v, std::forward<Args>(args)...);
 1845|  55.3k|    } else {
 1846|  14.5k|        return make_regular_sub_pos(node, shift, size)
 1847|  14.5k|            .visit(v, std::forward<Args>(args)...);
 1848|  14.5k|    }
 1849|  69.9k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1813|  55.3k|    {
 1814|  55.3k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  55.3k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1686|  36.5k|    {
 1687|  36.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 36.5k, False: 0]
  ------------------
 1688|  36.5k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 36.5k]
  ------------------
 1689|  36.5k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  36.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1698|  36.5k|    {
 1699|  36.5k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  36.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  36.5k|    {
 1718|  36.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 36.5k, False: 0]
  ------------------
 1719|  36.5k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 36.5k]
  |  Branch (1719:9): [True: 36.5k, False: 0]
  ------------------
 1720|  36.5k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  36.5k|        auto child     = node_->inner()[offset_hint];
 1722|  36.5k|        auto is_leaf   = shift_ == BL;
 1723|  36.5k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  36.5k|        auto next_idx  = idx - left_size_hint;
 1725|  36.5k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 2.58k, False: 33.9k]
  ------------------
 1726|  36.5k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  2.58k|                         .visit(v, next_idx, args...)
 1728|  36.5k|                   : visit_maybe_relaxed_sub(
 1729|  33.9k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  36.5k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  144|  2.58k|    {
  145|  2.58k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  2.58k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1686|  37.0k|    {
 1687|  37.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 37.0k, False: 0]
  ------------------
 1688|  37.0k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 37.0k]
  ------------------
 1689|  37.0k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  37.0k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1698|  37.0k|    {
 1699|  37.0k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  37.0k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  37.0k|    {
 1718|  37.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 37.0k, False: 0]
  ------------------
 1719|  37.0k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 37.0k]
  |  Branch (1719:9): [True: 37.0k, False: 0]
  ------------------
 1720|  37.0k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  37.0k|        auto child     = node_->inner()[offset_hint];
 1722|  37.0k|        auto is_leaf   = shift_ == BL;
 1723|  37.0k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  37.0k|        auto next_idx  = idx - left_size_hint;
 1725|  37.0k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 1.53k, False: 35.4k]
  ------------------
 1726|  37.0k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  1.53k|                         .visit(v, next_idx, args...)
 1728|  37.0k|                   : visit_maybe_relaxed_sub(
 1729|  35.4k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  37.0k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  144|  1.53k|    {
  145|  1.53k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.53k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_:
 1838|  35.4k|{
 1839|  35.4k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 35.4k, False: 0]
  ------------------
 1840|  35.4k|    auto relaxed = node->relaxed();
 1841|  35.4k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 34.3k, False: 1.12k]
  ------------------
 1842|  34.3k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 34.3k, False: 0]
  ------------------
 1843|  34.3k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  34.3k|            .visit(v, std::forward<Args>(args)...);
 1845|  34.3k|    } else {
 1846|  1.12k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.12k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.12k|    }
 1849|  35.4k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1813|  34.3k|    {
 1814|  34.3k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  34.3k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1036|  1.12k|    {
 1037|  1.12k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.12k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
  927|  3.26k|    {
  928|  3.26k|        return towards_oh_ch_regular(
  929|  3.26k|            *this, v, idx, offset_hint, count(), args...);
  930|  3.26k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_:
  632|  3.26k|{
  633|  3.26k|    constexpr auto B  = bits<Pos>;
  634|  3.26k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.26k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.26k, False: 0]
  ------------------
  636|  3.26k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.26k, False: 0]
  ------------------
  637|  3.26k|    auto is_leaf = p.shift() == BL;
  638|  3.26k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.26k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.26k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.46k, False: 799]
  ------------------
  641|  3.26k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 650, False: 1.81k]
  ------------------
  642|  2.46k|                          : make_full_pos(child, p.shift() - B)
  643|  1.81k|                                .visit(v, idx, args...))
  644|  3.26k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 799, False: 0]
  ------------------
  645|    799|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    799|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .visit(v, idx, args...));
  648|  3.26k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  1.50k|    {
  208|  1.50k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.50k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1405|  2.54k|    {
 1406|  2.54k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.54k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1336|  1.57k|    {
 1337|  1.57k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.57k, False: 0]
  ------------------
 1338|  1.57k|        auto is_leaf = shift_ == BL;
 1339|  1.57k|        auto child   = node_->inner()[offset_hint];
 1340|  1.57k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 856, False: 723]
  ------------------
 1341|  1.57k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.57k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.57k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1336|  1.96k|    {
 1337|  1.96k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.96k, False: 0]
  ------------------
 1338|  1.96k|        auto is_leaf = shift_ == BL;
 1339|  1.96k|        auto child   = node_->inner()[offset_hint];
 1340|  1.96k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 1.03k, False: 936]
  ------------------
 1341|  1.96k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.96k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.96k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  2.78k|    {
  208|  2.78k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  2.78k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1405|  3.41k|    {
 1406|  3.41k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  3.41k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1405|  1.99k|    {
 1406|  1.99k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.99k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1336|  8.92k|    {
 1337|  8.92k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 8.92k, False: 0]
  ------------------
 1338|  8.92k|        auto is_leaf = shift_ == BL;
 1339|  8.92k|        auto child   = node_->inner()[offset_hint];
 1340|  8.92k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 6.39k, False: 2.52k]
  ------------------
 1341|  8.92k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  8.92k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  8.92k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  8.30k|    {
  208|  8.30k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  8.30k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1405|  4.76k|    {
 1406|  4.76k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  4.76k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
 1310|  1.88k|    {
 1311|  1.88k|        each_i(v, start, branches<B>, args...);
 1312|  1.88k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_:
 1263|  1.88k|    {
 1264|  1.88k|        auto p = node_->inner() + i;
 1265|  1.88k|        auto e = node_->inner() + n;
 1266|  1.88k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 1.00k, False: 888]
  ------------------
 1267|  1.49k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 497, False: 1.00k]
  ------------------
 1268|    497|                IMMER_PREFETCH(p + 1);
 1269|    497|                make_full_leaf_pos(*p).visit(v, args...);
 1270|    497|            }
 1271|  1.00k|        } else {
 1272|    888|            auto ss = shift_ - B;
 1273|  1.88k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 992, False: 888]
  ------------------
 1274|    992|                make_full_pos(*p, ss).visit(v, args...);
 1275|    888|        }
 1276|  1.88k|    }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  112|    799|    {
  113|    799|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    799|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
  305|  4.17k|    {
  306|  4.17k|        return towards_oh_ch_regular(
  307|  4.17k|            *this, v, idx, offset_hint, count(), args...);
  308|  4.17k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_:
  632|  4.17k|{
  633|  4.17k|    constexpr auto B  = bits<Pos>;
  634|  4.17k|    constexpr auto BL = bits_leaf<Pos>;
  635|  4.17k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 4.17k, False: 0]
  ------------------
  636|  4.17k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 4.17k, False: 0]
  ------------------
  637|  4.17k|    auto is_leaf = p.shift() == BL;
  638|  4.17k|    auto child   = p.node()->inner()[offset_hint];
  639|  4.17k|    auto is_full = offset_hint + 1 != count_hint;
  640|  4.17k|    return is_full
  ------------------
  |  Branch (640:12): [True: 1.74k, False: 2.42k]
  ------------------
  641|  4.17k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 867, False: 879]
  ------------------
  642|  1.74k|                          : make_full_pos(child, p.shift() - B)
  643|    879|                                .visit(v, idx, args...))
  644|  4.17k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.26k, False: 1.15k]
  ------------------
  645|  2.42k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.42k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.15k|                            .visit(v, idx, args...));
  648|  4.17k|}
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  112|  2.51k|    {
  113|  2.51k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.51k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  336|  4.74k|    {
  337|  4.74k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  4.74k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
  336|  1.09k|    {
  337|  1.09k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  1.09k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
  305|  3.42k|    {
  306|  3.42k|        return towards_oh_ch_regular(
  307|  3.42k|            *this, v, idx, offset_hint, count(), args...);
  308|  3.42k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_:
  632|  3.42k|{
  633|  3.42k|    constexpr auto B  = bits<Pos>;
  634|  3.42k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.42k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.42k, False: 0]
  ------------------
  636|  3.42k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.42k, False: 0]
  ------------------
  637|  3.42k|    auto is_leaf = p.shift() == BL;
  638|  3.42k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.42k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.42k|    return is_full
  ------------------
  |  Branch (640:12): [True: 962, False: 2.46k]
  ------------------
  641|  3.42k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 452, False: 510]
  ------------------
  642|    962|                          : make_full_pos(child, p.shift() - B)
  643|    510|                                .visit(v, idx, args...))
  644|  3.42k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.58k, False: 883]
  ------------------
  645|  2.46k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.46k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    883|                            .visit(v, idx, args...));
  648|  3.42k|}
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  112|  2.88k|    {
  113|  2.88k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.88k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  336|  2.85k|    {
  337|  2.85k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.85k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
  285|  3.18k|    {
  286|  3.18k|        return each_right_regular(*this, v, start, args...);
  287|  3.18k|    }
_ZN5immer6detail4rbts18each_right_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_:
  597|  3.18k|{
  598|  3.18k|    constexpr auto B  = bits<Pos>;
  599|  3.18k|    constexpr auto BL = bits_leaf<Pos>;
  600|       |
  601|  3.18k|    if (p.shift() == BL) {
  ------------------
  |  Branch (601:9): [True: 1.24k, False: 1.94k]
  ------------------
  602|  1.24k|        auto n    = p.node()->inner() + start;
  603|  1.24k|        auto last = p.count() - 1;
  604|  1.24k|        auto e    = p.node()->inner() + last;
  605|  1.24k|        if (n <= e) {
  ------------------
  |  Branch (605:13): [True: 476, False: 767]
  ------------------
  606|    670|            for (; n != e; ++n) {
  ------------------
  |  Branch (606:20): [True: 194, False: 476]
  ------------------
  607|    194|                IMMER_PREFETCH(n + 1);
  608|    194|                make_full_leaf_pos(*n).visit(v, args...);
  609|    194|            }
  610|    476|            make_leaf_pos(*n, p.size()).visit(v, args...);
  611|    476|        }
  612|  1.94k|    } else {
  613|  1.94k|        auto n    = p.node()->inner() + start;
  614|  1.94k|        auto last = p.count() - 1;
  615|  1.94k|        auto e    = p.node()->inner() + last;
  616|  1.94k|        auto ss   = p.shift() - B;
  617|  1.94k|        if (n <= e) {
  ------------------
  |  Branch (617:13): [True: 870, False: 1.07k]
  ------------------
  618|  1.72k|            for (; n != e; ++n)
  ------------------
  |  Branch (618:20): [True: 853, False: 870]
  ------------------
  619|    853|                make_full_pos(*n, ss).visit(v, args...);
  620|    870|            make_regular_pos(*n, ss, p.size()).visit(v, args...);
  621|    870|        }
  622|  1.94k|    }
  623|  3.18k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
  927|  7.32k|    {
  928|  7.32k|        return towards_oh_ch_regular(
  929|  7.32k|            *this, v, idx, offset_hint, count(), args...);
  930|  7.32k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_:
  632|  7.32k|{
  633|  7.32k|    constexpr auto B  = bits<Pos>;
  634|  7.32k|    constexpr auto BL = bits_leaf<Pos>;
  635|  7.32k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 7.32k, False: 0]
  ------------------
  636|  7.32k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 7.32k, False: 0]
  ------------------
  637|  7.32k|    auto is_leaf = p.shift() == BL;
  638|  7.32k|    auto child   = p.node()->inner()[offset_hint];
  639|  7.32k|    auto is_full = offset_hint + 1 != count_hint;
  640|  7.32k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.48k, False: 4.83k]
  ------------------
  641|  7.32k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 888, False: 1.59k]
  ------------------
  642|  2.48k|                          : make_full_pos(child, p.shift() - B)
  643|  1.59k|                                .visit(v, idx, args...))
  644|  7.32k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.25k, False: 3.58k]
  ------------------
  645|  4.83k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  4.83k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  3.58k|                            .visit(v, idx, args...));
  648|  7.32k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
  927|  6.46k|    {
  928|  6.46k|        return towards_oh_ch_regular(
  929|  6.46k|            *this, v, idx, offset_hint, count(), args...);
  930|  6.46k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb0ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_:
  632|  6.46k|{
  633|  6.46k|    constexpr auto B  = bits<Pos>;
  634|  6.46k|    constexpr auto BL = bits_leaf<Pos>;
  635|  6.46k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 6.46k, False: 0]
  ------------------
  636|  6.46k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 6.46k, False: 0]
  ------------------
  637|  6.46k|    auto is_leaf = p.shift() == BL;
  638|  6.46k|    auto child   = p.node()->inner()[offset_hint];
  639|  6.46k|    auto is_full = offset_hint + 1 != count_hint;
  640|  6.46k|    return is_full
  ------------------
  |  Branch (640:12): [True: 3.18k, False: 3.27k]
  ------------------
  641|  6.46k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 1.45k, False: 1.73k]
  ------------------
  642|  3.18k|                          : make_full_pos(child, p.shift() - B)
  643|  1.73k|                                .visit(v, idx, args...))
  644|  6.46k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.30k, False: 1.97k]
  ------------------
  645|  3.27k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  3.27k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.97k|                            .visit(v, idx, args...));
  648|  6.46k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
  867|  5.58k|    {
  868|  5.58k|        return each_right_regular(*this, v, start, args...);
  869|  5.58k|    }
_ZN5immer6detail4rbts18each_right_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11dec_visitorEJEEEvOT_T0_jDpOT1_:
  597|  5.58k|{
  598|  5.58k|    constexpr auto B  = bits<Pos>;
  599|  5.58k|    constexpr auto BL = bits_leaf<Pos>;
  600|       |
  601|  5.58k|    if (p.shift() == BL) {
  ------------------
  |  Branch (601:9): [True: 1.56k, False: 4.02k]
  ------------------
  602|  1.56k|        auto n    = p.node()->inner() + start;
  603|  1.56k|        auto last = p.count() - 1;
  604|  1.56k|        auto e    = p.node()->inner() + last;
  605|  1.56k|        if (n <= e) {
  ------------------
  |  Branch (605:13): [True: 876, False: 686]
  ------------------
  606|  1.08k|            for (; n != e; ++n) {
  ------------------
  |  Branch (606:20): [True: 204, False: 876]
  ------------------
  607|    204|                IMMER_PREFETCH(n + 1);
  608|    204|                make_full_leaf_pos(*n).visit(v, args...);
  609|    204|            }
  610|    876|            make_leaf_pos(*n, p.size()).visit(v, args...);
  611|    876|        }
  612|  4.02k|    } else {
  613|  4.02k|        auto n    = p.node()->inner() + start;
  614|  4.02k|        auto last = p.count() - 1;
  615|  4.02k|        auto e    = p.node()->inner() + last;
  616|  4.02k|        auto ss   = p.shift() - B;
  617|  4.02k|        if (n <= e) {
  ------------------
  |  Branch (617:13): [True: 1.39k, False: 2.62k]
  ------------------
  618|  2.15k|            for (; n != e; ++n)
  ------------------
  |  Branch (618:20): [True: 758, False: 1.39k]
  ------------------
  619|    758|                make_full_pos(*n, ss).visit(v, args...);
  620|  1.39k|            make_regular_pos(*n, ss, p.size()).visit(v, args...);
  621|  1.39k|        }
  622|  4.02k|    }
  623|  5.58k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1813|  45.6k|    {
 1814|  45.6k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  45.6k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1686|  19.4k|    {
 1687|  19.4k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 19.4k, False: 0]
  ------------------
 1688|  19.4k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 15.8k, False: 3.59k]
  ------------------
 1689|  19.4k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  19.4k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1698|  19.4k|    {
 1699|  19.4k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  19.4k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  19.4k|    {
 1718|  19.4k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 19.4k, False: 0]
  ------------------
 1719|  19.4k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 15.8k, False: 3.59k]
  |  Branch (1719:9): [True: 19.4k, False: 0]
  ------------------
 1720|  19.4k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  19.4k|        auto child     = node_->inner()[offset_hint];
 1722|  19.4k|        auto is_leaf   = shift_ == BL;
 1723|  19.4k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  19.4k|        auto next_idx  = idx - left_size_hint;
 1725|  19.4k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 4.69k, False: 14.7k]
  ------------------
 1726|  19.4k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  4.69k|                         .visit(v, next_idx, args...)
 1728|  19.4k|                   : visit_maybe_relaxed_sub(
 1729|  14.7k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  19.4k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  144|  4.69k|    {
  145|  4.69k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  4.69k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_:
 1838|  14.7k|{
 1839|  14.7k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 14.7k, False: 0]
  ------------------
 1840|  14.7k|    auto relaxed = node->relaxed();
 1841|  14.7k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 11.3k, False: 3.41k]
  ------------------
 1842|  11.3k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 11.3k, False: 0]
  ------------------
 1843|  11.3k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  11.3k|            .visit(v, std::forward<Args>(args)...);
 1845|  11.3k|    } else {
 1846|  3.41k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.41k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.41k|    }
 1849|  14.7k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1813|  11.3k|    {
 1814|  11.3k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  11.3k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1036|  3.41k|    {
 1037|  3.41k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.41k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1036|  9.54k|    {
 1037|  9.54k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  9.54k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1686|  16.7k|    {
 1687|  16.7k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 16.7k, False: 0]
  ------------------
 1688|  16.7k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 12.1k, False: 4.53k]
  ------------------
 1689|  16.7k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  16.7k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1698|  16.7k|    {
 1699|  16.7k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  16.7k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  16.7k|    {
 1718|  16.7k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 16.7k, False: 0]
  ------------------
 1719|  16.7k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 12.1k, False: 4.53k]
  |  Branch (1719:9): [True: 16.7k, False: 0]
  ------------------
 1720|  16.7k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  16.7k|        auto child     = node_->inner()[offset_hint];
 1722|  16.7k|        auto is_leaf   = shift_ == BL;
 1723|  16.7k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  16.7k|        auto next_idx  = idx - left_size_hint;
 1725|  16.7k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 6.19k, False: 10.5k]
  ------------------
 1726|  16.7k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  6.19k|                         .visit(v, next_idx, args...)
 1728|  16.7k|                   : visit_maybe_relaxed_sub(
 1729|  10.5k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  16.7k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  144|  6.19k|    {
  145|  6.19k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  6.19k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_:
 1838|  10.5k|{
 1839|  10.5k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 10.5k, False: 0]
  ------------------
 1840|  10.5k|    auto relaxed = node->relaxed();
 1841|  10.5k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 8.74k, False: 1.77k]
  ------------------
 1842|  8.74k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 8.74k, False: 0]
  ------------------
 1843|  8.74k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  8.74k|            .visit(v, std::forward<Args>(args)...);
 1845|  8.74k|    } else {
 1846|  1.77k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.77k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.77k|    }
 1849|  10.5k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1813|  8.74k|    {
 1814|  8.74k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  8.74k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1036|  1.77k|    {
 1037|  1.77k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.77k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
 1653|  17.1k|    {
 1654|  17.1k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 17.1k, False: 0]
  ------------------
 1655|  17.1k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 17.1k, False: 0]
  ------------------
 1656|  17.1k|        auto s = relaxed_->d.sizes[start - 1];
 1657|  17.1k|        auto p = node_->inner();
 1658|  17.1k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 3.90k, False: 13.2k]
  ------------------
 1659|  7.65k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 3.74k, False: 3.90k]
  ------------------
 1660|  3.74k|                IMMER_PREFETCH(p + i + 1);
 1661|  3.74k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|  3.74k|                    .visit(v, args...);
 1663|  3.74k|                s = relaxed_->d.sizes[i];
 1664|  3.74k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 3.74k, False: 0]
  ------------------
 1665|  3.74k|            }
 1666|  13.2k|        } else {
 1667|  13.2k|            auto ss = shift_ - B;
 1668|  26.2k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 12.9k, False: 13.2k]
  ------------------
 1669|  12.9k|                visit_maybe_relaxed_sub(
 1670|  12.9k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|  12.9k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 12.9k, False: 0]
  ------------------
 1673|  12.9k|            }
 1674|  13.2k|        }
 1675|  17.1k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1036|  14.5k|    {
 1037|  14.5k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  14.5k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
  927|  3.86k|    {
  928|  3.86k|        return towards_oh_ch_regular(
  929|  3.86k|            *this, v, idx, offset_hint, count(), args...);
  930|  3.86k|    }
_ZN5immer6detail4rbts21towards_oh_ch_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_T0_mjjDpOT1_:
  632|  3.86k|{
  633|  3.86k|    constexpr auto B  = bits<Pos>;
  634|  3.86k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.86k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.86k, False: 0]
  ------------------
  636|  3.86k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.86k, False: 0]
  ------------------
  637|  3.86k|    auto is_leaf = p.shift() == BL;
  638|  3.86k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.86k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.86k|    return is_full
  ------------------
  |  Branch (640:12): [True: 3.12k, False: 733]
  ------------------
  641|  3.86k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 594, False: 2.53k]
  ------------------
  642|  3.12k|                          : make_full_pos(child, p.shift() - B)
  643|  2.53k|                                .visit(v, idx, args...))
  644|  3.86k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 733, False: 0]
  ------------------
  645|    733|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    733|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .visit(v, idx, args...));
  648|  3.86k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  1.37k|    {
  208|  1.37k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.37k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1405|  2.92k|    {
 1406|  2.92k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.92k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1336|  1.17k|    {
 1337|  1.17k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.17k, False: 0]
  ------------------
 1338|  1.17k|        auto is_leaf = shift_ == BL;
 1339|  1.17k|        auto child   = node_->inner()[offset_hint];
 1340|  1.17k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 780, False: 390]
  ------------------
 1341|  1.17k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.17k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.17k|    }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  112|    733|    {
  113|    733|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    733|    }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_29concat_trees_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_NS1_14empty_leaf_posISC_EESL_RPSC_RjRmEEEDcT_DpOT0_:
  759|  7.50k|    {
  760|  7.50k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  761|  7.50k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESJ_EEEDcPT_jmT0_DpOT1_:
 1838|  7.50k|{
 1839|  7.50k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 7.50k, False: 0]
  ------------------
 1840|  7.50k|    auto relaxed = node->relaxed();
 1841|  7.50k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 4.10k, False: 3.39k]
  ------------------
 1842|  4.10k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 4.10k, False: 0]
  ------------------
 1843|  4.10k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  4.10k|            .visit(v, std::forward<Args>(args)...);
 1845|  4.10k|    } else {
 1846|  3.39k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.39k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.39k|    }
 1849|  7.50k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1813|  4.10k|    {
 1814|  4.10k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.10k|    }
_ZNK5immer6detail4rbts12null_sub_pos4nodeEv:
  699|   490k|    auto node() const { return nullptr; }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_DpOT0_:
  744|  7.50k|    {
  745|  7.50k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  144|   626k|    {
  145|   626k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   626k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1813|  2.80M|    {
 1814|  2.80M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  2.80M|    }
_ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNSD_5applyISA_E4type4editEEEEvT_DpOT0_:
  707|   417k|    {
  708|   417k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1762|  15.1k|    {
 1763|  15.1k|        auto child      = node_->inner()[0];
 1764|  15.1k|        auto child_size = relaxed_->d.sizes[0];
 1765|  15.1k|        auto is_leaf    = shift_ == BL;
 1766|  15.1k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 15.1k, False: 0]
  ------------------
 1767|  15.1k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 15.1k]
  ------------------
 1768|  15.1k|                       : visit_maybe_relaxed_sub(
 1769|  15.1k|                             child, shift_ - B, child_size, v, args...);
 1770|  15.1k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESJ_EEEDcPT_jmT0_DpOT1_:
 1838|  15.1k|{
 1839|  15.1k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 15.1k, False: 0]
  ------------------
 1840|  15.1k|    auto relaxed = node->relaxed();
 1841|  15.1k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 14.8k, False: 275]
  ------------------
 1842|  14.8k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 14.8k, False: 0]
  ------------------
 1843|  14.8k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  14.8k|            .visit(v, std::forward<Args>(args)...);
 1845|  14.8k|    } else {
 1846|    275|        return make_regular_sub_pos(node, shift, size)
 1847|    275|            .visit(v, std::forward<Args>(args)...);
 1848|    275|    }
 1849|  15.1k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1813|  14.8k|    {
 1814|  14.8k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  14.8k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1036|    275|    {
 1037|    275|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    275|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
  970|    949|    {
  971|    949|        auto is_leaf = shift_ == BL;
  972|    949|        auto child   = node_->inner()[0];
  973|    949|        auto is_full = size_ >= (size_t{1} << shift_);
  974|    949|        return is_full
  ------------------
  |  Branch (974:16): [True: 949, False: 0]
  ------------------
  975|    949|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 949]
  ------------------
  976|    949|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|    949|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|    949|                   : (is_leaf
  ------------------
  |  Branch (978:23): [True: 0, False: 0]
  ------------------
  979|      0|                          ? make_leaf_sub_pos(child, size_).visit(v, args...)
  980|      0|                          : make_regular_sub_pos(child, shift_ - B, size_)
  981|      0|                                .visit(v, args...));
  982|    949|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1405|  1.65k|    {
 1406|  1.65k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.65k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1361|    709|    {
 1362|    709|        auto is_leaf = shift_ == BL;
 1363|    709|        auto child   = node_->inner()[0];
 1364|    709|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 709]
  ------------------
 1365|    709|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    709|    }
_ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNSD_5applyISA_E4type4editEEEEvT_DpOT0_:
  711|  73.0k|    {
  712|  73.0k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_DpOT0_:
 1304|  24.8k|    {
 1305|  24.8k|        each_i(v, 1, branches<B>, args...);
 1306|  24.8k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6each_iINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_jjDpOT0_:
 1263|  24.8k|    {
 1264|  24.8k|        auto p = node_->inner() + i;
 1265|  24.8k|        auto e = node_->inner() + n;
 1266|  24.8k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 9.41k, False: 15.4k]
  ------------------
 1267|  37.6k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 28.2k, False: 9.41k]
  ------------------
 1268|  28.2k|                IMMER_PREFETCH(p + 1);
 1269|  28.2k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  28.2k|            }
 1271|  15.4k|        } else {
 1272|  15.4k|            auto ss = shift_ - B;
 1273|  61.6k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 46.2k, False: 15.4k]
  ------------------
 1274|  46.2k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  15.4k|        }
 1276|  24.8k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  96.4k|    {
  208|  96.4k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  96.4k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1405|   207k|    {
 1406|   207k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|   207k|    }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_14empty_leaf_posISC_EESL_RNS1_8full_posISC_EEEEEDcT_DpOT0_:
  753|    949|    {
  754|    949|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    949|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_14empty_leaf_posISC_EESL_RNS1_8full_posISC_EEEEEDcT_DpOT0_:
  144|    949|    {
  145|    949|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    949|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1370|    949|    {
 1371|    949|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 949, False: 0]
  ------------------
 1372|    949|        auto child = node_->inner()[0];
 1373|    949|        return make_full_leaf_pos(child).visit(v, args...);
 1374|    949|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
  207|  3.67k|    {
  208|  3.67k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  3.67k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_DpOT0_:
  906|  49.0k|    {
  907|  49.0k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 14.7k, False: 34.2k]
  ------------------
  908|  14.7k|            each_right_sub_(v, 1, args...);
  909|  49.0k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE15each_right_sub_INS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_jDpOT0_:
  879|  14.7k|    {
  880|  14.7k|        auto last  = count() - 1;
  881|  14.7k|        auto lsize = size_ - (last << shift_);
  882|  14.7k|        auto n     = node()->inner() + i;
  883|  14.7k|        auto e     = node()->inner() + last;
  884|  14.7k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 5.37k, False: 9.41k]
  ------------------
  885|  10.5k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 5.13k, False: 5.37k]
  ------------------
  886|  5.13k|                IMMER_PREFETCH(n + 1);
  887|  5.13k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  5.13k|            }
  889|  5.37k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  9.41k|        } else {
  891|  9.41k|            auto ss = shift_ - B;
  892|  19.2k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 9.82k, False: 9.41k]
  ------------------
  893|  9.82k|                make_full_pos(*n, ss).visit(v, args...);
  894|  9.41k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  9.41k|        }
  896|  14.7k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1036|  98.1k|    {
 1037|  98.1k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  98.1k|    }
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_14empty_leaf_posISC_EESL_RNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
  753|  2.72k|    {
  754|  2.72k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  2.72k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_14empty_leaf_posISC_EESL_RNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
  144|  2.72k|    {
  145|  2.72k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  2.72k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
  986|  2.72k|    {
  987|  2.72k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 2.72k, False: 0]
  ------------------
  988|  2.72k|        auto child   = node_->inner()[0];
  989|  2.72k|        auto is_full = size_ >= branches<BL>;
  990|  2.72k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 2.72k, False: 0]
  ------------------
  991|  2.72k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  2.72k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
  144|  3.83k|    {
  145|  3.83k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.83k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14each_right_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_DpOT0_:
 1647|   451k|    {
 1648|   451k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   451k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_jDpOT0_:
 1653|   451k|    {
 1654|   451k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 451k, False: 0]
  ------------------
 1655|   451k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 451k, False: 0]
  ------------------
 1656|   451k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   451k|        auto p = node_->inner();
 1658|   451k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 72.8k, False: 379k]
  ------------------
 1659|   237k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 164k, False: 72.8k]
  ------------------
 1660|   164k|                IMMER_PREFETCH(p + i + 1);
 1661|   164k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   164k|                    .visit(v, args...);
 1663|   164k|                s = relaxed_->d.sizes[i];
 1664|   164k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 164k, False: 0]
  ------------------
 1665|   164k|            }
 1666|   379k|        } else {
 1667|   379k|            auto ss = shift_ - B;
 1668|  1.23M|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 853k, False: 379k]
  ------------------
 1669|   853k|                visit_maybe_relaxed_sub(
 1670|   853k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|   853k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 853k, False: 0]
  ------------------
 1673|   853k|            }
 1674|   379k|        }
 1675|   451k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEDcPT_jmT0_DpOT1_:
 1838|  1.71M|{
 1839|  1.71M|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 1.71M, False: 0]
  ------------------
 1840|  1.71M|    auto relaxed = node->relaxed();
 1841|  1.71M|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.63M, False: 88.6k]
  ------------------
 1842|  1.63M|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.63M, False: 0]
  ------------------
 1843|  1.63M|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.63M|            .visit(v, std::forward<Args>(args)...);
 1845|  1.63M|    } else {
 1846|  88.6k|        return make_regular_sub_pos(node, shift, size)
 1847|  88.6k|            .visit(v, std::forward<Args>(args)...);
 1848|  88.6k|    }
 1849|  1.71M|}
_ZN5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_14empty_leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  753|  3.83k|    {
  754|  3.83k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  3.83k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_14empty_leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  144|  3.83k|    {
  145|  3.83k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.83k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1774|  3.83k|    {
 1775|  3.83k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 3.83k, False: 0]
  ------------------
 1776|  3.83k|        auto child      = node_->inner()[0];
 1777|  3.83k|        auto child_size = relaxed_->d.sizes[0];
 1778|  3.83k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  3.83k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_25singleton_regular_sub_posISC_EERNS1_14empty_leaf_posISC_EESL_EEEDcT_DpOT0_:
 1036|  3.39k|    {
 1037|  3.39k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.39k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_29concat_trees_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_NS1_8leaf_posISC_EESJ_RPSC_RjRmEEEDcPT_jmT0_DpOT1_:
 1838|   114k|{
 1839|   114k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 114k, False: 0]
  ------------------
 1840|   114k|    auto relaxed = node->relaxed();
 1841|   114k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 108k, False: 6.18k]
  ------------------
 1842|   108k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 108k, False: 0]
  ------------------
 1843|   108k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   108k|            .visit(v, std::forward<Args>(args)...);
 1845|   108k|    } else {
 1846|  6.18k|        return make_regular_sub_pos(node, shift, size)
 1847|  6.18k|            .visit(v, std::forward<Args>(args)...);
 1848|  6.18k|    }
 1849|   114k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_29concat_trees_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_NS1_8leaf_posISC_EESL_RPSC_RjRmEEEDcT_DpOT0_:
 1813|   108k|    {
 1814|   108k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   108k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESJ_EEEDcPT_jmT0_DpOT1_:
 1838|   108k|{
 1839|   108k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 108k, False: 0]
  ------------------
 1840|   108k|    auto relaxed = node->relaxed();
 1841|   108k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 70.5k, False: 37.6k]
  ------------------
 1842|  70.5k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 70.5k, False: 0]
  ------------------
 1843|  70.5k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  70.5k|            .visit(v, std::forward<Args>(args)...);
 1845|  70.5k|    } else {
 1846|  37.6k|        return make_regular_sub_pos(node, shift, size)
 1847|  37.6k|            .visit(v, std::forward<Args>(args)...);
 1848|  37.6k|    }
 1849|   108k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1813|  70.5k|    {
 1814|  70.5k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  70.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
 1750|   195k|    {
 1751|   195k|        auto offset     = relaxed_->d.count - 1;
 1752|   195k|        auto child      = node_->inner()[offset];
 1753|   195k|        auto child_size = size(offset);
 1754|   195k|        auto is_leaf    = shift_ == BL;
 1755|   195k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 195k]
  ------------------
 1756|   195k|                       : visit_maybe_relaxed_sub(
 1757|   195k|                             child, shift_ - B, child_size, v, args...);
 1758|   195k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_8leaf_posISC_EESJ_RNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|   195k|{
 1839|   195k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 195k, False: 0]
  ------------------
 1840|   195k|    auto relaxed = node->relaxed();
 1841|   195k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 193k, False: 1.88k]
  ------------------
 1842|   193k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 193k, False: 0]
  ------------------
 1843|   193k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   193k|            .visit(v, std::forward<Args>(args)...);
 1845|   193k|    } else {
 1846|  1.88k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.88k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.88k|    }
 1849|   195k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
 1813|   193k|    {
 1814|   193k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   193k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
 1036|  4.40k|    {
 1037|  4.40k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.40k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  958|  2.51k|    {
  959|  2.51k|        auto offset  = count() - 1;
  960|  2.51k|        auto child   = node_->inner()[offset];
  961|  2.51k|        auto is_leaf = shift_ == BL;
  962|  2.51k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  2.51k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 2.51k]
  ------------------
  964|  2.51k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  2.51k|                             .visit(v, args...);
  966|  2.51k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_DpOT0_:
  913|   150k|    {
  914|   150k|        each_left(v, count() - 1, args...);
  915|   150k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9each_leftINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_jDpOT0_:
  873|   150k|    {
  874|   150k|        return each_left_regular(*this, v, last, args...);
  875|   150k|    }
_ZN5immer6detail4rbts17each_left_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISD_EERNSB_5applyIS8_E4type4editEEEEvOT_T0_jDpOT1_:
  575|   150k|{
  576|   150k|    constexpr auto B  = bits<Pos>;
  577|   150k|    constexpr auto BL = bits_leaf<Pos>;
  578|   150k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 150k, False: 0]
  ------------------
  579|   150k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 47.6k, False: 102k]
  ------------------
  580|  47.6k|        auto n = p.node()->inner();
  581|  47.6k|        auto e = n + last;
  582|   110k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 63.1k, False: 47.6k]
  ------------------
  583|  63.1k|            IMMER_PREFETCH(n + 1);
  584|  63.1k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  63.1k|        }
  586|   102k|    } else {
  587|   102k|        auto n  = p.node()->inner();
  588|   102k|        auto e  = n + last;
  589|   102k|        auto ss = p.shift() - B;
  590|   254k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 151k, False: 102k]
  ------------------
  591|   151k|            make_full_pos(*n, ss).visit(v, args...);
  592|   102k|    }
  593|   150k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1762|   125k|    {
 1763|   125k|        auto child      = node_->inner()[0];
 1764|   125k|        auto child_size = relaxed_->d.sizes[0];
 1765|   125k|        auto is_leaf    = shift_ == BL;
 1766|   125k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 125k, False: 0]
  ------------------
 1767|   125k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 125k]
  ------------------
 1768|   125k|                       : visit_maybe_relaxed_sub(
 1769|   125k|                             child, shift_ - B, child_size, v, args...);
 1770|   125k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESJ_EEEDcPT_jmT0_DpOT1_:
 1838|   125k|{
 1839|   125k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 125k, False: 0]
  ------------------
 1840|   125k|    auto relaxed = node->relaxed();
 1841|   125k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 121k, False: 3.66k]
  ------------------
 1842|   121k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 121k, False: 0]
  ------------------
 1843|   121k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   121k|            .visit(v, std::forward<Args>(args)...);
 1845|   121k|    } else {
 1846|  3.66k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.66k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.66k|    }
 1849|   125k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1813|   121k|    {
 1814|   121k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   121k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1036|  3.66k|    {
 1037|  3.66k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.66k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
  958|  1.88k|    {
  959|  1.88k|        auto offset  = count() - 1;
  960|  1.88k|        auto child   = node_->inner()[offset];
  961|  1.88k|        auto is_leaf = shift_ == BL;
  962|  1.88k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  1.88k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 1.88k]
  ------------------
  964|  1.88k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.88k|                             .visit(v, args...);
  966|  1.88k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
 1036|  2.89k|    {
 1037|  2.89k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.89k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  970|  6.84k|    {
  971|  6.84k|        auto is_leaf = shift_ == BL;
  972|  6.84k|        auto child   = node_->inner()[0];
  973|  6.84k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  6.84k|        return is_full
  ------------------
  |  Branch (974:16): [True: 6.84k, False: 0]
  ------------------
  975|  6.84k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 6.84k]
  ------------------
  976|  6.84k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  6.84k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  6.84k|                   : (is_leaf
  ------------------
  |  Branch (978:23): [True: 0, False: 0]
  ------------------
  979|      0|                          ? make_leaf_sub_pos(child, size_).visit(v, args...)
  980|      0|                          : make_regular_sub_pos(child, shift_ - B, size_)
  981|      0|                                .visit(v, args...));
  982|  6.84k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1405|  20.9k|    {
 1406|  20.9k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  20.9k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1361|  14.0k|    {
 1362|  14.0k|        auto is_leaf = shift_ == BL;
 1363|  14.0k|        auto child   = node_->inner()[0];
 1364|  14.0k|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 14.0k]
  ------------------
 1365|  14.0k|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|  14.0k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_8full_posISC_EEEEEDcT_DpOT0_:
  958|  20.6k|    {
  959|  20.6k|        auto offset  = count() - 1;
  960|  20.6k|        auto child   = node_->inner()[offset];
  961|  20.6k|        auto is_leaf = shift_ == BL;
  962|  20.6k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  20.6k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 7.06k, False: 13.5k]
  ------------------
  964|  20.6k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  13.5k|                             .visit(v, args...);
  966|  20.6k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_8full_posISC_EEEEEDcT_DpOT0_:
  144|  8.46k|    {
  145|  8.46k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  8.46k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1370|  8.46k|    {
 1371|  8.46k|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 8.46k, False: 0]
  ------------------
 1372|  8.46k|        auto child = node_->inner()[0];
 1373|  8.46k|        return make_full_leaf_pos(child).visit(v, args...);
 1374|  8.46k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  207|  45.3k|    {
  208|  45.3k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  45.3k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_8full_posISC_EEEEEDcT_DpOT0_:
 1036|  13.7k|    {
 1037|  13.7k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  13.7k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
  958|  6.96k|    {
  959|  6.96k|        auto offset  = count() - 1;
  960|  6.96k|        auto child   = node_->inner()[offset];
  961|  6.96k|        auto is_leaf = shift_ == BL;
  962|  6.96k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  6.96k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 4.09k, False: 2.87k]
  ------------------
  964|  6.96k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  2.87k|                             .visit(v, args...);
  966|  6.96k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
  144|  36.8k|    {
  145|  36.8k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  36.8k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  986|  36.8k|    {
  987|  36.8k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 36.8k, False: 0]
  ------------------
  988|  36.8k|        auto child   = node_->inner()[0];
  989|  36.8k|        auto is_full = size_ >= branches<BL>;
  990|  36.8k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 36.8k, False: 0]
  ------------------
  991|  36.8k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  36.8k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  144|  68.9k|    {
  145|  68.9k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  68.9k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
 1036|  6.34k|    {
 1037|  6.34k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  6.34k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  958|   118k|    {
  959|   118k|        auto offset  = count() - 1;
  960|   118k|        auto child   = node_->inner()[offset];
  961|   118k|        auto is_leaf = shift_ == BL;
  962|   118k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|   118k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 36.5k, False: 81.8k]
  ------------------
  964|   118k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  81.8k|                             .visit(v, args...);
  966|   118k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  144|  68.9k|    {
  145|  68.9k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  68.9k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1774|  68.9k|    {
 1775|  68.9k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 68.9k, False: 0]
  ------------------
 1776|  68.9k|        auto child      = node_->inner()[0];
 1777|  68.9k|        auto child_size = relaxed_->d.sizes[0];
 1778|  68.9k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  68.9k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
 1036|   116k|    {
 1037|   116k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   116k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13each_left_subINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_DpOT0_:
 1617|   712k|    {
 1618|   712k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   712k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9each_leftINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_jDpOT0_:
 1623|   712k|    {
 1624|   712k|        auto p = node_->inner();
 1625|   712k|        auto s = size_t{};
 1626|   712k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 66.6k, False: 645k]
  ------------------
 1627|   165k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 98.9k, False: 66.6k]
  ------------------
 1628|  98.9k|                IMMER_PREFETCH(p + i + 1);
 1629|  98.9k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|  98.9k|                    .visit(v, args...);
 1631|  98.9k|                s = relaxed_->d.sizes[i];
 1632|  98.9k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 98.9k, False: 0]
  ------------------
 1633|  98.9k|            }
 1634|   645k|        } else {
 1635|   645k|            auto ss = shift_ - B;
 1636|  1.51M|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 866k, False: 645k]
  ------------------
 1637|   866k|                visit_maybe_relaxed_sub(
 1638|   866k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|   866k|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 866k, False: 0]
  ------------------
 1641|   866k|            }
 1642|   645k|        }
 1643|   712k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1762|   238k|    {
 1763|   238k|        auto child      = node_->inner()[0];
 1764|   238k|        auto child_size = relaxed_->d.sizes[0];
 1765|   238k|        auto is_leaf    = shift_ == BL;
 1766|   238k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 238k, False: 0]
  ------------------
 1767|   238k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 238k]
  ------------------
 1768|   238k|                       : visit_maybe_relaxed_sub(
 1769|   238k|                             child, shift_ - B, child_size, v, args...);
 1770|   238k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESJ_EEEDcPT_jmT0_DpOT1_:
 1838|   238k|{
 1839|   238k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 238k, False: 0]
  ------------------
 1840|   238k|    auto relaxed = node->relaxed();
 1841|   238k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 237k, False: 1.23k]
  ------------------
 1842|   237k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 237k, False: 0]
  ------------------
 1843|   237k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   237k|            .visit(v, std::forward<Args>(args)...);
 1845|   237k|    } else {
 1846|  1.23k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.23k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.23k|    }
 1849|   238k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1813|   237k|    {
 1814|   237k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   237k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1036|  1.23k|    {
 1037|  1.23k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.23k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1750|   217k|    {
 1751|   217k|        auto offset     = relaxed_->d.count - 1;
 1752|   217k|        auto child      = node_->inner()[offset];
 1753|   217k|        auto child_size = size(offset);
 1754|   217k|        auto is_leaf    = shift_ == BL;
 1755|   217k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 217k]
  ------------------
 1756|   217k|                       : visit_maybe_relaxed_sub(
 1757|   217k|                             child, shift_ - B, child_size, v, args...);
 1758|   217k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_8leaf_posISC_EESJ_RNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|   217k|{
 1839|   217k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 217k, False: 0]
  ------------------
 1840|   217k|    auto relaxed = node->relaxed();
 1841|   217k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 216k, False: 1.00k]
  ------------------
 1842|   216k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 216k, False: 0]
  ------------------
 1843|   216k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   216k|            .visit(v, std::forward<Args>(args)...);
 1845|   216k|    } else {
 1846|  1.00k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.00k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.00k|    }
 1849|   217k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1813|   216k|    {
 1814|   216k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   216k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  970|  1.61k|    {
  971|  1.61k|        auto is_leaf = shift_ == BL;
  972|  1.61k|        auto child   = node_->inner()[0];
  973|  1.61k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  1.61k|        return is_full
  ------------------
  |  Branch (974:16): [True: 1.61k, False: 0]
  ------------------
  975|  1.61k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 1.61k]
  ------------------
  976|  1.61k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  1.61k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  1.61k|                   : (is_leaf
  ------------------
  |  Branch (978:23): [True: 0, False: 0]
  ------------------
  979|      0|                          ? make_leaf_sub_pos(child, size_).visit(v, args...)
  980|      0|                          : make_regular_sub_pos(child, shift_ - B, size_)
  981|      0|                                .visit(v, args...));
  982|  1.61k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1405|  2.24k|    {
 1406|  2.24k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.24k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1361|    626|    {
 1362|    626|        auto is_leaf = shift_ == BL;
 1363|    626|        auto child   = node_->inner()[0];
 1364|    626|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 626]
  ------------------
 1365|    626|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    626|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_8full_posISC_EEEEEDcT_DpOT0_:
 1750|  2.00k|    {
 1751|  2.00k|        auto offset     = relaxed_->d.count - 1;
 1752|  2.00k|        auto child      = node_->inner()[offset];
 1753|  2.00k|        auto child_size = size(offset);
 1754|  2.00k|        auto is_leaf    = shift_ == BL;
 1755|  2.00k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 1.40k, False: 605]
  ------------------
 1756|  2.00k|                       : visit_maybe_relaxed_sub(
 1757|    605|                             child, shift_ - B, child_size, v, args...);
 1758|  2.00k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_8leaf_posISC_EESJ_RNS1_8full_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|    605|{
 1839|    605|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 605, False: 0]
  ------------------
 1840|    605|    auto relaxed = node->relaxed();
 1841|    605|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 389, False: 216]
  ------------------
 1842|    389|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 389, False: 0]
  ------------------
 1843|    389|        return make_relaxed_pos(node, shift, relaxed)
 1844|    389|            .visit(v, std::forward<Args>(args)...);
 1845|    389|    } else {
 1846|    216|        return make_regular_sub_pos(node, shift, size)
 1847|    216|            .visit(v, std::forward<Args>(args)...);
 1848|    216|    }
 1849|    605|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_8full_posISC_EEEEEDcT_DpOT0_:
 1813|    389|    {
 1814|    389|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    389|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1750|  37.1k|    {
 1751|  37.1k|        auto offset     = relaxed_->d.count - 1;
 1752|  37.1k|        auto child      = node_->inner()[offset];
 1753|  37.1k|        auto child_size = size(offset);
 1754|  37.1k|        auto is_leaf    = shift_ == BL;
 1755|  37.1k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 32.8k, False: 4.31k]
  ------------------
 1756|  37.1k|                       : visit_maybe_relaxed_sub(
 1757|  4.31k|                             child, shift_ - B, child_size, v, args...);
 1758|  37.1k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_8leaf_posISC_EESJ_RNS1_15regular_sub_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|  4.31k|{
 1839|  4.31k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 4.31k, False: 0]
  ------------------
 1840|  4.31k|    auto relaxed = node->relaxed();
 1841|  4.31k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 843, False: 3.46k]
  ------------------
 1842|    843|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 843, False: 0]
  ------------------
 1843|    843|        return make_relaxed_pos(node, shift, relaxed)
 1844|    843|            .visit(v, std::forward<Args>(args)...);
 1845|  3.46k|    } else {
 1846|  3.46k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.46k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.46k|    }
 1849|  4.31k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_15regular_sub_posISC_EEEEEDcT_DpOT0_:
 1813|    843|    {
 1814|    843|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    843|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
 1750|   260k|    {
 1751|   260k|        auto offset     = relaxed_->d.count - 1;
 1752|   260k|        auto child      = node_->inner()[offset];
 1753|   260k|        auto child_size = size(offset);
 1754|   260k|        auto is_leaf    = shift_ == BL;
 1755|   260k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 32.4k, False: 227k]
  ------------------
 1756|   260k|                       : visit_maybe_relaxed_sub(
 1757|   227k|                             child, shift_ - B, child_size, v, args...);
 1758|   260k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_8leaf_posISC_EESJ_RNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|   227k|{
 1839|   227k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 227k, False: 0]
  ------------------
 1840|   227k|    auto relaxed = node->relaxed();
 1841|   227k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 192k, False: 34.9k]
  ------------------
 1842|   192k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 192k, False: 0]
  ------------------
 1843|   192k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   192k|            .visit(v, std::forward<Args>(args)...);
 1845|   192k|    } else {
 1846|  34.9k|        return make_regular_sub_pos(node, shift, size)
 1847|  34.9k|            .visit(v, std::forward<Args>(args)...);
 1848|  34.9k|    }
 1849|   227k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23concat_both_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RSD_EEEDcT_DpOT0_:
 1813|   192k|    {
 1814|   192k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   192k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1036|  37.6k|    {
 1037|  37.6k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  37.6k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_29concat_trees_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_NS1_8leaf_posISC_EESL_RPSC_RjRmEEEDcT_DpOT0_:
 1036|  6.18k|    {
 1037|  6.18k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  6.18k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESJ_RNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESJ_EEEDcPT_jmT0_DpOT1_:
 1838|  6.18k|{
 1839|  6.18k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 6.18k, False: 0]
  ------------------
 1840|  6.18k|    auto relaxed = node->relaxed();
 1841|  6.18k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 3.37k, False: 2.80k]
  ------------------
 1842|  3.37k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 3.37k, False: 0]
  ------------------
 1843|  3.37k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  3.37k|            .visit(v, std::forward<Args>(args)...);
 1845|  3.37k|    } else {
 1846|  2.80k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.80k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.80k|    }
 1849|  6.18k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_15regular_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1813|  3.37k|    {
 1814|  3.37k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  3.37k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1036|  2.80k|    {
 1037|  2.80k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.80k|    }

_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
  114|   359k|        : size{0}
  115|   359k|        , shift{BL}
  116|   359k|        , root{empty_root()}
  117|   359k|        , tail{empty_tail()}
  118|   359k|    {
  119|       |        assert(check_tree());
  ------------------
  |  Branch (119:9): [True: 359k, False: 0]
  ------------------
  120|   359k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10empty_rootEv:
   61|   375k|    {
   62|   375k|        static const auto empty_ = [] {
   63|   375k|            constexpr auto size = node_t::sizeof_inner_n(0);
   64|   375k|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   65|   375k|                storage;
   66|   375k|            return node_t::make_inner_n_into(&storage, size, 0u);
   67|   375k|        }();
   68|   375k|        return empty_->inc();
   69|   375k|    }
_ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10empty_rootEvENKUlvE_clEv:
   62|      1|        static const auto empty_ = [] {
   63|      1|            constexpr auto size = node_t::sizeof_inner_n(0);
   64|      1|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   65|      1|                storage;
   66|      1|            return node_t::make_inner_n_into(&storage, size, 0u);
   67|      1|        }();
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10empty_tailEv:
   72|   363k|    {
   73|   363k|        static const auto empty_ = [] {
   74|   363k|            constexpr auto size = node_t::sizeof_leaf_n(0);
   75|   363k|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   76|   363k|                storage;
   77|   363k|            return node_t::make_leaf_n_into(&storage, size, 0u);
   78|   363k|        }();
   79|   363k|        return empty_->inc();
   80|   363k|    }
_ZZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10empty_tailEvENKUlvE_clEv:
   73|      1|        static const auto empty_ = [] {
   74|      1|            constexpr auto size = node_t::sizeof_leaf_n(0);
   75|      1|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   76|      1|                storage;
   77|      1|            return node_t::make_leaf_n_into(&storage, size, 0u);
   78|      1|        }();
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10check_treeEv:
 1372|   962k|    {
 1373|   962k|        IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL);
  ------------------
  |  |   32|   962k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 962k]
  |  |  ------------------
  |  |   33|   962k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1374|   962k|        IMMER_INVALID_STATE_ASSERT(shift >= BL);
  ------------------
  |  |   32|   962k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 962k]
  |  |  ------------------
  |  |   33|   962k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1375|   962k|        IMMER_INVALID_STATE_ASSERT(tail_offset() <= size);
  ------------------
  |  |   32|   962k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 962k]
  |  |  ------------------
  |  |   33|   962k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1376|   962k|        IMMER_INVALID_STATE_ASSERT(tail_size() <= branches<BL>);
  ------------------
  |  |   32|   962k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 962k]
  |  |  ------------------
  |  |   33|   962k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1377|       |#if IMMER_DEBUG_DEEP_CHECK
 1378|       |        IMMER_INVALID_STATE_ASSERT(check_root());
 1379|       |        IMMER_INVALID_STATE_ASSERT(check_tail());
 1380|       |#endif
 1381|   962k|        return true;
 1382|   962k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11tail_offsetEv:
  197|  7.08M|    {
  198|  7.08M|        auto r = root->relaxed();
  199|  7.08M|        assert(r == nullptr || r->d.count);
  ------------------
  |  Branch (199:9): [True: 4.51M, False: 2.57M]
  |  Branch (199:9): [True: 2.57M, False: 0]
  |  Branch (199:9): [True: 7.08M, False: 0]
  ------------------
  200|  7.08M|        return r      ? r->d.sizes[r->d.count - 1]
  ------------------
  |  Branch (200:16): [True: 2.57M, False: 4.51M]
  ------------------
  201|  7.08M|               : size ? (size - 1) & ~mask<BL>
  ------------------
  |  Branch (201:18): [True: 3.39M, False: 1.12M]
  ------------------
  202|       |                      /* otherwise */
  203|  4.51M|                      : 0;
  204|  7.08M|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9tail_sizeEv:
  194|  1.08M|    auto tail_size() const { return size - tail_offset(); }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EED2Ev:
  184|   657k|    ~rrbtree() { dec(); }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3decEv:
  192|   657k|    void dec() const { traverse(dec_visitor()); }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8traverseINS1_11dec_visitorEJEEEvT_DpOT0_:
  208|   657k|    {
  209|   657k|        auto tail_off  = tail_offset();
  210|   657k|        auto tail_size = size - tail_off;
  211|       |
  212|   657k|        if (tail_off)
  ------------------
  |  Branch (212:13): [True: 241k, False: 415k]
  ------------------
  213|   241k|            visit_maybe_relaxed_sub(root, shift, tail_off, v, args...);
  214|   415k|        else
  215|   415k|            make_empty_regular_pos(root).visit(v, args...);
  216|       |
  217|   657k|        if (tail_size)
  ------------------
  |  Branch (217:13): [True: 289k, False: 367k]
  ------------------
  218|   289k|            make_leaf_sub_pos(tail, tail_size).visit(v, args...);
  219|   367k|        else
  220|   367k|            make_empty_leaf_pos(tail).visit(v, args...);
  221|   657k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2ERKSB_:
  151|   126k|        : rrbtree{other.size, other.shift, other.root, other.tail}
  152|   126k|    {
  153|   126k|        inc();
  154|   126k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_:
  127|   297k|        : size{sz}
  128|   297k|        , shift{sh}
  129|   297k|        , root{r}
  130|   297k|        , tail{t}
  131|   297k|    {
  132|   297k|#if IMMER_THROW_ON_INVALID_STATE
  133|       |        // assert only happens in the Debug build, but when
  134|       |        // IMMER_THROW_ON_INVALID_STATE is activated, we want to just check_tree
  135|       |        // even in Release.
  136|   297k|        try {
  137|   297k|            check_tree();
  138|   297k|        } catch (...) {
  139|       |            // This not fully constructed rrbtree owns the nodes already, have
  140|       |            // to dec them.
  141|      0|            if (r && t)
  ------------------
  |  Branch (141:17): [True: 0, False: 0]
  |  Branch (141:22): [True: 0, False: 0]
  ------------------
  142|      0|                dec();
  143|      0|            throw;
  144|      0|        }
  145|       |#else
  146|       |        assert(check_tree());
  147|       |#endif
  148|   297k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3incEv:
  187|   126k|    {
  188|   126k|        root->inc();
  189|   126k|        tail->inc();
  190|   126k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2EOSB_:
  157|   284k|        : rrbtree{}
  158|   284k|    {
  159|   284k|        swap(*this, other);
  160|   284k|    }
_ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEESC_:
  176|   594k|    {
  177|   594k|        using std::swap;
  178|   594k|        swap(x.size, y.size);
  179|   594k|        swap(x.shift, y.shift);
  180|   594k|        swap(x.root, y.root);
  181|   594k|        swap(x.tail, y.tail);
  182|   594k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEaSEOSB_:
  170|   302k|    {
  171|   302k|        swap(*this, other);
  172|   302k|        return *this;
  173|   302k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  500|  71.1k|    {
  501|  71.1k|        auto ts = tail_size();
  502|  71.1k|        if (ts < branches<BL>) {
  ------------------
  |  Branch (502:13): [True: 52.7k, False: 18.3k]
  ------------------
  503|  52.7k|            auto new_tail =
  504|  52.7k|                node_t::copy_leaf_emplace(tail, ts, std::move(value));
  505|  52.7k|            return {size + 1, shift, root->inc(), new_tail};
  506|  52.7k|        } else {
  507|  18.3k|            using std::get;
  508|  18.3k|            auto new_tail = node_t::make_leaf_n(1u, std::move(value));
  509|  18.3k|            auto tail_off = tail_offset();
  510|  18.3k|            IMMER_TRY {
  ------------------
  |  |   49|  18.3k|#define IMMER_TRY try
  ------------------
  511|  18.3k|                auto new_root =
  512|  18.3k|                    push_tail(root, shift, tail_off, tail, size - tail_off);
  513|  18.3k|                tail->inc();
  514|  18.3k|                return {size + 1, get<0>(new_root), get<1>(new_root), new_tail};
  515|  18.3k|            }
  516|  18.3k|            IMMER_CATCH (...) {
  517|      0|                node_t::delete_leaf(new_tail, 1u);
  518|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  519|      0|            }
  520|  18.3k|        }
  521|  71.1k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j:
  369|  26.4k|    {
  370|  26.4k|        if (auto r = root->relaxed()) {
  ------------------
  |  Branch (370:18): [True: 14.7k, False: 11.6k]
  ------------------
  371|  14.7k|            auto new_root =
  372|  14.7k|                make_relaxed_pos(root, shift, r)
  373|  14.7k|                    .visit(push_tail_visitor<node_t>{}, tail, tail_size);
  374|  14.7k|            if (new_root)
  ------------------
  |  Branch (374:17): [True: 14.1k, False: 623]
  ------------------
  375|  14.1k|                return std::make_tuple(shift, new_root);
  376|    623|            else {
  377|    623|                auto new_root = node_t::make_inner_r_n(2);
  378|    623|                IMMER_TRY {
  ------------------
  |  |   49|    623|#define IMMER_TRY try
  ------------------
  379|    623|                    auto new_path        = node_t::make_path(shift, tail);
  380|    623|                    new_root->inner()[0] = root->inc();
  381|    623|                    new_root->inner()[1] = new_path;
  382|    623|                    new_root->relaxed()->d.sizes[0] = size;
  383|    623|                    new_root->relaxed()->d.sizes[1] = size + tail_size;
  384|    623|                    assert(size);
  ------------------
  |  Branch (384:21): [True: 623, False: 0]
  ------------------
  385|    623|                    assert(tail_size);
  ------------------
  |  Branch (385:21): [True: 623, False: 0]
  ------------------
  386|    623|                    new_root->relaxed()->d.count = 2u;
  387|    623|                }
  388|    623|                IMMER_CATCH (...) {
  389|      0|                    node_t::delete_inner_r(new_root, 2);
  390|      0|                    IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  391|      0|                }
  392|    623|                return std::make_tuple(shift + B, new_root);
  393|    623|            }
  394|  14.7k|        } else if (size == size_t{branches<B>} << shift) {
  ------------------
  |  Branch (394:20): [True: 965, False: 10.6k]
  ------------------
  395|    965|            auto new_root = node_t::make_inner_n(2);
  396|    965|            IMMER_TRY {
  ------------------
  |  |   49|    965|#define IMMER_TRY try
  ------------------
  397|    965|                auto new_path        = node_t::make_path(shift, tail);
  398|    965|                new_root->inner()[0] = root->inc();
  399|    965|                new_root->inner()[1] = new_path;
  400|    965|            }
  401|    965|            IMMER_CATCH (...) {
  402|      0|                node_t::delete_inner(new_root, 2);
  403|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  404|      0|            }
  405|    965|            return std::make_tuple(shift + B, new_root);
  406|  10.6k|        } else if (size) {
  ------------------
  |  Branch (406:20): [True: 4.17k, False: 6.50k]
  ------------------
  407|  4.17k|            auto new_root = make_regular_sub_pos(root, shift, size)
  408|  4.17k|                                .visit(push_tail_visitor<node_t>{}, tail);
  409|  4.17k|            return std::make_tuple(shift, new_root);
  410|  6.50k|        } else {
  411|  6.50k|            return std::make_tuple(shift, node_t::make_path(shift, tail));
  412|  6.50k|        }
  413|  26.4k|    }
flex-vector-gc.cpp:_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_:
  580|  5.99k|    {
  581|  5.99k|        auto tail_off = tail_offset();
  582|  5.99k|        if (idx >= tail_off) {
  ------------------
  |  Branch (582:13): [True: 524, False: 5.47k]
  ------------------
  583|    524|            auto tail_size = size - tail_off;
  584|    524|            auto new_tail =
  585|    524|                make_leaf_sub_pos(tail, tail_size)
  586|    524|                    .visit(update_visitor<node_t>{}, idx - tail_off, fn);
  587|    524|            return {size, shift, root->inc(), new_tail};
  588|  5.47k|        } else {
  589|  5.47k|            auto new_root = visit_maybe_relaxed_sub(
  590|  5.47k|                root, shift, tail_off, update_visitor<node_t>{}, idx, fn);
  591|  5.47k|            return {size, shift, new_root, tail->inc()};
  592|  5.47k|        }
  593|  5.99k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  647|  12.3k|    {
  648|  12.3k|        auto tail_off = tail_offset();
  649|  12.3k|        if (new_size == 0) {
  ------------------
  |  Branch (649:13): [True: 1.36k, False: 10.9k]
  ------------------
  650|  1.36k|            return {};
  651|  10.9k|        } else if (new_size >= size) {
  ------------------
  |  Branch (651:20): [True: 247, False: 10.7k]
  ------------------
  652|    247|            return *this;
  653|  10.7k|        } else if (new_size > tail_off) {
  ------------------
  |  Branch (653:20): [True: 263, False: 10.4k]
  ------------------
  654|    263|            auto new_tail = node_t::copy_leaf(tail, new_size - tail_off);
  655|    263|            return {new_size, shift, root->inc(), new_tail};
  656|  10.4k|        } else {
  657|  10.4k|            using std::get;
  658|  10.4k|            auto l = new_size - 1;
  659|  10.4k|            auto v = slice_right_visitor<node_t>();
  660|  10.4k|            auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l);
  661|  10.4k|            auto new_shift = get<0>(r);
  662|  10.4k|            auto new_root  = get<1>(r);
  663|  10.4k|            auto new_tail  = get<3>(r);
  664|  10.4k|            if (new_root) {
  ------------------
  |  Branch (664:17): [True: 8.24k, False: 2.23k]
  ------------------
  665|  8.24k|                IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r));
  ------------------
  |  |   68|  8.24k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (665:17): [True: 8.24k, False: 0]
  ------------------
  666|  8.24k|                assert(new_root->check(new_shift, new_size - get<2>(r)));
  ------------------
  |  Branch (666:17): [True: 8.24k, False: 0]
  ------------------
  667|  8.24k|                return {new_size, new_shift, new_root, new_tail};
  668|  8.24k|            } else {
  669|  2.23k|                return {new_size, BL, empty_root(), new_tail};
  670|  2.23k|            }
  671|  10.4k|        }
  672|  12.3k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4dropEm:
  711|  19.6k|    {
  712|  19.6k|        if (elems == 0) {
  ------------------
  |  Branch (712:13): [True: 1.44k, False: 18.1k]
  ------------------
  713|  1.44k|            return *this;
  714|  18.1k|        } else if (elems >= size) {
  ------------------
  |  Branch (714:20): [True: 253, False: 17.9k]
  ------------------
  715|    253|            return {};
  716|  17.9k|        } else if (elems == tail_offset()) {
  ------------------
  |  Branch (716:20): [True: 201, False: 17.7k]
  ------------------
  717|    201|            return {size - elems, BL, empty_root(), tail->inc()};
  718|  17.7k|        } else if (elems > tail_offset()) {
  ------------------
  |  Branch (718:20): [True: 503, False: 17.2k]
  ------------------
  719|    503|            auto tail_off = tail_offset();
  720|    503|            auto new_tail =
  721|    503|                node_t::copy_leaf(tail, elems - tail_off, size - tail_off);
  722|    503|            return {size - elems, BL, empty_root(), new_tail};
  723|  17.2k|        } else {
  724|  17.2k|            using std::get;
  725|  17.2k|            auto v = slice_left_visitor<node_t>();
  726|  17.2k|            auto r =
  727|  17.2k|                visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems);
  728|  17.2k|            auto new_root  = get<1>(r);
  729|  17.2k|            auto new_shift = get<0>(r);
  730|  17.2k|            return {size - elems, new_shift, new_root, tail->inc()};
  731|  17.2k|        }
  732|  19.6k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8max_sizeEv:
   54|  2.02M|    {
   55|  2.02M|        auto S = sizeof(size_t) * 8;
   56|  2.02M|        return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) *
   57|  2.02M|               ipow((size_t{1} << B) - 2, (S - BL) / B);
   58|  2.02M|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6concatERKSB_:
  735|  58.7k|    {
  736|  58.7k|        assert(r.size + size <= max_size());
  ------------------
  |  Branch (736:9): [True: 58.7k, False: 0]
  ------------------
  737|  58.7k|        using std::get;
  738|  58.7k|        if (size == 0)
  ------------------
  |  Branch (738:13): [True: 773, False: 58.0k]
  ------------------
  739|    773|            return r;
  740|  58.0k|        else if (r.size == 0)
  ------------------
  |  Branch (740:18): [True: 366, False: 57.6k]
  ------------------
  741|    366|            return *this;
  742|  57.6k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (742:18): [True: 6.46k, False: 51.1k]
  ------------------
  743|       |            // just concat the tail, similar to push_back
  744|  6.46k|            auto tail_offst = tail_offset();
  745|  6.46k|            auto tail_size  = size - tail_offst;
  746|  6.46k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (746:17): [True: 2.38k, False: 4.07k]
  ------------------
  747|  2.38k|                auto new_root =
  748|  2.38k|                    push_tail(root, shift, tail_offst, tail, tail_size);
  749|  2.38k|                tail->inc();
  750|  2.38k|                return {size + r.size,
  751|  2.38k|                        get<0>(new_root),
  752|  2.38k|                        get<1>(new_root),
  753|  2.38k|                        r.tail->inc()};
  754|  4.07k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (754:24): [True: 2.46k, False: 1.61k]
  ------------------
  755|  2.46k|                auto new_tail =
  756|  2.46k|                    node_t::copy_leaf(tail, tail_size, r.tail, r.size);
  757|  2.46k|                return {size + r.size, shift, root->inc(), new_tail};
  758|  2.46k|            } else {
  759|  1.61k|                auto remaining = branches<BL> - tail_size;
  760|  1.61k|                auto add_tail =
  761|  1.61k|                    node_t::copy_leaf(tail, tail_size, r.tail, remaining);
  762|  1.61k|                IMMER_TRY {
  ------------------
  |  |   49|  1.61k|#define IMMER_TRY try
  ------------------
  763|  1.61k|                    auto new_tail =
  764|  1.61k|                        node_t::copy_leaf(r.tail, remaining, r.size);
  765|  1.61k|                    IMMER_TRY {
  ------------------
  |  |   49|  1.61k|#define IMMER_TRY try
  ------------------
  766|  1.61k|                        auto new_root = push_tail(
  767|  1.61k|                            root, shift, tail_offst, add_tail, branches<BL>);
  768|  1.61k|                        return {size + r.size,
  769|  1.61k|                                get<0>(new_root),
  770|  1.61k|                                get<1>(new_root),
  771|  1.61k|                                new_tail};
  772|  1.61k|                    }
  773|  1.61k|                    IMMER_CATCH (...) {
  774|      0|                        node_t::delete_leaf(new_tail, r.size - remaining);
  775|      0|                        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  776|      0|                    }
  777|  1.61k|                }
  778|  1.61k|                IMMER_CATCH (...) {
  779|      0|                    node_t::delete_leaf(add_tail, branches<BL>);
  780|      0|                    IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  781|      0|                }
  782|  1.61k|            }
  783|  51.1k|        } else if (tail_offset() == 0) {
  ------------------
  |  Branch (783:20): [True: 3.22k, False: 47.9k]
  ------------------
  784|  3.22k|            auto tail_offst = tail_offset();
  785|  3.22k|            auto tail_size  = size - tail_offst;
  786|  3.22k|            auto concated =
  787|  3.22k|                concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset());
  788|  3.22k|            auto new_shift = concated.shift();
  789|  3.22k|            auto new_root  = concated.node();
  790|  3.22k|            IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift());
  ------------------
  |  |   68|  3.22k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (790:13): [True: 3.22k, False: 0]
  ------------------
  791|  3.22k|            assert(new_root->check(new_shift, size + r.tail_offset()));
  ------------------
  |  Branch (791:13): [True: 3.22k, False: 0]
  ------------------
  792|  3.22k|            return {size + r.size, new_shift, new_root, r.tail->inc()};
  793|  47.9k|        } else {
  794|  47.9k|            auto tail_offst = tail_offset();
  795|  47.9k|            auto tail_size  = size - tail_offst;
  796|  47.9k|            auto concated   = concat_trees(root,
  797|  47.9k|                                         shift,
  798|  47.9k|                                         tail_offst,
  799|  47.9k|                                         tail,
  800|  47.9k|                                         tail_size,
  801|  47.9k|                                         r.root,
  802|  47.9k|                                         r.shift,
  803|  47.9k|                                         r.tail_offset());
  804|  47.9k|            auto new_shift  = concated.shift();
  805|  47.9k|            auto new_root   = concated.node();
  806|  47.9k|            IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift());
  ------------------
  |  |   68|  47.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (806:13): [True: 47.9k, False: 0]
  ------------------
  807|  47.9k|            assert(new_root->check(new_shift, size + r.tail_offset()));
  ------------------
  |  Branch (807:13): [True: 47.9k, False: 0]
  ------------------
  808|  47.9k|            return {size + r.size, new_shift, new_root, r.tail->inc()};
  809|  47.9k|        }
  810|  58.7k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi:
  478|  50.1k|    {
  479|  50.1k|        auto ts = tail_size();
  480|  50.1k|        if (ts < branches<BL>) {
  ------------------
  |  Branch (480:13): [True: 32.1k, False: 18.0k]
  ------------------
  481|  32.1k|            ensure_mutable_tail(e, ts);
  482|  32.1k|            new (&tail->leaf()[ts]) T(std::move(value));
  483|  32.1k|        } else {
  484|  18.0k|            using std::get;
  485|  18.0k|            auto new_tail = node_t::make_leaf_e(e, std::move(value));
  486|  18.0k|            auto tail_off = tail_offset();
  487|  18.0k|            IMMER_TRY {
  ------------------
  |  |   49|  18.0k|#define IMMER_TRY try
  ------------------
  488|  18.0k|                push_tail_mut(e, tail_off, tail, ts);
  489|  18.0k|                tail = new_tail;
  490|  18.0k|            }
  491|  18.0k|            IMMER_CATCH (...) {
  492|      0|                node_t::delete_leaf(new_tail, 1u);
  493|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  494|      0|            }
  495|  18.0k|        }
  496|  50.1k|        ++size;
  497|  50.1k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj:
  469|  1.40M|    {
  470|  1.40M|        if (!tail->can_mutate(e)) {
  ------------------
  |  Branch (470:13): [True: 22.3k, False: 1.37M]
  ------------------
  471|  22.3k|            auto new_tail = node_t::copy_leaf_e(e, tail, n);
  472|  22.3k|            dec_leaf(tail, n);
  473|  22.3k|            tail = new_tail;
  474|  22.3k|        }
  475|  1.40M|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj:
  417|  1.73M|    {
  418|  1.73M|        if (auto r = root->relaxed()) {
  ------------------
  |  Branch (418:18): [True: 680k, False: 1.05M]
  ------------------
  419|   680k|            auto new_root =
  420|   680k|                make_relaxed_pos(root, shift, r)
  421|   680k|                    .visit(push_tail_mut_visitor<node_t>{}, e, tail, tail_size);
  422|   680k|            if (new_root) {
  ------------------
  |  Branch (422:17): [True: 678k, False: 1.49k]
  ------------------
  423|   678k|                root = new_root;
  424|   678k|            } else {
  425|  1.49k|                auto new_root = node_t::make_inner_r_e(e);
  426|  1.49k|                IMMER_TRY {
  ------------------
  |  |   49|  1.49k|#define IMMER_TRY try
  ------------------
  427|  1.49k|                    auto new_path        = node_t::make_path_e(e, shift, tail);
  428|  1.49k|                    new_root->inner()[0] = root;
  429|  1.49k|                    new_root->inner()[1] = new_path;
  430|  1.49k|                    new_root->relaxed()->d.sizes[0] = tail_off;
  431|  1.49k|                    new_root->relaxed()->d.sizes[1] = tail_off + tail_size;
  432|  1.49k|                    assert(tail_off);
  ------------------
  |  Branch (432:21): [True: 1.49k, False: 0]
  ------------------
  433|  1.49k|                    assert(tail_size);
  ------------------
  |  Branch (433:21): [True: 1.49k, False: 0]
  ------------------
  434|  1.49k|                    new_root->relaxed()->d.count = 2u;
  435|  1.49k|                    root                         = new_root;
  436|  1.49k|                    shift += B;
  437|  1.49k|                }
  438|  1.49k|                IMMER_CATCH (...) {
  439|      0|                    node_t::delete_inner_r_e(new_root);
  440|      0|                    IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  441|      0|                }
  442|  1.49k|            }
  443|  1.05M|        } else if (tail_off == size_t{branches<B>} << shift) {
  ------------------
  |  Branch (443:20): [True: 5.27k, False: 1.04M]
  ------------------
  444|  5.27k|            auto new_root = node_t::make_inner_e(e);
  445|  5.27k|            IMMER_TRY {
  ------------------
  |  |   49|  5.27k|#define IMMER_TRY try
  ------------------
  446|  5.27k|                auto new_path        = node_t::make_path_e(e, shift, tail);
  447|  5.27k|                new_root->inner()[0] = root;
  448|  5.27k|                new_root->inner()[1] = new_path;
  449|  5.27k|                root                 = new_root;
  450|  5.27k|                shift += B;
  451|  5.27k|            }
  452|  5.27k|            IMMER_CATCH (...) {
  453|      0|                node_t::delete_inner_e(new_root);
  454|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  455|      0|            }
  456|  1.04M|        } else if (tail_off) {
  ------------------
  |  Branch (456:20): [True: 1.04M, False: 5.08k]
  ------------------
  457|  1.04M|            auto new_root =
  458|  1.04M|                make_regular_sub_pos(root, shift, tail_off)
  459|  1.04M|                    .visit(push_tail_mut_visitor<node_t>{}, e, tail);
  460|  1.04M|            root = new_root;
  461|  1.04M|        } else {
  462|  5.08k|            auto new_root = node_t::make_path_e(e, shift, tail);
  463|  5.08k|            dec_empty_regular(root);
  464|  5.08k|            root = new_root;
  465|  5.08k|        }
  466|  1.73M|    }
flex-vector-gc.cpp:_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_:
  573|  11.5k|    {
  574|  11.5k|        auto& elem = get_mut(e, idx);
  575|  11.5k|        elem       = std::forward<FnT>(fn)(std::move(elem));
  576|  11.5k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm:
  539|  11.5k|    {
  540|  11.5k|        auto tail_off = tail_offset();
  541|  11.5k|        if (idx >= tail_off) {
  ------------------
  |  Branch (541:13): [True: 658, False: 10.8k]
  ------------------
  542|    658|            ensure_mutable_tail(e, size - tail_off);
  543|    658|            return tail->leaf()[(idx - tail_off) & mask<BL>];
  544|  10.8k|        } else {
  545|  10.8k|            return visit_maybe_relaxed_sub(root,
  546|  10.8k|                                           shift,
  547|  10.8k|                                           tail_off,
  548|  10.8k|                                           get_mut_visitor<node_t>{},
  549|  10.8k|                                           idx,
  550|  10.8k|                                           e,
  551|  10.8k|                                           &root);
  552|  10.8k|        }
  553|  11.5k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm:
  606|  40.1k|    {
  607|  40.1k|        auto tail_off = tail_offset();
  608|  40.1k|        if (new_size == 0) {
  ------------------
  |  Branch (608:13): [True: 803, False: 39.3k]
  ------------------
  609|    803|            *this = {};
  610|  39.3k|        } else if (new_size >= size) {
  ------------------
  |  Branch (610:20): [True: 2.60k, False: 36.7k]
  ------------------
  611|  2.60k|            return;
  612|  36.7k|        } else if (new_size > tail_off) {
  ------------------
  |  Branch (612:20): [True: 832, False: 35.9k]
  ------------------
  613|    832|            auto ts    = size - tail_off;
  614|    832|            auto newts = new_size - tail_off;
  615|    832|            if (tail->can_mutate(e)) {
  ------------------
  |  Branch (615:17): [True: 551, False: 281]
  ------------------
  616|    551|                detail::destroy_n(tail->leaf() + newts, ts - newts);
  617|    551|            } else {
  618|    281|                auto new_tail = node_t::copy_leaf_e(e, tail, newts);
  619|    281|                dec_leaf(tail, ts);
  620|    281|                tail = new_tail;
  621|    281|            }
  622|    832|            size = new_size;
  623|    832|            return;
  624|  35.9k|        } else {
  625|  35.9k|            using std::get;
  626|  35.9k|            auto l = new_size - 1;
  627|  35.9k|            auto v = slice_right_mut_visitor<node_t>();
  628|  35.9k|            auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e);
  629|  35.9k|            auto new_shift = get<0>(r);
  630|  35.9k|            auto new_root  = get<1>(r);
  631|  35.9k|            auto new_tail  = get<3>(r);
  632|  35.9k|            if (new_root) {
  ------------------
  |  Branch (632:17): [True: 27.3k, False: 8.53k]
  ------------------
  633|  27.3k|                root  = new_root;
  634|  27.3k|                shift = new_shift;
  635|  27.3k|            } else {
  636|  8.53k|                root  = empty_root();
  637|  8.53k|                shift = BL;
  638|  8.53k|            }
  639|  35.9k|            dec_leaf(tail, size - tail_off);
  640|  35.9k|            size = new_size;
  641|  35.9k|            tail = new_tail;
  642|  35.9k|            return;
  643|  35.9k|        }
  644|  40.1k|    }
_ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE:
  942|  33.1k|    {
  943|  33.1k|        assert(&l != &r);
  ------------------
  |  Branch (943:9): [True: 33.1k, False: 0]
  ------------------
  944|  33.1k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (944:9): [True: 33.1k, False: 0]
  ------------------
  945|  33.1k|        using std::get;
  946|  33.1k|        if (r.size == 0)
  ------------------
  |  Branch (946:13): [True: 3.26k, False: 29.9k]
  ------------------
  947|  3.26k|            r = std::move(l);
  948|  29.9k|        else if (l.size == 0)
  ------------------
  |  Branch (948:18): [True: 479, False: 29.4k]
  ------------------
  949|    479|            return;
  950|  29.4k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (950:18): [True: 6.68k, False: 22.7k]
  ------------------
  951|       |            // just concat the tail, similar to push_back
  952|  6.68k|            auto tail_offst = l.tail_offset();
  953|  6.68k|            auto tail_size  = l.size - tail_offst;
  954|  6.68k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (954:17): [True: 1.19k, False: 5.48k]
  ------------------
  955|       |                // this could be improved by making sure that the
  956|       |                // newly created nodes as part of the `push_tail()`
  957|       |                // are tagged with `er`
  958|  1.19k|                auto res =
  959|  1.19k|                    l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size);
  960|  1.19k|                l.tail->inc(); // note: leak if mutably concatenated
  961|       |                               // with itself, but this is forbidden
  962|       |                               // by the interface
  963|  1.19k|                r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()};
  964|  1.19k|                return;
  965|  5.48k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (965:24): [True: 3.27k, False: 2.21k]
  ------------------
  966|       |                // doing this in a exception way mutating way is very
  967|       |                // tricky while potential performance gains are
  968|       |                // minimal (we need to move every element of the right
  969|       |                // tail anyways to make space for the left tail)
  970|       |                //
  971|       |                // we could however improve this by at least moving the
  972|       |                // elements of the right tail...
  973|  3.27k|                auto new_tail =
  974|  3.27k|                    node_t::copy_leaf(l.tail, tail_size, r.tail, r.size);
  975|  3.27k|                r = {l.size + r.size, l.shift, l.root->inc(), new_tail};
  976|  3.27k|                return;
  977|  3.27k|            } else {
  978|       |                // like the immutable version
  979|  2.21k|                auto remaining = branches<BL> - tail_size;
  980|  2.21k|                auto add_tail  = node_t::copy_leaf_e(
  981|  2.21k|                    er, l.tail, tail_size, r.tail, remaining);
  982|  2.21k|                IMMER_TRY {
  ------------------
  |  |   49|  2.21k|#define IMMER_TRY try
  ------------------
  983|  2.21k|                    auto new_tail =
  984|  2.21k|                        node_t::copy_leaf_e(er, r.tail, remaining, r.size);
  985|  2.21k|                    IMMER_TRY {
  ------------------
  |  |   49|  2.21k|#define IMMER_TRY try
  ------------------
  986|       |                        // this could be improved by making sure that the
  987|       |                        // newly created nodes as part of the `push_tail()`
  988|       |                        // are tagged with `er`
  989|  2.21k|                        auto new_root = l.push_tail(l.root,
  990|  2.21k|                                                    l.shift,
  991|  2.21k|                                                    tail_offst,
  992|  2.21k|                                                    add_tail,
  993|  2.21k|                                                    branches<BL>);
  994|  2.21k|                        r             = {l.size + r.size,
  995|  2.21k|                                         get<0>(new_root),
  996|  2.21k|                                         get<1>(new_root),
  997|  2.21k|                                         new_tail};
  998|  2.21k|                        return;
  999|  2.21k|                    }
 1000|  2.21k|                    IMMER_CATCH (...) {
 1001|      0|                        node_t::delete_leaf(new_tail, r.size - remaining);
 1002|      0|                        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1003|      0|                    }
 1004|  2.21k|                }
 1005|  2.21k|                IMMER_CATCH (...) {
 1006|      0|                    node_t::delete_leaf(add_tail, branches<BL>);
 1007|      0|                    IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1008|      0|                }
 1009|  2.21k|            }
 1010|  22.7k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1010:20): [True: 2.72k, False: 20.0k]
  ------------------
 1011|  2.72k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1011:17): [True: 2.72k, Folded]
  ------------------
 1012|  2.72k|                auto tail_offst = l.tail_offset();
 1013|  2.72k|                auto tail_size  = l.size - tail_offst;
 1014|  2.72k|                auto concated =
 1015|  2.72k|                    concat_trees_mut(er,
 1016|  2.72k|                                     MemoryPolicy::transience_t::noone,
 1017|  2.72k|                                     l.tail,
 1018|  2.72k|                                     tail_size,
 1019|  2.72k|                                     er,
 1020|  2.72k|                                     r.root,
 1021|  2.72k|                                     r.shift,
 1022|  2.72k|                                     r.tail_offset());
 1023|  2.72k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  2.72k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1023:17): [True: 2.72k, False: 0]
  ------------------
 1024|  2.72k|                                    concated.node()->compute_shift());
 1025|  2.72k|                r.size += l.size;
 1026|  2.72k|                r.shift = concated.shift();
 1027|  2.72k|                r.root  = concated.node();
 1028|  2.72k|                assert(r.check_tree());
  ------------------
  |  Branch (1028:17): [True: 2.72k, False: 0]
  ------------------
 1029|  2.72k|            } else {
 1030|      0|                auto tail_offst = l.tail_offset();
 1031|      0|                auto tail_size  = l.size - tail_offst;
 1032|      0|                auto concated   = concat_trees(
 1033|      0|                    l.tail, tail_size, r.root, r.shift, r.tail_offset());
 1034|      0|                r = {l.size + r.size,
 1035|      0|                     concated.shift(),
 1036|      0|                     concated.node(),
 1037|      0|                     r.tail->inc()};
 1038|      0|                return;
 1039|      0|            }
 1040|  20.0k|        } else {
 1041|  20.0k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1041:17): [True: 20.0k, Folded]
  ------------------
 1042|  20.0k|                auto tail_offst = l.tail_offset();
 1043|  20.0k|                auto tail_size  = l.size - tail_offst;
 1044|  20.0k|                auto concated =
 1045|  20.0k|                    concat_trees_mut(er,
 1046|  20.0k|                                     MemoryPolicy::transience_t::noone,
 1047|  20.0k|                                     l.root,
 1048|  20.0k|                                     l.shift,
 1049|  20.0k|                                     tail_offst,
 1050|  20.0k|                                     l.tail,
 1051|  20.0k|                                     tail_size,
 1052|  20.0k|                                     er,
 1053|  20.0k|                                     r.root,
 1054|  20.0k|                                     r.shift,
 1055|  20.0k|                                     r.tail_offset());
 1056|  20.0k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  20.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1056:17): [True: 20.0k, False: 0]
  ------------------
 1057|  20.0k|                                    concated.node()->compute_shift());
 1058|  20.0k|                r.size += l.size;
 1059|  20.0k|                r.shift = concated.shift();
 1060|  20.0k|                r.root  = concated.node();
 1061|  20.0k|                assert(r.check_tree());
  ------------------
  |  Branch (1061:17): [True: 20.0k, False: 0]
  ------------------
 1062|  20.0k|                return;
 1063|  20.0k|            } else {
 1064|      0|                auto tail_offst = l.tail_offset();
 1065|      0|                auto tail_size  = l.size - tail_offst;
 1066|      0|                auto concated   = concat_trees(l.root,
 1067|      0|                                             l.shift,
 1068|      0|                                             tail_offst,
 1069|      0|                                             l.tail,
 1070|      0|                                             tail_size,
 1071|      0|                                             r.root,
 1072|      0|                                             r.shift,
 1073|      0|                                             r.tail_offset());
 1074|      0|                r               = {l.size + r.size,
 1075|      0|                                   concated.shift(),
 1076|      0|                                   concated.node(),
 1077|      0|                                   r.tail->inc()};
 1078|      0|                return;
 1079|      0|            }
 1080|  20.0k|        }
 1081|  33.1k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEaSERKSB_:
  163|  6.59k|    {
  164|  6.59k|        auto next{other};
  165|  6.59k|        swap(*this, next);
  166|  6.59k|        return *this;
  167|  6.59k|    }
_ZN5immer6detail4rbts15concat_mut_lr_rERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_:
 1220|  3.89k|    {
 1221|  3.89k|        assert(&l != &r);
  ------------------
  |  Branch (1221:9): [True: 3.89k, False: 0]
  ------------------
 1222|  3.89k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (1222:9): [True: 3.89k, False: 0]
  ------------------
 1223|  3.89k|        using std::get;
 1224|  3.89k|        if (r.size == 0)
  ------------------
  |  Branch (1224:13): [True: 306, False: 3.58k]
  ------------------
 1225|    306|            r = l;
 1226|  3.58k|        else if (l.size == 0)
  ------------------
  |  Branch (1226:18): [True: 206, False: 3.38k]
  ------------------
 1227|    206|            return;
 1228|  3.38k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (1228:18): [True: 1.32k, False: 2.06k]
  ------------------
 1229|       |            // just concat the tail, similar to push_back
 1230|  1.32k|            auto tail_offst = l.tail_offset();
 1231|  1.32k|            auto tail_size  = l.size - tail_offst;
 1232|  1.32k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (1232:17): [True: 367, False: 954]
  ------------------
 1233|       |                // this could be improved by making sure that the
 1234|       |                // newly created nodes as part of the `push_tail()`
 1235|       |                // are tagged with `er`
 1236|    367|                auto res =
 1237|    367|                    l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size);
 1238|    367|                r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()};
 1239|    367|                return;
 1240|    954|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (1240:24): [True: 673, False: 281]
  ------------------
 1241|       |                // doing this in a exception way mutating way is very
 1242|       |                // tricky while potential performance gains are
 1243|       |                // minimal (we need to move every element of the right
 1244|       |                // tail anyways to make space for the left tail)
 1245|       |                //
 1246|       |                // we could however improve this by at least moving the
 1247|       |                // elements of the mutable tails...
 1248|    673|                auto new_tail =
 1249|    673|                    node_t::copy_leaf(l.tail, tail_size, r.tail, r.size);
 1250|    673|                r = {l.size + r.size, l.shift, l.root->inc(), new_tail};
 1251|    673|                return;
 1252|    673|            } else {
 1253|       |                // like the immutable version.
 1254|       |                // we could improve this also by moving elements
 1255|       |                // instead of just copying them
 1256|    281|                auto remaining = branches<BL> - tail_size;
 1257|    281|                auto add_tail  = node_t::copy_leaf_e(
 1258|    281|                    er, l.tail, tail_size, r.tail, remaining);
 1259|    281|                IMMER_TRY {
  ------------------
  |  |   49|    281|#define IMMER_TRY try
  ------------------
 1260|    281|                    auto new_tail =
 1261|    281|                        node_t::copy_leaf_e(er, r.tail, remaining, r.size);
 1262|    281|                    IMMER_TRY {
  ------------------
  |  |   49|    281|#define IMMER_TRY try
  ------------------
 1263|       |                        // this could be improved by making sure that the
 1264|       |                        // newly created nodes as part of the `push_tail()`
 1265|       |                        // are tagged with `er`
 1266|    281|                        auto new_root = l.push_tail(l.root,
 1267|    281|                                                    l.shift,
 1268|    281|                                                    tail_offst,
 1269|    281|                                                    add_tail,
 1270|    281|                                                    branches<BL>);
 1271|    281|                        r             = {l.size + r.size,
 1272|    281|                                         get<0>(new_root),
 1273|    281|                                         get<1>(new_root),
 1274|    281|                                         new_tail};
 1275|    281|                        return;
 1276|    281|                    }
 1277|    281|                    IMMER_CATCH (...) {
 1278|      0|                        node_t::delete_leaf(new_tail, r.size - remaining);
 1279|      0|                        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1280|      0|                    }
 1281|    281|                }
 1282|    281|                IMMER_CATCH (...) {
 1283|      0|                    node_t::delete_leaf(add_tail, branches<BL>);
 1284|      0|                    IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1285|      0|                }
 1286|    281|            }
 1287|  2.06k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1287:20): [True: 817, False: 1.24k]
  ------------------
 1288|    817|            if (supports_transient_concat) {
  ------------------
  |  Branch (1288:17): [True: 817, Folded]
  ------------------
 1289|    817|                auto tail_offst = l.tail_offset();
 1290|    817|                auto tail_size  = l.size - tail_offst;
 1291|    817|                auto concated   = concat_trees_mut(er,
 1292|    817|                                                 el,
 1293|    817|                                                 l.tail,
 1294|    817|                                                 tail_size,
 1295|    817|                                                 er,
 1296|    817|                                                 r.root,
 1297|    817|                                                 r.shift,
 1298|    817|                                                 r.tail_offset());
 1299|    817|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|    817|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1299:17): [True: 817, False: 0]
  ------------------
 1300|    817|                                    concated.node()->compute_shift());
 1301|    817|                assert(concated.node()->check(concated.shift(),
  ------------------
  |  Branch (1301:17): [True: 817, False: 0]
  ------------------
 1302|    817|                                              l.size + r.tail_offset()));
 1303|    817|                r.size += l.size;
 1304|    817|                r.shift = concated.shift();
 1305|    817|                r.root  = concated.node();
 1306|    817|                assert(r.check_tree());
  ------------------
  |  Branch (1306:17): [True: 817, False: 0]
  ------------------
 1307|    817|                l.hard_reset();
 1308|    817|            } else {
 1309|      0|                auto tail_offst = l.tail_offset();
 1310|      0|                auto tail_size  = l.size - tail_offst;
 1311|      0|                auto concated   = concat_trees(
 1312|      0|                    l.tail, tail_size, r.root, r.shift, r.tail_offset());
 1313|      0|                r = {l.size + r.size,
 1314|      0|                     concated.shift(),
 1315|      0|                     concated.node(),
 1316|      0|                     r.tail->inc()};
 1317|      0|                return;
 1318|      0|            }
 1319|  1.24k|        } else {
 1320|  1.24k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1320:17): [True: 1.24k, Folded]
  ------------------
 1321|  1.24k|                auto tail_offst = l.tail_offset();
 1322|  1.24k|                auto tail_size  = l.size - tail_offst;
 1323|  1.24k|                auto concated   = concat_trees_mut(er,
 1324|  1.24k|                                                 el,
 1325|  1.24k|                                                 l.root,
 1326|  1.24k|                                                 l.shift,
 1327|  1.24k|                                                 tail_offst,
 1328|  1.24k|                                                 l.tail,
 1329|  1.24k|                                                 tail_size,
 1330|  1.24k|                                                 er,
 1331|  1.24k|                                                 r.root,
 1332|  1.24k|                                                 r.shift,
 1333|  1.24k|                                                 r.tail_offset());
 1334|  1.24k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  1.24k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1334:17): [True: 1.24k, False: 0]
  ------------------
 1335|  1.24k|                                    concated.node()->compute_shift());
 1336|  1.24k|                assert(concated.node()->check(concated.shift(),
  ------------------
  |  Branch (1336:17): [True: 1.24k, False: 0]
  ------------------
 1337|  1.24k|                                              l.size + r.tail_offset()));
 1338|  1.24k|                r.size += l.size;
 1339|  1.24k|                r.shift = concated.shift();
 1340|  1.24k|                r.root  = concated.node();
 1341|  1.24k|                assert(r.check_tree());
  ------------------
  |  Branch (1341:17): [True: 1.24k, False: 0]
  ------------------
 1342|  1.24k|                l.hard_reset();
 1343|  1.24k|            } else {
 1344|      0|                auto tail_offst = l.tail_offset();
 1345|      0|                auto tail_size  = l.size - tail_offst;
 1346|      0|                auto concated   = concat_trees(l.root,
 1347|      0|                                             l.shift,
 1348|      0|                                             tail_offst,
 1349|      0|                                             l.tail,
 1350|      0|                                             tail_size,
 1351|      0|                                             r.root,
 1352|      0|                                             r.shift,
 1353|      0|                                             r.tail_offset());
 1354|      0|                r               = {l.size + r.size,
 1355|      0|                                   concated.shift(),
 1356|      0|                                   concated.node(),
 1357|      0|                                   r.tail->inc()};
 1358|      0|            }
 1359|  1.24k|        }
 1360|  3.89k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10hard_resetEv:
 1363|  3.99k|    {
 1364|  3.99k|        assert(supports_transient_concat);
  ------------------
  |  Branch (1364:9): [True: 3.99k, Folded]
  ------------------
 1365|  3.99k|        size  = 0;
 1366|  3.99k|        shift = BL;
 1367|  3.99k|        root  = empty_root();
 1368|  3.99k|        tail  = empty_tail();
 1369|  3.99k|    }
_ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_:
  816|  1.83M|    {
  817|  1.83M|        assert(&l != &r);
  ------------------
  |  Branch (817:9): [True: 1.83M, False: 0]
  ------------------
  818|  1.83M|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (818:9): [True: 1.83M, False: 0]
  ------------------
  819|  1.83M|        using std::get;
  820|  1.83M|        if (l.size == 0)
  ------------------
  |  Branch (820:13): [True: 2.49k, False: 1.83M]
  ------------------
  821|  2.49k|            l = r;
  822|  1.83M|        else if (r.size == 0)
  ------------------
  |  Branch (822:18): [True: 13.5k, False: 1.81M]
  ------------------
  823|  13.5k|            return;
  824|  1.81M|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (824:18): [True: 1.72M, False: 95.1k]
  ------------------
  825|       |            // just concat the tail, similar to push_back
  826|  1.72M|            auto tail_offst = l.tail_offset();
  827|  1.72M|            auto tail_size  = l.size - tail_offst;
  828|  1.72M|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (828:17): [True: 357k, False: 1.36M]
  ------------------
  829|   357k|                l.push_tail_mut(el, tail_offst, l.tail, tail_size);
  830|   357k|                l.tail = r.tail->inc();
  831|   357k|                l.size += r.size;
  832|   357k|                return;
  833|  1.36M|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (833:24): [True: 7.53k, False: 1.35M]
  ------------------
  834|  7.53k|                l.ensure_mutable_tail(el, tail_size);
  835|  7.53k|                detail::uninitialized_copy(r.tail->leaf(),
  836|  7.53k|                                           r.tail->leaf() + r.size,
  837|  7.53k|                                           l.tail->leaf() + tail_size);
  838|  7.53k|                l.size += r.size;
  839|  7.53k|                return;
  840|  1.35M|            } else {
  841|  1.35M|                auto remaining = branches<BL> - tail_size;
  842|  1.35M|                l.ensure_mutable_tail(el, tail_size);
  843|  1.35M|                detail::uninitialized_copy(r.tail->leaf(),
  844|  1.35M|                                           r.tail->leaf() + remaining,
  845|  1.35M|                                           l.tail->leaf() + tail_size);
  846|  1.35M|                IMMER_TRY {
  ------------------
  |  |   49|  1.35M|#define IMMER_TRY try
  ------------------
  847|  1.35M|                    auto new_tail =
  848|  1.35M|                        node_t::copy_leaf_e(el, r.tail, remaining, r.size);
  849|  1.35M|                    IMMER_TRY {
  ------------------
  |  |   49|  1.35M|#define IMMER_TRY try
  ------------------
  850|  1.35M|                        l.push_tail_mut(el, tail_offst, l.tail, branches<BL>);
  851|  1.35M|                        l.tail = new_tail;
  852|  1.35M|                        l.size += r.size;
  853|  1.35M|                        return;
  854|  1.35M|                    }
  855|  1.35M|                    IMMER_CATCH (...) {
  856|      0|                        node_t::delete_leaf(new_tail, r.size - remaining);
  857|      0|                        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  858|      0|                    }
  859|  1.35M|                }
  860|  1.35M|                IMMER_CATCH (...) {
  861|      0|                    detail::destroy_n(r.tail->leaf() + tail_size, remaining);
  862|      0|                    IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  863|      0|                }
  864|  1.35M|            }
  865|  1.72M|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (865:20): [True: 3.37k, False: 91.7k]
  ------------------
  866|  3.37k|            if (supports_transient_concat) {
  ------------------
  |  Branch (866:17): [True: 3.37k, Folded]
  ------------------
  867|  3.37k|                auto tail_offst = l.tail_offset();
  868|  3.37k|                auto tail_size  = l.size - tail_offst;
  869|  3.37k|                auto concated =
  870|  3.37k|                    concat_trees_mut(el,
  871|  3.37k|                                     el,
  872|  3.37k|                                     l.tail,
  873|  3.37k|                                     tail_size,
  874|  3.37k|                                     MemoryPolicy::transience_t::noone,
  875|  3.37k|                                     r.root,
  876|  3.37k|                                     r.shift,
  877|  3.37k|                                     r.tail_offset());
  878|  3.37k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  3.37k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (878:17): [True: 3.37k, False: 0]
  ------------------
  879|  3.37k|                                    concated.node()->compute_shift());
  880|  3.37k|                l.size += r.size;
  881|  3.37k|                l.shift = concated.shift();
  882|  3.37k|                l.root  = concated.node();
  883|  3.37k|                l.tail  = r.tail;
  884|  3.37k|                assert(l.check_tree());
  ------------------
  |  Branch (884:17): [True: 3.37k, False: 0]
  ------------------
  885|  3.37k|            } else {
  886|      0|                auto tail_offst = l.tail_offset();
  887|      0|                auto tail_size  = l.size - tail_offst;
  888|      0|                auto concated   = concat_trees(
  889|      0|                    l.tail, tail_size, r.root, r.shift, r.tail_offset());
  890|      0|                l = {l.size + r.size,
  891|      0|                     concated.shift(),
  892|      0|                     concated.node(),
  893|      0|                     r.tail->inc()};
  894|      0|                assert(l.check_tree());
  ------------------
  |  Branch (894:17): [True: 0, False: 0]
  ------------------
  895|      0|                return;
  896|      0|            }
  897|  91.7k|        } else {
  898|  91.7k|            if (supports_transient_concat) {
  ------------------
  |  Branch (898:17): [True: 91.7k, Folded]
  ------------------
  899|  91.7k|                auto tail_offst = l.tail_offset();
  900|  91.7k|                auto tail_size  = l.size - tail_offst;
  901|  91.7k|                assert(l.check_tree());
  ------------------
  |  Branch (901:17): [True: 91.7k, False: 0]
  ------------------
  902|  91.7k|                assert(r.check_tree());
  ------------------
  |  Branch (902:17): [True: 91.7k, False: 0]
  ------------------
  903|  91.7k|                auto concated =
  904|  91.7k|                    concat_trees_mut(el,
  905|  91.7k|                                     el,
  906|  91.7k|                                     l.root,
  907|  91.7k|                                     l.shift,
  908|  91.7k|                                     tail_offst,
  909|  91.7k|                                     l.tail,
  910|  91.7k|                                     tail_size,
  911|  91.7k|                                     MemoryPolicy::transience_t::noone,
  912|  91.7k|                                     r.root,
  913|  91.7k|                                     r.shift,
  914|  91.7k|                                     r.tail_offset());
  915|  91.7k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  91.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (915:17): [True: 91.7k, False: 0]
  ------------------
  916|  91.7k|                                    concated.node()->compute_shift());
  917|  91.7k|                l.size += r.size;
  918|  91.7k|                l.shift = concated.shift();
  919|  91.7k|                l.root  = concated.node();
  920|  91.7k|                l.tail  = r.tail;
  921|  91.7k|                assert(l.check_tree());
  ------------------
  |  Branch (921:17): [True: 91.7k, False: 0]
  ------------------
  922|  91.7k|            } else {
  923|      0|                auto tail_offst = l.tail_offset();
  924|      0|                auto tail_size  = l.size - tail_offst;
  925|      0|                auto concated   = concat_trees(l.root,
  926|      0|                                             l.shift,
  927|      0|                                             tail_offst,
  928|      0|                                             l.tail,
  929|      0|                                             tail_size,
  930|      0|                                             r.root,
  931|      0|                                             r.shift,
  932|      0|                                             r.tail_offset());
  933|      0|                l               = {l.size + r.size,
  934|      0|                                   concated.shift(),
  935|      0|                                   concated.node(),
  936|      0|                                   r.tail->inc()};
  937|      0|            }
  938|  91.7k|        }
  939|  1.83M|    }
_ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_:
 1084|  5.38k|    {
 1085|  5.38k|        assert(&l != &r);
  ------------------
  |  Branch (1085:9): [True: 5.38k, False: 0]
  ------------------
 1086|  5.38k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (1086:9): [True: 5.38k, False: 0]
  ------------------
 1087|  5.38k|        using std::get;
 1088|  5.38k|        if (l.size == 0)
  ------------------
  |  Branch (1088:13): [True: 530, False: 4.85k]
  ------------------
 1089|    530|            l = r;
 1090|  4.85k|        else if (r.size == 0)
  ------------------
  |  Branch (1090:18): [True: 514, False: 4.33k]
  ------------------
 1091|    514|            return;
 1092|  4.33k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (1092:18): [True: 2.40k, False: 1.92k]
  ------------------
 1093|       |            // just concat the tail, similar to push_back
 1094|  2.40k|            auto tail_offst = l.tail_offset();
 1095|  2.40k|            auto tail_size  = l.size - tail_offst;
 1096|  2.40k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (1096:17): [True: 438, False: 1.96k]
  ------------------
 1097|    438|                l.push_tail_mut(el, tail_offst, l.tail, tail_size);
 1098|    438|                l.tail = r.tail->inc();
 1099|    438|                l.size += r.size;
 1100|    438|                return;
 1101|  1.96k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (1101:24): [True: 1.21k, False: 756]
  ------------------
 1102|  1.21k|                l.ensure_mutable_tail(el, tail_size);
 1103|  1.21k|                if (r.tail->can_mutate(er))
  ------------------
  |  Branch (1103:21): [True: 819, False: 394]
  ------------------
 1104|    819|                    detail::uninitialized_move(r.tail->leaf(),
 1105|    819|                                               r.tail->leaf() + r.size,
 1106|    819|                                               l.tail->leaf() + tail_size);
 1107|    394|                else
 1108|    394|                    detail::uninitialized_copy(r.tail->leaf(),
 1109|    394|                                               r.tail->leaf() + r.size,
 1110|    394|                                               l.tail->leaf() + tail_size);
 1111|  1.21k|                l.size += r.size;
 1112|  1.21k|                return;
 1113|  1.21k|            } else {
 1114|    756|                auto remaining = branches<BL> - tail_size;
 1115|    756|                l.ensure_mutable_tail(el, tail_size);
 1116|    756|                if (r.tail->can_mutate(er))
  ------------------
  |  Branch (1116:21): [True: 210, False: 546]
  ------------------
 1117|    210|                    detail::uninitialized_move(r.tail->leaf(),
 1118|    210|                                               r.tail->leaf() + remaining,
 1119|    210|                                               l.tail->leaf() + tail_size);
 1120|    546|                else
 1121|    546|                    detail::uninitialized_copy(r.tail->leaf(),
 1122|    546|                                               r.tail->leaf() + remaining,
 1123|    546|                                               l.tail->leaf() + tail_size);
 1124|    756|                IMMER_TRY {
  ------------------
  |  |   49|    756|#define IMMER_TRY try
  ------------------
 1125|    756|                    auto new_tail =
 1126|    756|                        node_t::copy_leaf_e(el, r.tail, remaining, r.size);
 1127|    756|                    IMMER_TRY {
  ------------------
  |  |   49|    756|#define IMMER_TRY try
  ------------------
 1128|    756|                        l.push_tail_mut(el, tail_offst, l.tail, branches<BL>);
 1129|    756|                        l.tail = new_tail;
 1130|    756|                        l.size += r.size;
 1131|    756|                        return;
 1132|    756|                    }
 1133|    756|                    IMMER_CATCH (...) {
 1134|      0|                        node_t::delete_leaf(new_tail, r.size - remaining);
 1135|      0|                        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1136|      0|                    }
 1137|    756|                }
 1138|    756|                IMMER_CATCH (...) {
 1139|      0|                    detail::destroy_n(r.tail->leaf() + tail_size, remaining);
 1140|      0|                    IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1141|      0|                }
 1142|    756|            }
 1143|  2.40k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1143:20): [True: 584, False: 1.34k]
  ------------------
 1144|    584|            if (supports_transient_concat) {
  ------------------
  |  Branch (1144:17): [True: 584, Folded]
  ------------------
 1145|    584|                auto tail_offst = l.tail_offset();
 1146|    584|                auto tail_size  = l.size - tail_offst;
 1147|    584|                auto concated   = concat_trees_mut(el,
 1148|    584|                                                 el,
 1149|    584|                                                 l.tail,
 1150|    584|                                                 tail_size,
 1151|    584|                                                 er,
 1152|    584|                                                 r.root,
 1153|    584|                                                 r.shift,
 1154|    584|                                                 r.tail_offset());
 1155|    584|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|    584|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1155:17): [True: 584, False: 0]
  ------------------
 1156|    584|                                    concated.node()->compute_shift());
 1157|    584|                l.size += r.size;
 1158|    584|                l.shift = concated.shift();
 1159|    584|                l.root  = concated.node();
 1160|    584|                l.tail  = r.tail;
 1161|    584|                assert(l.check_tree());
  ------------------
  |  Branch (1161:17): [True: 584, False: 0]
  ------------------
 1162|    584|                r.hard_reset();
 1163|    584|                return;
 1164|    584|            } else {
 1165|      0|                auto tail_offst = l.tail_offset();
 1166|      0|                auto tail_size  = l.size - tail_offst;
 1167|      0|                auto concated   = concat_trees(
 1168|      0|                    l.tail, tail_size, r.root, r.shift, r.tail_offset());
 1169|      0|                l = {l.size + r.size,
 1170|      0|                     concated.shift(),
 1171|      0|                     concated.node(),
 1172|      0|                     r.tail->inc()};
 1173|      0|                return;
 1174|      0|            }
 1175|  1.34k|        } else {
 1176|  1.34k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1176:17): [True: 1.34k, Folded]
  ------------------
 1177|  1.34k|                auto tail_offst = l.tail_offset();
 1178|  1.34k|                auto tail_size  = l.size - tail_offst;
 1179|  1.34k|                auto concated   = concat_trees_mut(el,
 1180|  1.34k|                                                 el,
 1181|  1.34k|                                                 l.root,
 1182|  1.34k|                                                 l.shift,
 1183|  1.34k|                                                 tail_offst,
 1184|  1.34k|                                                 l.tail,
 1185|  1.34k|                                                 tail_size,
 1186|  1.34k|                                                 er,
 1187|  1.34k|                                                 r.root,
 1188|  1.34k|                                                 r.shift,
 1189|  1.34k|                                                 r.tail_offset());
 1190|  1.34k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  1.34k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1190:17): [True: 1.34k, False: 0]
  ------------------
 1191|  1.34k|                                    concated.node()->compute_shift());
 1192|  1.34k|                l.size += r.size;
 1193|  1.34k|                l.shift = concated.shift();
 1194|  1.34k|                l.root  = concated.node();
 1195|  1.34k|                l.tail  = r.tail;
 1196|  1.34k|                assert(l.check_tree());
  ------------------
  |  Branch (1196:17): [True: 1.34k, False: 0]
  ------------------
 1197|  1.34k|                r.hard_reset();
 1198|  1.34k|                return;
 1199|  1.34k|            } else {
 1200|      0|                auto tail_offst = l.tail_offset();
 1201|      0|                auto tail_size  = l.size - tail_offst;
 1202|      0|                auto concated   = concat_trees(l.root,
 1203|      0|                                             l.shift,
 1204|      0|                                             tail_offst,
 1205|      0|                                             l.tail,
 1206|      0|                                             tail_size,
 1207|      0|                                             r.root,
 1208|      0|                                             r.shift,
 1209|      0|                                             r.tail_offset());
 1210|      0|                l               = {l.size + r.size,
 1211|      0|                                   concated.shift(),
 1212|      0|                                   concated.node(),
 1213|      0|                                   r.tail->inc()};
 1214|      0|                return;
 1215|      0|            }
 1216|  1.34k|        }
 1217|  5.38k|    }

_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_:
   31|  16.0k|    {
   32|  16.0k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  16.0k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERmEEEDcDpOT_:
   31|  99.2k|    {
   32|  99.2k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  99.2k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_:
   37|  1.49k|    {
   38|  1.49k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.49k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_:
   37|  2.59k|    {
   38|  2.59k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.59k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_:
   37|  2.56k|    {
   38|  2.56k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.56k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EEEE13visit_regularIJRNS1_8full_posISD_EEmEEEDcDpOT_:
   37|  1.26k|    {
   38|  1.26k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.26k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EEmEEEDcDpOT_:
   37|    365|    {
   38|    365|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    365|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_:
   37|  3.22k|    {
   38|  3.22k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.22k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_25singleton_regular_sub_posISD_EENS1_14empty_leaf_posISD_EERPSD_RjRmEEEDcDpOT_:
   43|  3.22k|    {
   44|  3.22k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.22k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_:
   31|  1.90k|    {
   32|  1.90k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.90k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_:
   43|  1.90k|    {
   44|  1.90k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  1.90k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   49|   961k|    {
   50|   961k|        return Deriv::visit_node(std::forward<Args>(args)...);
   51|   961k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   31|  4.15M|    {
   32|  4.15M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  4.15M|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   43|  4.15M|    {
   44|  4.15M|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  4.15M|    }
_ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_:
   31|  1.34M|    {
   32|  1.34M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.34M|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_:
   31|  5.64k|    {
   32|  5.64k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  5.64k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_:
   37|    243|    {
   38|    243|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    243|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_:
   37|  1.33k|    {
   38|  1.33k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.33k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE10visit_leafIJRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   49|   119k|    {
   50|   119k|        return Deriv::visit_node(std::forward<Args>(args)...);
   51|   119k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   37|   235k|    {
   38|   235k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   235k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   43|   235k|    {
   44|   235k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   235k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_:
   37|  28.1k|    {
   38|  28.1k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  28.1k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   37|   115k|    {
   38|   115k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   115k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_34concat_rebalance_plan_fill_visitorEE11visit_innerIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_21concat_rebalance_planILj2ELj2EEEEEEDcDpOT_:
   43|   115k|    {
   44|   115k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   115k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_21concat_merger_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_13concat_mergerISG_EEEEEDcDpOT_:
   37|  17.8k|    {
   38|  17.8k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  17.8k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_:
   37|  1.31k|    {
   38|  1.31k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.31k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EEEEEDcDpOT_:
   43|  1.31k|    {
   44|  1.31k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  1.31k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_:
   31|  41.9k|    {
   32|  41.9k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  41.9k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_:
   43|  41.9k|    {
   44|  41.9k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  41.9k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_:
   31|  39.4k|    {
   32|  39.4k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  39.4k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_:
   43|  39.4k|    {
   44|  39.4k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  39.4k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_:
   31|  2.47k|    {
   32|  2.47k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  2.47k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_:
   37|    780|    {
   38|    780|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    780|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   31|  11.5k|    {
   32|  11.5k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  11.5k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|  1.37k|    {
   38|  1.37k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.37k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_:
   37|  1.51k|    {
   38|  1.51k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.51k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|  4.39k|    {
   38|  4.39k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.39k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_:
   37|  2.01k|    {
   38|  2.01k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.01k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_:
   37|  1.54k|    {
   38|  1.54k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.54k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EERNS1_11relaxed_posISD_EEEEEDcDpOT_:
   37|  11.8k|    {
   38|  11.8k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  11.8k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_:
   31|   168k|    {
   32|   168k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   168k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|    199|    {
   38|    199|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    199|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_:
   31|  1.54k|    {
   32|  1.54k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.54k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|  1.86k|    {
   38|  1.86k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.86k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_:
   31|    395|    {
   32|    395|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    395|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_15regular_sub_posISD_EEEEEDcDpOT_:
   31|    477|    {
   32|    477|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    477|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESJ_EEEDcDpOT_:
   31|   165k|    {
   32|   165k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   165k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|  2.47k|    {
   38|  2.47k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.47k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   43|  2.47k|    {
   44|  2.47k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  2.47k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_:
   37|  6.03k|    {
   38|  6.03k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  6.03k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_trees_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EENS1_8leaf_posISD_EERPSD_RjRmEEEDcDpOT_:
   43|  6.03k|    {
   44|  6.03k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  6.03k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   31|    982|    {
   32|    982|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    982|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   43|    982|    {
   44|    982|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|    982|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|  5.04k|    {
   38|  5.04k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  5.04k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_26concat_trees_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EESJ_RNS1_8leaf_posISD_EEEEEDcDpOT_:
   43|  5.04k|    {
   44|  5.04k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  5.04k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_25singleton_regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_NS1_14empty_leaf_posISD_EESO_RPSD_RjRmEEEDcDpOT_:
   37|  7.50k|    {
   38|  7.50k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  7.50k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_25singleton_regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_NS1_14empty_leaf_posISD_EESO_RPSD_RjRmEEEDcDpOT_:
   43|  7.50k|    {
   44|  7.50k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  7.50k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EESO_EEEDcDpOT_:
   31|  4.10k|    {
   32|  4.10k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  4.10k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EESO_EEEDcDpOT_:
   43|  4.10k|    {
   44|  4.10k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  4.10k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_merger_mut_visitorEE13visit_relaxedIJRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_merger_mutISG_EERNSE_5applyISB_E4type4editEEEEDcDpOT_:
   31|  2.80M|    {
   32|  2.80M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  2.80M|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EESO_EEEDcDpOT_:
   31|  14.8k|    {
   32|  14.8k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  14.8k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EESO_EEEDcDpOT_:
   37|    275|    {
   38|    275|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    275|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EESO_EEEDcDpOT_:
   37|  1.65k|    {
   38|  1.65k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.65k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_merger_mut_visitorEE13visit_regularIJRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_merger_mutISG_EERNSE_5applyISB_E4type4editEEEEDcDpOT_:
   37|   207k|    {
   38|   207k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   207k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_25concat_merger_mut_visitorEE13visit_regularIJRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_merger_mutISG_EERNSE_5applyISB_E4type4editEEEEDcDpOT_:
   37|  98.1k|    {
   38|  98.1k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  98.1k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EESO_EEEDcDpOT_:
   37|  3.39k|    {
   38|  3.39k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.39k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_25singleton_regular_sub_posISD_EERNS1_14empty_leaf_posISD_EESO_EEEDcDpOT_:
   43|  3.39k|    {
   44|  3.39k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.39k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_NS1_8leaf_posISD_EESO_RPSD_RjRmEEEDcDpOT_:
   31|   108k|    {
   32|   108k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   108k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_NS1_8leaf_posISD_EESO_RPSD_RjRmEEEDcDpOT_:
   43|   108k|    {
   44|   108k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   108k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_SJ_RNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   31|  70.5k|    {
   32|  70.5k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  70.5k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_SJ_RNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   43|  70.5k|    {
   44|  70.5k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  70.5k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_SJ_EEEDcDpOT_:
   31|   193k|    {
   32|   193k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   193k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_RNS1_11relaxed_posISD_EEEEEDcDpOT_:
   37|  4.40k|    {
   38|  4.40k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.40k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   31|   121k|    {
   32|   121k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   121k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_SJ_RNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   37|  3.66k|    {
   38|  3.66k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.66k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_SJ_EEEDcDpOT_:
   37|  2.89k|    {
   38|  2.89k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.89k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   37|  20.9k|    {
   38|  20.9k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  20.9k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_RNS1_8full_posISD_EEEEEDcDpOT_:
   37|  13.7k|    {
   38|  13.7k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  13.7k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_SJ_EEEDcDpOT_:
   37|  6.34k|    {
   38|  6.34k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  6.34k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_RNS1_11relaxed_posISD_EEEEEDcDpOT_:
   37|   116k|    {
   38|   116k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   116k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_SJ_RNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   31|   237k|    {
   32|   237k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   237k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   37|  1.23k|    {
   38|  1.23k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.23k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_RNS1_15regular_sub_posISD_EEEEEDcDpOT_:
   31|   216k|    {
   32|   216k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   216k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   37|  2.24k|    {
   38|  2.24k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.24k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_RNS1_8full_posISD_EEEEEDcDpOT_:
   31|    389|    {
   32|    389|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    389|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_RNS1_15regular_sub_posISD_EEEEEDcDpOT_:
   31|    843|    {
   32|    843|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    843|    }
_ZN5immer6detail4rbts12visitor_baseINS1_23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_8leaf_posISD_EESO_SJ_EEEDcDpOT_:
   31|   192k|    {
   32|   192k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   192k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   37|  37.6k|    {
   38|  37.6k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  37.6k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   43|  37.6k|    {
   44|  37.6k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  37.6k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_NS1_8leaf_posISD_EESO_RPSD_RjRmEEEDcDpOT_:
   37|  6.18k|    {
   38|  6.18k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  6.18k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_29concat_trees_left_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_NS1_8leaf_posISD_EESO_RPSD_RjRmEEEDcDpOT_:
   43|  6.18k|    {
   44|  6.18k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  6.18k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   31|  3.37k|    {
   32|  3.37k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  3.37k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_11relaxed_posISD_EERNSB_5applyIS8_E4type4editESO_RNS1_15regular_sub_posISD_EERNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   43|  3.37k|    {
   44|  3.37k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.37k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_SJ_RNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   37|  2.80k|    {
   38|  2.80k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.80k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_30concat_trees_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE11visit_innerIJRNS1_15regular_sub_posISD_EERNSB_5applyIS8_E4type4editESO_SJ_RNS1_8leaf_posISD_EESO_EEEDcDpOT_:
   43|  2.80k|    {
   44|  2.80k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  2.80k|    }

_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE18get_storage_offsetEv:
  127|   926k|    {
  128|   926k|        check_base();
  129|   926k|        return sizeof(Derived);
  130|   926k|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv:
  134|  38.0M|    {
  135|  38.0M|        static_assert(std::is_standard_layout<Derived>::value &&
  136|  38.0M|                          !std::is_empty<Derived>::value,
  137|  38.0M|                      "Please add 'true' if the derived class is emtpy");
  138|  38.0M|    }
_ZN5immer6detail15auto_const_castINS_18no_refcount_policyEEERT_RKS3_:
  143|  22.4M|{
  144|  22.4M|    return const_cast<T&>(x);
  145|  22.4M|}
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE18get_storage_offsetEv:
   87|   383k|    {
   88|   383k|        check_base();
   89|   383k|        return 0;
   90|   383k|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv:
   94|  9.33M|    {
   95|       |        // is_standard_layout requires that only one class in the hierarchy
   96|       |        // contains non-static data members. Since this class contains one
   97|       |        // member, the static_assert will only hold when the derived class is
   98|       |        // empty.
   99|  9.33M|        static_assert(std::is_standard_layout<Derived>::value,
  100|  9.33M|                      "Please remove 'true' if the derived class is non emtpy");
  101|  9.33M|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv:
  113|  37.0M|    {
  114|  37.0M|        check_base();
  115|  37.0M|        auto* base = static_cast<Derived*>(this);
  116|  37.0M|        return reinterpret_cast<T*>(base + 1);
  117|  37.0M|    }
_ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_:
  188|  3.42k|{
  189|  3.42k|    return first + n;
  190|  3.42k|}
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE15get_storage_ptrEv:
   75|  8.95M|    {
   76|  8.95M|        check_base();
   77|  8.95M|        return reinterpret_cast<T*>(this);
   78|  8.95M|    }
_ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_:
  236|  2.96M|{
  237|  2.96M|    return std::copy(first, last, out);
  238|  2.96M|}
_ZN5immer6detail9static_ifILb0EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEZNSC_15make_inner_sr_nEjPNS0_3csl10member_twoINSC_14relaxed_data_tENSE_7inheritIS8_NSE_6memberINSA_5applyIS7_E4type5owneeEvE4typeEE4typeEE4typeEEUlT_E_ZNSC_15make_inner_sr_nEjST_EUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_:
  344|  30.1k|{
  345|  30.1k|    return std::forward<F2>(f2)(empty_t{});
  346|  30.1k|}
_ZN5immer6detail4ipowImEET_S2_j:
  323|  64.8M|{
  324|  64.8M|    return pow == 0 ? 1 : num * ipow(num, pow - 1);
  ------------------
  |  Branch (324:12): [True: 2.02M, False: 62.8M]
  ------------------
  325|  64.8M|}
_ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14relaxed_data_tENS2_7inheritISA_NS2_6memberINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_24ensure_mutable_relaxed_nENSK_4editEjEUlT_E_ZNSE_24ensure_mutable_relaxed_nEST_jEUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_:
  344|   894k|{
  345|   894k|    return std::forward<F2>(f2)(empty_t{});
  346|   894k|}
_ZN5immer6detail9static_ifILb1EZNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14make_inner_r_eENSA_5applyIS7_E4type4editEEUlT_E_EENSt3__19enable_ifIXT_EvE4typeEOT0_:
  329|   875k|{
  330|   875k|    std::forward<F>(f)(empty_t{});
  331|   875k|}
_ZN5immer6detail9static_ifILb0EPNS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEZNSC_15make_inner_sr_eENSA_5applyIS7_E4type4editEPNS0_3csl10member_twoINSC_14relaxed_data_tENSI_7inheritIS8_NSI_6memberINSG_5owneeEvE4typeEE4typeEE4typeEEUlT_E_ZNSC_15make_inner_sr_eESH_SU_EUlSV_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_:
  344|  18.9k|{
  345|  18.9k|    return std::forward<F2>(f2)(empty_t{});
  346|  18.9k|}
_ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_:
  188|    551|{
  189|    551|    return first + n;
  190|    551|}
_ZN5immer6detail9static_ifILb0EPNS0_3csl10member_twoINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14relaxed_data_tENS2_7inheritISA_NS2_6memberINSC_5applyIS9_E4type5owneeEvE4typeEE4typeEE4typeEZNSE_24ensure_mutable_relaxed_eENSK_4editEST_EUlT_E_ZNSE_24ensure_mutable_relaxed_eEST_ST_EUlSU_E0_EENSt3__19enable_ifIXntT_ET0_E4typeEOT1_OT2_:
  344|   555k|{
  345|   555k|    return std::forward<F2>(f2)(empty_t{});
  346|   555k|}
_ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_:
  210|  2.04k|{
  211|  2.04k|    return std::copy(first, last, out);
  212|  2.04k|}

_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
   96|  31.4k|    flex_vector() = default;
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9transientEv:
  507|  94.9k|    IMMER_NODISCARD transient_type transient() const& { return impl_; }
_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE:
  536|   189k|        : impl_(std::move(impl))
  537|   189k|    {
  538|       |#if IMMER_DEBUG_PRINT
  539|       |        // force the compiler to generate debug_print, so we can call
  540|       |        // it from a debugger
  541|       |        [](volatile auto) {}(&flex_vector::debug_print);
  542|       |#endif
  543|   189k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  246|  71.1k|    {
  247|  71.1k|        return impl_.push_back(std::move(value));
  248|  71.1k|    }
_ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4sizeEv:
  181|   181k|    IMMER_NODISCARD size_type size() const { return impl_.size; }
flex-vector-gc.cpp:_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_:
  323|  5.99k|    {
  324|  5.99k|        return impl_.update(index, std::forward<FnT>(fn));
  325|  5.99k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  350|  12.3k|    {
  351|  12.3k|        return impl_.take(elems);
  352|  12.3k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4dropEm:
  376|  19.6k|    {
  377|  19.6k|        return impl_.drop(elems);
  378|  19.6k|    }
_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8max_sizeEv:
   90|  1.96M|    constexpr static size_type max_size() { return impl_t::max_size(); }
_ZN5immerplERKNS_11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEESB_:
  403|  58.7k|    {
  404|  58.7k|        return l.impl_.concat(r.impl_);
  405|  58.7k|    }

_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
   71|  40.7k|    flex_vector_transient() = default;
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE:
  243|  94.9k|        : impl_(std::move(impl))
  244|  94.9k|    {
  245|  94.9k|    }
_ZNR5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10persistentEv:
  233|  22.1k|    {
  234|  22.1k|        this->owner_t::operator=(owner_t{});
  235|  22.1k|        return impl_;
  236|  22.1k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  156|  50.1k|    {
  157|  50.1k|        impl_.push_back_mut(*this, std::move(value));
  158|  50.1k|    }
_ZNK5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4sizeEv:
  127|  3.87M|    IMMER_NODISCARD size_type size() const { return impl_.size; }
flex-vector-gc.cpp:_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6updateIZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_EUlSE_E0_EEvmOSE_:
  180|  11.5k|    {
  181|  11.5k|        impl_.update_mut(*this, index, std::forward<FnT>(fn));
  182|  11.5k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  189|  40.1k|    void take(size_type elems) { impl_.take_mut(*this, elems); }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7prependERS9_:
  219|  33.1k|    {
  220|  33.1k|        l.owner_t::operator=(owner_t{});
  221|  33.1k|        concat_mut_r(l.impl_, impl_, *this);
  222|  33.1k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7prependEOS9_:
  224|  3.89k|    {
  225|  3.89k|        concat_mut_lr_r(l.impl_, l, impl_, *this);
  226|  3.89k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6appendERS9_:
  204|  1.83M|    {
  205|  1.83M|        r.owner_t::operator=(owner_t{});
  206|  1.83M|        concat_mut_l(impl_, *this, r.impl_);
  207|  1.83M|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6appendEOS9_:
  209|  5.38k|    {
  210|  5.38k|        concat_mut_lr_l(impl_, *this, r.impl_, r);
  211|  5.38k|    }

_ZN5immer16gc_disable_guardC2Ev:
  137|  7.87k|    gc_disable_guard() { GC_disable(); }
_ZN5immer7gc_heap8allocateEmNS_10norefs_tagE:
  115|  3.58M|    {
  116|  3.58M|        IMMER_GC_INIT_GUARD_;
  117|  3.58M|        auto p = GC_malloc_atomic(n);
  118|  3.58M|        if (IMMER_UNLIKELY(!p))
  ------------------
  |  |  116|  3.58M|#define IMMER_UNLIKELY(cond) __builtin_expect(!!(cond), 0)
  |  |  ------------------
  |  |  |  Branch (116:30): [True: 0, False: 3.58M]
  |  |  ------------------
  ------------------
  119|      0|            IMMER_THROW(std::bad_alloc{});
  ------------------
  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  ------------------
  120|  3.58M|        return p;
  121|  3.58M|    }
_ZN5immer16gc_disable_guardD2Ev:
  140|  7.87k|    {
  141|  7.87k|        GC_enable();
  142|  7.87k|        GC_gcollect();
  143|  7.87k|    }
_ZN5immer7gc_heap8allocateEm:
  106|  3.90M|    {
  107|  3.90M|        IMMER_GC_INIT_GUARD_;
  108|  3.90M|        auto p = GC_malloc(n);
  109|  3.90M|        if (IMMER_UNLIKELY(!p))
  ------------------
  |  |  116|  3.90M|#define IMMER_UNLIKELY(cond) __builtin_expect(!!(cond), 0)
  |  |  ------------------
  |  |  |  Branch (116:30): [True: 0, False: 3.90M]
  |  |  ------------------
  ------------------
  110|      0|            IMMER_THROW(std::bad_alloc{});
  ------------------
  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  ------------------
  111|  3.90M|        return p;
  112|  3.90M|    }

_ZN5immer18no_refcount_policyC2Ev:
   22|  5.46M|    no_refcount_policy(){};
_ZN5immer18no_refcount_policy3incEv:
   25|  4.08M|    void inc() {}
_ZN5immer18no_refcount_policy3decEv:
   26|  2.07M|    bool dec() { return false; }
_ZN5immer18no_refcount_policy6uniqueEv:
   27|  16.2M|    bool unique() { return false; }

_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5ownerC2Ev:
   60|  2.02M|                    : token_{make_token_()}
   61|  2.02M|                {
   62|  2.02M|                }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owner11make_token_Ev:
   51|  2.02M|                {
   52|  2.02M|                    return heap_::allocate(1, norefs_tag{});
   53|  2.02M|                };
_ZNK5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type4editneES7_:
   45|  4.46M|                bool operator!=(edit x) const { return v != x.v; }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneraSEOS7_:
   79|  1.99M|                {
   80|  1.99M|                    token_ = o.token_.load();
   81|  1.99M|                    return *this;
   82|  1.99M|                }
_ZNK5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5ownee10can_mutateENS6_4editE:
   99|  16.2M|                bool can_mutate(edit t) const { return token_ == t; }
_ZNK5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type4editeqES7_:
   44|  16.2M|                bool operator==(edit x) const { return v == x.v; }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeaSENS6_4editE:
   90|  4.46M|                {
   91|  4.46M|                    assert(e != noone);
  ------------------
  |  Branch (91:21): [True: 4.46M, False: 0]
  ------------------
   92|       |                    // This would be a nice safety plug but it sadly
   93|       |                    // does not hold during transient concatenation.
   94|       |                    // assert(token_ == e || token_ == edit{nullptr});
   95|  4.46M|                    token_ = e;
   96|  4.46M|                    return *this;
   97|  4.46M|                }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5ownercvNS6_4editEEv:
   57|  7.51M|                operator edit() { return {token_}; }

