LLVMFuzzerTestOneInput:
   26|  7.68k|{
   27|  7.68k|    auto guard = immer::gc_disable_guard{};
   28|       |
   29|  7.68k|    constexpr auto var_count = 4;
   30|  7.68k|    constexpr auto bits      = 2;
   31|       |
   32|  7.68k|    using vector_t    = immer::flex_vector<int, gc_memory, bits, bits>;
   33|  7.68k|    using transient_t = typename vector_t::transient_type;
   34|  7.68k|    using size_t      = std::uint8_t;
   35|       |
   36|  7.68k|    auto vs = std::array<vector_t, var_count>{};
   37|  7.68k|    auto ts = std::array<transient_t, var_count>{};
   38|       |
   39|  7.68k|    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
   40|  7.68k|    auto is_valid_var_neq = [](auto other) {
   41|  7.68k|        return [=](auto idx) {
   42|  7.68k|            return idx >= 0 && idx < var_count && idx != other;
   43|  7.68k|        };
   44|  7.68k|    };
   45|  7.68k|    auto is_valid_index = [](auto& v) {
   46|  7.68k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  7.68k|    };
   48|  7.68k|    auto is_valid_size = [](auto& v) {
   49|  7.68k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  7.68k|    };
   51|  7.68k|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  7.68k|        return v1.size() + v2.size() < vector_t::max_size();
   53|  7.68k|    };
   54|       |
   55|  7.68k|    return fuzzer_input{data, size}.run([&](auto& in) {
   56|  7.68k|        enum ops
   57|  7.68k|        {
   58|  7.68k|            op_transient,
   59|  7.68k|            op_persistent,
   60|  7.68k|            op_push_back,
   61|  7.68k|            op_update,
   62|  7.68k|            op_take,
   63|  7.68k|            op_drop,
   64|  7.68k|            op_concat,
   65|  7.68k|            op_push_back_mut,
   66|  7.68k|            op_update_mut,
   67|  7.68k|            op_take_mut,
   68|  7.68k|            op_drop_mut,
   69|  7.68k|            op_prepend_mut,
   70|  7.68k|            op_prepend_mut_move,
   71|  7.68k|            op_append_mut,
   72|  7.68k|            op_append_mut_move,
   73|  7.68k|        };
   74|  7.68k|        auto dst = read<char>(in, is_valid_var);
   75|  7.68k|        switch (read<char>(in)) {
   76|  7.68k|        case op_transient: {
   77|  7.68k|            auto src = read<char>(in, is_valid_var);
   78|  7.68k|            ts[dst]  = vs[src].transient();
   79|  7.68k|            break;
   80|  7.68k|        }
   81|  7.68k|        case op_persistent: {
   82|  7.68k|            auto src = read<char>(in, is_valid_var);
   83|  7.68k|            vs[dst]  = ts[src].persistent();
   84|  7.68k|            break;
   85|  7.68k|        }
   86|  7.68k|        case op_push_back: {
   87|  7.68k|            auto src = read<char>(in, is_valid_var);
   88|  7.68k|            vs[dst]  = vs[src].push_back(42);
   89|  7.68k|            break;
   90|  7.68k|        }
   91|  7.68k|        case op_update: {
   92|  7.68k|            auto src = read<char>(in, is_valid_var);
   93|  7.68k|            auto idx = read<size_t>(in, is_valid_index(vs[src]));
   94|  7.68k|            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
   95|  7.68k|            break;
   96|  7.68k|        }
   97|  7.68k|        case op_take: {
   98|  7.68k|            auto src = read<char>(in, is_valid_var);
   99|  7.68k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  100|  7.68k|            vs[dst]  = vs[src].take(idx);
  101|  7.68k|            break;
  102|  7.68k|        }
  103|  7.68k|        case op_drop: {
  104|  7.68k|            auto src = read<char>(in, is_valid_var);
  105|  7.68k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  106|  7.68k|            vs[dst]  = vs[src].drop(idx);
  107|  7.68k|            break;
  108|  7.68k|        }
  109|  7.68k|        case op_concat: {
  110|  7.68k|            auto src  = read<char>(in, is_valid_var);
  111|  7.68k|            auto src2 = read<char>(in, is_valid_var);
  112|  7.68k|            if (can_concat(vs[src], vs[src2]))
  113|  7.68k|                vs[dst] = vs[src] + vs[src2];
  114|  7.68k|            break;
  115|  7.68k|        }
  116|  7.68k|        case op_push_back_mut: {
  117|  7.68k|            ts[dst].push_back(13);
  118|  7.68k|            break;
  119|  7.68k|        }
  120|  7.68k|        case op_update_mut: {
  121|  7.68k|            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
  122|  7.68k|            ts[dst].update(idx, [](auto x) { return x + 1; });
  123|  7.68k|            break;
  124|  7.68k|        }
  125|  7.68k|        case op_take_mut: {
  126|  7.68k|            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
  127|  7.68k|            ts[dst].take(idx);
  128|  7.68k|            break;
  129|  7.68k|        }
  130|  7.68k|        case op_prepend_mut: {
  131|  7.68k|            auto src = read<char>(in, is_valid_var_neq(dst));
  132|  7.68k|            if (can_concat(ts[dst], ts[src]))
  133|  7.68k|                ts[dst].prepend(ts[src]);
  134|  7.68k|            break;
  135|  7.68k|        }
  136|  7.68k|        case op_prepend_mut_move: {
  137|  7.68k|            auto src = read<char>(in, is_valid_var_neq(dst));
  138|  7.68k|            if (can_concat(ts[dst], ts[src])) {
  139|  7.68k|                ts[dst].prepend(std::move(ts[src]));
  140|  7.68k|                ts[src] = {};
  141|  7.68k|            }
  142|  7.68k|            break;
  143|  7.68k|        }
  144|  7.68k|        case op_append_mut: {
  145|  7.68k|            auto src = read<char>(in, is_valid_var_neq(dst));
  146|  7.68k|            if (can_concat(ts[dst], ts[src]))
  147|  7.68k|                ts[dst].append(ts[src]);
  148|  7.68k|            break;
  149|  7.68k|        }
  150|  7.68k|        case op_append_mut_move: {
  151|  7.68k|            auto src = read<char>(in, is_valid_var_neq(dst));
  152|  7.68k|            if (can_concat(ts[dst], ts[src])) {
  153|  7.68k|                ts[dst].append(std::move(ts[src]));
  154|  7.68k|                ts[src] = {};
  155|  7.68k|            }
  156|  7.68k|            break;
  157|  7.68k|        }
  158|  7.68k|        default:
  159|  7.68k|            break;
  160|  7.68k|        };
  161|  7.68k|        return true;
  162|  7.68k|    });
  163|  7.68k|}
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_:
   55|  2.28M|    return fuzzer_input{data, size}.run([&](auto& in) {
   56|  2.28M|        enum ops
   57|  2.28M|        {
   58|  2.28M|            op_transient,
   59|  2.28M|            op_persistent,
   60|  2.28M|            op_push_back,
   61|  2.28M|            op_update,
   62|  2.28M|            op_take,
   63|  2.28M|            op_drop,
   64|  2.28M|            op_concat,
   65|  2.28M|            op_push_back_mut,
   66|  2.28M|            op_update_mut,
   67|  2.28M|            op_take_mut,
   68|  2.28M|            op_drop_mut,
   69|  2.28M|            op_prepend_mut,
   70|  2.28M|            op_prepend_mut_move,
   71|  2.28M|            op_append_mut,
   72|  2.28M|            op_append_mut_move,
   73|  2.28M|        };
   74|  2.28M|        auto dst = read<char>(in, is_valid_var);
   75|  2.28M|        switch (read<char>(in)) {
   76|   111k|        case op_transient: {
  ------------------
  |  Branch (76:9): [True: 111k, False: 2.17M]
  ------------------
   77|   111k|            auto src = read<char>(in, is_valid_var);
   78|   111k|            ts[dst]  = vs[src].transient();
   79|   111k|            break;
   80|      0|        }
   81|  20.9k|        case op_persistent: {
  ------------------
  |  Branch (81:9): [True: 20.9k, False: 2.26M]
  ------------------
   82|  20.9k|            auto src = read<char>(in, is_valid_var);
   83|  20.9k|            vs[dst]  = ts[src].persistent();
   84|  20.9k|            break;
   85|      0|        }
   86|  60.7k|        case op_push_back: {
  ------------------
  |  Branch (86:9): [True: 60.7k, False: 2.22M]
  ------------------
   87|  60.7k|            auto src = read<char>(in, is_valid_var);
   88|  60.7k|            vs[dst]  = vs[src].push_back(42);
   89|  60.7k|            break;
   90|      0|        }
   91|  5.63k|        case op_update: {
  ------------------
  |  Branch (91:9): [True: 5.63k, False: 2.27M]
  ------------------
   92|  5.63k|            auto src = read<char>(in, is_valid_var);
   93|  5.63k|            auto idx = read<size_t>(in, is_valid_index(vs[src]));
   94|  5.63k|            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
   95|  5.63k|            break;
   96|      0|        }
   97|  12.0k|        case op_take: {
  ------------------
  |  Branch (97:9): [True: 12.0k, False: 2.27M]
  ------------------
   98|  12.0k|            auto src = read<char>(in, is_valid_var);
   99|  12.0k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  100|  12.0k|            vs[dst]  = vs[src].take(idx);
  101|  12.0k|            break;
  102|      0|        }
  103|  17.8k|        case op_drop: {
  ------------------
  |  Branch (103:9): [True: 17.8k, False: 2.26M]
  ------------------
  104|  17.8k|            auto src = read<char>(in, is_valid_var);
  105|  17.8k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  106|  17.8k|            vs[dst]  = vs[src].drop(idx);
  107|  17.8k|            break;
  108|      0|        }
  109|  56.3k|        case op_concat: {
  ------------------
  |  Branch (109:9): [True: 56.3k, False: 2.22M]
  ------------------
  110|  56.3k|            auto src  = read<char>(in, is_valid_var);
  111|  56.3k|            auto src2 = read<char>(in, is_valid_var);
  112|  56.3k|            if (can_concat(vs[src], vs[src2]))
  ------------------
  |  Branch (112:17): [True: 55.1k, False: 1.24k]
  ------------------
  113|  55.1k|                vs[dst] = vs[src] + vs[src2];
  114|  56.3k|            break;
  115|      0|        }
  116|  51.4k|        case op_push_back_mut: {
  ------------------
  |  Branch (116:9): [True: 51.4k, False: 2.23M]
  ------------------
  117|  51.4k|            ts[dst].push_back(13);
  118|  51.4k|            break;
  119|      0|        }
  120|  11.1k|        case op_update_mut: {
  ------------------
  |  Branch (120:9): [True: 11.1k, False: 2.27M]
  ------------------
  121|  11.1k|            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
  122|  11.1k|            ts[dst].update(idx, [](auto x) { return x + 1; });
  123|  11.1k|            break;
  124|      0|        }
  125|  39.4k|        case op_take_mut: {
  ------------------
  |  Branch (125:9): [True: 39.4k, False: 2.24M]
  ------------------
  126|  39.4k|            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
  127|  39.4k|            ts[dst].take(idx);
  128|  39.4k|            break;
  129|      0|        }
  130|  34.3k|        case op_prepend_mut: {
  ------------------
  |  Branch (130:9): [True: 34.3k, False: 2.24M]
  ------------------
  131|  34.3k|            auto src = read<char>(in, is_valid_var_neq(dst));
  132|  34.3k|            if (can_concat(ts[dst], ts[src]))
  ------------------
  |  Branch (132:17): [True: 31.9k, False: 2.39k]
  ------------------
  133|  31.9k|                ts[dst].prepend(ts[src]);
  134|  34.3k|            break;
  135|      0|        }
  136|  4.28k|        case op_prepend_mut_move: {
  ------------------
  |  Branch (136:9): [True: 4.28k, False: 2.27M]
  ------------------
  137|  4.28k|            auto src = read<char>(in, is_valid_var_neq(dst));
  138|  4.28k|            if (can_concat(ts[dst], ts[src])) {
  ------------------
  |  Branch (138:17): [True: 3.71k, False: 571]
  ------------------
  139|  3.71k|                ts[dst].prepend(std::move(ts[src]));
  140|  3.71k|                ts[src] = {};
  141|  3.71k|            }
  142|  4.28k|            break;
  143|      0|        }
  144|  1.81M|        case op_append_mut: {
  ------------------
  |  Branch (144:9): [True: 1.81M, False: 471k]
  ------------------
  145|  1.81M|            auto src = read<char>(in, is_valid_var_neq(dst));
  146|  1.81M|            if (can_concat(ts[dst], ts[src]))
  ------------------
  |  Branch (146:17): [True: 1.78M, False: 29.5k]
  ------------------
  147|  1.78M|                ts[dst].append(ts[src]);
  148|  1.81M|            break;
  149|      0|        }
  150|  6.14k|        case op_append_mut_move: {
  ------------------
  |  Branch (150:9): [True: 6.14k, False: 2.27M]
  ------------------
  151|  6.14k|            auto src = read<char>(in, is_valid_var_neq(dst));
  152|  6.14k|            if (can_concat(ts[dst], ts[src])) {
  ------------------
  |  Branch (152:17): [True: 5.73k, False: 410]
  ------------------
  153|  5.73k|                ts[dst].append(std::move(ts[src]));
  154|  5.73k|                ts[src] = {};
  155|  5.73k|            }
  156|  6.14k|            break;
  157|      0|        }
  158|  31.9k|        default:
  ------------------
  |  Branch (158:9): [True: 31.9k, False: 2.25M]
  ------------------
  159|  31.9k|            break;
  160|  2.28M|        };
  161|  2.27M|        return true;
  162|  2.28M|    });
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_:
   39|  2.87M|    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
  ------------------
  |  Branch (39:48): [True: 2.78M, False: 91.9k]
  |  Branch (39:60): [True: 2.61M, False: 164k]
  ------------------
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|  6.58k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (46:39): [True: 6.58k, False: 0]
  |  Branch (46:51): [True: 5.55k, False: 1.02k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   45|  5.58k|    auto is_valid_index = [](auto& v) {
   46|  5.58k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  5.58k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_:
   94|  5.55k|            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|  47.0k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (49:39): [True: 47.0k, False: 0]
  |  Branch (49:51): [True: 29.7k, False: 17.2k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   48|  29.7k|    auto is_valid_size = [](auto& v) {
   49|  29.7k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  29.7k|    };
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clIRN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEESC_EEDaOT_OT0_:
   51|  56.2k|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  56.2k|        return v1.size() + v2.size() < vector_t::max_size();
   53|  56.2k|    };
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|  12.3k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (46:39): [True: 12.3k, False: 0]
  |  Branch (46:51): [True: 11.1k, False: 1.16k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   45|  11.1k|    auto is_valid_index = [](auto& v) {
   46|  11.1k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  11.1k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_:
  122|  11.1k|            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.5k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (49:39): [True: 41.5k, False: 0]
  |  Branch (49:51): [True: 39.3k, False: 2.17k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   48|  39.4k|    auto is_valid_size = [](auto& v) {
   49|  39.4k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  39.4k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_:
   41|  1.90M|        return [=](auto idx) {
   42|  1.90M|            return idx >= 0 && idx < var_count && idx != other;
  ------------------
  |  Branch (42:20): [True: 1.89M, False: 14.6k]
  |  Branch (42:32): [True: 1.86M, False: 25.3k]
  |  Branch (42:51): [True: 1.85M, False: 12.7k]
  ------------------
   43|  1.90M|        };
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_:
   40|  1.85M|    auto is_valid_var_neq = [](auto other) {
   41|  1.85M|        return [=](auto idx) {
   42|  1.85M|            return idx >= 0 && idx < var_count && idx != other;
   43|  1.85M|        };
   44|  1.85M|    };
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.85M|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  1.85M|        return v1.size() + v2.size() < vector_t::max_size();
   53|  1.85M|    };

flex-vector-gc.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_5EEiT_:
   50|  7.68k|    {
   51|  7.68k|        if (size_ > fuzzer_input_max_size)
  ------------------
  |  Branch (51:13): [True: 12, False: 7.66k]
  ------------------
   52|     12|            return 0;
   53|  7.66k|        try {
   54|  2.28M|            while (step(*this))
  ------------------
  |  Branch (54:20): [True: 2.27M, False: 7.66k]
  ------------------
   55|  2.27M|                continue;
   56|  7.66k|        } catch (const no_more_input&) {
   57|  7.66k|        };
   58|  7.66k|        return 0;
   59|  7.66k|    }
flex-vector-gc.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_:
   70|  2.62M|{
   71|  2.62M|    auto x = read<T>(fz);
   72|  2.88M|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 256k, False: 2.62M]
  ------------------
   73|   256k|        x = read<T>(fz);
   74|  2.62M|    return x;
   75|  2.62M|}
_Z4readIcERKT_R12fuzzer_input:
   64|  7.06M|{
   65|  7.06M|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|  7.06M|}
_ZN12fuzzer_input4nextEmm:
   40|  7.17M|    {
   41|  7.17M|        auto& p = const_cast<void*&>(reinterpret_cast<const void*&>(data_));
   42|  7.17M|        auto r  = std::align(align, size, p, size_);
   43|  7.17M|        if (r == nullptr)
  ------------------
  |  Branch (43:13): [True: 7.66k, False: 7.16M]
  ------------------
   44|  7.66k|            throw no_more_input{};
   45|  7.16M|        return next(size);
   46|  7.17M|    }
_ZN12fuzzer_input4nextEm:
   30|  7.16M|    {
   31|  7.16M|        if (size_ < size)
  ------------------
  |  Branch (31:13): [True: 0, False: 7.16M]
  ------------------
   32|      0|            throw no_more_input{};
   33|  7.16M|        auto r = data_;
   34|  7.16M|        data_ += size;
   35|  7.16M|        size_ -= size;
   36|  7.16M|        return r;
   37|  7.16M|    }
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|  5.58k|{
   71|  5.58k|    auto x = read<T>(fz);
   72|  6.61k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 1.02k, False: 5.58k]
  ------------------
   73|  1.02k|        x = read<T>(fz);
   74|  5.58k|    return x;
   75|  5.58k|}
_Z4readIhERKT_R12fuzzer_input:
   64|   107k|{
   65|   107k|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|   107k|}
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|  29.7k|{
   71|  29.7k|    auto x = read<T>(fz);
   72|  47.0k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 17.2k, False: 29.7k]
  ------------------
   73|  17.2k|        x = read<T>(fz);
   74|  29.7k|    return x;
   75|  29.7k|}
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.1k|{
   71|  11.1k|    auto x = read<T>(fz);
   72|  12.3k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 1.16k, False: 11.1k]
  ------------------
   73|  1.16k|        x = read<T>(fz);
   74|  11.1k|    return x;
   75|  11.1k|}
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|  39.4k|{
   71|  39.4k|    auto x = read<T>(fz);
   72|  41.6k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 2.17k, False: 39.4k]
  ------------------
   73|  2.17k|        x = read<T>(fz);
   74|  39.4k|    return x;
   75|  39.4k|}
flex-vector-gc.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_:
   70|  1.85M|{
   71|  1.85M|    auto x = read<T>(fz);
   72|  1.90M|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 52.7k, False: 1.85M]
  ------------------
   73|  52.7k|        x = read<T>(fz);
   74|  1.85M|    return x;
   75|  1.85M|}

_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.3M|        {
  171|  20.3M|            return x.get_(type_t<U>{});
  172|  20.3M|        }
_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.3M|        {
  185|  20.3M|            return n.get_(t);
  186|  20.3M|        }
_ZNK5immer6detail3csl7inheritINS_18no_refcount_policyENS1_6memberINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE:
   82|  21.7M|        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.38M|        {
  171|  1.38M|            return x.get_(type_t<U>{});
  172|  1.38M|        }
_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.38M|        {
  185|  1.38M|            return n.get_(t);
  186|  1.38M|        }
_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.83M|        {
  166|  2.83M|            return x.get_(type_t<U>{});
  167|  2.83M|        }
_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.83M|        {
  180|  2.83M|            return n.get_(t);
  181|  2.83M|        }
_ZN5immer6detail3csl6memberINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  150|  5.77M|        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|  2.94M|        {
  166|  2.94M|            return x.get_(type_t<U>{});
  167|  2.94M|        }
_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|  2.94M|        {
  180|  2.94M|            return n.get_(t);
  181|  2.94M|        }
_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.3M|        {
  171|  14.3M|            return x.get_(type_t<U>{});
  172|  14.3M|        }
_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.3M|        {
  185|  14.3M|            return n.get_(t);
  186|  14.3M|        }
_ZNK5immer6detail3csl6memberINS_20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  151|  14.3M|        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|  66.1k|    {
  214|  66.1k|        assert(n <= branches<B>);
  ------------------
  |  Branch (214:9): [True: 66.1k, False: 0]
  ------------------
  215|  66.1k|        assert(size >= sizeof_inner_n(n));
  ------------------
  |  Branch (215:9): [True: 66.1k, False: 0]
  ------------------
  216|  66.1k|        auto p                       = new (buffer) node_t;
  217|  66.1k|        p->impl.d.data.inner.relaxed = nullptr;
  218|  66.1k|#if IMMER_TAGGED_NODE
  219|  66.1k|        p->impl.d.kind = node_t::kind_t::inner;
  220|  66.1k|#endif
  221|  66.1k|        return p;
  222|  66.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14sizeof_inner_nEj:
  145|   198k|    {
  146|   198k|        return keep_headroom ? max_sizeof_inner : sizeof_packed_inner_n(n);
  ------------------
  |  Branch (146:16): [Folded, False: 198k]
  ------------------
  147|   198k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE21sizeof_packed_inner_nEj:
  114|   866k|    {
  115|       |        return immer_offsetof(impl_t, d.data.inner) +
  ------------------
  |  |   19|   866k|#define immer_offsetof offsetof
  ------------------
  116|   866k|               inner_t::get_storage_offset() +
  117|   866k|               sizeof(typename inner_t::storage_type) * count;
  118|   866k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3incEv:
  956|  3.36M|    {
  957|  3.36M|        refs(this).inc();
  958|  3.36M|        return this;
  959|  3.36M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4refsEPKSB_:
  203|  20.3M|    {
  204|  20.3M|        return auto_const_cast(get<refs_t>(x->impl));
  205|  20.3M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE16make_leaf_n_intoEPvmj:
  330|   112k|    {
  331|   112k|        assert(n <= branches<BL>);
  ------------------
  |  Branch (331:9): [True: 112k, False: 0]
  ------------------
  332|   112k|        assert(size >= sizeof_leaf_n(n));
  ------------------
  |  Branch (332:9): [True: 112k, False: 0]
  ------------------
  333|   112k|        auto p = new (buffer) node_t;
  334|   112k|#if IMMER_TAGGED_NODE
  335|   112k|        p->impl.d.kind = node_t::kind_t::leaf;
  336|   112k|#endif
  337|   112k|        return p;
  338|   112k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13sizeof_leaf_nEj:
  160|   336k|    {
  161|   336k|        return keep_headroom ? max_sizeof_leaf : sizeof_packed_leaf_n(n);
  ------------------
  |  Branch (161:16): [Folded, False: 336k]
  ------------------
  162|   336k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE20sizeof_packed_leaf_nEj:
  107|   336k|    {
  108|       |        return immer_offsetof(impl_t, d.data.leaf) +
  ------------------
  |  |   19|   336k|#define immer_offsetof offsetof
  ------------------
  109|   336k|               leaf_t::get_storage_offset() +
  110|   336k|               sizeof(typename leaf_t::storage_type) * count;
  111|   336k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7relaxedEv:
  172|  30.6M|    {
  173|  30.6M|        IMMER_ASSERT_TAGGED(kind() == kind_t::inner);
  ------------------
  |  |   68|  30.6M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (173:9): [True: 30.6M, False: 0]
  ------------------
  174|  30.6M|        return impl.d.data.inner.relaxed;
  175|  30.6M|    }
_ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4kindEv:
  168|  80.8M|    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.03M|    bool dec() const { return refs(this).dec(); }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5innerEv:
  184|  36.2M|    {
  185|  36.2M|        IMMER_ASSERT_TAGGED(kind() == kind_t::inner);
  ------------------
  |  |   68|  36.2M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (185:9): [True: 36.2M, False: 0]
  ------------------
  186|  36.2M|        return impl.d.data.inner.get_storage_ptr();
  187|  36.2M|    }
_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.38M|    {
  197|  1.38M|        return auto_const_cast(get<refs_t>(*x));
  198|  1.38M|    }
_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.83M|    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|   641k|    {
  156|   641k|        return keep_headroom ? max_sizeof_relaxed : sizeof_packed_relaxed_n(n);
  ------------------
  |  Branch (156:16): [Folded, False: 641k]
  ------------------
  157|   641k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE23sizeof_packed_relaxed_nEj:
  121|   641k|    {
  122|       |        return immer_offsetof(relaxed_t, d.sizes) + sizeof(size_t) * count;
  ------------------
  |  |   19|   641k|#define immer_offsetof offsetof
  ------------------
  123|   641k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5owneeEPSB_:
  210|  2.94M|    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|   667k|    {
  151|   667k|        return keep_headroom ? max_sizeof_inner_r : sizeof_packed_inner_r_n(n);
  ------------------
  |  Branch (151:16): [Folded, False: 667k]
  ------------------
  152|   667k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE23sizeof_packed_inner_r_nEj:
  126|   667k|    {
  127|   667k|        return embed_relaxed ? sizeof_packed_inner_n(count) +
  ------------------
  |  Branch (127:16): [Folded, False: 667k]
  ------------------
  128|      0|                                   sizeof_packed_relaxed_n(count)
  129|   667k|                             : sizeof_packed_inner_n(count);
  130|   667k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4leafEv:
  190|  8.35M|    {
  191|  8.35M|        IMMER_ASSERT_TAGGED(kind() == kind_t::leaf);
  ------------------
  |  |   68|  8.35M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (191:9): [True: 8.35M, False: 0]
  ------------------
  192|  8.35M|        return impl.d.data.leaf.get_storage_ptr();
  193|  8.35M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE17copy_leaf_emplaceIiEEPSB_SD_jOT_:
  794|  45.1k|    {
  795|  45.1k|        auto dst = copy_leaf_n(n + 1, src, n);
  796|  45.1k|        IMMER_TRY {
  ------------------
  |  |   49|  45.1k|#define IMMER_TRY try
  ------------------
  797|  45.1k|            new (dst->leaf() + n) T(std::forward<U>(x));
  798|  45.1k|        }
  799|  45.1k|        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|  45.1k|        return dst;
  805|  45.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_nEjPSB_j:
  696|  45.1k|    {
  697|  45.1k|        assert(allocn >= n);
  ------------------
  |  Branch (697:9): [True: 45.1k, False: 0]
  ------------------
  698|  45.1k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  45.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (698:9): [True: 45.1k, False: 0]
  ------------------
  699|  45.1k|        auto dst = make_leaf_n(allocn);
  700|  45.1k|        IMMER_TRY {
  ------------------
  |  |   49|  45.1k|#define IMMER_TRY try
  ------------------
  701|  45.1k|            detail::uninitialized_copy(
  702|  45.1k|                src->leaf(), src->leaf() + n, dst->leaf());
  703|  45.1k|        }
  704|  45.1k|        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|  45.1k|        return dst;
  709|  45.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_nEj:
  341|   112k|    {
  342|   112k|        assert(n <= branches<BL>);
  ------------------
  |  Branch (342:9): [True: 112k, False: 0]
  ------------------
  343|   112k|        auto m = heap::allocate(sizeof_leaf_n(n));
  344|   112k|        return make_leaf_n_into(m, sizeof_leaf_n(n), n);
  345|   112k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_nIiEEPSB_jOT_:
  470|  15.5k|    {
  471|  15.5k|        assert(n >= 1);
  ------------------
  |  Branch (471:9): [True: 15.5k, False: 0]
  ------------------
  472|  15.5k|        auto p = make_leaf_n(n);
  473|  15.5k|        IMMER_TRY {
  ------------------
  |  |   49|  15.5k|#define IMMER_TRY try
  ------------------
  474|  15.5k|            new (p->leaf()) T(std::forward<U>(x));
  475|  15.5k|        }
  476|  15.5k|        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|  15.5k|        return p;
  481|  15.5k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13do_copy_innerEPSB_SC_j:
  558|  96.1k|    {
  559|  96.1k|        IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner);
  ------------------
  |  |   68|  96.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (559:9): [True: 96.1k, False: 0]
  ------------------
  560|  96.1k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  96.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (560:9): [True: 96.1k, False: 0]
  ------------------
  561|  96.1k|        auto p = src->inner();
  562|  96.1k|        inc_nodes(p, n);
  563|  96.1k|        std::copy(p, p + n, dst->inner());
  564|  96.1k|        return dst;
  565|  96.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9inc_nodesEPPSB_j:
  970|   383k|    {
  971|   997k|        for (auto i = p, e = i + n; i != e; ++i)
  ------------------
  |  Branch (971:37): [True: 613k, False: 383k]
  ------------------
  972|   613k|            refs(*i).inc();
  973|   383k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14copy_inner_r_nEjPSB_j:
  588|  45.2k|    {
  589|  45.2k|        assert(allocn >= n);
  ------------------
  |  Branch (589:9): [True: 45.2k, False: 0]
  ------------------
  590|  45.2k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  45.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (590:9): [True: 45.2k, False: 0]
  ------------------
  591|  45.2k|        auto dst = make_inner_r_n(allocn);
  592|  45.2k|        return do_copy_inner_r(dst, src, n);
  593|  45.2k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15do_copy_inner_rEPSB_SC_j:
  610|  81.2k|    {
  611|  81.2k|        IMMER_ASSERT_TAGGED(dst->kind() == kind_t::inner);
  ------------------
  |  |   68|  81.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (611:9): [True: 81.2k, False: 0]
  ------------------
  612|  81.2k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  81.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (612:9): [True: 81.2k, False: 0]
  ------------------
  613|  81.2k|        auto src_r = src->relaxed();
  614|  81.2k|        auto dst_r = dst->relaxed();
  615|  81.2k|        inc_nodes(src->inner(), n);
  616|  81.2k|        std::copy(src->inner(), src->inner() + n, dst->inner());
  617|  81.2k|        std::copy(src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  618|  81.2k|        dst_r->d.count = n;
  619|  81.2k|        return dst;
  620|  81.2k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14make_inner_r_nEj:
  243|   641k|    {
  244|   641k|        assert(n <= branches<B>);
  ------------------
  |  Branch (244:9): [True: 641k, False: 0]
  ------------------
  245|   641k|        auto mp = heap::allocate(sizeof_inner_r_n(n));
  246|   641k|        auto mr = static_cast<void*>(nullptr);
  247|   641k|        if (embed_relaxed) {
  ------------------
  |  Branch (247:13): [Folded, False: 641k]
  ------------------
  248|      0|            mr = reinterpret_cast<unsigned char*>(mp) + sizeof_inner_n(n);
  249|   641k|        } else {
  250|   641k|            IMMER_TRY {
  ------------------
  |  |   49|   641k|#define IMMER_TRY try
  ------------------
  251|   641k|                mr = heap::allocate(sizeof_relaxed_n(n), norefs_tag{});
  252|   641k|            }
  253|   641k|            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|   641k|        }
  258|   641k|        auto p                       = new (mp) node_t;
  259|   641k|        auto r                       = new (mr) relaxed_t;
  260|   641k|        r->d.count                   = 0;
  261|   641k|        p->impl.d.data.inner.relaxed = r;
  262|   641k|#if IMMER_TAGGED_NODE
  263|   641k|        p->impl.d.kind = node_t::kind_t::inner;
  264|   641k|#endif
  265|   641k|        return p;
  266|   641k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9make_pathEjPSB_:
  498|  35.8k|    {
  499|  35.8k|        IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf);
  ------------------
  |  |   68|  35.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (499:9): [True: 35.8k, False: 0]
  ------------------
  500|  35.8k|        if (shift == endshift<B, BL>)
  ------------------
  |  Branch (500:13): [True: 23.1k, False: 12.6k]
  ------------------
  501|  23.1k|            return node;
  502|  12.6k|        else {
  503|  12.6k|            auto n = node_t::make_inner_n(1);
  504|  12.6k|            IMMER_TRY {
  ------------------
  |  |   49|  12.6k|#define IMMER_TRY try
  ------------------
  505|  12.6k|                n->inner()[0] = make_path(shift - B, node);
  506|  12.6k|            }
  507|  12.6k|            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|  12.6k|            return n;
  512|  12.6k|        }
  513|  35.8k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12make_inner_nEj:
  224|  66.1k|    {
  225|  66.1k|        assert(n <= branches<B>);
  ------------------
  |  Branch (225:9): [True: 66.1k, False: 0]
  ------------------
  226|  66.1k|        auto m = heap::allocate(sizeof_inner_n(n));
  227|  66.1k|        return make_inner_n_into(m, sizeof_inner_n(n), n);
  228|  66.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9copy_leafEPSB_j:
  666|  12.2k|    {
  667|  12.2k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  12.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (667:9): [True: 12.2k, False: 0]
  ------------------
  668|  12.2k|        auto dst = make_leaf_n(n);
  669|  12.2k|        IMMER_TRY {
  ------------------
  |  |   49|  12.2k|#define IMMER_TRY try
  ------------------
  670|  12.2k|            detail::uninitialized_copy(
  671|  12.2k|                src->leaf(), src->leaf() + n, dst->leaf());
  672|  12.2k|        }
  673|  12.2k|        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|  12.2k|        return dst;
  678|  12.2k|    }
_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|  26.7k|    {
  270|  26.7k|        return static_if<embed_relaxed, node_t*>(
  271|  26.7k|            [&](auto) { return node_t::make_inner_r_n(n); },
  272|  26.7k|            [&](auto) {
  273|  26.7k|                auto p =
  274|  26.7k|                    new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t;
  275|  26.7k|                assert(r->d.count >= n);
  276|  26.7k|                node_t::refs(r).inc();
  277|  26.7k|                p->impl.d.data.inner.relaxed = r;
  278|  26.7k|#if IMMER_TAGGED_NODE
  279|  26.7k|                p->impl.d.kind = node_t::kind_t::inner;
  280|  26.7k|#endif
  281|  26.7k|                return p;
  282|  26.7k|            });
  283|  26.7k|    }
_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|  26.7k|            [&](auto) {
  273|  26.7k|                auto p =
  274|  26.7k|                    new (heap::allocate(node_t::sizeof_inner_r_n(n))) node_t;
  275|  26.7k|                assert(r->d.count >= n);
  ------------------
  |  Branch (275:17): [True: 26.7k, False: 0]
  ------------------
  276|  26.7k|                node_t::refs(r).inc();
  277|  26.7k|                p->impl.d.data.inner.relaxed = r;
  278|  26.7k|#if IMMER_TAGGED_NODE
  279|  26.7k|                p->impl.d.kind = node_t::kind_t::inner;
  280|  26.7k|#endif
  281|  26.7k|                return p;
  282|  26.7k|            });
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE24do_copy_inner_replace_srEPSB_SC_jjSC_:
  652|  26.7k|    {
  653|  26.7k|        if (embed_relaxed)
  ------------------
  |  Branch (653:13): [Folded, False: 26.7k]
  ------------------
  654|      0|            return do_copy_inner_replace_r(dst, src, n, offset, child);
  655|  26.7k|        else {
  656|  26.7k|            auto p = src->inner();
  657|  26.7k|            inc_nodes(p, offset);
  658|  26.7k|            inc_nodes(p + offset + 1, n - offset - 1);
  659|  26.7k|            std::copy(p, p + n, dst->inner());
  660|  26.7k|            dst->inner()[offset] = child;
  661|  26.7k|            return dst;
  662|  26.7k|        }
  663|  26.7k|    }
_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.11k|    {
  544|  5.11k|        assert(allocn >= n);
  ------------------
  |  Branch (544:9): [True: 5.11k, False: 0]
  ------------------
  545|  5.11k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  5.11k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (545:9): [True: 5.11k, False: 0]
  ------------------
  546|  5.11k|        auto dst = make_inner_n(allocn);
  547|  5.11k|        return do_copy_inner(dst, src, n);
  548|  5.11k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12copy_inner_rEPSB_j:
  581|  2.28k|    {
  582|  2.28k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  2.28k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (582:9): [True: 2.28k, False: 0]
  ------------------
  583|  2.28k|        auto dst = make_inner_r_n(n);
  584|  2.28k|        return do_copy_inner_r(dst, src, n);
  585|  2.28k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13compute_shiftEv:
  977|  1.45M|    {
  978|  1.45M|        if (kind() == kind_t::leaf)
  ------------------
  |  Branch (978:13): [True: 180k, False: 1.27M]
  ------------------
  979|   180k|            return endshift<B, BL>;
  980|  1.27M|        else
  981|  1.27M|            return B + inner()[0]->compute_shift();
  982|  1.45M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5checkEjm:
  986|  57.3k|    {
  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|  57.3k|        return true;
 1023|  57.3k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9copy_leafEPSB_jj:
  778|  17.5k|    {
  779|  17.5k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  17.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (779:9): [True: 17.5k, False: 0]
  ------------------
  780|  17.5k|        auto dst = make_leaf_n(last - idx);
  781|  17.5k|        IMMER_TRY {
  ------------------
  |  |   49|  17.5k|#define IMMER_TRY try
  ------------------
  782|  17.5k|            detail::uninitialized_copy(
  783|  17.5k|                src->leaf() + idx, src->leaf() + last, dst->leaf());
  784|  17.5k|        }
  785|  17.5k|        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|  17.5k|        return dst;
  790|  17.5k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9copy_leafEPSB_jSC_j:
  712|  7.61k|    {
  713|  7.61k|        IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf);
  ------------------
  |  |   68|  7.61k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (713:9): [True: 7.61k, False: 0]
  ------------------
  714|  7.61k|        IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf);
  ------------------
  |  |   68|  7.61k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (714:9): [True: 7.61k, False: 0]
  ------------------
  715|  7.61k|        auto dst = make_leaf_n(n1 + n2);
  716|  7.61k|        IMMER_TRY {
  ------------------
  |  |   49|  7.61k|#define IMMER_TRY try
  ------------------
  717|  7.61k|            detail::uninitialized_copy(
  718|  7.61k|                src1->leaf(), src1->leaf() + n1, dst->leaf());
  719|  7.61k|        }
  720|  7.61k|        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|  7.61k|        IMMER_TRY {
  ------------------
  |  |   49|  7.61k|#define IMMER_TRY try
  ------------------
  725|  7.61k|            detail::uninitialized_copy(
  726|  7.61k|                src2->leaf(), src2->leaf() + n2, dst->leaf() + n1);
  727|  7.61k|        }
  728|  7.61k|        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|  7.61k|        return dst;
  734|  7.61k|    }
_ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10can_mutateENS9_5applyIS6_E4type4editE:
  870|  14.3M|    {
  871|  14.3M|        return refs(this).unique() || ownee(this).can_mutate(e);
  ------------------
  |  Branch (871:16): [True: 0, False: 14.3M]
  |  Branch (871:39): [True: 13.2M, False: 1.06M]
  ------------------
  872|  14.3M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE5owneeEPKSB_:
  207|  14.3M|    {
  208|  14.3M|        return get<ownee_t>(x->impl);
  209|  14.3M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_j:
  681|  46.0k|    {
  682|  46.0k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  46.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (682:9): [True: 46.0k, False: 0]
  ------------------
  683|  46.0k|        auto dst = make_leaf_e(e);
  684|  46.0k|        IMMER_TRY {
  ------------------
  |  |   49|  46.0k|#define IMMER_TRY try
  ------------------
  685|  46.0k|            detail::uninitialized_copy(
  686|  46.0k|                src->leaf(), src->leaf() + n, dst->leaf());
  687|  46.0k|        }
  688|  46.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|  46.0k|        return dst;
  693|  46.0k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_eENS9_5applyIS6_E4type4editE:
  348|  1.36M|    {
  349|  1.36M|        auto p   = new (heap::allocate(max_sizeof_leaf)) node_t;
  350|  1.36M|        ownee(p) = e;
  351|  1.36M|#if IMMER_TAGGED_NODE
  352|  1.36M|        p->impl.d.kind = node_t::kind_t::leaf;
  353|  1.36M|#endif
  354|  1.36M|        return p;
  355|  1.36M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11make_leaf_eIiEEPSB_NS9_5applyIS6_E4type4editEOT_:
  485|  18.9k|    {
  486|  18.9k|        auto p = make_leaf_e(e);
  487|  18.9k|        IMMER_TRY {
  ------------------
  |  |   49|  18.9k|#define IMMER_TRY try
  ------------------
  488|  18.9k|            new (p->leaf()) T(std::forward<U>(x));
  489|  18.9k|        }
  490|  18.9k|        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.9k|        return p;
  495|  18.9k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE24ensure_mutable_relaxed_nENS9_5applyIS6_E4type4editEj:
  930|   732k|    {
  931|   732k|        auto src_r = relaxed();
  932|   732k|        return static_if<embed_relaxed, relaxed_t*>(
  933|   732k|            [&](auto) { return src_r; },
  934|   732k|            [&](auto) {
  935|   732k|                if (node_t::refs(src_r).unique() ||
  936|   732k|                    node_t::ownee(src_r).can_mutate(e))
  937|   732k|                    return src_r;
  938|   732k|                else {
  939|   732k|                    auto dst_r =
  940|   732k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  941|   732k|                    if (src_r) {
  942|   732k|                        std::copy(
  943|   732k|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  944|   732k|                        if (node_t::refs(src_r).dec())
  945|   732k|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  946|   732k|                                             src_r);
  947|   732k|                    }
  948|   732k|                    dst_r->d.count                   = n;
  949|   732k|                    node_t::ownee(dst_r)             = e;
  950|   732k|                    return impl.d.data.inner.relaxed = dst_r;
  951|   732k|                }
  952|   732k|            });
  953|   732k|    }
_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|   732k|            [&](auto) {
  935|   732k|                if (node_t::refs(src_r).unique() ||
  ------------------
  |  Branch (935:21): [True: 0, False: 732k]
  ------------------
  936|   732k|                    node_t::ownee(src_r).can_mutate(e))
  ------------------
  |  Branch (936:21): [True: 730k, False: 2.41k]
  ------------------
  937|   730k|                    return src_r;
  938|  2.41k|                else {
  939|  2.41k|                    auto dst_r =
  940|  2.41k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  941|  2.41k|                    if (src_r) {
  ------------------
  |  Branch (941:25): [True: 2.41k, False: 0]
  ------------------
  942|  2.41k|                        std::copy(
  943|  2.41k|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  944|  2.41k|                        if (node_t::refs(src_r).dec())
  ------------------
  |  Branch (944:29): [True: 0, False: 2.41k]
  ------------------
  945|      0|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  946|      0|                                             src_r);
  947|  2.41k|                    }
  948|  2.41k|                    dst_r->d.count                   = n;
  949|  2.41k|                    node_t::ownee(dst_r)             = e;
  950|  2.41k|                    return impl.d.data.inner.relaxed = dst_r;
  951|  2.41k|                }
  952|   732k|            });
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14copy_inner_r_eENS9_5applyIS6_E4type4editEPSB_j:
  596|  33.8k|    {
  597|  33.8k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  33.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (597:9): [True: 33.8k, False: 0]
  ------------------
  598|  33.8k|        auto dst = make_inner_r_e(e);
  599|  33.8k|        return do_copy_inner_r(dst, src, n);
  600|  33.8k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE14make_inner_r_eENS9_5applyIS6_E4type4editE:
  286|   877k|    {
  287|   877k|        auto mp = heap::allocate(max_sizeof_inner_r);
  288|   877k|        auto mr = static_cast<void*>(nullptr);
  289|   877k|        if (embed_relaxed) {
  ------------------
  |  Branch (289:13): [Folded, False: 877k]
  ------------------
  290|      0|            mr = reinterpret_cast<unsigned char*>(mp) + max_sizeof_inner;
  291|   877k|        } else {
  292|   877k|            IMMER_TRY {
  ------------------
  |  |   49|   877k|#define IMMER_TRY try
  ------------------
  293|   877k|                mr = heap::allocate(max_sizeof_relaxed, norefs_tag{});
  294|   877k|            }
  295|   877k|            IMMER_CATCH (...) {
  296|      0|                heap::deallocate(max_sizeof_inner_r, mp);
  297|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  298|      0|            }
  299|   877k|        }
  300|   877k|        auto p   = new (mp) node_t;
  301|   877k|        auto r   = new (mr) relaxed_t;
  302|   877k|        ownee(p) = e;
  303|   877k|        static_if<!embed_relaxed>([&](auto) { node_t::ownee(r) = e; });
  304|   877k|        r->d.count                   = 0;
  305|   877k|        p->impl.d.data.inner.relaxed = r;
  306|   877k|#if IMMER_TAGGED_NODE
  307|   877k|        p->impl.d.kind = node_t::kind_t::inner;
  308|   877k|#endif
  309|   877k|        return p;
  310|   877k|    }
_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|   877k|        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.25M|    {
  517|  2.25M|        IMMER_ASSERT_TAGGED(node->kind() == kind_t::leaf);
  ------------------
  |  |   68|  2.25M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (517:9): [True: 2.25M, False: 0]
  ------------------
  518|  2.25M|        if (shift == endshift<B, BL>)
  ------------------
  |  Branch (518:13): [True: 1.68M, False: 567k]
  ------------------
  519|  1.68M|            return node;
  520|   567k|        else {
  521|   567k|            auto n = node_t::make_inner_e(e);
  522|   567k|            IMMER_TRY {
  ------------------
  |  |   49|   567k|#define IMMER_TRY try
  ------------------
  523|   567k|                n->inner()[0] = make_path_e(e, shift - B, node);
  524|   567k|            }
  525|   567k|            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|   567k|            return n;
  530|   567k|        }
  531|  2.25M|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12make_inner_eENS9_5applyIS6_E4type4editE:
  231|   620k|    {
  232|   620k|        auto m                       = heap::allocate(max_sizeof_inner);
  233|   620k|        auto p                       = new (m) node_t;
  234|   620k|        ownee(p)                     = e;
  235|   620k|        p->impl.d.data.inner.relaxed = nullptr;
  236|   620k|#if IMMER_TAGGED_NODE
  237|   620k|        p->impl.d.kind = node_t::kind_t::inner;
  238|   620k|#endif
  239|   620k|        return p;
  240|   620k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE12copy_inner_eENS9_5applyIS6_E4type4editEPSB_j:
  551|  27.4k|    {
  552|  27.4k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  27.4k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (552:9): [True: 27.4k, False: 0]
  ------------------
  553|  27.4k|        auto dst = make_inner_e(e);
  554|  27.4k|        return do_copy_inner(dst, src, n);
  555|  27.4k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE15copy_inner_sr_eENS9_5applyIS6_E4type4editEPSB_j:
  603|  18.1k|    {
  604|  18.1k|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::inner);
  ------------------
  |  |   68|  18.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (604:9): [True: 18.1k, False: 0]
  ------------------
  605|  18.1k|        auto dst = make_inner_sr_e(e, src->relaxed());
  606|  18.1k|        return do_copy_inner_sr(dst, src, n);
  607|  18.1k|    }
_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.1k|    {
  314|  18.1k|        return static_if<embed_relaxed, node_t*>(
  315|  18.1k|            [&](auto) { return node_t::make_inner_r_e(e); },
  316|  18.1k|            [&](auto) {
  317|  18.1k|                auto p =
  318|  18.1k|                    new (heap::allocate(node_t::max_sizeof_inner_r)) node_t;
  319|  18.1k|                node_t::refs(r).inc();
  320|  18.1k|                p->impl.d.data.inner.relaxed = r;
  321|  18.1k|                node_t::ownee(p)             = e;
  322|  18.1k|#if IMMER_TAGGED_NODE
  323|  18.1k|                p->impl.d.kind = node_t::kind_t::inner;
  324|  18.1k|#endif
  325|  18.1k|                return p;
  326|  18.1k|            });
  327|  18.1k|    }
_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.1k|            [&](auto) {
  317|  18.1k|                auto p =
  318|  18.1k|                    new (heap::allocate(node_t::max_sizeof_inner_r)) node_t;
  319|  18.1k|                node_t::refs(r).inc();
  320|  18.1k|                p->impl.d.data.inner.relaxed = r;
  321|  18.1k|                node_t::ownee(p)             = e;
  322|  18.1k|#if IMMER_TAGGED_NODE
  323|  18.1k|                p->impl.d.kind = node_t::kind_t::inner;
  324|  18.1k|#endif
  325|  18.1k|                return p;
  326|  18.1k|            });
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE16do_copy_inner_srEPSB_SC_j:
  640|  18.1k|    {
  641|  18.1k|        if (embed_relaxed)
  ------------------
  |  Branch (641:13): [Folded, False: 18.1k]
  ------------------
  642|      0|            return do_copy_inner_r(dst, src, n);
  643|  18.1k|        else {
  644|  18.1k|            inc_nodes(src->inner(), n);
  645|  18.1k|            std::copy(src->inner(), src->inner() + n, dst->inner());
  646|  18.1k|            return dst;
  647|  18.1k|        }
  648|  18.1k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jSG_j:
  738|  2.43k|    {
  739|  2.43k|        IMMER_ASSERT_TAGGED(src1->kind() == kind_t::leaf);
  ------------------
  |  |   68|  2.43k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (739:9): [True: 2.43k, False: 0]
  ------------------
  740|  2.43k|        IMMER_ASSERT_TAGGED(src2->kind() == kind_t::leaf);
  ------------------
  |  |   68|  2.43k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (740:9): [True: 2.43k, False: 0]
  ------------------
  741|  2.43k|        auto dst = make_leaf_e(e);
  742|  2.43k|        IMMER_TRY {
  ------------------
  |  |   49|  2.43k|#define IMMER_TRY try
  ------------------
  743|  2.43k|            detail::uninitialized_copy(
  744|  2.43k|                src1->leaf(), src1->leaf() + n1, dst->leaf());
  745|  2.43k|        }
  746|  2.43k|        IMMER_CATCH (...) {
  747|      0|            heap::deallocate(max_sizeof_leaf, dst);
  748|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  749|      0|        }
  750|  2.43k|        IMMER_TRY {
  ------------------
  |  |   49|  2.43k|#define IMMER_TRY try
  ------------------
  751|  2.43k|            detail::uninitialized_copy(
  752|  2.43k|                src2->leaf(), src2->leaf() + n2, dst->leaf() + n1);
  753|  2.43k|        }
  754|  2.43k|        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.43k|        return dst;
  760|  2.43k|    }
_ZN5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11copy_leaf_eENS9_5applyIS6_E4type4editEPSB_jj:
  763|  1.26M|    {
  764|  1.26M|        IMMER_ASSERT_TAGGED(src->kind() == kind_t::leaf);
  ------------------
  |  |   68|  1.26M|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (764:9): [True: 1.26M, False: 0]
  ------------------
  765|  1.26M|        auto dst = make_leaf_e(e);
  766|  1.26M|        IMMER_TRY {
  ------------------
  |  |   49|  1.26M|#define IMMER_TRY try
  ------------------
  767|  1.26M|            detail::uninitialized_copy(
  768|  1.26M|                src->leaf() + idx, src->leaf() + last, dst->leaf());
  769|  1.26M|        }
  770|  1.26M|        IMMER_CATCH (...) {
  771|      0|            heap::deallocate(max_sizeof_leaf, dst);
  772|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  773|      0|        }
  774|  1.26M|        return dst;
  775|  1.26M|    }
_ZNK5immer6detail4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9can_relaxEv:
  874|  1.57M|    bool can_relax() const { return !embed_relaxed || relaxed(); }
  ------------------
  |  Branch (874:37): [True: 1.57M, 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|   613k|    {
  904|   613k|        auto src_r = relaxed();
  905|   613k|        return static_if<embed_relaxed, relaxed_t*>(
  906|   613k|            [&](auto) { return src_r; },
  907|   613k|            [&](auto) {
  908|   613k|                if (src_r && (node_t::refs(src_r).unique() ||
  909|   613k|                              node_t::ownee(src_r).can_mutate(e))) {
  910|   613k|                    node_t::ownee(src_r) = ec;
  911|   613k|                    return src_r;
  912|   613k|                } else {
  913|   613k|                    auto dst_r = impl.d.data.inner.relaxed =
  914|   613k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  915|   613k|                    if (src_r) {
  916|   613k|                        auto n = dst_r->d.count = src_r->d.count;
  917|   613k|                        std::copy(
  918|   613k|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  919|   613k|                        if (node_t::refs(src_r).dec())
  920|   613k|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  921|   613k|                                             src_r);
  922|   613k|                    }
  923|   613k|                    node_t::ownee(dst_r) = ec;
  924|   613k|                    return dst_r;
  925|   613k|                }
  926|   613k|            });
  927|   613k|    }
_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|   613k|            [&](auto) {
  908|   613k|                if (src_r && (node_t::refs(src_r).unique() ||
  ------------------
  |  Branch (908:21): [True: 604k, False: 8.30k]
  |  Branch (908:31): [True: 0, False: 604k]
  ------------------
  909|   604k|                              node_t::ownee(src_r).can_mutate(e))) {
  ------------------
  |  Branch (909:31): [True: 603k, False: 890]
  ------------------
  910|   603k|                    node_t::ownee(src_r) = ec;
  911|   603k|                    return src_r;
  912|   603k|                } else {
  913|  9.19k|                    auto dst_r = impl.d.data.inner.relaxed =
  914|  9.19k|                        new (heap::allocate(max_sizeof_relaxed)) relaxed_t;
  915|  9.19k|                    if (src_r) {
  ------------------
  |  Branch (915:25): [True: 890, False: 8.30k]
  ------------------
  916|    890|                        auto n = dst_r->d.count = src_r->d.count;
  917|    890|                        std::copy(
  918|    890|                            src_r->d.sizes, src_r->d.sizes + n, dst_r->d.sizes);
  919|    890|                        if (node_t::refs(src_r).dec())
  ------------------
  |  Branch (919:29): [True: 0, False: 890]
  ------------------
  920|      0|                            heap::deallocate(node_t::sizeof_inner_r_n(n),
  921|      0|                                             src_r);
  922|    890|                    }
  923|  9.19k|                    node_t::ownee(dst_r) = ec;
  924|  9.19k|                    return dst_r;
  925|  9.19k|                }
  926|   613k|            });

_ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  523|   613k|    {
  524|   613k|        using node_t = node_type<Pos>;
  525|   613k|        auto node    = p.node();
  526|   613k|        if (node->dec()) {
  ------------------
  |  Branch (526:13): [True: 0, False: 613k]
  ------------------
  527|      0|            p.each(this_t{});
  528|      0|            node_t::delete_inner_r(node, p.count());
  529|      0|        }
  530|   613k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  63.1k|    {
  535|  63.1k|        using node_t = node_type<Pos>;
  536|  63.1k|        auto node    = p.node();
  537|  63.1k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 63.1k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  63.1k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|  6.73k|    {
  546|  6.73k|        using node_t = node_type<Pos>;
  547|  6.73k|        auto node    = p.node();
  548|  6.73k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 6.73k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|  6.73k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|  2.31k|    {
  546|  2.31k|        using node_t = node_type<Pos>;
  547|  2.31k|        auto node    = p.node();
  548|  2.31k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 2.31k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|  2.31k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  10.8k|    {
  535|  10.8k|        using node_t = node_type<Pos>;
  536|  10.8k|        auto node    = p.node();
  537|  10.8k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 10.8k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  10.8k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  4.41k|    {
  535|  4.41k|        using node_t = node_type<Pos>;
  536|  4.41k|        auto node    = p.node();
  537|  4.41k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 4.41k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  4.41k|    }
_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|   488k|    {
  546|   488k|        using node_t = node_type<Pos>;
  547|   488k|        auto node    = p.node();
  548|   488k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 488k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|   488k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|   368k|    {
  546|   368k|        using node_t = node_type<Pos>;
  547|   368k|        auto node    = p.node();
  548|   368k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 368k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|   368k|    }
_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|  43.0k|    {
  792|  43.0k|        auto level    = pos.shift();
  793|  43.0k|        auto idx      = pos.count() - 1;
  794|  43.0k|        auto children = pos.size(idx);
  795|  43.0k|        auto new_idx =
  796|  43.0k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (796:13): [True: 4.19k, False: 38.8k]
  |  Branch (796:47): [True: 447, False: 38.4k]
  ------------------
  797|  43.0k|        auto new_child = static_cast<node_t*>(nullptr);
  798|  43.0k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (798:13): [True: 998, False: 42.0k]
  ------------------
  799|    998|            return nullptr;
  800|  42.0k|        else if (idx == new_idx) {
  ------------------
  |  Branch (800:18): [True: 38.4k, False: 3.64k]
  ------------------
  801|  38.4k|            new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts);
  802|  38.4k|            if (!new_child) {
  ------------------
  |  Branch (802:17): [True: 1.10k, False: 37.3k]
  ------------------
  803|  1.10k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (803:21): [True: 395, False: 706]
  ------------------
  804|    395|                    new_child = node_t::make_path(level - B, tail);
  805|    706|                else
  806|    706|                    return nullptr;
  807|  1.10k|            }
  808|  38.4k|        } else
  809|  3.64k|            new_child = node_t::make_path(level - B, tail);
  810|  41.3k|        IMMER_TRY {
  ------------------
  |  |   49|  41.3k|#define IMMER_TRY try
  ------------------
  811|  41.3k|            auto count = new_idx + 1;
  812|  41.3k|            auto new_parent =
  813|  41.3k|                node_t::copy_inner_r_n(count, pos.node(), new_idx);
  814|  41.3k|            auto new_relaxed              = new_parent->relaxed();
  815|  41.3k|            new_parent->inner()[new_idx]  = new_child;
  816|  41.3k|            new_relaxed->d.sizes[new_idx] = pos.size() + ts;
  817|  41.3k|            new_relaxed->d.count          = count;
  818|  41.3k|            assert(new_relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (818:13): [True: 41.3k, False: 0]
  ------------------
  819|  41.3k|            return new_parent;
  820|  41.3k|        }
  821|  41.3k|        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|  41.3k|    }
_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|  7.69k|    {
  835|  7.69k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 7.69k, False: 0]
  ------------------
  836|  7.69k|        auto idx        = pos.index(pos.size() - 1);
  837|  7.69k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  7.69k|        auto count      = new_idx + 1;
  839|  7.69k|        auto new_parent = node_t::make_inner_n(count);
  840|  7.69k|        IMMER_TRY {
  ------------------
  |  |   49|  7.69k|#define IMMER_TRY try
  ------------------
  841|  7.69k|            new_parent->inner()[new_idx] =
  842|  7.69k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 6.39k, False: 1.30k]
  ------------------
  843|       |                               /* otherwise */
  844|  7.69k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  7.69k|        }
  846|  7.69k|        IMMER_CATCH (...) {
  847|      0|            node_t::delete_inner(new_parent, count);
  848|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  849|      0|        }
  850|  7.69k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  7.69k|    }
_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|  31.1k|    {
  835|  31.1k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 31.1k, False: 0]
  ------------------
  836|  31.1k|        auto idx        = pos.index(pos.size() - 1);
  837|  31.1k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  31.1k|        auto count      = new_idx + 1;
  839|  31.1k|        auto new_parent = node_t::make_inner_n(count);
  840|  31.1k|        IMMER_TRY {
  ------------------
  |  |   49|  31.1k|#define IMMER_TRY try
  ------------------
  841|  31.1k|            new_parent->inner()[new_idx] =
  842|  31.1k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 22.5k, False: 8.55k]
  ------------------
  843|       |                               /* otherwise */
  844|  31.1k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  31.1k|        }
  846|  31.1k|        IMMER_CATCH (...) {
  847|      0|            node_t::delete_inner(new_parent, count);
  848|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  849|      0|        }
  850|  31.1k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  31.1k|    }
_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.14k|    {
  835|  4.14k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 4.14k, False: 0]
  ------------------
  836|  4.14k|        auto idx        = pos.index(pos.size() - 1);
  837|  4.14k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  4.14k|        auto count      = new_idx + 1;
  839|  4.14k|        auto new_parent = node_t::make_inner_n(count);
  840|  4.14k|        IMMER_TRY {
  ------------------
  |  |   49|  4.14k|#define IMMER_TRY try
  ------------------
  841|  4.14k|            new_parent->inner()[new_idx] =
  842|  4.14k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 2.16k, False: 1.97k]
  ------------------
  843|       |                               /* otherwise */
  844|  4.14k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  4.14k|        }
  846|  4.14k|        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.14k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  4.14k|    }
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|  3.60k|    {
  503|  3.60k|        auto offset = pos.index(idx);
  504|  3.60k|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|  3.60k|        IMMER_TRY {
  ------------------
  |  |   49|  3.60k|#define IMMER_TRY try
  ------------------
  506|  3.60k|            node->leaf()[offset] =
  507|  3.60k|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|  3.60k|            return node;
  509|  3.60k|        }
  510|  3.60k|        IMMER_CATCH (...) {
  511|      0|            node_t::delete_leaf(node, pos.count());
  512|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  513|      0|        }
  514|  3.60k|    }
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|  26.7k|    {
  467|  26.7k|        auto offset = pos.index(idx);
  468|  26.7k|        auto count  = pos.count();
  469|  26.7k|        auto node   = node_t::make_inner_sr_n(count, pos.relaxed());
  470|  26.7k|        IMMER_TRY {
  ------------------
  |  |   49|  26.7k|#define IMMER_TRY try
  ------------------
  471|  26.7k|            auto child = pos.towards_oh(this_t{}, idx, offset, fn);
  472|  26.7k|            node_t::do_copy_inner_replace_sr(
  473|  26.7k|                node, pos.node(), count, offset, child);
  474|  26.7k|            return node;
  475|  26.7k|        }
  476|  26.7k|        IMMER_CATCH (...) {
  477|      0|            node_t::delete_inner_r(node, count);
  478|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  479|      0|        }
  480|  26.7k|    }
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.94k|    {
  485|  1.94k|        auto offset = pos.index(idx);
  486|  1.94k|        auto count  = pos.count();
  487|  1.94k|        auto node   = node_t::make_inner_n(count);
  488|  1.94k|        IMMER_TRY {
  ------------------
  |  |   49|  1.94k|#define IMMER_TRY try
  ------------------
  489|  1.94k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.94k|            node_t::do_copy_inner_replace(
  491|  1.94k|                node, pos.node(), count, offset, child);
  492|  1.94k|            return node;
  493|  1.94k|        }
  494|  1.94k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.94k|    }
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.36k|    {
  503|  1.36k|        auto offset = pos.index(idx);
  504|  1.36k|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|  1.36k|        IMMER_TRY {
  ------------------
  |  |   49|  1.36k|#define IMMER_TRY try
  ------------------
  506|  1.36k|            node->leaf()[offset] =
  507|  1.36k|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|  1.36k|            return node;
  509|  1.36k|        }
  510|  1.36k|        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.36k|    }
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.32k|    {
  485|  1.32k|        auto offset = pos.index(idx);
  486|  1.32k|        auto count  = pos.count();
  487|  1.32k|        auto node   = node_t::make_inner_n(count);
  488|  1.32k|        IMMER_TRY {
  ------------------
  |  |   49|  1.32k|#define IMMER_TRY try
  ------------------
  489|  1.32k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.32k|            node_t::do_copy_inner_replace(
  491|  1.32k|                node, pos.node(), count, offset, child);
  492|  1.32k|            return node;
  493|  1.32k|        }
  494|  1.32k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.32k|    }
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|    588|    {
  503|    588|        auto offset = pos.index(idx);
  504|    588|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|    588|        IMMER_TRY {
  ------------------
  |  |   49|    588|#define IMMER_TRY try
  ------------------
  506|    588|            node->leaf()[offset] =
  507|    588|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|    588|            return node;
  509|    588|        }
  510|    588|        IMMER_CATCH (...) {
  511|      0|            node_t::delete_leaf(node, pos.count());
  512|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  513|      0|        }
  514|    588|    }
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.16k|    {
  485|  1.16k|        auto offset = pos.index(idx);
  486|  1.16k|        auto count  = pos.count();
  487|  1.16k|        auto node   = node_t::make_inner_n(count);
  488|  1.16k|        IMMER_TRY {
  ------------------
  |  |   49|  1.16k|#define IMMER_TRY try
  ------------------
  489|  1.16k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.16k|            node_t::do_copy_inner_replace(
  491|  1.16k|                node, pos.node(), count, offset, child);
  492|  1.16k|            return node;
  493|  1.16k|        }
  494|  1.16k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.16k|    }
_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.5k|    {
 1097|  15.5k|        auto idx = pos.index(last);
 1098|  15.5k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1098:13): [True: 15.5k, Folded]
  |  Branch (1098:25): [True: 11.3k, False: 4.20k]
  ------------------
 1099|  11.3k|            return pos.towards_oh(this_t{}, last, idx);
 1100|  11.3k|        } else {
 1101|  4.20k|            using std::get;
 1102|  4.20k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1103|  4.20k|            auto next = get<1>(subs);
 1104|  4.20k|            auto ts   = get<2>(subs);
 1105|  4.20k|            auto tail = get<3>(subs);
 1106|  4.20k|            IMMER_TRY {
  ------------------
  |  |   49|  4.20k|#define IMMER_TRY try
  ------------------
 1107|  4.20k|                if (next) {
  ------------------
  |  Branch (1107:21): [True: 1.70k, False: 2.49k]
  ------------------
 1108|  1.70k|                    auto count = idx + 1;
 1109|  1.70k|                    auto newn  = node_t::copy_inner_r_n(count, pos.node(), idx);
 1110|  1.70k|                    auto newr  = newn->relaxed();
 1111|  1.70k|                    newn->inner()[idx] = next;
 1112|  1.70k|                    newr->d.sizes[idx] = last + 1 - ts;
 1113|  1.70k|                    newr->d.count      = count;
 1114|  1.70k|                    assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (1114:21): [True: 1.70k, False: 0]
  ------------------
 1115|  1.70k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1116|  2.49k|                } else if (idx == 0) {
  ------------------
  |  Branch (1116:28): [True: 0, False: 2.49k]
  ------------------
 1117|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1118|  2.49k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1118:28): [True: 2.49k, Folded]
  |  Branch (1118:40): [True: 2.17k, False: 316]
  |  Branch (1118:52): [True: 1.21k, False: 962]
  ------------------
 1119|  1.21k|                    auto newn = pos.node()->inner()[0];
 1120|  1.21k|                    return std::make_tuple(
 1121|  1.21k|                        pos.shift() - B, newn->inc(), ts, tail);
 1122|  1.27k|                } else {
 1123|  1.27k|                    auto newn = node_t::copy_inner_r(pos.node(), idx);
 1124|  1.27k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1125|  1.27k|                }
 1126|  4.20k|            }
 1127|  4.20k|            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.20k|        }
 1138|  15.5k|    }
_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|    771|    {
 1182|    771|        auto old_tail_size = pos.count();
 1183|    771|        auto new_tail_size = pos.index(last) + 1;
 1184|    771|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 230, False: 541]
  ------------------
 1185|    771|                                 ? pos.node()->inc()
 1186|    771|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|    771|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|    771|    }
_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|  2.88k|    {
 1182|  2.88k|        auto old_tail_size = pos.count();
 1183|  2.88k|        auto new_tail_size = pos.index(last) + 1;
 1184|  2.88k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 869, False: 2.02k]
  ------------------
 1185|  2.88k|                                 ? pos.node()->inc()
 1186|  2.88k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  2.88k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  2.88k|    }
_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.43k|    {
 1097|  4.43k|        auto idx = pos.index(last);
 1098|  4.43k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1098:13): [Folded, False: 4.43k]
  |  Branch (1098:25): [True: 0, False: 0]
  ------------------
 1099|      0|            return pos.towards_oh(this_t{}, last, idx);
 1100|  4.43k|        } else {
 1101|  4.43k|            using std::get;
 1102|  4.43k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1103|  4.43k|            auto next = get<1>(subs);
 1104|  4.43k|            auto ts   = get<2>(subs);
 1105|  4.43k|            auto tail = get<3>(subs);
 1106|  4.43k|            IMMER_TRY {
  ------------------
  |  |   49|  4.43k|#define IMMER_TRY try
  ------------------
 1107|  4.43k|                if (next) {
  ------------------
  |  Branch (1107:21): [True: 2.15k, False: 2.28k]
  ------------------
 1108|  2.15k|                    auto count = idx + 1;
 1109|  2.15k|                    auto newn  = node_t::copy_inner_r_n(count, pos.node(), idx);
 1110|  2.15k|                    auto newr  = newn->relaxed();
 1111|  2.15k|                    newn->inner()[idx] = next;
 1112|  2.15k|                    newr->d.sizes[idx] = last + 1 - ts;
 1113|  2.15k|                    newr->d.count      = count;
 1114|  2.15k|                    assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (1114:21): [True: 2.15k, False: 0]
  ------------------
 1115|  2.15k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1116|  2.28k|                } else if (idx == 0) {
  ------------------
  |  Branch (1116:28): [True: 1.28k, False: 1.00k]
  ------------------
 1117|  1.28k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1118|  1.28k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1118:28): [Folded, False: 1.00k]
  |  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.00k|                } else {
 1123|  1.00k|                    auto newn = node_t::copy_inner_r(pos.node(), idx);
 1124|  1.00k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1125|  1.00k|                }
 1126|  4.43k|            }
 1127|  4.43k|            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.43k|        }
 1138|  4.43k|    }
_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.31k|    {
 1143|  1.31k|        auto idx = pos.index(last);
 1144|  1.31k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 1.31k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.31k|        } else {
 1147|  1.31k|            using std::get;
 1148|  1.31k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.31k|            auto next = get<1>(subs);
 1150|  1.31k|            auto ts   = get<2>(subs);
 1151|  1.31k|            auto tail = get<3>(subs);
 1152|  1.31k|            IMMER_TRY {
  ------------------
  |  |   49|  1.31k|#define IMMER_TRY try
  ------------------
 1153|  1.31k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 459, False: 854]
  ------------------
 1154|    459|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    459|                    newn->inner()[idx] = next;
 1156|    459|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|    854|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 608, False: 246]
  ------------------
 1158|    608|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    608|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 246]
  |  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|    246|                } else {
 1164|    246|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    246|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    246|                }
 1167|  1.31k|            }
 1168|  1.31k|            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.31k|        }
 1177|  1.31k|    }
_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.93k|    {
 1182|  2.93k|        auto old_tail_size = pos.count();
 1183|  2.93k|        auto new_tail_size = pos.index(last) + 1;
 1184|  2.93k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 1.24k, False: 1.68k]
  ------------------
 1185|  2.93k|                                 ? pos.node()->inc()
 1186|  2.93k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  2.93k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  2.93k|    }
_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|  2.11k|    {
 1143|  2.11k|        auto idx = pos.index(last);
 1144|  2.11k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 2.11k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  2.11k|        } else {
 1147|  2.11k|            using std::get;
 1148|  2.11k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  2.11k|            auto next = get<1>(subs);
 1150|  2.11k|            auto ts   = get<2>(subs);
 1151|  2.11k|            auto tail = get<3>(subs);
 1152|  2.11k|            IMMER_TRY {
  ------------------
  |  |   49|  2.11k|#define IMMER_TRY try
  ------------------
 1153|  2.11k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 388, False: 1.72k]
  ------------------
 1154|    388|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    388|                    newn->inner()[idx] = next;
 1156|    388|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  1.72k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 895, False: 831]
  ------------------
 1158|    895|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    895|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 831]
  |  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|    831|                } else {
 1164|    831|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    831|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    831|                }
 1167|  2.11k|            }
 1168|  2.11k|            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.11k|        }
 1177|  2.11k|    }
_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.80k|    {
 1182|  1.80k|        auto old_tail_size = pos.count();
 1183|  1.80k|        auto new_tail_size = pos.index(last) + 1;
 1184|  1.80k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 598, False: 1.21k]
  ------------------
 1185|  1.80k|                                 ? pos.node()->inc()
 1186|  1.80k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  1.80k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  1.80k|    }
_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.35k|    {
 1143|  2.35k|        auto idx = pos.index(last);
 1144|  2.35k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 2.35k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  2.35k|        } else {
 1147|  2.35k|            using std::get;
 1148|  2.35k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  2.35k|            auto next = get<1>(subs);
 1150|  2.35k|            auto ts   = get<2>(subs);
 1151|  2.35k|            auto tail = get<3>(subs);
 1152|  2.35k|            IMMER_TRY {
  ------------------
  |  |   49|  2.35k|#define IMMER_TRY try
  ------------------
 1153|  2.35k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 394, False: 1.95k]
  ------------------
 1154|    394|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    394|                    newn->inner()[idx] = next;
 1156|    394|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  1.95k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 1.35k, False: 604]
  ------------------
 1158|  1.35k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|  1.35k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 604]
  |  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|    604|                } else {
 1164|    604|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    604|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    604|                }
 1167|  2.35k|            }
 1168|  2.35k|            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.35k|        }
 1177|  2.35k|    }
_ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEvPT_j:
  556|  57.2k|{
  557|  57.2k|    make_leaf_sub_pos(node, n).visit(dec_visitor{});
  558|  57.2k|}
_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|  5.10k|    {
 1143|  5.10k|        auto idx = pos.index(last);
 1144|  5.10k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [True: 5.10k, Folded]
  |  Branch (1144:25): [True: 2.84k, False: 2.25k]
  ------------------
 1145|  2.84k|            return pos.towards_oh(this_t{}, last, idx);
 1146|  2.84k|        } else {
 1147|  2.25k|            using std::get;
 1148|  2.25k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  2.25k|            auto next = get<1>(subs);
 1150|  2.25k|            auto ts   = get<2>(subs);
 1151|  2.25k|            auto tail = get<3>(subs);
 1152|  2.25k|            IMMER_TRY {
  ------------------
  |  |   49|  2.25k|#define IMMER_TRY try
  ------------------
 1153|  2.25k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 753, False: 1.50k]
  ------------------
 1154|    753|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    753|                    newn->inner()[idx] = next;
 1156|    753|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  1.50k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 0, False: 1.50k]
  ------------------
 1158|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|  1.50k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [True: 1.50k, Folded]
  |  Branch (1159:40): [True: 1.17k, False: 331]
  |  Branch (1159:52): [True: 809, False: 365]
  ------------------
 1160|    809|                    auto newn = pos.node()->inner()[0];
 1161|    809|                    return std::make_tuple(
 1162|    809|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    809|                } else {
 1164|    696|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    696|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    696|                }
 1167|  2.25k|            }
 1168|  2.25k|            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.25k|        }
 1177|  5.10k|    }
_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.20k|    {
 1182|  1.20k|        auto old_tail_size = pos.count();
 1183|  1.20k|        auto new_tail_size = pos.index(last) + 1;
 1184|  1.20k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 472, False: 733]
  ------------------
 1185|  1.20k|                                 ? pos.node()->inc()
 1186|  1.20k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  1.20k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  1.20k|    }
_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|  2.08k|    {
 1143|  2.08k|        auto idx = pos.index(last);
 1144|  2.08k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [True: 2.08k, Folded]
  |  Branch (1144:25): [True: 921, False: 1.16k]
  ------------------
 1145|    921|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.16k|        } else {
 1147|  1.16k|            using std::get;
 1148|  1.16k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.16k|            auto next = get<1>(subs);
 1150|  1.16k|            auto ts   = get<2>(subs);
 1151|  1.16k|            auto tail = get<3>(subs);
 1152|  1.16k|            IMMER_TRY {
  ------------------
  |  |   49|  1.16k|#define IMMER_TRY try
  ------------------
 1153|  1.16k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 223, False: 944]
  ------------------
 1154|    223|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    223|                    newn->inner()[idx] = next;
 1156|    223|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|    944|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 0, False: 944]
  ------------------
 1158|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    944|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [True: 944, Folded]
  |  Branch (1159:40): [True: 747, False: 197]
  |  Branch (1159:52): [True: 424, False: 323]
  ------------------
 1160|    424|                    auto newn = pos.node()->inner()[0];
 1161|    424|                    return std::make_tuple(
 1162|    424|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    520|                } else {
 1164|    520|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    520|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    520|                }
 1167|  1.16k|            }
 1168|  1.16k|            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.16k|        }
 1177|  2.08k|    }
_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|    472|    {
 1182|    472|        auto old_tail_size = pos.count();
 1183|    472|        auto new_tail_size = pos.index(last) + 1;
 1184|    472|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 198, False: 274]
  ------------------
 1185|    472|                                 ? pos.node()->inc()
 1186|    472|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|    472|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|    472|    }
_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|  14.3k|    {
 1415|  14.3k|        auto idx                = pos.subindex(first);
 1416|  14.3k|        auto count              = pos.count();
 1417|  14.3k|        auto left_size          = pos.size_before(idx);
 1418|  14.3k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  14.3k|        auto dropped_size       = first;
 1420|  14.3k|        auto child_dropped_size = dropped_size - left_size;
 1421|  14.3k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 14.3k, Folded]
  |  Branch (1421:25): [True: 13.2k, False: 1.05k]
  |  Branch (1421:45): [True: 1.26k, False: 11.9k]
  ------------------
 1422|  1.26k|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  13.0k|        } else {
 1424|  13.0k|            using std::get;
 1425|  13.0k|            auto n    = pos.node();
 1426|  13.0k|            auto newc = count - idx;
 1427|  13.0k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  13.0k|            IMMER_TRY {
  ------------------
  |  |   49|  13.0k|#define IMMER_TRY try
  ------------------
 1429|  13.0k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  13.0k|                auto newr     = newn->relaxed();
 1431|  13.0k|                newr->d.count = count - idx;
 1432|  13.0k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  13.0k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 13.0k, False: 0]
  ------------------
 1434|  13.0k|                pos.copy_sizes(idx + 1,
 1435|  13.0k|                               newr->d.count - 1,
 1436|  13.0k|                               newr->d.sizes[0],
 1437|  13.0k|                               newr->d.sizes + 1);
 1438|  13.0k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 13.0k, False: 0]
  ------------------
 1439|  13.0k|                       pos.size() - dropped_size);
 1440|  13.0k|                newn->inner()[0] = get<1>(subs);
 1441|  13.0k|                std::copy(n->inner() + idx + 1,
 1442|  13.0k|                          n->inner() + count,
 1443|  13.0k|                          newn->inner() + 1);
 1444|  13.0k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  13.0k|                return std::make_tuple(pos.shift(), newn);
 1446|  13.0k|            }
 1447|  13.0k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  13.0k|        }
 1452|  14.3k|    }
_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|  11.4k|    {
 1457|  11.4k|        auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count());
 1458|  11.4k|        return std::make_tuple(0, n);
 1459|  11.4k|    }
_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|  90.1k|    {
 1415|  90.1k|        auto idx                = pos.subindex(first);
 1416|  90.1k|        auto count              = pos.count();
 1417|  90.1k|        auto left_size          = pos.size_before(idx);
 1418|  90.1k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  90.1k|        auto dropped_size       = first;
 1420|  90.1k|        auto child_dropped_size = dropped_size - left_size;
 1421|  90.1k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 90.1k]
  |  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|  90.1k|        } else {
 1424|  90.1k|            using std::get;
 1425|  90.1k|            auto n    = pos.node();
 1426|  90.1k|            auto newc = count - idx;
 1427|  90.1k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  90.1k|            IMMER_TRY {
  ------------------
  |  |   49|  90.1k|#define IMMER_TRY try
  ------------------
 1429|  90.1k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  90.1k|                auto newr     = newn->relaxed();
 1431|  90.1k|                newr->d.count = count - idx;
 1432|  90.1k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  90.1k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 90.1k, False: 0]
  ------------------
 1434|  90.1k|                pos.copy_sizes(idx + 1,
 1435|  90.1k|                               newr->d.count - 1,
 1436|  90.1k|                               newr->d.sizes[0],
 1437|  90.1k|                               newr->d.sizes + 1);
 1438|  90.1k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 90.1k, False: 0]
  ------------------
 1439|  90.1k|                       pos.size() - dropped_size);
 1440|  90.1k|                newn->inner()[0] = get<1>(subs);
 1441|  90.1k|                std::copy(n->inner() + idx + 1,
 1442|  90.1k|                          n->inner() + count,
 1443|  90.1k|                          newn->inner() + 1);
 1444|  90.1k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  90.1k|                return std::make_tuple(pos.shift(), newn);
 1446|  90.1k|            }
 1447|  90.1k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  90.1k|        }
 1452|  90.1k|    }
_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.58k|    {
 1415|  1.58k|        auto idx                = pos.subindex(first);
 1416|  1.58k|        auto count              = pos.count();
 1417|  1.58k|        auto left_size          = pos.size_before(idx);
 1418|  1.58k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  1.58k|        auto dropped_size       = first;
 1420|  1.58k|        auto child_dropped_size = dropped_size - left_size;
 1421|  1.58k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 1.58k]
  |  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.58k|        } else {
 1424|  1.58k|            using std::get;
 1425|  1.58k|            auto n    = pos.node();
 1426|  1.58k|            auto newc = count - idx;
 1427|  1.58k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  1.58k|            IMMER_TRY {
  ------------------
  |  |   49|  1.58k|#define IMMER_TRY try
  ------------------
 1429|  1.58k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  1.58k|                auto newr     = newn->relaxed();
 1431|  1.58k|                newr->d.count = count - idx;
 1432|  1.58k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  1.58k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 1.58k, False: 0]
  ------------------
 1434|  1.58k|                pos.copy_sizes(idx + 1,
 1435|  1.58k|                               newr->d.count - 1,
 1436|  1.58k|                               newr->d.sizes[0],
 1437|  1.58k|                               newr->d.sizes + 1);
 1438|  1.58k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 1.58k, False: 0]
  ------------------
 1439|  1.58k|                       pos.size() - dropped_size);
 1440|  1.58k|                newn->inner()[0] = get<1>(subs);
 1441|  1.58k|                std::copy(n->inner() + idx + 1,
 1442|  1.58k|                          n->inner() + count,
 1443|  1.58k|                          newn->inner() + 1);
 1444|  1.58k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  1.58k|                return std::make_tuple(pos.shift(), newn);
 1446|  1.58k|            }
 1447|  1.58k|            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.58k|        }
 1452|  1.58k|    }
_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.04k|    {
 1457|  4.04k|        auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count());
 1458|  4.04k|        return std::make_tuple(0, n);
 1459|  4.04k|    }
_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.78k|    {
 1415|  2.78k|        auto idx                = pos.subindex(first);
 1416|  2.78k|        auto count              = pos.count();
 1417|  2.78k|        auto left_size          = pos.size_before(idx);
 1418|  2.78k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  2.78k|        auto dropped_size       = first;
 1420|  2.78k|        auto child_dropped_size = dropped_size - left_size;
 1421|  2.78k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 2.78k]
  |  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.78k|        } else {
 1424|  2.78k|            using std::get;
 1425|  2.78k|            auto n    = pos.node();
 1426|  2.78k|            auto newc = count - idx;
 1427|  2.78k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  2.78k|            IMMER_TRY {
  ------------------
  |  |   49|  2.78k|#define IMMER_TRY try
  ------------------
 1429|  2.78k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  2.78k|                auto newr     = newn->relaxed();
 1431|  2.78k|                newr->d.count = count - idx;
 1432|  2.78k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  2.78k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 2.78k, False: 0]
  ------------------
 1434|  2.78k|                pos.copy_sizes(idx + 1,
 1435|  2.78k|                               newr->d.count - 1,
 1436|  2.78k|                               newr->d.sizes[0],
 1437|  2.78k|                               newr->d.sizes + 1);
 1438|  2.78k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 2.78k, False: 0]
  ------------------
 1439|  2.78k|                       pos.size() - dropped_size);
 1440|  2.78k|                newn->inner()[0] = get<1>(subs);
 1441|  2.78k|                std::copy(n->inner() + idx + 1,
 1442|  2.78k|                          n->inner() + count,
 1443|  2.78k|                          newn->inner() + 1);
 1444|  2.78k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  2.78k|                return std::make_tuple(pos.shift(), newn);
 1446|  2.78k|            }
 1447|  2.78k|            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.78k|        }
 1452|  2.78k|    }
_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.81k|    {
 1415|  2.81k|        auto idx                = pos.subindex(first);
 1416|  2.81k|        auto count              = pos.count();
 1417|  2.81k|        auto left_size          = pos.size_before(idx);
 1418|  2.81k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  2.81k|        auto dropped_size       = first;
 1420|  2.81k|        auto child_dropped_size = dropped_size - left_size;
 1421|  2.81k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 2.81k, Folded]
  |  Branch (1421:25): [True: 1.87k, False: 939]
  |  Branch (1421:45): [True: 1.17k, False: 700]
  ------------------
 1422|  1.17k|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  1.63k|        } else {
 1424|  1.63k|            using std::get;
 1425|  1.63k|            auto n    = pos.node();
 1426|  1.63k|            auto newc = count - idx;
 1427|  1.63k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  1.63k|            IMMER_TRY {
  ------------------
  |  |   49|  1.63k|#define IMMER_TRY try
  ------------------
 1429|  1.63k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  1.63k|                auto newr     = newn->relaxed();
 1431|  1.63k|                newr->d.count = count - idx;
 1432|  1.63k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  1.63k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 1.63k, False: 0]
  ------------------
 1434|  1.63k|                pos.copy_sizes(idx + 1,
 1435|  1.63k|                               newr->d.count - 1,
 1436|  1.63k|                               newr->d.sizes[0],
 1437|  1.63k|                               newr->d.sizes + 1);
 1438|  1.63k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 1.63k, False: 0]
  ------------------
 1439|  1.63k|                       pos.size() - dropped_size);
 1440|  1.63k|                newn->inner()[0] = get<1>(subs);
 1441|  1.63k|                std::copy(n->inner() + idx + 1,
 1442|  1.63k|                          n->inner() + count,
 1443|  1.63k|                          newn->inner() + 1);
 1444|  1.63k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  1.63k|                return std::make_tuple(pos.shift(), newn);
 1446|  1.63k|            }
 1447|  1.63k|            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.63k|        }
 1452|  2.81k|    }
_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.10k|    {
 1415|  1.10k|        auto idx                = pos.subindex(first);
 1416|  1.10k|        auto count              = pos.count();
 1417|  1.10k|        auto left_size          = pos.size_before(idx);
 1418|  1.10k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  1.10k|        auto dropped_size       = first;
 1420|  1.10k|        auto child_dropped_size = dropped_size - left_size;
 1421|  1.10k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 1.10k, Folded]
  |  Branch (1421:25): [True: 491, False: 609]
  |  Branch (1421:45): [True: 278, False: 213]
  ------------------
 1422|    278|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|    822|        } else {
 1424|    822|            using std::get;
 1425|    822|            auto n    = pos.node();
 1426|    822|            auto newc = count - idx;
 1427|    822|            auto newn = node_t::make_inner_r_n(newc);
 1428|    822|            IMMER_TRY {
  ------------------
  |  |   49|    822|#define IMMER_TRY try
  ------------------
 1429|    822|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|    822|                auto newr     = newn->relaxed();
 1431|    822|                newr->d.count = count - idx;
 1432|    822|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|    822|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 822, False: 0]
  ------------------
 1434|    822|                pos.copy_sizes(idx + 1,
 1435|    822|                               newr->d.count - 1,
 1436|    822|                               newr->d.sizes[0],
 1437|    822|                               newr->d.sizes + 1);
 1438|    822|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 822, False: 0]
  ------------------
 1439|    822|                       pos.size() - dropped_size);
 1440|    822|                newn->inner()[0] = get<1>(subs);
 1441|    822|                std::copy(n->inner() + idx + 1,
 1442|    822|                          n->inner() + count,
 1443|    822|                          newn->inner() + 1);
 1444|    822|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|    822|                return std::make_tuple(pos.shift(), newn);
 1446|    822|            }
 1447|    822|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|    822|        }
 1452|  1.10k|    }
_ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm:
 2001|  3.24k|{
 2002|  3.24k|    return make_singleton_regular_sub_pos(ltail, ltcount)
 2003|  3.24k|        .visit(concat_trees_left_visitor<Node>{},
 2004|  3.24k|               empty_leaf_pos<Node>{},
 2005|  3.24k|               rroot,
 2006|  3.24k|               rshift,
 2007|  3.24k|               rsize)
 2008|  3.24k|        .realize();
 2009|  3.24k|}
_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.24k|    {
 1972|  3.24k|        return visit_maybe_relaxed_sub(
 1973|  3.24k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  3.24k|    }
_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.91k|    {
 1959|  1.91k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  1.91k|    }
_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.67k|{
 1873|  7.67k|    auto lshift = lpos.shift();
 1874|  7.67k|    auto rshift = rpos.shift();
 1875|  7.67k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 7.67k]
  ------------------
 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.67k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 5.97k, False: 1.70k]
  ------------------
 1879|  5.97k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  5.97k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  5.97k|    } else {
 1882|  1.70k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.70k, False: 0]
  ------------------
 1883|  1.70k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.70k]
  |  Branch (1883:9): [True: 1.70k, False: 0]
  |  Branch (1883:9): [True: 1.70k, False: 0]
  ------------------
 1884|  1.70k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.70k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.70k|    }
 1887|  7.67k|}
_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.22M|    {
 1513|  1.22M|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 172k, False: 1.05M]
  ------------------
 1514|   172k|            auto s = size_t{};
 1515|   680k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 508k, False: 172k]
  ------------------
 1516|   508k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   508k|                s = sizes_[i];
 1518|   508k|            }
 1519|  1.05M|        } else {
 1520|  2.67M|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 1.61M, False: 1.05M]
  ------------------
 1521|  1.61M|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|  1.61M|                    .visit(v, args...);
 1523|  1.05M|        }
 1524|  1.22M|    }
_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|   970k|    {
 1734|   970k|        auto count = p.count();
 1735|   970k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 970k, False: 0]
  ------------------
 1736|   970k|        plan.counts[plan.n++] = count;
 1737|   970k|        plan.total += count;
 1738|   970k|    }
_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.24M|    {
 1734|  4.24M|        auto count = p.count();
 1735|  4.24M|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 4.24M, False: 0]
  ------------------
 1736|  4.24M|        plan.counts[plan.n++] = count;
 1737|  4.24M|        plan.total += count;
 1738|  4.24M|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj:
 1762|  1.22M|    {
 1763|       |        // gcc seems to not really understand this code... :(
 1764|  1.22M|#if !defined(_MSC_VER)
 1765|  1.22M|#pragma GCC diagnostic push
 1766|  1.22M|#pragma GCC diagnostic ignored "-Warray-bounds"
 1767|  1.22M|#endif
 1768|  1.22M|        constexpr count_t rrb_extras    = 2;
 1769|  1.22M|        constexpr count_t rrb_invariant = 1;
 1770|  1.22M|        const auto bits                 = shift == BL ? BL : B;
  ------------------
  |  Branch (1770:43): [True: 172k, False: 1.05M]
  ------------------
 1771|  1.22M|        const auto branches             = count_t{1} << bits;
 1772|  1.22M|        const auto optimal              = ((total - 1) >> bits) + 1;
 1773|  1.22M|        count_t i                       = 0;
 1774|  1.31M|        while (n >= optimal + rrb_extras) {
  ------------------
  |  Branch (1774:16): [True: 84.7k, False: 1.22M]
  ------------------
 1775|       |            // skip ok nodes
 1776|   185k|            while (counts[i] > branches - rrb_invariant)
  ------------------
  |  Branch (1776:20): [True: 101k, False: 84.7k]
  ------------------
 1777|   101k|                i++;
 1778|  84.7k|            assert(i < n);
  ------------------
  |  Branch (1778:13): [True: 84.7k, False: 0]
  ------------------
 1779|       |            // short node, redistribute
 1780|  84.7k|            auto remaining = counts[i];
 1781|   137k|            do {
 1782|   137k|                auto next  = counts[i + 1];
 1783|   137k|                auto count = std::min(remaining + next, branches);
 1784|   137k|                counts[i]  = count;
 1785|   137k|                assert(counts[i]);
  ------------------
  |  Branch (1785:17): [True: 137k, False: 0]
  ------------------
 1786|   137k|                remaining += next - count;
 1787|   137k|                ++i;
 1788|   137k|            } while (remaining > 0);
  ------------------
  |  Branch (1788:22): [True: 52.3k, False: 84.7k]
  ------------------
 1789|       |            // remove node
 1790|  84.7k|            std::move(counts + i + 1, counts + n, counts + i);
 1791|  84.7k|            --n;
 1792|  84.7k|            --i;
 1793|  84.7k|        }
 1794|  1.22M|#if !defined(_MSC_VER)
 1795|  1.22M|#pragma GCC diagnostic pop
 1796|  1.22M|#endif
 1797|  1.22M|    }
_ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1478|  2.45M|    auto shift() const { return shift_; }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPjj:
 1577|   242k|        : curr_{counts}
 1578|   242k|        , n_{n}
 1579|   242k|        , result_{
 1580|   242k|              shift + B, node_t::make_inner_r_n(std::min(n_, branches<B>)), 0}
 1581|   242k|    {
 1582|   242k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPSC_m:
 1481|  1.22M|        : shift_{s}
 1482|  1.22M|        , count_{1}
 1483|  1.22M|        , nodes_{n0}
 1484|  1.22M|        , sizes_{s0}
 1485|  1.22M|    {
 1486|  1.22M|    }
_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|   242k|    {
 1513|   242k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 47.7k, False: 194k]
  ------------------
 1514|  47.7k|            auto s = size_t{};
 1515|   187k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 140k, False: 47.7k]
  ------------------
 1516|   140k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   140k|                s = sizes_[i];
 1518|   140k|            }
 1519|   194k|        } else {
 1520|   580k|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 386k, False: 194k]
  ------------------
 1521|   386k|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|   386k|                    .visit(v, args...);
 1523|   194k|        }
 1524|   242k|    }
_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|   312k|    {
 1722|   312k|        merger.merge_leaf(p);
 1723|   312k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_:
 1614|   312k|    {
 1615|   312k|        auto from       = p.node();
 1616|   312k|        auto from_size  = p.size();
 1617|   312k|        auto from_count = p.count();
 1618|   312k|        assert(from_size);
  ------------------
  |  Branch (1618:9): [True: 312k, False: 0]
  ------------------
 1619|   312k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1619:13): [True: 298k, False: 14.3k]
  |  Branch (1619:21): [True: 291k, False: 6.98k]
  ------------------
 1620|   291k|            add_child(from, from_size);
 1621|   291k|            from->inc();
 1622|   291k|        } else {
 1623|  21.3k|            auto from_offset = count_t{};
 1624|  21.3k|            auto from_data   = from->leaf();
 1625|  28.5k|            do {
 1626|  28.5k|                if (!to_) {
  ------------------
  |  Branch (1626:21): [True: 14.1k, False: 14.3k]
  ------------------
 1627|  14.1k|                    to_        = node_t::make_leaf_n(*curr_);
 1628|  14.1k|                    to_offset_ = 0;
 1629|  14.1k|                }
 1630|  28.5k|                auto data = to_->leaf();
 1631|  28.5k|                auto to_copy =
 1632|  28.5k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1633|  28.5k|                detail::uninitialized_copy(from_data + from_offset,
 1634|  28.5k|                                           from_data + from_offset + to_copy,
 1635|  28.5k|                                           data + to_offset_);
 1636|  28.5k|                to_offset_ += to_copy;
 1637|  28.5k|                from_offset += to_copy;
 1638|  28.5k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1638:21): [True: 14.1k, False: 14.3k]
  ------------------
 1639|  14.1k|                    add_child(to_, to_offset_);
 1640|  14.1k|                    to_ = nullptr;
 1641|  14.1k|                }
 1642|  28.5k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1642:22): [True: 7.20k, False: 21.3k]
  ------------------
 1643|  21.3k|        }
 1644|   312k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9add_childEPSC_m:
 1589|  1.67M|    {
 1590|  1.67M|        assert(size);
  ------------------
  |  Branch (1590:9): [True: 1.67M, False: 0]
  ------------------
 1591|  1.67M|        ++curr_;
 1592|  1.67M|        auto parent  = result_.nodes_[result_.count_ - 1];
 1593|  1.67M|        auto relaxed = parent->relaxed();
 1594|  1.67M|        if (relaxed->d.count == branches<B>) {
  ------------------
  |  Branch (1594:13): [True: 212k, False: 1.45M]
  ------------------
 1595|   212k|            assert(result_.count_ < result_t::max_children);
  ------------------
  |  Branch (1595:13): [True: 212k, False: 0]
  ------------------
 1596|   212k|            n_ -= branches<B>;
 1597|   212k|            parent  = node_t::make_inner_r_n(std::min(n_, branches<B>));
 1598|   212k|            relaxed = parent->relaxed();
 1599|   212k|            result_.nodes_[result_.count_] = parent;
 1600|   212k|            result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1];
 1601|   212k|            assert(result_.sizes_[result_.count_]);
  ------------------
  |  Branch (1601:13): [True: 212k, False: 0]
  ------------------
 1602|   212k|            ++result_.count_;
 1603|   212k|        }
 1604|  1.67M|        auto idx = relaxed->d.count++;
 1605|  1.67M|        result_.sizes_[result_.count_ - 1] += size;
 1606|  1.67M|        assert(result_.sizes_[result_.count_ - 1]);
  ------------------
  |  Branch (1606:9): [True: 1.67M, False: 0]
  ------------------
 1607|  1.67M|        relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0);
  ------------------
  |  Branch (1607:41): [True: 1.21M, False: 454k]
  ------------------
 1608|  1.67M|        assert(relaxed->d.sizes[idx]);
  ------------------
  |  Branch (1608:9): [True: 1.67M, False: 0]
  ------------------
 1609|  1.67M|        parent->inner()[idx] = p;
 1610|  1.67M|    };
_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.29M|    {
 1716|  1.29M|        merger.merge_inner(p);
 1717|  1.29M|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_:
 1648|  1.29M|    {
 1649|  1.29M|        auto from       = p.node();
 1650|  1.29M|        auto from_size  = p.size();
 1651|  1.29M|        auto from_count = p.count();
 1652|  1.29M|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 1.29M, False: 0]
  ------------------
 1653|  1.29M|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 1.29M, False: 7.28k]
  |  Branch (1653:21): [True: 1.28M, False: 3.80k]
  ------------------
 1654|  1.28M|            add_child(from, from_size);
 1655|  1.28M|            from->inc();
 1656|  1.28M|        } else {
 1657|  11.0k|            auto from_offset = count_t{};
 1658|  11.0k|            auto from_data   = from->inner();
 1659|  14.3k|            do {
 1660|  14.3k|                if (!to_) {
  ------------------
  |  Branch (1660:21): [True: 7.05k, False: 7.28k]
  ------------------
 1661|  7.05k|                    to_        = node_t::make_inner_r_n(*curr_);
 1662|  7.05k|                    to_offset_ = 0;
 1663|  7.05k|                    to_size_   = 0;
 1664|  7.05k|                }
 1665|  14.3k|                auto data = to_->inner();
 1666|  14.3k|                auto to_copy =
 1667|  14.3k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1668|  14.3k|                std::copy(from_data + from_offset,
 1669|  14.3k|                          from_data + from_offset + to_copy,
 1670|  14.3k|                          data + to_offset_);
 1671|  14.3k|                node_t::inc_nodes(from_data + from_offset, to_copy);
 1672|  14.3k|                auto sizes = to_->relaxed()->d.sizes;
 1673|  14.3k|                p.copy_sizes(
 1674|  14.3k|                    from_offset, to_copy, to_size_, sizes + to_offset_);
 1675|  14.3k|                to_offset_ += to_copy;
 1676|  14.3k|                from_offset += to_copy;
 1677|  14.3k|                to_size_ = sizes[to_offset_ - 1];
 1678|  14.3k|                assert(to_size_);
  ------------------
  |  Branch (1678:17): [True: 14.3k, False: 0]
  ------------------
 1679|  14.3k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1679:21): [True: 7.05k, False: 7.28k]
  ------------------
 1680|  7.05k|                    to_->relaxed()->d.count = to_offset_;
 1681|  7.05k|                    add_child(to_, to_size_);
 1682|  7.05k|                    to_ = nullptr;
 1683|  7.05k|                }
 1684|  14.3k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1684:22): [True: 3.25k, False: 11.0k]
  ------------------
 1685|  11.0k|        }
 1686|  1.29M|    }
_ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6finishEv:
 1689|   242k|    {
 1690|   242k|        assert(!to_);
  ------------------
  |  Branch (1690:9): [True: 242k, False: 0]
  ------------------
 1691|   242k|        return result_;
 1692|   242k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_:
 1512|   242k|    {
 1513|   242k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 47.7k, False: 194k]
  ------------------
 1514|  47.7k|            auto s = size_t{};
 1515|   187k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 140k, False: 47.7k]
  ------------------
 1516|   140k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   140k|                s = sizes_[i];
 1518|   140k|            }
 1519|   194k|        } else {
 1520|   580k|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 386k, False: 194k]
  ------------------
 1521|   386k|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|   386k|                    .visit(v, args...);
 1523|   194k|        }
 1524|   242k|    }
_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.2k|        : shift_{s}
 1490|  10.2k|        , count_{2}
 1491|  10.2k|        , nodes_{n0, n1}
 1492|  10.2k|        , sizes_{s0, s0 + s1}
 1493|  10.2k|    {
 1494|  10.2k|    }
_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.75k|    {
 1918|  5.75k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  5.75k|    }
_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|    214|    {
 1918|    214|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|    214|    }
_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.54k|{
 1873|  1.54k|    auto lshift = lpos.shift();
 1874|  1.54k|    auto rshift = rpos.shift();
 1875|  1.54k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.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|  1.54k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 651, False: 895]
  ------------------
 1879|    651|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    651|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|    895|    } else {
 1882|    895|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 895, False: 0]
  ------------------
 1883|    895|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 895]
  |  Branch (1883:9): [True: 895, False: 0]
  |  Branch (1883:9): [True: 895, False: 0]
  ------------------
 1884|    895|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|    895|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|    895|    }
 1887|  1.54k|}
_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.30k|    {
 1918|  1.30k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.30k|    }
_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.30k|{
 1873|  1.30k|    auto lshift = lpos.shift();
 1874|  1.30k|    auto rshift = rpos.shift();
 1875|  1.30k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.30k]
  ------------------
 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.30k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 657, False: 651]
  ------------------
 1879|    657|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    657|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|    657|    } else {
 1882|    651|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 651, False: 0]
  ------------------
 1883|    651|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 651]
  |  Branch (1883:9): [True: 651, False: 0]
  |  Branch (1883:9): [True: 651, False: 0]
  ------------------
 1884|    651|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|    651|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|    651|    }
 1887|  1.30k|}
_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.15k|{
 1824|  1.15k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.15k|    plan.fill(lpos, cpos, rpos);
 1826|  1.15k|    plan.shuffle(cpos.shift());
 1827|  1.15k|    IMMER_TRY {
  ------------------
  |  |   49|  1.15k|#define IMMER_TRY try
  ------------------
 1828|  1.15k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.15k|    }
 1830|  1.15k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.15k|}
_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.57k|    {
 1753|  2.57k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 2.57k, False: 0]
  ------------------
 1754|  2.57k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 2.57k, False: 0]
  ------------------
 1755|  2.57k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  2.57k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  2.57k|        cpos.each_sub(visitor_t{}, *this);
 1758|  2.57k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  2.57k|    }
_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|   114k|    {
 1734|   114k|        auto count = p.count();
 1735|   114k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 114k, False: 0]
  ------------------
 1736|   114k|        plan.counts[plan.n++] = count;
 1737|   114k|        plan.total += count;
 1738|   114k|    }
_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|   196k|    {
 1734|   196k|        auto count = p.count();
 1735|   196k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 196k, False: 0]
  ------------------
 1736|   196k|        plan.counts[plan.n++] = count;
 1737|   196k|        plan.total += count;
 1738|   196k|    }
_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.15k|    {
 1803|  1.15k|        using node_t    = node_type<CPos>;
 1804|  1.15k|        using merger_t  = concat_merger<node_t>;
 1805|  1.15k|        using visitor_t = concat_merger_visitor;
 1806|  1.15k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.15k|        IMMER_TRY {
  ------------------
  |  |   49|  1.15k|#define IMMER_TRY try
  ------------------
 1808|  1.15k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.15k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.15k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.15k|            cpos.each_sub(dec_visitor{});
 1812|  1.15k|            return merger.finish();
 1813|  1.15k|        }
 1814|  1.15k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.15k|    }
_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|  22.6k|    {
 1722|  22.6k|        merger.merge_leaf(p);
 1723|  22.6k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_:
 1614|  22.6k|    {
 1615|  22.6k|        auto from       = p.node();
 1616|  22.6k|        auto from_size  = p.size();
 1617|  22.6k|        auto from_count = p.count();
 1618|  22.6k|        assert(from_size);
  ------------------
  |  Branch (1618:9): [True: 22.6k, False: 0]
  ------------------
 1619|  22.6k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1619:13): [True: 22.6k, False: 0]
  |  Branch (1619:21): [True: 22.6k, False: 0]
  ------------------
 1620|  22.6k|            add_child(from, from_size);
 1621|  22.6k|            from->inc();
 1622|  22.6k|        } 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|  22.6k|    }
_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.2k|    {
 1716|  28.2k|        merger.merge_inner(p);
 1717|  28.2k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_:
 1648|  28.2k|    {
 1649|  28.2k|        auto from       = p.node();
 1650|  28.2k|        auto from_size  = p.size();
 1651|  28.2k|        auto from_count = p.count();
 1652|  28.2k|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 28.2k, False: 0]
  ------------------
 1653|  28.2k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 28.2k, False: 0]
  |  Branch (1653:21): [True: 28.2k, False: 0]
  ------------------
 1654|  28.2k|            add_child(from, from_size);
 1655|  28.2k|            from->inc();
 1656|  28.2k|        } 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.2k|    }
_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|    651|    {
 1945|    651|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|    651|    }
_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.54k|    {
 1925|  1.54k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  1.54k|    }
_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.54k|{
 1839|  1.54k|    static_assert(Node::bits >= 2, "");
 1840|  1.54k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 1.54k, False: 0]
  ------------------
 1841|  1.54k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 1.54k, False: 0]
  ------------------
 1842|  1.54k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 1.54k, False: 0]
  ------------------
 1843|  1.54k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 0, False: 1.54k]
  ------------------
 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.54k|    else
 1854|  1.54k|        return {
 1855|  1.54k|            Node::bits_leaf,
 1856|  1.54k|            lpos.node()->inc(),
 1857|  1.54k|            lpos.count(),
 1858|  1.54k|            rpos.node()->inc(),
 1859|  1.54k|            rpos.count(),
 1860|  1.54k|        };
 1861|  1.54k|}
_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|    651|{
 1824|    651|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|    651|    plan.fill(lpos, cpos, rpos);
 1826|    651|    plan.shuffle(cpos.shift());
 1827|    651|    IMMER_TRY {
  ------------------
  |  |   49|    651|#define IMMER_TRY try
  ------------------
 1828|    651|        return plan.merge(lpos, cpos, rpos);
 1829|    651|    }
 1830|    651|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|    651|}
_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.61k|    {
 1753|  1.61k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 1.61k, False: 0]
  ------------------
 1754|  1.61k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 1.61k, False: 0]
  ------------------
 1755|  1.61k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  1.61k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  1.61k|        cpos.each_sub(visitor_t{}, *this);
 1758|  1.61k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  1.61k|    }
_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|    651|    {
 1803|    651|        using node_t    = node_type<CPos>;
 1804|    651|        using merger_t  = concat_merger<node_t>;
 1805|    651|        using visitor_t = concat_merger_visitor;
 1806|    651|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|    651|        IMMER_TRY {
  ------------------
  |  |   49|    651|#define IMMER_TRY try
  ------------------
 1808|    651|            lpos.each_left_sub(visitor_t{}, merger);
 1809|    651|            cpos.each_sub(visitor_t{}, merger);
 1810|    651|            rpos.each_right_sub(visitor_t{}, merger);
 1811|    651|            cpos.each_sub(dec_visitor{});
 1812|    651|            return merger.finish();
 1813|    651|        }
 1814|    651|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|    651|    }
_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|  1.98k|{
 1824|  1.98k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.98k|    plan.fill(lpos, cpos, rpos);
 1826|  1.98k|    plan.shuffle(cpos.shift());
 1827|  1.98k|    IMMER_TRY {
  ------------------
  |  |   49|  1.98k|#define IMMER_TRY try
  ------------------
 1828|  1.98k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.98k|    }
 1830|  1.98k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.98k|}
_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.27k|    {
 1753|  4.27k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 4.27k, False: 0]
  ------------------
 1754|  4.27k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 4.27k, False: 0]
  ------------------
 1755|  4.27k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  4.27k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  4.27k|        cpos.each_sub(visitor_t{}, *this);
 1758|  4.27k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  4.27k|    }
_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|   147k|    {
 1734|   147k|        auto count = p.count();
 1735|   147k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 147k, False: 0]
  ------------------
 1736|   147k|        plan.counts[plan.n++] = count;
 1737|   147k|        plan.total += count;
 1738|   147k|    }
_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|  1.98k|    {
 1803|  1.98k|        using node_t    = node_type<CPos>;
 1804|  1.98k|        using merger_t  = concat_merger<node_t>;
 1805|  1.98k|        using visitor_t = concat_merger_visitor;
 1806|  1.98k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.98k|        IMMER_TRY {
  ------------------
  |  |   49|  1.98k|#define IMMER_TRY try
  ------------------
 1808|  1.98k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.98k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.98k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.98k|            cpos.each_sub(dec_visitor{});
 1812|  1.98k|            return merger.finish();
 1813|  1.98k|        }
 1814|  1.98k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.98k|    }
_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|  18.8k|    {
 1716|  18.8k|        merger.merge_inner(p);
 1717|  18.8k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_:
 1648|  18.8k|    {
 1649|  18.8k|        auto from       = p.node();
 1650|  18.8k|        auto from_size  = p.size();
 1651|  18.8k|        auto from_count = p.count();
 1652|  18.8k|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 18.8k, False: 0]
  ------------------
 1653|  18.8k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 18.2k, False: 612]
  |  Branch (1653:21): [True: 18.2k, False: 0]
  ------------------
 1654|  18.2k|            add_child(from, from_size);
 1655|  18.2k|            from->inc();
 1656|  18.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|  18.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|    895|    {
 1945|    895|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|    895|    }
_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.70k|    {
 1925|  1.70k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  1.70k|    }
_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.70k|{
 1839|  1.70k|    static_assert(Node::bits >= 2, "");
 1840|  1.70k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 1.70k, False: 0]
  ------------------
 1841|  1.70k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 1.70k, False: 0]
  ------------------
 1842|  1.70k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 1.70k, False: 0]
  ------------------
 1843|  1.70k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 0, False: 1.70k]
  ------------------
 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.70k|    else
 1854|  1.70k|        return {
 1855|  1.70k|            Node::bits_leaf,
 1856|  1.70k|            lpos.node()->inc(),
 1857|  1.70k|            lpos.count(),
 1858|  1.70k|            rpos.node()->inc(),
 1859|  1.70k|            rpos.count(),
 1860|  1.70k|        };
 1861|  1.70k|}
_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|    895|{
 1824|    895|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|    895|    plan.fill(lpos, cpos, rpos);
 1826|    895|    plan.shuffle(cpos.shift());
 1827|    895|    IMMER_TRY {
  ------------------
  |  |   49|    895|#define IMMER_TRY try
  ------------------
 1828|    895|        return plan.merge(lpos, cpos, rpos);
 1829|    895|    }
 1830|    895|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|    895|}
_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.31k|    {
 1753|  3.31k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 3.31k, False: 0]
  ------------------
 1754|  3.31k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 3.31k, False: 0]
  ------------------
 1755|  3.31k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  3.31k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  3.31k|        cpos.each_sub(visitor_t{}, *this);
 1758|  3.31k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  3.31k|    }
_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|    895|    {
 1803|    895|        using node_t    = node_type<CPos>;
 1804|    895|        using merger_t  = concat_merger<node_t>;
 1805|    895|        using visitor_t = concat_merger_visitor;
 1806|    895|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|    895|        IMMER_TRY {
  ------------------
  |  |   49|    895|#define IMMER_TRY try
  ------------------
 1808|    895|            lpos.each_left_sub(visitor_t{}, merger);
 1809|    895|            cpos.each_sub(visitor_t{}, merger);
 1810|    895|            rpos.each_right_sub(visitor_t{}, merger);
 1811|    895|            cpos.each_sub(dec_visitor{});
 1812|    895|            return merger.finish();
 1813|    895|        }
 1814|    895|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|    895|    }
_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.51k|{
 1824|  9.51k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  9.51k|    plan.fill(lpos, cpos, rpos);
 1826|  9.51k|    plan.shuffle(cpos.shift());
 1827|  9.51k|    IMMER_TRY {
  ------------------
  |  |   49|  9.51k|#define IMMER_TRY try
  ------------------
 1828|  9.51k|        return plan.merge(lpos, cpos, rpos);
 1829|  9.51k|    }
 1830|  9.51k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  9.51k|}
_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|  74.9k|    {
 1753|  74.9k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 74.9k, False: 0]
  ------------------
 1754|  74.9k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 74.9k, False: 0]
  ------------------
 1755|  74.9k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  74.9k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  74.9k|        cpos.each_sub(visitor_t{}, *this);
 1758|  74.9k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  74.9k|    }
_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.51k|    {
 1803|  9.51k|        using node_t    = node_type<CPos>;
 1804|  9.51k|        using merger_t  = concat_merger<node_t>;
 1805|  9.51k|        using visitor_t = concat_merger_visitor;
 1806|  9.51k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  9.51k|        IMMER_TRY {
  ------------------
  |  |   49|  9.51k|#define IMMER_TRY try
  ------------------
 1808|  9.51k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  9.51k|            cpos.each_sub(visitor_t{}, merger);
 1810|  9.51k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  9.51k|            cpos.each_sub(dec_visitor{});
 1812|  9.51k|            return merger.finish();
 1813|  9.51k|        }
 1814|  9.51k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  9.51k|    }
_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.70k|    {
 1945|  1.70k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  1.70k|    }
_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.70k|{
 1824|  1.70k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.70k|    plan.fill(lpos, cpos, rpos);
 1826|  1.70k|    plan.shuffle(cpos.shift());
 1827|  1.70k|    IMMER_TRY {
  ------------------
  |  |   49|  1.70k|#define IMMER_TRY try
  ------------------
 1828|  1.70k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.70k|    }
 1830|  1.70k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.70k|}
_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.37k|    {
 1753|  5.37k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 5.37k, False: 0]
  ------------------
 1754|  5.37k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 5.37k, False: 0]
  ------------------
 1755|  5.37k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  5.37k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  5.37k|        cpos.each_sub(visitor_t{}, *this);
 1758|  5.37k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  5.37k|    }
_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.70k|    {
 1803|  1.70k|        using node_t    = node_type<CPos>;
 1804|  1.70k|        using merger_t  = concat_merger<node_t>;
 1805|  1.70k|        using visitor_t = concat_merger_visitor;
 1806|  1.70k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.70k|        IMMER_TRY {
  ------------------
  |  |   49|  1.70k|#define IMMER_TRY try
  ------------------
 1808|  1.70k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.70k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.70k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.70k|            cpos.each_sub(dec_visitor{});
 1812|  1.70k|            return merger.finish();
 1813|  1.70k|        }
 1814|  1.70k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.70k|    }
_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.33k|    {
 1959|  1.33k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  1.33k|    }
_ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7realizeEv:
 1527|  47.7k|    {
 1528|  47.7k|        if (count_ > 1) {
  ------------------
  |  Branch (1528:13): [True: 20.5k, False: 27.1k]
  ------------------
 1529|  20.5k|            IMMER_TRY {
  ------------------
  |  |   49|  20.5k|#define IMMER_TRY try
  ------------------
 1530|  20.5k|                auto result = node_t::make_inner_r_n(count_);
 1531|  20.5k|                auto r      = result->relaxed();
 1532|  20.5k|                r->d.count  = count_;
 1533|  20.5k|                std::copy(nodes_, nodes_ + count_, result->inner());
 1534|  20.5k|                std::copy(sizes_, sizes_ + count_, r->d.sizes);
 1535|  20.5k|                return {result, shift_, r};
 1536|  20.5k|            }
 1537|  20.5k|            IMMER_CATCH (...) {
 1538|      0|                each_sub(dec_visitor{});
 1539|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1540|      0|            }
 1541|  27.1k|        } else {
 1542|  27.1k|            assert(shift_ >= B + BL);
  ------------------
  |  Branch (1542:13): [True: 27.1k, False: 0]
  ------------------
 1543|  27.1k|            return {nodes_[0], shift_ - B, nodes_[0]->relaxed()};
 1544|  27.1k|        }
 1545|  47.7k|    }
_ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm:
 1986|  44.5k|{
 1987|  44.5k|    return visit_maybe_relaxed_sub(lroot,
 1988|  44.5k|                                   lshift,
 1989|  44.5k|                                   lsize,
 1990|  44.5k|                                   concat_trees_left_visitor<Node>{},
 1991|  44.5k|                                   make_leaf_pos(ltail, ltcount),
 1992|  44.5k|                                   rroot,
 1993|  44.5k|                                   rshift,
 1994|  44.5k|                                   rsize)
 1995|  44.5k|        .realize();
 1996|  44.5k|}
_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|  38.9k|    {
 1972|  38.9k|        return visit_maybe_relaxed_sub(
 1973|  38.9k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  38.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|  36.4k|    {
 1959|  36.4k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  36.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|   200k|{
 1873|   200k|    auto lshift = lpos.shift();
 1874|   200k|    auto rshift = rpos.shift();
 1875|   200k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 2.57k, False: 198k]
  ------------------
 1876|  2.57k|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|  2.57k|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|   198k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 2.59k, False: 195k]
  ------------------
 1879|  2.59k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  2.59k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|   195k|    } else {
 1882|   195k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 195k, False: 0]
  ------------------
 1883|   195k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 195k]
  |  Branch (1883:9): [True: 195k, False: 0]
  |  Branch (1883:9): [True: 195k, False: 0]
  ------------------
 1884|   195k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|   195k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|   195k|    }
 1887|   200k|}
_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.24k|    {
 1898|  2.24k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  2.24k|    }
_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|    791|    {
 1898|    791|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|    791|    }
_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|  12.5k|{
 1873|  12.5k|    auto lshift = lpos.shift();
 1874|  12.5k|    auto rshift = rpos.shift();
 1875|  12.5k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 463, False: 12.0k]
  ------------------
 1876|    463|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|    463|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  12.0k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 948, False: 11.0k]
  ------------------
 1879|    948|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    948|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  11.0k|    } else {
 1882|  11.0k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 11.0k, False: 0]
  ------------------
 1883|  11.0k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 11.0k]
  |  Branch (1883:9): [True: 11.0k, False: 0]
  |  Branch (1883:9): [True: 11.0k, False: 0]
  ------------------
 1884|  11.0k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  11.0k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  11.0k|    }
 1887|  12.5k|}
_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.64k|{
 1824|  1.64k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.64k|    plan.fill(lpos, cpos, rpos);
 1826|  1.64k|    plan.shuffle(cpos.shift());
 1827|  1.64k|    IMMER_TRY {
  ------------------
  |  |   49|  1.64k|#define IMMER_TRY try
  ------------------
 1828|  1.64k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.64k|    }
 1830|  1.64k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.64k|}
_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.58k|    {
 1753|  5.58k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 5.58k, False: 0]
  ------------------
 1754|  5.58k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 5.58k, False: 0]
  ------------------
 1755|  5.58k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  5.58k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  5.58k|        cpos.each_sub(visitor_t{}, *this);
 1758|  5.58k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  5.58k|    }
_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.64k|    {
 1803|  1.64k|        using node_t    = node_type<CPos>;
 1804|  1.64k|        using merger_t  = concat_merger<node_t>;
 1805|  1.64k|        using visitor_t = concat_merger_visitor;
 1806|  1.64k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.64k|        IMMER_TRY {
  ------------------
  |  |   49|  1.64k|#define IMMER_TRY try
  ------------------
 1808|  1.64k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.64k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.64k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.64k|            cpos.each_sub(dec_visitor{});
 1812|  1.64k|            return merger.finish();
 1813|  1.64k|        }
 1814|  1.64k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.64k|    }
_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|  10.7k|    {
 1918|  10.7k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  10.7k|    }
_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.17k|    {
 1918|  1.17k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.17k|    }
_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.27k|{
 1873|  7.27k|    auto lshift = lpos.shift();
 1874|  7.27k|    auto rshift = rpos.shift();
 1875|  7.27k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 1.17k, False: 6.10k]
  ------------------
 1876|  1.17k|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|  1.17k|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  6.10k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 643, False: 5.45k]
  ------------------
 1879|    643|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    643|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  5.45k|    } else {
 1882|  5.45k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 5.45k, False: 0]
  ------------------
 1883|  5.45k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 5.45k]
  |  Branch (1883:9): [True: 5.45k, False: 0]
  |  Branch (1883:9): [True: 5.45k, False: 0]
  ------------------
 1884|  5.45k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  5.45k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  5.45k|    }
 1887|  7.27k|}
_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.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_15regular_sub_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  4.44k|    {
 1918|  4.44k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  4.44k|    }
_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.44k|{
 1873|  4.44k|    auto lshift = lpos.shift();
 1874|  4.44k|    auto rshift = rpos.shift();
 1875|  4.44k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 4.44k]
  ------------------
 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.44k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 215, False: 4.22k]
  ------------------
 1879|    215|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    215|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  4.22k|    } else {
 1882|  4.22k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 4.22k, False: 0]
  ------------------
 1883|  4.22k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 4.22k]
  |  Branch (1883:9): [True: 4.22k, False: 0]
  |  Branch (1883:9): [True: 4.22k, False: 0]
  ------------------
 1884|  4.22k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  4.22k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  4.22k|    }
 1887|  4.44k|}
_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.58k|    {
 1945|  3.58k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  3.58k|    }
_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|  8.58k|    {
 1925|  8.58k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  8.58k|    }
_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|  8.58k|{
 1839|  8.58k|    static_assert(Node::bits >= 2, "");
 1840|  8.58k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 8.58k, False: 0]
  ------------------
 1841|  8.58k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 8.58k, False: 0]
  ------------------
 1842|  8.58k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 8.58k, False: 0]
  ------------------
 1843|  8.58k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 8.58k, False: 0]
  ------------------
 1844|  8.58k|        return {
 1845|  8.58k|            Node::bits_leaf,
 1846|  8.58k|            lpos.node()->inc(),
 1847|  8.58k|            lpos.count(),
 1848|  8.58k|            tpos.node()->inc(),
 1849|  8.58k|            tpos.count(),
 1850|  8.58k|            rpos.node()->inc(),
 1851|  8.58k|            rpos.count(),
 1852|  8.58k|        };
 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|  8.58k|}
_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|  1.87k|    {
 1938|  1.87k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  1.87k|    }
_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.22k|{
 1824|  4.22k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  4.22k|    plan.fill(lpos, cpos, rpos);
 1826|  4.22k|    plan.shuffle(cpos.shift());
 1827|  4.22k|    IMMER_TRY {
  ------------------
  |  |   49|  4.22k|#define IMMER_TRY try
  ------------------
 1828|  4.22k|        return plan.merge(lpos, cpos, rpos);
 1829|  4.22k|    }
 1830|  4.22k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  4.22k|}
_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|  14.2k|    {
 1753|  14.2k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 14.2k, False: 0]
  ------------------
 1754|  14.2k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 14.2k, False: 0]
  ------------------
 1755|  14.2k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  14.2k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  14.2k|        cpos.each_sub(visitor_t{}, *this);
 1758|  14.2k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  14.2k|    }
_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.22k|    {
 1803|  4.22k|        using node_t    = node_type<CPos>;
 1804|  4.22k|        using merger_t  = concat_merger<node_t>;
 1805|  4.22k|        using visitor_t = concat_merger_visitor;
 1806|  4.22k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  4.22k|        IMMER_TRY {
  ------------------
  |  |   49|  4.22k|#define IMMER_TRY try
  ------------------
 1808|  4.22k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  4.22k|            cpos.each_sub(visitor_t{}, merger);
 1810|  4.22k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  4.22k|            cpos.each_sub(dec_visitor{});
 1812|  4.22k|            return merger.finish();
 1813|  4.22k|        }
 1814|  4.22k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  4.22k|    }
_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.00k|    {
 1945|  5.00k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  5.00k|    }
_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|  35.9k|    {
 1925|  35.9k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  35.9k|    }
_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|  35.9k|{
 1839|  35.9k|    static_assert(Node::bits >= 2, "");
 1840|  35.9k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 35.9k, False: 0]
  ------------------
 1841|  35.9k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 35.9k, False: 0]
  ------------------
 1842|  35.9k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 35.9k, False: 0]
  ------------------
 1843|  35.9k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 35.9k, False: 0]
  ------------------
 1844|  35.9k|        return {
 1845|  35.9k|            Node::bits_leaf,
 1846|  35.9k|            lpos.node()->inc(),
 1847|  35.9k|            lpos.count(),
 1848|  35.9k|            tpos.node()->inc(),
 1849|  35.9k|            tpos.count(),
 1850|  35.9k|            rpos.node()->inc(),
 1851|  35.9k|            rpos.count(),
 1852|  35.9k|        };
 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|  35.9k|}
_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.71k|    {
 1938|  1.71k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  1.71k|    }
_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|  5.45k|{
 1824|  5.45k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  5.45k|    plan.fill(lpos, cpos, rpos);
 1826|  5.45k|    plan.shuffle(cpos.shift());
 1827|  5.45k|    IMMER_TRY {
  ------------------
  |  |   49|  5.45k|#define IMMER_TRY try
  ------------------
 1828|  5.45k|        return plan.merge(lpos, cpos, rpos);
 1829|  5.45k|    }
 1830|  5.45k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  5.45k|}
_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|  11.3k|    {
 1753|  11.3k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 11.3k, False: 0]
  ------------------
 1754|  11.3k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 11.3k, False: 0]
  ------------------
 1755|  11.3k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  11.3k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  11.3k|        cpos.each_sub(visitor_t{}, *this);
 1758|  11.3k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  11.3k|    }
_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|  5.45k|    {
 1803|  5.45k|        using node_t    = node_type<CPos>;
 1804|  5.45k|        using merger_t  = concat_merger<node_t>;
 1805|  5.45k|        using visitor_t = concat_merger_visitor;
 1806|  5.45k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  5.45k|        IMMER_TRY {
  ------------------
  |  |   49|  5.45k|#define IMMER_TRY try
  ------------------
 1808|  5.45k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  5.45k|            cpos.each_sub(visitor_t{}, merger);
 1810|  5.45k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  5.45k|            cpos.each_sub(dec_visitor{});
 1812|  5.45k|            return merger.finish();
 1813|  5.45k|        }
 1814|  5.45k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  5.45k|    }
_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|  35.9k|    {
 1945|  35.9k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  35.9k|    }
_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|  10.9k|    {
 1938|  10.9k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  10.9k|    }
_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.0k|{
 1824|  11.0k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  11.0k|    plan.fill(lpos, cpos, rpos);
 1826|  11.0k|    plan.shuffle(cpos.shift());
 1827|  11.0k|    IMMER_TRY {
  ------------------
  |  |   49|  11.0k|#define IMMER_TRY try
  ------------------
 1828|  11.0k|        return plan.merge(lpos, cpos, rpos);
 1829|  11.0k|    }
 1830|  11.0k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  11.0k|}
_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|   146k|    {
 1753|   146k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 146k, False: 0]
  ------------------
 1754|   146k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 146k, False: 0]
  ------------------
 1755|   146k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   146k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   146k|        cpos.each_sub(visitor_t{}, *this);
 1758|   146k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   146k|    }
_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.0k|    {
 1803|  11.0k|        using node_t    = node_type<CPos>;
 1804|  11.0k|        using merger_t  = concat_merger<node_t>;
 1805|  11.0k|        using visitor_t = concat_merger_visitor;
 1806|  11.0k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  11.0k|        IMMER_TRY {
  ------------------
  |  |   49|  11.0k|#define IMMER_TRY try
  ------------------
 1808|  11.0k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  11.0k|            cpos.each_sub(visitor_t{}, merger);
 1810|  11.0k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  11.0k|            cpos.each_sub(dec_visitor{});
 1812|  11.0k|            return merger.finish();
 1813|  11.0k|        }
 1814|  11.0k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  11.0k|    }
_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.51k|{
 1824|  4.51k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  4.51k|    plan.fill(lpos, cpos, rpos);
 1826|  4.51k|    plan.shuffle(cpos.shift());
 1827|  4.51k|    IMMER_TRY {
  ------------------
  |  |   49|  4.51k|#define IMMER_TRY try
  ------------------
 1828|  4.51k|        return plan.merge(lpos, cpos, rpos);
 1829|  4.51k|    }
 1830|  4.51k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  4.51k|}
_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|   454k|    {
 1753|   454k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 454k, False: 0]
  ------------------
 1754|   454k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 454k, False: 0]
  ------------------
 1755|   454k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   454k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   454k|        cpos.each_sub(visitor_t{}, *this);
 1758|   454k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   454k|    }
_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.51k|    {
 1803|  4.51k|        using node_t    = node_type<CPos>;
 1804|  4.51k|        using merger_t  = concat_merger<node_t>;
 1805|  4.51k|        using visitor_t = concat_merger_visitor;
 1806|  4.51k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  4.51k|        IMMER_TRY {
  ------------------
  |  |   49|  4.51k|#define IMMER_TRY try
  ------------------
 1808|  4.51k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  4.51k|            cpos.each_sub(visitor_t{}, merger);
 1810|  4.51k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  4.51k|            cpos.each_sub(dec_visitor{});
 1812|  4.51k|            return merger.finish();
 1813|  4.51k|        }
 1814|  4.51k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  4.51k|    }
_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|   162k|    {
 1918|   162k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|   162k|    }
_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|    274|    {
 1918|    274|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|    274|    }
_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.42k|{
 1873|  4.42k|    auto lshift = lpos.shift();
 1874|  4.42k|    auto rshift = rpos.shift();
 1875|  4.42k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 1.94k, False: 2.48k]
  ------------------
 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.48k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 692, False: 1.79k]
  ------------------
 1879|    692|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    692|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  1.79k|    } else {
 1882|  1.79k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.79k, False: 0]
  ------------------
 1883|  1.79k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.79k]
  |  Branch (1883:9): [True: 1.79k, False: 0]
  |  Branch (1883:9): [True: 1.79k, False: 0]
  ------------------
 1884|  1.79k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.79k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.79k|    }
 1887|  4.42k|}
_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.57k|    {
 1898|  1.57k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  1.57k|    }
_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.99k|    {
 1918|  1.99k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.99k|    }
_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.99k|{
 1873|  1.99k|    auto lshift = lpos.shift();
 1874|  1.99k|    auto rshift = rpos.shift();
 1875|  1.99k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.99k]
  ------------------
 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.99k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 284, False: 1.71k]
  ------------------
 1879|    284|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    284|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  1.71k|    } else {
 1882|  1.71k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.71k, False: 0]
  ------------------
 1883|  1.71k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.71k]
  |  Branch (1883:9): [True: 1.71k, False: 0]
  |  Branch (1883:9): [True: 1.71k, False: 0]
  ------------------
 1884|  1.71k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.71k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.71k|    }
 1887|  1.99k|}
_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|    484|    {
 1938|    484|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|    484|    }
_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.71k|{
 1824|  1.71k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.71k|    plan.fill(lpos, cpos, rpos);
 1826|  1.71k|    plan.shuffle(cpos.shift());
 1827|  1.71k|    IMMER_TRY {
  ------------------
  |  |   49|  1.71k|#define IMMER_TRY try
  ------------------
 1828|  1.71k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.71k|    }
 1830|  1.71k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.71k|}
_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.96k|    {
 1753|  3.96k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 3.96k, False: 0]
  ------------------
 1754|  3.96k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 3.96k, False: 0]
  ------------------
 1755|  3.96k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  3.96k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  3.96k|        cpos.each_sub(visitor_t{}, *this);
 1758|  3.96k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  3.96k|    }
_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.71k|    {
 1803|  1.71k|        using node_t    = node_type<CPos>;
 1804|  1.71k|        using merger_t  = concat_merger<node_t>;
 1805|  1.71k|        using visitor_t = concat_merger_visitor;
 1806|  1.71k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.71k|        IMMER_TRY {
  ------------------
  |  |   49|  1.71k|#define IMMER_TRY try
  ------------------
 1808|  1.71k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.71k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.71k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.71k|            cpos.each_sub(dec_visitor{});
 1812|  1.71k|            return merger.finish();
 1813|  1.71k|        }
 1814|  1.71k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.71k|    }
_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|    535|    {
 1938|    535|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|    535|    }
_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.79k|{
 1824|  1.79k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.79k|    plan.fill(lpos, cpos, rpos);
 1826|  1.79k|    plan.shuffle(cpos.shift());
 1827|  1.79k|    IMMER_TRY {
  ------------------
  |  |   49|  1.79k|#define IMMER_TRY try
  ------------------
 1828|  1.79k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.79k|    }
 1830|  1.79k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.79k|}
_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|  42.8k|    {
 1753|  42.8k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 42.8k, False: 0]
  ------------------
 1754|  42.8k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 42.8k, False: 0]
  ------------------
 1755|  42.8k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  42.8k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  42.8k|        cpos.each_sub(visitor_t{}, *this);
 1758|  42.8k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  42.8k|    }
_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.79k|    {
 1803|  1.79k|        using node_t    = node_type<CPos>;
 1804|  1.79k|        using merger_t  = concat_merger<node_t>;
 1805|  1.79k|        using visitor_t = concat_merger_visitor;
 1806|  1.79k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.79k|        IMMER_TRY {
  ------------------
  |  |   49|  1.79k|#define IMMER_TRY try
  ------------------
 1808|  1.79k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.79k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.79k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.79k|            cpos.each_sub(dec_visitor{});
 1812|  1.79k|            return merger.finish();
 1813|  1.79k|        }
 1814|  1.79k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.79k|    }
_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|   159k|    {
 1938|   159k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|   159k|    }
_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|   195k|{
 1824|   195k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|   195k|    plan.fill(lpos, cpos, rpos);
 1826|   195k|    plan.shuffle(cpos.shift());
 1827|   195k|    IMMER_TRY {
  ------------------
  |  |   49|   195k|#define IMMER_TRY try
  ------------------
 1828|   195k|        return plan.merge(lpos, cpos, rpos);
 1829|   195k|    }
 1830|   195k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|   195k|}
_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|   456k|    {
 1753|   456k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 456k, False: 0]
  ------------------
 1754|   456k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 456k, False: 0]
  ------------------
 1755|   456k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   456k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   456k|        cpos.each_sub(visitor_t{}, *this);
 1758|   456k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   456k|    }
_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|   195k|    {
 1803|   195k|        using node_t    = node_type<CPos>;
 1804|   195k|        using merger_t  = concat_merger<node_t>;
 1805|   195k|        using visitor_t = concat_merger_visitor;
 1806|   195k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|   195k|        IMMER_TRY {
  ------------------
  |  |   49|   195k|#define IMMER_TRY try
  ------------------
 1808|   195k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|   195k|            cpos.each_sub(visitor_t{}, merger);
 1810|   195k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|   195k|            cpos.each_sub(dec_visitor{});
 1812|   195k|            return merger.finish();
 1813|   195k|        }
 1814|   195k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|   195k|    }
_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.57k|    {
 1959|  2.57k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  2.57k|    }
_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|  5.54k|    {
 1972|  5.54k|        return visit_maybe_relaxed_sub(
 1973|  5.54k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  5.54k|    }
_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|    978|    {
 1959|    978|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|    978|    }
_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|  4.56k|    {
 1959|  4.56k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  4.56k|    }
_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|   726k|    {
  681|   726k|        auto node     = pos.node();
  682|   726k|        auto level    = pos.shift();
  683|   726k|        auto idx      = pos.count() - 1;
  684|   726k|        auto children = pos.size(idx);
  685|   726k|        auto new_idx =
  686|   726k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (686:13): [True: 4.45k, False: 721k]
  |  Branch (686:47): [True: 1.05k, False: 720k]
  ------------------
  687|   726k|        auto new_child = static_cast<node_t*>(nullptr);
  688|   726k|        auto mutate    = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (688:26): [True: 726k, Folded]
  |  Branch (688:38): [True: 720k, False: 5.96k]
  ------------------
  689|       |
  690|   726k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (690:13): [True: 2.96k, False: 723k]
  ------------------
  691|  2.96k|            return nullptr;
  692|   723k|        else if (idx == new_idx) {
  ------------------
  |  Branch (692:18): [True: 720k, False: 2.54k]
  ------------------
  693|   720k|            new_child =
  694|   720k|                mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts)
  ------------------
  |  Branch (694:17): [True: 715k, False: 5.10k]
  ------------------
  695|   720k|                       : pos.last_oh_csh(
  696|  5.10k|                             this_no_mut_t{}, idx, children, e, tail, ts);
  697|   720k|            if (!new_child) {
  ------------------
  |  Branch (697:17): [True: 4.06k, False: 716k]
  ------------------
  698|  4.06k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (698:21): [True: 2.06k, False: 2.00k]
  ------------------
  699|  2.06k|                    new_child = node_t::make_path_e(e, level - B, tail);
  700|  2.00k|                else
  701|  2.00k|                    return nullptr;
  702|  4.06k|            }
  703|   720k|        } else
  704|  2.54k|            new_child = node_t::make_path_e(e, level - B, tail);
  705|       |
  706|   721k|        if (mutate) {
  ------------------
  |  Branch (706:13): [True: 716k, False: 5.11k]
  ------------------
  707|   716k|            auto count             = new_idx + 1;
  708|   716k|            auto relaxed           = node->ensure_mutable_relaxed_n(e, new_idx);
  709|   716k|            node->inner()[new_idx] = new_child;
  710|   716k|            relaxed->d.sizes[new_idx] = pos.size() + ts;
  711|   716k|            relaxed->d.count          = count;
  712|   716k|            assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (712:13): [True: 716k, False: 0]
  ------------------
  713|   716k|            return node;
  714|   716k|        } else {
  715|  5.11k|            IMMER_TRY {
  ------------------
  |  |   49|  5.11k|#define IMMER_TRY try
  ------------------
  716|  5.11k|                auto count    = new_idx + 1;
  717|  5.11k|                auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx);
  718|  5.11k|                auto relaxed  = new_node->relaxed();
  719|  5.11k|                new_node->inner()[new_idx] = new_child;
  720|  5.11k|                relaxed->d.sizes[new_idx]  = pos.size() + ts;
  721|  5.11k|                relaxed->d.count           = count;
  722|  5.11k|                assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (722:17): [True: 5.11k, False: 0]
  ------------------
  723|  5.11k|                if (Mutating)
  ------------------
  |  Branch (723:21): [True: 5.11k, Folded]
  ------------------
  724|  5.11k|                    pos.visit(dec_visitor{});
  725|  5.11k|                return new_node;
  726|  5.11k|            }
  727|  5.11k|            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.11k|        }
  737|   721k|    }
_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|   629k|    {
  742|   629k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 629k, False: 0]
  ------------------
  743|   629k|        auto node    = pos.node();
  744|   629k|        auto idx     = pos.index(pos.size() - 1);
  745|   629k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|   629k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 629k, Folded]
  |  Branch (746:36): [True: 628k, False: 745]
  ------------------
  747|   629k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 628k, False: 745]
  ------------------
  748|   628k|            node->inner()[new_idx] =
  749|   628k|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 625k, False: 3.26k]
  ------------------
  750|       |                               /* otherwise */
  751|   628k|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|   628k|            return node;
  753|   628k|        } else {
  754|    745|            auto new_parent = node_t::make_inner_e(e);
  755|    745|            IMMER_TRY {
  ------------------
  |  |   49|    745|#define IMMER_TRY try
  ------------------
  756|    745|                new_parent->inner()[new_idx] =
  757|    745|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 368, False: 377]
  ------------------
  758|    745|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|    745|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|    745|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|    745|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 745, Folded]
  ------------------
  763|    745|                    pos.visit(dec_visitor{});
  764|    745|                return new_parent;
  765|    745|            }
  766|    745|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|    745|        }
  771|   629k|    }
_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|  8.85M|    {
  742|  8.85M|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 8.85M, False: 0]
  ------------------
  743|  8.85M|        auto node    = pos.node();
  744|  8.85M|        auto idx     = pos.index(pos.size() - 1);
  745|  8.85M|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  8.85M|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 8.85M, Folded]
  |  Branch (746:36): [True: 8.84M, False: 630]
  ------------------
  747|  8.85M|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 8.84M, False: 630]
  ------------------
  748|  8.84M|            node->inner()[new_idx] =
  749|  8.84M|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 7.20M, False: 1.64M]
  ------------------
  750|       |                               /* otherwise */
  751|  8.84M|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|  8.84M|            return node;
  753|  8.84M|        } else {
  754|    630|            auto new_parent = node_t::make_inner_e(e);
  755|    630|            IMMER_TRY {
  ------------------
  |  |   49|    630|#define IMMER_TRY try
  ------------------
  756|    630|                new_parent->inner()[new_idx] =
  757|    630|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 428, False: 202]
  ------------------
  758|    630|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|    630|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|    630|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|    630|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 630, Folded]
  ------------------
  763|    630|                    pos.visit(dec_visitor{});
  764|    630|                return new_parent;
  765|    630|            }
  766|    630|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|    630|        }
  771|  8.85M|    }
_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|  11.8k|    {
  742|  11.8k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 11.8k, False: 0]
  ------------------
  743|  11.8k|        auto node    = pos.node();
  744|  11.8k|        auto idx     = pos.index(pos.size() - 1);
  745|  11.8k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  11.8k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [Folded, False: 11.8k]
  |  Branch (746:36): [True: 0, False: 0]
  ------------------
  747|  11.8k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 0, False: 11.8k]
  ------------------
  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|  11.8k|        } else {
  754|  11.8k|            auto new_parent = node_t::make_inner_e(e);
  755|  11.8k|            IMMER_TRY {
  ------------------
  |  |   49|  11.8k|#define IMMER_TRY try
  ------------------
  756|  11.8k|                new_parent->inner()[new_idx] =
  757|  11.8k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 6.72k, False: 5.16k]
  ------------------
  758|  11.8k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  11.8k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  11.8k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  11.8k|                if (Mutating)
  ------------------
  |  Branch (762:21): [Folded, False: 11.8k]
  ------------------
  763|      0|                    pos.visit(dec_visitor{});
  764|  11.8k|                return new_parent;
  765|  11.8k|            }
  766|  11.8k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  11.8k|        }
  771|  11.8k|    }
_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.0k|    {
  681|  18.0k|        auto node     = pos.node();
  682|  18.0k|        auto level    = pos.shift();
  683|  18.0k|        auto idx      = pos.count() - 1;
  684|  18.0k|        auto children = pos.size(idx);
  685|  18.0k|        auto new_idx =
  686|  18.0k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (686:13): [True: 1.93k, False: 16.1k]
  |  Branch (686:47): [True: 212, False: 15.9k]
  ------------------
  687|  18.0k|        auto new_child = static_cast<node_t*>(nullptr);
  688|  18.0k|        auto mutate    = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (688:26): [Folded, False: 18.0k]
  |  Branch (688:38): [True: 0, False: 0]
  ------------------
  689|       |
  690|  18.0k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (690:13): [True: 711, False: 17.3k]
  ------------------
  691|    711|            return nullptr;
  692|  17.3k|        else if (idx == new_idx) {
  ------------------
  |  Branch (692:18): [True: 15.9k, False: 1.43k]
  ------------------
  693|  15.9k|            new_child =
  694|  15.9k|                mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts)
  ------------------
  |  Branch (694:17): [True: 0, False: 15.9k]
  ------------------
  695|  15.9k|                       : pos.last_oh_csh(
  696|  15.9k|                             this_no_mut_t{}, idx, children, e, tail, ts);
  697|  15.9k|            if (!new_child) {
  ------------------
  |  Branch (697:17): [True: 1.54k, False: 14.3k]
  ------------------
  698|  1.54k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (698:21): [True: 261, False: 1.28k]
  ------------------
  699|    261|                    new_child = node_t::make_path_e(e, level - B, tail);
  700|  1.28k|                else
  701|  1.28k|                    return nullptr;
  702|  1.54k|            }
  703|  15.9k|        } else
  704|  1.43k|            new_child = node_t::make_path_e(e, level - B, tail);
  705|       |
  706|  16.0k|        if (mutate) {
  ------------------
  |  Branch (706:13): [True: 0, False: 16.0k]
  ------------------
  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.0k|        } else {
  715|  16.0k|            IMMER_TRY {
  ------------------
  |  |   49|  16.0k|#define IMMER_TRY try
  ------------------
  716|  16.0k|                auto count    = new_idx + 1;
  717|  16.0k|                auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx);
  718|  16.0k|                auto relaxed  = new_node->relaxed();
  719|  16.0k|                new_node->inner()[new_idx] = new_child;
  720|  16.0k|                relaxed->d.sizes[new_idx]  = pos.size() + ts;
  721|  16.0k|                relaxed->d.count           = count;
  722|  16.0k|                assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (722:17): [True: 16.0k, False: 0]
  ------------------
  723|  16.0k|                if (Mutating)
  ------------------
  |  Branch (723:21): [Folded, False: 16.0k]
  ------------------
  724|      0|                    pos.visit(dec_visitor{});
  725|  16.0k|                return new_node;
  726|  16.0k|            }
  727|  16.0k|            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.0k|        }
  737|  16.0k|    }
_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|  2.95k|    {
  742|  2.95k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 2.95k, False: 0]
  ------------------
  743|  2.95k|        auto node    = pos.node();
  744|  2.95k|        auto idx     = pos.index(pos.size() - 1);
  745|  2.95k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  2.95k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [Folded, False: 2.95k]
  |  Branch (746:36): [True: 0, False: 0]
  ------------------
  747|  2.95k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 0, False: 2.95k]
  ------------------
  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|  2.95k|        } else {
  754|  2.95k|            auto new_parent = node_t::make_inner_e(e);
  755|  2.95k|            IMMER_TRY {
  ------------------
  |  |   49|  2.95k|#define IMMER_TRY try
  ------------------
  756|  2.95k|                new_parent->inner()[new_idx] =
  757|  2.95k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 1.84k, False: 1.10k]
  ------------------
  758|  2.95k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  2.95k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  2.95k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  2.95k|                if (Mutating)
  ------------------
  |  Branch (762:21): [Folded, False: 2.95k]
  ------------------
  763|      0|                    pos.visit(dec_visitor{});
  764|  2.95k|                return new_parent;
  765|  2.95k|            }
  766|  2.95k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  2.95k|        }
  771|  2.95k|    }
_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.03M|    {
  742|  1.03M|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 1.03M, False: 0]
  ------------------
  743|  1.03M|        auto node    = pos.node();
  744|  1.03M|        auto idx     = pos.index(pos.size() - 1);
  745|  1.03M|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  1.03M|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 1.03M, Folded]
  |  Branch (746:36): [True: 1.02M, False: 4.41k]
  ------------------
  747|  1.03M|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 1.02M, False: 4.41k]
  ------------------
  748|  1.02M|            node->inner()[new_idx] =
  749|  1.02M|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 1.01M, False: 11.6k]
  ------------------
  750|       |                               /* otherwise */
  751|  1.02M|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|  1.02M|            return node;
  753|  1.02M|        } else {
  754|  4.41k|            auto new_parent = node_t::make_inner_e(e);
  755|  4.41k|            IMMER_TRY {
  ------------------
  |  |   49|  4.41k|#define IMMER_TRY try
  ------------------
  756|  4.41k|                new_parent->inner()[new_idx] =
  757|  4.41k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 2.52k, False: 1.88k]
  ------------------
  758|  4.41k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  4.41k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  4.41k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  4.41k|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 4.41k, Folded]
  ------------------
  763|  4.41k|                    pos.visit(dec_visitor{});
  764|  4.41k|                return new_parent;
  765|  4.41k|            }
  766|  4.41k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  4.41k|        }
  771|  1.03M|    }
_ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEvPT_:
  580|  4.94k|{
  581|  4.94k|    make_empty_regular_pos(node).visit(dec_visitor());
  582|  4.94k|}
_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|  22.5k|    {
  596|  22.5k|        auto offset = pos.index(idx);
  597|  22.5k|        auto count  = pos.count();
  598|  22.5k|        auto node   = pos.node();
  599|  22.5k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (599:13): [True: 4.38k, False: 18.1k]
  ------------------
  600|  4.38k|            return pos.towards_oh(
  601|  4.38k|                this_t{}, idx, offset, e, &node->inner()[offset]);
  602|  18.1k|        } else {
  603|  18.1k|            auto new_node = node_t::copy_inner_sr_e(e, node, count);
  604|  18.1k|            IMMER_TRY {
  ------------------
  |  |   49|  18.1k|#define IMMER_TRY try
  ------------------
  605|  18.1k|                auto& res = pos.towards_oh(
  606|  18.1k|                    this_t{}, idx, offset, e, &new_node->inner()[offset]);
  607|  18.1k|                pos.visit(dec_visitor{});
  608|  18.1k|                *location = new_node;
  609|  18.1k|                return res;
  610|  18.1k|            }
  611|  18.1k|            IMMER_CATCH (...) {
  612|      0|                dec_relaxed(new_node, pos.shift());
  613|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  614|      0|            }
  615|  18.1k|        }
  616|  22.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.26k|    {
  653|  3.26k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 3.26k, False: 0]
  ------------------
  654|  3.26k|        auto node = pos.node();
  655|  3.26k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 687, False: 2.58k]
  ------------------
  656|    687|            return node->leaf()[pos.index(idx)];
  657|  2.58k|        } else {
  658|  2.58k|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|  2.58k|            pos.visit(dec_visitor{});
  660|  2.58k|            *location = new_node;
  661|  2.58k|            return new_node->leaf()[pos.index(idx)];
  662|  2.58k|        }
  663|  3.26k|    }
_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.24k|    {
  622|  7.24k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 7.24k, False: 0]
  ------------------
  623|  7.24k|        auto offset = pos.index(idx);
  624|  7.24k|        auto count  = pos.count();
  625|  7.24k|        auto node   = pos.node();
  626|  7.24k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 2.46k, False: 4.78k]
  ------------------
  627|  2.46k|            return pos.towards_oh_ch(
  628|  2.46k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  4.78k|        } else {
  630|  4.78k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  4.78k|            IMMER_TRY {
  ------------------
  |  |   49|  4.78k|#define IMMER_TRY try
  ------------------
  632|  4.78k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  4.78k|                                              idx,
  634|  4.78k|                                              offset,
  635|  4.78k|                                              count,
  636|  4.78k|                                              e,
  637|  4.78k|                                              &new_node->inner()[offset]);
  638|  4.78k|                pos.visit(dec_visitor{});
  639|  4.78k|                *location = new_node;
  640|  4.78k|                return res;
  641|  4.78k|            }
  642|  4.78k|            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.78k|        }
  647|  7.24k|    }
_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|  5.93k|    {
  653|  5.93k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 5.93k, False: 0]
  ------------------
  654|  5.93k|        auto node = pos.node();
  655|  5.93k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 1.29k, False: 4.64k]
  ------------------
  656|  1.29k|            return node->leaf()[pos.index(idx)];
  657|  4.64k|        } else {
  658|  4.64k|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|  4.64k|            pos.visit(dec_visitor{});
  660|  4.64k|            *location = new_node;
  661|  4.64k|            return new_node->leaf()[pos.index(idx)];
  662|  4.64k|        }
  663|  5.93k|    }
_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|  7.35k|    {
  622|  7.35k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 7.35k, False: 0]
  ------------------
  623|  7.35k|        auto offset = pos.index(idx);
  624|  7.35k|        auto count  = pos.count();
  625|  7.35k|        auto node   = pos.node();
  626|  7.35k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 1.18k, False: 6.17k]
  ------------------
  627|  1.18k|            return pos.towards_oh_ch(
  628|  1.18k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  6.17k|        } else {
  630|  6.17k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  6.17k|            IMMER_TRY {
  ------------------
  |  |   49|  6.17k|#define IMMER_TRY try
  ------------------
  632|  6.17k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  6.17k|                                              idx,
  634|  6.17k|                                              offset,
  635|  6.17k|                                              count,
  636|  6.17k|                                              e,
  637|  6.17k|                                              &new_node->inner()[offset]);
  638|  6.17k|                pos.visit(dec_visitor{});
  639|  6.17k|                *location = new_node;
  640|  6.17k|                return res;
  641|  6.17k|            }
  642|  6.17k|            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|  6.17k|        }
  647|  7.35k|    }
_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.31k|    {
  653|  1.31k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 1.31k, False: 0]
  ------------------
  654|  1.31k|        auto node = pos.node();
  655|  1.31k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 876, False: 436]
  ------------------
  656|    876|            return node->leaf()[pos.index(idx)];
  657|    876|        } else {
  658|    436|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|    436|            pos.visit(dec_visitor{});
  660|    436|            *location = new_node;
  661|    436|            return new_node->leaf()[pos.index(idx)];
  662|    436|        }
  663|  1.31k|    }
_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|  2.52k|    {
  622|  2.52k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 2.52k, False: 0]
  ------------------
  623|  2.52k|        auto offset = pos.index(idx);
  624|  2.52k|        auto count  = pos.count();
  625|  2.52k|        auto node   = pos.node();
  626|  2.52k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 1.43k, False: 1.09k]
  ------------------
  627|  1.43k|            return pos.towards_oh_ch(
  628|  1.43k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  1.43k|        } else {
  630|  1.09k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  1.09k|            IMMER_TRY {
  ------------------
  |  |   49|  1.09k|#define IMMER_TRY try
  ------------------
  632|  1.09k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  1.09k|                                              idx,
  634|  1.09k|                                              offset,
  635|  1.09k|                                              count,
  636|  1.09k|                                              e,
  637|  1.09k|                                              &new_node->inner()[offset]);
  638|  1.09k|                pos.visit(dec_visitor{});
  639|  1.09k|                *location = new_node;
  640|  1.09k|                return res;
  641|  1.09k|            }
  642|  1.09k|            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.09k|        }
  647|  2.52k|    }
_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|  52.2k|    {
  914|  52.2k|        auto idx    = pos.index(last);
  915|  52.2k|        auto node   = pos.node();
  916|  52.2k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [True: 52.2k, Folded]
  |  Branch (916:35): [True: 44.2k, False: 7.91k]
  ------------------
  917|  52.2k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [True: 52.2k, Folded]
  |  Branch (917:25): [True: 40.3k, False: 11.8k]
  ------------------
  918|  40.3k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 34.9k, False: 5.35k]
  ------------------
  919|  40.3k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|  40.3k|            if (Mutating)
  ------------------
  |  Branch (920:17): [True: 40.3k, Folded]
  ------------------
  921|  40.3k|                pos.visit(dec_right_visitor{}, count_t{1});
  922|  40.3k|            return res;
  923|  40.3k|        } else {
  924|  11.8k|            using std::get;
  925|  11.8k|            auto subs =
  926|  11.8k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 9.32k, False: 2.55k]
  ------------------
  927|  11.8k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  11.8k|            auto next = get<1>(subs);
  929|  11.8k|            auto ts   = get<2>(subs);
  930|  11.8k|            auto tail = get<3>(subs);
  931|  11.8k|            IMMER_TRY {
  ------------------
  |  |   49|  11.8k|#define IMMER_TRY try
  ------------------
  932|  11.8k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 8.92k, False: 2.96k]
  ------------------
  933|  8.92k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 6.97k, False: 1.95k]
  ------------------
  934|  6.97k|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|  6.97k|                        pos.each_right(dec_visitor{}, idx + 1);
  936|  6.97k|                        node->inner()[idx] = next;
  937|  6.97k|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|  6.97k|                        nodr->d.count      = idx + 1;
  939|  6.97k|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 6.97k, False: 0]
  ------------------
  940|  6.97k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  6.97k|                    } else {
  942|  1.95k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  1.95k|                        auto newr = newn->relaxed();
  944|  1.95k|                        newn->inner()[idx] = next;
  945|  1.95k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  1.95k|                        newr->d.count      = idx + 1;
  947|  1.95k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 1.95k, False: 0]
  ------------------
  948|  1.95k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [True: 1.95k, Folded]
  ------------------
  949|  1.95k|                            pos.visit(dec_visitor{});
  950|  1.95k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  1.95k|                    }
  952|  8.92k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 0, False: 2.96k]
  ------------------
  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|  2.96k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [True: 2.96k, Folded]
  |  Branch (956:40): [True: 1.96k, False: 997]
  |  Branch (956:52): [True: 1.18k, False: 781]
  ------------------
  957|  1.18k|                    auto newn = pos.node()->inner()[0];
  958|  1.18k|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 123, False: 1.06k]
  ------------------
  959|    123|                        newn->inc();
  960|  1.18k|                    if (Mutating)
  ------------------
  |  Branch (960:25): [True: 1.18k, Folded]
  ------------------
  961|  1.18k|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|  1.18k|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|  1.77k|                } else {
  964|  1.77k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 1.29k, False: 484]
  ------------------
  965|  1.29k|                        pos.each_right(dec_visitor{}, idx + 1);
  966|  1.29k|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|  1.29k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  1.29k|                    } else {
  969|    484|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    484|                        if (Mutating)
  ------------------
  |  Branch (970:29): [True: 484, Folded]
  ------------------
  971|    484|                            pos.visit(dec_visitor{});
  972|    484|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    484|                    }
  974|  1.77k|                }
  975|  11.8k|            }
  976|  11.8k|            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.8k|        }
  987|  52.2k|    }
_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.18k|    {
 1060|  2.18k|        auto old_tail_size = pos.count();
 1061|  2.18k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.18k|        auto node          = pos.node();
 1063|  2.18k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.18k, Folded]
  |  Branch (1063:42): [True: 1.53k, False: 647]
  ------------------
 1064|  2.18k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.60k, False: 577]
  ------------------
 1065|  1.60k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.60k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.60k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.60k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 280, False: 297]
  ------------------
 1069|    280|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    280|                              old_tail_size - new_tail_size);
 1071|    280|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    297|        } else {
 1073|    297|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    297|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 297, Folded]
  ------------------
 1075|    297|                pos.visit(dec_visitor{});
 1076|    297|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    297|        }
 1078|  2.18k|    }
_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.09k|    {
 1060|  1.09k|        auto old_tail_size = pos.count();
 1061|  1.09k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.09k|        auto node          = pos.node();
 1063|  1.09k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 1.09k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  1.09k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 289, False: 808]
  ------------------
 1065|    289|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 289, Folded]
  ------------------
 1066|    289|                node->inc();
 1067|    289|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    808|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 808]
  ------------------
 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|    808|        } else {
 1073|    808|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    808|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 808]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    808|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    808|        }
 1078|  1.09k|    }
_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|  17.7k|    {
  914|  17.7k|        auto idx    = pos.index(last);
  915|  17.7k|        auto node   = pos.node();
  916|  17.7k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [Folded, False: 17.7k]
  |  Branch (916:35): [True: 0, False: 0]
  ------------------
  917|  17.7k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [True: 17.7k, Folded]
  |  Branch (917:25): [True: 14.7k, False: 2.99k]
  ------------------
  918|  14.7k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 0, False: 14.7k]
  ------------------
  919|  14.7k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|  14.7k|            if (Mutating)
  ------------------
  |  Branch (920:17): [Folded, False: 14.7k]
  ------------------
  921|      0|                pos.visit(dec_right_visitor{}, count_t{1});
  922|  14.7k|            return res;
  923|  14.7k|        } else {
  924|  2.99k|            using std::get;
  925|  2.99k|            auto subs =
  926|  2.99k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 0, False: 2.99k]
  ------------------
  927|  2.99k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  2.99k|            auto next = get<1>(subs);
  929|  2.99k|            auto ts   = get<2>(subs);
  930|  2.99k|            auto tail = get<3>(subs);
  931|  2.99k|            IMMER_TRY {
  ------------------
  |  |   49|  2.99k|#define IMMER_TRY try
  ------------------
  932|  2.99k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 1.54k, False: 1.44k]
  ------------------
  933|  1.54k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 0, False: 1.54k]
  ------------------
  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.54k|                    } else {
  942|  1.54k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  1.54k|                        auto newr = newn->relaxed();
  944|  1.54k|                        newn->inner()[idx] = next;
  945|  1.54k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  1.54k|                        newr->d.count      = idx + 1;
  947|  1.54k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 1.54k, False: 0]
  ------------------
  948|  1.54k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [Folded, False: 1.54k]
  ------------------
  949|      0|                            pos.visit(dec_visitor{});
  950|  1.54k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  1.54k|                    }
  952|  1.54k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 0, False: 1.44k]
  ------------------
  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|  1.44k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [True: 1.44k, Folded]
  |  Branch (956:40): [True: 883, False: 559]
  |  Branch (956:52): [True: 473, False: 410]
  ------------------
  957|    473|                    auto newn = pos.node()->inner()[0];
  958|    473|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 473, False: 0]
  ------------------
  959|    473|                        newn->inc();
  960|    473|                    if (Mutating)
  ------------------
  |  Branch (960:25): [Folded, False: 473]
  ------------------
  961|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|    473|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|    969|                } else {
  964|    969|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 0, False: 969]
  ------------------
  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|    969|                    } else {
  969|    969|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    969|                        if (Mutating)
  ------------------
  |  Branch (970:29): [Folded, False: 969]
  ------------------
  971|      0|                            pos.visit(dec_visitor{});
  972|    969|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    969|                    }
  974|    969|                }
  975|  2.99k|            }
  976|  2.99k|            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|  2.99k|        }
  987|  17.7k|    }
_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.27k|    {
  992|  1.27k|        auto idx    = pos.index(last);
  993|  1.27k|        auto node   = pos.node();
  994|  1.27k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 1.27k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  1.27k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 1.27k, Folded]
  |  Branch (995:25): [True: 424, False: 846]
  ------------------
  996|    424|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 424]
  ------------------
  997|    424|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|    424|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 424]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|    424|            return res;
 1001|    846|        } else {
 1002|    846|            using std::get;
 1003|    846|            auto subs =
 1004|    846|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 846]
  ------------------
 1005|    846|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|    846|            auto next = get<1>(subs);
 1007|    846|            auto ts   = get<2>(subs);
 1008|    846|            auto tail = get<3>(subs);
 1009|    846|            IMMER_TRY {
  ------------------
  |  |   49|    846|#define IMMER_TRY try
  ------------------
 1010|    846|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 221, False: 625]
  ------------------
 1011|    221|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 221]
  ------------------
 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|    221|                    } 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): [Folded, False: 221]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    221|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    221|                    }
 1022|    625|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 625]
  ------------------
 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|    625|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 625, Folded]
  |  Branch (1026:40): [True: 390, False: 235]
  |  Branch (1026:52): [True: 194, False: 196]
  ------------------
 1027|    194|                    auto newn = pos.node()->inner()[0];
 1028|    194|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 194, False: 0]
  ------------------
 1029|    194|                        newn->inc();
 1030|    194|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 194]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    194|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    431|                } else {
 1034|    431|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 431]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    431|                    } else {
 1038|    431|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    431|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 431]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    431|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    431|                    }
 1043|    431|                }
 1044|    846|            }
 1045|    846|            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|    846|        }
 1055|  1.27k|    }
_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: 640, False: 861]
  ------------------
 1065|    640|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 640, Folded]
  ------------------
 1066|    640|                node->inc();
 1067|    640|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    861|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 861]
  ------------------
 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|    861|        } else {
 1073|    861|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    861|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 861]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    861|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    861|        }
 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|  3.49k|    {
  992|  3.49k|        auto idx    = pos.index(last);
  993|  3.49k|        auto node   = pos.node();
  994|  3.49k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 3.49k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  3.49k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 3.49k, Folded]
  |  Branch (995:25): [True: 1.77k, False: 1.72k]
  ------------------
  996|  1.77k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 1.77k]
  ------------------
  997|  1.77k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  1.77k|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 1.77k]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  1.77k|            return res;
 1001|  1.77k|        } else {
 1002|  1.72k|            using std::get;
 1003|  1.72k|            auto subs =
 1004|  1.72k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 1.72k]
  ------------------
 1005|  1.72k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.72k|            auto next = get<1>(subs);
 1007|  1.72k|            auto ts   = get<2>(subs);
 1008|  1.72k|            auto tail = get<3>(subs);
 1009|  1.72k|            IMMER_TRY {
  ------------------
  |  |   49|  1.72k|#define IMMER_TRY try
  ------------------
 1010|  1.72k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 771, False: 950]
  ------------------
 1011|    771|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 771]
  ------------------
 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|    771|                    } else {
 1016|    771|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    771|                        newn->inner()[idx] = next;
 1018|    771|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 771]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    771|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    771|                    }
 1022|    950|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 950]
  ------------------
 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|    950|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 950, Folded]
  |  Branch (1026:40): [True: 708, False: 242]
  |  Branch (1026:52): [True: 260, False: 448]
  ------------------
 1027|    260|                    auto newn = pos.node()->inner()[0];
 1028|    260|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 260, False: 0]
  ------------------
 1029|    260|                        newn->inc();
 1030|    260|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 260]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    260|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    690|                } else {
 1034|    690|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 690]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    690|                    } else {
 1038|    690|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    690|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 690]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    690|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    690|                    }
 1043|    690|                }
 1044|  1.72k|            }
 1045|  1.72k|            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.72k|        }
 1055|  3.49k|    }
_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.29k, False: 1.48k]
  ------------------
 1064|  2.78k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.11k, False: 1.66k]
  ------------------
 1065|  1.11k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.11k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.11k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.66k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 868, False: 794]
  ------------------
 1069|    868|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    868|                              old_tail_size - new_tail_size);
 1071|    868|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    868|        } else {
 1073|    794|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    794|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 794, Folded]
  ------------------
 1075|    794|                pos.visit(dec_visitor{});
 1076|    794|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    794|        }
 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.32k|    {
  992|  3.32k|        auto idx    = pos.index(last);
  993|  3.32k|        auto node   = pos.node();
  994|  3.32k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 3.32k, Folded]
  |  Branch (994:35): [True: 1.08k, False: 2.23k]
  ------------------
  995|  3.32k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 3.32k]
  |  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.32k|        } else {
 1002|  3.32k|            using std::get;
 1003|  3.32k|            auto subs =
 1004|  3.32k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 1.08k, False: 2.23k]
  ------------------
 1005|  3.32k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  3.32k|            auto next = get<1>(subs);
 1007|  3.32k|            auto ts   = get<2>(subs);
 1008|  3.32k|            auto tail = get<3>(subs);
 1009|  3.32k|            IMMER_TRY {
  ------------------
  |  |   49|  3.32k|#define IMMER_TRY try
  ------------------
 1010|  3.32k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 838, False: 2.48k]
  ------------------
 1011|    838|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 411, False: 427]
  ------------------
 1012|    411|                        node->inner()[idx] = next;
 1013|    411|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    411|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    427|                    } else {
 1016|    427|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    427|                        newn->inner()[idx] = next;
 1018|    427|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 427, Folded]
  ------------------
 1019|    427|                            pos.visit(dec_visitor{});
 1020|    427|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    427|                    }
 1022|  2.48k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 349, False: 2.13k]
  ------------------
 1023|    349|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 349, Folded]
  ------------------
 1024|    349|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    349|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  2.13k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 2.13k]
  |  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.13k|                } else {
 1034|  2.13k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 647, False: 1.49k]
  ------------------
 1035|    647|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    647|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  1.49k|                    } else {
 1038|  1.49k|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|  1.49k|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 1.49k, Folded]
  ------------------
 1040|  1.49k|                            pos.visit(dec_visitor{});
 1041|  1.49k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|  1.49k|                    }
 1043|  2.13k|                }
 1044|  3.32k|            }
 1045|  3.32k|            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.32k|        }
 1055|  3.32k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  878|  2.39k|    {
  879|  2.39k|        using node_t = node_type<Pos>;
  880|  2.39k|        auto node    = p.node();
  881|  2.39k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 2.39k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  2.39k|    }
_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.85k|    {
 1060|  8.85k|        auto old_tail_size = pos.count();
 1061|  8.85k|        auto new_tail_size = pos.index(last) + 1;
 1062|  8.85k|        auto node          = pos.node();
 1063|  8.85k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 8.85k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  8.85k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 3.59k, False: 5.26k]
  ------------------
 1065|  3.59k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 3.59k, Folded]
  ------------------
 1066|  3.59k|                node->inc();
 1067|  3.59k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  5.26k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 5.26k]
  ------------------
 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|  5.26k|        } else {
 1073|  5.26k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  5.26k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 5.26k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  5.26k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  5.26k|        }
 1078|  8.85k|    }
_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|  5.39k|    {
  992|  5.39k|        auto idx    = pos.index(last);
  993|  5.39k|        auto node   = pos.node();
  994|  5.39k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 5.39k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  5.39k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 5.39k]
  |  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|  5.39k|        } else {
 1002|  5.39k|            using std::get;
 1003|  5.39k|            auto subs =
 1004|  5.39k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 5.39k]
  ------------------
 1005|  5.39k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  5.39k|            auto next = get<1>(subs);
 1007|  5.39k|            auto ts   = get<2>(subs);
 1008|  5.39k|            auto tail = get<3>(subs);
 1009|  5.39k|            IMMER_TRY {
  ------------------
  |  |   49|  5.39k|#define IMMER_TRY try
  ------------------
 1010|  5.39k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 1.08k, False: 4.30k]
  ------------------
 1011|  1.08k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 1.08k]
  ------------------
 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.08k|                    } else {
 1016|  1.08k|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|  1.08k|                        newn->inner()[idx] = next;
 1018|  1.08k|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 1.08k]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|  1.08k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|  1.08k|                    }
 1022|  4.30k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.09k, False: 3.20k]
  ------------------
 1023|  1.09k|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 1.09k]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|  1.09k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  3.20k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 3.20k]
  |  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|  3.20k|                } else {
 1034|  3.20k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 3.20k]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  3.20k|                    } else {
 1038|  3.20k|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|  3.20k|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 3.20k]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|  3.20k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|  3.20k|                    }
 1043|  3.20k|                }
 1044|  5.39k|            }
 1045|  5.39k|            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|  5.39k|        }
 1055|  5.39k|    }
_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|    764|    {
 1060|    764|        auto old_tail_size = pos.count();
 1061|    764|        auto new_tail_size = pos.index(last) + 1;
 1062|    764|        auto node          = pos.node();
 1063|    764|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 764]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|    764|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 321, False: 443]
  ------------------
 1065|    321|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 321, Folded]
  ------------------
 1066|    321|                node->inc();
 1067|    321|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    443|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 443]
  ------------------
 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|    443|        } else {
 1073|    443|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    443|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 443]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    443|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    443|        }
 1078|    764|    }
_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.66k|    {
 1060|  2.66k|        auto old_tail_size = pos.count();
 1061|  2.66k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.66k|        auto node          = pos.node();
 1063|  2.66k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.66k, Folded]
  |  Branch (1063:42): [True: 962, False: 1.70k]
  ------------------
 1064|  2.66k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.74k, False: 917]
  ------------------
 1065|  1.74k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.74k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.74k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.74k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 445, False: 472]
  ------------------
 1069|    445|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    445|                              old_tail_size - new_tail_size);
 1071|    445|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    472|        } else {
 1073|    472|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    472|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 472, Folded]
  ------------------
 1075|    472|                pos.visit(dec_visitor{});
 1076|    472|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    472|        }
 1078|  2.66k|    }
_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.64k|    {
  992|  4.64k|        auto idx    = pos.index(last);
  993|  4.64k|        auto node   = pos.node();
  994|  4.64k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 4.64k, Folded]
  |  Branch (994:35): [True: 4.09k, False: 545]
  ------------------
  995|  4.64k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 4.64k]
  |  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.64k|        } else {
 1002|  4.64k|            using std::get;
 1003|  4.64k|            auto subs =
 1004|  4.64k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 4.09k, False: 545]
  ------------------
 1005|  4.64k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  4.64k|            auto next = get<1>(subs);
 1007|  4.64k|            auto ts   = get<2>(subs);
 1008|  4.64k|            auto tail = get<3>(subs);
 1009|  4.64k|            IMMER_TRY {
  ------------------
  |  |   49|  4.64k|#define IMMER_TRY try
  ------------------
 1010|  4.64k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 1.81k, False: 2.82k]
  ------------------
 1011|  1.81k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 1.56k, False: 246]
  ------------------
 1012|  1.56k|                        node->inner()[idx] = next;
 1013|  1.56k|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|  1.56k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|  1.56k|                    } else {
 1016|    246|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    246|                        newn->inner()[idx] = next;
 1018|    246|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 246, Folded]
  ------------------
 1019|    246|                            pos.visit(dec_visitor{});
 1020|    246|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    246|                    }
 1022|  2.82k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.05k, False: 1.77k]
  ------------------
 1023|  1.05k|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 1.05k, Folded]
  ------------------
 1024|  1.05k|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|  1.05k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.77k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 1.77k]
  |  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.77k|                } else {
 1034|  1.77k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 1.54k, False: 232]
  ------------------
 1035|  1.54k|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|  1.54k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  1.54k|                    } else {
 1038|    232|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    232|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 232, Folded]
  ------------------
 1040|    232|                            pos.visit(dec_visitor{});
 1041|    232|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    232|                    }
 1043|  1.77k|                }
 1044|  4.64k|            }
 1045|  4.64k|            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.64k|        }
 1055|  4.64k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  878|  1.05k|    {
  879|  1.05k|        using node_t = node_type<Pos>;
  880|  1.05k|        auto node    = p.node();
  881|  1.05k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 1.05k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  1.05k|    }
_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.94k|    {
 1060|  2.94k|        auto old_tail_size = pos.count();
 1061|  2.94k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.94k|        auto node          = pos.node();
 1063|  2.94k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 2.94k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  2.94k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.10k, False: 1.83k]
  ------------------
 1065|  1.10k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 1.10k, Folded]
  ------------------
 1066|  1.10k|                node->inc();
 1067|  1.10k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.83k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 1.83k]
  ------------------
 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.83k|        } else {
 1073|  1.83k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  1.83k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 1.83k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  1.83k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  1.83k|        }
 1078|  2.94k|    }
_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.72k|    {
  992|  2.72k|        auto idx    = pos.index(last);
  993|  2.72k|        auto node   = pos.node();
  994|  2.72k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 2.72k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  2.72k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 2.72k]
  |  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.72k|        } else {
 1002|  2.72k|            using std::get;
 1003|  2.72k|            auto subs =
 1004|  2.72k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 2.72k]
  ------------------
 1005|  2.72k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  2.72k|            auto next = get<1>(subs);
 1007|  2.72k|            auto ts   = get<2>(subs);
 1008|  2.72k|            auto tail = get<3>(subs);
 1009|  2.72k|            IMMER_TRY {
  ------------------
  |  |   49|  2.72k|#define IMMER_TRY try
  ------------------
 1010|  2.72k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 787, False: 1.93k]
  ------------------
 1011|    787|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 787]
  ------------------
 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|    787|                    } else {
 1016|    787|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    787|                        newn->inner()[idx] = next;
 1018|    787|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 787]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    787|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    787|                    }
 1022|  1.93k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.03k, False: 899]
  ------------------
 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: 899]
  |  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|    899|                } else {
 1034|    899|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 899]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    899|                    } else {
 1038|    899|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    899|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 899]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    899|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    899|                    }
 1043|    899|                }
 1044|  2.72k|            }
 1045|  2.72k|            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.72k|        }
 1055|  2.72k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  867|  42.8k|    {
  868|  42.8k|        using node_t = node_type<Pos>;
  869|  42.8k|        auto node    = p.node();
  870|  42.8k|        if (node->dec()) {
  ------------------
  |  Branch (870:13): [True: 0, False: 42.8k]
  ------------------
  871|      0|            p.each_right(dec_t{}, idx);
  872|      0|            node_t::delete_inner_r(node, p.count());
  873|      0|        }
  874|  42.8k|    }
_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.55k|    {
 1060|  4.55k|        auto old_tail_size = pos.count();
 1061|  4.55k|        auto new_tail_size = pos.index(last) + 1;
 1062|  4.55k|        auto node          = pos.node();
 1063|  4.55k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 4.55k, Folded]
  |  Branch (1063:42): [True: 2.04k, False: 2.51k]
  ------------------
 1064|  4.55k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 2.65k, False: 1.89k]
  ------------------
 1065|  2.65k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 2.65k]
  ------------------
 1066|      0|                node->inc();
 1067|  2.65k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  2.65k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 1.02k, False: 878]
  ------------------
 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|    878|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    878|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 878, Folded]
  ------------------
 1075|    878|                pos.visit(dec_visitor{});
 1076|    878|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    878|        }
 1078|  4.55k|    }
_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.1k|    {
  914|  11.1k|        auto idx    = pos.index(last);
  915|  11.1k|        auto node   = pos.node();
  916|  11.1k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [True: 11.1k, Folded]
  |  Branch (916:35): [True: 9.50k, False: 1.68k]
  ------------------
  917|  11.1k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [Folded, False: 11.1k]
  |  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.1k|        } else {
  924|  11.1k|            using std::get;
  925|  11.1k|            auto subs =
  926|  11.1k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 9.50k, False: 1.68k]
  ------------------
  927|  11.1k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  11.1k|            auto next = get<1>(subs);
  929|  11.1k|            auto ts   = get<2>(subs);
  930|  11.1k|            auto tail = get<3>(subs);
  931|  11.1k|            IMMER_TRY {
  ------------------
  |  |   49|  11.1k|#define IMMER_TRY try
  ------------------
  932|  11.1k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 6.17k, False: 5.01k]
  ------------------
  933|  6.17k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 5.29k, False: 880]
  ------------------
  934|  5.29k|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|  5.29k|                        pos.each_right(dec_visitor{}, idx + 1);
  936|  5.29k|                        node->inner()[idx] = next;
  937|  5.29k|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|  5.29k|                        nodr->d.count      = idx + 1;
  939|  5.29k|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 5.29k, False: 0]
  ------------------
  940|  5.29k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  5.29k|                    } else {
  942|    880|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|    880|                        auto newr = newn->relaxed();
  944|    880|                        newn->inner()[idx] = next;
  945|    880|                        newr->d.sizes[idx] = last + 1 - ts;
  946|    880|                        newr->d.count      = idx + 1;
  947|    880|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 880, False: 0]
  ------------------
  948|    880|                        if (Mutating)
  ------------------
  |  Branch (948:29): [True: 880, Folded]
  ------------------
  949|    880|                            pos.visit(dec_visitor{});
  950|    880|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|    880|                    }
  952|  6.17k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 1.29k, False: 3.71k]
  ------------------
  953|  1.29k|                    if (Mutating)
  ------------------
  |  Branch (953:25): [True: 1.29k, Folded]
  ------------------
  954|  1.29k|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|  1.29k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  3.71k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [Folded, False: 3.71k]
  |  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.71k|                } else {
  964|  3.71k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 3.09k, False: 619]
  ------------------
  965|  3.09k|                        pos.each_right(dec_visitor{}, idx + 1);
  966|  3.09k|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|  3.09k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  3.09k|                    } else {
  969|    619|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    619|                        if (Mutating)
  ------------------
  |  Branch (970:29): [True: 619, Folded]
  ------------------
  971|    619|                            pos.visit(dec_visitor{});
  972|    619|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    619|                    }
  974|  3.71k|                }
  975|  11.1k|            }
  976|  11.1k|            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.1k|        }
  987|  11.1k|    }
_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.09k|    {
  992|  3.09k|        auto idx    = pos.index(last);
  993|  3.09k|        auto node   = pos.node();
  994|  3.09k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 3.09k, Folded]
  |  Branch (994:35): [True: 1.94k, False: 1.14k]
  ------------------
  995|  3.09k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 3.09k]
  |  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.09k|        } else {
 1002|  3.09k|            using std::get;
 1003|  3.09k|            auto subs =
 1004|  3.09k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 1.94k, False: 1.14k]
  ------------------
 1005|  3.09k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  3.09k|            auto next = get<1>(subs);
 1007|  3.09k|            auto ts   = get<2>(subs);
 1008|  3.09k|            auto tail = get<3>(subs);
 1009|  3.09k|            IMMER_TRY {
  ------------------
  |  |   49|  3.09k|#define IMMER_TRY try
  ------------------
 1010|  3.09k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 1.38k, False: 1.70k]
  ------------------
 1011|  1.38k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 925, False: 456]
  ------------------
 1012|    925|                        node->inner()[idx] = next;
 1013|    925|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    925|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    925|                    } else {
 1016|    456|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    456|                        newn->inner()[idx] = next;
 1018|    456|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 456, Folded]
  ------------------
 1019|    456|                            pos.visit(dec_visitor{});
 1020|    456|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    456|                    }
 1022|  1.70k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 714, False: 995]
  ------------------
 1023|    714|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 714, Folded]
  ------------------
 1024|    714|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    714|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|    995|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 995]
  |  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|    995|                } else {
 1034|    995|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 355, False: 640]
  ------------------
 1035|    355|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    355|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    640|                    } else {
 1038|    640|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    640|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 640, Folded]
  ------------------
 1040|    640|                            pos.visit(dec_visitor{});
 1041|    640|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    640|                    }
 1043|    995|                }
 1044|  3.09k|            }
 1045|  3.09k|            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.09k|        }
 1055|  3.09k|    }
_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.86k|    {
  879|  9.86k|        using node_t = node_type<Pos>;
  880|  9.86k|        auto node    = p.node();
  881|  9.86k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 9.86k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  9.86k|    }
_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|  5.42k|    {
 1060|  5.42k|        auto old_tail_size = pos.count();
 1061|  5.42k|        auto new_tail_size = pos.index(last) + 1;
 1062|  5.42k|        auto node          = pos.node();
 1063|  5.42k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 5.42k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  5.42k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.75k, False: 3.67k]
  ------------------
 1065|  1.75k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 1.75k, Folded]
  ------------------
 1066|  1.75k|                node->inc();
 1067|  1.75k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  3.67k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 3.67k]
  ------------------
 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|  3.67k|        } else {
 1073|  3.67k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  3.67k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 3.67k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  3.67k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  3.67k|        }
 1078|  5.42k|    }
_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|  7.66k|    {
  914|  7.66k|        auto idx    = pos.index(last);
  915|  7.66k|        auto node   = pos.node();
  916|  7.66k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [Folded, False: 7.66k]
  |  Branch (916:35): [True: 0, False: 0]
  ------------------
  917|  7.66k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [Folded, False: 7.66k]
  |  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|  7.66k|        } else {
  924|  7.66k|            using std::get;
  925|  7.66k|            auto subs =
  926|  7.66k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 0, False: 7.66k]
  ------------------
  927|  7.66k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  7.66k|            auto next = get<1>(subs);
  929|  7.66k|            auto ts   = get<2>(subs);
  930|  7.66k|            auto tail = get<3>(subs);
  931|  7.66k|            IMMER_TRY {
  ------------------
  |  |   49|  7.66k|#define IMMER_TRY try
  ------------------
  932|  7.66k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 3.17k, False: 4.49k]
  ------------------
  933|  3.17k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 0, False: 3.17k]
  ------------------
  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.17k|                    } else {
  942|  3.17k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  3.17k|                        auto newr = newn->relaxed();
  944|  3.17k|                        newn->inner()[idx] = next;
  945|  3.17k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  3.17k|                        newr->d.count      = idx + 1;
  947|  3.17k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 3.17k, False: 0]
  ------------------
  948|  3.17k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [Folded, False: 3.17k]
  ------------------
  949|      0|                            pos.visit(dec_visitor{});
  950|  3.17k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  3.17k|                    }
  952|  4.49k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 1.49k, False: 2.99k]
  ------------------
  953|  1.49k|                    if (Mutating)
  ------------------
  |  Branch (953:25): [Folded, False: 1.49k]
  ------------------
  954|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|  1.49k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  2.99k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [Folded, False: 2.99k]
  |  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|  2.99k|                } else {
  964|  2.99k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 0, False: 2.99k]
  ------------------
  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|  2.99k|                    } else {
  969|  2.99k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|  2.99k|                        if (Mutating)
  ------------------
  |  Branch (970:29): [Folded, False: 2.99k]
  ------------------
  971|      0|                            pos.visit(dec_visitor{});
  972|  2.99k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|  2.99k|                    }
  974|  2.99k|                }
  975|  7.66k|            }
  976|  7.66k|            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|  7.66k|        }
  987|  7.66k|    }
_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.80k|    {
  992|  1.80k|        auto idx    = pos.index(last);
  993|  1.80k|        auto node   = pos.node();
  994|  1.80k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 1.80k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  1.80k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 1.80k]
  |  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.80k|        } else {
 1002|  1.80k|            using std::get;
 1003|  1.80k|            auto subs =
 1004|  1.80k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 1.80k]
  ------------------
 1005|  1.80k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.80k|            auto next = get<1>(subs);
 1007|  1.80k|            auto ts   = get<2>(subs);
 1008|  1.80k|            auto tail = get<3>(subs);
 1009|  1.80k|            IMMER_TRY {
  ------------------
  |  |   49|  1.80k|#define IMMER_TRY try
  ------------------
 1010|  1.80k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 742, False: 1.05k]
  ------------------
 1011|    742|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 742]
  ------------------
 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|    742|                    } else {
 1016|    742|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    742|                        newn->inner()[idx] = next;
 1018|    742|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 742]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    742|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    742|                    }
 1022|  1.05k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 417, False: 642]
  ------------------
 1023|    417|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 417]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    417|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|    642|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 642]
  |  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|    642|                } else {
 1034|    642|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 642]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    642|                    } else {
 1038|    642|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    642|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 642]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    642|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    642|                    }
 1043|    642|                }
 1044|  1.80k|            }
 1045|  1.80k|            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.80k|        }
 1055|  1.80k|    }
_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|  15.4k|    {
  992|  15.4k|        auto idx    = pos.index(last);
  993|  15.4k|        auto node   = pos.node();
  994|  15.4k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 15.4k, Folded]
  |  Branch (994:35): [True: 9.65k, False: 5.78k]
  ------------------
  995|  15.4k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 15.4k, Folded]
  |  Branch (995:25): [True: 7.16k, False: 8.28k]
  ------------------
  996|  7.16k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 4.23k, False: 2.93k]
  ------------------
  997|  7.16k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  7.16k|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 7.16k, Folded]
  ------------------
  999|  7.16k|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  7.16k|            return res;
 1001|  8.28k|        } else {
 1002|  8.28k|            using std::get;
 1003|  8.28k|            auto subs =
 1004|  8.28k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 5.42k, False: 2.85k]
  ------------------
 1005|  8.28k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  8.28k|            auto next = get<1>(subs);
 1007|  8.28k|            auto ts   = get<2>(subs);
 1008|  8.28k|            auto tail = get<3>(subs);
 1009|  8.28k|            IMMER_TRY {
  ------------------
  |  |   49|  8.28k|#define IMMER_TRY try
  ------------------
 1010|  8.28k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 4.28k, False: 3.99k]
  ------------------
 1011|  4.28k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 3.27k, False: 1.01k]
  ------------------
 1012|  3.27k|                        node->inner()[idx] = next;
 1013|  3.27k|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|  3.27k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|  3.27k|                    } else {
 1016|  1.01k|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|  1.01k|                        newn->inner()[idx] = next;
 1018|  1.01k|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 1.01k, Folded]
  ------------------
 1019|  1.01k|                            pos.visit(dec_visitor{});
 1020|  1.01k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|  1.01k|                    }
 1022|  4.28k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 3.99k]
  ------------------
 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.99k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 3.99k, Folded]
  |  Branch (1026:40): [True: 3.41k, False: 579]
  |  Branch (1026:52): [True: 1.99k, False: 1.42k]
  ------------------
 1027|  1.99k|                    auto newn = pos.node()->inner()[0];
 1028|  1.99k|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 924, False: 1.06k]
  ------------------
 1029|    924|                        newn->inc();
 1030|  1.99k|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 1.99k, Folded]
  ------------------
 1031|  1.99k|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|  1.99k|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  2.00k|                } else {
 1034|  2.00k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 1.08k, False: 917]
  ------------------
 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|    917|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    917|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 917, Folded]
  ------------------
 1040|    917|                            pos.visit(dec_visitor{});
 1041|    917|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    917|                    }
 1043|  2.00k|                }
 1044|  8.28k|            }
 1045|  8.28k|            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|  8.28k|        }
 1055|  15.4k|    }
_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.38k|    {
 1060|  1.38k|        auto old_tail_size = pos.count();
 1061|  1.38k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.38k|        auto node          = pos.node();
 1063|  1.38k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 1.38k, Folded]
  |  Branch (1063:42): [True: 754, False: 627]
  ------------------
 1064|  1.38k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 401, False: 980]
  ------------------
 1065|    401|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 401]
  ------------------
 1066|      0|                node->inc();
 1067|    401|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    980|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 550, False: 430]
  ------------------
 1069|    550|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    550|                              old_tail_size - new_tail_size);
 1071|    550|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    550|        } else {
 1073|    430|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    430|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 430, Folded]
  ------------------
 1075|    430|                pos.visit(dec_visitor{});
 1076|    430|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    430|        }
 1078|  1.38k|    }
_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|  3.30k|    {
  992|  3.30k|        auto idx    = pos.index(last);
  993|  3.30k|        auto node   = pos.node();
  994|  3.30k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 3.30k, Folded]
  |  Branch (994:35): [True: 2.02k, False: 1.27k]
  ------------------
  995|  3.30k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 3.30k, Folded]
  |  Branch (995:25): [True: 1.80k, False: 1.50k]
  ------------------
  996|  1.80k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 1.17k, False: 632]
  ------------------
  997|  1.80k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  1.80k|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 1.80k, Folded]
  ------------------
  999|  1.80k|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  1.80k|            return res;
 1001|  1.80k|        } else {
 1002|  1.50k|            using std::get;
 1003|  1.50k|            auto subs =
 1004|  1.50k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 858, False: 647]
  ------------------
 1005|  1.50k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.50k|            auto next = get<1>(subs);
 1007|  1.50k|            auto ts   = get<2>(subs);
 1008|  1.50k|            auto tail = get<3>(subs);
 1009|  1.50k|            IMMER_TRY {
  ------------------
  |  |   49|  1.50k|#define IMMER_TRY try
  ------------------
 1010|  1.50k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 617, False: 888]
  ------------------
 1011|    617|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 388, False: 229]
  ------------------
 1012|    388|                        node->inner()[idx] = next;
 1013|    388|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    388|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    388|                    } else {
 1016|    229|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    229|                        newn->inner()[idx] = next;
 1018|    229|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 229, Folded]
  ------------------
 1019|    229|                            pos.visit(dec_visitor{});
 1020|    229|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    229|                    }
 1022|    888|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 888]
  ------------------
 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|    888|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 888, Folded]
  |  Branch (1026:40): [True: 648, False: 240]
  |  Branch (1026:52): [True: 245, False: 403]
  ------------------
 1027|    245|                    auto newn = pos.node()->inner()[0];
 1028|    245|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 197, False: 48]
  ------------------
 1029|    197|                        newn->inc();
 1030|    245|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 245, Folded]
  ------------------
 1031|    245|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    245|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    643|                } else {
 1034|    643|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 422, False: 221]
  ------------------
 1035|    422|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    422|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    422|                    } else {
 1038|    221|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    221|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 221, Folded]
  ------------------
 1040|    221|                            pos.visit(dec_visitor{});
 1041|    221|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    221|                    }
 1043|    643|                }
 1044|  1.50k|            }
 1045|  1.50k|            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.50k|        }
 1055|  3.30k|    }
_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|    713|    {
 1060|    713|        auto old_tail_size = pos.count();
 1061|    713|        auto new_tail_size = pos.index(last) + 1;
 1062|    713|        auto node          = pos.node();
 1063|    713|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 713, Folded]
  |  Branch (1063:42): [True: 510, False: 203]
  ------------------
 1064|    713|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 260, False: 453]
  ------------------
 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|    453|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 257, False: 196]
  ------------------
 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|    196|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    196|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 196, Folded]
  ------------------
 1075|    196|                pos.visit(dec_visitor{});
 1076|    196|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    196|        }
 1078|    713|    }
_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.05k|{
 2499|  7.05k|    return make_singleton_regular_sub_pos(ltail, ltcount)
 2500|  7.05k|        .visit(concat_trees_left_mut_visitor<Node>{},
 2501|  7.05k|               ec,
 2502|  7.05k|               el,
 2503|  7.05k|               empty_leaf_pos<Node>{},
 2504|  7.05k|               er,
 2505|  7.05k|               rroot,
 2506|  7.05k|               rshift,
 2507|  7.05k|               rsize)
 2508|  7.05k|        .realize_e(ec);
 2509|  7.05k|}
_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.05k|    {
 2452|  7.05k|        return visit_maybe_relaxed_sub(args...,
 2453|  7.05k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|  7.05k|                                       ec,
 2455|  7.05k|                                       el,
 2456|  7.05k|                                       lpos,
 2457|  7.05k|                                       tpos,
 2458|  7.05k|                                       er);
 2459|  7.05k|    }
_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|  3.94k|    {
 2433|  3.94k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.94k|    }
_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|  17.6k|{
 2334|  17.6k|    auto lshift = lpos.shift();
 2335|  17.6k|    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|  17.6k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 17.6k]
  ------------------
 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|  17.6k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 13.9k, False: 3.67k]
  ------------------
 2344|  13.9k|        auto cpos = rpos.first_sub(
 2345|  13.9k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  13.9k|        return concat_rebalance_mut<Node>(
 2347|  13.9k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  13.9k|    } else {
 2349|  3.67k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 3.67k, False: 0]
  ------------------
 2350|  3.67k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 3.67k]
  |  Branch (2350:9): [True: 3.67k, False: 0]
  |  Branch (2350:9): [True: 3.67k, False: 0]
  ------------------
 2351|  3.67k|        auto cpos = lpos.last_sub(
 2352|  3.67k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  3.67k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  3.67k|    }
 2355|  17.6k|}
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2ENSA_5applyIS7_E4type4editEjPjjSH_PSC_:
 2040|   985k|        : ec_{ec}
 2041|   985k|        , curr_{counts}
 2042|   985k|        , n_{n}
 2043|   985k|        , result_{shift + B, nullptr, 0}
 2044|   985k|    {
 2045|   985k|        if (candidate) {
  ------------------
  |  Branch (2045:13): [True: 536k, False: 449k]
  ------------------
 2046|   536k|            candidate->ensure_mutable_relaxed_e(candidate_e, ec);
 2047|   536k|            result_.nodes_[0] = candidate;
 2048|   536k|        } else {
 2049|   449k|            result_.nodes_[0] = node_t::make_inner_r_e(ec);
 2050|   449k|        }
 2051|   985k|    }
_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|   985k|    {
 1513|   985k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 125k, False: 860k]
  ------------------
 1514|   125k|            auto s = size_t{};
 1515|   493k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 368k, False: 125k]
  ------------------
 1516|   368k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   368k|                s = sizes_[i];
 1518|   368k|            }
 1519|   860k|        } else {
 1520|  2.09M|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 1.22M, False: 860k]
  ------------------
 1521|  1.22M|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|  1.22M|                    .visit(v, args...);
 1523|   860k|        }
 1524|   985k|    }
_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|   657k|    {
 2228|   657k|        merger.merge_leaf(p, e);
 2229|   657k|    }
_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|   657k|    {
 2098|   657k|        auto from       = p.node();
 2099|   657k|        auto from_size  = p.size();
 2100|   657k|        auto from_count = p.count();
 2101|   657k|        assert(from);
  ------------------
  |  Branch (2101:9): [True: 657k, False: 0]
  ------------------
 2102|   657k|        assert(from_size);
  ------------------
  |  Branch (2102:9): [True: 657k, False: 0]
  ------------------
 2103|   657k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2103:13): [True: 622k, False: 35.8k]
  |  Branch (2103:21): [True: 605k, False: 16.1k]
  ------------------
 2104|   605k|            add_child(from, from_size);
 2105|   605k|        } else {
 2106|  52.0k|            auto from_offset = count_t{};
 2107|  52.0k|            auto from_data   = from->leaf();
 2108|  52.0k|            auto from_mutate = from->can_mutate(e);
 2109|  70.7k|            do {
 2110|  70.7k|                if (!to_) {
  ------------------
  |  Branch (2110:21): [True: 34.8k, False: 35.8k]
  ------------------
 2111|  34.8k|                    if (from_mutate) {
  ------------------
  |  Branch (2111:25): [True: 3.13k, False: 31.7k]
  ------------------
 2112|  3.13k|                        node_t::ownee(from) = ec_;
 2113|  3.13k|                        to_                 = from->inc();
 2114|  3.13k|                        assert(from_count);
  ------------------
  |  Branch (2114:25): [True: 3.13k, False: 0]
  ------------------
 2115|  31.7k|                    } else {
 2116|  31.7k|                        to_ = node_t::make_leaf_e(ec_);
 2117|  31.7k|                    }
 2118|  34.8k|                    to_offset_ = 0;
 2119|  34.8k|                }
 2120|  70.7k|                auto data = to_->leaf();
 2121|  70.7k|                auto to_copy =
 2122|  70.7k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2123|  70.7k|                if (from == to_) {
  ------------------
  |  Branch (2123:21): [True: 3.13k, False: 67.5k]
  ------------------
 2124|  3.13k|                    if (from_offset != to_offset_)
  ------------------
  |  Branch (2124:25): [True: 446, False: 2.69k]
  ------------------
 2125|    446|                        std::move(from_data + from_offset,
 2126|    446|                                  from_data + from_offset + to_copy,
 2127|    446|                                  data + to_offset_);
 2128|  67.5k|                } else {
 2129|  67.5k|                    if (!from_mutate)
  ------------------
  |  Branch (2129:25): [True: 66.5k, False: 1.04k]
  ------------------
 2130|  66.5k|                        detail::uninitialized_copy(from_data + from_offset,
 2131|  66.5k|                                                   from_data + from_offset +
 2132|  66.5k|                                                       to_copy,
 2133|  66.5k|                                                   data + to_offset_);
 2134|  1.04k|                    else
 2135|  1.04k|                        detail::uninitialized_move(from_data + from_offset,
 2136|  1.04k|                                                   from_data + from_offset +
 2137|  1.04k|                                                       to_copy,
 2138|  1.04k|                                                   data + to_offset_);
 2139|  67.5k|                }
 2140|  70.7k|                to_offset_ += to_copy;
 2141|  70.7k|                from_offset += to_copy;
 2142|  70.7k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2142:21): [True: 34.8k, False: 35.8k]
  ------------------
 2143|  34.8k|                    add_child(to_, to_offset_);
 2144|  34.8k|                    to_ = nullptr;
 2145|  34.8k|                }
 2146|  70.7k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2146:22): [True: 18.7k, False: 52.0k]
  ------------------
 2147|  52.0k|        }
 2148|   657k|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9add_childEPSC_m:
 2064|  3.92M|    {
 2065|  3.92M|        assert(size);
  ------------------
  |  Branch (2065:9): [True: 3.92M, False: 0]
  ------------------
 2066|  3.92M|        ++curr_;
 2067|  3.92M|        auto parent  = result_.nodes_[result_.count_ - 1];
 2068|  3.92M|        auto relaxed = parent->relaxed();
 2069|  3.92M|        if (count_ == branches<B>) {
  ------------------
  |  Branch (2069:13): [True: 380k, False: 3.54M]
  ------------------
 2070|   380k|            parent->relaxed()->d.count = count_;
 2071|   380k|            assert(result_.count_ < result_t::max_children);
  ------------------
  |  Branch (2071:13): [True: 380k, False: 0]
  ------------------
 2072|   380k|            n_ -= branches<B>;
 2073|   380k|            if (candidate_) {
  ------------------
  |  Branch (2073:17): [True: 19.7k, False: 361k]
  ------------------
 2074|  19.7k|                parent = candidate_;
 2075|  19.7k|                parent->ensure_mutable_relaxed_e(candidate_e_, ec_);
 2076|  19.7k|                candidate_ = nullptr;
 2077|  19.7k|            } else
 2078|   361k|                parent = node_t::make_inner_r_e(ec_);
 2079|   380k|            count_                         = 0;
 2080|   380k|            relaxed                        = parent->relaxed();
 2081|   380k|            result_.nodes_[result_.count_] = parent;
 2082|   380k|            result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1];
 2083|   380k|            assert(result_.sizes_[result_.count_]);
  ------------------
  |  Branch (2083:13): [True: 380k, False: 0]
  ------------------
 2084|   380k|            ++result_.count_;
 2085|   380k|        }
 2086|  3.92M|        auto idx = count_++;
 2087|  3.92M|        result_.sizes_[result_.count_ - 1] += size;
 2088|  3.92M|        assert(size);
  ------------------
  |  Branch (2088:9): [True: 3.92M, False: 0]
  ------------------
 2089|  3.92M|        assert(result_.sizes_[result_.count_ - 1]);
  ------------------
  |  Branch (2089:9): [True: 3.92M, False: 0]
  ------------------
 2090|  3.92M|        relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0);
  ------------------
  |  Branch (2090:41): [True: 2.55M, False: 1.36M]
  ------------------
 2091|  3.92M|        assert(relaxed->d.sizes[idx]);
  ------------------
  |  Branch (2091:9): [True: 3.92M, False: 0]
  ------------------
 2092|  3.92M|        parent->inner()[idx] = p;
 2093|  3.92M|    };
_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.94M|    {
 2222|  2.94M|        merger.merge_inner(p, e);
 2223|  2.94M|    }
_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.94M|    {
 2153|  2.94M|        auto from       = p.node();
 2154|  2.94M|        auto from_size  = p.size();
 2155|  2.94M|        auto from_count = p.count();
 2156|  2.94M|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 2.94M, False: 0]
  ------------------
 2157|  2.94M|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 2.87M, False: 76.4k]
  |  Branch (2157:21): [True: 2.81M, False: 55.0k]
  ------------------
 2158|  2.81M|            add_child(from, from_size);
 2159|  2.81M|        } else {
 2160|   131k|            auto from_offset = count_t{};
 2161|   131k|            auto from_data   = from->inner();
 2162|   131k|            auto from_mutate = from->can_relax() && from->can_mutate(e);
  ------------------
  |  Branch (2162:32): [True: 131k, False: 0]
  |  Branch (2162:53): [True: 79.3k, False: 52.1k]
  ------------------
 2163|   151k|            do {
 2164|   151k|                if (!to_) {
  ------------------
  |  Branch (2164:21): [True: 75.1k, False: 76.4k]
  ------------------
 2165|  75.1k|                    if (from_mutate) {
  ------------------
  |  Branch (2165:25): [True: 56.8k, False: 18.2k]
  ------------------
 2166|  56.8k|                        node_t::ownee(from) = ec_;
 2167|  56.8k|                        from->ensure_mutable_relaxed_e(e, ec_);
 2168|  56.8k|                        to_ = from;
 2169|  56.8k|                    } else {
 2170|  18.2k|                        to_ = node_t::make_inner_r_e(ec_);
 2171|  18.2k|                    }
 2172|  75.1k|                    to_offset_ = 0;
 2173|  75.1k|                    to_size_   = 0;
 2174|  75.1k|                }
 2175|   151k|                auto data = to_->inner();
 2176|   151k|                auto to_copy =
 2177|   151k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2178|   151k|                auto sizes = to_->relaxed()->d.sizes;
 2179|   151k|                if (from != to_ || from_offset != to_offset_) {
  ------------------
  |  Branch (2179:21): [True: 94.7k, False: 56.8k]
  |  Branch (2179:36): [True: 16.9k, False: 39.9k]
  ------------------
 2180|   111k|                    std::copy(from_data + from_offset,
 2181|   111k|                              from_data + from_offset + to_copy,
 2182|   111k|                              data + to_offset_);
 2183|   111k|                    p.copy_sizes(
 2184|   111k|                        from_offset, to_copy, to_size_, sizes + to_offset_);
 2185|   111k|                }
 2186|   151k|                to_offset_ += to_copy;
 2187|   151k|                from_offset += to_copy;
 2188|   151k|                to_size_ = sizes[to_offset_ - 1];
 2189|   151k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2189:21): [True: 75.1k, False: 76.4k]
  ------------------
 2190|  75.1k|                    to_->relaxed()->d.count = to_offset_;
 2191|  75.1k|                    add_child(to_, to_size_);
 2192|  75.1k|                    to_ = nullptr;
 2193|  75.1k|                }
 2194|   151k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2194:22): [True: 20.0k, False: 131k]
  ------------------
 2195|   131k|        }
 2196|  2.94M|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13set_candidateENSA_5applyIS7_E4type4editEPSC_:
 2058|  45.5k|    {
 2059|  45.5k|        candidate_   = candidate;
 2060|  45.5k|        candidate_e_ = candidate_e;
 2061|  45.5k|    }
_ZNK5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6finishEv:
 2199|   985k|    {
 2200|   985k|        assert(!to_);
  ------------------
  |  Branch (2200:9): [True: 985k, False: 0]
  ------------------
 2201|   985k|        result_.nodes_[result_.count_ - 1]->relaxed()->d.count = count_;
 2202|   985k|        return result_;
 2203|   985k|    }
_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|  13.7k|    {
 2388|  13.7k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  13.7k|    }
_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|    266|    {
 2388|    266|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|    266|    }
_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.37k|{
 2334|  3.37k|    auto lshift = lpos.shift();
 2335|  3.37k|    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.37k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 3.37k]
  ------------------
 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.37k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 959, False: 2.41k]
  ------------------
 2344|    959|        auto cpos = rpos.first_sub(
 2345|    959|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    959|        return concat_rebalance_mut<Node>(
 2347|    959|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  2.41k|    } else {
 2349|  2.41k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 2.41k, False: 0]
  ------------------
 2350|  2.41k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 2.41k]
  |  Branch (2350:9): [True: 2.41k, False: 0]
  |  Branch (2350:9): [True: 2.41k, False: 0]
  ------------------
 2351|  2.41k|        auto cpos = lpos.last_sub(
 2352|  2.41k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  2.41k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  2.41k|    }
 2355|  3.37k|}
_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.68k|    {
 2388|  1.68k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  1.68k|    }
_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.68k|{
 2334|  1.68k|    auto lshift = lpos.shift();
 2335|  1.68k|    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.68k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 1.68k]
  ------------------
 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.68k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 724, False: 959]
  ------------------
 2344|    724|        auto cpos = rpos.first_sub(
 2345|    724|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    724|        return concat_rebalance_mut<Node>(
 2347|    724|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|    959|    } else {
 2349|    959|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 959, False: 0]
  ------------------
 2350|    959|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 959]
  |  Branch (2350:9): [True: 959, False: 0]
  |  Branch (2350:9): [True: 959, False: 0]
  ------------------
 2351|    959|        auto cpos = lpos.last_sub(
 2352|    959|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|    959|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|    959|    }
 2355|  1.68k|}
_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.42k|{
 2281|  1.42k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  1.42k|    plan.fill(lpos, cpos, rpos);
 2283|  1.42k|    plan.shuffle(cpos.shift());
 2284|  1.42k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  1.42k|}
_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.42k|    {
 2245|  1.42k|        using node_t    = node_type<CPos>;
 2246|  1.42k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  1.42k|        using visitor_t = concat_merger_mut_visitor;
 2248|  1.42k|        auto lnode      = ((node_t*) lpos.node());
 2249|  1.42k|        auto rnode      = ((node_t*) rpos.node());
 2250|  1.42k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 1.42k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  1.42k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 1.42k, False: 0]
  |  Branch (2251:36): [True: 1.42k, False: 0]
  |  Branch (2251:58): [True: 219, False: 1.20k]
  ------------------
 2252|  1.42k|        auto merger     = merger_t{ec,
 2253|  1.42k|                               cpos.shift(),
 2254|  1.42k|                               this->counts,
 2255|  1.42k|                               this->n,
 2256|  1.42k|                               el,
 2257|  1.42k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 1.42k]
  ------------------
 2258|  1.42k|        IMMER_TRY {
  ------------------
  |  |   49|  1.42k|#define IMMER_TRY try
  ------------------
 2259|  1.42k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  1.42k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  1.42k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 219, False: 1.20k]
  ------------------
 2262|    219|                merger.set_candidate(er, rnode);
 2263|  1.42k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  1.42k|            return merger.finish();
 2265|  1.42k|        }
 2266|  1.42k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  1.42k|    }
_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|  92.2k|    {
 2228|  92.2k|        merger.merge_leaf(p, e);
 2229|  92.2k|    }
_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|  92.2k|    {
 2098|  92.2k|        auto from       = p.node();
 2099|  92.2k|        auto from_size  = p.size();
 2100|  92.2k|        auto from_count = p.count();
 2101|  92.2k|        assert(from);
  ------------------
  |  Branch (2101:9): [True: 92.2k, False: 0]
  ------------------
 2102|  92.2k|        assert(from_size);
  ------------------
  |  Branch (2102:9): [True: 92.2k, False: 0]
  ------------------
 2103|  92.2k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2103:13): [True: 92.2k, False: 0]
  |  Branch (2103:21): [True: 92.2k, False: 0]
  ------------------
 2104|  92.2k|            add_child(from, from_size);
 2105|  92.2k|        } 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|  92.2k|    }
_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|   167k|    {
 2222|   167k|        merger.merge_inner(p, e);
 2223|   167k|    }
_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|   167k|    {
 2153|   167k|        auto from       = p.node();
 2154|   167k|        auto from_size  = p.size();
 2155|   167k|        auto from_count = p.count();
 2156|   167k|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 167k, False: 0]
  ------------------
 2157|   167k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 167k, False: 0]
  |  Branch (2157:21): [True: 167k, False: 0]
  ------------------
 2158|   167k|            add_child(from, from_size);
 2159|   167k|        } 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|   167k|    }
_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|    959|    {
 2417|    959|        return rpos.first_sub_leaf(
 2418|    959|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|    959|    }
_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.37k|    {
 2395|  3.37k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  3.37k|    }
_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.37k|{
 2295|  3.37k|    static_assert(Node::bits >= 2, "");
 2296|  3.37k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 3.37k, False: 0]
  ------------------
 2297|  3.37k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 3.37k, False: 0]
  ------------------
 2298|  3.37k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 3.37k, False: 0]
  ------------------
 2299|  3.37k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 0, False: 3.37k]
  ------------------
 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.37k|    else
 2310|  3.37k|        return {
 2311|  3.37k|            Node::bits_leaf,
 2312|  3.37k|            lpos.node(),
 2313|  3.37k|            lpos.count(),
 2314|  3.37k|            rpos.node(),
 2315|  3.37k|            rpos.count(),
 2316|  3.37k|        };
 2317|  3.37k|}
_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|    959|{
 2281|    959|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|    959|    plan.fill(lpos, cpos, rpos);
 2283|    959|    plan.shuffle(cpos.shift());
 2284|    959|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|    959|}
_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|    959|    {
 2245|    959|        using node_t    = node_type<CPos>;
 2246|    959|        using merger_t  = concat_merger_mut<node_t>;
 2247|    959|        using visitor_t = concat_merger_mut_visitor;
 2248|    959|        auto lnode      = ((node_t*) lpos.node());
 2249|    959|        auto rnode      = ((node_t*) rpos.node());
 2250|    959|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 959]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|    959|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 959, False: 0]
  |  Branch (2251:36): [True: 959, False: 0]
  |  Branch (2251:58): [True: 326, False: 633]
  ------------------
 2252|    959|        auto merger     = merger_t{ec,
 2253|    959|                               cpos.shift(),
 2254|    959|                               this->counts,
 2255|    959|                               this->n,
 2256|    959|                               el,
 2257|    959|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 959]
  ------------------
 2258|    959|        IMMER_TRY {
  ------------------
  |  |   49|    959|#define IMMER_TRY try
  ------------------
 2259|    959|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|    959|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|    959|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 326, False: 633]
  ------------------
 2262|    326|                merger.set_candidate(er, rnode);
 2263|    959|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|    959|            return merger.finish();
 2265|    959|        }
 2266|    959|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|    959|    }
_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.29k|{
 2281|  2.29k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.29k|    plan.fill(lpos, cpos, rpos);
 2283|  2.29k|    plan.shuffle(cpos.shift());
 2284|  2.29k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.29k|}
_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.29k|    {
 2245|  2.29k|        using node_t    = node_type<CPos>;
 2246|  2.29k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.29k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.29k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.29k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.29k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 2.29k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  2.29k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.29k, False: 0]
  |  Branch (2251:36): [True: 2.29k, False: 0]
  |  Branch (2251:58): [True: 378, False: 1.91k]
  ------------------
 2252|  2.29k|        auto merger     = merger_t{ec,
 2253|  2.29k|                               cpos.shift(),
 2254|  2.29k|                               this->counts,
 2255|  2.29k|                               this->n,
 2256|  2.29k|                               el,
 2257|  2.29k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 2.29k]
  ------------------
 2258|  2.29k|        IMMER_TRY {
  ------------------
  |  |   49|  2.29k|#define IMMER_TRY try
  ------------------
 2259|  2.29k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.29k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.29k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 378, False: 1.91k]
  ------------------
 2262|    378|                merger.set_candidate(er, rnode);
 2263|  2.29k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.29k|            return merger.finish();
 2265|  2.29k|        }
 2266|  2.29k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.29k|    }
_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|   128k|    {
 2222|   128k|        merger.merge_inner(p, e);
 2223|   128k|    }
_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|   128k|    {
 2153|   128k|        auto from       = p.node();
 2154|   128k|        auto from_size  = p.size();
 2155|   128k|        auto from_count = p.count();
 2156|   128k|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 128k, False: 0]
  ------------------
 2157|   128k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 126k, False: 2.53k]
  |  Branch (2157:21): [True: 126k, False: 0]
  ------------------
 2158|   126k|            add_child(from, from_size);
 2159|   126k|        } else {
 2160|  2.53k|            auto from_offset = count_t{};
 2161|  2.53k|            auto from_data   = from->inner();
 2162|  2.53k|            auto from_mutate = from->can_relax() && from->can_mutate(e);
  ------------------
  |  Branch (2162:32): [True: 2.53k, False: 0]
  |  Branch (2162:53): [True: 196, False: 2.33k]
  ------------------
 2163|  5.06k|            do {
 2164|  5.06k|                if (!to_) {
  ------------------
  |  Branch (2164:21): [True: 2.53k, False: 2.53k]
  ------------------
 2165|  2.53k|                    if (from_mutate) {
  ------------------
  |  Branch (2165:25): [True: 196, False: 2.33k]
  ------------------
 2166|    196|                        node_t::ownee(from) = ec_;
 2167|    196|                        from->ensure_mutable_relaxed_e(e, ec_);
 2168|    196|                        to_ = from;
 2169|  2.33k|                    } else {
 2170|  2.33k|                        to_ = node_t::make_inner_r_e(ec_);
 2171|  2.33k|                    }
 2172|  2.53k|                    to_offset_ = 0;
 2173|  2.53k|                    to_size_   = 0;
 2174|  2.53k|                }
 2175|  5.06k|                auto data = to_->inner();
 2176|  5.06k|                auto to_copy =
 2177|  5.06k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2178|  5.06k|                auto sizes = to_->relaxed()->d.sizes;
 2179|  5.06k|                if (from != to_ || from_offset != to_offset_) {
  ------------------
  |  Branch (2179:21): [True: 4.86k, False: 196]
  |  Branch (2179:36): [True: 196, False: 0]
  ------------------
 2180|  5.06k|                    std::copy(from_data + from_offset,
 2181|  5.06k|                              from_data + from_offset + to_copy,
 2182|  5.06k|                              data + to_offset_);
 2183|  5.06k|                    p.copy_sizes(
 2184|  5.06k|                        from_offset, to_copy, to_size_, sizes + to_offset_);
 2185|  5.06k|                }
 2186|  5.06k|                to_offset_ += to_copy;
 2187|  5.06k|                from_offset += to_copy;
 2188|  5.06k|                to_size_ = sizes[to_offset_ - 1];
 2189|  5.06k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2189:21): [True: 2.53k, False: 2.53k]
  ------------------
 2190|  2.53k|                    to_->relaxed()->d.count = to_offset_;
 2191|  2.53k|                    add_child(to_, to_size_);
 2192|  2.53k|                    to_ = nullptr;
 2193|  2.53k|                }
 2194|  5.06k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2194:22): [True: 2.53k, False: 2.53k]
  ------------------
 2195|  2.53k|        }
 2196|   128k|    }
_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.41k|    {
 2417|  2.41k|        return rpos.first_sub_leaf(
 2418|  2.41k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  2.41k|    }
_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.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_EESF_EENS1_17concat_center_posIT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_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_15regular_sub_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  2.41k|{
 2281|  2.41k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.41k|    plan.fill(lpos, cpos, rpos);
 2283|  2.41k|    plan.shuffle(cpos.shift());
 2284|  2.41k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.41k|}
_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.41k|    {
 2245|  2.41k|        using node_t    = node_type<CPos>;
 2246|  2.41k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.41k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.41k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.41k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.41k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 2.41k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  2.41k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.41k, False: 0]
  |  Branch (2251:36): [True: 2.41k, False: 0]
  |  Branch (2251:58): [True: 390, False: 2.02k]
  ------------------
 2252|  2.41k|        auto merger     = merger_t{ec,
 2253|  2.41k|                               cpos.shift(),
 2254|  2.41k|                               this->counts,
 2255|  2.41k|                               this->n,
 2256|  2.41k|                               el,
 2257|  2.41k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 2.41k]
  ------------------
 2258|  2.41k|        IMMER_TRY {
  ------------------
  |  |   49|  2.41k|#define IMMER_TRY try
  ------------------
 2259|  2.41k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.41k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.41k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 390, False: 2.02k]
  ------------------
 2262|    390|                merger.set_candidate(er, rnode);
 2263|  2.41k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.41k|            return merger.finish();
 2265|  2.41k|        }
 2266|  2.41k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.41k|    }
_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|  65.4k|{
 2281|  65.4k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  65.4k|    plan.fill(lpos, cpos, rpos);
 2283|  65.4k|    plan.shuffle(cpos.shift());
 2284|  65.4k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  65.4k|}
_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|  65.4k|    {
 2245|  65.4k|        using node_t    = node_type<CPos>;
 2246|  65.4k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  65.4k|        using visitor_t = concat_merger_mut_visitor;
 2248|  65.4k|        auto lnode      = ((node_t*) lpos.node());
 2249|  65.4k|        auto rnode      = ((node_t*) rpos.node());
 2250|  65.4k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 65.4k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  65.4k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 65.4k, False: 0]
  |  Branch (2251:36): [True: 65.4k, False: 0]
  |  Branch (2251:58): [True: 27.5k, False: 37.9k]
  ------------------
 2252|  65.4k|        auto merger     = merger_t{ec,
 2253|  65.4k|                               cpos.shift(),
 2254|  65.4k|                               this->counts,
 2255|  65.4k|                               this->n,
 2256|  65.4k|                               el,
 2257|  65.4k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 65.4k]
  ------------------
 2258|  65.4k|        IMMER_TRY {
  ------------------
  |  |   49|  65.4k|#define IMMER_TRY try
  ------------------
 2259|  65.4k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  65.4k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  65.4k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 27.5k, False: 37.9k]
  ------------------
 2262|  27.5k|                merger.set_candidate(er, rnode);
 2263|  65.4k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  65.4k|            return merger.finish();
 2265|  65.4k|        }
 2266|  65.4k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  65.4k|    }
_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.67k|    {
 2417|  3.67k|        return rpos.first_sub_leaf(
 2418|  3.67k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  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_11relaxed_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  3.67k|{
 2281|  3.67k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  3.67k|    plan.fill(lpos, cpos, rpos);
 2283|  3.67k|    plan.shuffle(cpos.shift());
 2284|  3.67k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  3.67k|}
_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.67k|    {
 2245|  3.67k|        using node_t    = node_type<CPos>;
 2246|  3.67k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  3.67k|        using visitor_t = concat_merger_mut_visitor;
 2248|  3.67k|        auto lnode      = ((node_t*) lpos.node());
 2249|  3.67k|        auto rnode      = ((node_t*) rpos.node());
 2250|  3.67k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 3.67k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  3.67k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 3.67k, False: 0]
  |  Branch (2251:36): [True: 3.67k, False: 0]
  |  Branch (2251:58): [True: 1.87k, False: 1.80k]
  ------------------
 2252|  3.67k|        auto merger     = merger_t{ec,
 2253|  3.67k|                               cpos.shift(),
 2254|  3.67k|                               this->counts,
 2255|  3.67k|                               this->n,
 2256|  3.67k|                               el,
 2257|  3.67k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 3.67k]
  ------------------
 2258|  3.67k|        IMMER_TRY {
  ------------------
  |  |   49|  3.67k|#define IMMER_TRY try
  ------------------
 2259|  3.67k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  3.67k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  3.67k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 1.87k, False: 1.80k]
  ------------------
 2262|  1.87k|                merger.set_candidate(er, rnode);
 2263|  3.67k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  3.67k|            return merger.finish();
 2265|  3.67k|        }
 2266|  3.67k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  3.67k|    }
_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.11k|    {
 2433|  3.11k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.11k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9realize_eENSA_5applyIS7_E4type4editE:
 1548|   125k|    {
 1549|   125k|        if (count_ > 1) {
  ------------------
  |  Branch (1549:13): [True: 11.5k, False: 113k]
  ------------------
 1550|  11.5k|            auto result = node_t::make_inner_r_e(e);
 1551|  11.5k|            auto r      = result->relaxed();
 1552|  11.5k|            r->d.count  = count_;
 1553|  11.5k|            std::copy(nodes_, nodes_ + count_, result->inner());
 1554|  11.5k|            std::copy(sizes_, sizes_ + count_, r->d.sizes);
 1555|  11.5k|            return {result, shift_, r};
 1556|   113k|        } else {
 1557|   113k|            assert(shift_ >= B + BL);
  ------------------
  |  Branch (1557:13): [True: 113k, False: 0]
  ------------------
 1558|   113k|            return {nodes_[0], shift_ - B, nodes_[0]->relaxed()};
 1559|   113k|        }
 1560|   125k|    }
_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|   117k|{
 2475|   117k|    return visit_maybe_relaxed_sub(lroot,
 2476|   117k|                                   lshift,
 2477|   117k|                                   lsize,
 2478|   117k|                                   concat_trees_left_mut_visitor<Node>{},
 2479|   117k|                                   ec,
 2480|   117k|                                   el,
 2481|   117k|                                   make_leaf_pos(ltail, ltcount),
 2482|   117k|                                   er,
 2483|   117k|                                   rroot,
 2484|   117k|                                   rshift,
 2485|   117k|                                   rsize)
 2486|   117k|        .realize_e(ec);
 2487|   117k|}
_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|   111k|    {
 2452|   111k|        return visit_maybe_relaxed_sub(args...,
 2453|   111k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|   111k|                                       ec,
 2455|   111k|                                       el,
 2456|   111k|                                       lpos,
 2457|   111k|                                       tpos,
 2458|   111k|                                       er);
 2459|   111k|    }
_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.0k|    {
 2433|  70.0k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  70.0k|    }
_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|   508k|{
 2334|   508k|    auto lshift = lpos.shift();
 2335|   508k|    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|   508k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 205k, False: 303k]
  ------------------
 2339|   205k|        auto cpos = lpos.last_sub(
 2340|   205k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|   205k|        return concat_rebalance_mut<Node>(
 2342|   205k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   303k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 42.7k, False: 260k]
  ------------------
 2344|  42.7k|        auto cpos = rpos.first_sub(
 2345|  42.7k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  42.7k|        return concat_rebalance_mut<Node>(
 2347|  42.7k|            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|   508k|}
_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|   203k|    {
 2367|   203k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|   203k|    }
_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|  3.44k|    {
 2367|  3.44k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|  3.44k|    }
_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|   145k|{
 2334|   145k|    auto lshift = lpos.shift();
 2335|   145k|    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|   145k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 1.95k, False: 143k]
  ------------------
 2339|  1.95k|        auto cpos = lpos.last_sub(
 2340|  1.95k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|  1.95k|        return concat_rebalance_mut<Node>(
 2342|  1.95k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   143k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 8.77k, False: 135k]
  ------------------
 2344|  8.77k|        auto cpos = rpos.first_sub(
 2345|  8.77k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  8.77k|        return concat_rebalance_mut<Node>(
 2347|  8.77k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|   135k|    } else {
 2349|   135k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 135k, False: 0]
  ------------------
 2350|   135k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 135k]
  |  Branch (2350:9): [True: 135k, False: 0]
  |  Branch (2350:9): [True: 135k, False: 0]
  ------------------
 2351|   135k|        auto cpos = lpos.last_sub(
 2352|   135k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|   135k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|   135k|    }
 2355|   145k|}
_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|  3.94k|{
 2281|  3.94k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  3.94k|    plan.fill(lpos, cpos, rpos);
 2283|  3.94k|    plan.shuffle(cpos.shift());
 2284|  3.94k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  3.94k|}
_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|  3.94k|    {
 2245|  3.94k|        using node_t    = node_type<CPos>;
 2246|  3.94k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  3.94k|        using visitor_t = concat_merger_mut_visitor;
 2248|  3.94k|        auto lnode      = ((node_t*) lpos.node());
 2249|  3.94k|        auto rnode      = ((node_t*) rpos.node());
 2250|  3.94k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 3.94k, False: 0]
  |  Branch (2250:36): [True: 3.94k, False: 0]
  |  Branch (2250:58): [True: 630, False: 3.31k]
  ------------------
 2251|  3.94k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 0, False: 3.94k]
  |  Branch (2251:36): [True: 0, False: 0]
  |  Branch (2251:58): [True: 0, False: 0]
  ------------------
 2252|  3.94k|        auto merger     = merger_t{ec,
 2253|  3.94k|                               cpos.shift(),
 2254|  3.94k|                               this->counts,
 2255|  3.94k|                               this->n,
 2256|  3.94k|                               el,
 2257|  3.94k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 630, False: 3.31k]
  ------------------
 2258|  3.94k|        IMMER_TRY {
  ------------------
  |  |   49|  3.94k|#define IMMER_TRY try
  ------------------
 2259|  3.94k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  3.94k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  3.94k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 0, False: 3.94k]
  ------------------
 2262|      0|                merger.set_candidate(er, rnode);
 2263|  3.94k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  3.94k|            return merger.finish();
 2265|  3.94k|        }
 2266|  3.94k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  3.94k|    }
_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|   138k|    {
 2388|   138k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|   138k|    }
_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|  2.55k|    {
 2388|  2.55k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  2.55k|    }
_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|  8.44k|{
 2334|  8.44k|    auto lshift = lpos.shift();
 2335|  8.44k|    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|  8.44k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 1.98k, False: 6.46k]
  ------------------
 2339|  1.98k|        auto cpos = lpos.last_sub(
 2340|  1.98k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|  1.98k|        return concat_rebalance_mut<Node>(
 2342|  1.98k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  6.46k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 535, False: 5.92k]
  ------------------
 2344|    535|        auto cpos = rpos.first_sub(
 2345|    535|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    535|        return concat_rebalance_mut<Node>(
 2347|    535|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  5.92k|    } else {
 2349|  5.92k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 5.92k, False: 0]
  ------------------
 2350|  5.92k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 5.92k]
  |  Branch (2350:9): [True: 5.92k, False: 0]
  |  Branch (2350:9): [True: 5.92k, False: 0]
  ------------------
 2351|  5.92k|        auto cpos = lpos.last_sub(
 2352|  5.92k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  5.92k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  5.92k|    }
 2355|  8.44k|}
_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|  3.03k|    {
 2367|  3.03k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|  3.03k|    }
_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|  10.3k|    {
 2388|  10.3k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  10.3k|    }
_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|  10.3k|{
 2334|  10.3k|    auto lshift = lpos.shift();
 2335|  10.3k|    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|  10.3k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 10.3k]
  ------------------
 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|  10.3k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 375, False: 9.98k]
  ------------------
 2344|    375|        auto cpos = rpos.first_sub(
 2345|    375|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    375|        return concat_rebalance_mut<Node>(
 2347|    375|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  9.98k|    } else {
 2349|  9.98k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 9.98k, False: 0]
  ------------------
 2350|  9.98k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 9.98k]
  |  Branch (2350:9): [True: 9.98k, False: 0]
  |  Branch (2350:9): [True: 9.98k, False: 0]
  ------------------
 2351|  9.98k|        auto cpos = lpos.last_sub(
 2352|  9.98k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  9.98k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  9.98k|    }
 2355|  10.3k|}
_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|  6.92k|    {
 2417|  6.92k|        return rpos.first_sub_leaf(
 2418|  6.92k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  6.92k|    }
_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|  48.3k|    {
 2395|  48.3k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  48.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|  48.3k|{
 2295|  48.3k|    static_assert(Node::bits >= 2, "");
 2296|  48.3k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 48.3k, False: 0]
  ------------------
 2297|  48.3k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 48.3k, False: 0]
  ------------------
 2298|  48.3k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 48.3k, False: 0]
  ------------------
 2299|  48.3k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 48.3k, False: 0]
  ------------------
 2300|  48.3k|        return {
 2301|  48.3k|            Node::bits_leaf,
 2302|  48.3k|            lpos.node(),
 2303|  48.3k|            lpos.count(),
 2304|  48.3k|            tpos.node(),
 2305|  48.3k|            tpos.count(),
 2306|  48.3k|            rpos.node(),
 2307|  48.3k|            rpos.count(),
 2308|  48.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|  48.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|  4.82k|    {
 2409|  4.82k|        return rpos.first_sub(
 2410|  4.82k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  4.82k|    }
_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|  9.98k|{
 2281|  9.98k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  9.98k|    plan.fill(lpos, cpos, rpos);
 2283|  9.98k|    plan.shuffle(cpos.shift());
 2284|  9.98k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  9.98k|}
_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|  9.98k|    {
 2245|  9.98k|        using node_t    = node_type<CPos>;
 2246|  9.98k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  9.98k|        using visitor_t = concat_merger_mut_visitor;
 2248|  9.98k|        auto lnode      = ((node_t*) lpos.node());
 2249|  9.98k|        auto rnode      = ((node_t*) rpos.node());
 2250|  9.98k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 9.98k, False: 0]
  |  Branch (2250:36): [True: 9.98k, False: 0]
  |  Branch (2250:58): [True: 732, False: 9.25k]
  ------------------
 2251|  9.98k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 9.98k, False: 0]
  |  Branch (2251:36): [True: 9.98k, False: 0]
  |  Branch (2251:58): [True: 220, False: 9.76k]
  ------------------
 2252|  9.98k|        auto merger     = merger_t{ec,
 2253|  9.98k|                               cpos.shift(),
 2254|  9.98k|                               this->counts,
 2255|  9.98k|                               this->n,
 2256|  9.98k|                               el,
 2257|  9.98k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 732, False: 9.25k]
  ------------------
 2258|  9.98k|        IMMER_TRY {
  ------------------
  |  |   49|  9.98k|#define IMMER_TRY try
  ------------------
 2259|  9.98k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  9.98k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  9.98k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 220, False: 9.76k]
  ------------------
 2262|    220|                merger.set_candidate(er, rnode);
 2263|  9.98k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  9.98k|            return merger.finish();
 2265|  9.98k|        }
 2266|  9.98k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  9.98k|    }
_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|  41.4k|    {
 2417|  41.4k|        return rpos.first_sub_leaf(
 2418|  41.4k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  41.4k|    }
_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|  69.6k|    {
 2395|  69.6k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  69.6k|    }
_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|  69.6k|{
 2295|  69.6k|    static_assert(Node::bits >= 2, "");
 2296|  69.6k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 69.6k, False: 0]
  ------------------
 2297|  69.6k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 69.6k, False: 0]
  ------------------
 2298|  69.6k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 69.6k, False: 0]
  ------------------
 2299|  69.6k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 69.6k, False: 0]
  ------------------
 2300|  69.6k|        return {
 2301|  69.6k|            Node::bits_leaf,
 2302|  69.6k|            lpos.node(),
 2303|  69.6k|            lpos.count(),
 2304|  69.6k|            tpos.node(),
 2305|  69.6k|            tpos.count(),
 2306|  69.6k|            rpos.node(),
 2307|  69.6k|            rpos.count(),
 2308|  69.6k|        };
 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|  69.6k|}
_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|  4.62k|    {
 2409|  4.62k|        return rpos.first_sub(
 2410|  4.62k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  4.62k|    }
_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|  5.92k|{
 2281|  5.92k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  5.92k|    plan.fill(lpos, cpos, rpos);
 2283|  5.92k|    plan.shuffle(cpos.shift());
 2284|  5.92k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  5.92k|}
_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|  5.92k|    {
 2245|  5.92k|        using node_t    = node_type<CPos>;
 2246|  5.92k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  5.92k|        using visitor_t = concat_merger_mut_visitor;
 2248|  5.92k|        auto lnode      = ((node_t*) lpos.node());
 2249|  5.92k|        auto rnode      = ((node_t*) rpos.node());
 2250|  5.92k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 5.92k, False: 0]
  |  Branch (2250:36): [True: 5.92k, False: 0]
  |  Branch (2250:58): [True: 919, False: 5.00k]
  ------------------
 2251|  5.92k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 5.92k, False: 0]
  |  Branch (2251:36): [True: 5.92k, False: 0]
  |  Branch (2251:58): [True: 767, False: 5.15k]
  ------------------
 2252|  5.92k|        auto merger     = merger_t{ec,
 2253|  5.92k|                               cpos.shift(),
 2254|  5.92k|                               this->counts,
 2255|  5.92k|                               this->n,
 2256|  5.92k|                               el,
 2257|  5.92k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 919, False: 5.00k]
  ------------------
 2258|  5.92k|        IMMER_TRY {
  ------------------
  |  |   49|  5.92k|#define IMMER_TRY try
  ------------------
 2259|  5.92k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  5.92k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  5.92k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 767, False: 5.15k]
  ------------------
 2262|    767|                merger.set_candidate(er, rnode);
 2263|  5.92k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  5.92k|            return merger.finish();
 2265|  5.92k|        }
 2266|  5.92k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  5.92k|    }
_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|  69.6k|    {
 2417|  69.6k|        return rpos.first_sub_leaf(
 2418|  69.6k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  69.6k|    }
_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|   132k|    {
 2409|   132k|        return rpos.first_sub(
 2410|   132k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|   132k|    }
_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|   135k|{
 2281|   135k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|   135k|    plan.fill(lpos, cpos, rpos);
 2283|   135k|    plan.shuffle(cpos.shift());
 2284|   135k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|   135k|}
_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|   135k|    {
 2245|   135k|        using node_t    = node_type<CPos>;
 2246|   135k|        using merger_t  = concat_merger_mut<node_t>;
 2247|   135k|        using visitor_t = concat_merger_mut_visitor;
 2248|   135k|        auto lnode      = ((node_t*) lpos.node());
 2249|   135k|        auto rnode      = ((node_t*) rpos.node());
 2250|   135k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 135k, False: 0]
  |  Branch (2250:36): [True: 135k, False: 0]
  |  Branch (2250:58): [True: 4.04k, False: 131k]
  ------------------
 2251|   135k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 135k, False: 0]
  |  Branch (2251:36): [True: 135k, False: 0]
  |  Branch (2251:58): [True: 3.60k, False: 131k]
  ------------------
 2252|   135k|        auto merger     = merger_t{ec,
 2253|   135k|                               cpos.shift(),
 2254|   135k|                               this->counts,
 2255|   135k|                               this->n,
 2256|   135k|                               el,
 2257|   135k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 4.04k, False: 131k]
  ------------------
 2258|   135k|        IMMER_TRY {
  ------------------
  |  |   49|   135k|#define IMMER_TRY try
  ------------------
 2259|   135k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|   135k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|   135k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 3.60k, False: 131k]
  ------------------
 2262|  3.60k|                merger.set_candidate(er, rnode);
 2263|   135k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|   135k|            return merger.finish();
 2265|   135k|        }
 2266|   135k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|   135k|    }
_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|   450k|{
 2281|   450k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|   450k|    plan.fill(lpos, cpos, rpos);
 2283|   450k|    plan.shuffle(cpos.shift());
 2284|   450k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|   450k|}
_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|   450k|    {
 2245|   450k|        using node_t    = node_type<CPos>;
 2246|   450k|        using merger_t  = concat_merger_mut<node_t>;
 2247|   450k|        using visitor_t = concat_merger_mut_visitor;
 2248|   450k|        auto lnode      = ((node_t*) lpos.node());
 2249|   450k|        auto rnode      = ((node_t*) rpos.node());
 2250|   450k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 450k, False: 0]
  |  Branch (2250:36): [True: 450k, False: 0]
  |  Branch (2250:58): [True: 436k, False: 13.8k]
  ------------------
 2251|   450k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 0, False: 450k]
  |  Branch (2251:36): [True: 0, False: 0]
  |  Branch (2251:58): [True: 0, False: 0]
  ------------------
 2252|   450k|        auto merger     = merger_t{ec,
 2253|   450k|                               cpos.shift(),
 2254|   450k|                               this->counts,
 2255|   450k|                               this->n,
 2256|   450k|                               el,
 2257|   450k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 436k, False: 13.8k]
  ------------------
 2258|   450k|        IMMER_TRY {
  ------------------
  |  |   49|   450k|#define IMMER_TRY try
  ------------------
 2259|   450k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|   450k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|   450k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 0, False: 450k]
  ------------------
 2262|      0|                merger.set_candidate(er, rnode);
 2263|   450k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|   450k|            return merger.finish();
 2265|   450k|        }
 2266|   450k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|   450k|    }
_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|   234k|    {
 2388|   234k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|   234k|    }
_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.41k|    {
 2388|  1.41k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  1.41k|    }
_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|   286k|{
 2334|   286k|    auto lshift = lpos.shift();
 2335|   286k|    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|   286k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 244k, False: 41.8k]
  ------------------
 2339|   244k|        auto cpos = lpos.last_sub(
 2340|   244k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|   244k|        return concat_rebalance_mut<Node>(
 2342|   244k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   244k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 797, False: 41.0k]
  ------------------
 2344|    797|        auto cpos = rpos.first_sub(
 2345|    797|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    797|        return concat_rebalance_mut<Node>(
 2347|    797|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  41.0k|    } else {
 2349|  41.0k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 41.0k, False: 0]
  ------------------
 2350|  41.0k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 41.0k]
  |  Branch (2350:9): [True: 41.0k, False: 0]
  |  Branch (2350:9): [True: 41.0k, False: 0]
  ------------------
 2351|  41.0k|        auto cpos = lpos.last_sub(
 2352|  41.0k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  41.0k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  41.0k|    }
 2355|   286k|}
_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|   243k|    {
 2367|   243k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|   243k|    }
_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.57k|    {
 2388|  2.57k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  2.57k|    }
_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.57k|{
 2334|  2.57k|    auto lshift = lpos.shift();
 2335|  2.57k|    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.57k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 2.57k]
  ------------------
 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.57k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 323, False: 2.25k]
  ------------------
 2344|    323|        auto cpos = rpos.first_sub(
 2345|    323|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    323|        return concat_rebalance_mut<Node>(
 2347|    323|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  2.25k|    } else {
 2349|  2.25k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 2.25k, False: 0]
  ------------------
 2350|  2.25k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 2.25k]
  |  Branch (2350:9): [True: 2.25k, False: 0]
  |  Branch (2350:9): [True: 2.25k, False: 0]
  ------------------
 2351|  2.25k|        auto cpos = lpos.last_sub(
 2352|  2.25k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  2.25k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  2.25k|    }
 2355|  2.57k|}
_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|    481|    {
 2409|    481|        return rpos.first_sub(
 2410|    481|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|    481|    }
_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.25k|{
 2281|  2.25k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.25k|    plan.fill(lpos, cpos, rpos);
 2283|  2.25k|    plan.shuffle(cpos.shift());
 2284|  2.25k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.25k|}
_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.25k|    {
 2245|  2.25k|        using node_t    = node_type<CPos>;
 2246|  2.25k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.25k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.25k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.25k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.25k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 2.25k, False: 0]
  |  Branch (2250:36): [True: 2.25k, False: 0]
  |  Branch (2250:58): [True: 883, False: 1.36k]
  ------------------
 2251|  2.25k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.25k, False: 0]
  |  Branch (2251:36): [True: 2.25k, False: 0]
  |  Branch (2251:58): [True: 198, False: 2.05k]
  ------------------
 2252|  2.25k|        auto merger     = merger_t{ec,
 2253|  2.25k|                               cpos.shift(),
 2254|  2.25k|                               this->counts,
 2255|  2.25k|                               this->n,
 2256|  2.25k|                               el,
 2257|  2.25k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 883, False: 1.36k]
  ------------------
 2258|  2.25k|        IMMER_TRY {
  ------------------
  |  |   49|  2.25k|#define IMMER_TRY try
  ------------------
 2259|  2.25k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.25k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.25k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 198, False: 2.05k]
  ------------------
 2262|    198|                merger.set_candidate(er, rnode);
 2263|  2.25k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.25k|            return merger.finish();
 2265|  2.25k|        }
 2266|  2.25k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.25k|    }
_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|    974|    {
 2409|    974|        return rpos.first_sub(
 2410|    974|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|    974|    }
_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|  41.0k|{
 2281|  41.0k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  41.0k|    plan.fill(lpos, cpos, rpos);
 2283|  41.0k|    plan.shuffle(cpos.shift());
 2284|  41.0k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  41.0k|}
_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|  41.0k|    {
 2245|  41.0k|        using node_t    = node_type<CPos>;
 2246|  41.0k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  41.0k|        using visitor_t = concat_merger_mut_visitor;
 2248|  41.0k|        auto lnode      = ((node_t*) lpos.node());
 2249|  41.0k|        auto rnode      = ((node_t*) rpos.node());
 2250|  41.0k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 41.0k, False: 0]
  |  Branch (2250:36): [True: 41.0k, False: 0]
  |  Branch (2250:58): [True: 38.3k, False: 2.75k]
  ------------------
 2251|  41.0k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 41.0k, False: 0]
  |  Branch (2251:36): [True: 41.0k, False: 0]
  |  Branch (2251:58): [True: 498, False: 40.5k]
  ------------------
 2252|  41.0k|        auto merger     = merger_t{ec,
 2253|  41.0k|                               cpos.shift(),
 2254|  41.0k|                               this->counts,
 2255|  41.0k|                               this->n,
 2256|  41.0k|                               el,
 2257|  41.0k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 38.3k, False: 2.75k]
  ------------------
 2258|  41.0k|        IMMER_TRY {
  ------------------
  |  |   49|  41.0k|#define IMMER_TRY try
  ------------------
 2259|  41.0k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  41.0k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  41.0k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 498, False: 40.5k]
  ------------------
 2262|    498|                merger.set_candidate(er, rnode);
 2263|  41.0k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  41.0k|            return merger.finish();
 2265|  41.0k|        }
 2266|  41.0k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  41.0k|    }
_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|   193k|    {
 2409|   193k|        return rpos.first_sub(
 2410|   193k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|   193k|    }
_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: 54.4k, 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: 9.59k, False: 251k]
  ------------------
 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: 54.4k, 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: 9.59k, False: 251k]
  ------------------
 2262|  9.59k|                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|  41.5k|    {
 2433|  41.5k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  41.5k|    }
_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.36k|    {
 2452|  6.36k|        return visit_maybe_relaxed_sub(args...,
 2453|  6.36k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|  6.36k|                                       ec,
 2455|  6.36k|                                       el,
 2456|  6.36k|                                       lpos,
 2457|  6.36k|                                       tpos,
 2458|  6.36k|                                       er);
 2459|  6.36k|    }
_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.51k|    {
 2433|  3.51k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.51k|    }
_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.85k|    {
 2433|  2.85k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  2.85k|    }

_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_:
 1838|   249k|{
 1839|   249k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 249k, False: 0]
  ------------------
 1840|   249k|    auto relaxed = node->relaxed();
 1841|   249k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 199k, False: 50.2k]
  ------------------
 1842|   199k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 199k, False: 0]
  ------------------
 1843|   199k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   199k|            .visit(v, std::forward<Args>(args)...);
 1845|   199k|    } else {
 1846|  50.2k|        return make_regular_sub_pos(node, shift, size)
 1847|  50.2k|            .visit(v, std::forward<Args>(args)...);
 1848|  50.2k|    }
 1849|   249k|}
_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|   613k|    {
 1814|   613k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   613k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
 1431|  7.47M|    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.2M|    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.30M|{
 1045|  2.30M|    assert(node);
  ------------------
  |  Branch (1045:5): [True: 2.30M, False: 0]
  ------------------
 1046|  2.30M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1046:5): [True: 2.30M, False: 0]
  ------------------
 1047|  2.30M|    assert(size > 0);
  ------------------
  |  Branch (1047:5): [True: 2.30M, False: 0]
  ------------------
 1048|  2.30M|    assert(size <= (branches<NodeT::bits, size_t> << shift));
  ------------------
  |  Branch (1048:5): [True: 2.30M, False: 0]
  ------------------
 1049|  2.30M|    return {node, shift, size};
 1050|  2.30M|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1036|  63.1k|    {
 1037|  63.1k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  63.1k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  785|  4.31M|    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.59M|    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|   322k|{
  215|   322k|    assert(node);
  ------------------
  |  Branch (215:5): [True: 322k, False: 0]
  ------------------
  216|   322k|    return {node};
  217|   322k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  207|  6.73k|    {
  208|  6.73k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  6.73k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  199|   224k|    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|   320k|    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|  6.85M|    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.31k|    {
  113|  2.31k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.31k|    }
_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|   335k|    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|   449k|{
 1413|   449k|    assert(node);
  ------------------
  |  Branch (1413:5): [True: 449k, False: 0]
  ------------------
 1414|   449k|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1414:5): [True: 449k, False: 0]
  ------------------
 1415|   449k|    return {node, shift};
 1416|   449k|}
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1405|  10.8k|    {
 1406|  10.8k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  10.8k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
 1159|   261k|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
 1158|   405k|    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|  8.90M|{
  691|  8.90M|    assert(node);
  ------------------
  |  Branch (691:5): [True: 8.90M, False: 0]
  ------------------
  692|  8.90M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (692:5): [True: 8.90M, False: 0]
  ------------------
  693|  8.90M|    assert(size > 0);
  ------------------
  |  Branch (693:5): [True: 8.90M, False: 0]
  ------------------
  694|  8.90M|    return {node, shift, size};
  695|  8.90M|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  336|  4.41k|    {
  337|  4.41k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  4.41k|    }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  231|  16.1M|    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.1M|    shift_t shift() const { return shift_; }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  232|  33.9M|    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.27M|    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.0M|    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.10M|    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.12M|    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.74M|{
  152|  2.74M|    assert(node);
  ------------------
  |  Branch (152:5): [True: 2.74M, False: 0]
  ------------------
  153|  2.74M|    assert(count <= branches<NodeT::bits_leaf>);
  ------------------
  |  Branch (153:5): [True: 2.74M, False: 0]
  ------------------
  154|  2.74M|    return {node, count};
  155|  2.74M|}
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  144|   488k|    {
  145|   488k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   488k|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  136|  1.78M|    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.25M|    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|   368k|{
   89|   368k|    assert(node);
  ------------------
  |  Branch (89:5): [True: 368k, False: 0]
  ------------------
   90|   368k|    return {node};
   91|   368k|}
_ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
   81|   368k|    {
   82|   368k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
   83|   368k|    }
_ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
   75|   368k|    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.2k|    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|  43.0k|    {
 1814|  43.0k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  43.0k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1433|  3.15M|    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.52M|    {
 1444|  2.52M|        return size_sbh(offset, size_before(offset));
 1445|  2.52M|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
 1448|  2.62M|    {
 1449|  2.62M|        assert(size_before_hint == size_before(offset));
  ------------------
  |  Branch (1449:9): [True: 2.62M, False: 0]
  ------------------
 1450|  2.62M|        return relaxed_->d.sizes[offset] - size_before_hint;
 1451|  2.62M|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11size_beforeEj:
 1438|  5.47M|    {
 1439|  5.47M|        return offset ? relaxed_->d.sizes[offset - 1] : 0;
  ------------------
  |  Branch (1439:16): [True: 4.61M, False: 866k]
  ------------------
 1440|  5.47M|    }
_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|  38.4k|    {
 1738|  38.4k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 38.4k, False: 0]
  ------------------
 1739|  38.4k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 38.4k, False: 0]
  ------------------
 1740|  38.4k|        auto child   = node_->inner()[offset_hint];
 1741|  38.4k|        auto is_leaf = shift_ == BL;
 1742|  38.4k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 38.4k]
  ------------------
 1743|  38.4k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|  38.4k|                   : visit_maybe_relaxed_sub(
 1745|  38.4k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|  38.4k|    }
_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|  38.4k|{
 1839|  38.4k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 38.4k, False: 0]
  ------------------
 1840|  38.4k|    auto relaxed = node->relaxed();
 1841|  38.4k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 30.7k, False: 7.69k]
  ------------------
 1842|  30.7k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 30.7k, False: 0]
  ------------------
 1843|  30.7k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  30.7k|            .visit(v, std::forward<Args>(args)...);
 1845|  30.7k|    } else {
 1846|  7.69k|        return make_regular_sub_pos(node, shift, size)
 1847|  7.69k|            .visit(v, std::forward<Args>(args)...);
 1848|  7.69k|    }
 1849|  38.4k|}
_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|  7.69k|    {
 1037|  7.69k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  7.69k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  788|  3.43M|    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|  8.55k|    {
  953|  8.55k|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  8.55k|    }
_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|  8.55k|{
  678|  8.55k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 8.55k, False: 0]
  ------------------
  679|  8.55k|    constexpr auto B  = bits<Pos>;
  680|  8.55k|    constexpr auto BL = bits_leaf<Pos>;
  681|  8.55k|    auto child        = p.node()->inner()[offset_hint];
  682|  8.55k|    auto is_leaf      = p.shift() == BL;
  683|  8.55k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 8.55k]
  ------------------
  684|  8.55k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  8.55k|                         .visit(v, args...);
  686|  8.55k|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_:
  336|  31.1k|    {
  337|  31.1k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  31.1k|    }
_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|  22.5k|    {
  331|  22.5k|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  22.5k|    }
_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|  22.5k|{
  678|  22.5k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 22.5k, False: 0]
  ------------------
  679|  22.5k|    constexpr auto B  = bits<Pos>;
  680|  22.5k|    constexpr auto BL = bits_leaf<Pos>;
  681|  22.5k|    auto child        = p.node()->inner()[offset_hint];
  682|  22.5k|    auto is_leaf      = p.shift() == BL;
  683|  22.5k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 22.5k]
  ------------------
  684|  22.5k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  22.5k|                         .visit(v, args...);
  686|  22.5k|}
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
 1432|  5.12M|    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.14k|    {
 1037|  4.14k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.14k|    }
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|    555|    {
  145|    555|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    555|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  139|  35.2k|    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|  28.7k|{
 1839|  28.7k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 28.7k, False: 0]
  ------------------
 1840|  28.7k|    auto relaxed = node->relaxed();
 1841|  28.7k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 26.7k, False: 1.94k]
  ------------------
 1842|  26.7k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 26.7k, False: 0]
  ------------------
 1843|  26.7k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  26.7k|            .visit(v, std::forward<Args>(args)...);
 1845|  26.7k|    } 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|  28.7k|}
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|  26.7k|    {
 1814|  26.7k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  26.7k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
 1454|   787k|    {
 1455|   787k|        auto offset = idx >> shift_;
 1456|   932k|        while (relaxed_->d.sizes[offset] <= idx)
  ------------------
  |  Branch (1456:16): [True: 144k, False: 787k]
  ------------------
 1457|   144k|            ++offset;
 1458|   787k|        return offset;
 1459|   787k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7relaxedEv:
 1435|  26.7k|    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|  26.7k|    {
 1687|  26.7k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 26.7k, False: 0]
  ------------------
 1688|  26.7k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 2.25k, False: 24.5k]
  ------------------
 1689|  26.7k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  26.7k|    }
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|  26.7k|    {
 1699|  26.7k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  26.7k|    }
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|  26.7k|    {
 1718|  26.7k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 26.7k, False: 0]
  ------------------
 1719|  26.7k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 2.25k, False: 24.5k]
  |  Branch (1719:9): [True: 26.7k, False: 0]
  ------------------
 1720|  26.7k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  26.7k|        auto child     = node_->inner()[offset_hint];
 1722|  26.7k|        auto is_leaf   = shift_ == BL;
 1723|  26.7k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  26.7k|        auto next_idx  = idx - left_size_hint;
 1725|  26.7k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 3.05k, False: 23.7k]
  ------------------
 1726|  26.7k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  3.05k|                         .visit(v, next_idx, args...)
 1728|  26.7k|                   : visit_maybe_relaxed_sub(
 1729|  23.7k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  26.7k|    }
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.05k|    {
  145|  3.05k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.05k|    }
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.94k|    {
 1037|  1.94k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.94k|    }
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.94k|    {
  939|  1.94k|        return towards_oh_ch_regular(
  940|  1.94k|            *this, v, idx, offset_hint, count(), args...);
  941|  1.94k|    }
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.94k|{
  633|  1.94k|    constexpr auto B  = bits<Pos>;
  634|  1.94k|    constexpr auto BL = bits_leaf<Pos>;
  635|  1.94k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 1.94k, False: 0]
  ------------------
  636|  1.94k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 1.94k, False: 0]
  ------------------
  637|  1.94k|    auto is_leaf = p.shift() == BL;
  638|  1.94k|    auto child   = p.node()->inner()[offset_hint];
  639|  1.94k|    auto is_full = offset_hint + 1 != count_hint;
  640|  1.94k|    return is_full
  ------------------
  |  Branch (640:12): [True: 922, False: 1.02k]
  ------------------
  641|  1.94k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 322, False: 600]
  ------------------
  642|    922|                          : make_full_pos(child, p.shift() - B)
  643|    600|                                .visit(v, idx, args...))
  644|  1.94k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 257, False: 770]
  ------------------
  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|    770|                            .visit(v, idx, args...));
  648|  1.94k|}
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.36k|    {
  208|  1.36k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.36k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  202|  29.9k|    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.32k|    {
 1406|  1.32k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.32k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
 1162|  60.6k|    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.32k|    {
 1330|  1.32k|        return towards_oh(v, idx, offset_hint, args...);
 1331|  1.32k|    }
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.32k|    {
 1337|  1.32k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.32k, False: 0]
  ------------------
 1338|  1.32k|        auto is_leaf = shift_ == BL;
 1339|  1.32k|        auto child   = node_->inner()[offset_hint];
 1340|  1.32k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 800, False: 527]
  ------------------
 1341|  1.32k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.32k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.32k|    }
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|    588|    {
  113|    588|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    588|    }
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.16k|    {
  337|  1.16k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  1.16k|    }
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.16k|    {
  317|  1.16k|        return towards_oh_ch_regular(
  318|  1.16k|            *this, v, idx, offset_hint, count(), args...);
  319|  1.16k|    }
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.16k|{
  633|  1.16k|    constexpr auto B  = bits<Pos>;
  634|  1.16k|    constexpr auto BL = bits_leaf<Pos>;
  635|  1.16k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 1.16k, False: 0]
  ------------------
  636|  1.16k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 1.16k, False: 0]
  ------------------
  637|  1.16k|    auto is_leaf = p.shift() == BL;
  638|  1.16k|    auto child   = p.node()->inner()[offset_hint];
  639|  1.16k|    auto is_full = offset_hint + 1 != count_hint;
  640|  1.16k|    return is_full
  ------------------
  |  Branch (640:12): [True: 439, False: 725]
  ------------------
  641|  1.16k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 239, False: 200]
  ------------------
  642|    439|                          : make_full_pos(child, p.shift() - B)
  643|    200|                                .visit(v, idx, args...))
  644|  1.16k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 331, False: 394]
  ------------------
  645|    725|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    725|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    394|                            .visit(v, idx, args...));
  648|  1.16k|}
_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.6k|{
 1839|  20.6k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 20.6k, False: 0]
  ------------------
 1840|  20.6k|    auto relaxed = node->relaxed();
 1841|  20.6k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 15.5k, False: 5.10k]
  ------------------
 1842|  15.5k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 15.5k, False: 0]
  ------------------
 1843|  15.5k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  15.5k|            .visit(v, std::forward<Args>(args)...);
 1845|  15.5k|    } else {
 1846|  5.10k|        return make_regular_sub_pos(node, shift, size)
 1847|  5.10k|            .visit(v, std::forward<Args>(args)...);
 1848|  5.10k|    }
 1849|  20.6k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1813|  15.5k|    {
 1814|  15.5k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  15.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1686|  11.3k|    {
 1687|  11.3k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 11.3k, False: 0]
  ------------------
 1688|  11.3k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 11.3k]
  ------------------
 1689|  11.3k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  11.3k|    }
_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|  11.3k|    {
 1699|  11.3k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  11.3k|    }
_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|  11.3k|    {
 1718|  11.3k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 11.3k, False: 0]
  ------------------
 1719|  11.3k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 11.3k]
  |  Branch (1719:9): [True: 11.3k, False: 0]
  ------------------
 1720|  11.3k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  11.3k|        auto child     = node_->inner()[offset_hint];
 1722|  11.3k|        auto is_leaf   = shift_ == BL;
 1723|  11.3k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  11.3k|        auto next_idx  = idx - left_size_hint;
 1725|  11.3k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 771, False: 10.6k]
  ------------------
 1726|  11.3k|                   ? make_leaf_sub_pos(child, next_size)
 1727|    771|                         .visit(v, next_idx, args...)
 1728|  11.3k|                   : visit_maybe_relaxed_sub(
 1729|  10.6k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  11.3k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
  144|    771|    {
  145|    771|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    771|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1686|  8.64k|    {
 1687|  8.64k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 8.64k, False: 0]
  ------------------
 1688|  8.64k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 6.04k, False: 2.59k]
  ------------------
 1689|  8.64k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  8.64k|    }
_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|  8.64k|    {
 1699|  8.64k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  8.64k|    }
_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|  8.64k|    {
 1718|  8.64k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 8.64k, False: 0]
  ------------------
 1719|  8.64k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 6.04k, False: 2.59k]
  |  Branch (1719:9): [True: 8.64k, False: 0]
  ------------------
 1720|  8.64k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  8.64k|        auto child     = node_->inner()[offset_hint];
 1722|  8.64k|        auto is_leaf   = shift_ == BL;
 1723|  8.64k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  8.64k|        auto next_idx  = idx - left_size_hint;
 1725|  8.64k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 2.88k, False: 5.75k]
  ------------------
 1726|  8.64k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  2.88k|                         .visit(v, next_idx, args...)
 1728|  8.64k|                   : visit_maybe_relaxed_sub(
 1729|  5.75k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  8.64k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  144|  2.88k|    {
  145|  2.88k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  2.88k|    }
_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|  5.75k|{
 1839|  5.75k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 5.75k, False: 0]
  ------------------
 1840|  5.75k|    auto relaxed = node->relaxed();
 1841|  5.75k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 4.43k, False: 1.31k]
  ------------------
 1842|  4.43k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 4.43k, False: 0]
  ------------------
 1843|  4.43k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  4.43k|            .visit(v, std::forward<Args>(args)...);
 1845|  4.43k|    } 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|  5.75k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1813|  4.43k|    {
 1814|  4.43k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.43k|    }
_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.31k|    {
 1037|  1.31k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.31k|    }
_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.57k|    {
  928|  3.57k|        return towards_oh_ch_regular(
  929|  3.57k|            *this, v, idx, offset_hint, count(), args...);
  930|  3.57k|    }
_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.57k|{
  633|  3.57k|    constexpr auto B  = bits<Pos>;
  634|  3.57k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.57k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.57k, False: 0]
  ------------------
  636|  3.57k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.57k, False: 0]
  ------------------
  637|  3.57k|    auto is_leaf = p.shift() == BL;
  638|  3.57k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.57k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.57k|    return is_full
  ------------------
  |  Branch (640:12): [True: 1.14k, False: 2.42k]
  ------------------
  641|  3.57k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 435, False: 712]
  ------------------
  642|  1.14k|                          : make_full_pos(child, p.shift() - B)
  643|    712|                                .visit(v, idx, args...))
  644|  3.57k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 828, False: 1.59k]
  ------------------
  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.59k|                            .visit(v, idx, args...));
  648|  3.57k|}
_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.93k|    {
  208|  2.93k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  2.93k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1405|  2.11k|    {
 1406|  2.11k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.11k|    }
_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.28k|    {
 1337|  3.28k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 3.28k, False: 0]
  ------------------
 1338|  3.28k|        auto is_leaf = shift_ == BL;
 1339|  3.28k|        auto child   = node_->inner()[offset_hint];
 1340|  3.28k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 2.09k, False: 1.18k]
  ------------------
 1341|  3.28k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  3.28k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  3.28k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1161|  44.3k|    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.80k|    {
  113|  1.80k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  1.80k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  336|  2.35k|    {
  337|  2.35k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.35k|    }
_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.35k|    {
  306|  2.35k|        return towards_oh_ch_regular(
  307|  2.35k|            *this, v, idx, offset_hint, count(), args...);
  308|  2.35k|    }
_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.35k|{
  633|  2.35k|    constexpr auto B  = bits<Pos>;
  634|  2.35k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.35k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.35k, False: 0]
  ------------------
  636|  2.35k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.35k, False: 0]
  ------------------
  637|  2.35k|    auto is_leaf = p.shift() == BL;
  638|  2.35k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.35k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.35k|    return is_full
  ------------------
  |  Branch (640:12): [True: 616, False: 1.73k]
  ------------------
  641|  2.35k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 401, False: 215]
  ------------------
  642|    616|                          : make_full_pos(child, p.shift() - B)
  643|    215|                                .visit(v, idx, args...))
  644|  2.35k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 980, False: 755]
  ------------------
  645|  1.73k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.73k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    755|                            .visit(v, idx, args...));
  648|  2.35k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1036|  5.10k|    {
 1037|  5.10k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  5.10k|    }
_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.84k|    {
  928|  2.84k|        return towards_oh_ch_regular(
  929|  2.84k|            *this, v, idx, offset_hint, count(), args...);
  930|  2.84k|    }
_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.84k|{
  633|  2.84k|    constexpr auto B  = bits<Pos>;
  634|  2.84k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.84k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.84k, False: 0]
  ------------------
  636|  2.84k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.84k, False: 0]
  ------------------
  637|  2.84k|    auto is_leaf = p.shift() == BL;
  638|  2.84k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.84k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.84k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.37k, False: 472]
  ------------------
  641|  2.84k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 658, False: 1.71k]
  ------------------
  642|  2.37k|                          : make_full_pos(child, p.shift() - B)
  643|  1.71k|                                .visit(v, idx, args...))
  644|  2.84k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 472, False: 0]
  ------------------
  645|    472|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    472|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .visit(v, idx, args...));
  648|  2.84k|}
_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.20k|    {
  208|  1.20k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.20k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1405|  2.08k|    {
 1406|  2.08k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.08k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1336|    921|    {
 1337|    921|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 921, False: 0]
  ------------------
 1338|    921|        auto is_leaf = shift_ == BL;
 1339|    921|        auto child   = node_->inner()[offset_hint];
 1340|    921|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 547, False: 374]
  ------------------
 1341|    921|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|    921|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|    921|    }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
  112|    472|    {
  113|    472|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    472|    }
_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|  16.7k|{
 1839|  16.7k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 16.7k, False: 0]
  ------------------
 1840|  16.7k|    auto relaxed = node->relaxed();
 1841|  16.7k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 14.3k, False: 2.46k]
  ------------------
 1842|  14.3k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 14.3k, False: 0]
  ------------------
 1843|  14.3k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  14.3k|            .visit(v, std::forward<Args>(args)...);
 1845|  14.3k|    } else {
 1846|  2.46k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.46k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.46k|    }
 1849|  16.7k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1813|  14.3k|    {
 1814|  14.3k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  14.3k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8subindexEm:
 1434|   104k|    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.26k|    {
 1706|  1.26k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1706:9): [True: 1.26k, False: 0]
  ------------------
 1707|  1.26k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1707:26): [True: 783, False: 479]
  ------------------
 1708|  1.26k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...);
 1709|  1.26k|    }
_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.26k|    {
 1718|  1.26k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 1.26k, False: 0]
  ------------------
 1719|  1.26k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 783, False: 479]
  |  Branch (1719:9): [True: 1.26k, False: 0]
  ------------------
 1720|  1.26k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  1.26k|        auto child     = node_->inner()[offset_hint];
 1722|  1.26k|        auto is_leaf   = shift_ == BL;
 1723|  1.26k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  1.26k|        auto next_idx  = idx - left_size_hint;
 1725|  1.26k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 0, False: 1.26k]
  ------------------
 1726|  1.26k|                   ? make_leaf_sub_pos(child, next_size)
 1727|      0|                         .visit(v, next_idx, args...)
 1728|  1.26k|                   : visit_maybe_relaxed_sub(
 1729|  1.26k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  1.26k|    }
_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|   103k|    {
 1706|   103k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1706:9): [True: 103k, False: 0]
  ------------------
 1707|   103k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1707:26): [True: 19.0k, False: 84.1k]
  ------------------
 1708|   103k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...);
 1709|   103k|    }
_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|   103k|    {
 1718|   103k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 103k, False: 0]
  ------------------
 1719|   103k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 19.0k, False: 84.1k]
  |  Branch (1719:9): [True: 103k, False: 0]
  ------------------
 1720|   103k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|   103k|        auto child     = node_->inner()[offset_hint];
 1722|   103k|        auto is_leaf   = shift_ == BL;
 1723|   103k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|   103k|        auto next_idx  = idx - left_size_hint;
 1725|   103k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 11.4k, False: 91.7k]
  ------------------
 1726|   103k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  11.4k|                         .visit(v, next_idx, args...)
 1728|   103k|                   : visit_maybe_relaxed_sub(
 1729|  91.7k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|   103k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  144|  11.4k|    {
  145|  11.4k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  11.4k|    }
_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|  91.7k|{
 1839|  91.7k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 91.7k, False: 0]
  ------------------
 1840|  91.7k|    auto relaxed = node->relaxed();
 1841|  91.7k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 90.1k, False: 1.58k]
  ------------------
 1842|  90.1k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 90.1k, False: 0]
  ------------------
 1843|  90.1k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  90.1k|            .visit(v, std::forward<Args>(args)...);
 1845|  90.1k|    } else {
 1846|  1.58k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.58k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.58k|    }
 1849|  91.7k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1813|  90.1k|    {
 1814|  90.1k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  90.1k|    }
_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.58k|    {
 1037|  1.58k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.58k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11size_beforeEj:
  791|  14.2k|    {
  792|  14.2k|        return size_t{offset} << shift_;
  793|  14.2k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
  803|  4.39k|    {
  804|  4.39k|        assert(size_before_hint == size_before(offset));
  ------------------
  |  Branch (804:9): [True: 4.39k, False: 0]
  ------------------
  805|  4.39k|        return offset == subindex(size_ - 1) ? size_ - size_before_hint
  ------------------
  |  Branch (805:16): [True: 2.11k, False: 2.27k]
  ------------------
  806|  4.39k|                                             : size_t{1} << shift_;
  807|  4.39k|    }
_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.22k|    {
  947|  3.22k|        return towards_sub_oh_regular(*this, v, idx, offset_hint, args...);
  948|  3.22k|    }
_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.22k|{
  654|  3.22k|    constexpr auto B  = bits<Pos>;
  655|  3.22k|    constexpr auto BL = bits_leaf<Pos>;
  656|  3.22k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (656:5): [True: 3.22k, False: 0]
  ------------------
  657|  3.22k|    auto is_leaf = p.shift() == BL;
  658|  3.22k|    auto child   = p.node()->inner()[offset_hint];
  659|  3.22k|    auto lsize   = offset_hint << p.shift();
  660|  3.22k|    auto size    = p.this_size();
  661|  3.22k|    auto is_full = (size - lsize) >= (size_t{1} << p.shift());
  662|  3.22k|    return is_full
  ------------------
  |  Branch (662:12): [True: 3.22k, False: 0]
  ------------------
  663|  3.22k|               ? (is_leaf
  ------------------
  |  Branch (663:19): [True: 1.91k, False: 1.30k]
  ------------------
  664|  3.22k|                      ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
  665|  3.22k|                      : make_full_pos(child, p.shift() - B)
  666|  1.30k|                            .visit(v, idx - lsize, args...))
  667|  3.22k|               : (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.22k|}
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9this_sizeEv:
  794|  4.39k|    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.04k|    {
  208|  4.04k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  4.04k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_:
 1405|  2.78k|    {
 1406|  2.78k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.78k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8subindexEm:
 1163|  3.88k|    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.88k|    {
 1171|  3.88k|        return size_t{offset} << shift_;
 1172|  3.88k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
 1166|  3.88k|    {
 1167|  3.88k|        return size_t{1} << shift_;
 1168|  3.88k|    }
_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.60k|    {
 1349|  3.60k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1349:9): [True: 3.60k, False: 0]
  ------------------
 1350|  3.60k|        auto is_leaf = shift_ == BL;
 1351|  3.60k|        auto child   = node_->inner()[offset_hint];
 1352|  3.60k|        auto lsize   = size_t{offset_hint} << shift_;
 1353|  3.60k|        return is_leaf
  ------------------
  |  Branch (1353:16): [True: 2.12k, False: 1.47k]
  ------------------
 1354|  3.60k|                   ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
 1355|  3.60k|                   : make_full_pos(child, shift_ - B)
 1356|  1.47k|                         .visit(v, idx - lsize, args...);
 1357|  3.60k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10copy_sizesEjjmPm:
 1175|  3.60k|    {
 1176|  3.60k|        auto e = sizes + n;
 1177|  9.92k|        for (; sizes != e; ++sizes) {
  ------------------
  |  Branch (1177:16): [True: 6.31k, False: 3.60k]
  ------------------
 1178|  6.31k|            init = *sizes = init + (size_t{1} << shift_);
 1179|       |            assert(init);
  ------------------
  |  Branch (1179:13): [True: 6.31k, False: 0]
  ------------------
 1180|  6.31k|        }
 1181|  3.60k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
 1160|   199k|    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|  9.50k|    {
  811|  9.50k|        if (n) {
  ------------------
  |  Branch (811:13): [True: 8.56k, False: 948]
  ------------------
  812|  8.56k|            auto last = offset + n - 1;
  813|  8.56k|            auto e    = sizes + n - 1;
  814|  17.0k|            for (; sizes != e; ++sizes) {
  ------------------
  |  Branch (814:20): [True: 8.45k, False: 8.56k]
  ------------------
  815|  8.45k|                init = *sizes = init + (size_t{1} << shift_);
  816|  8.45k|                assert(init);
  ------------------
  |  Branch (816:17): [True: 8.45k, False: 0]
  ------------------
  817|  8.45k|            }
  818|  8.56k|            *sizes = init + size(last);
  819|       |            assert(*sizes);
  ------------------
  |  Branch (819:13): [True: 8.56k, False: 0]
  ------------------
  820|  8.56k|        }
  821|  9.50k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEj:
  797|  8.56k|    {
  798|  8.56k|        return offset == subindex(size_ - 1) ? size_ - size_before(offset)
  ------------------
  |  Branch (798:16): [True: 5.41k, False: 3.14k]
  ------------------
  799|  8.56k|                                             : size_t{1} << shift_;
  800|  8.56k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10copy_sizesEjjmPm:
 1462|   229k|    {
 1463|   229k|        auto e     = sizes + n;
 1464|   229k|        auto prev  = size_before(offset);
 1465|   229k|        auto these = relaxed_->d.sizes + offset;
 1466|   606k|        for (; sizes != e; ++sizes, ++these) {
  ------------------
  |  Branch (1466:16): [True: 377k, False: 229k]
  ------------------
 1467|   377k|            auto this_size = *these;
 1468|   377k|            init = *sizes = init + (this_size - prev);
 1469|   377k|            assert(init);
  ------------------
  |  Branch (1469:13): [True: 377k, False: 0]
  ------------------
 1470|   377k|            prev = this_size;
 1471|   377k|        }
 1472|   229k|    }
_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.46k|    {
 1037|  2.46k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.46k|    }
_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.17k|    {
  947|  1.17k|        return towards_sub_oh_regular(*this, v, idx, offset_hint, args...);
  948|  1.17k|    }
_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.17k|{
  654|  1.17k|    constexpr auto B  = bits<Pos>;
  655|  1.17k|    constexpr auto BL = bits_leaf<Pos>;
  656|  1.17k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (656:5): [True: 1.17k, False: 0]
  ------------------
  657|  1.17k|    auto is_leaf = p.shift() == BL;
  658|  1.17k|    auto child   = p.node()->inner()[offset_hint];
  659|  1.17k|    auto lsize   = offset_hint << p.shift();
  660|  1.17k|    auto size    = p.this_size();
  661|  1.17k|    auto is_full = (size - lsize) >= (size_t{1} << p.shift());
  662|  1.17k|    return is_full
  ------------------
  |  Branch (662:12): [True: 822, False: 349]
  ------------------
  663|  1.17k|               ? (is_leaf
  ------------------
  |  Branch (663:19): [True: 0, False: 822]
  ------------------
  664|    822|                      ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
  665|    822|                      : make_full_pos(child, p.shift() - B)
  666|    822|                            .visit(v, idx - lsize, args...))
  667|  1.17k|               : (is_leaf
  ------------------
  |  Branch (667:19): [True: 0, False: 349]
  ------------------
  668|    349|                      ? make_leaf_sub_pos(child, size - lsize)
  669|      0|                            .visit(v, idx - lsize, args...)
  670|    349|                      : make_regular_sub_pos(child, p.shift() - B, size - lsize)
  671|    349|                            .visit(v, idx - lsize, args...));
  672|  1.17k|}
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_:
 1405|  1.10k|    {
 1406|  1.10k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.10k|    }
_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|    278|    {
 1349|    278|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1349:9): [True: 278, False: 0]
  ------------------
 1350|    278|        auto is_leaf = shift_ == BL;
 1351|    278|        auto child   = node_->inner()[offset_hint];
 1352|    278|        auto lsize   = size_t{offset_hint} << shift_;
 1353|    278|        return is_leaf
  ------------------
  |  Branch (1353:16): [True: 0, False: 278]
  ------------------
 1354|    278|                   ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
 1355|    278|                   : make_full_pos(child, shift_ - B)
 1356|    278|                         .visit(v, idx - lsize, args...);
 1357|    278|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_:
 1036|    349|    {
 1037|    349|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    349|    }
_ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaPT_j:
  766|  10.2k|{
  767|  10.2k|    assert(leaf);
  ------------------
  |  Branch (767:5): [True: 10.2k, False: 0]
  ------------------
  768|  10.2k|    IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf);
  ------------------
  |  |   68|  10.2k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (768:5): [True: 10.2k, False: 0]
  ------------------
  769|  10.2k|    assert(count > 0);
  ------------------
  |  Branch (769:5): [True: 10.2k, False: 0]
  ------------------
  770|  10.2k|    return singleton_regular_sub_pos<NodeT>{leaf, count};
  771|  10.2k|}
_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.24k|    {
  760|  3.24k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  761|  3.24k|    }
_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.24k|{
 1839|  3.24k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 3.24k, False: 0]
  ------------------
 1840|  3.24k|    auto relaxed = node->relaxed();
 1841|  3.24k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.91k, False: 1.33k]
  ------------------
 1842|  1.91k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.91k, False: 0]
  ------------------
 1843|  1.91k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.91k|            .visit(v, std::forward<Args>(args)...);
 1845|  1.91k|    } else {
 1846|  1.33k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.33k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.33k|    }
 1849|  3.24k|}
_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.91k|    {
 1814|  1.91k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.91k|    }
_ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  735|  33.2k|    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.2k|    {
  745|  10.2k|    }
_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|   970k|    {
  145|   970k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   970k|    }
_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.24M|    {
 1814|  4.24M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.24M|    }
_ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  707|   460k|    {
  708|   460k|    }
_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.24k|    {
  745|  3.24k|    }
_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|   312k|    {
  145|   312k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   312k|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  137|   970k|    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.29M|    {
 1814|  1.29M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.29M|    }
_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.15k|    {
  708|  6.15k|    }
_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.97k|    {
 1763|  5.97k|        auto child      = node_->inner()[0];
 1764|  5.97k|        auto child_size = relaxed_->d.sizes[0];
 1765|  5.97k|        auto is_leaf    = shift_ == BL;
 1766|  5.97k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 5.97k, False: 0]
  ------------------
 1767|  5.97k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 5.97k]
  ------------------
 1768|  5.97k|                       : visit_maybe_relaxed_sub(
 1769|  5.97k|                             child, shift_ - B, child_size, v, args...);
 1770|  5.97k|    }
_ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
   76|  10.2k|    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|   629k|    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.05k|    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.97k|{
 1839|  5.97k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 5.97k, False: 0]
  ------------------
 1840|  5.97k|    auto relaxed = node->relaxed();
 1841|  5.97k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 5.75k, False: 214]
  ------------------
 1842|  5.75k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 5.75k, False: 0]
  ------------------
 1843|  5.75k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  5.75k|            .visit(v, std::forward<Args>(args)...);
 1845|  5.75k|    } else {
 1846|    214|        return make_regular_sub_pos(node, shift, size)
 1847|    214|            .visit(v, std::forward<Args>(args)...);
 1848|    214|    }
 1849|  5.97k|}
_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.75k|    {
 1814|  5.75k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  5.75k|    }
_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|    214|    {
 1037|    214|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    214|    }
_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|    651|    {
  971|    651|        auto is_leaf = shift_ == BL;
  972|    651|        auto child   = node_->inner()[0];
  973|    651|        auto is_full = size_ >= (size_t{1} << shift_);
  974|    651|        return is_full
  ------------------
  |  Branch (974:16): [True: 651, False: 0]
  ------------------
  975|    651|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 651]
  ------------------
  976|    651|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|    651|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|    651|                   : (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|    651|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  201|  61.8k|    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.30k|    {
 1406|  1.30k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.30k|    }
_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|    657|    {
 1362|    657|        auto is_leaf = shift_ == BL;
 1363|    657|        auto child   = node_->inner()[0];
 1364|    657|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 657]
  ------------------
 1365|    657|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    657|    }
_ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  711|  81.8k|    {
  712|  81.8k|    }
_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|  22.3k|    {
 1305|  22.3k|        each_i(v, 1, branches<B>, args...);
 1306|  22.3k|    }
_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|  22.3k|    {
 1264|  22.3k|        auto p = node_->inner() + i;
 1265|  22.3k|        auto e = node_->inner() + n;
 1266|  22.3k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 12.1k, False: 10.2k]
  ------------------
 1267|  48.4k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 36.3k, False: 12.1k]
  ------------------
 1268|  36.3k|                IMMER_PREFETCH(p + 1);
 1269|  36.3k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  36.3k|            }
 1271|  12.1k|        } else {
 1272|  10.2k|            auto ss = shift_ - B;
 1273|  40.9k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 30.7k, False: 10.2k]
  ------------------
 1274|  30.7k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  10.2k|        }
 1276|  22.3k|    }
_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|   114k|    {
  208|   114k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|   114k|    }
_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|   196k|    {
 1406|   196k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|   196k|    }
_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.74k|    {
 1305|  7.74k|        each_i(v, 1, branches<B>, args...);
 1306|  7.74k|    }
_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.74k|    {
 1264|  7.74k|        auto p = node_->inner() + i;
 1265|  7.74k|        auto e = node_->inner() + n;
 1266|  7.74k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 4.23k, False: 3.51k]
  ------------------
 1267|  16.9k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 12.6k, False: 4.23k]
  ------------------
 1268|  12.6k|                IMMER_PREFETCH(p + 1);
 1269|  12.6k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  12.6k|            }
 1271|  4.23k|        } else {
 1272|  3.51k|            auto ss = shift_ - B;
 1273|  14.0k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 10.5k, False: 3.51k]
  ------------------
 1274|  10.5k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  3.51k|        }
 1276|  7.74k|    }
_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|  22.6k|    {
  208|  22.6k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  22.6k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  200|   114k|    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.2k|    {
 1406|  28.2k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  28.2k|    }
_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|    651|    {
  754|    651|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    651|    }
_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|    651|    {
  145|    651|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    651|    }
_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|    651|    {
 1371|    651|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 651, False: 0]
  ------------------
 1372|    651|        auto child = node_->inner()[0];
 1373|    651|        return make_full_leaf_pos(child).visit(v, args...);
 1374|    651|    }
_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.54k|    {
  208|  1.54k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.54k|    }
_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|  61.8k|    {
  907|  61.8k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 25.3k, False: 36.5k]
  ------------------
  908|  25.3k|            each_right_sub_(v, 1, args...);
  909|  61.8k|    }
_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|  25.3k|    {
  880|  25.3k|        auto last  = count() - 1;
  881|  25.3k|        auto lsize = size_ - (last << shift_);
  882|  25.3k|        auto n     = node()->inner() + i;
  883|  25.3k|        auto e     = node()->inner() + last;
  884|  25.3k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 13.1k, False: 12.1k]
  ------------------
  885|  26.3k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 13.1k, False: 13.1k]
  ------------------
  886|  13.1k|                IMMER_PREFETCH(n + 1);
  887|  13.1k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  13.1k|            }
  889|  13.1k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  13.1k|        } else {
  891|  12.1k|            auto ss = shift_ - B;
  892|  22.0k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 9.96k, False: 12.1k]
  ------------------
  893|  9.96k|                make_full_pos(*n, ss).visit(v, args...);
  894|  12.1k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  12.1k|        }
  896|  25.3k|    }
_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|   147k|    {
 1037|   147k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   147k|    }
_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.1k|    {
  907|  10.1k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 6.79k, False: 3.33k]
  ------------------
  908|  6.79k|            each_right_sub_(v, 1, args...);
  909|  10.1k|    }
_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.79k|    {
  880|  6.79k|        auto last  = count() - 1;
  881|  6.79k|        auto lsize = size_ - (last << shift_);
  882|  6.79k|        auto n     = node()->inner() + i;
  883|  6.79k|        auto e     = node()->inner() + last;
  884|  6.79k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 2.56k, False: 4.23k]
  ------------------
  885|  5.45k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 2.88k, False: 2.56k]
  ------------------
  886|  2.88k|                IMMER_PREFETCH(n + 1);
  887|  2.88k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  2.88k|            }
  889|  2.56k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  4.23k|        } else {
  891|  4.23k|            auto ss = shift_ - B;
  892|  6.57k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 2.34k, False: 4.23k]
  ------------------
  893|  2.34k|                make_full_pos(*n, ss).visit(v, args...);
  894|  4.23k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  4.23k|        }
  896|  6.79k|    }
_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|  18.8k|    {
 1037|  18.8k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  18.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|    895|    {
  754|    895|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    895|    }
_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|    895|    {
  145|    895|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    895|    }
_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|    895|    {
  987|    895|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 895, False: 0]
  ------------------
  988|    895|        auto child   = node_->inner()[0];
  989|    895|        auto is_full = size_ >= branches<BL>;
  990|    895|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 895, False: 0]
  ------------------
  991|    895|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|    895|    }
_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.70k|    {
  145|  1.70k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.70k|    }
_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|   683k|    {
 1648|   683k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   683k|    }
_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|   683k|    {
 1654|   683k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 683k, False: 0]
  ------------------
 1655|   683k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 683k, False: 0]
  ------------------
 1656|   683k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   683k|        auto p = node_->inner();
 1658|   683k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 110k, False: 572k]
  ------------------
 1659|   384k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 273k, False: 110k]
  ------------------
 1660|   273k|                IMMER_PREFETCH(p + i + 1);
 1661|   273k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   273k|                    .visit(v, args...);
 1663|   273k|                s = relaxed_->d.sizes[i];
 1664|   273k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 273k, False: 0]
  ------------------
 1665|   273k|            }
 1666|   572k|        } else {
 1667|   572k|            auto ss = shift_ - B;
 1668|  1.97M|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 1.40M, False: 572k]
  ------------------
 1669|  1.40M|                visit_maybe_relaxed_sub(
 1670|  1.40M|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|  1.40M|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 1.40M, False: 0]
  ------------------
 1673|  1.40M|            }
 1674|   572k|        }
 1675|   683k|    }
_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.76M|{
 1839|  2.76M|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 2.76M, False: 0]
  ------------------
 1840|  2.76M|    auto relaxed = node->relaxed();
 1841|  2.76M|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 2.63M, False: 135k]
  ------------------
 1842|  2.63M|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 2.63M, False: 0]
  ------------------
 1843|  2.63M|        return make_relaxed_pos(node, shift, relaxed)
 1844|  2.63M|            .visit(v, std::forward<Args>(args)...);
 1845|  2.63M|    } else {
 1846|   135k|        return make_regular_sub_pos(node, shift, size)
 1847|   135k|            .visit(v, std::forward<Args>(args)...);
 1848|   135k|    }
 1849|  2.76M|}
_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|   218k|    {
 1648|   218k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   218k|    }
_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|   218k|    {
 1654|   218k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 218k, False: 0]
  ------------------
 1655|   218k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 218k, False: 0]
  ------------------
 1656|   218k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   218k|        auto p = node_->inner();
 1658|   218k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 37.6k, False: 180k]
  ------------------
 1659|   142k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 104k, False: 37.6k]
  ------------------
 1660|   104k|                IMMER_PREFETCH(p + i + 1);
 1661|   104k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   104k|                    .visit(v, args...);
 1663|   104k|                s = relaxed_->d.sizes[i];
 1664|   104k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 104k, False: 0]
  ------------------
 1665|   104k|            }
 1666|   180k|        } else {
 1667|   180k|            auto ss = shift_ - B;
 1668|   669k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 488k, False: 180k]
  ------------------
 1669|   488k|                visit_maybe_relaxed_sub(
 1670|   488k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|   488k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 488k, False: 0]
  ------------------
 1673|   488k|            }
 1674|   180k|        }
 1675|   218k|    }
_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|   927k|{
 1839|   927k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 927k, False: 0]
  ------------------
 1840|   927k|    auto relaxed = node->relaxed();
 1841|   927k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 913k, False: 14.6k]
  ------------------
 1842|   913k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 913k, False: 0]
  ------------------
 1843|   913k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   913k|            .visit(v, std::forward<Args>(args)...);
 1845|   913k|    } else {
 1846|  14.6k|        return make_regular_sub_pos(node, shift, size)
 1847|  14.6k|            .visit(v, std::forward<Args>(args)...);
 1848|  14.6k|    }
 1849|   927k|}
_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.70k|    {
  754|  1.70k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  1.70k|    }
_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.70k|    {
  145|  1.70k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.70k|    }
_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.70k|    {
 1775|  1.70k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 1.70k, False: 0]
  ------------------
 1776|  1.70k|        auto child      = node_->inner()[0];
 1777|  1.70k|        auto child_size = relaxed_->d.sizes[0];
 1778|  1.70k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  1.70k|    }
_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.33k|    {
 1037|  1.33k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.33k|    }
_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|  44.5k|{
 1839|  44.5k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 44.5k, False: 0]
  ------------------
 1840|  44.5k|    auto relaxed = node->relaxed();
 1841|  44.5k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 38.9k, False: 5.54k]
  ------------------
 1842|  38.9k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 38.9k, False: 0]
  ------------------
 1843|  38.9k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  38.9k|            .visit(v, std::forward<Args>(args)...);
 1845|  38.9k|    } else {
 1846|  5.54k|        return make_regular_sub_pos(node, shift, size)
 1847|  5.54k|            .visit(v, std::forward<Args>(args)...);
 1848|  5.54k|    }
 1849|  44.5k|}
_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|  38.9k|    {
 1814|  38.9k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  38.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|  38.9k|{
 1839|  38.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 38.9k, False: 0]
  ------------------
 1840|  38.9k|    auto relaxed = node->relaxed();
 1841|  38.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 36.4k, False: 2.57k]
  ------------------
 1842|  36.4k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 36.4k, False: 0]
  ------------------
 1843|  36.4k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  36.4k|            .visit(v, std::forward<Args>(args)...);
 1845|  36.4k|    } else {
 1846|  2.57k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.57k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.57k|    }
 1849|  38.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|  36.4k|    {
 1814|  36.4k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  36.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.57k|    {
 1751|  2.57k|        auto offset     = relaxed_->d.count - 1;
 1752|  2.57k|        auto child      = node_->inner()[offset];
 1753|  2.57k|        auto child_size = size(offset);
 1754|  2.57k|        auto is_leaf    = shift_ == BL;
 1755|  2.57k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 2.57k]
  ------------------
 1756|  2.57k|                       : visit_maybe_relaxed_sub(
 1757|  2.57k|                             child, shift_ - B, child_size, v, args...);
 1758|  2.57k|    }
_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.57k|{
 1839|  2.57k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 2.57k, False: 0]
  ------------------
 1840|  2.57k|    auto relaxed = node->relaxed();
 1841|  2.57k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 2.24k, False: 328]
  ------------------
 1842|  2.24k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 2.24k, False: 0]
  ------------------
 1843|  2.24k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  2.24k|            .visit(v, std::forward<Args>(args)...);
 1845|  2.24k|    } else {
 1846|    328|        return make_regular_sub_pos(node, shift, size)
 1847|    328|            .visit(v, std::forward<Args>(args)...);
 1848|    328|    }
 1849|  2.57k|}
_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.24k|    {
 1814|  2.24k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  2.24k|    }
_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|    791|    {
 1037|    791|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    791|    }
_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|    463|    {
  959|    463|        auto offset  = count() - 1;
  960|    463|        auto child   = node_->inner()[offset];
  961|    463|        auto is_leaf = shift_ == BL;
  962|    463|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|    463|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 463]
  ------------------
  964|    463|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|    463|                             .visit(v, args...);
  966|    463|    }
_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|   177k|    {
  914|   177k|        each_left(v, count() - 1, args...);
  915|   177k|    }
_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|   177k|    {
  874|   177k|        return each_left_regular(*this, v, last, args...);
  875|   177k|    }
_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|   177k|{
  576|   177k|    constexpr auto B  = bits<Pos>;
  577|   177k|    constexpr auto BL = bits_leaf<Pos>;
  578|   177k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 177k, False: 0]
  ------------------
  579|   177k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 55.9k, False: 121k]
  ------------------
  580|  55.9k|        auto n = p.node()->inner();
  581|  55.9k|        auto e = n + last;
  582|   121k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 65.4k, False: 55.9k]
  ------------------
  583|  65.4k|            IMMER_PREFETCH(n + 1);
  584|  65.4k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  65.4k|        }
  586|   121k|    } else {
  587|   121k|        auto n  = p.node()->inner();
  588|   121k|        auto e  = n + last;
  589|   121k|        auto ss = p.shift() - B;
  590|   276k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 155k, False: 121k]
  ------------------
  591|   155k|            make_full_pos(*n, ss).visit(v, args...);
  592|   121k|    }
  593|   177k|}
_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|  22.4k|    {
  914|  22.4k|        each_left(v, count() - 1, args...);
  915|  22.4k|    }
_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|  22.4k|    {
  874|  22.4k|        return each_left_regular(*this, v, last, args...);
  875|  22.4k|    }
_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|  22.4k|{
  576|  22.4k|    constexpr auto B  = bits<Pos>;
  577|  22.4k|    constexpr auto BL = bits_leaf<Pos>;
  578|  22.4k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 22.4k, False: 0]
  ------------------
  579|  22.4k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 10.4k, False: 12.0k]
  ------------------
  580|  10.4k|        auto n = p.node()->inner();
  581|  10.4k|        auto e = n + last;
  582|  17.5k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 7.11k, False: 10.4k]
  ------------------
  583|  7.11k|            IMMER_PREFETCH(n + 1);
  584|  7.11k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  7.11k|        }
  586|  12.0k|    } else {
  587|  12.0k|        auto n  = p.node()->inner();
  588|  12.0k|        auto e  = n + last;
  589|  12.0k|        auto ss = p.shift() - B;
  590|  27.3k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 15.3k, False: 12.0k]
  ------------------
  591|  15.3k|            make_full_pos(*n, ss).visit(v, args...);
  592|  12.0k|    }
  593|  22.4k|}
_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|  11.9k|    {
 1763|  11.9k|        auto child      = node_->inner()[0];
 1764|  11.9k|        auto child_size = relaxed_->d.sizes[0];
 1765|  11.9k|        auto is_leaf    = shift_ == BL;
 1766|  11.9k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 11.9k, False: 0]
  ------------------
 1767|  11.9k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 11.9k]
  ------------------
 1768|  11.9k|                       : visit_maybe_relaxed_sub(
 1769|  11.9k|                             child, shift_ - B, child_size, v, args...);
 1770|  11.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|  11.9k|{
 1839|  11.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 11.9k, False: 0]
  ------------------
 1840|  11.9k|    auto relaxed = node->relaxed();
 1841|  11.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 10.7k, False: 1.17k]
  ------------------
 1842|  10.7k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 10.7k, False: 0]
  ------------------
 1843|  10.7k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  10.7k|            .visit(v, std::forward<Args>(args)...);
 1845|  10.7k|    } else {
 1846|  1.17k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.17k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.17k|    }
 1849|  11.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|  10.7k|    {
 1814|  10.7k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  10.7k|    }
_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.17k|    {
 1037|  1.17k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.17k|    }
_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.17k|    {
  959|  1.17k|        auto offset  = count() - 1;
  960|  1.17k|        auto child   = node_->inner()[offset];
  961|  1.17k|        auto is_leaf = shift_ == BL;
  962|  1.17k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  1.17k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 1.17k]
  ------------------
  964|  1.17k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.17k|                             .visit(v, args...);
  966|  1.17k|    }
_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.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_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRSD_RNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
  970|  2.35k|    {
  971|  2.35k|        auto is_leaf = shift_ == BL;
  972|  2.35k|        auto child   = node_->inner()[0];
  973|  2.35k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  2.35k|        return is_full
  ------------------
  |  Branch (974:16): [True: 2.35k, False: 0]
  ------------------
  975|  2.35k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 2.35k]
  ------------------
  976|  2.35k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  2.35k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  2.35k|                   : (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.35k|    }
_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.44k|    {
 1406|  4.44k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  4.44k|    }
_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.08k|    {
 1362|  2.08k|        auto is_leaf = shift_ == BL;
 1363|  2.08k|        auto child   = node_->inner()[0];
 1364|  2.08k|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 2.08k]
  ------------------
 1365|  2.08k|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|  2.08k|    }
_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.22k|    {
  959|  4.22k|        auto offset  = count() - 1;
  960|  4.22k|        auto child   = node_->inner()[offset];
  961|  4.22k|        auto is_leaf = shift_ == BL;
  962|  4.22k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  4.22k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 2.58k, False: 1.64k]
  ------------------
  964|  4.22k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.64k|                             .visit(v, args...);
  966|  4.22k|    }
_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.58k|    {
  145|  3.58k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.58k|    }
_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.58k|    {
 1371|  3.58k|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 3.58k, False: 0]
  ------------------
 1372|  3.58k|        auto child = node_->inner()[0];
 1373|  3.58k|        return make_full_leaf_pos(child).visit(v, args...);
 1374|  3.58k|    }
_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|  8.58k|    {
  208|  8.58k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  8.58k|    }
_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|  1.87k|    {
 1037|  1.87k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.87k|    }
_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|  5.45k|    {
  959|  5.45k|        auto offset  = count() - 1;
  960|  5.45k|        auto child   = node_->inner()[offset];
  961|  5.45k|        auto is_leaf = shift_ == BL;
  962|  5.45k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  5.45k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 4.17k, False: 1.28k]
  ------------------
  964|  5.45k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.28k|                             .visit(v, args...);
  966|  5.45k|    }
_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.00k|    {
  145|  5.00k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  5.00k|    }
_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.00k|    {
  987|  5.00k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 5.00k, False: 0]
  ------------------
  988|  5.00k|        auto child   = node_->inner()[0];
  989|  5.00k|        auto is_full = size_ >= branches<BL>;
  990|  5.00k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 5.00k, False: 0]
  ------------------
  991|  5.00k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  5.00k|    }
_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|  35.9k|    {
  145|  35.9k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  35.9k|    }
_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.71k|    {
 1037|  1.71k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.71k|    }
_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.0k|    {
  959|  11.0k|        auto offset  = count() - 1;
  960|  11.0k|        auto child   = node_->inner()[offset];
  961|  11.0k|        auto is_leaf = shift_ == BL;
  962|  11.0k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  11.0k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 3.64k, False: 7.45k]
  ------------------
  964|  11.0k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  7.45k|                             .visit(v, args...);
  966|  11.0k|    }
_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|  35.9k|    {
  145|  35.9k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  35.9k|    }
_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|  35.9k|    {
 1775|  35.9k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 35.9k, False: 0]
  ------------------
 1776|  35.9k|        auto child      = node_->inner()[0];
 1777|  35.9k|        auto child_size = relaxed_->d.sizes[0];
 1778|  35.9k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  35.9k|    }
_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|  10.9k|    {
 1037|  10.9k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  10.9k|    }
_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|   958k|    {
 1618|   958k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   958k|    }
_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|   958k|    {
 1624|   958k|        auto p = node_->inner();
 1625|   958k|        auto s = size_t{};
 1626|   958k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 106k, False: 851k]
  ------------------
 1627|   282k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 176k, False: 106k]
  ------------------
 1628|   176k|                IMMER_PREFETCH(p + i + 1);
 1629|   176k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|   176k|                    .visit(v, args...);
 1631|   176k|                s = relaxed_->d.sizes[i];
 1632|   176k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 176k, False: 0]
  ------------------
 1633|   176k|            }
 1634|   851k|        } else {
 1635|   851k|            auto ss = shift_ - B;
 1636|  2.21M|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 1.36M, False: 851k]
  ------------------
 1637|  1.36M|                visit_maybe_relaxed_sub(
 1638|  1.36M|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|  1.36M|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 1.36M, False: 0]
  ------------------
 1641|  1.36M|            }
 1642|   851k|        }
 1643|   958k|    }
_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|   203k|    {
 1618|   203k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   203k|    }
_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|   203k|    {
 1624|   203k|        auto p = node_->inner();
 1625|   203k|        auto s = size_t{};
 1626|   203k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 34.1k, False: 169k]
  ------------------
 1627|  99.9k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 65.8k, False: 34.1k]
  ------------------
 1628|  65.8k|                IMMER_PREFETCH(p + i + 1);
 1629|  65.8k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|  65.8k|                    .visit(v, args...);
 1631|  65.8k|                s = relaxed_->d.sizes[i];
 1632|  65.8k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 65.8k, False: 0]
  ------------------
 1633|  65.8k|            }
 1634|   169k|        } else {
 1635|   169k|            auto ss = shift_ - B;
 1636|   608k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 439k, False: 169k]
  ------------------
 1637|   439k|                visit_maybe_relaxed_sub(
 1638|   439k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|   439k|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 439k, False: 0]
  ------------------
 1641|   439k|            }
 1642|   169k|        }
 1643|   203k|    }
_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|   162k|    {
 1763|   162k|        auto child      = node_->inner()[0];
 1764|   162k|        auto child_size = relaxed_->d.sizes[0];
 1765|   162k|        auto is_leaf    = shift_ == BL;
 1766|   162k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 162k, False: 0]
  ------------------
 1767|   162k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 162k]
  ------------------
 1768|   162k|                       : visit_maybe_relaxed_sub(
 1769|   162k|                             child, shift_ - B, child_size, v, args...);
 1770|   162k|    }
_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|   162k|{
 1839|   162k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 162k, False: 0]
  ------------------
 1840|   162k|    auto relaxed = node->relaxed();
 1841|   162k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 162k, False: 274]
  ------------------
 1842|   162k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 162k, False: 0]
  ------------------
 1843|   162k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   162k|            .visit(v, std::forward<Args>(args)...);
 1845|   162k|    } else {
 1846|    274|        return make_regular_sub_pos(node, shift, size)
 1847|    274|            .visit(v, std::forward<Args>(args)...);
 1848|    274|    }
 1849|   162k|}
_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|   162k|    {
 1814|   162k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   162k|    }
_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|    274|    {
 1037|    274|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    274|    }
_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.57k, False: 366]
  ------------------
 1842|  1.57k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.57k, False: 0]
  ------------------
 1843|  1.57k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.57k|            .visit(v, std::forward<Args>(args)...);
 1845|  1.57k|    } else {
 1846|    366|        return make_regular_sub_pos(node, shift, size)
 1847|    366|            .visit(v, std::forward<Args>(args)...);
 1848|    366|    }
 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.57k|    {
 1814|  1.57k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.57k|    }
_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.22k|    {
  971|  1.22k|        auto is_leaf = shift_ == BL;
  972|  1.22k|        auto child   = node_->inner()[0];
  973|  1.22k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  1.22k|        return is_full
  ------------------
  |  Branch (974:16): [True: 1.22k, False: 0]
  ------------------
  975|  1.22k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 1.22k]
  ------------------
  976|  1.22k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  1.22k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  1.22k|                   : (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.22k|    }
_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.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_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1361|    768|    {
 1362|    768|        auto is_leaf = shift_ == BL;
 1363|    768|        auto child   = node_->inner()[0];
 1364|    768|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 768]
  ------------------
 1365|    768|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    768|    }
_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.71k|    {
 1751|  1.71k|        auto offset     = relaxed_->d.count - 1;
 1752|  1.71k|        auto child      = node_->inner()[offset];
 1753|  1.71k|        auto child_size = size(offset);
 1754|  1.71k|        auto is_leaf    = shift_ == BL;
 1755|  1.71k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 994, False: 717]
  ------------------
 1756|  1.71k|                       : visit_maybe_relaxed_sub(
 1757|    717|                             child, shift_ - B, child_size, v, args...);
 1758|  1.71k|    }
_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|    717|{
 1839|    717|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 717, False: 0]
  ------------------
 1840|    717|    auto relaxed = node->relaxed();
 1841|    717|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 484, False: 233]
  ------------------
 1842|    484|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 484, False: 0]
  ------------------
 1843|    484|        return make_relaxed_pos(node, shift, relaxed)
 1844|    484|            .visit(v, std::forward<Args>(args)...);
 1845|    484|    } else {
 1846|    233|        return make_regular_sub_pos(node, shift, size)
 1847|    233|            .visit(v, std::forward<Args>(args)...);
 1848|    233|    }
 1849|    717|}
_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|    484|    {
 1814|    484|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    484|    }
_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.79k|    {
 1751|  1.79k|        auto offset     = relaxed_->d.count - 1;
 1752|  1.79k|        auto child      = node_->inner()[offset];
 1753|  1.79k|        auto child_size = size(offset);
 1754|  1.79k|        auto is_leaf    = shift_ == BL;
 1755|  1.79k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 830, False: 961]
  ------------------
 1756|  1.79k|                       : visit_maybe_relaxed_sub(
 1757|    961|                             child, shift_ - B, child_size, v, args...);
 1758|  1.79k|    }
_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|    961|{
 1839|    961|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 961, False: 0]
  ------------------
 1840|    961|    auto relaxed = node->relaxed();
 1841|    961|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 535, False: 426]
  ------------------
 1842|    535|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 535, False: 0]
  ------------------
 1843|    535|        return make_relaxed_pos(node, shift, relaxed)
 1844|    535|            .visit(v, std::forward<Args>(args)...);
 1845|    535|    } else {
 1846|    426|        return make_regular_sub_pos(node, shift, size)
 1847|    426|            .visit(v, std::forward<Args>(args)...);
 1848|    426|    }
 1849|    961|}
_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|    535|    {
 1814|    535|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    535|    }
_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|   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: 32.2k, False: 163k]
  ------------------
 1756|   195k|                       : visit_maybe_relaxed_sub(
 1757|   163k|                             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_19concat_both_visitorISC_EEJRNS1_8leaf_posISC_EERNS1_11relaxed_posISC_EEEEEDcPT_jmT0_DpOT1_:
 1838|   163k|{
 1839|   163k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 163k, False: 0]
  ------------------
 1840|   163k|    auto relaxed = node->relaxed();
 1841|   163k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 159k, False: 3.50k]
  ------------------
 1842|   159k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 159k, False: 0]
  ------------------
 1843|   159k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   159k|            .visit(v, std::forward<Args>(args)...);
 1845|   159k|    } else {
 1846|  3.50k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.50k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.50k|    }
 1849|   163k|}
_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|   159k|    {
 1814|   159k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   159k|    }
_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.57k|    {
 1037|  2.57k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.57k|    }
_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|  5.54k|    {
 1037|  5.54k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  5.54k|    }
_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|  5.54k|{
 1839|  5.54k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 5.54k, False: 0]
  ------------------
 1840|  5.54k|    auto relaxed = node->relaxed();
 1841|  5.54k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 978, False: 4.56k]
  ------------------
 1842|    978|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 978, False: 0]
  ------------------
 1843|    978|        return make_relaxed_pos(node, shift, relaxed)
 1844|    978|            .visit(v, std::forward<Args>(args)...);
 1845|  4.56k|    } else {
 1846|  4.56k|        return make_regular_sub_pos(node, shift, size)
 1847|  4.56k|            .visit(v, std::forward<Args>(args)...);
 1848|  4.56k|    }
 1849|  5.54k|}
_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|    978|    {
 1814|    978|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    978|    }
_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|  4.56k|    {
 1037|  4.56k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.56k|    }
_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|   726k|    {
 1814|   726k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   726k|    }
_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|   715k|    {
 1738|   715k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 715k, False: 0]
  ------------------
 1739|   715k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 715k, False: 0]
  ------------------
 1740|   715k|        auto child   = node_->inner()[offset_hint];
 1741|   715k|        auto is_leaf = shift_ == BL;
 1742|   715k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 715k]
  ------------------
 1743|   715k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|   715k|                   : visit_maybe_relaxed_sub(
 1745|   715k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|   715k|    }
_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|   715k|{
 1839|   715k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 715k, False: 0]
  ------------------
 1840|   715k|    auto relaxed = node->relaxed();
 1841|   715k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 86.1k, False: 629k]
  ------------------
 1842|  86.1k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 86.1k, False: 0]
  ------------------
 1843|  86.1k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  86.1k|            .visit(v, std::forward<Args>(args)...);
 1845|   629k|    } else {
 1846|   629k|        return make_regular_sub_pos(node, shift, size)
 1847|   629k|            .visit(v, std::forward<Args>(args)...);
 1848|   629k|    }
 1849|   715k|}
_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|   629k|    {
 1037|   629k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   629k|    }
_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.64M|    {
  953|  1.64M|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  1.64M|    }
_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.64M|{
  678|  1.64M|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 1.64M, False: 0]
  ------------------
  679|  1.64M|    constexpr auto B  = bits<Pos>;
  680|  1.64M|    constexpr auto BL = bits_leaf<Pos>;
  681|  1.64M|    auto child        = p.node()->inner()[offset_hint];
  682|  1.64M|    auto is_leaf      = p.shift() == BL;
  683|  1.64M|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 1.64M]
  ------------------
  684|  1.64M|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  1.64M|                         .visit(v, args...);
  686|  1.64M|}
_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|  8.85M|    {
  337|  8.85M|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  8.85M|    }
_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.20M|    {
  331|  7.20M|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  7.20M|    }
_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.20M|{
  678|  7.20M|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 7.20M, False: 0]
  ------------------
  679|  7.20M|    constexpr auto B  = bits<Pos>;
  680|  7.20M|    constexpr auto BL = bits_leaf<Pos>;
  681|  7.20M|    auto child        = p.node()->inner()[offset_hint];
  682|  7.20M|    auto is_leaf      = p.shift() == BL;
  683|  7.20M|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 7.20M]
  ------------------
  684|  7.20M|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  7.20M|                         .visit(v, args...);
  686|  7.20M|}
_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|  7.15k|    {
  331|  7.15k|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  7.15k|    }
_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|  7.15k|{
  678|  7.15k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 7.15k, False: 0]
  ------------------
  679|  7.15k|    constexpr auto B  = bits<Pos>;
  680|  7.15k|    constexpr auto BL = bits_leaf<Pos>;
  681|  7.15k|    auto child        = p.node()->inner()[offset_hint];
  682|  7.15k|    auto is_leaf      = p.shift() == BL;
  683|  7.15k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 7.15k]
  ------------------
  684|  7.15k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  7.15k|                         .visit(v, args...);
  686|  7.15k|}
_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|  11.8k|    {
  337|  11.8k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  11.8k|    }
_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|  4.74k|    {
  953|  4.74k|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  4.74k|    }
_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|  4.74k|{
  678|  4.74k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 4.74k, False: 0]
  ------------------
  679|  4.74k|    constexpr auto B  = bits<Pos>;
  680|  4.74k|    constexpr auto BL = bits_leaf<Pos>;
  681|  4.74k|    auto child        = p.node()->inner()[offset_hint];
  682|  4.74k|    auto is_leaf      = p.shift() == BL;
  683|  4.74k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 4.74k]
  ------------------
  684|  4.74k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  4.74k|                         .visit(v, args...);
  686|  4.74k|}
_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.0k|    {
 1738|  21.0k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 21.0k, False: 0]
  ------------------
 1739|  21.0k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 21.0k, False: 0]
  ------------------
 1740|  21.0k|        auto child   = node_->inner()[offset_hint];
 1741|  21.0k|        auto is_leaf = shift_ == BL;
 1742|  21.0k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 21.0k]
  ------------------
 1743|  21.0k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|  21.0k|                   : visit_maybe_relaxed_sub(
 1745|  21.0k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|  21.0k|    }
_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.0k|{
 1839|  21.0k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 21.0k, False: 0]
  ------------------
 1840|  21.0k|    auto relaxed = node->relaxed();
 1841|  21.0k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 18.0k, False: 2.95k]
  ------------------
 1842|  18.0k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 18.0k, False: 0]
  ------------------
 1843|  18.0k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  18.0k|            .visit(v, std::forward<Args>(args)...);
 1845|  18.0k|    } else {
 1846|  2.95k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.95k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.95k|    }
 1849|  21.0k|}
_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.0k|    {
 1814|  18.0k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  18.0k|    }
_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|  2.95k|    {
 1037|  2.95k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.95k|    }
_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.03M|    {
 1037|  1.03M|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.03M|    }
_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.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: 5.23k, False: 5.28k]
  ------------------
 1842|  5.23k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 5.23k, False: 0]
  ------------------
 1843|  5.23k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  5.23k|            .visit(v, std::forward<Args>(args)...);
 1845|  5.28k|    } else {
 1846|  5.28k|        return make_regular_sub_pos(node, shift, size)
 1847|  5.28k|            .visit(v, std::forward<Args>(args)...);
 1848|  5.28k|    }
 1849|  10.5k|}
_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.23k|    {
 1814|  5.23k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  5.23k|    }
_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|  22.5k|    {
 1687|  22.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 22.5k, False: 0]
  ------------------
 1688|  22.5k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 4.64k, False: 17.9k]
  ------------------
 1689|  22.5k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  22.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|  22.5k|    {
 1699|  22.5k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  22.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|  22.5k|    {
 1718|  22.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 22.5k, False: 0]
  ------------------
 1719|  22.5k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 4.64k, False: 17.9k]
  |  Branch (1719:9): [True: 22.5k, False: 0]
  ------------------
 1720|  22.5k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  22.5k|        auto child     = node_->inner()[offset_hint];
 1722|  22.5k|        auto is_leaf   = shift_ == BL;
 1723|  22.5k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  22.5k|        auto next_idx  = idx - left_size_hint;
 1725|  22.5k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 3.26k, False: 19.2k]
  ------------------
 1726|  22.5k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  3.26k|                         .visit(v, next_idx, args...)
 1728|  22.5k|                   : visit_maybe_relaxed_sub(
 1729|  19.2k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  22.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.26k|    {
  145|  3.26k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.26k|    }
_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|  19.2k|{
 1839|  19.2k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 19.2k, False: 0]
  ------------------
 1840|  19.2k|    auto relaxed = node->relaxed();
 1841|  19.2k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 17.3k, False: 1.96k]
  ------------------
 1842|  17.3k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 17.3k, False: 0]
  ------------------
 1843|  17.3k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  17.3k|            .visit(v, std::forward<Args>(args)...);
 1845|  17.3k|    } else {
 1846|  1.96k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.96k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.96k|    }
 1849|  19.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|  17.3k|    {
 1814|  17.3k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  17.3k|    }
_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.96k|    {
 1037|  1.96k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.96k|    }
_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.24k|    {
  939|  7.24k|        return towards_oh_ch_regular(
  940|  7.24k|            *this, v, idx, offset_hint, count(), args...);
  941|  7.24k|    }
_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.24k|{
  633|  7.24k|    constexpr auto B  = bits<Pos>;
  634|  7.24k|    constexpr auto BL = bits_leaf<Pos>;
  635|  7.24k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 7.24k, False: 0]
  ------------------
  636|  7.24k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 7.24k, False: 0]
  ------------------
  637|  7.24k|    auto is_leaf = p.shift() == BL;
  638|  7.24k|    auto child   = p.node()->inner()[offset_hint];
  639|  7.24k|    auto is_full = offset_hint + 1 != count_hint;
  640|  7.24k|    return is_full
  ------------------
  |  Branch (640:12): [True: 4.98k, False: 2.26k]
  ------------------
  641|  7.24k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 951, False: 4.03k]
  ------------------
  642|  4.98k|                          : make_full_pos(child, p.shift() - B)
  643|  4.03k|                                .visit(v, idx, args...))
  644|  7.24k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 509, False: 1.75k]
  ------------------
  645|  2.26k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.26k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.75k|                            .visit(v, idx, args...));
  648|  7.24k|}
_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|  5.93k|    {
  208|  5.93k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  5.93k|    }
_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|  7.35k|    {
 1406|  7.35k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  7.35k|    }
_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|  7.35k|    {
 1330|  7.35k|        return towards_oh(v, idx, offset_hint, args...);
 1331|  7.35k|    }
_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|  7.35k|    {
 1337|  7.35k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 7.35k, False: 0]
  ------------------
 1338|  7.35k|        auto is_leaf = shift_ == BL;
 1339|  7.35k|        auto child   = node_->inner()[offset_hint];
 1340|  7.35k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 4.35k, False: 3.00k]
  ------------------
 1341|  7.35k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  7.35k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  7.35k|    }
_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.31k|    {
  113|  1.31k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  1.31k|    }
_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|  2.52k|    {
  337|  2.52k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.52k|    }
_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|  2.52k|    {
  317|  2.52k|        return towards_oh_ch_regular(
  318|  2.52k|            *this, v, idx, offset_hint, count(), args...);
  319|  2.52k|    }
_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|  2.52k|{
  633|  2.52k|    constexpr auto B  = bits<Pos>;
  634|  2.52k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.52k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.52k, False: 0]
  ------------------
  636|  2.52k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.52k, False: 0]
  ------------------
  637|  2.52k|    auto is_leaf = p.shift() == BL;
  638|  2.52k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.52k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.52k|    return is_full
  ------------------
  |  Branch (640:12): [True: 951, False: 1.57k]
  ------------------
  641|  2.52k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 632, False: 319]
  ------------------
  642|    951|                          : make_full_pos(child, p.shift() - B)
  643|    319|                                .visit(v, idx, args...))
  644|  2.52k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 803, False: 773]
  ------------------
  645|  1.57k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.57k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    773|                            .visit(v, idx, args...));
  648|  2.52k|}
_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.28k|    {
 1037|  5.28k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  5.28k|    }
_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|  67.6k|{
 1839|  67.6k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 67.6k, False: 0]
  ------------------
 1840|  67.6k|    auto relaxed = node->relaxed();
 1841|  67.6k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 52.2k, False: 15.4k]
  ------------------
 1842|  52.2k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 52.2k, False: 0]
  ------------------
 1843|  52.2k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  52.2k|            .visit(v, std::forward<Args>(args)...);
 1845|  52.2k|    } else {
 1846|  15.4k|        return make_regular_sub_pos(node, shift, size)
 1847|  15.4k|            .visit(v, std::forward<Args>(args)...);
 1848|  15.4k|    }
 1849|  67.6k|}
_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|  52.2k|    {
 1814|  52.2k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  52.2k|    }
_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|  34.9k|    {
 1687|  34.9k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 34.9k, False: 0]
  ------------------
 1688|  34.9k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 34.9k]
  ------------------
 1689|  34.9k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  34.9k|    }
_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|  34.9k|    {
 1699|  34.9k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  34.9k|    }
_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|  34.9k|    {
 1718|  34.9k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 34.9k, False: 0]
  ------------------
 1719|  34.9k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 34.9k]
  |  Branch (1719:9): [True: 34.9k, False: 0]
  ------------------
 1720|  34.9k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  34.9k|        auto child     = node_->inner()[offset_hint];
 1722|  34.9k|        auto is_leaf   = shift_ == BL;
 1723|  34.9k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  34.9k|        auto next_idx  = idx - left_size_hint;
 1725|  34.9k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 2.18k, False: 32.7k]
  ------------------
 1726|  34.9k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  2.18k|                         .visit(v, next_idx, args...)
 1728|  34.9k|                   : visit_maybe_relaxed_sub(
 1729|  32.7k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  34.9k|    }
_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.18k|    {
  145|  2.18k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  2.18k|    }
_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|  20.0k|    {
 1687|  20.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 20.0k, False: 0]
  ------------------
 1688|  20.0k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 20.0k]
  ------------------
 1689|  20.0k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  20.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|  20.0k|    {
 1699|  20.0k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  20.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|  20.0k|    {
 1718|  20.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 20.0k, False: 0]
  ------------------
 1719|  20.0k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 20.0k]
  |  Branch (1719:9): [True: 20.0k, False: 0]
  ------------------
 1720|  20.0k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  20.0k|        auto child     = node_->inner()[offset_hint];
 1722|  20.0k|        auto is_leaf   = shift_ == BL;
 1723|  20.0k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  20.0k|        auto next_idx  = idx - left_size_hint;
 1725|  20.0k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 1.09k, False: 18.9k]
  ------------------
 1726|  20.0k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  1.09k|                         .visit(v, next_idx, args...)
 1728|  20.0k|                   : visit_maybe_relaxed_sub(
 1729|  18.9k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  20.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.09k|    {
  145|  1.09k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.09k|    }
_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|  18.9k|{
 1839|  18.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 18.9k, False: 0]
  ------------------
 1840|  18.9k|    auto relaxed = node->relaxed();
 1841|  18.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 17.7k, False: 1.27k]
  ------------------
 1842|  17.7k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 17.7k, False: 0]
  ------------------
 1843|  17.7k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  17.7k|            .visit(v, std::forward<Args>(args)...);
 1845|  17.7k|    } else {
 1846|  1.27k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.27k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.27k|    }
 1849|  18.9k|}
_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|  17.7k|    {
 1814|  17.7k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  17.7k|    }
_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.27k|    {
 1037|  1.27k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.27k|    }
_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.35k|    {
  928|  3.35k|        return towards_oh_ch_regular(
  929|  3.35k|            *this, v, idx, offset_hint, count(), args...);
  930|  3.35k|    }
_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.35k|{
  633|  3.35k|    constexpr auto B  = bits<Pos>;
  634|  3.35k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.35k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.35k, False: 0]
  ------------------
  636|  3.35k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.35k, False: 0]
  ------------------
  637|  3.35k|    auto is_leaf = p.shift() == BL;
  638|  3.35k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.35k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.35k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.59k, False: 764]
  ------------------
  641|  3.35k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 659, False: 1.93k]
  ------------------
  642|  2.59k|                          : make_full_pos(child, p.shift() - B)
  643|  1.93k|                                .visit(v, idx, args...))
  644|  3.35k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 764, False: 0]
  ------------------
  645|    764|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    764|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .visit(v, idx, args...));
  648|  3.35k|}
_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|  3.49k|    {
 1406|  3.49k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  3.49k|    }
_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|  2.40k|    {
 1337|  2.40k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 2.40k, False: 0]
  ------------------
 1338|  2.40k|        auto is_leaf = shift_ == BL;
 1339|  2.40k|        auto child   = node_->inner()[offset_hint];
 1340|  2.40k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 842, False: 1.56k]
  ------------------
 1341|  2.40k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  2.40k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  2.40k|    }
_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.94k|    {
 1337|  1.94k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.94k, False: 0]
  ------------------
 1338|  1.94k|        auto is_leaf = shift_ == BL;
 1339|  1.94k|        auto child   = node_->inner()[offset_hint];
 1340|  1.94k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 1.03k, False: 910]
  ------------------
 1341|  1.94k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.94k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.94k|    }
_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.32k|    {
 1406|  3.32k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  3.32k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1405|  2.39k|    {
 1406|  2.39k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.39k|    }
_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|  9.99k|    {
 1337|  9.99k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 9.99k, False: 0]
  ------------------
 1338|  9.99k|        auto is_leaf = shift_ == BL;
 1339|  9.99k|        auto child   = node_->inner()[offset_hint];
 1340|  9.99k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 6.93k, False: 3.06k]
  ------------------
 1341|  9.99k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  9.99k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  9.99k|    }
_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.85k|    {
  208|  8.85k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  8.85k|    }
_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|  5.39k|    {
 1406|  5.39k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  5.39k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
 1310|  1.86k|    {
 1311|  1.86k|        each_i(v, start, branches<B>, args...);
 1312|  1.86k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_:
 1263|  1.86k|    {
 1264|  1.86k|        auto p = node_->inner() + i;
 1265|  1.86k|        auto e = node_->inner() + n;
 1266|  1.86k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 1.00k, False: 862]
  ------------------
 1267|  1.47k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 465, False: 1.00k]
  ------------------
 1268|    465|                IMMER_PREFETCH(p + 1);
 1269|    465|                make_full_leaf_pos(*p).visit(v, args...);
 1270|    465|            }
 1271|  1.00k|        } else {
 1272|    862|            auto ss = shift_ - B;
 1273|  1.69k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 831, False: 862]
  ------------------
 1274|    831|                make_full_pos(*p, ss).visit(v, args...);
 1275|    862|        }
 1276|  1.86k|    }
_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|    764|    {
  113|    764|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    764|    }
_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.09k|    {
  306|  4.09k|        return towards_oh_ch_regular(
  307|  4.09k|            *this, v, idx, offset_hint, count(), args...);
  308|  4.09k|    }
_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.09k|{
  633|  4.09k|    constexpr auto B  = bits<Pos>;
  634|  4.09k|    constexpr auto BL = bits_leaf<Pos>;
  635|  4.09k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 4.09k, False: 0]
  ------------------
  636|  4.09k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 4.09k, False: 0]
  ------------------
  637|  4.09k|    auto is_leaf = p.shift() == BL;
  638|  4.09k|    auto child   = p.node()->inner()[offset_hint];
  639|  4.09k|    auto is_full = offset_hint + 1 != count_hint;
  640|  4.09k|    return is_full
  ------------------
  |  Branch (640:12): [True: 1.59k, False: 2.49k]
  ------------------
  641|  4.09k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 860, False: 739]
  ------------------
  642|  1.59k|                          : make_full_pos(child, p.shift() - B)
  643|    739|                                .visit(v, idx, args...))
  644|  4.09k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.54k, False: 954]
  ------------------
  645|  2.49k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.49k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    954|                            .visit(v, idx, args...));
  648|  4.09k|}
_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.66k|    {
  113|  2.66k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.66k|    }
_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.64k|    {
  337|  4.64k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  4.64k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
  336|  1.05k|    {
  337|  1.05k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  1.05k|    }
_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.26k|    {
  306|  3.26k|        return towards_oh_ch_regular(
  307|  3.26k|            *this, v, idx, offset_hint, count(), args...);
  308|  3.26k|    }
_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.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: 914, False: 2.35k]
  ------------------
  641|  3.26k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 511, False: 403]
  ------------------
  642|    914|                          : make_full_pos(child, p.shift() - B)
  643|    403|                                .visit(v, idx, args...))
  644|  3.26k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.56k, False: 786]
  ------------------
  645|  2.35k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.35k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    786|                            .visit(v, idx, args...));
  648|  3.26k|}
_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.94k|    {
  113|  2.94k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.94k|    }
_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.72k|    {
  337|  2.72k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.72k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
  285|  3.11k|    {
  286|  3.11k|        return each_right_regular(*this, v, start, args...);
  287|  3.11k|    }
_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.11k|{
  598|  3.11k|    constexpr auto B  = bits<Pos>;
  599|  3.11k|    constexpr auto BL = bits_leaf<Pos>;
  600|       |
  601|  3.11k|    if (p.shift() == BL) {
  ------------------
  |  Branch (601:9): [True: 1.51k, False: 1.59k]
  ------------------
  602|  1.51k|        auto n    = p.node()->inner() + start;
  603|  1.51k|        auto last = p.count() - 1;
  604|  1.51k|        auto e    = p.node()->inner() + last;
  605|  1.51k|        if (n <= e) {
  ------------------
  |  Branch (605:13): [True: 466, False: 1.04k]
  ------------------
  606|    660|            for (; n != e; ++n) {
  ------------------
  |  Branch (606:20): [True: 194, False: 466]
  ------------------
  607|    194|                IMMER_PREFETCH(n + 1);
  608|    194|                make_full_leaf_pos(*n).visit(v, args...);
  609|    194|            }
  610|    466|            make_leaf_pos(*n, p.size()).visit(v, args...);
  611|    466|        }
  612|  1.59k|    } else {
  613|  1.59k|        auto n    = p.node()->inner() + start;
  614|  1.59k|        auto last = p.count() - 1;
  615|  1.59k|        auto e    = p.node()->inner() + last;
  616|  1.59k|        auto ss   = p.shift() - B;
  617|  1.59k|        if (n <= e) {
  ------------------
  |  Branch (617:13): [True: 730, False: 869]
  ------------------
  618|  1.45k|            for (; n != e; ++n)
  ------------------
  |  Branch (618:20): [True: 727, False: 730]
  ------------------
  619|    727|                make_full_pos(*n, ss).visit(v, args...);
  620|    730|            make_regular_pos(*n, ss, p.size()).visit(v, args...);
  621|    730|        }
  622|  1.59k|    }
  623|  3.11k|}
_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.37k|    {
  928|  7.37k|        return towards_oh_ch_regular(
  929|  7.37k|            *this, v, idx, offset_hint, count(), args...);
  930|  7.37k|    }
_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.37k|{
  633|  7.37k|    constexpr auto B  = bits<Pos>;
  634|  7.37k|    constexpr auto BL = bits_leaf<Pos>;
  635|  7.37k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 7.37k, False: 0]
  ------------------
  636|  7.37k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 7.37k, False: 0]
  ------------------
  637|  7.37k|    auto is_leaf = p.shift() == BL;
  638|  7.37k|    auto child   = p.node()->inner()[offset_hint];
  639|  7.37k|    auto is_full = offset_hint + 1 != count_hint;
  640|  7.37k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.56k, False: 4.80k]
  ------------------
  641|  7.37k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 887, False: 1.67k]
  ------------------
  642|  2.56k|                          : make_full_pos(child, p.shift() - B)
  643|  1.67k|                                .visit(v, idx, args...))
  644|  7.37k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.12k, False: 3.68k]
  ------------------
  645|  4.80k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  4.80k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  3.68k|                            .visit(v, idx, args...));
  648|  7.37k|}
_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.64k|    {
  928|  6.64k|        return towards_oh_ch_regular(
  929|  6.64k|            *this, v, idx, offset_hint, count(), args...);
  930|  6.64k|    }
_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.64k|{
  633|  6.64k|    constexpr auto B  = bits<Pos>;
  634|  6.64k|    constexpr auto BL = bits_leaf<Pos>;
  635|  6.64k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 6.64k, False: 0]
  ------------------
  636|  6.64k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 6.64k, False: 0]
  ------------------
  637|  6.64k|    auto is_leaf = p.shift() == BL;
  638|  6.64k|    auto child   = p.node()->inner()[offset_hint];
  639|  6.64k|    auto is_full = offset_hint + 1 != count_hint;
  640|  6.64k|    return is_full
  ------------------
  |  Branch (640:12): [True: 3.33k, False: 3.31k]
  ------------------
  641|  6.64k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 1.41k, False: 1.92k]
  ------------------
  642|  3.33k|                          : make_full_pos(child, p.shift() - B)
  643|  1.92k|                                .visit(v, idx, args...))
  644|  6.64k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.37k, False: 1.93k]
  ------------------
  645|  3.31k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  3.31k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.93k|                            .visit(v, idx, args...));
  648|  6.64k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
  867|  5.63k|    {
  868|  5.63k|        return each_right_regular(*this, v, start, args...);
  869|  5.63k|    }
_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.63k|{
  598|  5.63k|    constexpr auto B  = bits<Pos>;
  599|  5.63k|    constexpr auto BL = bits_leaf<Pos>;
  600|       |
  601|  5.63k|    if (p.shift() == BL) {
  ------------------
  |  Branch (601:9): [True: 1.42k, False: 4.21k]
  ------------------
  602|  1.42k|        auto n    = p.node()->inner() + start;
  603|  1.42k|        auto last = p.count() - 1;
  604|  1.42k|        auto e    = p.node()->inner() + last;
  605|  1.42k|        if (n <= e) {
  ------------------
  |  Branch (605:13): [True: 747, False: 681]
  ------------------
  606|    953|            for (; n != e; ++n) {
  ------------------
  |  Branch (606:20): [True: 206, False: 747]
  ------------------
  607|    206|                IMMER_PREFETCH(n + 1);
  608|    206|                make_full_leaf_pos(*n).visit(v, args...);
  609|    206|            }
  610|    747|            make_leaf_pos(*n, p.size()).visit(v, args...);
  611|    747|        }
  612|  4.21k|    } else {
  613|  4.21k|        auto n    = p.node()->inner() + start;
  614|  4.21k|        auto last = p.count() - 1;
  615|  4.21k|        auto e    = p.node()->inner() + last;
  616|  4.21k|        auto ss   = p.shift() - B;
  617|  4.21k|        if (n <= e) {
  ------------------
  |  Branch (617:13): [True: 1.48k, False: 2.73k]
  ------------------
  618|  2.26k|            for (; n != e; ++n)
  ------------------
  |  Branch (618:20): [True: 785, False: 1.48k]
  ------------------
  619|    785|                make_full_pos(*n, ss).visit(v, args...);
  620|  1.48k|            make_regular_pos(*n, ss, p.size()).visit(v, args...);
  621|  1.48k|        }
  622|  4.21k|    }
  623|  5.63k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1813|  42.8k|    {
 1814|  42.8k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  42.8k|    }
_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|  18.8k|    {
 1687|  18.8k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 18.8k, False: 0]
  ------------------
 1688|  18.8k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 15.3k, False: 3.45k]
  ------------------
 1689|  18.8k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  18.8k|    }
_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|  18.8k|    {
 1699|  18.8k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  18.8k|    }
_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|  18.8k|    {
 1718|  18.8k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 18.8k, False: 0]
  ------------------
 1719|  18.8k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 15.3k, False: 3.45k]
  |  Branch (1719:9): [True: 18.8k, False: 0]
  ------------------
 1720|  18.8k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  18.8k|        auto child     = node_->inner()[offset_hint];
 1722|  18.8k|        auto is_leaf   = shift_ == BL;
 1723|  18.8k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  18.8k|        auto next_idx  = idx - left_size_hint;
 1725|  18.8k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 4.55k, False: 14.2k]
  ------------------
 1726|  18.8k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  4.55k|                         .visit(v, next_idx, args...)
 1728|  18.8k|                   : visit_maybe_relaxed_sub(
 1729|  14.2k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  18.8k|    }
_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.55k|    {
  145|  4.55k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  4.55k|    }
_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.2k|{
 1839|  14.2k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 14.2k, False: 0]
  ------------------
 1840|  14.2k|    auto relaxed = node->relaxed();
 1841|  14.2k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 11.1k, False: 3.09k]
  ------------------
 1842|  11.1k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 11.1k, False: 0]
  ------------------
 1843|  11.1k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  11.1k|            .visit(v, std::forward<Args>(args)...);
 1845|  11.1k|    } else {
 1846|  3.09k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.09k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.09k|    }
 1849|  14.2k|}
_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.1k|    {
 1814|  11.1k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  11.1k|    }
_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.09k|    {
 1037|  3.09k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.09k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1036|  9.86k|    {
 1037|  9.86k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  9.86k|    }
_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|  14.8k|    {
 1687|  14.8k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 14.8k, False: 0]
  ------------------
 1688|  14.8k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 11.3k, False: 3.58k]
  ------------------
 1689|  14.8k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  14.8k|    }
_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|  14.8k|    {
 1699|  14.8k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  14.8k|    }
_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|  14.8k|    {
 1718|  14.8k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 14.8k, False: 0]
  ------------------
 1719|  14.8k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 11.3k, False: 3.58k]
  |  Branch (1719:9): [True: 14.8k, False: 0]
  ------------------
 1720|  14.8k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  14.8k|        auto child     = node_->inner()[offset_hint];
 1722|  14.8k|        auto is_leaf   = shift_ == BL;
 1723|  14.8k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  14.8k|        auto next_idx  = idx - left_size_hint;
 1725|  14.8k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 5.42k, False: 9.46k]
  ------------------
 1726|  14.8k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  5.42k|                         .visit(v, next_idx, args...)
 1728|  14.8k|                   : visit_maybe_relaxed_sub(
 1729|  9.46k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  14.8k|    }
_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|  5.42k|    {
  145|  5.42k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  5.42k|    }
_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|  9.46k|{
 1839|  9.46k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 9.46k, False: 0]
  ------------------
 1840|  9.46k|    auto relaxed = node->relaxed();
 1841|  9.46k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 7.66k, False: 1.80k]
  ------------------
 1842|  7.66k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 7.66k, False: 0]
  ------------------
 1843|  7.66k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  7.66k|            .visit(v, std::forward<Args>(args)...);
 1845|  7.66k|    } else {
 1846|  1.80k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.80k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.80k|    }
 1849|  9.46k|}
_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|  7.66k|    {
 1814|  7.66k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  7.66k|    }
_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.80k|    {
 1037|  1.80k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.80k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
 1653|  16.6k|    {
 1654|  16.6k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 16.6k, False: 0]
  ------------------
 1655|  16.6k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 16.6k, False: 0]
  ------------------
 1656|  16.6k|        auto s = relaxed_->d.sizes[start - 1];
 1657|  16.6k|        auto p = node_->inner();
 1658|  16.6k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 3.82k, False: 12.8k]
  ------------------
 1659|  7.43k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 3.61k, False: 3.82k]
  ------------------
 1660|  3.61k|                IMMER_PREFETCH(p + i + 1);
 1661|  3.61k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|  3.61k|                    .visit(v, args...);
 1663|  3.61k|                s = relaxed_->d.sizes[i];
 1664|  3.61k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 3.61k, False: 0]
  ------------------
 1665|  3.61k|            }
 1666|  12.8k|        } else {
 1667|  12.8k|            auto ss = shift_ - B;
 1668|  25.5k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 12.6k, False: 12.8k]
  ------------------
 1669|  12.6k|                visit_maybe_relaxed_sub(
 1670|  12.6k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|  12.6k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 12.6k, False: 0]
  ------------------
 1673|  12.6k|            }
 1674|  12.8k|        }
 1675|  16.6k|    }
_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|  15.4k|    {
 1037|  15.4k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  15.4k|    }
_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|  4.23k|    {
  928|  4.23k|        return towards_oh_ch_regular(
  929|  4.23k|            *this, v, idx, offset_hint, count(), args...);
  930|  4.23k|    }
_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|  4.23k|{
  633|  4.23k|    constexpr auto B  = bits<Pos>;
  634|  4.23k|    constexpr auto BL = bits_leaf<Pos>;
  635|  4.23k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 4.23k, False: 0]
  ------------------
  636|  4.23k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 4.23k, False: 0]
  ------------------
  637|  4.23k|    auto is_leaf = p.shift() == BL;
  638|  4.23k|    auto child   = p.node()->inner()[offset_hint];
  639|  4.23k|    auto is_full = offset_hint + 1 != count_hint;
  640|  4.23k|    return is_full
  ------------------
  |  Branch (640:12): [True: 3.51k, False: 713]
  ------------------
  641|  4.23k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 608, False: 2.91k]
  ------------------
  642|  3.51k|                          : make_full_pos(child, p.shift() - B)
  643|  2.91k|                                .visit(v, idx, args...))
  644|  4.23k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 713, False: 0]
  ------------------
  645|    713|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    713|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .visit(v, idx, args...));
  648|  4.23k|}
_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.38k|    {
  208|  1.38k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.38k|    }
_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|  3.30k|    {
 1406|  3.30k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  3.30k|    }
_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: 773, False: 398]
  ------------------
 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|    713|    {
  113|    713|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    713|    }
_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.05k|    {
  760|  7.05k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  761|  7.05k|    }
_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.05k|{
 1839|  7.05k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 7.05k, False: 0]
  ------------------
 1840|  7.05k|    auto relaxed = node->relaxed();
 1841|  7.05k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 3.94k, False: 3.11k]
  ------------------
 1842|  3.94k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 3.94k, False: 0]
  ------------------
 1843|  3.94k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  3.94k|            .visit(v, std::forward<Args>(args)...);
 1845|  3.94k|    } else {
 1846|  3.11k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.11k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.11k|    }
 1849|  7.05k|}
_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|  3.94k|    {
 1814|  3.94k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  3.94k|    }
_ZNK5immer6detail4rbts12null_sub_pos4nodeEv:
  699|   523k|    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.05k|    {
  745|  7.05k|    }
_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|   657k|    {
  145|   657k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   657k|    }
_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.94M|    {
 1814|  2.94M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  2.94M|    }
_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|   454k|    {
  708|   454k|    }
_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|  13.9k|    {
 1763|  13.9k|        auto child      = node_->inner()[0];
 1764|  13.9k|        auto child_size = relaxed_->d.sizes[0];
 1765|  13.9k|        auto is_leaf    = shift_ == BL;
 1766|  13.9k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 13.9k, False: 0]
  ------------------
 1767|  13.9k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 13.9k]
  ------------------
 1768|  13.9k|                       : visit_maybe_relaxed_sub(
 1769|  13.9k|                             child, shift_ - B, child_size, v, args...);
 1770|  13.9k|    }
_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|  13.9k|{
 1839|  13.9k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 13.9k, False: 0]
  ------------------
 1840|  13.9k|    auto relaxed = node->relaxed();
 1841|  13.9k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 13.7k, False: 266]
  ------------------
 1842|  13.7k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 13.7k, False: 0]
  ------------------
 1843|  13.7k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  13.7k|            .visit(v, std::forward<Args>(args)...);
 1845|  13.7k|    } else {
 1846|    266|        return make_regular_sub_pos(node, shift, size)
 1847|    266|            .visit(v, std::forward<Args>(args)...);
 1848|    266|    }
 1849|  13.9k|}
_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|  13.7k|    {
 1814|  13.7k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  13.7k|    }
_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|    266|    {
 1037|    266|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    266|    }
_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|    959|    {
  971|    959|        auto is_leaf = shift_ == BL;
  972|    959|        auto child   = node_->inner()[0];
  973|    959|        auto is_full = size_ >= (size_t{1} << shift_);
  974|    959|        return is_full
  ------------------
  |  Branch (974:16): [True: 959, False: 0]
  ------------------
  975|    959|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 959]
  ------------------
  976|    959|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|    959|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|    959|                   : (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|    959|    }
_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.68k|    {
 1406|  1.68k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.68k|    }
_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|    724|    {
 1362|    724|        auto is_leaf = shift_ == BL;
 1363|    724|        auto child   = node_->inner()[0];
 1364|    724|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 724]
  ------------------
 1365|    724|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    724|    }
_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|  69.1k|    {
  712|  69.1k|    }
_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|  14.6k|    {
 1305|  14.6k|        each_i(v, 1, branches<B>, args...);
 1306|  14.6k|    }
_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|  14.6k|    {
 1264|  14.6k|        auto p = node_->inner() + i;
 1265|  14.6k|        auto e = node_->inner() + n;
 1266|  14.6k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 7.88k, False: 6.72k]
  ------------------
 1267|  31.5k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 23.6k, False: 7.88k]
  ------------------
 1268|  23.6k|                IMMER_PREFETCH(p + 1);
 1269|  23.6k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  23.6k|            }
 1271|  7.88k|        } else {
 1272|  6.72k|            auto ss = shift_ - B;
 1273|  26.9k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 20.1k, False: 6.72k]
  ------------------
 1274|  20.1k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  6.72k|        }
 1276|  14.6k|    }
_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|  92.2k|    {
  208|  92.2k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  92.2k|    }
_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|   167k|    {
 1406|   167k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|   167k|    }
_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|    959|    {
  754|    959|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    959|    }
_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|    959|    {
  145|    959|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    959|    }
_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|    959|    {
 1371|    959|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 959, False: 0]
  ------------------
 1372|    959|        auto child = node_->inner()[0];
 1373|    959|        return make_full_leaf_pos(child).visit(v, args...);
 1374|    959|    }
_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.37k|    {
  208|  3.37k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  3.37k|    }
_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|  51.7k|    {
  907|  51.7k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 18.5k, False: 33.2k]
  ------------------
  908|  18.5k|            each_right_sub_(v, 1, args...);
  909|  51.7k|    }
_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|  18.5k|    {
  880|  18.5k|        auto last  = count() - 1;
  881|  18.5k|        auto lsize = size_ - (last << shift_);
  882|  18.5k|        auto n     = node()->inner() + i;
  883|  18.5k|        auto e     = node()->inner() + last;
  884|  18.5k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 10.6k, False: 7.88k]
  ------------------
  885|  20.8k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 10.2k, False: 10.6k]
  ------------------
  886|  10.2k|                IMMER_PREFETCH(n + 1);
  887|  10.2k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  10.2k|            }
  889|  10.6k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  10.6k|        } else {
  891|  7.88k|            auto ss = shift_ - B;
  892|  15.5k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 7.62k, False: 7.88k]
  ------------------
  893|  7.62k|                make_full_pos(*n, ss).visit(v, args...);
  894|  7.88k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  7.88k|        }
  896|  18.5k|    }
_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|   128k|    {
 1037|   128k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   128k|    }
_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.41k|    {
  754|  2.41k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  2.41k|    }
_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.41k|    {
  145|  2.41k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  2.41k|    }
_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.41k|    {
  987|  2.41k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 2.41k, False: 0]
  ------------------
  988|  2.41k|        auto child   = node_->inner()[0];
  989|  2.41k|        auto is_full = size_ >= branches<BL>;
  990|  2.41k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 2.41k, False: 0]
  ------------------
  991|  2.41k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  2.41k|    }
_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.67k|    {
  145|  3.67k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.67k|    }
_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|   465k|    {
 1648|   465k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   465k|    }
_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|   465k|    {
 1654|   465k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 465k, False: 0]
  ------------------
 1655|   465k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 465k, False: 0]
  ------------------
 1656|   465k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   465k|        auto p = node_->inner();
 1658|   465k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 73.2k, False: 391k]
  ------------------
 1659|   242k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 168k, False: 73.2k]
  ------------------
 1660|   168k|                IMMER_PREFETCH(p + i + 1);
 1661|   168k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   168k|                    .visit(v, args...);
 1663|   168k|                s = relaxed_->d.sizes[i];
 1664|   168k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 168k, False: 0]
  ------------------
 1665|   168k|            }
 1666|   391k|        } else {
 1667|   391k|            auto ss = shift_ - B;
 1668|  1.30M|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 913k, False: 391k]
  ------------------
 1669|   913k|                visit_maybe_relaxed_sub(
 1670|   913k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|   913k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 913k, False: 0]
  ------------------
 1673|   913k|            }
 1674|   391k|        }
 1675|   465k|    }
_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.83M|{
 1839|  1.83M|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 1.83M, False: 0]
  ------------------
 1840|  1.83M|    auto relaxed = node->relaxed();
 1841|  1.83M|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.71M, False: 121k]
  ------------------
 1842|  1.71M|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.71M, False: 0]
  ------------------
 1843|  1.71M|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.71M|            .visit(v, std::forward<Args>(args)...);
 1845|  1.71M|    } else {
 1846|   121k|        return make_regular_sub_pos(node, shift, size)
 1847|   121k|            .visit(v, std::forward<Args>(args)...);
 1848|   121k|    }
 1849|  1.83M|}
_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.67k|    {
  754|  3.67k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  3.67k|    }
_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.67k|    {
  145|  3.67k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.67k|    }
_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.67k|    {
 1775|  3.67k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 3.67k, False: 0]
  ------------------
 1776|  3.67k|        auto child      = node_->inner()[0];
 1777|  3.67k|        auto child_size = relaxed_->d.sizes[0];
 1778|  3.67k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  3.67k|    }
_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.11k|    {
 1037|  3.11k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.11k|    }
_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|   117k|{
 1839|   117k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 117k, False: 0]
  ------------------
 1840|   117k|    auto relaxed = node->relaxed();
 1841|   117k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 111k, False: 6.36k]
  ------------------
 1842|   111k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 111k, False: 0]
  ------------------
 1843|   111k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   111k|            .visit(v, std::forward<Args>(args)...);
 1845|   111k|    } else {
 1846|  6.36k|        return make_regular_sub_pos(node, shift, size)
 1847|  6.36k|            .visit(v, std::forward<Args>(args)...);
 1848|  6.36k|    }
 1849|   117k|}
_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|   111k|    {
 1814|   111k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   111k|    }
_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|   111k|{
 1839|   111k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 111k, False: 0]
  ------------------
 1840|   111k|    auto relaxed = node->relaxed();
 1841|   111k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 70.0k, False: 41.5k]
  ------------------
 1842|  70.0k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 70.0k, False: 0]
  ------------------
 1843|  70.0k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  70.0k|            .visit(v, std::forward<Args>(args)...);
 1845|  70.0k|    } else {
 1846|  41.5k|        return make_regular_sub_pos(node, shift, size)
 1847|  41.5k|            .visit(v, std::forward<Args>(args)...);
 1848|  41.5k|    }
 1849|   111k|}
_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.0k|    {
 1814|  70.0k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  70.0k|    }
_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|   205k|    {
 1751|   205k|        auto offset     = relaxed_->d.count - 1;
 1752|   205k|        auto child      = node_->inner()[offset];
 1753|   205k|        auto child_size = size(offset);
 1754|   205k|        auto is_leaf    = shift_ == BL;
 1755|   205k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 205k]
  ------------------
 1756|   205k|                       : visit_maybe_relaxed_sub(
 1757|   205k|                             child, shift_ - B, child_size, v, args...);
 1758|   205k|    }
_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|   205k|{
 1839|   205k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 205k, False: 0]
  ------------------
 1840|   205k|    auto relaxed = node->relaxed();
 1841|   205k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 203k, False: 1.48k]
  ------------------
 1842|   203k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 203k, False: 0]
  ------------------
 1843|   203k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   203k|            .visit(v, std::forward<Args>(args)...);
 1845|   203k|    } else {
 1846|  1.48k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.48k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.48k|    }
 1849|   205k|}
_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|   203k|    {
 1814|   203k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   203k|    }
_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|  3.44k|    {
 1037|  3.44k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.44k|    }
_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|  1.95k|    {
  959|  1.95k|        auto offset  = count() - 1;
  960|  1.95k|        auto child   = node_->inner()[offset];
  961|  1.95k|        auto is_leaf = shift_ == BL;
  962|  1.95k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  1.95k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 1.95k]
  ------------------
  964|  1.95k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.95k|                             .visit(v, args...);
  966|  1.95k|    }
_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|   155k|    {
  914|   155k|        each_left(v, count() - 1, args...);
  915|   155k|    }
_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|   155k|    {
  874|   155k|        return each_left_regular(*this, v, last, args...);
  875|   155k|    }
_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|   155k|{
  576|   155k|    constexpr auto B  = bits<Pos>;
  577|   155k|    constexpr auto BL = bits_leaf<Pos>;
  578|   155k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 155k, False: 0]
  ------------------
  579|   155k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 45.5k, False: 109k]
  ------------------
  580|  45.5k|        auto n = p.node()->inner();
  581|  45.5k|        auto e = n + last;
  582|   103k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 58.3k, False: 45.5k]
  ------------------
  583|  58.3k|            IMMER_PREFETCH(n + 1);
  584|  58.3k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  58.3k|        }
  586|   109k|    } else {
  587|   109k|        auto n  = p.node()->inner();
  588|   109k|        auto e  = n + last;
  589|   109k|        auto ss = p.shift() - B;
  590|   249k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 139k, False: 109k]
  ------------------
  591|   139k|            make_full_pos(*n, ss).visit(v, args...);
  592|   109k|    }
  593|   155k|}
_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|   141k|    {
 1763|   141k|        auto child      = node_->inner()[0];
 1764|   141k|        auto child_size = relaxed_->d.sizes[0];
 1765|   141k|        auto is_leaf    = shift_ == BL;
 1766|   141k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 141k, False: 0]
  ------------------
 1767|   141k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 141k]
  ------------------
 1768|   141k|                       : visit_maybe_relaxed_sub(
 1769|   141k|                             child, shift_ - B, child_size, v, args...);
 1770|   141k|    }
_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|   141k|{
 1839|   141k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 141k, False: 0]
  ------------------
 1840|   141k|    auto relaxed = node->relaxed();
 1841|   141k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 138k, False: 2.55k]
  ------------------
 1842|   138k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 138k, False: 0]
  ------------------
 1843|   138k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   138k|            .visit(v, std::forward<Args>(args)...);
 1845|   138k|    } else {
 1846|  2.55k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.55k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.55k|    }
 1849|   141k|}
_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|   138k|    {
 1814|   138k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   138k|    }
_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|  2.55k|    {
 1037|  2.55k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.55k|    }
_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.98k|    {
  959|  1.98k|        auto offset  = count() - 1;
  960|  1.98k|        auto child   = node_->inner()[offset];
  961|  1.98k|        auto is_leaf = shift_ == BL;
  962|  1.98k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  1.98k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 1.98k]
  ------------------
  964|  1.98k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.98k|                             .visit(v, args...);
  966|  1.98k|    }
_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|  3.03k|    {
 1037|  3.03k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.03k|    }
_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|  5.15k|    {
  971|  5.15k|        auto is_leaf = shift_ == BL;
  972|  5.15k|        auto child   = node_->inner()[0];
  973|  5.15k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  5.15k|        return is_full
  ------------------
  |  Branch (974:16): [True: 5.15k, False: 0]
  ------------------
  975|  5.15k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 5.15k]
  ------------------
  976|  5.15k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  5.15k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  5.15k|                   : (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|  5.15k|    }
_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|  10.3k|    {
 1406|  10.3k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  10.3k|    }
_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|  5.20k|    {
 1362|  5.20k|        auto is_leaf = shift_ == BL;
 1363|  5.20k|        auto child   = node_->inner()[0];
 1364|  5.20k|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 5.20k]
  ------------------
 1365|  5.20k|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|  5.20k|    }
_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|  9.98k|    {
  959|  9.98k|        auto offset  = count() - 1;
  960|  9.98k|        auto child   = node_->inner()[offset];
  961|  9.98k|        auto is_leaf = shift_ == BL;
  962|  9.98k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  9.98k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 5.44k, False: 4.53k]
  ------------------
  964|  9.98k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  4.53k|                             .visit(v, args...);
  966|  9.98k|    }
_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|  6.92k|    {
  145|  6.92k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  6.92k|    }
_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|  6.92k|    {
 1371|  6.92k|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 6.92k, False: 0]
  ------------------
 1372|  6.92k|        auto child = node_->inner()[0];
 1373|  6.92k|        return make_full_leaf_pos(child).visit(v, args...);
 1374|  6.92k|    }
_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|  48.3k|    {
  208|  48.3k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  48.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|  4.82k|    {
 1037|  4.82k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.82k|    }
_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|  5.92k|    {
  959|  5.92k|        auto offset  = count() - 1;
  960|  5.92k|        auto child   = node_->inner()[offset];
  961|  5.92k|        auto is_leaf = shift_ == BL;
  962|  5.92k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  5.92k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 4.22k, False: 1.70k]
  ------------------
  964|  5.92k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.70k|                             .visit(v, args...);
  966|  5.92k|    }
_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|  41.4k|    {
  145|  41.4k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  41.4k|    }
_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|  41.4k|    {
  987|  41.4k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 41.4k, False: 0]
  ------------------
  988|  41.4k|        auto child   = node_->inner()[0];
  989|  41.4k|        auto is_full = size_ >= branches<BL>;
  990|  41.4k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 41.4k, False: 0]
  ------------------
  991|  41.4k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  41.4k|    }
_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|  69.6k|    {
  145|  69.6k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  69.6k|    }
_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|  4.62k|    {
 1037|  4.62k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.62k|    }
_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|   135k|    {
  959|   135k|        auto offset  = count() - 1;
  960|   135k|        auto child   = node_->inner()[offset];
  961|   135k|        auto is_leaf = shift_ == BL;
  962|   135k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|   135k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 35.9k, False: 99.3k]
  ------------------
  964|   135k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  99.3k|                             .visit(v, args...);
  966|   135k|    }
_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|  69.6k|    {
  145|  69.6k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  69.6k|    }
_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|  69.6k|    {
 1775|  69.6k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 69.6k, False: 0]
  ------------------
 1776|  69.6k|        auto child      = node_->inner()[0];
 1777|  69.6k|        auto child_size = relaxed_->d.sizes[0];
 1778|  69.6k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  69.6k|    }
_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|   132k|    {
 1037|   132k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   132k|    }
_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|   754k|    {
 1618|   754k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   754k|    }
_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|   754k|    {
 1624|   754k|        auto p = node_->inner();
 1625|   754k|        auto s = size_t{};
 1626|   754k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 72.3k, False: 681k]
  ------------------
 1627|   182k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 110k, False: 72.3k]
  ------------------
 1628|   110k|                IMMER_PREFETCH(p + i + 1);
 1629|   110k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|   110k|                    .visit(v, args...);
 1631|   110k|                s = relaxed_->d.sizes[i];
 1632|   110k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 110k, False: 0]
  ------------------
 1633|   110k|            }
 1634|   681k|        } else {
 1635|   681k|            auto ss = shift_ - B;
 1636|  1.60M|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 926k, False: 681k]
  ------------------
 1637|   926k|                visit_maybe_relaxed_sub(
 1638|   926k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|   926k|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 926k, False: 0]
  ------------------
 1641|   926k|            }
 1642|   681k|        }
 1643|   754k|    }
_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|   236k|    {
 1763|   236k|        auto child      = node_->inner()[0];
 1764|   236k|        auto child_size = relaxed_->d.sizes[0];
 1765|   236k|        auto is_leaf    = shift_ == BL;
 1766|   236k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 236k, False: 0]
  ------------------
 1767|   236k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 236k]
  ------------------
 1768|   236k|                       : visit_maybe_relaxed_sub(
 1769|   236k|                             child, shift_ - B, child_size, v, args...);
 1770|   236k|    }
_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|   236k|{
 1839|   236k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 236k, False: 0]
  ------------------
 1840|   236k|    auto relaxed = node->relaxed();
 1841|   236k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 234k, False: 1.41k]
  ------------------
 1842|   234k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 234k, False: 0]
  ------------------
 1843|   234k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   234k|            .visit(v, std::forward<Args>(args)...);
 1845|   234k|    } else {
 1846|  1.41k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.41k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.41k|    }
 1849|   236k|}
_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|   234k|    {
 1814|   234k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   234k|    }
_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.41k|    {
 1037|  1.41k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.41k|    }
_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|   244k|    {
 1751|   244k|        auto offset     = relaxed_->d.count - 1;
 1752|   244k|        auto child      = node_->inner()[offset];
 1753|   244k|        auto child_size = size(offset);
 1754|   244k|        auto is_leaf    = shift_ == BL;
 1755|   244k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 244k]
  ------------------
 1756|   244k|                       : visit_maybe_relaxed_sub(
 1757|   244k|                             child, shift_ - B, child_size, v, args...);
 1758|   244k|    }
_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|   244k|{
 1839|   244k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 244k, False: 0]
  ------------------
 1840|   244k|    auto relaxed = node->relaxed();
 1841|   244k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 243k, False: 1.05k]
  ------------------
 1842|   243k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 243k, False: 0]
  ------------------
 1843|   243k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   243k|            .visit(v, std::forward<Args>(args)...);
 1845|   243k|    } else {
 1846|  1.05k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.05k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.05k|    }
 1849|   244k|}
_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|   243k|    {
 1814|   243k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   243k|    }
_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.77k|    {
  971|  1.77k|        auto is_leaf = shift_ == BL;
  972|  1.77k|        auto child   = node_->inner()[0];
  973|  1.77k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  1.77k|        return is_full
  ------------------
  |  Branch (974:16): [True: 1.77k, False: 0]
  ------------------
  975|  1.77k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 1.77k]
  ------------------
  976|  1.77k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  1.77k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  1.77k|                   : (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.77k|    }
_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.57k|    {
 1406|  2.57k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.57k|    }
_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|    804|    {
 1362|    804|        auto is_leaf = shift_ == BL;
 1363|    804|        auto child   = node_->inner()[0];
 1364|    804|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 804]
  ------------------
 1365|    804|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    804|    }
_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.25k|    {
 1751|  2.25k|        auto offset     = relaxed_->d.count - 1;
 1752|  2.25k|        auto child      = node_->inner()[offset];
 1753|  2.25k|        auto child_size = size(offset);
 1754|  2.25k|        auto is_leaf    = shift_ == BL;
 1755|  2.25k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 1.48k, False: 768]
  ------------------
 1756|  2.25k|                       : visit_maybe_relaxed_sub(
 1757|    768|                             child, shift_ - B, child_size, v, args...);
 1758|  2.25k|    }
_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|    768|{
 1839|    768|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 768, False: 0]
  ------------------
 1840|    768|    auto relaxed = node->relaxed();
 1841|    768|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 481, False: 287]
  ------------------
 1842|    481|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 481, False: 0]
  ------------------
 1843|    481|        return make_relaxed_pos(node, shift, relaxed)
 1844|    481|            .visit(v, std::forward<Args>(args)...);
 1845|    481|    } else {
 1846|    287|        return make_regular_sub_pos(node, shift, size)
 1847|    287|            .visit(v, std::forward<Args>(args)...);
 1848|    287|    }
 1849|    768|}
_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|    481|    {
 1814|    481|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    481|    }
_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|  41.0k|    {
 1751|  41.0k|        auto offset     = relaxed_->d.count - 1;
 1752|  41.0k|        auto child      = node_->inner()[offset];
 1753|  41.0k|        auto child_size = size(offset);
 1754|  41.0k|        auto is_leaf    = shift_ == BL;
 1755|  41.0k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 37.2k, False: 3.89k]
  ------------------
 1756|  41.0k|                       : visit_maybe_relaxed_sub(
 1757|  3.89k|                             child, shift_ - B, child_size, v, args...);
 1758|  41.0k|    }
_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|  3.89k|{
 1839|  3.89k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 3.89k, False: 0]
  ------------------
 1840|  3.89k|    auto relaxed = node->relaxed();
 1841|  3.89k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 974, False: 2.92k]
  ------------------
 1842|    974|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 974, False: 0]
  ------------------
 1843|    974|        return make_relaxed_pos(node, shift, relaxed)
 1844|    974|            .visit(v, std::forward<Args>(args)...);
 1845|  2.92k|    } else {
 1846|  2.92k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.92k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.92k|    }
 1849|  3.89k|}
_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|    974|    {
 1814|    974|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    974|    }
_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: 33.7k, 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: 193k, False: 33.4k]
  ------------------
 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|  33.4k|        return make_regular_sub_pos(node, shift, size)
 1847|  33.4k|            .visit(v, std::forward<Args>(args)...);
 1848|  33.4k|    }
 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|   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_30concat_trees_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
 1036|  41.5k|    {
 1037|  41.5k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  41.5k|    }
_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.36k|    {
 1037|  6.36k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  6.36k|    }
_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.36k|{
 1839|  6.36k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 6.36k, False: 0]
  ------------------
 1840|  6.36k|    auto relaxed = node->relaxed();
 1841|  6.36k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 3.51k, False: 2.85k]
  ------------------
 1842|  3.51k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 3.51k, False: 0]
  ------------------
 1843|  3.51k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  3.51k|            .visit(v, std::forward<Args>(args)...);
 1845|  3.51k|    } else {
 1846|  2.85k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.85k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.85k|    }
 1849|  6.36k|}
_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.51k|    {
 1814|  3.51k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  3.51k|    }
_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.85k|    {
 1037|  2.85k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.85k|    }

_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
  114|   357k|        : size{0}
  115|   357k|        , shift{BL}
  116|   357k|        , root{empty_root()}
  117|   357k|        , tail{empty_tail()}
  118|   357k|    {
  119|       |        assert(check_tree());
  ------------------
  |  Branch (119:9): [True: 357k, False: 0]
  ------------------
  120|   357k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10empty_rootEv:
   61|   371k|    {
   62|   371k|        static const auto empty_ = [] {
   63|   371k|            constexpr auto size = node_t::sizeof_inner_n(0);
   64|   371k|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   65|   371k|                storage;
   66|   371k|            return node_t::make_inner_n_into(&storage, size, 0u);
   67|   371k|        }();
   68|   371k|        return empty_->inc();
   69|   371k|    }
_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|   361k|    {
   73|   361k|        static const auto empty_ = [] {
   74|   361k|            constexpr auto size = node_t::sizeof_leaf_n(0);
   75|   361k|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   76|   361k|                storage;
   77|   361k|            return node_t::make_leaf_n_into(&storage, size, 0u);
   78|   361k|        }();
   79|   361k|        return empty_->inc();
   80|   361k|    }
_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|   970k|    {
 1373|   970k|        IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL);
  ------------------
  |  |   32|   970k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 970k]
  |  |  ------------------
  |  |   33|   970k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1374|   970k|        IMMER_INVALID_STATE_ASSERT(shift >= BL);
  ------------------
  |  |   32|   970k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 970k]
  |  |  ------------------
  |  |   33|   970k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1375|   970k|        IMMER_INVALID_STATE_ASSERT(tail_offset() <= size);
  ------------------
  |  |   32|   970k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 970k]
  |  |  ------------------
  |  |   33|   970k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1376|   970k|        IMMER_INVALID_STATE_ASSERT(tail_size() <= branches<BL>);
  ------------------
  |  |   32|   970k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 970k]
  |  |  ------------------
  |  |   33|   970k|    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|   970k|        return true;
 1382|   970k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11tail_offsetEv:
  197|  6.96M|    {
  198|  6.96M|        auto r = root->relaxed();
  199|  6.96M|        assert(r == nullptr || r->d.count);
  ------------------
  |  Branch (199:9): [True: 4.48M, False: 2.47M]
  |  Branch (199:9): [True: 2.47M, False: 0]
  |  Branch (199:9): [True: 6.96M, False: 0]
  ------------------
  200|  6.96M|        return r      ? r->d.sizes[r->d.count - 1]
  ------------------
  |  Branch (200:16): [True: 2.47M, False: 4.48M]
  ------------------
  201|  6.96M|               : size ? (size - 1) & ~mask<BL>
  ------------------
  |  Branch (201:18): [True: 3.35M, False: 1.12M]
  ------------------
  202|       |                      /* otherwise */
  203|  4.48M|                      : 0;
  204|  6.96M|    }
_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|   652k|    ~rrbtree() { dec(); }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3decEv:
  192|   652k|    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|   652k|    {
  209|   652k|        auto tail_off  = tail_offset();
  210|   652k|        auto tail_size = size - tail_off;
  211|       |
  212|   652k|        if (tail_off)
  ------------------
  |  Branch (212:13): [True: 237k, False: 415k]
  ------------------
  213|   237k|            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|   652k|        if (tail_size)
  ------------------
  |  Branch (217:13): [True: 284k, False: 368k]
  ------------------
  218|   284k|            make_leaf_sub_pos(tail, tail_size).visit(v, args...);
  219|   368k|        else
  220|   368k|            make_empty_leaf_pos(tail).visit(v, args...);
  221|   652k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2ERKSB_:
  151|   141k|        : rrbtree{other.size, other.shift, other.root, other.tail}
  152|   141k|    {
  153|   141k|        inc();
  154|   141k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_:
  127|   295k|        : size{sz}
  128|   295k|        , shift{sh}
  129|   295k|        , root{r}
  130|   295k|        , tail{t}
  131|   295k|    {
  132|   295k|#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|   295k|        try {
  137|   295k|            check_tree();
  138|   295k|        } 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|   295k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3incEv:
  187|   141k|    {
  188|   141k|        root->inc();
  189|   141k|        tail->inc();
  190|   141k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2EOSB_:
  157|   283k|        : rrbtree{}
  158|   283k|    {
  159|   283k|        swap(*this, other);
  160|   283k|    }
_ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEESC_:
  176|   591k|    {
  177|   591k|        using std::swap;
  178|   591k|        swap(x.size, y.size);
  179|   591k|        swap(x.shift, y.shift);
  180|   591k|        swap(x.root, y.root);
  181|   591k|        swap(x.tail, y.tail);
  182|   591k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEaSEOSB_:
  170|   301k|    {
  171|   301k|        swap(*this, other);
  172|   301k|        return *this;
  173|   301k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  500|  60.6k|    {
  501|  60.6k|        auto ts = tail_size();
  502|  60.6k|        if (ts < branches<BL>) {
  ------------------
  |  Branch (502:13): [True: 45.1k, False: 15.5k]
  ------------------
  503|  45.1k|            auto new_tail =
  504|  45.1k|                node_t::copy_leaf_emplace(tail, ts, std::move(value));
  505|  45.1k|            return {size + 1, shift, root->inc(), new_tail};
  506|  45.1k|        } else {
  507|  15.5k|            using std::get;
  508|  15.5k|            auto new_tail = node_t::make_leaf_n(1u, std::move(value));
  509|  15.5k|            auto tail_off = tail_offset();
  510|  15.5k|            IMMER_TRY {
  ------------------
  |  |   49|  15.5k|#define IMMER_TRY try
  ------------------
  511|  15.5k|                auto new_root =
  512|  15.5k|                    push_tail(root, shift, tail_off, tail, size - tail_off);
  513|  15.5k|                tail->inc();
  514|  15.5k|                return {size + 1, get<0>(new_root), get<1>(new_root), new_tail};
  515|  15.5k|            }
  516|  15.5k|            IMMER_CATCH (...) {
  517|      0|                node_t::delete_leaf(new_tail, 1u);
  518|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  519|      0|            }
  520|  15.5k|        }
  521|  60.6k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j:
  369|  23.1k|    {
  370|  23.1k|        if (auto r = root->relaxed()) {
  ------------------
  |  Branch (370:18): [True: 12.3k, False: 10.7k]
  ------------------
  371|  12.3k|            auto new_root =
  372|  12.3k|                make_relaxed_pos(root, shift, r)
  373|  12.3k|                    .visit(push_tail_visitor<node_t>{}, tail, tail_size);
  374|  12.3k|            if (new_root)
  ------------------
  |  Branch (374:17): [True: 11.7k, False: 603]
  ------------------
  375|  11.7k|                return std::make_tuple(shift, new_root);
  376|    603|            else {
  377|    603|                auto new_root = node_t::make_inner_r_n(2);
  378|    603|                IMMER_TRY {
  ------------------
  |  |   49|    603|#define IMMER_TRY try
  ------------------
  379|    603|                    auto new_path        = node_t::make_path(shift, tail);
  380|    603|                    new_root->inner()[0] = root->inc();
  381|    603|                    new_root->inner()[1] = new_path;
  382|    603|                    new_root->relaxed()->d.sizes[0] = size;
  383|    603|                    new_root->relaxed()->d.sizes[1] = size + tail_size;
  384|    603|                    assert(size);
  ------------------
  |  Branch (384:21): [True: 603, False: 0]
  ------------------
  385|    603|                    assert(tail_size);
  ------------------
  |  Branch (385:21): [True: 603, False: 0]
  ------------------
  386|    603|                    new_root->relaxed()->d.count = 2u;
  387|    603|                }
  388|    603|                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|    603|                return std::make_tuple(shift + B, new_root);
  393|    603|            }
  394|  12.3k|        } else if (size == size_t{branches<B>} << shift) {
  ------------------
  |  Branch (394:20): [True: 903, False: 9.89k]
  ------------------
  395|    903|            auto new_root = node_t::make_inner_n(2);
  396|    903|            IMMER_TRY {
  ------------------
  |  |   49|    903|#define IMMER_TRY try
  ------------------
  397|    903|                auto new_path        = node_t::make_path(shift, tail);
  398|    903|                new_root->inner()[0] = root->inc();
  399|    903|                new_root->inner()[1] = new_path;
  400|    903|            }
  401|    903|            IMMER_CATCH (...) {
  402|      0|                node_t::delete_inner(new_root, 2);
  403|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  404|      0|            }
  405|    903|            return std::make_tuple(shift + B, new_root);
  406|  9.89k|        } else if (size) {
  ------------------
  |  Branch (406:20): [True: 4.14k, False: 5.75k]
  ------------------
  407|  4.14k|            auto new_root = make_regular_sub_pos(root, shift, size)
  408|  4.14k|                                .visit(push_tail_visitor<node_t>{}, tail);
  409|  4.14k|            return std::make_tuple(shift, new_root);
  410|  5.75k|        } else {
  411|  5.75k|            return std::make_tuple(shift, node_t::make_path(shift, tail));
  412|  5.75k|        }
  413|  23.1k|    }
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.55k|    {
  581|  5.55k|        auto tail_off = tail_offset();
  582|  5.55k|        if (idx >= tail_off) {
  ------------------
  |  Branch (582:13): [True: 555, False: 5.00k]
  ------------------
  583|    555|            auto tail_size = size - tail_off;
  584|    555|            auto new_tail =
  585|    555|                make_leaf_sub_pos(tail, tail_size)
  586|    555|                    .visit(update_visitor<node_t>{}, idx - tail_off, fn);
  587|    555|            return {size, shift, root->inc(), new_tail};
  588|  5.00k|        } else {
  589|  5.00k|            auto new_root = visit_maybe_relaxed_sub(
  590|  5.00k|                root, shift, tail_off, update_visitor<node_t>{}, idx, fn);
  591|  5.00k|            return {size, shift, new_root, tail->inc()};
  592|  5.00k|        }
  593|  5.55k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  647|  11.9k|    {
  648|  11.9k|        auto tail_off = tail_offset();
  649|  11.9k|        if (new_size == 0) {
  ------------------
  |  Branch (649:13): [True: 1.38k, False: 10.6k]
  ------------------
  650|  1.38k|            return {};
  651|  10.6k|        } else if (new_size >= size) {
  ------------------
  |  Branch (651:20): [True: 291, False: 10.3k]
  ------------------
  652|    291|            return *this;
  653|  10.3k|        } else if (new_size > tail_off) {
  ------------------
  |  Branch (653:20): [True: 239, False: 10.0k]
  ------------------
  654|    239|            auto new_tail = node_t::copy_leaf(tail, new_size - tail_off);
  655|    239|            return {new_size, shift, root->inc(), new_tail};
  656|  10.0k|        } else {
  657|  10.0k|            using std::get;
  658|  10.0k|            auto l = new_size - 1;
  659|  10.0k|            auto v = slice_right_visitor<node_t>();
  660|  10.0k|            auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l);
  661|  10.0k|            auto new_shift = get<0>(r);
  662|  10.0k|            auto new_root  = get<1>(r);
  663|  10.0k|            auto new_tail  = get<3>(r);
  664|  10.0k|            if (new_root) {
  ------------------
  |  Branch (664:17): [True: 7.62k, False: 2.44k]
  ------------------
  665|  7.62k|                IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r));
  ------------------
  |  |   68|  7.62k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (665:17): [True: 7.62k, False: 0]
  ------------------
  666|  7.62k|                assert(new_root->check(new_shift, new_size - get<2>(r)));
  ------------------
  |  Branch (666:17): [True: 7.62k, False: 0]
  ------------------
  667|  7.62k|                return {new_size, new_shift, new_root, new_tail};
  668|  7.62k|            } else {
  669|  2.44k|                return {new_size, BL, empty_root(), new_tail};
  670|  2.44k|            }
  671|  10.0k|        }
  672|  11.9k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4dropEm:
  711|  17.7k|    {
  712|  17.7k|        if (elems == 0) {
  ------------------
  |  Branch (712:13): [True: 1.28k, False: 16.4k]
  ------------------
  713|  1.28k|            return *this;
  714|  16.4k|        } else if (elems >= size) {
  ------------------
  |  Branch (714:20): [True: 218, False: 16.2k]
  ------------------
  715|    218|            return {};
  716|  16.2k|        } else if (elems == tail_offset()) {
  ------------------
  |  Branch (716:20): [True: 205, False: 16.0k]
  ------------------
  717|    205|            return {size - elems, BL, empty_root(), tail->inc()};
  718|  16.0k|        } else if (elems > tail_offset()) {
  ------------------
  |  Branch (718:20): [True: 524, False: 15.5k]
  ------------------
  719|    524|            auto tail_off = tail_offset();
  720|    524|            auto new_tail =
  721|    524|                node_t::copy_leaf(tail, elems - tail_off, size - tail_off);
  722|    524|            return {size - elems, BL, empty_root(), new_tail};
  723|  15.5k|        } else {
  724|  15.5k|            using std::get;
  725|  15.5k|            auto v = slice_left_visitor<node_t>();
  726|  15.5k|            auto r =
  727|  15.5k|                visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems);
  728|  15.5k|            auto new_root  = get<1>(r);
  729|  15.5k|            auto new_shift = get<0>(r);
  730|  15.5k|            return {size - elems, new_shift, new_root, tail->inc()};
  731|  15.5k|        }
  732|  17.7k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8max_sizeEv:
   54|  1.96M|    {
   55|  1.96M|        auto S = sizeof(size_t) * 8;
   56|  1.96M|        return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) *
   57|  1.96M|               ipow((size_t{1} << B) - 2, (S - BL) / B);
   58|  1.96M|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6concatERKSB_:
  735|  55.1k|    {
  736|  55.1k|        assert(r.size + size <= max_size());
  ------------------
  |  Branch (736:9): [True: 55.1k, False: 0]
  ------------------
  737|  55.1k|        using std::get;
  738|  55.1k|        if (size == 0)
  ------------------
  |  Branch (738:13): [True: 762, False: 54.3k]
  ------------------
  739|    762|            return r;
  740|  54.3k|        else if (r.size == 0)
  ------------------
  |  Branch (740:18): [True: 378, False: 53.9k]
  ------------------
  741|    378|            return *this;
  742|  53.9k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (742:18): [True: 6.20k, False: 47.7k]
  ------------------
  743|       |            // just concat the tail, similar to push_back
  744|  6.20k|            auto tail_offst = tail_offset();
  745|  6.20k|            auto tail_size  = size - tail_offst;
  746|  6.20k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (746:17): [True: 2.24k, False: 3.96k]
  ------------------
  747|  2.24k|                auto new_root =
  748|  2.24k|                    push_tail(root, shift, tail_offst, tail, tail_size);
  749|  2.24k|                tail->inc();
  750|  2.24k|                return {size + r.size,
  751|  2.24k|                        get<0>(new_root),
  752|  2.24k|                        get<1>(new_root),
  753|  2.24k|                        r.tail->inc()};
  754|  3.96k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (754:24): [True: 2.41k, False: 1.54k]
  ------------------
  755|  2.41k|                auto new_tail =
  756|  2.41k|                    node_t::copy_leaf(tail, tail_size, r.tail, r.size);
  757|  2.41k|                return {size + r.size, shift, root->inc(), new_tail};
  758|  2.41k|            } else {
  759|  1.54k|                auto remaining = branches<BL> - tail_size;
  760|  1.54k|                auto add_tail =
  761|  1.54k|                    node_t::copy_leaf(tail, tail_size, r.tail, remaining);
  762|  1.54k|                IMMER_TRY {
  ------------------
  |  |   49|  1.54k|#define IMMER_TRY try
  ------------------
  763|  1.54k|                    auto new_tail =
  764|  1.54k|                        node_t::copy_leaf(r.tail, remaining, r.size);
  765|  1.54k|                    IMMER_TRY {
  ------------------
  |  |   49|  1.54k|#define IMMER_TRY try
  ------------------
  766|  1.54k|                        auto new_root = push_tail(
  767|  1.54k|                            root, shift, tail_offst, add_tail, branches<BL>);
  768|  1.54k|                        return {size + r.size,
  769|  1.54k|                                get<0>(new_root),
  770|  1.54k|                                get<1>(new_root),
  771|  1.54k|                                new_tail};
  772|  1.54k|                    }
  773|  1.54k|                    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.54k|                }
  778|  1.54k|                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.54k|            }
  783|  47.7k|        } else if (tail_offset() == 0) {
  ------------------
  |  Branch (783:20): [True: 3.24k, False: 44.5k]
  ------------------
  784|  3.24k|            auto tail_offst = tail_offset();
  785|  3.24k|            auto tail_size  = size - tail_offst;
  786|  3.24k|            auto concated =
  787|  3.24k|                concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset());
  788|  3.24k|            auto new_shift = concated.shift();
  789|  3.24k|            auto new_root  = concated.node();
  790|  3.24k|            IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift());
  ------------------
  |  |   68|  3.24k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (790:13): [True: 3.24k, False: 0]
  ------------------
  791|  3.24k|            assert(new_root->check(new_shift, size + r.tail_offset()));
  ------------------
  |  Branch (791:13): [True: 3.24k, False: 0]
  ------------------
  792|  3.24k|            return {size + r.size, new_shift, new_root, r.tail->inc()};
  793|  44.5k|        } else {
  794|  44.5k|            auto tail_offst = tail_offset();
  795|  44.5k|            auto tail_size  = size - tail_offst;
  796|  44.5k|            auto concated   = concat_trees(root,
  797|  44.5k|                                         shift,
  798|  44.5k|                                         tail_offst,
  799|  44.5k|                                         tail,
  800|  44.5k|                                         tail_size,
  801|  44.5k|                                         r.root,
  802|  44.5k|                                         r.shift,
  803|  44.5k|                                         r.tail_offset());
  804|  44.5k|            auto new_shift  = concated.shift();
  805|  44.5k|            auto new_root   = concated.node();
  806|  44.5k|            IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift());
  ------------------
  |  |   68|  44.5k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (806:13): [True: 44.5k, False: 0]
  ------------------
  807|  44.5k|            assert(new_root->check(new_shift, size + r.tail_offset()));
  ------------------
  |  Branch (807:13): [True: 44.5k, False: 0]
  ------------------
  808|  44.5k|            return {size + r.size, new_shift, new_root, r.tail->inc()};
  809|  44.5k|        }
  810|  55.1k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi:
  478|  51.4k|    {
  479|  51.4k|        auto ts = tail_size();
  480|  51.4k|        if (ts < branches<BL>) {
  ------------------
  |  Branch (480:13): [True: 32.5k, False: 18.9k]
  ------------------
  481|  32.5k|            ensure_mutable_tail(e, ts);
  482|  32.5k|            new (&tail->leaf()[ts]) T(std::move(value));
  483|  32.5k|        } else {
  484|  18.9k|            using std::get;
  485|  18.9k|            auto new_tail = node_t::make_leaf_e(e, std::move(value));
  486|  18.9k|            auto tail_off = tail_offset();
  487|  18.9k|            IMMER_TRY {
  ------------------
  |  |   49|  18.9k|#define IMMER_TRY try
  ------------------
  488|  18.9k|                push_tail_mut(e, tail_off, tail, ts);
  489|  18.9k|                tail = new_tail;
  490|  18.9k|            }
  491|  18.9k|            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.9k|        }
  496|  51.4k|        ++size;
  497|  51.4k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj:
  469|  1.30M|    {
  470|  1.30M|        if (!tail->can_mutate(e)) {
  ------------------
  |  Branch (470:13): [True: 22.0k, False: 1.28M]
  ------------------
  471|  22.0k|            auto new_tail = node_t::copy_leaf_e(e, tail, n);
  472|  22.0k|            dec_leaf(tail, n);
  473|  22.0k|            tail = new_tail;
  474|  22.0k|        }
  475|  1.30M|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj:
  417|  1.68M|    {
  418|  1.68M|        if (auto r = root->relaxed()) {
  ------------------
  |  Branch (418:18): [True: 640k, False: 1.04M]
  ------------------
  419|   640k|            auto new_root =
  420|   640k|                make_relaxed_pos(root, shift, r)
  421|   640k|                    .visit(push_tail_mut_visitor<node_t>{}, e, tail, tail_size);
  422|   640k|            if (new_root) {
  ------------------
  |  Branch (422:17): [True: 638k, False: 1.35k]
  ------------------
  423|   638k|                root = new_root;
  424|   638k|            } else {
  425|  1.35k|                auto new_root = node_t::make_inner_r_e(e);
  426|  1.35k|                IMMER_TRY {
  ------------------
  |  |   49|  1.35k|#define IMMER_TRY try
  ------------------
  427|  1.35k|                    auto new_path        = node_t::make_path_e(e, shift, tail);
  428|  1.35k|                    new_root->inner()[0] = root;
  429|  1.35k|                    new_root->inner()[1] = new_path;
  430|  1.35k|                    new_root->relaxed()->d.sizes[0] = tail_off;
  431|  1.35k|                    new_root->relaxed()->d.sizes[1] = tail_off + tail_size;
  432|  1.35k|                    assert(tail_off);
  ------------------
  |  Branch (432:21): [True: 1.35k, False: 0]
  ------------------
  433|  1.35k|                    assert(tail_size);
  ------------------
  |  Branch (433:21): [True: 1.35k, False: 0]
  ------------------
  434|  1.35k|                    new_root->relaxed()->d.count = 2u;
  435|  1.35k|                    root                         = new_root;
  436|  1.35k|                    shift += B;
  437|  1.35k|                }
  438|  1.35k|                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.35k|            }
  443|  1.04M|        } else if (tail_off == size_t{branches<B>} << shift) {
  ------------------
  |  Branch (443:20): [True: 5.20k, False: 1.03M]
  ------------------
  444|  5.20k|            auto new_root = node_t::make_inner_e(e);
  445|  5.20k|            IMMER_TRY {
  ------------------
  |  |   49|  5.20k|#define IMMER_TRY try
  ------------------
  446|  5.20k|                auto new_path        = node_t::make_path_e(e, shift, tail);
  447|  5.20k|                new_root->inner()[0] = root;
  448|  5.20k|                new_root->inner()[1] = new_path;
  449|  5.20k|                root                 = new_root;
  450|  5.20k|                shift += B;
  451|  5.20k|            }
  452|  5.20k|            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.03M|        } else if (tail_off) {
  ------------------
  |  Branch (456:20): [True: 1.03M, False: 4.94k]
  ------------------
  457|  1.03M|            auto new_root =
  458|  1.03M|                make_regular_sub_pos(root, shift, tail_off)
  459|  1.03M|                    .visit(push_tail_mut_visitor<node_t>{}, e, tail);
  460|  1.03M|            root = new_root;
  461|  1.03M|        } else {
  462|  4.94k|            auto new_root = node_t::make_path_e(e, shift, tail);
  463|  4.94k|            dec_empty_regular(root);
  464|  4.94k|            root = new_root;
  465|  4.94k|        }
  466|  1.68M|    }
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.1k|    {
  574|  11.1k|        auto& elem = get_mut(e, idx);
  575|  11.1k|        elem       = std::forward<FnT>(fn)(std::move(elem));
  576|  11.1k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm:
  539|  11.1k|    {
  540|  11.1k|        auto tail_off = tail_offset();
  541|  11.1k|        if (idx >= tail_off) {
  ------------------
  |  Branch (541:13): [True: 642, False: 10.5k]
  ------------------
  542|    642|            ensure_mutable_tail(e, size - tail_off);
  543|    642|            return tail->leaf()[(idx - tail_off) & mask<BL>];
  544|  10.5k|        } else {
  545|  10.5k|            return visit_maybe_relaxed_sub(root,
  546|  10.5k|                                           shift,
  547|  10.5k|                                           tail_off,
  548|  10.5k|                                           get_mut_visitor<node_t>{},
  549|  10.5k|                                           idx,
  550|  10.5k|                                           e,
  551|  10.5k|                                           &root);
  552|  10.5k|        }
  553|  11.1k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm:
  606|  39.3k|    {
  607|  39.3k|        auto tail_off = tail_offset();
  608|  39.3k|        if (new_size == 0) {
  ------------------
  |  Branch (608:13): [True: 950, False: 38.4k]
  ------------------
  609|    950|            *this = {};
  610|  38.4k|        } else if (new_size >= size) {
  ------------------
  |  Branch (610:20): [True: 2.68k, False: 35.7k]
  ------------------
  611|  2.68k|            return;
  612|  35.7k|        } else if (new_size > tail_off) {
  ------------------
  |  Branch (612:20): [True: 884, False: 34.8k]
  ------------------
  613|    884|            auto ts    = size - tail_off;
  614|    884|            auto newts = new_size - tail_off;
  615|    884|            if (tail->can_mutate(e)) {
  ------------------
  |  Branch (615:17): [True: 565, False: 319]
  ------------------
  616|    565|                detail::destroy_n(tail->leaf() + newts, ts - newts);
  617|    565|            } else {
  618|    319|                auto new_tail = node_t::copy_leaf_e(e, tail, newts);
  619|    319|                dec_leaf(tail, ts);
  620|    319|                tail = new_tail;
  621|    319|            }
  622|    884|            size = new_size;
  623|    884|            return;
  624|  34.8k|        } else {
  625|  34.8k|            using std::get;
  626|  34.8k|            auto l = new_size - 1;
  627|  34.8k|            auto v = slice_right_mut_visitor<node_t>();
  628|  34.8k|            auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e);
  629|  34.8k|            auto new_shift = get<0>(r);
  630|  34.8k|            auto new_root  = get<1>(r);
  631|  34.8k|            auto new_tail  = get<3>(r);
  632|  34.8k|            if (new_root) {
  ------------------
  |  Branch (632:17): [True: 27.2k, False: 7.64k]
  ------------------
  633|  27.2k|                root  = new_root;
  634|  27.2k|                shift = new_shift;
  635|  27.2k|            } else {
  636|  7.64k|                root  = empty_root();
  637|  7.64k|                shift = BL;
  638|  7.64k|            }
  639|  34.8k|            dec_leaf(tail, size - tail_off);
  640|  34.8k|            size = new_size;
  641|  34.8k|            tail = new_tail;
  642|  34.8k|            return;
  643|  34.8k|        }
  644|  39.3k|    }
_ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE:
  942|  31.9k|    {
  943|  31.9k|        assert(&l != &r);
  ------------------
  |  Branch (943:9): [True: 31.9k, False: 0]
  ------------------
  944|  31.9k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (944:9): [True: 31.9k, False: 0]
  ------------------
  945|  31.9k|        using std::get;
  946|  31.9k|        if (r.size == 0)
  ------------------
  |  Branch (946:13): [True: 3.29k, False: 28.6k]
  ------------------
  947|  3.29k|            r = std::move(l);
  948|  28.6k|        else if (l.size == 0)
  ------------------
  |  Branch (948:18): [True: 543, False: 28.1k]
  ------------------
  949|    543|            return;
  950|  28.1k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (950:18): [True: 6.29k, False: 21.8k]
  ------------------
  951|       |            // just concat the tail, similar to push_back
  952|  6.29k|            auto tail_offst = l.tail_offset();
  953|  6.29k|            auto tail_size  = l.size - tail_offst;
  954|  6.29k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (954:17): [True: 1.05k, False: 5.24k]
  ------------------
  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.05k|                auto res =
  959|  1.05k|                    l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size);
  960|  1.05k|                l.tail->inc(); // note: leak if mutably concatenated
  961|       |                               // with itself, but this is forbidden
  962|       |                               // by the interface
  963|  1.05k|                r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()};
  964|  1.05k|                return;
  965|  5.24k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (965:24): [True: 3.07k, False: 2.17k]
  ------------------
  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.07k|                auto new_tail =
  974|  3.07k|                    node_t::copy_leaf(l.tail, tail_size, r.tail, r.size);
  975|  3.07k|                r = {l.size + r.size, l.shift, l.root->inc(), new_tail};
  976|  3.07k|                return;
  977|  3.07k|            } else {
  978|       |                // like the immutable version
  979|  2.17k|                auto remaining = branches<BL> - tail_size;
  980|  2.17k|                auto add_tail  = node_t::copy_leaf_e(
  981|  2.17k|                    er, l.tail, tail_size, r.tail, remaining);
  982|  2.17k|                IMMER_TRY {
  ------------------
  |  |   49|  2.17k|#define IMMER_TRY try
  ------------------
  983|  2.17k|                    auto new_tail =
  984|  2.17k|                        node_t::copy_leaf_e(er, r.tail, remaining, r.size);
  985|  2.17k|                    IMMER_TRY {
  ------------------
  |  |   49|  2.17k|#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.17k|                        auto new_root = l.push_tail(l.root,
  990|  2.17k|                                                    l.shift,
  991|  2.17k|                                                    tail_offst,
  992|  2.17k|                                                    add_tail,
  993|  2.17k|                                                    branches<BL>);
  994|  2.17k|                        r             = {l.size + r.size,
  995|  2.17k|                                         get<0>(new_root),
  996|  2.17k|                                         get<1>(new_root),
  997|  2.17k|                                         new_tail};
  998|  2.17k|                        return;
  999|  2.17k|                    }
 1000|  2.17k|                    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.17k|                }
 1005|  2.17k|                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.17k|            }
 1010|  21.8k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1010:20): [True: 2.68k, False: 19.1k]
  ------------------
 1011|  2.68k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1011:17): [True: 2.68k, Folded]
  ------------------
 1012|  2.68k|                auto tail_offst = l.tail_offset();
 1013|  2.68k|                auto tail_size  = l.size - tail_offst;
 1014|  2.68k|                auto concated =
 1015|  2.68k|                    concat_trees_mut(er,
 1016|  2.68k|                                     MemoryPolicy::transience_t::noone,
 1017|  2.68k|                                     l.tail,
 1018|  2.68k|                                     tail_size,
 1019|  2.68k|                                     er,
 1020|  2.68k|                                     r.root,
 1021|  2.68k|                                     r.shift,
 1022|  2.68k|                                     r.tail_offset());
 1023|  2.68k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  2.68k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1023:17): [True: 2.68k, False: 0]
  ------------------
 1024|  2.68k|                                    concated.node()->compute_shift());
 1025|  2.68k|                r.size += l.size;
 1026|  2.68k|                r.shift = concated.shift();
 1027|  2.68k|                r.root  = concated.node();
 1028|  2.68k|                assert(r.check_tree());
  ------------------
  |  Branch (1028:17): [True: 2.68k, False: 0]
  ------------------
 1029|  2.68k|            } 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|  19.1k|        } else {
 1041|  19.1k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1041:17): [True: 19.1k, Folded]
  ------------------
 1042|  19.1k|                auto tail_offst = l.tail_offset();
 1043|  19.1k|                auto tail_size  = l.size - tail_offst;
 1044|  19.1k|                auto concated =
 1045|  19.1k|                    concat_trees_mut(er,
 1046|  19.1k|                                     MemoryPolicy::transience_t::noone,
 1047|  19.1k|                                     l.root,
 1048|  19.1k|                                     l.shift,
 1049|  19.1k|                                     tail_offst,
 1050|  19.1k|                                     l.tail,
 1051|  19.1k|                                     tail_size,
 1052|  19.1k|                                     er,
 1053|  19.1k|                                     r.root,
 1054|  19.1k|                                     r.shift,
 1055|  19.1k|                                     r.tail_offset());
 1056|  19.1k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  19.1k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1056:17): [True: 19.1k, False: 0]
  ------------------
 1057|  19.1k|                                    concated.node()->compute_shift());
 1058|  19.1k|                r.size += l.size;
 1059|  19.1k|                r.shift = concated.shift();
 1060|  19.1k|                r.root  = concated.node();
 1061|  19.1k|                assert(r.check_tree());
  ------------------
  |  Branch (1061:17): [True: 19.1k, False: 0]
  ------------------
 1062|  19.1k|                return;
 1063|  19.1k|            } 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|  19.1k|        }
 1081|  31.9k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEaSERKSB_:
  163|  6.42k|    {
  164|  6.42k|        auto next{other};
  165|  6.42k|        swap(*this, next);
  166|  6.42k|        return *this;
  167|  6.42k|    }
_ZN5immer6detail4rbts15concat_mut_lr_rERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_:
 1220|  3.71k|    {
 1221|  3.71k|        assert(&l != &r);
  ------------------
  |  Branch (1221:9): [True: 3.71k, False: 0]
  ------------------
 1222|  3.71k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (1222:9): [True: 3.71k, False: 0]
  ------------------
 1223|  3.71k|        using std::get;
 1224|  3.71k|        if (r.size == 0)
  ------------------
  |  Branch (1224:13): [True: 305, False: 3.40k]
  ------------------
 1225|    305|            r = l;
 1226|  3.40k|        else if (l.size == 0)
  ------------------
  |  Branch (1226:18): [True: 327, False: 3.08k]
  ------------------
 1227|    327|            return;
 1228|  3.08k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (1228:18): [True: 1.16k, False: 1.91k]
  ------------------
 1229|       |            // just concat the tail, similar to push_back
 1230|  1.16k|            auto tail_offst = l.tail_offset();
 1231|  1.16k|            auto tail_size  = l.size - tail_offst;
 1232|  1.16k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (1232:17): [True: 324, False: 841]
  ------------------
 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|    324|                auto res =
 1237|    324|                    l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size);
 1238|    324|                r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()};
 1239|    324|                return;
 1240|    841|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (1240:24): [True: 582, False: 259]
  ------------------
 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|    582|                auto new_tail =
 1249|    582|                    node_t::copy_leaf(l.tail, tail_size, r.tail, r.size);
 1250|    582|                r = {l.size + r.size, l.shift, l.root->inc(), new_tail};
 1251|    582|                return;
 1252|    582|            } else {
 1253|       |                // like the immutable version.
 1254|       |                // we could improve this also by moving elements
 1255|       |                // instead of just copying them
 1256|    259|                auto remaining = branches<BL> - tail_size;
 1257|    259|                auto add_tail  = node_t::copy_leaf_e(
 1258|    259|                    er, l.tail, tail_size, r.tail, remaining);
 1259|    259|                IMMER_TRY {
  ------------------
  |  |   49|    259|#define IMMER_TRY try
  ------------------
 1260|    259|                    auto new_tail =
 1261|    259|                        node_t::copy_leaf_e(er, r.tail, remaining, r.size);
 1262|    259|                    IMMER_TRY {
  ------------------
  |  |   49|    259|#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|    259|                        auto new_root = l.push_tail(l.root,
 1267|    259|                                                    l.shift,
 1268|    259|                                                    tail_offst,
 1269|    259|                                                    add_tail,
 1270|    259|                                                    branches<BL>);
 1271|    259|                        r             = {l.size + r.size,
 1272|    259|                                         get<0>(new_root),
 1273|    259|                                         get<1>(new_root),
 1274|    259|                                         new_tail};
 1275|    259|                        return;
 1276|    259|                    }
 1277|    259|                    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|    259|                }
 1282|    259|                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|    259|            }
 1287|  1.91k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1287:20): [True: 674, False: 1.24k]
  ------------------
 1288|    674|            if (supports_transient_concat) {
  ------------------
  |  Branch (1288:17): [True: 674, Folded]
  ------------------
 1289|    674|                auto tail_offst = l.tail_offset();
 1290|    674|                auto tail_size  = l.size - tail_offst;
 1291|    674|                auto concated   = concat_trees_mut(er,
 1292|    674|                                                 el,
 1293|    674|                                                 l.tail,
 1294|    674|                                                 tail_size,
 1295|    674|                                                 er,
 1296|    674|                                                 r.root,
 1297|    674|                                                 r.shift,
 1298|    674|                                                 r.tail_offset());
 1299|    674|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|    674|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1299:17): [True: 674, False: 0]
  ------------------
 1300|    674|                                    concated.node()->compute_shift());
 1301|    674|                assert(concated.node()->check(concated.shift(),
  ------------------
  |  Branch (1301:17): [True: 674, False: 0]
  ------------------
 1302|    674|                                              l.size + r.tail_offset()));
 1303|    674|                r.size += l.size;
 1304|    674|                r.shift = concated.shift();
 1305|    674|                r.root  = concated.node();
 1306|    674|                assert(r.check_tree());
  ------------------
  |  Branch (1306:17): [True: 674, False: 0]
  ------------------
 1307|    674|                l.hard_reset();
 1308|    674|            } 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.71k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10hard_resetEv:
 1363|  4.04k|    {
 1364|  4.04k|        assert(supports_transient_concat);
  ------------------
  |  Branch (1364:9): [True: 4.04k, Folded]
  ------------------
 1365|  4.04k|        size  = 0;
 1366|  4.04k|        shift = BL;
 1367|  4.04k|        root  = empty_root();
 1368|  4.04k|        tail  = empty_tail();
 1369|  4.04k|    }
_ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_:
  816|  1.78M|    {
  817|  1.78M|        assert(&l != &r);
  ------------------
  |  Branch (817:9): [True: 1.78M, False: 0]
  ------------------
  818|  1.78M|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (818:9): [True: 1.78M, False: 0]
  ------------------
  819|  1.78M|        using std::get;
  820|  1.78M|        if (l.size == 0)
  ------------------
  |  Branch (820:13): [True: 2.15k, False: 1.77M]
  ------------------
  821|  2.15k|            l = r;
  822|  1.77M|        else if (r.size == 0)
  ------------------
  |  Branch (822:18): [True: 14.1k, False: 1.76M]
  ------------------
  823|  14.1k|            return;
  824|  1.76M|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (824:18): [True: 1.66M, False: 99.1k]
  ------------------
  825|       |            // just concat the tail, similar to push_back
  826|  1.66M|            auto tail_offst = l.tail_offset();
  827|  1.66M|            auto tail_size  = l.size - tail_offst;
  828|  1.66M|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (828:17): [True: 396k, False: 1.26M]
  ------------------
  829|   396k|                l.push_tail_mut(el, tail_offst, l.tail, tail_size);
  830|   396k|                l.tail = r.tail->inc();
  831|   396k|                l.size += r.size;
  832|   396k|                return;
  833|  1.26M|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (833:24): [True: 3.30k, False: 1.26M]
  ------------------
  834|  3.30k|                l.ensure_mutable_tail(el, tail_size);
  835|  3.30k|                detail::uninitialized_copy(r.tail->leaf(),
  836|  3.30k|                                           r.tail->leaf() + r.size,
  837|  3.30k|                                           l.tail->leaf() + tail_size);
  838|  3.30k|                l.size += r.size;
  839|  3.30k|                return;
  840|  1.26M|            } else {
  841|  1.26M|                auto remaining = branches<BL> - tail_size;
  842|  1.26M|                l.ensure_mutable_tail(el, tail_size);
  843|  1.26M|                detail::uninitialized_copy(r.tail->leaf(),
  844|  1.26M|                                           r.tail->leaf() + remaining,
  845|  1.26M|                                           l.tail->leaf() + tail_size);
  846|  1.26M|                IMMER_TRY {
  ------------------
  |  |   49|  1.26M|#define IMMER_TRY try
  ------------------
  847|  1.26M|                    auto new_tail =
  848|  1.26M|                        node_t::copy_leaf_e(el, r.tail, remaining, r.size);
  849|  1.26M|                    IMMER_TRY {
  ------------------
  |  |   49|  1.26M|#define IMMER_TRY try
  ------------------
  850|  1.26M|                        l.push_tail_mut(el, tail_offst, l.tail, branches<BL>);
  851|  1.26M|                        l.tail = new_tail;
  852|  1.26M|                        l.size += r.size;
  853|  1.26M|                        return;
  854|  1.26M|                    }
  855|  1.26M|                    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.26M|                }
  860|  1.26M|                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.26M|            }
  865|  1.66M|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (865:20): [True: 3.09k, False: 96.0k]
  ------------------
  866|  3.09k|            if (supports_transient_concat) {
  ------------------
  |  Branch (866:17): [True: 3.09k, Folded]
  ------------------
  867|  3.09k|                auto tail_offst = l.tail_offset();
  868|  3.09k|                auto tail_size  = l.size - tail_offst;
  869|  3.09k|                auto concated =
  870|  3.09k|                    concat_trees_mut(el,
  871|  3.09k|                                     el,
  872|  3.09k|                                     l.tail,
  873|  3.09k|                                     tail_size,
  874|  3.09k|                                     MemoryPolicy::transience_t::noone,
  875|  3.09k|                                     r.root,
  876|  3.09k|                                     r.shift,
  877|  3.09k|                                     r.tail_offset());
  878|  3.09k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  3.09k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (878:17): [True: 3.09k, False: 0]
  ------------------
  879|  3.09k|                                    concated.node()->compute_shift());
  880|  3.09k|                l.size += r.size;
  881|  3.09k|                l.shift = concated.shift();
  882|  3.09k|                l.root  = concated.node();
  883|  3.09k|                l.tail  = r.tail;
  884|  3.09k|                assert(l.check_tree());
  ------------------
  |  Branch (884:17): [True: 3.09k, False: 0]
  ------------------
  885|  3.09k|            } 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|  96.0k|        } else {
  898|  96.0k|            if (supports_transient_concat) {
  ------------------
  |  Branch (898:17): [True: 96.0k, Folded]
  ------------------
  899|  96.0k|                auto tail_offst = l.tail_offset();
  900|  96.0k|                auto tail_size  = l.size - tail_offst;
  901|  96.0k|                assert(l.check_tree());
  ------------------
  |  Branch (901:17): [True: 96.0k, False: 0]
  ------------------
  902|  96.0k|                assert(r.check_tree());
  ------------------
  |  Branch (902:17): [True: 96.0k, False: 0]
  ------------------
  903|  96.0k|                auto concated =
  904|  96.0k|                    concat_trees_mut(el,
  905|  96.0k|                                     el,
  906|  96.0k|                                     l.root,
  907|  96.0k|                                     l.shift,
  908|  96.0k|                                     tail_offst,
  909|  96.0k|                                     l.tail,
  910|  96.0k|                                     tail_size,
  911|  96.0k|                                     MemoryPolicy::transience_t::noone,
  912|  96.0k|                                     r.root,
  913|  96.0k|                                     r.shift,
  914|  96.0k|                                     r.tail_offset());
  915|  96.0k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  96.0k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (915:17): [True: 96.0k, False: 0]
  ------------------
  916|  96.0k|                                    concated.node()->compute_shift());
  917|  96.0k|                l.size += r.size;
  918|  96.0k|                l.shift = concated.shift();
  919|  96.0k|                l.root  = concated.node();
  920|  96.0k|                l.tail  = r.tail;
  921|  96.0k|                assert(l.check_tree());
  ------------------
  |  Branch (921:17): [True: 96.0k, False: 0]
  ------------------
  922|  96.0k|            } 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|  96.0k|        }
  939|  1.78M|    }
_ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_:
 1084|  5.73k|    {
 1085|  5.73k|        assert(&l != &r);
  ------------------
  |  Branch (1085:9): [True: 5.73k, False: 0]
  ------------------
 1086|  5.73k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (1086:9): [True: 5.73k, False: 0]
  ------------------
 1087|  5.73k|        using std::get;
 1088|  5.73k|        if (l.size == 0)
  ------------------
  |  Branch (1088:13): [True: 665, False: 5.06k]
  ------------------
 1089|    665|            l = r;
 1090|  5.06k|        else if (r.size == 0)
  ------------------
  |  Branch (1090:18): [True: 476, False: 4.58k]
  ------------------
 1091|    476|            return;
 1092|  4.58k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (1092:18): [True: 2.46k, False: 2.12k]
  ------------------
 1093|       |            // just concat the tail, similar to push_back
 1094|  2.46k|            auto tail_offst = l.tail_offset();
 1095|  2.46k|            auto tail_size  = l.size - tail_offst;
 1096|  2.46k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (1096:17): [True: 448, False: 2.01k]
  ------------------
 1097|    448|                l.push_tail_mut(el, tail_offst, l.tail, tail_size);
 1098|    448|                l.tail = r.tail->inc();
 1099|    448|                l.size += r.size;
 1100|    448|                return;
 1101|  2.01k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (1101:24): [True: 1.25k, False: 759]
  ------------------
 1102|  1.25k|                l.ensure_mutable_tail(el, tail_size);
 1103|  1.25k|                if (r.tail->can_mutate(er))
  ------------------
  |  Branch (1103:21): [True: 857, False: 398]
  ------------------
 1104|    857|                    detail::uninitialized_move(r.tail->leaf(),
 1105|    857|                                               r.tail->leaf() + r.size,
 1106|    857|                                               l.tail->leaf() + tail_size);
 1107|    398|                else
 1108|    398|                    detail::uninitialized_copy(r.tail->leaf(),
 1109|    398|                                               r.tail->leaf() + r.size,
 1110|    398|                                               l.tail->leaf() + tail_size);
 1111|  1.25k|                l.size += r.size;
 1112|  1.25k|                return;
 1113|  1.25k|            } else {
 1114|    759|                auto remaining = branches<BL> - tail_size;
 1115|    759|                l.ensure_mutable_tail(el, tail_size);
 1116|    759|                if (r.tail->can_mutate(er))
  ------------------
  |  Branch (1116:21): [True: 202, False: 557]
  ------------------
 1117|    202|                    detail::uninitialized_move(r.tail->leaf(),
 1118|    202|                                               r.tail->leaf() + remaining,
 1119|    202|                                               l.tail->leaf() + tail_size);
 1120|    557|                else
 1121|    557|                    detail::uninitialized_copy(r.tail->leaf(),
 1122|    557|                                               r.tail->leaf() + remaining,
 1123|    557|                                               l.tail->leaf() + tail_size);
 1124|    759|                IMMER_TRY {
  ------------------
  |  |   49|    759|#define IMMER_TRY try
  ------------------
 1125|    759|                    auto new_tail =
 1126|    759|                        node_t::copy_leaf_e(el, r.tail, remaining, r.size);
 1127|    759|                    IMMER_TRY {
  ------------------
  |  |   49|    759|#define IMMER_TRY try
  ------------------
 1128|    759|                        l.push_tail_mut(el, tail_offst, l.tail, branches<BL>);
 1129|    759|                        l.tail = new_tail;
 1130|    759|                        l.size += r.size;
 1131|    759|                        return;
 1132|    759|                    }
 1133|    759|                    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|    759|                }
 1138|    759|                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|    759|            }
 1143|  2.46k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1143:20): [True: 593, False: 1.53k]
  ------------------
 1144|    593|            if (supports_transient_concat) {
  ------------------
  |  Branch (1144:17): [True: 593, Folded]
  ------------------
 1145|    593|                auto tail_offst = l.tail_offset();
 1146|    593|                auto tail_size  = l.size - tail_offst;
 1147|    593|                auto concated   = concat_trees_mut(el,
 1148|    593|                                                 el,
 1149|    593|                                                 l.tail,
 1150|    593|                                                 tail_size,
 1151|    593|                                                 er,
 1152|    593|                                                 r.root,
 1153|    593|                                                 r.shift,
 1154|    593|                                                 r.tail_offset());
 1155|    593|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|    593|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1155:17): [True: 593, False: 0]
  ------------------
 1156|    593|                                    concated.node()->compute_shift());
 1157|    593|                l.size += r.size;
 1158|    593|                l.shift = concated.shift();
 1159|    593|                l.root  = concated.node();
 1160|    593|                l.tail  = r.tail;
 1161|    593|                assert(l.check_tree());
  ------------------
  |  Branch (1161:17): [True: 593, False: 0]
  ------------------
 1162|    593|                r.hard_reset();
 1163|    593|                return;
 1164|    593|            } 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.53k|        } else {
 1176|  1.53k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1176:17): [True: 1.53k, Folded]
  ------------------
 1177|  1.53k|                auto tail_offst = l.tail_offset();
 1178|  1.53k|                auto tail_size  = l.size - tail_offst;
 1179|  1.53k|                auto concated   = concat_trees_mut(el,
 1180|  1.53k|                                                 el,
 1181|  1.53k|                                                 l.root,
 1182|  1.53k|                                                 l.shift,
 1183|  1.53k|                                                 tail_offst,
 1184|  1.53k|                                                 l.tail,
 1185|  1.53k|                                                 tail_size,
 1186|  1.53k|                                                 er,
 1187|  1.53k|                                                 r.root,
 1188|  1.53k|                                                 r.shift,
 1189|  1.53k|                                                 r.tail_offset());
 1190|  1.53k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  1.53k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1190:17): [True: 1.53k, False: 0]
  ------------------
 1191|  1.53k|                                    concated.node()->compute_shift());
 1192|  1.53k|                l.size += r.size;
 1193|  1.53k|                l.shift = concated.shift();
 1194|  1.53k|                l.root  = concated.node();
 1195|  1.53k|                l.tail  = r.tail;
 1196|  1.53k|                assert(l.check_tree());
  ------------------
  |  Branch (1196:17): [True: 1.53k, False: 0]
  ------------------
 1197|  1.53k|                r.hard_reset();
 1198|  1.53k|                return;
 1199|  1.53k|            } 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.53k|        }
 1217|  5.73k|    }

_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|  14.3k|    {
   32|  14.3k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  14.3k|    }
_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|  90.1k|    {
   32|  90.1k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  90.1k|    }
_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.58k|    {
   38|  1.58k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.58k|    }
_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.78k|    {
   38|  2.78k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.78k|    }
_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.46k|    {
   38|  2.46k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.46k|    }
_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.10k|    {
   38|  1.10k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.10k|    }
_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|    349|    {
   38|    349|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    349|    }
_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.24k|    {
   38|  3.24k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.24k|    }
_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.24k|    {
   44|  3.24k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.24k|    }
_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.91k|    {
   32|  1.91k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.91k|    }
_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.91k|    {
   44|  1.91k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  1.91k|    }
_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|   970k|    {
   50|   970k|        return Deriv::visit_node(std::forward<Args>(args)...);
   51|   970k|    }
_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.24M|    {
   32|  4.24M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  4.24M|    }
_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.24M|    {
   44|  4.24M|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  4.24M|    }
_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.29M|    {
   32|  1.29M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.29M|    }
_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.75k|    {
   32|  5.75k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  5.75k|    }
_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|    214|    {
   38|    214|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    214|    }
_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.30k|    {
   38|  1.30k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.30k|    }
_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|   114k|    {
   50|   114k|        return Deriv::visit_node(std::forward<Args>(args)...);
   51|   114k|    }
_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|   196k|    {
   38|   196k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   196k|    }
_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|   196k|    {
   44|   196k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   196k|    }
_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.2k|    {
   38|  28.2k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  28.2k|    }
_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|   147k|    {
   38|   147k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   147k|    }
_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|   147k|    {
   44|   147k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   147k|    }
_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|  18.8k|    {
   38|  18.8k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  18.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.33k|    {
   38|  1.33k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.33k|    }
_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.33k|    {
   44|  1.33k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  1.33k|    }
_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|  38.9k|    {
   32|  38.9k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  38.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|  38.9k|    {
   44|  38.9k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  38.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|  36.4k|    {
   32|  36.4k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  36.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|  36.4k|    {
   44|  36.4k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  36.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.24k|    {
   32|  2.24k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  2.24k|    }
_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|    791|    {
   38|    791|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    791|    }
_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|  10.7k|    {
   32|  10.7k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  10.7k|    }
_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.17k|    {
   38|  1.17k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.17k|    }
_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.54k|    {
   38|  1.54k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  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_15regular_sub_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|  4.44k|    {
   38|  4.44k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.44k|    }
_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|  1.87k|    {
   38|  1.87k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.87k|    }
_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.71k|    {
   38|  1.71k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.71k|    }
_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|  10.9k|    {
   38|  10.9k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  10.9k|    }
_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|   162k|    {
   32|   162k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   162k|    }
_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|    274|    {
   38|    274|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    274|    }
_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.57k|    {
   32|  1.57k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.57k|    }
_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.99k|    {
   38|  1.99k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.99k|    }
_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|    484|    {
   32|    484|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    484|    }
_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|    535|    {
   32|    535|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    535|    }
_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|   159k|    {
   32|   159k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   159k|    }
_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.57k|    {
   38|  2.57k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.57k|    }
_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.57k|    {
   44|  2.57k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  2.57k|    }
_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|  5.54k|    {
   38|  5.54k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  5.54k|    }
_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|  5.54k|    {
   44|  5.54k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  5.54k|    }
_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|    978|    {
   32|    978|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    978|    }
_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|    978|    {
   44|    978|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|    978|    }
_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|  4.56k|    {
   38|  4.56k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.56k|    }
_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|  4.56k|    {
   44|  4.56k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  4.56k|    }
_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.05k|    {
   38|  7.05k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  7.05k|    }
_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.05k|    {
   44|  7.05k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  7.05k|    }
_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|  3.94k|    {
   32|  3.94k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  3.94k|    }
_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|  3.94k|    {
   44|  3.94k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.94k|    }
_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.94M|    {
   32|  2.94M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  2.94M|    }
_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|  13.7k|    {
   32|  13.7k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  13.7k|    }
_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|    266|    {
   38|    266|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    266|    }
_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.68k|    {
   38|  1.68k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.68k|    }
_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|   167k|    {
   38|   167k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   167k|    }
_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|   128k|    {
   38|   128k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   128k|    }
_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.11k|    {
   38|  3.11k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.11k|    }
_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.11k|    {
   44|  3.11k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.11k|    }
_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|   111k|    {
   32|   111k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   111k|    }
_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|   111k|    {
   44|   111k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   111k|    }
_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.0k|    {
   32|  70.0k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  70.0k|    }
_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.0k|    {
   44|  70.0k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  70.0k|    }
_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|   203k|    {
   32|   203k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   203k|    }
_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|  3.44k|    {
   38|  3.44k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.44k|    }
_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|   138k|    {
   32|   138k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   138k|    }
_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|  2.55k|    {
   38|  2.55k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.55k|    }
_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|  3.03k|    {
   38|  3.03k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.03k|    }
_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|  10.3k|    {
   38|  10.3k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  10.3k|    }
_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|  4.82k|    {
   38|  4.82k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.82k|    }
_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|  4.62k|    {
   38|  4.62k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.62k|    }
_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|   132k|    {
   38|   132k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   132k|    }
_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|   234k|    {
   32|   234k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   234k|    }
_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.41k|    {
   38|  1.41k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.41k|    }
_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|   243k|    {
   32|   243k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   243k|    }
_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.57k|    {
   38|  2.57k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.57k|    }
_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|    481|    {
   32|    481|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    481|    }
_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|    974|    {
   32|    974|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    974|    }
_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|   193k|    {
   32|   193k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   193k|    }
_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|  41.5k|    {
   38|  41.5k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  41.5k|    }
_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|  41.5k|    {
   44|  41.5k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  41.5k|    }
_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.36k|    {
   38|  6.36k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  6.36k|    }
_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.36k|    {
   44|  6.36k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  6.36k|    }
_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.51k|    {
   32|  3.51k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  3.51k|    }
_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.51k|    {
   44|  3.51k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.51k|    }
_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.85k|    {
   38|  2.85k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.85k|    }
_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.85k|    {
   44|  2.85k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  2.85k|    }

_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE18get_storage_offsetEv:
  127|   866k|    {
  128|   866k|        check_base();
  129|   866k|        return sizeof(Derived);
  130|   866k|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv:
  134|  37.1M|    {
  135|  37.1M|        static_assert(std::is_standard_layout<Derived>::value &&
  136|  37.1M|                          !std::is_empty<Derived>::value,
  137|  37.1M|                      "Please add 'true' if the derived class is emtpy");
  138|  37.1M|    }
_ZN5immer6detail15auto_const_castINS_18no_refcount_policyEEERT_RKS3_:
  143|  21.7M|{
  144|  21.7M|    return const_cast<T&>(x);
  145|  21.7M|}
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE18get_storage_offsetEv:
   87|   336k|    {
   88|   336k|        check_base();
   89|   336k|        return 0;
   90|   336k|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv:
   94|  8.69M|    {
   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|  8.69M|        static_assert(std::is_standard_layout<Derived>::value,
  100|  8.69M|                      "Please remove 'true' if the derived class is non emtpy");
  101|  8.69M|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv:
  113|  36.2M|    {
  114|  36.2M|        check_base();
  115|  36.2M|        auto* base = static_cast<Derived*>(this);
  116|  36.2M|        return reinterpret_cast<T*>(base + 1);
  117|  36.2M|    }
_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.35M|    {
   76|  8.35M|        check_base();
   77|  8.35M|        return reinterpret_cast<T*>(this);
   78|  8.35M|    }
_ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_:
  236|  2.77M|{
  237|  2.77M|    return std::copy(first, last, out);
  238|  2.77M|}
_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|  26.7k|{
  345|  26.7k|    return std::forward<F2>(f2)(empty_t{});
  346|  26.7k|}
_ZN5immer6detail4ipowImEET_S2_j:
  323|  62.9M|{
  324|  62.9M|    return pow == 0 ? 1 : num * ipow(num, pow - 1);
  ------------------
  |  Branch (324:12): [True: 1.96M, False: 60.9M]
  ------------------
  325|  62.9M|}
_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|   732k|{
  345|   732k|    return std::forward<F2>(f2)(empty_t{});
  346|   732k|}
_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|   877k|{
  330|   877k|    std::forward<F>(f)(empty_t{});
  331|   877k|}
_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.1k|{
  345|  18.1k|    return std::forward<F2>(f2)(empty_t{});
  346|  18.1k|}
_ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_:
  188|    565|{
  189|    565|    return first + n;
  190|    565|}
_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|   613k|{
  345|   613k|    return std::forward<F2>(f2)(empty_t{});
  346|   613k|}
_ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_:
  210|  2.10k|{
  211|  2.10k|    return std::copy(first, last, out);
  212|  2.10k|}

_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
   96|  30.7k|    flex_vector() = default;
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9transientEv:
  507|   111k|    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|   171k|        : impl_(std::move(impl))
  537|   171k|    {
  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|   171k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  246|  60.6k|    {
  247|  60.6k|        return impl_.push_back(std::move(value));
  248|  60.6k|    }
_ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4sizeEv:
  181|   166k|    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.55k|    {
  324|  5.55k|        return impl_.update(index, std::forward<FnT>(fn));
  325|  5.55k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  350|  11.9k|    {
  351|  11.9k|        return impl_.take(elems);
  352|  11.9k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4dropEm:
  376|  17.7k|    {
  377|  17.7k|        return impl_.drop(elems);
  378|  17.7k|    }
_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8max_sizeEv:
   90|  1.91M|    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|  55.1k|    {
  404|  55.1k|        return l.impl_.concat(r.impl_);
  405|  55.1k|    }

_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
   71|  40.1k|    flex_vector_transient() = default;
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE:
  243|   111k|        : impl_(std::move(impl))
  244|   111k|    {
  245|   111k|    }
_ZNR5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10persistentEv:
  233|  20.9k|    {
  234|  20.9k|        this->owner_t::operator=(owner_t{});
  235|  20.9k|        return impl_;
  236|  20.9k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  156|  51.4k|    {
  157|  51.4k|        impl_.push_back_mut(*this, std::move(value));
  158|  51.4k|    }
_ZNK5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4sizeEv:
  127|  3.76M|    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.1k|    {
  181|  11.1k|        impl_.update_mut(*this, index, std::forward<FnT>(fn));
  182|  11.1k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  189|  39.3k|    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|  31.9k|    {
  220|  31.9k|        l.owner_t::operator=(owner_t{});
  221|  31.9k|        concat_mut_r(l.impl_, impl_, *this);
  222|  31.9k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7prependEOS9_:
  224|  3.71k|    {
  225|  3.71k|        concat_mut_lr_r(l.impl_, l, impl_, *this);
  226|  3.71k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6appendERS9_:
  204|  1.78M|    {
  205|  1.78M|        r.owner_t::operator=(owner_t{});
  206|  1.78M|        concat_mut_l(impl_, *this, r.impl_);
  207|  1.78M|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6appendEOS9_:
  209|  5.73k|    {
  210|  5.73k|        concat_mut_lr_l(impl_, *this, r.impl_, r);
  211|  5.73k|    }

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

_ZN5immer18no_refcount_policyC2Ev:
   22|  5.26M|    no_refcount_policy(){};
_ZN5immer18no_refcount_policy3incEv:
   25|  4.02M|    void inc() {}
_ZN5immer18no_refcount_policy3decEv:
   26|  2.03M|    bool dec() { return false; }
_ZN5immer18no_refcount_policy6uniqueEv:
   27|  15.6M|    bool unique() { return false; }

_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5ownerC2Ev:
   60|  1.98M|                    : token_{make_token_()}
   61|  1.98M|                {
   62|  1.98M|                }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owner11make_token_Ev:
   51|  1.98M|                {
   52|  1.98M|                    return heap_::allocate(1, norefs_tag{});
   53|  1.98M|                };
_ZNK5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type4editneES7_:
   45|  4.43M|                bool operator!=(edit x) const { return v != x.v; }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneraSEOS7_:
   79|  1.95M|                {
   80|  1.95M|                    token_ = o.token_.load();
   81|  1.95M|                    return *this;
   82|  1.95M|                }
_ZNK5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5ownee10can_mutateENS6_4editE:
   99|  15.6M|                bool can_mutate(edit t) const { return token_ == t; }
_ZNK5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type4editeqES7_:
   44|  15.6M|                bool operator==(edit x) const { return v == x.v; }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5owneeaSENS6_4editE:
   90|  4.43M|                {
   91|  4.43M|                    assert(e != noone);
  ------------------
  |  Branch (91:21): [True: 4.43M, 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.43M|                    token_ = e;
   96|  4.43M|                    return *this;
   97|  4.43M|                }
_ZN5immer20gc_transience_policy5applyINS_11heap_policyINS_7gc_heapEEEE4type5ownercvNS6_4editEEv:
   57|  7.47M|                operator edit() { return {token_}; }

