LLVMFuzzerTestOneInput:
   26|  8.05k|{
   27|  8.05k|    auto guard = immer::gc_disable_guard{};
   28|       |
   29|  8.05k|    constexpr auto var_count = 4;
   30|  8.05k|    constexpr auto bits      = 2;
   31|       |
   32|  8.05k|    using vector_t    = immer::flex_vector<int, gc_memory, bits, bits>;
   33|  8.05k|    using transient_t = typename vector_t::transient_type;
   34|  8.05k|    using size_t      = std::uint8_t;
   35|       |
   36|  8.05k|    auto vs = std::array<vector_t, var_count>{};
   37|  8.05k|    auto ts = std::array<transient_t, var_count>{};
   38|       |
   39|  8.05k|    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
   40|  8.05k|    auto is_valid_var_neq = [](auto other) {
   41|  8.05k|        return [=](auto idx) {
   42|  8.05k|            return idx >= 0 && idx < var_count && idx != other;
   43|  8.05k|        };
   44|  8.05k|    };
   45|  8.05k|    auto is_valid_index = [](auto& v) {
   46|  8.05k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  8.05k|    };
   48|  8.05k|    auto is_valid_size = [](auto& v) {
   49|  8.05k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  8.05k|    };
   51|  8.05k|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  8.05k|        return v1.size() + v2.size() < vector_t::max_size();
   53|  8.05k|    };
   54|       |
   55|  8.05k|    return fuzzer_input{data, size}.run([&](auto& in) {
   56|  8.05k|        enum ops
   57|  8.05k|        {
   58|  8.05k|            op_transient,
   59|  8.05k|            op_persistent,
   60|  8.05k|            op_push_back,
   61|  8.05k|            op_update,
   62|  8.05k|            op_take,
   63|  8.05k|            op_drop,
   64|  8.05k|            op_concat,
   65|  8.05k|            op_push_back_mut,
   66|  8.05k|            op_update_mut,
   67|  8.05k|            op_take_mut,
   68|  8.05k|            op_drop_mut,
   69|  8.05k|            op_prepend_mut,
   70|  8.05k|            op_prepend_mut_move,
   71|  8.05k|            op_append_mut,
   72|  8.05k|            op_append_mut_move,
   73|  8.05k|        };
   74|  8.05k|        auto dst = read<char>(in, is_valid_var);
   75|  8.05k|        switch (read<char>(in)) {
   76|  8.05k|        case op_transient: {
   77|  8.05k|            auto src = read<char>(in, is_valid_var);
   78|  8.05k|            ts[dst]  = vs[src].transient();
   79|  8.05k|            break;
   80|  8.05k|        }
   81|  8.05k|        case op_persistent: {
   82|  8.05k|            auto src = read<char>(in, is_valid_var);
   83|  8.05k|            vs[dst]  = ts[src].persistent();
   84|  8.05k|            break;
   85|  8.05k|        }
   86|  8.05k|        case op_push_back: {
   87|  8.05k|            auto src = read<char>(in, is_valid_var);
   88|  8.05k|            vs[dst]  = vs[src].push_back(42);
   89|  8.05k|            break;
   90|  8.05k|        }
   91|  8.05k|        case op_update: {
   92|  8.05k|            auto src = read<char>(in, is_valid_var);
   93|  8.05k|            auto idx = read<size_t>(in, is_valid_index(vs[src]));
   94|  8.05k|            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
   95|  8.05k|            break;
   96|  8.05k|        }
   97|  8.05k|        case op_take: {
   98|  8.05k|            auto src = read<char>(in, is_valid_var);
   99|  8.05k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  100|  8.05k|            vs[dst]  = vs[src].take(idx);
  101|  8.05k|            break;
  102|  8.05k|        }
  103|  8.05k|        case op_drop: {
  104|  8.05k|            auto src = read<char>(in, is_valid_var);
  105|  8.05k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  106|  8.05k|            vs[dst]  = vs[src].drop(idx);
  107|  8.05k|            break;
  108|  8.05k|        }
  109|  8.05k|        case op_concat: {
  110|  8.05k|            auto src  = read<char>(in, is_valid_var);
  111|  8.05k|            auto src2 = read<char>(in, is_valid_var);
  112|  8.05k|            if (can_concat(vs[src], vs[src2]))
  113|  8.05k|                vs[dst] = vs[src] + vs[src2];
  114|  8.05k|            break;
  115|  8.05k|        }
  116|  8.05k|        case op_push_back_mut: {
  117|  8.05k|            ts[dst].push_back(13);
  118|  8.05k|            break;
  119|  8.05k|        }
  120|  8.05k|        case op_update_mut: {
  121|  8.05k|            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
  122|  8.05k|            ts[dst].update(idx, [](auto x) { return x + 1; });
  123|  8.05k|            break;
  124|  8.05k|        }
  125|  8.05k|        case op_take_mut: {
  126|  8.05k|            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
  127|  8.05k|            ts[dst].take(idx);
  128|  8.05k|            break;
  129|  8.05k|        }
  130|  8.05k|        case op_prepend_mut: {
  131|  8.05k|            auto src = read<char>(in, is_valid_var_neq(dst));
  132|  8.05k|            if (can_concat(ts[dst], ts[src]))
  133|  8.05k|                ts[dst].prepend(ts[src]);
  134|  8.05k|            break;
  135|  8.05k|        }
  136|  8.05k|        case op_prepend_mut_move: {
  137|  8.05k|            auto src = read<char>(in, is_valid_var_neq(dst));
  138|  8.05k|            if (can_concat(ts[dst], ts[src])) {
  139|  8.05k|                ts[dst].prepend(std::move(ts[src]));
  140|  8.05k|                ts[src] = {};
  141|  8.05k|            }
  142|  8.05k|            break;
  143|  8.05k|        }
  144|  8.05k|        case op_append_mut: {
  145|  8.05k|            auto src = read<char>(in, is_valid_var_neq(dst));
  146|  8.05k|            if (can_concat(ts[dst], ts[src]))
  147|  8.05k|                ts[dst].append(ts[src]);
  148|  8.05k|            break;
  149|  8.05k|        }
  150|  8.05k|        case op_append_mut_move: {
  151|  8.05k|            auto src = read<char>(in, is_valid_var_neq(dst));
  152|  8.05k|            if (can_concat(ts[dst], ts[src])) {
  153|  8.05k|                ts[dst].append(std::move(ts[src]));
  154|  8.05k|                ts[src] = {};
  155|  8.05k|            }
  156|  8.05k|            break;
  157|  8.05k|        }
  158|  8.05k|        default:
  159|  8.05k|            break;
  160|  8.05k|        };
  161|  8.05k|        return true;
  162|  8.05k|    });
  163|  8.05k|}
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_:
   55|  2.35M|    return fuzzer_input{data, size}.run([&](auto& in) {
   56|  2.35M|        enum ops
   57|  2.35M|        {
   58|  2.35M|            op_transient,
   59|  2.35M|            op_persistent,
   60|  2.35M|            op_push_back,
   61|  2.35M|            op_update,
   62|  2.35M|            op_take,
   63|  2.35M|            op_drop,
   64|  2.35M|            op_concat,
   65|  2.35M|            op_push_back_mut,
   66|  2.35M|            op_update_mut,
   67|  2.35M|            op_take_mut,
   68|  2.35M|            op_drop_mut,
   69|  2.35M|            op_prepend_mut,
   70|  2.35M|            op_prepend_mut_move,
   71|  2.35M|            op_append_mut,
   72|  2.35M|            op_append_mut_move,
   73|  2.35M|        };
   74|  2.35M|        auto dst = read<char>(in, is_valid_var);
   75|  2.35M|        switch (read<char>(in)) {
   76|   104k|        case op_transient: {
  ------------------
  |  Branch (76:9): [True: 104k, False: 2.25M]
  ------------------
   77|   104k|            auto src = read<char>(in, is_valid_var);
   78|   104k|            ts[dst]  = vs[src].transient();
   79|   104k|            break;
   80|      0|        }
   81|  20.6k|        case op_persistent: {
  ------------------
  |  Branch (81:9): [True: 20.6k, False: 2.33M]
  ------------------
   82|  20.6k|            auto src = read<char>(in, is_valid_var);
   83|  20.6k|            vs[dst]  = ts[src].persistent();
   84|  20.6k|            break;
   85|      0|        }
   86|  57.5k|        case op_push_back: {
  ------------------
  |  Branch (86:9): [True: 57.5k, False: 2.30M]
  ------------------
   87|  57.5k|            auto src = read<char>(in, is_valid_var);
   88|  57.5k|            vs[dst]  = vs[src].push_back(42);
   89|  57.5k|            break;
   90|      0|        }
   91|  5.79k|        case op_update: {
  ------------------
  |  Branch (91:9): [True: 5.79k, False: 2.35M]
  ------------------
   92|  5.79k|            auto src = read<char>(in, is_valid_var);
   93|  5.79k|            auto idx = read<size_t>(in, is_valid_index(vs[src]));
   94|  5.79k|            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
   95|  5.79k|            break;
   96|      0|        }
   97|  11.1k|        case op_take: {
  ------------------
  |  Branch (97:9): [True: 11.1k, False: 2.34M]
  ------------------
   98|  11.1k|            auto src = read<char>(in, is_valid_var);
   99|  11.1k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  100|  11.1k|            vs[dst]  = vs[src].take(idx);
  101|  11.1k|            break;
  102|      0|        }
  103|  17.7k|        case op_drop: {
  ------------------
  |  Branch (103:9): [True: 17.7k, False: 2.34M]
  ------------------
  104|  17.7k|            auto src = read<char>(in, is_valid_var);
  105|  17.7k|            auto idx = read<size_t>(in, is_valid_size(vs[src]));
  106|  17.7k|            vs[dst]  = vs[src].drop(idx);
  107|  17.7k|            break;
  108|      0|        }
  109|  62.3k|        case op_concat: {
  ------------------
  |  Branch (109:9): [True: 62.3k, False: 2.29M]
  ------------------
  110|  62.3k|            auto src  = read<char>(in, is_valid_var);
  111|  62.3k|            auto src2 = read<char>(in, is_valid_var);
  112|  62.3k|            if (can_concat(vs[src], vs[src2]))
  ------------------
  |  Branch (112:17): [True: 59.8k, False: 2.50k]
  ------------------
  113|  59.8k|                vs[dst] = vs[src] + vs[src2];
  114|  62.3k|            break;
  115|      0|        }
  116|  49.1k|        case op_push_back_mut: {
  ------------------
  |  Branch (116:9): [True: 49.1k, False: 2.30M]
  ------------------
  117|  49.1k|            ts[dst].push_back(13);
  118|  49.1k|            break;
  119|      0|        }
  120|  10.3k|        case op_update_mut: {
  ------------------
  |  Branch (120:9): [True: 10.3k, False: 2.34M]
  ------------------
  121|  10.3k|            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
  122|  10.3k|            ts[dst].update(idx, [](auto x) { return x + 1; });
  123|  10.3k|            break;
  124|      0|        }
  125|  38.2k|        case op_take_mut: {
  ------------------
  |  Branch (125:9): [True: 38.2k, False: 2.31M]
  ------------------
  126|  38.2k|            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
  127|  38.2k|            ts[dst].take(idx);
  128|  38.2k|            break;
  129|      0|        }
  130|  35.6k|        case op_prepend_mut: {
  ------------------
  |  Branch (130:9): [True: 35.6k, False: 2.32M]
  ------------------
  131|  35.6k|            auto src = read<char>(in, is_valid_var_neq(dst));
  132|  35.6k|            if (can_concat(ts[dst], ts[src]))
  ------------------
  |  Branch (132:17): [True: 32.6k, False: 2.94k]
  ------------------
  133|  32.6k|                ts[dst].prepend(ts[src]);
  134|  35.6k|            break;
  135|      0|        }
  136|  4.41k|        case op_prepend_mut_move: {
  ------------------
  |  Branch (136:9): [True: 4.41k, False: 2.35M]
  ------------------
  137|  4.41k|            auto src = read<char>(in, is_valid_var_neq(dst));
  138|  4.41k|            if (can_concat(ts[dst], ts[src])) {
  ------------------
  |  Branch (138:17): [True: 3.68k, False: 735]
  ------------------
  139|  3.68k|                ts[dst].prepend(std::move(ts[src]));
  140|  3.68k|                ts[src] = {};
  141|  3.68k|            }
  142|  4.41k|            break;
  143|      0|        }
  144|  1.90M|        case op_append_mut: {
  ------------------
  |  Branch (144:9): [True: 1.90M, False: 456k]
  ------------------
  145|  1.90M|            auto src = read<char>(in, is_valid_var_neq(dst));
  146|  1.90M|            if (can_concat(ts[dst], ts[src]))
  ------------------
  |  Branch (146:17): [True: 1.87M, False: 27.1k]
  ------------------
  147|  1.87M|                ts[dst].append(ts[src]);
  148|  1.90M|            break;
  149|      0|        }
  150|  6.30k|        case op_append_mut_move: {
  ------------------
  |  Branch (150:9): [True: 6.30k, False: 2.35M]
  ------------------
  151|  6.30k|            auto src = read<char>(in, is_valid_var_neq(dst));
  152|  6.30k|            if (can_concat(ts[dst], ts[src])) {
  ------------------
  |  Branch (152:17): [True: 5.87k, False: 437]
  ------------------
  153|  5.87k|                ts[dst].append(std::move(ts[src]));
  154|  5.87k|                ts[src] = {};
  155|  5.87k|            }
  156|  6.30k|            break;
  157|      0|        }
  158|  24.9k|        default:
  ------------------
  |  Branch (158:9): [True: 24.9k, False: 2.33M]
  ------------------
  159|  24.9k|            break;
  160|  2.35M|        };
  161|  2.35M|        return true;
  162|  2.35M|    });
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_:
   39|  2.91M|    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
  ------------------
  |  Branch (39:48): [True: 2.83M, False: 83.4k]
  |  Branch (39:60): [True: 2.69M, False: 142k]
  ------------------
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|  8.60k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (46:39): [True: 8.60k, False: 0]
  |  Branch (46:51): [True: 5.72k, False: 2.87k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   45|  5.76k|    auto is_valid_index = [](auto& v) {
   46|  5.76k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  5.76k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_:
   94|  5.72k|            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|  39.9k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (49:39): [True: 39.9k, False: 0]
  |  Branch (49:51): [True: 28.7k, False: 11.2k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer11flex_vectorIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   48|  28.7k|    auto is_valid_size = [](auto& v) {
   49|  28.7k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  28.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|  62.2k|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  62.2k|        return v1.size() + v2.size() < vector_t::max_size();
   53|  62.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|  11.4k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (46:39): [True: 11.4k, False: 0]
  |  Branch (46:51): [True: 10.2k, False: 1.21k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   45|  10.3k|    auto is_valid_index = [](auto& v) {
   46|  10.3k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   47|  10.3k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_5clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_:
  122|  10.2k|            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|  40.6k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (49:39): [True: 40.6k, False: 0]
  |  Branch (49:51): [True: 38.2k, False: 2.35k]
  ------------------
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIN5immer21flex_vector_transientIiNS1_13memory_policyINS1_11heap_policyINS1_7gc_heapEEENS1_18no_refcount_policyENS1_15spinlock_policyENS1_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaRT_:
   48|  38.2k|    auto is_valid_size = [](auto& v) {
   49|  38.2k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   50|  38.2k|    };
flex-vector-gc.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_ENKUlS1_E_clIcEEDaS1_:
   41|  1.99M|        return [=](auto idx) {
   42|  1.99M|            return idx >= 0 && idx < var_count && idx != other;
  ------------------
  |  Branch (42:20): [True: 1.98M, False: 11.1k]
  |  Branch (42:32): [True: 1.96M, False: 23.4k]
  |  Branch (42:51): [True: 1.94M, False: 12.3k]
  ------------------
   43|  1.99M|        };
flex-vector-gc.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_:
   40|  1.94M|    auto is_valid_var_neq = [](auto other) {
   41|  1.94M|        return [=](auto idx) {
   42|  1.94M|            return idx >= 0 && idx < var_count && idx != other;
   43|  1.94M|        };
   44|  1.94M|    };
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.94M|    auto can_concat = [](auto&& v1, auto&& v2) {
   52|  1.94M|        return v1.size() + v2.size() < vector_t::max_size();
   53|  1.94M|    };

flex-vector-gc.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_5EEiT_:
   50|  8.05k|    {
   51|  8.05k|        if (size_ > fuzzer_input_max_size)
  ------------------
  |  Branch (51:13): [True: 12, False: 8.04k]
  ------------------
   52|     12|            return 0;
   53|  8.04k|        try {
   54|  2.35M|            while (step(*this))
  ------------------
  |  Branch (54:20): [True: 2.35M, False: 8.04k]
  ------------------
   55|  2.35M|                continue;
   56|  8.04k|        } catch (const no_more_input&) {
   57|  8.04k|        };
   58|  8.04k|        return 0;
   59|  8.04k|    }
flex-vector-gc.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_:
   70|  2.70M|{
   71|  2.70M|    auto x = read<T>(fz);
   72|  2.92M|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 226k, False: 2.70M]
  ------------------
   73|   226k|        x = read<T>(fz);
   74|  2.70M|    return x;
   75|  2.70M|}
_Z4readIcERKT_R12fuzzer_input:
   64|  7.27M|{
   65|  7.27M|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|  7.27M|}
_ZN12fuzzer_input4nextEmm:
   40|  7.37M|    {
   41|  7.37M|        auto& p = const_cast<void*&>(reinterpret_cast<const void*&>(data_));
   42|  7.37M|        auto r  = std::align(align, size, p, size_);
   43|  7.37M|        if (r == nullptr)
  ------------------
  |  Branch (43:13): [True: 8.04k, False: 7.36M]
  ------------------
   44|  8.04k|            throw no_more_input{};
   45|  7.36M|        return next(size);
   46|  7.37M|    }
_ZN12fuzzer_input4nextEm:
   30|  7.36M|    {
   31|  7.36M|        if (size_ < size)
  ------------------
  |  Branch (31:13): [True: 0, False: 7.36M]
  ------------------
   32|      0|            throw no_more_input{};
   33|  7.36M|        auto r = data_;
   34|  7.36M|        data_ += size;
   35|  7.36M|        size_ -= size;
   36|  7.36M|        return r;
   37|  7.36M|    }
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.76k|{
   71|  5.76k|    auto x = read<T>(fz);
   72|  8.63k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 2.87k, False: 5.76k]
  ------------------
   73|  2.87k|        x = read<T>(fz);
   74|  5.76k|    return x;
   75|  5.76k|}
_Z4readIhERKT_R12fuzzer_input:
   64|   100k|{
   65|   100k|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|   100k|}
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|  28.7k|{
   71|  28.7k|    auto x = read<T>(fz);
   72|  40.0k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 11.2k, False: 28.7k]
  ------------------
   73|  11.2k|        x = read<T>(fz);
   74|  28.7k|    return x;
   75|  28.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|  10.3k|{
   71|  10.3k|    auto x = read<T>(fz);
   72|  11.5k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 1.21k, False: 10.3k]
  ------------------
   73|  1.21k|        x = read<T>(fz);
   74|  10.3k|    return x;
   75|  10.3k|}
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|  38.2k|{
   71|  38.2k|    auto x = read<T>(fz);
   72|  40.6k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 2.35k, False: 38.2k]
  ------------------
   73|  2.35k|        x = read<T>(fz);
   74|  38.2k|    return x;
   75|  38.2k|}
flex-vector-gc.cpp:_Z4readIcZZ22LLVMFuzzerTestOneInputENK3$_1clIcEEDaT_EUlS2_E_ES2_R12fuzzer_inputT0_:
   70|  1.94M|{
   71|  1.94M|    auto x = read<T>(fz);
   72|  1.99M|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 47.0k, False: 1.94M]
  ------------------
   73|  47.0k|        x = read<T>(fz);
   74|  1.94M|    return x;
   75|  1.94M|}

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

_ZN5immer6detail4rbts11dec_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  523|   648k|    {
  524|   648k|        using node_t = node_type<Pos>;
  525|   648k|        auto node    = p.node();
  526|   648k|        if (node->dec()) {
  ------------------
  |  Branch (526:13): [True: 0, False: 648k]
  ------------------
  527|      0|            p.each(this_t{});
  528|      0|            node_t::delete_inner_r(node, p.count());
  529|      0|        }
  530|   648k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  54.7k|    {
  535|  54.7k|        using node_t = node_type<Pos>;
  536|  54.7k|        auto node    = p.node();
  537|  54.7k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 54.7k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  54.7k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|  5.71k|    {
  546|  5.71k|        using node_t = node_type<Pos>;
  547|  5.71k|        auto node    = p.node();
  548|  5.71k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 5.71k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|  5.71k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|  2.47k|    {
  546|  2.47k|        using node_t = node_type<Pos>;
  547|  2.47k|        auto node    = p.node();
  548|  2.47k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 2.47k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|  2.47k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  8.45k|    {
  535|  8.45k|        using node_t = node_type<Pos>;
  536|  8.45k|        auto node    = p.node();
  537|  8.45k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 8.45k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  8.45k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|  3.58k|    {
  535|  3.58k|        using node_t = node_type<Pos>;
  536|  3.58k|        auto node    = p.node();
  537|  3.58k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 3.58k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|  3.58k|    }
_ZN5immer6detail4rbts11dec_visitor13visit_regularIRNS1_17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  534|   418k|    {
  535|   418k|        using node_t = node_type<Pos>;
  536|   418k|        auto node    = p.node();
  537|   418k|        if (node->dec()) {
  ------------------
  |  Branch (537:13): [True: 0, False: 418k]
  ------------------
  538|      0|            p.each(this_t{});
  539|      0|            node_t::delete_inner(node, p.count());
  540|      0|        }
  541|   418k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|   494k|    {
  546|   494k|        using node_t = node_type<Pos>;
  547|   494k|        auto node    = p.node();
  548|   494k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 494k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|   494k|    }
_ZN5immer6detail4rbts11dec_visitor10visit_leafIRNS1_14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_:
  545|   365k|    {
  546|   365k|        using node_t = node_type<Pos>;
  547|   365k|        auto node    = p.node();
  548|   365k|        if (node->dec()) {
  ------------------
  |  Branch (548:13): [True: 0, False: 365k]
  ------------------
  549|      0|            node_t::delete_leaf(node, p.count());
  550|      0|        }
  551|   365k|    }
_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|  44.3k|    {
  792|  44.3k|        auto level    = pos.shift();
  793|  44.3k|        auto idx      = pos.count() - 1;
  794|  44.3k|        auto children = pos.size(idx);
  795|  44.3k|        auto new_idx =
  796|  44.3k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (796:13): [True: 3.61k, False: 40.6k]
  |  Branch (796:47): [True: 363, False: 40.3k]
  ------------------
  797|  44.3k|        auto new_child = static_cast<node_t*>(nullptr);
  798|  44.3k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (798:13): [True: 1.20k, False: 43.1k]
  ------------------
  799|  1.20k|            return nullptr;
  800|  43.1k|        else if (idx == new_idx) {
  ------------------
  |  Branch (800:18): [True: 40.3k, False: 2.77k]
  ------------------
  801|  40.3k|            new_child = pos.last_oh_csh(this_t{}, idx, children, tail, ts);
  802|  40.3k|            if (!new_child) {
  ------------------
  |  Branch (802:17): [True: 1.30k, False: 39.0k]
  ------------------
  803|  1.30k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (803:21): [True: 608, False: 697]
  ------------------
  804|    608|                    new_child = node_t::make_path(level - B, tail);
  805|    697|                else
  806|    697|                    return nullptr;
  807|  1.30k|            }
  808|  40.3k|        } else
  809|  2.77k|            new_child = node_t::make_path(level - B, tail);
  810|  42.4k|        IMMER_TRY {
  ------------------
  |  |   49|  42.4k|#define IMMER_TRY try
  ------------------
  811|  42.4k|            auto count = new_idx + 1;
  812|  42.4k|            auto new_parent =
  813|  42.4k|                node_t::copy_inner_r_n(count, pos.node(), new_idx);
  814|  42.4k|            auto new_relaxed              = new_parent->relaxed();
  815|  42.4k|            new_parent->inner()[new_idx]  = new_child;
  816|  42.4k|            new_relaxed->d.sizes[new_idx] = pos.size() + ts;
  817|  42.4k|            new_relaxed->d.count          = count;
  818|  42.4k|            assert(new_relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (818:13): [True: 42.4k, False: 0]
  ------------------
  819|  42.4k|            return new_parent;
  820|  42.4k|        }
  821|  42.4k|        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|  42.4k|    }
_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.12k|    {
  835|  7.12k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 7.12k, False: 0]
  ------------------
  836|  7.12k|        auto idx        = pos.index(pos.size() - 1);
  837|  7.12k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  7.12k|        auto count      = new_idx + 1;
  839|  7.12k|        auto new_parent = node_t::make_inner_n(count);
  840|  7.12k|        IMMER_TRY {
  ------------------
  |  |   49|  7.12k|#define IMMER_TRY try
  ------------------
  841|  7.12k|            new_parent->inner()[new_idx] =
  842|  7.12k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 5.74k, False: 1.37k]
  ------------------
  843|       |                               /* otherwise */
  844|  7.12k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  7.12k|        }
  846|  7.12k|        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.12k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  7.12k|    }
_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|  28.6k|    {
  835|  28.6k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 28.6k, False: 0]
  ------------------
  836|  28.6k|        auto idx        = pos.index(pos.size() - 1);
  837|  28.6k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  28.6k|        auto count      = new_idx + 1;
  839|  28.6k|        auto new_parent = node_t::make_inner_n(count);
  840|  28.6k|        IMMER_TRY {
  ------------------
  |  |   49|  28.6k|#define IMMER_TRY try
  ------------------
  841|  28.6k|            new_parent->inner()[new_idx] =
  842|  28.6k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 20.9k, False: 7.69k]
  ------------------
  843|       |                               /* otherwise */
  844|  28.6k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  28.6k|        }
  846|  28.6k|        IMMER_CATCH (...) {
  847|      0|            node_t::delete_inner(new_parent, count);
  848|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  849|      0|        }
  850|  28.6k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  28.6k|    }
_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.04k|    {
  835|  4.04k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (835:9): [True: 4.04k, False: 0]
  ------------------
  836|  4.04k|        auto idx        = pos.index(pos.size() - 1);
  837|  4.04k|        auto new_idx    = pos.index(pos.size() + branches<BL> - 1);
  838|  4.04k|        auto count      = new_idx + 1;
  839|  4.04k|        auto new_parent = node_t::make_inner_n(count);
  840|  4.04k|        IMMER_TRY {
  ------------------
  |  |   49|  4.04k|#define IMMER_TRY try
  ------------------
  841|  4.04k|            new_parent->inner()[new_idx] =
  842|  4.04k|                idx == new_idx ? pos.last_oh(this_t{}, idx, tail)
  ------------------
  |  Branch (842:17): [True: 1.95k, False: 2.09k]
  ------------------
  843|       |                               /* otherwise */
  844|  4.04k|                               : node_t::make_path(pos.shift() - B, tail);
  845|  4.04k|        }
  846|  4.04k|        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.04k|        return node_t::do_copy_inner(new_parent, pos.node(), new_idx);
  851|  4.04k|    }
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.84k|    {
  503|  3.84k|        auto offset = pos.index(idx);
  504|  3.84k|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|  3.84k|        IMMER_TRY {
  ------------------
  |  |   49|  3.84k|#define IMMER_TRY try
  ------------------
  506|  3.84k|            node->leaf()[offset] =
  507|  3.84k|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|  3.84k|            return node;
  509|  3.84k|        }
  510|  3.84k|        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.84k|    }
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|  28.9k|    {
  467|  28.9k|        auto offset = pos.index(idx);
  468|  28.9k|        auto count  = pos.count();
  469|  28.9k|        auto node   = node_t::make_inner_sr_n(count, pos.relaxed());
  470|  28.9k|        IMMER_TRY {
  ------------------
  |  |   49|  28.9k|#define IMMER_TRY try
  ------------------
  471|  28.9k|            auto child = pos.towards_oh(this_t{}, idx, offset, fn);
  472|  28.9k|            node_t::do_copy_inner_replace_sr(
  473|  28.9k|                node, pos.node(), count, offset, child);
  474|  28.9k|            return node;
  475|  28.9k|        }
  476|  28.9k|        IMMER_CATCH (...) {
  477|      0|            node_t::delete_inner_r(node, count);
  478|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  479|      0|        }
  480|  28.9k|    }
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.88k|    {
  485|  1.88k|        auto offset = pos.index(idx);
  486|  1.88k|        auto count  = pos.count();
  487|  1.88k|        auto node   = node_t::make_inner_n(count);
  488|  1.88k|        IMMER_TRY {
  ------------------
  |  |   49|  1.88k|#define IMMER_TRY try
  ------------------
  489|  1.88k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.88k|            node_t::do_copy_inner_replace(
  491|  1.88k|                node, pos.node(), count, offset, child);
  492|  1.88k|            return node;
  493|  1.88k|        }
  494|  1.88k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.88k|    }
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.31k|    {
  503|  1.31k|        auto offset = pos.index(idx);
  504|  1.31k|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|  1.31k|        IMMER_TRY {
  ------------------
  |  |   49|  1.31k|#define IMMER_TRY try
  ------------------
  506|  1.31k|            node->leaf()[offset] =
  507|  1.31k|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|  1.31k|            return node;
  509|  1.31k|        }
  510|  1.31k|        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.31k|    }
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.33k|    {
  485|  1.33k|        auto offset = pos.index(idx);
  486|  1.33k|        auto count  = pos.count();
  487|  1.33k|        auto node   = node_t::make_inner_n(count);
  488|  1.33k|        IMMER_TRY {
  ------------------
  |  |   49|  1.33k|#define IMMER_TRY try
  ------------------
  489|  1.33k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.33k|            node_t::do_copy_inner_replace(
  491|  1.33k|                node, pos.node(), count, offset, child);
  492|  1.33k|            return node;
  493|  1.33k|        }
  494|  1.33k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.33k|    }
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|    572|    {
  503|    572|        auto offset = pos.index(idx);
  504|    572|        auto node   = node_t::copy_leaf(pos.node(), pos.count());
  505|    572|        IMMER_TRY {
  ------------------
  |  |   49|    572|#define IMMER_TRY try
  ------------------
  506|    572|            node->leaf()[offset] =
  507|    572|                std::forward<Fn>(fn)(std::move(node->leaf()[offset]));
  508|    572|            return node;
  509|    572|        }
  510|    572|        IMMER_CATCH (...) {
  511|      0|            node_t::delete_leaf(node, pos.count());
  512|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  513|      0|        }
  514|    572|    }
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.18k|    {
  485|  1.18k|        auto offset = pos.index(idx);
  486|  1.18k|        auto count  = pos.count();
  487|  1.18k|        auto node   = node_t::make_inner_n(count);
  488|  1.18k|        IMMER_TRY {
  ------------------
  |  |   49|  1.18k|#define IMMER_TRY try
  ------------------
  489|  1.18k|            auto child = pos.towards_oh_ch(this_t{}, idx, offset, count, fn);
  490|  1.18k|            node_t::do_copy_inner_replace(
  491|  1.18k|                node, pos.node(), count, offset, child);
  492|  1.18k|            return node;
  493|  1.18k|        }
  494|  1.18k|        IMMER_CATCH (...) {
  495|      0|            node_t::delete_inner(node, count);
  496|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  497|      0|        }
  498|  1.18k|    }
_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|  11.8k|    {
 1097|  11.8k|        auto idx = pos.index(last);
 1098|  11.8k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1098:13): [True: 11.8k, Folded]
  |  Branch (1098:25): [True: 8.35k, False: 3.45k]
  ------------------
 1099|  8.35k|            return pos.towards_oh(this_t{}, last, idx);
 1100|  8.35k|        } else {
 1101|  3.45k|            using std::get;
 1102|  3.45k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1103|  3.45k|            auto next = get<1>(subs);
 1104|  3.45k|            auto ts   = get<2>(subs);
 1105|  3.45k|            auto tail = get<3>(subs);
 1106|  3.45k|            IMMER_TRY {
  ------------------
  |  |   49|  3.45k|#define IMMER_TRY try
  ------------------
 1107|  3.45k|                if (next) {
  ------------------
  |  Branch (1107:21): [True: 1.79k, False: 1.65k]
  ------------------
 1108|  1.79k|                    auto count = idx + 1;
 1109|  1.79k|                    auto newn  = node_t::copy_inner_r_n(count, pos.node(), idx);
 1110|  1.79k|                    auto newr  = newn->relaxed();
 1111|  1.79k|                    newn->inner()[idx] = next;
 1112|  1.79k|                    newr->d.sizes[idx] = last + 1 - ts;
 1113|  1.79k|                    newr->d.count      = count;
 1114|  1.79k|                    assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (1114:21): [True: 1.79k, False: 0]
  ------------------
 1115|  1.79k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1116|  1.79k|                } else if (idx == 0) {
  ------------------
  |  Branch (1116:28): [True: 0, False: 1.65k]
  ------------------
 1117|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1118|  1.65k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1118:28): [True: 1.65k, Folded]
  |  Branch (1118:40): [True: 1.14k, False: 514]
  |  Branch (1118:52): [True: 870, False: 274]
  ------------------
 1119|    870|                    auto newn = pos.node()->inner()[0];
 1120|    870|                    return std::make_tuple(
 1121|    870|                        pos.shift() - B, newn->inc(), ts, tail);
 1122|    870|                } else {
 1123|    788|                    auto newn = node_t::copy_inner_r(pos.node(), idx);
 1124|    788|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1125|    788|                }
 1126|  3.45k|            }
 1127|  3.45k|            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|  3.45k|        }
 1138|  11.8k|    }
_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|    741|    {
 1182|    741|        auto old_tail_size = pos.count();
 1183|    741|        auto new_tail_size = pos.index(last) + 1;
 1184|    741|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 235, False: 506]
  ------------------
 1185|    741|                                 ? pos.node()->inc()
 1186|    741|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|    741|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|    741|    }
_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.17k|    {
 1182|  2.17k|        auto old_tail_size = pos.count();
 1183|  2.17k|        auto new_tail_size = pos.index(last) + 1;
 1184|  2.17k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 716, False: 1.46k]
  ------------------
 1185|  2.17k|                                 ? pos.node()->inc()
 1186|  2.17k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  2.17k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  2.17k|    }
_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.16k|    {
 1097|  4.16k|        auto idx = pos.index(last);
 1098|  4.16k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1098:13): [Folded, False: 4.16k]
  |  Branch (1098:25): [True: 0, False: 0]
  ------------------
 1099|      0|            return pos.towards_oh(this_t{}, last, idx);
 1100|  4.16k|        } else {
 1101|  4.16k|            using std::get;
 1102|  4.16k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1103|  4.16k|            auto next = get<1>(subs);
 1104|  4.16k|            auto ts   = get<2>(subs);
 1105|  4.16k|            auto tail = get<3>(subs);
 1106|  4.16k|            IMMER_TRY {
  ------------------
  |  |   49|  4.16k|#define IMMER_TRY try
  ------------------
 1107|  4.16k|                if (next) {
  ------------------
  |  Branch (1107:21): [True: 2.04k, False: 2.12k]
  ------------------
 1108|  2.04k|                    auto count = idx + 1;
 1109|  2.04k|                    auto newn  = node_t::copy_inner_r_n(count, pos.node(), idx);
 1110|  2.04k|                    auto newr  = newn->relaxed();
 1111|  2.04k|                    newn->inner()[idx] = next;
 1112|  2.04k|                    newr->d.sizes[idx] = last + 1 - ts;
 1113|  2.04k|                    newr->d.count      = count;
 1114|  2.04k|                    assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (1114:21): [True: 2.04k, False: 0]
  ------------------
 1115|  2.04k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1116|  2.12k|                } else if (idx == 0) {
  ------------------
  |  Branch (1116:28): [True: 1.00k, False: 1.11k]
  ------------------
 1117|  1.00k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1118|  1.11k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1118:28): [Folded, False: 1.11k]
  |  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.11k|                } else {
 1123|  1.11k|                    auto newn = node_t::copy_inner_r(pos.node(), idx);
 1124|  1.11k|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1125|  1.11k|                }
 1126|  4.16k|            }
 1127|  4.16k|            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.16k|        }
 1138|  4.16k|    }
_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.27k|    {
 1143|  1.27k|        auto idx = pos.index(last);
 1144|  1.27k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 1.27k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.27k|        } else {
 1147|  1.27k|            using std::get;
 1148|  1.27k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.27k|            auto next = get<1>(subs);
 1150|  1.27k|            auto ts   = get<2>(subs);
 1151|  1.27k|            auto tail = get<3>(subs);
 1152|  1.27k|            IMMER_TRY {
  ------------------
  |  |   49|  1.27k|#define IMMER_TRY try
  ------------------
 1153|  1.27k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 447, False: 825]
  ------------------
 1154|    447|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    447|                    newn->inner()[idx] = next;
 1156|    447|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|    825|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 598, False: 227]
  ------------------
 1158|    598|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    598|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 227]
  |  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|    227|                } else {
 1164|    227|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    227|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    227|                }
 1167|  1.27k|            }
 1168|  1.27k|            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.27k|        }
 1177|  1.27k|    }
_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.80k|    {
 1182|  2.80k|        auto old_tail_size = pos.count();
 1183|  2.80k|        auto new_tail_size = pos.index(last) + 1;
 1184|  2.80k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 1.18k, False: 1.62k]
  ------------------
 1185|  2.80k|                                 ? pos.node()->inc()
 1186|  2.80k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  2.80k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  2.80k|    }
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb0EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1142|  1.85k|    {
 1143|  1.85k|        auto idx = pos.index(last);
 1144|  1.85k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 1.85k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.85k|        } else {
 1147|  1.85k|            using std::get;
 1148|  1.85k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.85k|            auto next = get<1>(subs);
 1150|  1.85k|            auto ts   = get<2>(subs);
 1151|  1.85k|            auto tail = get<3>(subs);
 1152|  1.85k|            IMMER_TRY {
  ------------------
  |  |   49|  1.85k|#define IMMER_TRY try
  ------------------
 1153|  1.85k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 325, False: 1.53k]
  ------------------
 1154|    325|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    325|                    newn->inner()[idx] = next;
 1156|    325|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  1.53k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 805, False: 725]
  ------------------
 1158|    805|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    805|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 725]
  |  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|    725|                } else {
 1164|    725|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    725|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    725|                }
 1167|  1.85k|            }
 1168|  1.85k|            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.85k|        }
 1177|  1.85k|    }
_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.85k|    {
 1182|  1.85k|        auto old_tail_size = pos.count();
 1183|  1.85k|        auto new_tail_size = pos.index(last) + 1;
 1184|  1.85k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 663, False: 1.18k]
  ------------------
 1185|  1.85k|                                 ? pos.node()->inc()
 1186|  1.85k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  1.85k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  1.85k|    }
_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.48k|    {
 1143|  2.48k|        auto idx = pos.index(last);
 1144|  2.48k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [Folded, False: 2.48k]
  |  Branch (1144:25): [True: 0, False: 0]
  ------------------
 1145|      0|            return pos.towards_oh(this_t{}, last, idx);
 1146|  2.48k|        } else {
 1147|  2.48k|            using std::get;
 1148|  2.48k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  2.48k|            auto next = get<1>(subs);
 1150|  2.48k|            auto ts   = get<2>(subs);
 1151|  2.48k|            auto tail = get<3>(subs);
 1152|  2.48k|            IMMER_TRY {
  ------------------
  |  |   49|  2.48k|#define IMMER_TRY try
  ------------------
 1153|  2.48k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 349, False: 2.13k]
  ------------------
 1154|    349|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    349|                    newn->inner()[idx] = next;
 1156|    349|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  2.13k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 1.46k, False: 670]
  ------------------
 1158|  1.46k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|  1.46k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [Folded, False: 670]
  |  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|    670|                } else {
 1164|    670|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    670|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    670|                }
 1167|  2.48k|            }
 1168|  2.48k|            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.48k|        }
 1177|  2.48k|    }
_ZN5immer6detail4rbts8dec_leafINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEvPT_j:
  556|  55.5k|{
  557|  55.5k|    make_leaf_sub_pos(node, n).visit(dec_visitor{});
  558|  55.5k|}
_ZN5immer6detail4rbts19slice_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_m:
 1142|  4.96k|    {
 1143|  4.96k|        auto idx = pos.index(last);
 1144|  4.96k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [True: 4.96k, Folded]
  |  Branch (1144:25): [True: 2.63k, False: 2.32k]
  ------------------
 1145|  2.63k|            return pos.towards_oh(this_t{}, last, idx);
 1146|  2.63k|        } else {
 1147|  2.32k|            using std::get;
 1148|  2.32k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  2.32k|            auto next = get<1>(subs);
 1150|  2.32k|            auto ts   = get<2>(subs);
 1151|  2.32k|            auto tail = get<3>(subs);
 1152|  2.32k|            IMMER_TRY {
  ------------------
  |  |   49|  2.32k|#define IMMER_TRY try
  ------------------
 1153|  2.32k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 743, False: 1.58k]
  ------------------
 1154|    743|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    743|                    newn->inner()[idx] = next;
 1156|    743|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|  1.58k|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 0, False: 1.58k]
  ------------------
 1158|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|  1.58k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [True: 1.58k, Folded]
  |  Branch (1159:40): [True: 1.26k, False: 325]
  |  Branch (1159:52): [True: 897, False: 363]
  ------------------
 1160|    897|                    auto newn = pos.node()->inner()[0];
 1161|    897|                    return std::make_tuple(
 1162|    897|                        pos.shift() - B, newn->inc(), ts, tail);
 1163|    897|                } else {
 1164|    688|                    auto newn = node_t::copy_inner_n(idx, pos.node(), idx);
 1165|    688|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1166|    688|                }
 1167|  2.32k|            }
 1168|  2.32k|            IMMER_CATCH (...) {
 1169|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  |  Branch (1169:17): [True: 0, False: 0]
  ------------------
 1170|      0|                assert(tail);
  ------------------
  |  Branch (1170:17): [True: 0, False: 0]
  ------------------
 1171|      0|                if (next)
  ------------------
  |  Branch (1171:21): [True: 0, False: 0]
  ------------------
 1172|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1173|      0|                dec_leaf(tail, ts);
 1174|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1175|      0|            }
 1176|  2.32k|        }
 1177|  4.96k|    }
_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.14k|    {
 1182|  1.14k|        auto old_tail_size = pos.count();
 1183|  1.14k|        auto new_tail_size = pos.index(last) + 1;
 1184|  1.14k|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 525, False: 615]
  ------------------
 1185|  1.14k|                                 ? pos.node()->inc()
 1186|  1.14k|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|  1.14k|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|  1.14k|    }
_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.01k|    {
 1143|  2.01k|        auto idx = pos.index(last);
 1144|  2.01k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (1144:13): [True: 2.01k, Folded]
  |  Branch (1144:25): [True: 958, False: 1.05k]
  ------------------
 1145|    958|            return pos.towards_oh(this_t{}, last, idx);
 1146|  1.05k|        } else {
 1147|  1.05k|            using std::get;
 1148|  1.05k|            auto subs = pos.towards_oh(no_collapse_t{}, last, idx);
 1149|  1.05k|            auto next = get<1>(subs);
 1150|  1.05k|            auto ts   = get<2>(subs);
 1151|  1.05k|            auto tail = get<3>(subs);
 1152|  1.05k|            IMMER_TRY {
  ------------------
  |  |   49|  1.05k|#define IMMER_TRY try
  ------------------
 1153|  1.05k|                if (next) {
  ------------------
  |  Branch (1153:21): [True: 205, False: 848]
  ------------------
 1154|    205|                    auto newn = node_t::copy_inner_n(idx + 1, pos.node(), idx);
 1155|    205|                    newn->inner()[idx] = next;
 1156|    205|                    return std::make_tuple(pos.shift(), newn, ts, tail);
 1157|    848|                } else if (idx == 0) {
  ------------------
  |  Branch (1157:28): [True: 0, False: 848]
  ------------------
 1158|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1159|    848|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1159:28): [True: 848, Folded]
  |  Branch (1159:40): [True: 650, False: 198]
  |  Branch (1159:52): [True: 328, False: 322]
  ------------------
 1160|    328|                    auto newn = pos.node()->inner()[0];
 1161|    328|                    return std::make_tuple(
 1162|    328|                        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.05k|            }
 1168|  1.05k|            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.05k|        }
 1177|  2.01k|    }
_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|    440|    {
 1182|    440|        auto old_tail_size = pos.count();
 1183|    440|        auto new_tail_size = pos.index(last) + 1;
 1184|    440|        auto new_tail      = new_tail_size == old_tail_size
  ------------------
  |  Branch (1184:30): [True: 209, False: 231]
  ------------------
 1185|    440|                                 ? pos.node()->inc()
 1186|    440|                                 : node_t::copy_leaf(pos.node(), new_tail_size);
 1187|    440|        return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1188|    440|    }
_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.4k|    {
 1415|  14.4k|        auto idx                = pos.subindex(first);
 1416|  14.4k|        auto count              = pos.count();
 1417|  14.4k|        auto left_size          = pos.size_before(idx);
 1418|  14.4k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  14.4k|        auto dropped_size       = first;
 1420|  14.4k|        auto child_dropped_size = dropped_size - left_size;
 1421|  14.4k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 14.4k, Folded]
  |  Branch (1421:25): [True: 13.4k, False: 1.04k]
  |  Branch (1421:45): [True: 1.36k, False: 12.0k]
  ------------------
 1422|  1.36k|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  13.1k|        } else {
 1424|  13.1k|            using std::get;
 1425|  13.1k|            auto n    = pos.node();
 1426|  13.1k|            auto newc = count - idx;
 1427|  13.1k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  13.1k|            IMMER_TRY {
  ------------------
  |  |   49|  13.1k|#define IMMER_TRY try
  ------------------
 1429|  13.1k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  13.1k|                auto newr     = newn->relaxed();
 1431|  13.1k|                newr->d.count = count - idx;
 1432|  13.1k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  13.1k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 13.1k, False: 0]
  ------------------
 1434|  13.1k|                pos.copy_sizes(idx + 1,
 1435|  13.1k|                               newr->d.count - 1,
 1436|  13.1k|                               newr->d.sizes[0],
 1437|  13.1k|                               newr->d.sizes + 1);
 1438|  13.1k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 13.1k, False: 0]
  ------------------
 1439|  13.1k|                       pos.size() - dropped_size);
 1440|  13.1k|                newn->inner()[0] = get<1>(subs);
 1441|  13.1k|                std::copy(n->inner() + idx + 1,
 1442|  13.1k|                          n->inner() + count,
 1443|  13.1k|                          newn->inner() + 1);
 1444|  13.1k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  13.1k|                return std::make_tuple(pos.shift(), newn);
 1446|  13.1k|            }
 1447|  13.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|  13.1k|        }
 1452|  14.4k|    }
_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.6k|    {
 1457|  11.6k|        auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count());
 1458|  11.6k|        return std::make_tuple(0, n);
 1459|  11.6k|    }
_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|  94.6k|    {
 1415|  94.6k|        auto idx                = pos.subindex(first);
 1416|  94.6k|        auto count              = pos.count();
 1417|  94.6k|        auto left_size          = pos.size_before(idx);
 1418|  94.6k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  94.6k|        auto dropped_size       = first;
 1420|  94.6k|        auto child_dropped_size = dropped_size - left_size;
 1421|  94.6k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 94.6k]
  |  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|  94.6k|        } else {
 1424|  94.6k|            using std::get;
 1425|  94.6k|            auto n    = pos.node();
 1426|  94.6k|            auto newc = count - idx;
 1427|  94.6k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  94.6k|            IMMER_TRY {
  ------------------
  |  |   49|  94.6k|#define IMMER_TRY try
  ------------------
 1429|  94.6k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  94.6k|                auto newr     = newn->relaxed();
 1431|  94.6k|                newr->d.count = count - idx;
 1432|  94.6k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  94.6k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 94.6k, False: 0]
  ------------------
 1434|  94.6k|                pos.copy_sizes(idx + 1,
 1435|  94.6k|                               newr->d.count - 1,
 1436|  94.6k|                               newr->d.sizes[0],
 1437|  94.6k|                               newr->d.sizes + 1);
 1438|  94.6k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 94.6k, False: 0]
  ------------------
 1439|  94.6k|                       pos.size() - dropped_size);
 1440|  94.6k|                newn->inner()[0] = get<1>(subs);
 1441|  94.6k|                std::copy(n->inner() + idx + 1,
 1442|  94.6k|                          n->inner() + count,
 1443|  94.6k|                          newn->inner() + 1);
 1444|  94.6k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  94.6k|                return std::make_tuple(pos.shift(), newn);
 1446|  94.6k|            }
 1447|  94.6k|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|  94.6k|        }
 1452|  94.6k|    }
_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.48k|    {
 1415|  1.48k|        auto idx                = pos.subindex(first);
 1416|  1.48k|        auto count              = pos.count();
 1417|  1.48k|        auto left_size          = pos.size_before(idx);
 1418|  1.48k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  1.48k|        auto dropped_size       = first;
 1420|  1.48k|        auto child_dropped_size = dropped_size - left_size;
 1421|  1.48k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 1.48k]
  |  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.48k|        } else {
 1424|  1.48k|            using std::get;
 1425|  1.48k|            auto n    = pos.node();
 1426|  1.48k|            auto newc = count - idx;
 1427|  1.48k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  1.48k|            IMMER_TRY {
  ------------------
  |  |   49|  1.48k|#define IMMER_TRY try
  ------------------
 1429|  1.48k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  1.48k|                auto newr     = newn->relaxed();
 1431|  1.48k|                newr->d.count = count - idx;
 1432|  1.48k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  1.48k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 1.48k, False: 0]
  ------------------
 1434|  1.48k|                pos.copy_sizes(idx + 1,
 1435|  1.48k|                               newr->d.count - 1,
 1436|  1.48k|                               newr->d.sizes[0],
 1437|  1.48k|                               newr->d.sizes + 1);
 1438|  1.48k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 1.48k, False: 0]
  ------------------
 1439|  1.48k|                       pos.size() - dropped_size);
 1440|  1.48k|                newn->inner()[0] = get<1>(subs);
 1441|  1.48k|                std::copy(n->inner() + idx + 1,
 1442|  1.48k|                          n->inner() + count,
 1443|  1.48k|                          newn->inner() + 1);
 1444|  1.48k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  1.48k|                return std::make_tuple(pos.shift(), newn);
 1446|  1.48k|            }
 1447|  1.48k|            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.48k|        }
 1452|  1.48k|    }
_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|  3.85k|    {
 1457|  3.85k|        auto n = node_t::copy_leaf(pos.node(), pos.index(first), pos.count());
 1458|  3.85k|        return std::make_tuple(0, n);
 1459|  3.85k|    }
_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.56k|    {
 1415|  2.56k|        auto idx                = pos.subindex(first);
 1416|  2.56k|        auto count              = pos.count();
 1417|  2.56k|        auto left_size          = pos.size_before(idx);
 1418|  2.56k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  2.56k|        auto dropped_size       = first;
 1420|  2.56k|        auto child_dropped_size = dropped_size - left_size;
 1421|  2.56k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [Folded, False: 2.56k]
  |  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.56k|        } else {
 1424|  2.56k|            using std::get;
 1425|  2.56k|            auto n    = pos.node();
 1426|  2.56k|            auto newc = count - idx;
 1427|  2.56k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  2.56k|            IMMER_TRY {
  ------------------
  |  |   49|  2.56k|#define IMMER_TRY try
  ------------------
 1429|  2.56k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  2.56k|                auto newr     = newn->relaxed();
 1431|  2.56k|                newr->d.count = count - idx;
 1432|  2.56k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  2.56k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 2.56k, False: 0]
  ------------------
 1434|  2.56k|                pos.copy_sizes(idx + 1,
 1435|  2.56k|                               newr->d.count - 1,
 1436|  2.56k|                               newr->d.sizes[0],
 1437|  2.56k|                               newr->d.sizes + 1);
 1438|  2.56k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 2.56k, False: 0]
  ------------------
 1439|  2.56k|                       pos.size() - dropped_size);
 1440|  2.56k|                newn->inner()[0] = get<1>(subs);
 1441|  2.56k|                std::copy(n->inner() + idx + 1,
 1442|  2.56k|                          n->inner() + count,
 1443|  2.56k|                          newn->inner() + 1);
 1444|  2.56k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  2.56k|                return std::make_tuple(pos.shift(), newn);
 1446|  2.56k|            }
 1447|  2.56k|            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.56k|        }
 1452|  2.56k|    }
_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.72k|    {
 1415|  2.72k|        auto idx                = pos.subindex(first);
 1416|  2.72k|        auto count              = pos.count();
 1417|  2.72k|        auto left_size          = pos.size_before(idx);
 1418|  2.72k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  2.72k|        auto dropped_size       = first;
 1420|  2.72k|        auto child_dropped_size = dropped_size - left_size;
 1421|  2.72k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 2.72k, Folded]
  |  Branch (1421:25): [True: 1.79k, False: 924]
  |  Branch (1421:45): [True: 1.16k, False: 633]
  ------------------
 1422|  1.16k|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|  1.55k|        } else {
 1424|  1.55k|            using std::get;
 1425|  1.55k|            auto n    = pos.node();
 1426|  1.55k|            auto newc = count - idx;
 1427|  1.55k|            auto newn = node_t::make_inner_r_n(newc);
 1428|  1.55k|            IMMER_TRY {
  ------------------
  |  |   49|  1.55k|#define IMMER_TRY try
  ------------------
 1429|  1.55k|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|  1.55k|                auto newr     = newn->relaxed();
 1431|  1.55k|                newr->d.count = count - idx;
 1432|  1.55k|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|  1.55k|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 1.55k, False: 0]
  ------------------
 1434|  1.55k|                pos.copy_sizes(idx + 1,
 1435|  1.55k|                               newr->d.count - 1,
 1436|  1.55k|                               newr->d.sizes[0],
 1437|  1.55k|                               newr->d.sizes + 1);
 1438|  1.55k|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 1.55k, False: 0]
  ------------------
 1439|  1.55k|                       pos.size() - dropped_size);
 1440|  1.55k|                newn->inner()[0] = get<1>(subs);
 1441|  1.55k|                std::copy(n->inner() + idx + 1,
 1442|  1.55k|                          n->inner() + count,
 1443|  1.55k|                          newn->inner() + 1);
 1444|  1.55k|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|  1.55k|                return std::make_tuple(pos.shift(), newn);
 1446|  1.55k|            }
 1447|  1.55k|            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.55k|        }
 1452|  2.72k|    }
_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.06k|    {
 1415|  1.06k|        auto idx                = pos.subindex(first);
 1416|  1.06k|        auto count              = pos.count();
 1417|  1.06k|        auto left_size          = pos.size_before(idx);
 1418|  1.06k|        auto child_size         = pos.size_sbh(idx, left_size);
 1419|  1.06k|        auto dropped_size       = first;
 1420|  1.06k|        auto child_dropped_size = dropped_size - left_size;
 1421|  1.06k|        if (Collapse && pos.shift() > BL && idx == pos.count() - 1) {
  ------------------
  |  Branch (1421:13): [True: 1.06k, Folded]
  |  Branch (1421:25): [True: 474, False: 593]
  |  Branch (1421:45): [True: 260, False: 214]
  ------------------
 1422|    260|            return pos.towards_sub_oh(this_t{}, first, idx);
 1423|    807|        } else {
 1424|    807|            using std::get;
 1425|    807|            auto n    = pos.node();
 1426|    807|            auto newc = count - idx;
 1427|    807|            auto newn = node_t::make_inner_r_n(newc);
 1428|    807|            IMMER_TRY {
  ------------------
  |  |   49|    807|#define IMMER_TRY try
  ------------------
 1429|    807|                auto subs     = pos.towards_sub_oh(no_collapse_t{}, first, idx);
 1430|    807|                auto newr     = newn->relaxed();
 1431|    807|                newr->d.count = count - idx;
 1432|    807|                newr->d.sizes[0] = child_size - child_dropped_size;
 1433|    807|                assert(newr->d.sizes[0]);
  ------------------
  |  Branch (1433:17): [True: 807, False: 0]
  ------------------
 1434|    807|                pos.copy_sizes(idx + 1,
 1435|    807|                               newr->d.count - 1,
 1436|    807|                               newr->d.sizes[0],
 1437|    807|                               newr->d.sizes + 1);
 1438|    807|                assert(newr->d.sizes[newr->d.count - 1] ==
  ------------------
  |  Branch (1438:17): [True: 807, False: 0]
  ------------------
 1439|    807|                       pos.size() - dropped_size);
 1440|    807|                newn->inner()[0] = get<1>(subs);
 1441|    807|                std::copy(n->inner() + idx + 1,
 1442|    807|                          n->inner() + count,
 1443|    807|                          newn->inner() + 1);
 1444|    807|                node_t::inc_nodes(newn->inner() + 1, newr->d.count - 1);
 1445|    807|                return std::make_tuple(pos.shift(), newn);
 1446|    807|            }
 1447|    807|            IMMER_CATCH (...) {
 1448|      0|                node_t::delete_inner_r(newn, newc);
 1449|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1450|      0|            }
 1451|    807|        }
 1452|  1.06k|    }
_ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jSG_jm:
 2001|  3.41k|{
 2002|  3.41k|    return make_singleton_regular_sub_pos(ltail, ltcount)
 2003|  3.41k|        .visit(concat_trees_left_visitor<Node>{},
 2004|  3.41k|               empty_leaf_pos<Node>{},
 2005|  3.41k|               rroot,
 2006|  3.41k|               rshift,
 2007|  3.41k|               rsize)
 2008|  3.41k|        .realize();
 2009|  3.41k|}
_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.41k|    {
 1972|  3.41k|        return visit_maybe_relaxed_sub(
 1973|  3.41k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  3.41k|    }
_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|  2.09k|    {
 1959|  2.09k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  2.09k|    }
_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|  8.54k|{
 1873|  8.54k|    auto lshift = lpos.shift();
 1874|  8.54k|    auto rshift = rpos.shift();
 1875|  8.54k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 8.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|  8.54k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 6.65k, False: 1.89k]
  ------------------
 1879|  6.65k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  6.65k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  6.65k|    } else {
 1882|  1.89k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.89k, False: 0]
  ------------------
 1883|  1.89k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.89k]
  |  Branch (1883:9): [True: 1.89k, False: 0]
  |  Branch (1883:9): [True: 1.89k, False: 0]
  ------------------
 1884|  1.89k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.89k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.89k|    }
 1887|  8.54k|}
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8each_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
 1512|  1.14M|    {
 1513|  1.14M|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 169k, False: 971k]
  ------------------
 1514|   169k|            auto s = size_t{};
 1515|   667k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 498k, False: 169k]
  ------------------
 1516|   498k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   498k|                s = sizes_[i];
 1518|   498k|            }
 1519|   971k|        } else {
 1520|  2.47M|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 1.50M, False: 971k]
  ------------------
 1521|  1.50M|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|  1.50M|                    .visit(v, args...);
 1523|   971k|        }
 1524|  1.14M|    }
_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|   949k|    {
 1734|   949k|        auto count = p.count();
 1735|   949k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 949k, False: 0]
  ------------------
 1736|   949k|        plan.counts[plan.n++] = count;
 1737|   949k|        plan.total += count;
 1738|   949k|    }
_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.07M|    {
 1734|  4.07M|        auto count = p.count();
 1735|  4.07M|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 4.07M, False: 0]
  ------------------
 1736|  4.07M|        plan.counts[plan.n++] = count;
 1737|  4.07M|        plan.total += count;
 1738|  4.07M|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE7shuffleEj:
 1762|  1.14M|    {
 1763|       |        // gcc seems to not really understand this code... :(
 1764|  1.14M|#if !defined(_MSC_VER)
 1765|  1.14M|#pragma GCC diagnostic push
 1766|  1.14M|#pragma GCC diagnostic ignored "-Warray-bounds"
 1767|  1.14M|#endif
 1768|  1.14M|        constexpr count_t rrb_extras    = 2;
 1769|  1.14M|        constexpr count_t rrb_invariant = 1;
 1770|  1.14M|        const auto bits                 = shift == BL ? BL : B;
  ------------------
  |  Branch (1770:43): [True: 169k, False: 971k]
  ------------------
 1771|  1.14M|        const auto branches             = count_t{1} << bits;
 1772|  1.14M|        const auto optimal              = ((total - 1) >> bits) + 1;
 1773|  1.14M|        count_t i                       = 0;
 1774|  1.20M|        while (n >= optimal + rrb_extras) {
  ------------------
  |  Branch (1774:16): [True: 60.2k, False: 1.14M]
  ------------------
 1775|       |            // skip ok nodes
 1776|   116k|            while (counts[i] > branches - rrb_invariant)
  ------------------
  |  Branch (1776:20): [True: 56.2k, False: 60.2k]
  ------------------
 1777|  56.2k|                i++;
 1778|  60.2k|            assert(i < n);
  ------------------
  |  Branch (1778:13): [True: 60.2k, False: 0]
  ------------------
 1779|       |            // short node, redistribute
 1780|  60.2k|            auto remaining = counts[i];
 1781|   104k|            do {
 1782|   104k|                auto next  = counts[i + 1];
 1783|   104k|                auto count = std::min(remaining + next, branches);
 1784|   104k|                counts[i]  = count;
 1785|   104k|                assert(counts[i]);
  ------------------
  |  Branch (1785:17): [True: 104k, False: 0]
  ------------------
 1786|   104k|                remaining += next - count;
 1787|   104k|                ++i;
 1788|   104k|            } while (remaining > 0);
  ------------------
  |  Branch (1788:22): [True: 43.8k, False: 60.2k]
  ------------------
 1789|       |            // remove node
 1790|  60.2k|            std::move(counts + i + 1, counts + n, counts + i);
 1791|  60.2k|            --n;
 1792|  60.2k|            --i;
 1793|  60.2k|        }
 1794|  1.14M|#if !defined(_MSC_VER)
 1795|  1.14M|#pragma GCC diagnostic pop
 1796|  1.14M|#endif
 1797|  1.14M|    }
_ZNK5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1478|  2.28M|    auto shift() const { return shift_; }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPjj:
 1577|   266k|        : curr_{counts}
 1578|   266k|        , n_{n}
 1579|   266k|        , result_{
 1580|   266k|              shift + B, node_t::make_inner_r_n(std::min(n_, branches<B>)), 0}
 1581|   266k|    {
 1582|   266k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPSC_m:
 1481|  1.14M|        : shift_{s}
 1482|  1.14M|        , count_{1}
 1483|  1.14M|        , nodes_{n0}
 1484|  1.14M|        , sizes_{s0}
 1485|  1.14M|    {
 1486|  1.14M|    }
_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|   266k|    {
 1513|   266k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 52.1k, False: 213k]
  ------------------
 1514|  52.1k|            auto s = size_t{};
 1515|   205k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 152k, False: 52.1k]
  ------------------
 1516|   152k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   152k|                s = sizes_[i];
 1518|   152k|            }
 1519|   213k|        } else {
 1520|   637k|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 423k, False: 213k]
  ------------------
 1521|   423k|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|   423k|                    .visit(v, args...);
 1523|   213k|        }
 1524|   266k|    }
_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|   345k|    {
 1722|   345k|        merger.merge_leaf(p);
 1723|   345k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_12leaf_sub_posISC_EEEEvOT_:
 1614|   345k|    {
 1615|   345k|        auto from       = p.node();
 1616|   345k|        auto from_size  = p.size();
 1617|   345k|        auto from_count = p.count();
 1618|   345k|        assert(from_size);
  ------------------
  |  Branch (1618:9): [True: 345k, False: 0]
  ------------------
 1619|   345k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1619:13): [True: 328k, False: 16.9k]
  |  Branch (1619:21): [True: 320k, False: 8.22k]
  ------------------
 1620|   320k|            add_child(from, from_size);
 1621|   320k|            from->inc();
 1622|   320k|        } else {
 1623|  25.1k|            auto from_offset = count_t{};
 1624|  25.1k|            auto from_data   = from->leaf();
 1625|  33.6k|            do {
 1626|  33.6k|                if (!to_) {
  ------------------
  |  Branch (1626:21): [True: 16.7k, False: 16.9k]
  ------------------
 1627|  16.7k|                    to_        = node_t::make_leaf_n(*curr_);
 1628|  16.7k|                    to_offset_ = 0;
 1629|  16.7k|                }
 1630|  33.6k|                auto data = to_->leaf();
 1631|  33.6k|                auto to_copy =
 1632|  33.6k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1633|  33.6k|                detail::uninitialized_copy(from_data + from_offset,
 1634|  33.6k|                                           from_data + from_offset + to_copy,
 1635|  33.6k|                                           data + to_offset_);
 1636|  33.6k|                to_offset_ += to_copy;
 1637|  33.6k|                from_offset += to_copy;
 1638|  33.6k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1638:21): [True: 16.7k, False: 16.9k]
  ------------------
 1639|  16.7k|                    add_child(to_, to_offset_);
 1640|  16.7k|                    to_ = nullptr;
 1641|  16.7k|                }
 1642|  33.6k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1642:22): [True: 8.50k, False: 25.1k]
  ------------------
 1643|  25.1k|        }
 1644|   345k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9add_childEPSC_m:
 1589|  1.81M|    {
 1590|  1.81M|        assert(size);
  ------------------
  |  Branch (1590:9): [True: 1.81M, False: 0]
  ------------------
 1591|  1.81M|        ++curr_;
 1592|  1.81M|        auto parent  = result_.nodes_[result_.count_ - 1];
 1593|  1.81M|        auto relaxed = parent->relaxed();
 1594|  1.81M|        if (relaxed->d.count == branches<B>) {
  ------------------
  |  Branch (1594:13): [True: 232k, False: 1.58M]
  ------------------
 1595|   232k|            assert(result_.count_ < result_t::max_children);
  ------------------
  |  Branch (1595:13): [True: 232k, False: 0]
  ------------------
 1596|   232k|            n_ -= branches<B>;
 1597|   232k|            parent  = node_t::make_inner_r_n(std::min(n_, branches<B>));
 1598|   232k|            relaxed = parent->relaxed();
 1599|   232k|            result_.nodes_[result_.count_] = parent;
 1600|   232k|            result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1];
 1601|   232k|            assert(result_.sizes_[result_.count_]);
  ------------------
  |  Branch (1601:13): [True: 232k, False: 0]
  ------------------
 1602|   232k|            ++result_.count_;
 1603|   232k|        }
 1604|  1.81M|        auto idx = relaxed->d.count++;
 1605|  1.81M|        result_.sizes_[result_.count_ - 1] += size;
 1606|  1.81M|        assert(result_.sizes_[result_.count_ - 1]);
  ------------------
  |  Branch (1606:9): [True: 1.81M, False: 0]
  ------------------
 1607|  1.81M|        relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0);
  ------------------
  |  Branch (1607:41): [True: 1.31M, False: 498k]
  ------------------
 1608|  1.81M|        assert(relaxed->d.sizes[idx]);
  ------------------
  |  Branch (1608:9): [True: 1.81M, False: 0]
  ------------------
 1609|  1.81M|        parent->inner()[idx] = p;
 1610|  1.81M|    };
_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.42M|    {
 1716|  1.42M|        merger.merge_inner(p);
 1717|  1.42M|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_11relaxed_posISC_EEEEvOT_:
 1648|  1.42M|    {
 1649|  1.42M|        auto from       = p.node();
 1650|  1.42M|        auto from_size  = p.size();
 1651|  1.42M|        auto from_count = p.count();
 1652|  1.42M|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 1.42M, False: 0]
  ------------------
 1653|  1.42M|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 1.41M, False: 6.92k]
  |  Branch (1653:21): [True: 1.41M, False: 3.56k]
  ------------------
 1654|  1.41M|            add_child(from, from_size);
 1655|  1.41M|            from->inc();
 1656|  1.41M|        } else {
 1657|  10.4k|            auto from_offset = count_t{};
 1658|  10.4k|            auto from_data   = from->inner();
 1659|  13.5k|            do {
 1660|  13.5k|                if (!to_) {
  ------------------
  |  Branch (1660:21): [True: 6.66k, False: 6.92k]
  ------------------
 1661|  6.66k|                    to_        = node_t::make_inner_r_n(*curr_);
 1662|  6.66k|                    to_offset_ = 0;
 1663|  6.66k|                    to_size_   = 0;
 1664|  6.66k|                }
 1665|  13.5k|                auto data = to_->inner();
 1666|  13.5k|                auto to_copy =
 1667|  13.5k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1668|  13.5k|                std::copy(from_data + from_offset,
 1669|  13.5k|                          from_data + from_offset + to_copy,
 1670|  13.5k|                          data + to_offset_);
 1671|  13.5k|                node_t::inc_nodes(from_data + from_offset, to_copy);
 1672|  13.5k|                auto sizes = to_->relaxed()->d.sizes;
 1673|  13.5k|                p.copy_sizes(
 1674|  13.5k|                    from_offset, to_copy, to_size_, sizes + to_offset_);
 1675|  13.5k|                to_offset_ += to_copy;
 1676|  13.5k|                from_offset += to_copy;
 1677|  13.5k|                to_size_ = sizes[to_offset_ - 1];
 1678|  13.5k|                assert(to_size_);
  ------------------
  |  Branch (1678:17): [True: 13.5k, False: 0]
  ------------------
 1679|  13.5k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1679:21): [True: 6.66k, False: 6.92k]
  ------------------
 1680|  6.66k|                    to_->relaxed()->d.count = to_offset_;
 1681|  6.66k|                    add_child(to_, to_size_);
 1682|  6.66k|                    to_ = nullptr;
 1683|  6.66k|                }
 1684|  13.5k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1684:22): [True: 3.10k, False: 10.4k]
  ------------------
 1685|  10.4k|        }
 1686|  1.42M|    }
_ZNK5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6finishEv:
 1689|   266k|    {
 1690|   266k|        assert(!to_);
  ------------------
  |  Branch (1690:9): [True: 266k, False: 0]
  ------------------
 1691|   266k|        return result_;
 1692|   266k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8each_subINS1_11dec_visitorEJEEEvT_DpOT0_:
 1512|   266k|    {
 1513|   266k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 52.1k, False: 213k]
  ------------------
 1514|  52.1k|            auto s = size_t{};
 1515|   205k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 152k, False: 52.1k]
  ------------------
 1516|   152k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   152k|                s = sizes_[i];
 1518|   152k|            }
 1519|   213k|        } else {
 1520|   637k|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 423k, False: 213k]
  ------------------
 1521|   423k|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|   423k|                    .visit(v, args...);
 1523|   213k|        }
 1524|   266k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPSC_mSE_mSE_m:
 1503|   159k|        : shift_{s}
 1504|   159k|        , count_{3}
 1505|   159k|        , nodes_{n0, n1, n2}
 1506|   159k|        , sizes_{s0, s0 + s1, s0 + s1 + s2}
 1507|   159k|    {
 1508|   159k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2EjPSC_mSE_m:
 1489|  10.4k|        : shift_{s}
 1490|  10.4k|        , count_{2}
 1491|  10.4k|        , nodes_{n0, n1}
 1492|  10.4k|        , sizes_{s0, s0 + s1}
 1493|  10.4k|    {
 1494|  10.4k|    }
_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|  6.45k|    {
 1918|  6.45k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  6.45k|    }
_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|    198|    {
 1918|    198|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|    198|    }
_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.52k|{
 1873|  1.52k|    auto lshift = lpos.shift();
 1874|  1.52k|    auto rshift = rpos.shift();
 1875|  1.52k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.52k]
  ------------------
 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.52k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 609, False: 917]
  ------------------
 1879|    609|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    609|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|    917|    } else {
 1882|    917|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 917, False: 0]
  ------------------
 1883|    917|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 917]
  |  Branch (1883:9): [True: 917, False: 0]
  |  Branch (1883:9): [True: 917, False: 0]
  ------------------
 1884|    917|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|    917|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|    917|    }
 1887|  1.52k|}
_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.13k|    {
 1918|  1.13k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.13k|    }
_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.13k|{
 1873|  1.13k|    auto lshift = lpos.shift();
 1874|  1.13k|    auto rshift = rpos.shift();
 1875|  1.13k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.13k]
  ------------------
 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.13k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 523, False: 609]
  ------------------
 1879|    523|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    523|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|    609|    } else {
 1882|    609|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 609, False: 0]
  ------------------
 1883|    609|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 609]
  |  Branch (1883:9): [True: 609, False: 0]
  |  Branch (1883:9): [True: 609, False: 0]
  ------------------
 1884|    609|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|    609|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|    609|    }
 1887|  1.13k|}
_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.02k|{
 1824|  1.02k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.02k|    plan.fill(lpos, cpos, rpos);
 1826|  1.02k|    plan.shuffle(cpos.shift());
 1827|  1.02k|    IMMER_TRY {
  ------------------
  |  |   49|  1.02k|#define IMMER_TRY try
  ------------------
 1828|  1.02k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.02k|    }
 1830|  1.02k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.02k|}
_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.23k|    {
 1753|  2.23k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 2.23k, False: 0]
  ------------------
 1754|  2.23k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 2.23k, False: 0]
  ------------------
 1755|  2.23k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  2.23k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  2.23k|        cpos.each_sub(visitor_t{}, *this);
 1758|  2.23k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  2.23k|    }
_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|  95.5k|    {
 1734|  95.5k|        auto count = p.count();
 1735|  95.5k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 95.5k, False: 0]
  ------------------
 1736|  95.5k|        plan.counts[plan.n++] = count;
 1737|  95.5k|        plan.total += count;
 1738|  95.5k|    }
_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|   139k|    {
 1734|   139k|        auto count = p.count();
 1735|   139k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 139k, False: 0]
  ------------------
 1736|   139k|        plan.counts[plan.n++] = count;
 1737|   139k|        plan.total += count;
 1738|   139k|    }
_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.02k|    {
 1803|  1.02k|        using node_t    = node_type<CPos>;
 1804|  1.02k|        using merger_t  = concat_merger<node_t>;
 1805|  1.02k|        using visitor_t = concat_merger_visitor;
 1806|  1.02k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.02k|        IMMER_TRY {
  ------------------
  |  |   49|  1.02k|#define IMMER_TRY try
  ------------------
 1808|  1.02k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.02k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.02k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.02k|            cpos.each_sub(dec_visitor{});
 1812|  1.02k|            return merger.finish();
 1813|  1.02k|        }
 1814|  1.02k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.02k|    }
_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|  20.3k|    {
 1722|  20.3k|        merger.merge_leaf(p);
 1723|  20.3k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10merge_leafIRNS1_13full_leaf_posISC_EEEEvOT_:
 1614|  20.3k|    {
 1615|  20.3k|        auto from       = p.node();
 1616|  20.3k|        auto from_size  = p.size();
 1617|  20.3k|        auto from_count = p.count();
 1618|  20.3k|        assert(from_size);
  ------------------
  |  Branch (1618:9): [True: 20.3k, False: 0]
  ------------------
 1619|  20.3k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1619:13): [True: 20.3k, False: 0]
  |  Branch (1619:21): [True: 20.3k, False: 0]
  ------------------
 1620|  20.3k|            add_child(from, from_size);
 1621|  20.3k|            from->inc();
 1622|  20.3k|        } 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|  20.3k|    }
_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|  21.8k|    {
 1716|  21.8k|        merger.merge_inner(p);
 1717|  21.8k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_8full_posISC_EEEEvOT_:
 1648|  21.8k|    {
 1649|  21.8k|        auto from       = p.node();
 1650|  21.8k|        auto from_size  = p.size();
 1651|  21.8k|        auto from_count = p.count();
 1652|  21.8k|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 21.8k, False: 0]
  ------------------
 1653|  21.8k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 21.8k, False: 0]
  |  Branch (1653:21): [True: 21.8k, False: 0]
  ------------------
 1654|  21.8k|            add_child(from, from_size);
 1655|  21.8k|            from->inc();
 1656|  21.8k|        } 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|  21.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_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1944|    609|    {
 1945|    609|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|    609|    }
_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.52k|    {
 1925|  1.52k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  1.52k|    }
_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.52k|{
 1839|  1.52k|    static_assert(Node::bits >= 2, "");
 1840|  1.52k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 1.52k, False: 0]
  ------------------
 1841|  1.52k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 1.52k, False: 0]
  ------------------
 1842|  1.52k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 1.52k, False: 0]
  ------------------
 1843|  1.52k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 0, False: 1.52k]
  ------------------
 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.52k|    else
 1854|  1.52k|        return {
 1855|  1.52k|            Node::bits_leaf,
 1856|  1.52k|            lpos.node()->inc(),
 1857|  1.52k|            lpos.count(),
 1858|  1.52k|            rpos.node()->inc(),
 1859|  1.52k|            rpos.count(),
 1860|  1.52k|        };
 1861|  1.52k|}
_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|    609|{
 1824|    609|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|    609|    plan.fill(lpos, cpos, rpos);
 1826|    609|    plan.shuffle(cpos.shift());
 1827|    609|    IMMER_TRY {
  ------------------
  |  |   49|    609|#define IMMER_TRY try
  ------------------
 1828|    609|        return plan.merge(lpos, cpos, rpos);
 1829|    609|    }
 1830|    609|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|    609|}
_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.53k|    {
 1753|  1.53k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 1.53k, False: 0]
  ------------------
 1754|  1.53k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 1.53k, False: 0]
  ------------------
 1755|  1.53k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  1.53k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  1.53k|        cpos.each_sub(visitor_t{}, *this);
 1758|  1.53k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  1.53k|    }
_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|    609|    {
 1803|    609|        using node_t    = node_type<CPos>;
 1804|    609|        using merger_t  = concat_merger<node_t>;
 1805|    609|        using visitor_t = concat_merger_visitor;
 1806|    609|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|    609|        IMMER_TRY {
  ------------------
  |  |   49|    609|#define IMMER_TRY try
  ------------------
 1808|    609|            lpos.each_left_sub(visitor_t{}, merger);
 1809|    609|            cpos.each_sub(visitor_t{}, merger);
 1810|    609|            rpos.each_right_sub(visitor_t{}, merger);
 1811|    609|            cpos.each_sub(dec_visitor{});
 1812|    609|            return merger.finish();
 1813|    609|        }
 1814|    609|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|    609|    }
_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.82k|{
 1824|  1.82k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.82k|    plan.fill(lpos, cpos, rpos);
 1826|  1.82k|    plan.shuffle(cpos.shift());
 1827|  1.82k|    IMMER_TRY {
  ------------------
  |  |   49|  1.82k|#define IMMER_TRY try
  ------------------
 1828|  1.82k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.82k|    }
 1830|  1.82k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.82k|}
_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.04k|    {
 1753|  4.04k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 4.04k, False: 0]
  ------------------
 1754|  4.04k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 4.04k, False: 0]
  ------------------
 1755|  4.04k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  4.04k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  4.04k|        cpos.each_sub(visitor_t{}, *this);
 1758|  4.04k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  4.04k|    }
_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|  92.5k|    {
 1734|  92.5k|        auto count = p.count();
 1735|  92.5k|        assert(plan.n < Plan::max_children);
  ------------------
  |  Branch (1735:9): [True: 92.5k, False: 0]
  ------------------
 1736|  92.5k|        plan.counts[plan.n++] = count;
 1737|  92.5k|        plan.total += count;
 1738|  92.5k|    }
_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.82k|    {
 1803|  1.82k|        using node_t    = node_type<CPos>;
 1804|  1.82k|        using merger_t  = concat_merger<node_t>;
 1805|  1.82k|        using visitor_t = concat_merger_visitor;
 1806|  1.82k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.82k|        IMMER_TRY {
  ------------------
  |  |   49|  1.82k|#define IMMER_TRY try
  ------------------
 1808|  1.82k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.82k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.82k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.82k|            cpos.each_sub(dec_visitor{});
 1812|  1.82k|            return merger.finish();
 1813|  1.82k|        }
 1814|  1.82k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.82k|    }
_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|  14.5k|    {
 1716|  14.5k|        merger.merge_inner(p);
 1717|  14.5k|    }
_ZN5immer6detail4rbts13concat_mergerINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11merge_innerIRNS1_15regular_sub_posISC_EEEEvOT_:
 1648|  14.5k|    {
 1649|  14.5k|        auto from       = p.node();
 1650|  14.5k|        auto from_size  = p.size();
 1651|  14.5k|        auto from_count = p.count();
 1652|  14.5k|        assert(from_size);
  ------------------
  |  Branch (1652:9): [True: 14.5k, False: 0]
  ------------------
 1653|  14.5k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (1653:13): [True: 14.0k, False: 518]
  |  Branch (1653:21): [True: 14.0k, False: 0]
  ------------------
 1654|  14.0k|            add_child(from, from_size);
 1655|  14.0k|            from->inc();
 1656|  14.0k|        } else {
 1657|    518|            auto from_offset = count_t{};
 1658|    518|            auto from_data   = from->inner();
 1659|  1.03k|            do {
 1660|  1.03k|                if (!to_) {
  ------------------
  |  Branch (1660:21): [True: 518, False: 518]
  ------------------
 1661|    518|                    to_        = node_t::make_inner_r_n(*curr_);
 1662|    518|                    to_offset_ = 0;
 1663|    518|                    to_size_   = 0;
 1664|    518|                }
 1665|  1.03k|                auto data = to_->inner();
 1666|  1.03k|                auto to_copy =
 1667|  1.03k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 1668|  1.03k|                std::copy(from_data + from_offset,
 1669|  1.03k|                          from_data + from_offset + to_copy,
 1670|  1.03k|                          data + to_offset_);
 1671|  1.03k|                node_t::inc_nodes(from_data + from_offset, to_copy);
 1672|  1.03k|                auto sizes = to_->relaxed()->d.sizes;
 1673|  1.03k|                p.copy_sizes(
 1674|  1.03k|                    from_offset, to_copy, to_size_, sizes + to_offset_);
 1675|  1.03k|                to_offset_ += to_copy;
 1676|  1.03k|                from_offset += to_copy;
 1677|  1.03k|                to_size_ = sizes[to_offset_ - 1];
 1678|  1.03k|                assert(to_size_);
  ------------------
  |  Branch (1678:17): [True: 1.03k, False: 0]
  ------------------
 1679|  1.03k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (1679:21): [True: 518, False: 518]
  ------------------
 1680|    518|                    to_->relaxed()->d.count = to_offset_;
 1681|    518|                    add_child(to_, to_size_);
 1682|    518|                    to_ = nullptr;
 1683|    518|                }
 1684|  1.03k|            } while (from_offset != from_count);
  ------------------
  |  Branch (1684:22): [True: 518, False: 518]
  ------------------
 1685|    518|        }
 1686|  14.5k|    }
_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|    917|    {
 1945|    917|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|    917|    }
_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.89k|    {
 1925|  1.89k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  1.89k|    }
_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.89k|{
 1839|  1.89k|    static_assert(Node::bits >= 2, "");
 1840|  1.89k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 1.89k, False: 0]
  ------------------
 1841|  1.89k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 1.89k, False: 0]
  ------------------
 1842|  1.89k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 1.89k, False: 0]
  ------------------
 1843|  1.89k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 0, False: 1.89k]
  ------------------
 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.89k|    else
 1854|  1.89k|        return {
 1855|  1.89k|            Node::bits_leaf,
 1856|  1.89k|            lpos.node()->inc(),
 1857|  1.89k|            lpos.count(),
 1858|  1.89k|            rpos.node()->inc(),
 1859|  1.89k|            rpos.count(),
 1860|  1.89k|        };
 1861|  1.89k|}
_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|    917|{
 1824|    917|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|    917|    plan.fill(lpos, cpos, rpos);
 1826|    917|    plan.shuffle(cpos.shift());
 1827|    917|    IMMER_TRY {
  ------------------
  |  |   49|    917|#define IMMER_TRY try
  ------------------
 1828|    917|        return plan.merge(lpos, cpos, rpos);
 1829|    917|    }
 1830|    917|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|    917|}
_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.92k|    {
 1753|  3.92k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 3.92k, False: 0]
  ------------------
 1754|  3.92k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 3.92k, False: 0]
  ------------------
 1755|  3.92k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  3.92k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  3.92k|        cpos.each_sub(visitor_t{}, *this);
 1758|  3.92k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  3.92k|    }
_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|    917|    {
 1803|    917|        using node_t    = node_type<CPos>;
 1804|    917|        using merger_t  = concat_merger<node_t>;
 1805|    917|        using visitor_t = concat_merger_visitor;
 1806|    917|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|    917|        IMMER_TRY {
  ------------------
  |  |   49|    917|#define IMMER_TRY try
  ------------------
 1808|    917|            lpos.each_left_sub(visitor_t{}, merger);
 1809|    917|            cpos.each_sub(visitor_t{}, merger);
 1810|    917|            rpos.each_right_sub(visitor_t{}, merger);
 1811|    917|            cpos.each_sub(dec_visitor{});
 1812|    917|            return merger.finish();
 1813|    917|        }
 1814|    917|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|    917|    }
_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|  17.0k|{
 1824|  17.0k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  17.0k|    plan.fill(lpos, cpos, rpos);
 1826|  17.0k|    plan.shuffle(cpos.shift());
 1827|  17.0k|    IMMER_TRY {
  ------------------
  |  |   49|  17.0k|#define IMMER_TRY try
  ------------------
 1828|  17.0k|        return plan.merge(lpos, cpos, rpos);
 1829|  17.0k|    }
 1830|  17.0k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  17.0k|}
_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|  85.2k|    {
 1753|  85.2k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 85.2k, False: 0]
  ------------------
 1754|  85.2k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 85.2k, False: 0]
  ------------------
 1755|  85.2k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  85.2k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  85.2k|        cpos.each_sub(visitor_t{}, *this);
 1758|  85.2k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  85.2k|    }
_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|  17.0k|    {
 1803|  17.0k|        using node_t    = node_type<CPos>;
 1804|  17.0k|        using merger_t  = concat_merger<node_t>;
 1805|  17.0k|        using visitor_t = concat_merger_visitor;
 1806|  17.0k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  17.0k|        IMMER_TRY {
  ------------------
  |  |   49|  17.0k|#define IMMER_TRY try
  ------------------
 1808|  17.0k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  17.0k|            cpos.each_sub(visitor_t{}, merger);
 1810|  17.0k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  17.0k|            cpos.each_sub(dec_visitor{});
 1812|  17.0k|            return merger.finish();
 1813|  17.0k|        }
 1814|  17.0k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  17.0k|    }
_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.89k|    {
 1945|  1.89k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  1.89k|    }
_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.89k|{
 1824|  1.89k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.89k|    plan.fill(lpos, cpos, rpos);
 1826|  1.89k|    plan.shuffle(cpos.shift());
 1827|  1.89k|    IMMER_TRY {
  ------------------
  |  |   49|  1.89k|#define IMMER_TRY try
  ------------------
 1828|  1.89k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.89k|    }
 1830|  1.89k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.89k|}
_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.01k|    {
 1753|  5.01k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 5.01k, False: 0]
  ------------------
 1754|  5.01k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 5.01k, False: 0]
  ------------------
 1755|  5.01k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  5.01k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  5.01k|        cpos.each_sub(visitor_t{}, *this);
 1758|  5.01k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  5.01k|    }
_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.89k|    {
 1803|  1.89k|        using node_t    = node_type<CPos>;
 1804|  1.89k|        using merger_t  = concat_merger<node_t>;
 1805|  1.89k|        using visitor_t = concat_merger_visitor;
 1806|  1.89k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.89k|        IMMER_TRY {
  ------------------
  |  |   49|  1.89k|#define IMMER_TRY try
  ------------------
 1808|  1.89k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.89k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.89k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.89k|            cpos.each_sub(dec_visitor{});
 1812|  1.89k|            return merger.finish();
 1813|  1.89k|        }
 1814|  1.89k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.89k|    }
_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.32k|    {
 1959|  1.32k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  1.32k|    }
_ZNO5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7realizeEv:
 1527|  52.1k|    {
 1528|  52.1k|        if (count_ > 1) {
  ------------------
  |  Branch (1528:13): [True: 22.3k, False: 29.8k]
  ------------------
 1529|  22.3k|            IMMER_TRY {
  ------------------
  |  |   49|  22.3k|#define IMMER_TRY try
  ------------------
 1530|  22.3k|                auto result = node_t::make_inner_r_n(count_);
 1531|  22.3k|                auto r      = result->relaxed();
 1532|  22.3k|                r->d.count  = count_;
 1533|  22.3k|                std::copy(nodes_, nodes_ + count_, result->inner());
 1534|  22.3k|                std::copy(sizes_, sizes_ + count_, r->d.sizes);
 1535|  22.3k|                return {result, shift_, r};
 1536|  22.3k|            }
 1537|  22.3k|            IMMER_CATCH (...) {
 1538|      0|                each_sub(dec_visitor{});
 1539|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1540|      0|            }
 1541|  29.8k|        } else {
 1542|  29.8k|            assert(shift_ >= B + BL);
  ------------------
  |  Branch (1542:13): [True: 29.8k, False: 0]
  ------------------
 1543|  29.8k|            return {nodes_[0], shift_ - B, nodes_[0]->relaxed()};
 1544|  29.8k|        }
 1545|  52.1k|    }
_ZN5immer6detail4rbts12concat_treesINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11relaxed_posIT_EEPSE_jmSG_jSG_jm:
 1986|  48.7k|{
 1987|  48.7k|    return visit_maybe_relaxed_sub(lroot,
 1988|  48.7k|                                   lshift,
 1989|  48.7k|                                   lsize,
 1990|  48.7k|                                   concat_trees_left_visitor<Node>{},
 1991|  48.7k|                                   make_leaf_pos(ltail, ltcount),
 1992|  48.7k|                                   rroot,
 1993|  48.7k|                                   rshift,
 1994|  48.7k|                                   rsize)
 1995|  48.7k|        .realize();
 1996|  48.7k|}
_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|  43.0k|    {
 1972|  43.0k|        return visit_maybe_relaxed_sub(
 1973|  43.0k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  43.0k|    }
_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|  40.1k|    {
 1959|  40.1k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  40.1k|    }
_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|   224k|{
 1873|   224k|    auto lshift = lpos.shift();
 1874|   224k|    auto rshift = rpos.shift();
 1875|   224k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 3.38k, False: 221k]
  ------------------
 1876|  3.38k|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|  3.38k|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|   221k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 9.15k, False: 211k]
  ------------------
 1879|  9.15k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  9.15k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|   211k|    } else {
 1882|   211k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 211k, False: 0]
  ------------------
 1883|   211k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 211k]
  |  Branch (1883:9): [True: 211k, False: 0]
  |  Branch (1883:9): [True: 211k, False: 0]
  ------------------
 1884|   211k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|   211k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|   211k|    }
 1887|   224k|}
_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|  3.04k|    {
 1898|  3.04k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  3.04k|    }
_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|    745|    {
 1898|    745|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|    745|    }
_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|  11.8k|{
 1873|  11.8k|    auto lshift = lpos.shift();
 1874|  11.8k|    auto rshift = rpos.shift();
 1875|  11.8k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 405, False: 11.4k]
  ------------------
 1876|    405|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|    405|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  11.4k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 1.28k, False: 10.1k]
  ------------------
 1879|  1.28k|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|  1.28k|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  10.1k|    } else {
 1882|  10.1k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 10.1k, False: 0]
  ------------------
 1883|  10.1k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 10.1k]
  |  Branch (1883:9): [True: 10.1k, False: 0]
  |  Branch (1883:9): [True: 10.1k, False: 0]
  ------------------
 1884|  10.1k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  10.1k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  10.1k|    }
 1887|  11.8k|}
_ZN5immer6detail4rbts16concat_rebalanceINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EENS1_12null_sub_posEEENSG_IT_EEOT0_OT1_OT2_:
 1823|  1.37k|{
 1824|  1.37k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.37k|    plan.fill(lpos, cpos, rpos);
 1826|  1.37k|    plan.shuffle(cpos.shift());
 1827|  1.37k|    IMMER_TRY {
  ------------------
  |  |   49|  1.37k|#define IMMER_TRY try
  ------------------
 1828|  1.37k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.37k|    }
 1830|  1.37k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.37k|}
_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|  4.79k|    {
 1753|  4.79k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 4.79k, False: 0]
  ------------------
 1754|  4.79k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 4.79k, False: 0]
  ------------------
 1755|  4.79k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  4.79k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  4.79k|        cpos.each_sub(visitor_t{}, *this);
 1758|  4.79k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  4.79k|    }
_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.37k|    {
 1803|  1.37k|        using node_t    = node_type<CPos>;
 1804|  1.37k|        using merger_t  = concat_merger<node_t>;
 1805|  1.37k|        using visitor_t = concat_merger_visitor;
 1806|  1.37k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.37k|        IMMER_TRY {
  ------------------
  |  |   49|  1.37k|#define IMMER_TRY try
  ------------------
 1808|  1.37k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.37k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.37k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.37k|            cpos.each_sub(dec_visitor{});
 1812|  1.37k|            return merger.finish();
 1813|  1.37k|        }
 1814|  1.37k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.37k|    }
_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.2k|    {
 1918|  10.2k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  10.2k|    }
_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|    798|    {
 1918|    798|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|    798|    }
_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|  6.95k|{
 1873|  6.95k|    auto lshift = lpos.shift();
 1874|  6.95k|    auto rshift = rpos.shift();
 1875|  6.95k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 968, False: 5.98k]
  ------------------
 1876|    968|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|    968|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  5.98k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 656, False: 5.33k]
  ------------------
 1879|    656|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    656|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  5.33k|    } else {
 1882|  5.33k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 5.33k, False: 0]
  ------------------
 1883|  5.33k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 5.33k]
  |  Branch (1883:9): [True: 5.33k, False: 0]
  |  Branch (1883:9): [True: 5.33k, False: 0]
  ------------------
 1884|  5.33k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  5.33k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  5.33k|    }
 1887|  6.95k|}
_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.34k|    {
 1898|  1.34k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  1.34k|    }
_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|  3.86k|    {
 1918|  3.86k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  3.86k|    }
_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|  3.86k|{
 1873|  3.86k|    auto lshift = lpos.shift();
 1874|  3.86k|    auto rshift = rpos.shift();
 1875|  3.86k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 3.86k]
  ------------------
 1876|      0|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|      0|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  3.86k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 229, False: 3.63k]
  ------------------
 1879|    229|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    229|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  3.63k|    } else {
 1882|  3.63k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 3.63k, False: 0]
  ------------------
 1883|  3.63k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 3.63k]
  |  Branch (1883:9): [True: 3.63k, False: 0]
  |  Branch (1883:9): [True: 3.63k, False: 0]
  ------------------
 1884|  3.63k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  3.63k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  3.63k|    }
 1887|  3.86k|}
_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.41k|    {
 1945|  3.41k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  3.41k|    }
_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.77k|    {
 1925|  8.77k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  8.77k|    }
_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.77k|{
 1839|  8.77k|    static_assert(Node::bits >= 2, "");
 1840|  8.77k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 8.77k, False: 0]
  ------------------
 1841|  8.77k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 8.77k, False: 0]
  ------------------
 1842|  8.77k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 8.77k, False: 0]
  ------------------
 1843|  8.77k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 8.77k, False: 0]
  ------------------
 1844|  8.77k|        return {
 1845|  8.77k|            Node::bits_leaf,
 1846|  8.77k|            lpos.node()->inc(),
 1847|  8.77k|            lpos.count(),
 1848|  8.77k|            tpos.node()->inc(),
 1849|  8.77k|            tpos.count(),
 1850|  8.77k|            rpos.node()->inc(),
 1851|  8.77k|            rpos.count(),
 1852|  8.77k|        };
 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.77k|}
_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.41k|    {
 1938|  1.41k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  1.41k|    }
_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|  3.63k|{
 1824|  3.63k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  3.63k|    plan.fill(lpos, cpos, rpos);
 1826|  3.63k|    plan.shuffle(cpos.shift());
 1827|  3.63k|    IMMER_TRY {
  ------------------
  |  |   49|  3.63k|#define IMMER_TRY try
  ------------------
 1828|  3.63k|        return plan.merge(lpos, cpos, rpos);
 1829|  3.63k|    }
 1830|  3.63k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  3.63k|}
_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.9k|    {
 1753|  14.9k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 14.9k, False: 0]
  ------------------
 1754|  14.9k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 14.9k, False: 0]
  ------------------
 1755|  14.9k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  14.9k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  14.9k|        cpos.each_sub(visitor_t{}, *this);
 1758|  14.9k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  14.9k|    }
_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|  3.63k|    {
 1803|  3.63k|        using node_t    = node_type<CPos>;
 1804|  3.63k|        using merger_t  = concat_merger<node_t>;
 1805|  3.63k|        using visitor_t = concat_merger_visitor;
 1806|  3.63k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  3.63k|        IMMER_TRY {
  ------------------
  |  |   49|  3.63k|#define IMMER_TRY try
  ------------------
 1808|  3.63k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  3.63k|            cpos.each_sub(visitor_t{}, merger);
 1810|  3.63k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  3.63k|            cpos.each_sub(dec_visitor{});
 1812|  3.63k|            return merger.finish();
 1813|  3.63k|        }
 1814|  3.63k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  3.63k|    }
_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.36k|    {
 1945|  5.36k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  5.36k|    }
_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|  39.9k|    {
 1925|  39.9k|        return concat_leafs<Node>(lpos, tpos, rpos);
 1926|  39.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|  39.9k|{
 1839|  39.9k|    static_assert(Node::bits >= 2, "");
 1840|  39.9k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (1840:5): [True: 39.9k, False: 0]
  ------------------
 1841|  39.9k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (1841:5): [True: 39.9k, False: 0]
  ------------------
 1842|  39.9k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (1842:5): [True: 39.9k, False: 0]
  ------------------
 1843|  39.9k|    if (tpos.count() > 0)
  ------------------
  |  Branch (1843:9): [True: 39.9k, False: 0]
  ------------------
 1844|  39.9k|        return {
 1845|  39.9k|            Node::bits_leaf,
 1846|  39.9k|            lpos.node()->inc(),
 1847|  39.9k|            lpos.count(),
 1848|  39.9k|            tpos.node()->inc(),
 1849|  39.9k|            tpos.count(),
 1850|  39.9k|            rpos.node()->inc(),
 1851|  39.9k|            rpos.count(),
 1852|  39.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|  39.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.57k|    {
 1938|  1.57k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  1.57k|    }
_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.33k|{
 1824|  5.33k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  5.33k|    plan.fill(lpos, cpos, rpos);
 1826|  5.33k|    plan.shuffle(cpos.shift());
 1827|  5.33k|    IMMER_TRY {
  ------------------
  |  |   49|  5.33k|#define IMMER_TRY try
  ------------------
 1828|  5.33k|        return plan.merge(lpos, cpos, rpos);
 1829|  5.33k|    }
 1830|  5.33k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  5.33k|}
_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|  10.8k|    {
 1753|  10.8k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 10.8k, False: 0]
  ------------------
 1754|  10.8k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 10.8k, False: 0]
  ------------------
 1755|  10.8k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  10.8k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  10.8k|        cpos.each_sub(visitor_t{}, *this);
 1758|  10.8k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  10.8k|    }
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE5mergeIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EESH_EENSI_INSt3__15decayIT0_E4type6node_tEEEOT_OSN_OT1_:
 1802|  5.33k|    {
 1803|  5.33k|        using node_t    = node_type<CPos>;
 1804|  5.33k|        using merger_t  = concat_merger<node_t>;
 1805|  5.33k|        using visitor_t = concat_merger_visitor;
 1806|  5.33k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  5.33k|        IMMER_TRY {
  ------------------
  |  |   49|  5.33k|#define IMMER_TRY try
  ------------------
 1808|  5.33k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  5.33k|            cpos.each_sub(visitor_t{}, merger);
 1810|  5.33k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  5.33k|            cpos.each_sub(dec_visitor{});
 1812|  5.33k|            return merger.finish();
 1813|  5.33k|        }
 1814|  5.33k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  5.33k|    }
_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|  39.9k|    {
 1945|  39.9k|        return rpos.first_sub_leaf(concat_right_visitor<Node>{}, lpos, tpos);
 1946|  39.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|  9.72k|    {
 1938|  9.72k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|  9.72k|    }
_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|  10.1k|{
 1824|  10.1k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  10.1k|    plan.fill(lpos, cpos, rpos);
 1826|  10.1k|    plan.shuffle(cpos.shift());
 1827|  10.1k|    IMMER_TRY {
  ------------------
  |  |   49|  10.1k|#define IMMER_TRY try
  ------------------
 1828|  10.1k|        return plan.merge(lpos, cpos, rpos);
 1829|  10.1k|    }
 1830|  10.1k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  10.1k|}
_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|  93.0k|    {
 1753|  93.0k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 93.0k, False: 0]
  ------------------
 1754|  93.0k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 93.0k, False: 0]
  ------------------
 1755|  93.0k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  93.0k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  93.0k|        cpos.each_sub(visitor_t{}, *this);
 1758|  93.0k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  93.0k|    }
_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|  10.1k|    {
 1803|  10.1k|        using node_t    = node_type<CPos>;
 1804|  10.1k|        using merger_t  = concat_merger<node_t>;
 1805|  10.1k|        using visitor_t = concat_merger_visitor;
 1806|  10.1k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  10.1k|        IMMER_TRY {
  ------------------
  |  |   49|  10.1k|#define IMMER_TRY try
  ------------------
 1808|  10.1k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  10.1k|            cpos.each_sub(visitor_t{}, merger);
 1810|  10.1k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  10.1k|            cpos.each_sub(dec_visitor{});
 1812|  10.1k|            return merger.finish();
 1813|  10.1k|        }
 1814|  10.1k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  10.1k|    }
_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|  6.56k|{
 1824|  6.56k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  6.56k|    plan.fill(lpos, cpos, rpos);
 1826|  6.56k|    plan.shuffle(cpos.shift());
 1827|  6.56k|    IMMER_TRY {
  ------------------
  |  |   49|  6.56k|#define IMMER_TRY try
  ------------------
 1828|  6.56k|        return plan.merge(lpos, cpos, rpos);
 1829|  6.56k|    }
 1830|  6.56k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  6.56k|}
_ZN5immer6detail4rbts21concat_rebalance_planILj2ELj2EE4fillIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_17concat_center_posISF_EERNS1_12null_sub_posEEEvOT_OT0_OT1_:
 1752|   414k|    {
 1753|   414k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 414k, False: 0]
  ------------------
 1754|   414k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 414k, False: 0]
  ------------------
 1755|   414k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   414k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   414k|        cpos.each_sub(visitor_t{}, *this);
 1758|   414k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   414k|    }
_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|  6.56k|    {
 1803|  6.56k|        using node_t    = node_type<CPos>;
 1804|  6.56k|        using merger_t  = concat_merger<node_t>;
 1805|  6.56k|        using visitor_t = concat_merger_visitor;
 1806|  6.56k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  6.56k|        IMMER_TRY {
  ------------------
  |  |   49|  6.56k|#define IMMER_TRY try
  ------------------
 1808|  6.56k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  6.56k|            cpos.each_sub(visitor_t{}, merger);
 1810|  6.56k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  6.56k|            cpos.each_sub(dec_visitor{});
 1812|  6.56k|            return merger.finish();
 1813|  6.56k|        }
 1814|  6.56k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  6.56k|    }
_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|   181k|    {
 1918|   181k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|   181k|    }
_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|    228|    {
 1918|    228|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|    228|    }
_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|  5.96k|{
 1873|  5.96k|    auto lshift = lpos.shift();
 1874|  5.96k|    auto rshift = rpos.shift();
 1875|  5.96k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 3.17k, False: 2.78k]
  ------------------
 1876|  3.17k|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|  3.17k|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  3.17k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 560, False: 2.22k]
  ------------------
 1879|    560|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    560|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  2.22k|    } else {
 1882|  2.22k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 2.22k, False: 0]
  ------------------
 1883|  2.22k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 2.22k]
  |  Branch (1883:9): [True: 2.22k, False: 0]
  |  Branch (1883:9): [True: 2.22k, False: 0]
  ------------------
 1884|  2.22k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  2.22k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  2.22k|    }
 1887|  5.96k|}
_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|  2.80k|    {
 1898|  2.80k|        return concat_inners<Node>(lpos, tpos, rpos);
 1899|  2.80k|    }
_ZN5immer6detail4rbts20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_8full_posISC_EERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1917|  1.86k|    {
 1918|  1.86k|        return concat_inners<Node>(lpos, tpos, rpos);
 1919|  1.86k|    }
_ZN5immer6detail4rbts13concat_innersINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posIT_EEOT0_OT1_OT2_:
 1872|  1.86k|{
 1873|  1.86k|    auto lshift = lpos.shift();
 1874|  1.86k|    auto rshift = rpos.shift();
 1875|  1.86k|    if (lshift > rshift) {
  ------------------
  |  Branch (1875:9): [True: 0, False: 1.86k]
  ------------------
 1876|      0|        auto cpos = lpos.last_sub(concat_left_visitor<Node>{}, tpos, rpos);
 1877|      0|        return concat_rebalance<Node>(lpos, cpos, null_sub_pos{});
 1878|  1.86k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (1878:16): [True: 275, False: 1.59k]
  ------------------
 1879|    275|        auto cpos = rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1880|    275|        return concat_rebalance<Node>(null_sub_pos{}, cpos, rpos);
 1881|  1.59k|    } else {
 1882|  1.59k|        assert(lshift == rshift);
  ------------------
  |  Branch (1882:9): [True: 1.59k, False: 0]
  ------------------
 1883|  1.59k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (1883:9): [Folded, False: 1.59k]
  |  Branch (1883:9): [True: 1.59k, False: 0]
  |  Branch (1883:9): [True: 1.59k, False: 0]
  ------------------
 1884|  1.59k|        auto cpos = lpos.last_sub(concat_both_visitor<Node>{}, tpos, rpos);
 1885|  1.59k|        return concat_rebalance<Node>(lpos, cpos, rpos);
 1886|  1.59k|    }
 1887|  1.86k|}
_ZN5immer6detail4rbts19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11visit_innerIRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_OT0_OT1_:
 1937|    405|    {
 1938|    405|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|    405|    }
_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.59k|{
 1824|  1.59k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  1.59k|    plan.fill(lpos, cpos, rpos);
 1826|  1.59k|    plan.shuffle(cpos.shift());
 1827|  1.59k|    IMMER_TRY {
  ------------------
  |  |   49|  1.59k|#define IMMER_TRY try
  ------------------
 1828|  1.59k|        return plan.merge(lpos, cpos, rpos);
 1829|  1.59k|    }
 1830|  1.59k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  1.59k|}
_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.94k|    {
 1753|  3.94k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 3.94k, False: 0]
  ------------------
 1754|  3.94k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 3.94k, False: 0]
  ------------------
 1755|  3.94k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  3.94k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  3.94k|        cpos.each_sub(visitor_t{}, *this);
 1758|  3.94k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  3.94k|    }
_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.59k|    {
 1803|  1.59k|        using node_t    = node_type<CPos>;
 1804|  1.59k|        using merger_t  = concat_merger<node_t>;
 1805|  1.59k|        using visitor_t = concat_merger_visitor;
 1806|  1.59k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  1.59k|        IMMER_TRY {
  ------------------
  |  |   49|  1.59k|#define IMMER_TRY try
  ------------------
 1808|  1.59k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  1.59k|            cpos.each_sub(visitor_t{}, merger);
 1810|  1.59k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  1.59k|            cpos.each_sub(dec_visitor{});
 1812|  1.59k|            return merger.finish();
 1813|  1.59k|        }
 1814|  1.59k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  1.59k|    }
_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|    625|    {
 1938|    625|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|    625|    }
_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|  2.22k|{
 1824|  2.22k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|  2.22k|    plan.fill(lpos, cpos, rpos);
 1826|  2.22k|    plan.shuffle(cpos.shift());
 1827|  2.22k|    IMMER_TRY {
  ------------------
  |  |   49|  2.22k|#define IMMER_TRY try
  ------------------
 1828|  2.22k|        return plan.merge(lpos, cpos, rpos);
 1829|  2.22k|    }
 1830|  2.22k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|  2.22k|}
_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|  45.1k|    {
 1753|  45.1k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 45.1k, False: 0]
  ------------------
 1754|  45.1k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 45.1k, False: 0]
  ------------------
 1755|  45.1k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|  45.1k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|  45.1k|        cpos.each_sub(visitor_t{}, *this);
 1758|  45.1k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|  45.1k|    }
_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|  2.22k|    {
 1803|  2.22k|        using node_t    = node_type<CPos>;
 1804|  2.22k|        using merger_t  = concat_merger<node_t>;
 1805|  2.22k|        using visitor_t = concat_merger_visitor;
 1806|  2.22k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|  2.22k|        IMMER_TRY {
  ------------------
  |  |   49|  2.22k|#define IMMER_TRY try
  ------------------
 1808|  2.22k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|  2.22k|            cpos.each_sub(visitor_t{}, merger);
 1810|  2.22k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|  2.22k|            cpos.each_sub(dec_visitor{});
 1812|  2.22k|            return merger.finish();
 1813|  2.22k|        }
 1814|  2.22k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|  2.22k|    }
_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|   172k|    {
 1938|   172k|        return rpos.first_sub(concat_right_visitor<Node>{}, lpos, tpos);
 1939|   172k|    }
_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|   211k|{
 1824|   211k|    auto plan = concat_rebalance_plan<Node::bits, Node::bits_leaf>{};
 1825|   211k|    plan.fill(lpos, cpos, rpos);
 1826|   211k|    plan.shuffle(cpos.shift());
 1827|   211k|    IMMER_TRY {
  ------------------
  |  |   49|   211k|#define IMMER_TRY try
  ------------------
 1828|   211k|        return plan.merge(lpos, cpos, rpos);
 1829|   211k|    }
 1830|   211k|    IMMER_CATCH (...) {
 1831|      0|        cpos.each_sub(dec_visitor{});
 1832|      0|        IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1833|      0|    }
 1834|   211k|}
_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|   451k|    {
 1753|   451k|        assert(n == 0u);
  ------------------
  |  Branch (1753:9): [True: 451k, False: 0]
  ------------------
 1754|   451k|        assert(total == 0u);
  ------------------
  |  Branch (1754:9): [True: 451k, False: 0]
  ------------------
 1755|   451k|        using visitor_t = concat_rebalance_plan_fill_visitor;
 1756|   451k|        lpos.each_left_sub(visitor_t{}, *this);
 1757|   451k|        cpos.each_sub(visitor_t{}, *this);
 1758|   451k|        rpos.each_right_sub(visitor_t{}, *this);
 1759|   451k|    }
_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|   211k|    {
 1803|   211k|        using node_t    = node_type<CPos>;
 1804|   211k|        using merger_t  = concat_merger<node_t>;
 1805|   211k|        using visitor_t = concat_merger_visitor;
 1806|   211k|        auto merger     = merger_t{cpos.shift(), counts, n};
 1807|   211k|        IMMER_TRY {
  ------------------
  |  |   49|   211k|#define IMMER_TRY try
  ------------------
 1808|   211k|            lpos.each_left_sub(visitor_t{}, merger);
 1809|   211k|            cpos.each_sub(visitor_t{}, merger);
 1810|   211k|            rpos.each_right_sub(visitor_t{}, merger);
 1811|   211k|            cpos.each_sub(dec_visitor{});
 1812|   211k|            return merger.finish();
 1813|   211k|        }
 1814|   211k|        IMMER_CATCH (...) {
 1815|      0|            merger.abort();
 1816|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1817|      0|        }
 1818|   211k|    }
_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.93k|    {
 1959|  2.93k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  2.93k|    }
_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.66k|    {
 1972|  5.66k|        return visit_maybe_relaxed_sub(
 1973|  5.66k|            args..., concat_trees_right_visitor<Node>{}, lpos, tpos);
 1974|  5.66k|    }
_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|    856|    {
 1959|    856|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|    856|    }
_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.81k|    {
 1959|  4.81k|        return concat_inners<Node>(lpos, tpos, rpos);
 1960|  4.81k|    }
_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|   794k|    {
  681|   794k|        auto node     = pos.node();
  682|   794k|        auto level    = pos.shift();
  683|   794k|        auto idx      = pos.count() - 1;
  684|   794k|        auto children = pos.size(idx);
  685|   794k|        auto new_idx =
  686|   794k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (686:13): [True: 4.74k, False: 790k]
  |  Branch (686:47): [True: 1.22k, False: 789k]
  ------------------
  687|   794k|        auto new_child = static_cast<node_t*>(nullptr);
  688|   794k|        auto mutate    = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (688:26): [True: 794k, Folded]
  |  Branch (688:38): [True: 788k, False: 6.20k]
  ------------------
  689|       |
  690|   794k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (690:13): [True: 2.84k, False: 792k]
  ------------------
  691|  2.84k|            return nullptr;
  692|   792k|        else if (idx == new_idx) {
  ------------------
  |  Branch (692:18): [True: 789k, False: 3.12k]
  ------------------
  693|   789k|            new_child =
  694|   789k|                mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts)
  ------------------
  |  Branch (694:17): [True: 783k, False: 5.37k]
  ------------------
  695|   789k|                       : pos.last_oh_csh(
  696|  5.37k|                             this_no_mut_t{}, idx, children, e, tail, ts);
  697|   789k|            if (!new_child) {
  ------------------
  |  Branch (697:17): [True: 3.76k, False: 785k]
  ------------------
  698|  3.76k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (698:21): [True: 1.87k, False: 1.89k]
  ------------------
  699|  1.87k|                    new_child = node_t::make_path_e(e, level - B, tail);
  700|  1.89k|                else
  701|  1.89k|                    return nullptr;
  702|  3.76k|            }
  703|   789k|        } else
  704|  3.12k|            new_child = node_t::make_path_e(e, level - B, tail);
  705|       |
  706|   790k|        if (mutate) {
  ------------------
  |  Branch (706:13): [True: 784k, False: 5.36k]
  ------------------
  707|   784k|            auto count             = new_idx + 1;
  708|   784k|            auto relaxed           = node->ensure_mutable_relaxed_n(e, new_idx);
  709|   784k|            node->inner()[new_idx] = new_child;
  710|   784k|            relaxed->d.sizes[new_idx] = pos.size() + ts;
  711|   784k|            relaxed->d.count          = count;
  712|   784k|            assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (712:13): [True: 784k, False: 0]
  ------------------
  713|   784k|            return node;
  714|   784k|        } else {
  715|  5.36k|            IMMER_TRY {
  ------------------
  |  |   49|  5.36k|#define IMMER_TRY try
  ------------------
  716|  5.36k|                auto count    = new_idx + 1;
  717|  5.36k|                auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx);
  718|  5.36k|                auto relaxed  = new_node->relaxed();
  719|  5.36k|                new_node->inner()[new_idx] = new_child;
  720|  5.36k|                relaxed->d.sizes[new_idx]  = pos.size() + ts;
  721|  5.36k|                relaxed->d.count           = count;
  722|  5.36k|                assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (722:17): [True: 5.36k, False: 0]
  ------------------
  723|  5.36k|                if (Mutating)
  ------------------
  |  Branch (723:21): [True: 5.36k, Folded]
  ------------------
  724|  5.36k|                    pos.visit(dec_visitor{});
  725|  5.36k|                return new_node;
  726|  5.36k|            }
  727|  5.36k|            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.36k|        }
  737|   790k|    }
_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|   620k|    {
  742|   620k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 620k, False: 0]
  ------------------
  743|   620k|        auto node    = pos.node();
  744|   620k|        auto idx     = pos.index(pos.size() - 1);
  745|   620k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|   620k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 620k, Folded]
  |  Branch (746:36): [True: 619k, False: 674]
  ------------------
  747|   620k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 619k, False: 674]
  ------------------
  748|   619k|            node->inner()[new_idx] =
  749|   619k|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 615k, False: 4.69k]
  ------------------
  750|       |                               /* otherwise */
  751|   619k|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|   619k|            return node;
  753|   619k|        } else {
  754|    674|            auto new_parent = node_t::make_inner_e(e);
  755|    674|            IMMER_TRY {
  ------------------
  |  |   49|    674|#define IMMER_TRY try
  ------------------
  756|    674|                new_parent->inner()[new_idx] =
  757|    674|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 310, False: 364]
  ------------------
  758|    674|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|    674|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|    674|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|    674|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 674, Folded]
  ------------------
  763|    674|                    pos.visit(dec_visitor{});
  764|    674|                return new_parent;
  765|    674|            }
  766|    674|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|    674|        }
  771|   620k|    }
_ZN5immer6detail4rbts21push_tail_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EE13visit_regularIRNS1_11regular_posISC_EEJEEEPSC_OT_NSA_5applyIS7_E4type4editESI_DpOT0_:
  741|  9.34M|    {
  742|  9.34M|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 9.34M, False: 0]
  ------------------
  743|  9.34M|        auto node    = pos.node();
  744|  9.34M|        auto idx     = pos.index(pos.size() - 1);
  745|  9.34M|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  9.34M|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 9.34M, Folded]
  |  Branch (746:36): [True: 9.34M, False: 395]
  ------------------
  747|  9.34M|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 9.34M, False: 395]
  ------------------
  748|  9.34M|            node->inner()[new_idx] =
  749|  9.34M|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 7.60M, False: 1.73M]
  ------------------
  750|       |                               /* otherwise */
  751|  9.34M|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|  9.34M|            return node;
  753|  9.34M|        } else {
  754|    395|            auto new_parent = node_t::make_inner_e(e);
  755|    395|            IMMER_TRY {
  ------------------
  |  |   49|    395|#define IMMER_TRY try
  ------------------
  756|    395|                new_parent->inner()[new_idx] =
  757|    395|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 199, False: 196]
  ------------------
  758|    395|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|    395|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|    395|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|    395|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 395, Folded]
  ------------------
  763|    395|                    pos.visit(dec_visitor{});
  764|    395|                return new_parent;
  765|    395|            }
  766|    395|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|    395|        }
  771|  9.34M|    }
_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|  7.59k|    {
  742|  7.59k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 7.59k, False: 0]
  ------------------
  743|  7.59k|        auto node    = pos.node();
  744|  7.59k|        auto idx     = pos.index(pos.size() - 1);
  745|  7.59k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  7.59k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [Folded, False: 7.59k]
  |  Branch (746:36): [True: 0, False: 0]
  ------------------
  747|  7.59k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 0, False: 7.59k]
  ------------------
  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|  7.59k|        } else {
  754|  7.59k|            auto new_parent = node_t::make_inner_e(e);
  755|  7.59k|            IMMER_TRY {
  ------------------
  |  |   49|  7.59k|#define IMMER_TRY try
  ------------------
  756|  7.59k|                new_parent->inner()[new_idx] =
  757|  7.59k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 3.62k, False: 3.96k]
  ------------------
  758|  7.59k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  7.59k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  7.59k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  7.59k|                if (Mutating)
  ------------------
  |  Branch (762:21): [Folded, False: 7.59k]
  ------------------
  763|      0|                    pos.visit(dec_visitor{});
  764|  7.59k|                return new_parent;
  765|  7.59k|            }
  766|  7.59k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  7.59k|        }
  771|  7.59k|    }
_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.4k|    {
  681|  18.4k|        auto node     = pos.node();
  682|  18.4k|        auto level    = pos.shift();
  683|  18.4k|        auto idx      = pos.count() - 1;
  684|  18.4k|        auto children = pos.size(idx);
  685|  18.4k|        auto new_idx =
  686|  18.4k|            children == size_t{1} << level || level == BL ? idx + 1 : idx;
  ------------------
  |  Branch (686:13): [True: 2.17k, False: 16.3k]
  |  Branch (686:47): [True: 215, False: 16.1k]
  ------------------
  687|  18.4k|        auto new_child = static_cast<node_t*>(nullptr);
  688|  18.4k|        auto mutate    = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (688:26): [Folded, False: 18.4k]
  |  Branch (688:38): [True: 0, False: 0]
  ------------------
  689|       |
  690|  18.4k|        if (new_idx >= branches<B>)
  ------------------
  |  Branch (690:13): [True: 761, False: 17.7k]
  ------------------
  691|    761|            return nullptr;
  692|  17.7k|        else if (idx == new_idx) {
  ------------------
  |  Branch (692:18): [True: 16.1k, False: 1.62k]
  ------------------
  693|  16.1k|            new_child =
  694|  16.1k|                mutate ? pos.last_oh_csh(this_t{}, idx, children, e, tail, ts)
  ------------------
  |  Branch (694:17): [True: 0, False: 16.1k]
  ------------------
  695|  16.1k|                       : pos.last_oh_csh(
  696|  16.1k|                             this_no_mut_t{}, idx, children, e, tail, ts);
  697|  16.1k|            if (!new_child) {
  ------------------
  |  Branch (697:17): [True: 1.51k, False: 14.5k]
  ------------------
  698|  1.51k|                if (++new_idx < branches<B>)
  ------------------
  |  Branch (698:21): [True: 256, False: 1.26k]
  ------------------
  699|    256|                    new_child = node_t::make_path_e(e, level - B, tail);
  700|  1.26k|                else
  701|  1.26k|                    return nullptr;
  702|  1.51k|            }
  703|  16.1k|        } else
  704|  1.62k|            new_child = node_t::make_path_e(e, level - B, tail);
  705|       |
  706|  16.4k|        if (mutate) {
  ------------------
  |  Branch (706:13): [True: 0, False: 16.4k]
  ------------------
  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.4k|        } else {
  715|  16.4k|            IMMER_TRY {
  ------------------
  |  |   49|  16.4k|#define IMMER_TRY try
  ------------------
  716|  16.4k|                auto count    = new_idx + 1;
  717|  16.4k|                auto new_node = node_t::copy_inner_r_e(e, pos.node(), new_idx);
  718|  16.4k|                auto relaxed  = new_node->relaxed();
  719|  16.4k|                new_node->inner()[new_idx] = new_child;
  720|  16.4k|                relaxed->d.sizes[new_idx]  = pos.size() + ts;
  721|  16.4k|                relaxed->d.count           = count;
  722|  16.4k|                assert(relaxed->d.sizes[new_idx]);
  ------------------
  |  Branch (722:17): [True: 16.4k, False: 0]
  ------------------
  723|  16.4k|                if (Mutating)
  ------------------
  |  Branch (723:21): [Folded, False: 16.4k]
  ------------------
  724|      0|                    pos.visit(dec_visitor{});
  725|  16.4k|                return new_node;
  726|  16.4k|            }
  727|  16.4k|            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.4k|        }
  737|  16.4k|    }
_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.98k|    {
  742|  2.98k|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 2.98k, False: 0]
  ------------------
  743|  2.98k|        auto node    = pos.node();
  744|  2.98k|        auto idx     = pos.index(pos.size() - 1);
  745|  2.98k|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  2.98k|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [Folded, False: 2.98k]
  |  Branch (746:36): [True: 0, False: 0]
  ------------------
  747|  2.98k|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 0, False: 2.98k]
  ------------------
  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.98k|        } else {
  754|  2.98k|            auto new_parent = node_t::make_inner_e(e);
  755|  2.98k|            IMMER_TRY {
  ------------------
  |  |   49|  2.98k|#define IMMER_TRY try
  ------------------
  756|  2.98k|                new_parent->inner()[new_idx] =
  757|  2.98k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 1.71k, False: 1.26k]
  ------------------
  758|  2.98k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  2.98k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  2.98k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  2.98k|                if (Mutating)
  ------------------
  |  Branch (762:21): [Folded, False: 2.98k]
  ------------------
  763|      0|                    pos.visit(dec_visitor{});
  764|  2.98k|                return new_parent;
  765|  2.98k|            }
  766|  2.98k|            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.98k|        }
  771|  2.98k|    }
_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.14M|    {
  742|  1.14M|        assert((pos.size() & mask<BL>) == 0);
  ------------------
  |  Branch (742:9): [True: 1.14M, False: 0]
  ------------------
  743|  1.14M|        auto node    = pos.node();
  744|  1.14M|        auto idx     = pos.index(pos.size() - 1);
  745|  1.14M|        auto new_idx = pos.index(pos.size() + branches<BL> - 1);
  746|  1.14M|        auto mutate  = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (746:24): [True: 1.14M, Folded]
  |  Branch (746:36): [True: 1.13M, False: 3.93k]
  ------------------
  747|  1.14M|        if (mutate) {
  ------------------
  |  Branch (747:13): [True: 1.13M, False: 3.93k]
  ------------------
  748|  1.13M|            node->inner()[new_idx] =
  749|  1.13M|                idx == new_idx ? pos.last_oh(this_t{}, idx, e, tail)
  ------------------
  |  Branch (749:17): [True: 1.12M, False: 11.7k]
  ------------------
  750|       |                               /* otherwise */
  751|  1.13M|                               : node_t::make_path_e(e, pos.shift() - B, tail);
  752|  1.13M|            return node;
  753|  1.13M|        } else {
  754|  3.93k|            auto new_parent = node_t::make_inner_e(e);
  755|  3.93k|            IMMER_TRY {
  ------------------
  |  |   49|  3.93k|#define IMMER_TRY try
  ------------------
  756|  3.93k|                new_parent->inner()[new_idx] =
  757|  3.93k|                    idx == new_idx
  ------------------
  |  Branch (757:21): [True: 1.73k, False: 2.19k]
  ------------------
  758|  3.93k|                        ? pos.last_oh(this_no_mut_t{}, idx, e, tail)
  759|       |                        /* otherwise */
  760|  3.93k|                        : node_t::make_path_e(e, pos.shift() - B, tail);
  761|  3.93k|                node_t::do_copy_inner(new_parent, node, new_idx);
  762|  3.93k|                if (Mutating)
  ------------------
  |  Branch (762:21): [True: 3.93k, Folded]
  ------------------
  763|  3.93k|                    pos.visit(dec_visitor{});
  764|  3.93k|                return new_parent;
  765|  3.93k|            }
  766|  3.93k|            IMMER_CATCH (...) {
  767|      0|                node_t::delete_inner_e(new_parent);
  768|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  769|      0|            }
  770|  3.93k|        }
  771|  1.14M|    }
_ZN5immer6detail4rbts17dec_empty_regularINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEvPT_:
  580|  5.13k|{
  581|  5.13k|    make_empty_regular_pos(node).visit(dec_visitor());
  582|  5.13k|}
_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|  21.9k|    {
  596|  21.9k|        auto offset = pos.index(idx);
  597|  21.9k|        auto count  = pos.count();
  598|  21.9k|        auto node   = pos.node();
  599|  21.9k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (599:13): [True: 4.67k, False: 17.2k]
  ------------------
  600|  4.67k|            return pos.towards_oh(
  601|  4.67k|                this_t{}, idx, offset, e, &node->inner()[offset]);
  602|  17.2k|        } else {
  603|  17.2k|            auto new_node = node_t::copy_inner_sr_e(e, node, count);
  604|  17.2k|            IMMER_TRY {
  ------------------
  |  |   49|  17.2k|#define IMMER_TRY try
  ------------------
  605|  17.2k|                auto& res = pos.towards_oh(
  606|  17.2k|                    this_t{}, idx, offset, e, &new_node->inner()[offset]);
  607|  17.2k|                pos.visit(dec_visitor{});
  608|  17.2k|                *location = new_node;
  609|  17.2k|                return res;
  610|  17.2k|            }
  611|  17.2k|            IMMER_CATCH (...) {
  612|      0|                dec_relaxed(new_node, pos.shift());
  613|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  614|      0|            }
  615|  17.2k|        }
  616|  21.9k|    }
_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.18k|    {
  653|  3.18k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 3.18k, False: 0]
  ------------------
  654|  3.18k|        auto node = pos.node();
  655|  3.18k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 609, False: 2.57k]
  ------------------
  656|    609|            return node->leaf()[pos.index(idx)];
  657|  2.57k|        } else {
  658|  2.57k|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|  2.57k|            pos.visit(dec_visitor{});
  660|  2.57k|            *location = new_node;
  661|  2.57k|            return new_node->leaf()[pos.index(idx)];
  662|  2.57k|        }
  663|  3.18k|    }
_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|  6.39k|    {
  622|  6.39k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 6.39k, False: 0]
  ------------------
  623|  6.39k|        auto offset = pos.index(idx);
  624|  6.39k|        auto count  = pos.count();
  625|  6.39k|        auto node   = pos.node();
  626|  6.39k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 2.44k, False: 3.95k]
  ------------------
  627|  2.44k|            return pos.towards_oh_ch(
  628|  2.44k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  3.95k|        } else {
  630|  3.95k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  3.95k|            IMMER_TRY {
  ------------------
  |  |   49|  3.95k|#define IMMER_TRY try
  ------------------
  632|  3.95k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  3.95k|                                              idx,
  634|  3.95k|                                              offset,
  635|  3.95k|                                              count,
  636|  3.95k|                                              e,
  637|  3.95k|                                              &new_node->inner()[offset]);
  638|  3.95k|                pos.visit(dec_visitor{});
  639|  3.95k|                *location = new_node;
  640|  3.95k|                return res;
  641|  3.95k|            }
  642|  3.95k|            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|  3.95k|        }
  647|  6.39k|    }
_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|  4.92k|    {
  653|  4.92k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 4.92k, False: 0]
  ------------------
  654|  4.92k|        auto node = pos.node();
  655|  4.92k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 1.25k, False: 3.66k]
  ------------------
  656|  1.25k|            return node->leaf()[pos.index(idx)];
  657|  3.66k|        } else {
  658|  3.66k|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|  3.66k|            pos.visit(dec_visitor{});
  660|  3.66k|            *location = new_node;
  661|  3.66k|            return new_node->leaf()[pos.index(idx)];
  662|  3.66k|        }
  663|  4.92k|    }
_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|  5.58k|    {
  622|  5.58k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 5.58k, False: 0]
  ------------------
  623|  5.58k|        auto offset = pos.index(idx);
  624|  5.58k|        auto count  = pos.count();
  625|  5.58k|        auto node   = pos.node();
  626|  5.58k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 1.14k, False: 4.43k]
  ------------------
  627|  1.14k|            return pos.towards_oh_ch(
  628|  1.14k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  4.43k|        } else {
  630|  4.43k|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|  4.43k|            IMMER_TRY {
  ------------------
  |  |   49|  4.43k|#define IMMER_TRY try
  ------------------
  632|  4.43k|                auto& res = pos.towards_oh_ch(this_t{},
  633|  4.43k|                                              idx,
  634|  4.43k|                                              offset,
  635|  4.43k|                                              count,
  636|  4.43k|                                              e,
  637|  4.43k|                                              &new_node->inner()[offset]);
  638|  4.43k|                pos.visit(dec_visitor{});
  639|  4.43k|                *location = new_node;
  640|  4.43k|                return res;
  641|  4.43k|            }
  642|  4.43k|            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.43k|        }
  647|  5.58k|    }
_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.47k|    {
  653|  1.47k|        assert(pos.node() == *location);
  ------------------
  |  Branch (653:9): [True: 1.47k, False: 0]
  ------------------
  654|  1.47k|        auto node = pos.node();
  655|  1.47k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (655:13): [True: 914, False: 562]
  ------------------
  656|    914|            return node->leaf()[pos.index(idx)];
  657|    914|        } else {
  658|    562|            auto new_node = node_t::copy_leaf_e(e, pos.node(), pos.count());
  659|    562|            pos.visit(dec_visitor{});
  660|    562|            *location = new_node;
  661|    562|            return new_node->leaf()[pos.index(idx)];
  662|    562|        }
  663|  1.47k|    }
_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.24k|    {
  622|  2.24k|        assert(pos.node() == *location);
  ------------------
  |  Branch (622:9): [True: 2.24k, False: 0]
  ------------------
  623|  2.24k|        auto offset = pos.index(idx);
  624|  2.24k|        auto count  = pos.count();
  625|  2.24k|        auto node   = pos.node();
  626|  2.24k|        if (node->can_mutate(e)) {
  ------------------
  |  Branch (626:13): [True: 1.42k, False: 812]
  ------------------
  627|  1.42k|            return pos.towards_oh_ch(
  628|  1.42k|                this_t{}, idx, offset, count, e, &node->inner()[offset]);
  629|  1.42k|        } else {
  630|    812|            auto new_node = node_t::copy_inner_e(e, node, count);
  631|    812|            IMMER_TRY {
  ------------------
  |  |   49|    812|#define IMMER_TRY try
  ------------------
  632|    812|                auto& res = pos.towards_oh_ch(this_t{},
  633|    812|                                              idx,
  634|    812|                                              offset,
  635|    812|                                              count,
  636|    812|                                              e,
  637|    812|                                              &new_node->inner()[offset]);
  638|    812|                pos.visit(dec_visitor{});
  639|    812|                *location = new_node;
  640|    812|                return res;
  641|    812|            }
  642|    812|            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|    812|        }
  647|  2.24k|    }
_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.7k, False: 7.51k]
  ------------------
  917|  52.2k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [True: 52.2k, Folded]
  |  Branch (917:25): [True: 40.2k, False: 11.9k]
  ------------------
  918|  40.2k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 35.0k, False: 5.27k]
  ------------------
  919|  40.2k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|  40.2k|            if (Mutating)
  ------------------
  |  Branch (920:17): [True: 40.2k, Folded]
  ------------------
  921|  40.2k|                pos.visit(dec_right_visitor{}, count_t{1});
  922|  40.2k|            return res;
  923|  40.2k|        } else {
  924|  11.9k|            using std::get;
  925|  11.9k|            auto subs =
  926|  11.9k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 9.68k, False: 2.23k]
  ------------------
  927|  11.9k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  11.9k|            auto next = get<1>(subs);
  929|  11.9k|            auto ts   = get<2>(subs);
  930|  11.9k|            auto tail = get<3>(subs);
  931|  11.9k|            IMMER_TRY {
  ------------------
  |  |   49|  11.9k|#define IMMER_TRY try
  ------------------
  932|  11.9k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 8.25k, False: 3.66k]
  ------------------
  933|  8.25k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 6.72k, False: 1.53k]
  ------------------
  934|  6.72k|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|  6.72k|                        pos.each_right(dec_visitor{}, idx + 1);
  936|  6.72k|                        node->inner()[idx] = next;
  937|  6.72k|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|  6.72k|                        nodr->d.count      = idx + 1;
  939|  6.72k|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 6.72k, False: 0]
  ------------------
  940|  6.72k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  6.72k|                    } else {
  942|  1.53k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  1.53k|                        auto newr = newn->relaxed();
  944|  1.53k|                        newn->inner()[idx] = next;
  945|  1.53k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  1.53k|                        newr->d.count      = idx + 1;
  947|  1.53k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 1.53k, False: 0]
  ------------------
  948|  1.53k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [True: 1.53k, Folded]
  ------------------
  949|  1.53k|                            pos.visit(dec_visitor{});
  950|  1.53k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  1.53k|                    }
  952|  8.25k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 0, False: 3.66k]
  ------------------
  953|      0|                    if (Mutating)
  ------------------
  |  Branch (953:25): [True: 0, Folded]
  ------------------
  954|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|      0|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  3.66k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [True: 3.66k, Folded]
  |  Branch (956:40): [True: 2.61k, False: 1.05k]
  |  Branch (956:52): [True: 1.61k, False: 996]
  ------------------
  957|  1.61k|                    auto newn = pos.node()->inner()[0];
  958|  1.61k|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 261, False: 1.35k]
  ------------------
  959|    261|                        newn->inc();
  960|  1.61k|                    if (Mutating)
  ------------------
  |  Branch (960:25): [True: 1.61k, Folded]
  ------------------
  961|  1.61k|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|  1.61k|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|  2.04k|                } else {
  964|  2.04k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 1.60k, False: 445]
  ------------------
  965|  1.60k|                        pos.each_right(dec_visitor{}, idx + 1);
  966|  1.60k|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|  1.60k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  1.60k|                    } else {
  969|    445|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    445|                        if (Mutating)
  ------------------
  |  Branch (970:29): [True: 445, Folded]
  ------------------
  971|    445|                            pos.visit(dec_visitor{});
  972|    445|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    445|                    }
  974|  2.04k|                }
  975|  11.9k|            }
  976|  11.9k|            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.9k|        }
  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.29k|    {
 1060|  2.29k|        auto old_tail_size = pos.count();
 1061|  2.29k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.29k|        auto node          = pos.node();
 1063|  2.29k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.29k, Folded]
  |  Branch (1063:42): [True: 1.50k, False: 794]
  ------------------
 1064|  2.29k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.71k, False: 581]
  ------------------
 1065|  1.71k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.71k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.71k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.71k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 316, False: 265]
  ------------------
 1069|    316|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    316|                              old_tail_size - new_tail_size);
 1071|    316|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    316|        } else {
 1073|    265|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    265|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 265, Folded]
  ------------------
 1075|    265|                pos.visit(dec_visitor{});
 1076|    265|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    265|        }
 1078|  2.29k|    }
_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.05k|    {
 1060|  1.05k|        auto old_tail_size = pos.count();
 1061|  1.05k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.05k|        auto node          = pos.node();
 1063|  1.05k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 1.05k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  1.05k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 285, False: 765]
  ------------------
 1065|    285|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 285, Folded]
  ------------------
 1066|    285|                node->inc();
 1067|    285|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    765|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 765]
  ------------------
 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|    765|        } else {
 1073|    765|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    765|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 765]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    765|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    765|        }
 1078|  1.05k|    }
_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|  21.3k|    {
  914|  21.3k|        auto idx    = pos.index(last);
  915|  21.3k|        auto node   = pos.node();
  916|  21.3k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [Folded, False: 21.3k]
  |  Branch (916:35): [True: 0, False: 0]
  ------------------
  917|  21.3k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [True: 21.3k, Folded]
  |  Branch (917:25): [True: 18.2k, False: 3.10k]
  ------------------
  918|  18.2k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (918:24): [True: 0, False: 18.2k]
  ------------------
  919|  18.2k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  920|  18.2k|            if (Mutating)
  ------------------
  |  Branch (920:17): [Folded, False: 18.2k]
  ------------------
  921|      0|                pos.visit(dec_right_visitor{}, count_t{1});
  922|  18.2k|            return res;
  923|  18.2k|        } else {
  924|  3.10k|            using std::get;
  925|  3.10k|            auto subs =
  926|  3.10k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 0, False: 3.10k]
  ------------------
  927|  3.10k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  3.10k|            auto next = get<1>(subs);
  929|  3.10k|            auto ts   = get<2>(subs);
  930|  3.10k|            auto tail = get<3>(subs);
  931|  3.10k|            IMMER_TRY {
  ------------------
  |  |   49|  3.10k|#define IMMER_TRY try
  ------------------
  932|  3.10k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 1.46k, False: 1.64k]
  ------------------
  933|  1.46k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 0, False: 1.46k]
  ------------------
  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.46k|                    } else {
  942|  1.46k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  1.46k|                        auto newr = newn->relaxed();
  944|  1.46k|                        newn->inner()[idx] = next;
  945|  1.46k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  1.46k|                        newr->d.count      = idx + 1;
  947|  1.46k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 1.46k, False: 0]
  ------------------
  948|  1.46k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [Folded, False: 1.46k]
  ------------------
  949|      0|                            pos.visit(dec_visitor{});
  950|  1.46k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  1.46k|                    }
  952|  1.64k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 0, False: 1.64k]
  ------------------
  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.64k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [True: 1.64k, Folded]
  |  Branch (956:40): [True: 986, False: 658]
  |  Branch (956:52): [True: 670, False: 316]
  ------------------
  957|    670|                    auto newn = pos.node()->inner()[0];
  958|    670|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 670, False: 0]
  ------------------
  959|    670|                        newn->inc();
  960|    670|                    if (Mutating)
  ------------------
  |  Branch (960:25): [Folded, False: 670]
  ------------------
  961|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|    670|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|    974|                } else {
  964|    974|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 0, False: 974]
  ------------------
  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|    974|                    } else {
  969|    974|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    974|                        if (Mutating)
  ------------------
  |  Branch (970:29): [Folded, False: 974]
  ------------------
  971|      0|                            pos.visit(dec_visitor{});
  972|    974|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    974|                    }
  974|    974|                }
  975|  3.10k|            }
  976|  3.10k|            IMMER_CATCH (...) {
  977|      0|                assert(!mutate);
  ------------------
  |  Branch (977:17): [True: 0, False: 0]
  ------------------
  978|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  |  Branch (978:17): [True: 0, False: 0]
  ------------------
  979|      0|                if (next)
  ------------------
  |  Branch (979:21): [True: 0, False: 0]
  ------------------
  980|      0|                    dec_inner(next,
  981|      0|                              pos.shift() - B,
  982|      0|                              last + 1 - ts - pos.size_before(idx));
  983|      0|                dec_leaf(tail, ts);
  984|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  985|      0|            }
  986|  3.10k|        }
  987|  21.3k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb0EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  1.11k|    {
  992|  1.11k|        auto idx    = pos.index(last);
  993|  1.11k|        auto node   = pos.node();
  994|  1.11k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 1.11k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  1.11k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 1.11k, Folded]
  |  Branch (995:25): [True: 304, False: 812]
  ------------------
  996|    304|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 304]
  ------------------
  997|    304|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|    304|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 304]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|    304|            return res;
 1001|    812|        } else {
 1002|    812|            using std::get;
 1003|    812|            auto subs =
 1004|    812|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 812]
  ------------------
 1005|    812|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|    812|            auto next = get<1>(subs);
 1007|    812|            auto ts   = get<2>(subs);
 1008|    812|            auto tail = get<3>(subs);
 1009|    812|            IMMER_TRY {
  ------------------
  |  |   49|    812|#define IMMER_TRY try
  ------------------
 1010|    812|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 224, False: 588]
  ------------------
 1011|    224|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 224]
  ------------------
 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|    224|                    } else {
 1016|    224|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    224|                        newn->inner()[idx] = next;
 1018|    224|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 224]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    224|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    224|                    }
 1022|    588|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 588]
  ------------------
 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|    588|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 588, Folded]
  |  Branch (1026:40): [True: 390, False: 198]
  |  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|    394|                } else {
 1034|    394|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 394]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    394|                    } else {
 1038|    394|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    394|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 394]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    394|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    394|                    }
 1043|    394|                }
 1044|    812|            }
 1045|    812|            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|    812|        }
 1055|  1.11k|    }
_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.72k|    {
 1060|  1.72k|        auto old_tail_size = pos.count();
 1061|  1.72k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.72k|        auto node          = pos.node();
 1063|  1.72k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 1.72k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  1.72k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 892, False: 835]
  ------------------
 1065|    892|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 892, Folded]
  ------------------
 1066|    892|                node->inc();
 1067|    892|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    892|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 835]
  ------------------
 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|    835|        } else {
 1073|    835|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    835|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 835]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    835|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    835|        }
 1078|  1.72k|    }
_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.83k|    {
  992|  3.83k|        auto idx    = pos.index(last);
  993|  3.83k|        auto node   = pos.node();
  994|  3.83k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 3.83k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  3.83k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 3.83k, Folded]
  |  Branch (995:25): [True: 2.55k, False: 1.27k]
  ------------------
  996|  2.55k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 0, False: 2.55k]
  ------------------
  997|  2.55k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  2.55k|            if (Mutating)
  ------------------
  |  Branch (998:17): [Folded, False: 2.55k]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  2.55k|            return res;
 1001|  2.55k|        } else {
 1002|  1.27k|            using std::get;
 1003|  1.27k|            auto subs =
 1004|  1.27k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 1.27k]
  ------------------
 1005|  1.27k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.27k|            auto next = get<1>(subs);
 1007|  1.27k|            auto ts   = get<2>(subs);
 1008|  1.27k|            auto tail = get<3>(subs);
 1009|  1.27k|            IMMER_TRY {
  ------------------
  |  |   49|  1.27k|#define IMMER_TRY try
  ------------------
 1010|  1.27k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 430, False: 846]
  ------------------
 1011|    430|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 430]
  ------------------
 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|    430|                    } else {
 1016|    430|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    430|                        newn->inner()[idx] = next;
 1018|    430|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 430]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    430|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    430|                    }
 1022|    846|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 846]
  ------------------
 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|    846|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 846, Folded]
  |  Branch (1026:40): [True: 625, False: 221]
  |  Branch (1026:52): [True: 259, False: 366]
  ------------------
 1027|    259|                    auto newn = pos.node()->inner()[0];
 1028|    259|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 259, False: 0]
  ------------------
 1029|    259|                        newn->inc();
 1030|    259|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 259]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    259|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    587|                } else {
 1034|    587|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 587]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    587|                    } else {
 1038|    587|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    587|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 587]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    587|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    587|                    }
 1043|    587|                }
 1044|  1.27k|            }
 1045|  1.27k|            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.27k|        }
 1055|  3.83k|    }
_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.52k|    {
 1060|  2.52k|        auto old_tail_size = pos.count();
 1061|  2.52k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.52k|        auto node          = pos.node();
 1063|  2.52k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.52k, Folded]
  |  Branch (1063:42): [True: 1.14k, False: 1.37k]
  ------------------
 1064|  2.52k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.10k, False: 1.42k]
  ------------------
 1065|  1.10k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.10k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.10k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.42k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 643, False: 780]
  ------------------
 1069|    643|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    643|                              old_tail_size - new_tail_size);
 1071|    643|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    780|        } else {
 1073|    780|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    780|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 780, Folded]
  ------------------
 1075|    780|                pos.visit(dec_visitor{});
 1076|    780|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    780|        }
 1078|  2.52k|    }
_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|  2.75k|    {
  992|  2.75k|        auto idx    = pos.index(last);
  993|  2.75k|        auto node   = pos.node();
  994|  2.75k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 2.75k, Folded]
  |  Branch (994:35): [True: 825, False: 1.93k]
  ------------------
  995|  2.75k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 2.75k]
  |  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|  2.75k|        } else {
 1002|  2.75k|            using std::get;
 1003|  2.75k|            auto subs =
 1004|  2.75k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 825, False: 1.93k]
  ------------------
 1005|  2.75k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  2.75k|            auto next = get<1>(subs);
 1007|  2.75k|            auto ts   = get<2>(subs);
 1008|  2.75k|            auto tail = get<3>(subs);
 1009|  2.75k|            IMMER_TRY {
  ------------------
  |  |   49|  2.75k|#define IMMER_TRY try
  ------------------
 1010|  2.75k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 676, False: 2.08k]
  ------------------
 1011|    676|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 323, False: 353]
  ------------------
 1012|    323|                        node->inner()[idx] = next;
 1013|    323|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    323|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    353|                    } else {
 1016|    353|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    353|                        newn->inner()[idx] = next;
 1018|    353|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 353, Folded]
  ------------------
 1019|    353|                            pos.visit(dec_visitor{});
 1020|    353|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    353|                    }
 1022|  2.08k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 217, False: 1.86k]
  ------------------
 1023|    217|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 217, Folded]
  ------------------
 1024|    217|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    217|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.86k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 1.86k]
  |  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.86k|                } else {
 1034|  1.86k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 495, False: 1.37k]
  ------------------
 1035|    495|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    495|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  1.37k|                    } else {
 1038|  1.37k|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|  1.37k|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 1.37k, Folded]
  ------------------
 1040|  1.37k|                            pos.visit(dec_visitor{});
 1041|  1.37k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|  1.37k|                    }
 1043|  1.86k|                }
 1044|  2.75k|            }
 1045|  2.75k|            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.75k|        }
 1055|  2.75k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_regularIRNS1_8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  878|  1.75k|    {
  879|  1.75k|        using node_t = node_type<Pos>;
  880|  1.75k|        auto node    = p.node();
  881|  1.75k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 1.75k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  1.75k|    }
_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|  7.47k|    {
 1060|  7.47k|        auto old_tail_size = pos.count();
 1061|  7.47k|        auto new_tail_size = pos.index(last) + 1;
 1062|  7.47k|        auto node          = pos.node();
 1063|  7.47k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 7.47k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  7.47k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 3.42k, False: 4.05k]
  ------------------
 1065|  3.42k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 3.42k, Folded]
  ------------------
 1066|  3.42k|                node->inc();
 1067|  3.42k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  4.05k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 4.05k]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  4.05k|        } else {
 1073|  4.05k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  4.05k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 4.05k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  4.05k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  4.05k|        }
 1078|  7.47k|    }
_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|  3.97k|    {
  992|  3.97k|        auto idx    = pos.index(last);
  993|  3.97k|        auto node   = pos.node();
  994|  3.97k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 3.97k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  3.97k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 3.97k]
  |  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|  3.97k|        } else {
 1002|  3.97k|            using std::get;
 1003|  3.97k|            auto subs =
 1004|  3.97k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 3.97k]
  ------------------
 1005|  3.97k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  3.97k|            auto next = get<1>(subs);
 1007|  3.97k|            auto ts   = get<2>(subs);
 1008|  3.97k|            auto tail = get<3>(subs);
 1009|  3.97k|            IMMER_TRY {
  ------------------
  |  |   49|  3.97k|#define IMMER_TRY try
  ------------------
 1010|  3.97k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 654, False: 3.31k]
  ------------------
 1011|    654|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 654]
  ------------------
 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|    654|                    } else {
 1016|    654|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    654|                        newn->inner()[idx] = next;
 1018|    654|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 654]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    654|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    654|                    }
 1022|  3.31k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.03k, False: 2.28k]
  ------------------
 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|  2.28k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 2.28k]
  |  Branch (1026:40): [True: 0, False: 0]
  |  Branch (1026:52): [True: 0, False: 0]
  ------------------
 1027|      0|                    auto newn = pos.node()->inner()[0];
 1028|      0|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 0, False: 0]
  ------------------
 1029|      0|                        newn->inc();
 1030|      0|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [Folded, False: 0]
  ------------------
 1031|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  2.28k|                } else {
 1034|  2.28k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 2.28k]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|  2.28k|                    } else {
 1038|  2.28k|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|  2.28k|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 2.28k]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|  2.28k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|  2.28k|                    }
 1043|  2.28k|                }
 1044|  3.97k|            }
 1045|  3.97k|            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.97k|        }
 1055|  3.97k|    }
_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|    783|    {
 1060|    783|        auto old_tail_size = pos.count();
 1061|    783|        auto new_tail_size = pos.index(last) + 1;
 1062|    783|        auto node          = pos.node();
 1063|    783|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 783]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|    783|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 344, False: 439]
  ------------------
 1065|    344|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 344, Folded]
  ------------------
 1066|    344|                node->inc();
 1067|    344|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    439|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 439]
  ------------------
 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|    439|        } else {
 1073|    439|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    439|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 439]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|    439|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    439|        }
 1078|    783|    }
_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.35k|    {
 1060|  2.35k|        auto old_tail_size = pos.count();
 1061|  2.35k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.35k|        auto node          = pos.node();
 1063|  2.35k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 2.35k, Folded]
  |  Branch (1063:42): [True: 1.00k, False: 1.35k]
  ------------------
 1064|  2.35k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.41k, False: 947]
  ------------------
 1065|  1.41k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 1.41k]
  ------------------
 1066|      0|                node->inc();
 1067|  1.41k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.41k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 445, False: 502]
  ------------------
 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|    502|        } else {
 1073|    502|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    502|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 502, Folded]
  ------------------
 1075|    502|                pos.visit(dec_visitor{});
 1076|    502|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    502|        }
 1078|  2.35k|    }
_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|  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: 2.87k, False: 452]
  ------------------
  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: 2.87k, False: 452]
  ------------------
 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: 1.10k, False: 2.21k]
  ------------------
 1011|  1.10k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 909, False: 198]
  ------------------
 1012|    909|                        node->inner()[idx] = next;
 1013|    909|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    909|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    909|                    } else {
 1016|    198|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    198|                        newn->inner()[idx] = next;
 1018|    198|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 198, Folded]
  ------------------
 1019|    198|                            pos.visit(dec_visitor{});
 1020|    198|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    198|                    }
 1022|  2.21k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.03k, False: 1.18k]
  ------------------
 1023|  1.03k|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 1.03k, Folded]
  ------------------
 1024|  1.03k|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|  1.03k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.18k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 1.18k]
  |  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.18k|                } else {
 1034|  1.18k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 989, False: 195]
  ------------------
 1035|    989|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    989|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    989|                    } else {
 1038|    195|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    195|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 195, Folded]
  ------------------
 1040|    195|                            pos.visit(dec_visitor{});
 1041|    195|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    195|                    }
 1043|  1.18k|                }
 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_11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  878|  1.03k|    {
  879|  1.03k|        using node_t = node_type<Pos>;
  880|  1.03k|        auto node    = p.node();
  881|  1.03k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 1.03k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  1.03k|    }
_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.54k|    {
 1060|  2.54k|        auto old_tail_size = pos.count();
 1061|  2.54k|        auto new_tail_size = pos.index(last) + 1;
 1062|  2.54k|        auto node          = pos.node();
 1063|  2.54k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 2.54k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  2.54k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 894, False: 1.65k]
  ------------------
 1065|    894|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 894, Folded]
  ------------------
 1066|    894|                node->inc();
 1067|    894|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  1.65k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 1.65k]
  ------------------
 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.65k|        } else {
 1073|  1.65k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  1.65k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 1.65k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  1.65k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  1.65k|        }
 1078|  2.54k|    }
_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.37k|    {
  992|  2.37k|        auto idx    = pos.index(last);
  993|  2.37k|        auto node   = pos.node();
  994|  2.37k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 2.37k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  2.37k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 2.37k]
  |  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.37k|        } else {
 1002|  2.37k|            using std::get;
 1003|  2.37k|            auto subs =
 1004|  2.37k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 2.37k]
  ------------------
 1005|  2.37k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  2.37k|            auto next = get<1>(subs);
 1007|  2.37k|            auto ts   = get<2>(subs);
 1008|  2.37k|            auto tail = get<3>(subs);
 1009|  2.37k|            IMMER_TRY {
  ------------------
  |  |   49|  2.37k|#define IMMER_TRY try
  ------------------
 1010|  2.37k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 584, False: 1.78k]
  ------------------
 1011|    584|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 584]
  ------------------
 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|    584|                    } else {
 1016|    584|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    584|                        newn->inner()[idx] = next;
 1018|    584|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 584]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    584|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    584|                    }
 1022|  1.78k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 1.01k, False: 771]
  ------------------
 1023|  1.01k|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 1.01k]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|  1.01k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.01k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 771]
  |  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|    771|                } else {
 1034|    771|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 771]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    771|                    } else {
 1038|    771|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    771|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 771]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    771|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    771|                    }
 1043|    771|                }
 1044|  2.37k|            }
 1045|  2.37k|            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.37k|        }
 1055|  2.37k|    }
_ZN5immer6detail4rbts17dec_right_visitor13visit_relaxedIRNS1_11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEEEvOT_j:
  867|  43.2k|    {
  868|  43.2k|        using node_t = node_type<Pos>;
  869|  43.2k|        auto node    = p.node();
  870|  43.2k|        if (node->dec()) {
  ------------------
  |  Branch (870:13): [True: 0, False: 43.2k]
  ------------------
  871|      0|            p.each_right(dec_t{}, idx);
  872|      0|            node_t::delete_inner_r(node, p.count());
  873|      0|        }
  874|  43.2k|    }
_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|  5.07k|    {
 1060|  5.07k|        auto old_tail_size = pos.count();
 1061|  5.07k|        auto new_tail_size = pos.index(last) + 1;
 1062|  5.07k|        auto node          = pos.node();
 1063|  5.07k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 5.07k, Folded]
  |  Branch (1063:42): [True: 2.01k, False: 3.05k]
  ------------------
 1064|  5.07k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 2.96k, False: 2.10k]
  ------------------
 1065|  2.96k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 2.96k]
  ------------------
 1066|      0|                node->inc();
 1067|  2.96k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  2.96k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 1.06k, False: 1.03k]
  ------------------
 1069|  1.06k|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|  1.06k|                              old_tail_size - new_tail_size);
 1071|  1.06k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  1.06k|        } else {
 1073|  1.03k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  1.03k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 1.03k, Folded]
  ------------------
 1075|  1.03k|                pos.visit(dec_visitor{});
 1076|  1.03k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  1.03k|        }
 1078|  5.07k|    }
_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.6k|    {
  914|  11.6k|        auto idx    = pos.index(last);
  915|  11.6k|        auto node   = pos.node();
  916|  11.6k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [True: 11.6k, Folded]
  |  Branch (916:35): [True: 9.75k, False: 1.85k]
  ------------------
  917|  11.6k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [Folded, False: 11.6k]
  |  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.6k|        } else {
  924|  11.6k|            using std::get;
  925|  11.6k|            auto subs =
  926|  11.6k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 9.75k, False: 1.85k]
  ------------------
  927|  11.6k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  11.6k|            auto next = get<1>(subs);
  929|  11.6k|            auto ts   = get<2>(subs);
  930|  11.6k|            auto tail = get<3>(subs);
  931|  11.6k|            IMMER_TRY {
  ------------------
  |  |   49|  11.6k|#define IMMER_TRY try
  ------------------
  932|  11.6k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 6.55k, False: 5.05k]
  ------------------
  933|  6.55k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 5.59k, False: 958]
  ------------------
  934|  5.59k|                        auto nodr = node->ensure_mutable_relaxed_n(e, idx);
  935|  5.59k|                        pos.each_right(dec_visitor{}, idx + 1);
  936|  5.59k|                        node->inner()[idx] = next;
  937|  5.59k|                        nodr->d.sizes[idx] = last + 1 - ts;
  938|  5.59k|                        nodr->d.count      = idx + 1;
  939|  5.59k|                        assert(nodr->d.sizes[idx]);
  ------------------
  |  Branch (939:25): [True: 5.59k, False: 0]
  ------------------
  940|  5.59k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  941|  5.59k|                    } else {
  942|    958|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|    958|                        auto newr = newn->relaxed();
  944|    958|                        newn->inner()[idx] = next;
  945|    958|                        newr->d.sizes[idx] = last + 1 - ts;
  946|    958|                        newr->d.count      = idx + 1;
  947|    958|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 958, False: 0]
  ------------------
  948|    958|                        if (Mutating)
  ------------------
  |  Branch (948:29): [True: 958, Folded]
  ------------------
  949|    958|                            pos.visit(dec_visitor{});
  950|    958|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|    958|                    }
  952|  6.55k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 1.30k, False: 3.75k]
  ------------------
  953|  1.30k|                    if (Mutating)
  ------------------
  |  Branch (953:25): [True: 1.30k, Folded]
  ------------------
  954|  1.30k|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|  1.30k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  3.75k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [Folded, False: 3.75k]
  |  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.75k|                } else {
  964|  3.75k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 3.07k, False: 679]
  ------------------
  965|  3.07k|                        pos.each_right(dec_visitor{}, idx + 1);
  966|  3.07k|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|  3.07k|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  3.07k|                    } else {
  969|    679|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|    679|                        if (Mutating)
  ------------------
  |  Branch (970:29): [True: 679, Folded]
  ------------------
  971|    679|                            pos.visit(dec_visitor{});
  972|    679|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|    679|                    }
  974|  3.75k|                }
  975|  11.6k|            }
  976|  11.6k|            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.6k|        }
  987|  11.6k|    }
_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|  2.75k|    {
  992|  2.75k|        auto idx    = pos.index(last);
  993|  2.75k|        auto node   = pos.node();
  994|  2.75k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 2.75k, Folded]
  |  Branch (994:35): [True: 1.75k, False: 1.00k]
  ------------------
  995|  2.75k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 2.75k]
  |  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|  2.75k|        } else {
 1002|  2.75k|            using std::get;
 1003|  2.75k|            auto subs =
 1004|  2.75k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 1.75k, False: 1.00k]
  ------------------
 1005|  2.75k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  2.75k|            auto next = get<1>(subs);
 1007|  2.75k|            auto ts   = get<2>(subs);
 1008|  2.75k|            auto tail = get<3>(subs);
 1009|  2.75k|            IMMER_TRY {
  ------------------
  |  |   49|  2.75k|#define IMMER_TRY try
  ------------------
 1010|  2.75k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 920, False: 1.83k]
  ------------------
 1011|    920|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 539, False: 381]
  ------------------
 1012|    539|                        node->inner()[idx] = next;
 1013|    539|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    539|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    539|                    } else {
 1016|    381|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    381|                        newn->inner()[idx] = next;
 1018|    381|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 381, Folded]
  ------------------
 1019|    381|                            pos.visit(dec_visitor{});
 1020|    381|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    381|                    }
 1022|  1.83k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 742, False: 1.09k]
  ------------------
 1023|    742|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [True: 742, Folded]
  ------------------
 1024|    742|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    742|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|  1.09k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 1.09k]
  |  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.09k|                } else {
 1034|  1.09k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 497, False: 598]
  ------------------
 1035|    497|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    497|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    598|                    } else {
 1038|    598|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    598|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 598, Folded]
  ------------------
 1040|    598|                            pos.visit(dec_visitor{});
 1041|    598|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    598|                    }
 1043|  1.09k|                }
 1044|  2.75k|            }
 1045|  2.75k|            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.75k|        }
 1055|  2.75k|    }
_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.59k|    {
  879|  9.59k|        using node_t = node_type<Pos>;
  880|  9.59k|        auto node    = p.node();
  881|  9.59k|        if (node->dec()) {
  ------------------
  |  Branch (881:13): [True: 0, False: 9.59k]
  ------------------
  882|      0|            p.each_right(dec_t{}, idx);
  883|      0|            node_t::delete_inner(node, p.count());
  884|      0|        }
  885|  9.59k|    }
_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.87k|    {
 1060|  5.87k|        auto old_tail_size = pos.count();
 1061|  5.87k|        auto new_tail_size = pos.index(last) + 1;
 1062|  5.87k|        auto node          = pos.node();
 1063|  5.87k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [Folded, False: 5.87k]
  |  Branch (1063:42): [True: 0, False: 0]
  ------------------
 1064|  5.87k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 1.71k, False: 4.16k]
  ------------------
 1065|  1.71k|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [True: 1.71k, Folded]
  ------------------
 1066|  1.71k|                node->inc();
 1067|  1.71k|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|  4.16k|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 0, False: 4.16k]
  ------------------
 1069|      0|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|      0|                              old_tail_size - new_tail_size);
 1071|      0|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|  4.16k|        } else {
 1073|  4.16k|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|  4.16k|            if (Mutating)
  ------------------
  |  Branch (1074:17): [Folded, False: 4.16k]
  ------------------
 1075|      0|                pos.visit(dec_visitor{});
 1076|  4.16k|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|  4.16k|        }
 1078|  5.87k|    }
_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.87k|    {
  914|  7.87k|        auto idx    = pos.index(last);
  915|  7.87k|        auto node   = pos.node();
  916|  7.87k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (916:23): [Folded, False: 7.87k]
  |  Branch (916:35): [True: 0, False: 0]
  ------------------
  917|  7.87k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (917:13): [Folded, False: 7.87k]
  |  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.87k|        } else {
  924|  7.87k|            using std::get;
  925|  7.87k|            auto subs =
  926|  7.87k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (926:17): [True: 0, False: 7.87k]
  ------------------
  927|  7.87k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
  928|  7.87k|            auto next = get<1>(subs);
  929|  7.87k|            auto ts   = get<2>(subs);
  930|  7.87k|            auto tail = get<3>(subs);
  931|  7.87k|            IMMER_TRY {
  ------------------
  |  |   49|  7.87k|#define IMMER_TRY try
  ------------------
  932|  7.87k|                if (next) {
  ------------------
  |  Branch (932:21): [True: 2.89k, False: 4.98k]
  ------------------
  933|  2.89k|                    if (mutate) {
  ------------------
  |  Branch (933:25): [True: 0, False: 2.89k]
  ------------------
  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|  2.89k|                    } else {
  942|  2.89k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  943|  2.89k|                        auto newr = newn->relaxed();
  944|  2.89k|                        newn->inner()[idx] = next;
  945|  2.89k|                        newr->d.sizes[idx] = last + 1 - ts;
  946|  2.89k|                        newr->d.count      = idx + 1;
  947|  2.89k|                        assert(newr->d.sizes[idx]);
  ------------------
  |  Branch (947:25): [True: 2.89k, False: 0]
  ------------------
  948|  2.89k|                        if (Mutating)
  ------------------
  |  Branch (948:29): [Folded, False: 2.89k]
  ------------------
  949|      0|                            pos.visit(dec_visitor{});
  950|  2.89k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  951|  2.89k|                    }
  952|  4.98k|                } else if (idx == 0) {
  ------------------
  |  Branch (952:28): [True: 1.97k, False: 3.01k]
  ------------------
  953|  1.97k|                    if (Mutating)
  ------------------
  |  Branch (953:25): [Folded, False: 1.97k]
  ------------------
  954|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
  955|  1.97k|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
  956|  3.01k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (956:28): [Folded, False: 3.01k]
  |  Branch (956:40): [True: 0, False: 0]
  |  Branch (956:52): [True: 0, False: 0]
  ------------------
  957|      0|                    auto newn = pos.node()->inner()[0];
  958|      0|                    if (!mutate)
  ------------------
  |  Branch (958:25): [True: 0, False: 0]
  ------------------
  959|      0|                        newn->inc();
  960|      0|                    if (Mutating)
  ------------------
  |  Branch (960:25): [Folded, False: 0]
  ------------------
  961|      0|                        pos.visit(dec_right_visitor{}, count_t{2});
  962|      0|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
  963|  3.01k|                } else {
  964|  3.01k|                    if (mutate) {
  ------------------
  |  Branch (964:25): [True: 0, False: 3.01k]
  ------------------
  965|      0|                        pos.each_right(dec_visitor{}, idx + 1);
  966|      0|                        node->ensure_mutable_relaxed_n(e, idx)->d.count = idx;
  967|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
  968|  3.01k|                    } else {
  969|  3.01k|                        auto newn = node_t::copy_inner_r_e(e, node, idx);
  970|  3.01k|                        if (Mutating)
  ------------------
  |  Branch (970:29): [Folded, False: 3.01k]
  ------------------
  971|      0|                            pos.visit(dec_visitor{});
  972|  3.01k|                        return std::make_tuple(pos.shift(), newn, ts, tail);
  973|  3.01k|                    }
  974|  3.01k|                }
  975|  7.87k|            }
  976|  7.87k|            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.87k|        }
  987|  7.87k|    }
_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.32k|    {
  992|  1.32k|        auto idx    = pos.index(last);
  993|  1.32k|        auto node   = pos.node();
  994|  1.32k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [Folded, False: 1.32k]
  |  Branch (994:35): [True: 0, False: 0]
  ------------------
  995|  1.32k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [Folded, False: 1.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): [Folded, False: 0]
  ------------------
  999|      0|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|      0|            return res;
 1001|  1.32k|        } else {
 1002|  1.32k|            using std::get;
 1003|  1.32k|            auto subs =
 1004|  1.32k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 0, False: 1.32k]
  ------------------
 1005|  1.32k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.32k|            auto next = get<1>(subs);
 1007|  1.32k|            auto ts   = get<2>(subs);
 1008|  1.32k|            auto tail = get<3>(subs);
 1009|  1.32k|            IMMER_TRY {
  ------------------
  |  |   49|  1.32k|#define IMMER_TRY try
  ------------------
 1010|  1.32k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 478, False: 844]
  ------------------
 1011|    478|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 0, False: 478]
  ------------------
 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|    478|                    } else {
 1016|    478|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    478|                        newn->inner()[idx] = next;
 1018|    478|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [Folded, False: 478]
  ------------------
 1019|      0|                            pos.visit(dec_visitor{});
 1020|    478|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    478|                    }
 1022|    844|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 384, False: 460]
  ------------------
 1023|    384|                    if (Mutating)
  ------------------
  |  Branch (1023:25): [Folded, False: 384]
  ------------------
 1024|      0|                        pos.visit(dec_right_visitor{}, count_t{1});
 1025|    384|                    return std::make_tuple(pos.shift(), nullptr, ts, tail);
 1026|    460|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [Folded, False: 460]
  |  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|    460|                } else {
 1034|    460|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 0, False: 460]
  ------------------
 1035|      0|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|      0|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    460|                    } else {
 1038|    460|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    460|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [Folded, False: 460]
  ------------------
 1040|      0|                            pos.visit(dec_visitor{});
 1041|    460|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    460|                    }
 1043|    460|                }
 1044|  1.32k|            }
 1045|  1.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|  1.32k|        }
 1055|  1.32k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_15regular_sub_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  14.3k|    {
  992|  14.3k|        auto idx    = pos.index(last);
  993|  14.3k|        auto node   = pos.node();
  994|  14.3k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 14.3k, Folded]
  |  Branch (994:35): [True: 8.42k, False: 5.90k]
  ------------------
  995|  14.3k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 14.3k, Folded]
  |  Branch (995:25): [True: 6.84k, False: 7.48k]
  ------------------
  996|  6.84k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 3.57k, False: 3.26k]
  ------------------
  997|  6.84k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  6.84k|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 6.84k, Folded]
  ------------------
  999|  6.84k|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  6.84k|            return res;
 1001|  7.48k|        } else {
 1002|  7.48k|            using std::get;
 1003|  7.48k|            auto subs =
 1004|  7.48k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 4.84k, False: 2.63k]
  ------------------
 1005|  7.48k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  7.48k|            auto next = get<1>(subs);
 1007|  7.48k|            auto ts   = get<2>(subs);
 1008|  7.48k|            auto tail = get<3>(subs);
 1009|  7.48k|            IMMER_TRY {
  ------------------
  |  |   49|  7.48k|#define IMMER_TRY try
  ------------------
 1010|  7.48k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 3.62k, False: 3.86k]
  ------------------
 1011|  3.62k|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 2.83k, False: 795]
  ------------------
 1012|  2.83k|                        node->inner()[idx] = next;
 1013|  2.83k|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|  2.83k|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|  2.83k|                    } else {
 1016|    795|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    795|                        newn->inner()[idx] = next;
 1018|    795|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 795, Folded]
  ------------------
 1019|    795|                            pos.visit(dec_visitor{});
 1020|    795|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    795|                    }
 1022|  3.86k|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 3.86k]
  ------------------
 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.86k|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 3.86k, Folded]
  |  Branch (1026:40): [True: 3.40k, False: 456]
  |  Branch (1026:52): [True: 2.00k, False: 1.39k]
  ------------------
 1027|  2.00k|                    auto newn = pos.node()->inner()[0];
 1028|  2.00k|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 945, False: 1.06k]
  ------------------
 1029|    945|                        newn->inc();
 1030|  2.00k|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 2.00k, Folded]
  ------------------
 1031|  2.00k|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|  2.00k|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|  2.00k|                } else {
 1034|  1.85k|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 954, False: 899]
  ------------------
 1035|    954|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    954|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    954|                    } else {
 1038|    899|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    899|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 899, Folded]
  ------------------
 1040|    899|                            pos.visit(dec_visitor{});
 1041|    899|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    899|                    }
 1043|  1.85k|                }
 1044|  7.48k|            }
 1045|  7.48k|            IMMER_CATCH (...) {
 1046|      0|                assert(!mutate);
  ------------------
  |  Branch (1046:17): [True: 0, False: 0]
  ------------------
 1047|      0|                assert(!next || pos.shift() > BL);
  ------------------
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  |  Branch (1047:17): [True: 0, False: 0]
  ------------------
 1048|      0|                assert(tail);
  ------------------
  |  Branch (1048:17): [True: 0, False: 0]
  ------------------
 1049|      0|                if (next)
  ------------------
  |  Branch (1049:21): [True: 0, False: 0]
  ------------------
 1050|      0|                    dec_regular(next, pos.shift() - B, last + 1 - ts);
 1051|      0|                dec_leaf(tail, ts);
 1052|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 1053|      0|            }
 1054|  7.48k|        }
 1055|  14.3k|    }
_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.35k|    {
 1060|  1.35k|        auto old_tail_size = pos.count();
 1061|  1.35k|        auto new_tail_size = pos.index(last) + 1;
 1062|  1.35k|        auto node          = pos.node();
 1063|  1.35k|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 1.35k, Folded]
  |  Branch (1063:42): [True: 749, False: 607]
  ------------------
 1064|  1.35k|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 388, False: 968]
  ------------------
 1065|    388|            if (!Mutating)
  ------------------
  |  Branch (1065:17): [Folded, False: 388]
  ------------------
 1066|      0|                node->inc();
 1067|    388|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1068|    968|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 545, False: 423]
  ------------------
 1069|    545|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    545|                              old_tail_size - new_tail_size);
 1071|    545|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    545|        } else {
 1073|    423|            auto new_tail = node_t::copy_leaf_e(e, node, new_tail_size);
 1074|    423|            if (Mutating)
  ------------------
  |  Branch (1074:17): [True: 423, Folded]
  ------------------
 1075|    423|                pos.visit(dec_visitor{});
 1076|    423|            return std::make_tuple(0, nullptr, new_tail_size, new_tail);
 1077|    423|        }
 1078|  1.35k|    }
_ZN5immer6detail4rbts23slice_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1ELb1EE13visit_regularIRNS1_8full_posISC_EEEENSt3__15tupleIJjPSC_jSK_EEEOT_mNSA_5applyIS7_E4type4editE:
  991|  2.58k|    {
  992|  2.58k|        auto idx    = pos.index(last);
  993|  2.58k|        auto node   = pos.node();
  994|  2.58k|        auto mutate = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (994:23): [True: 2.58k, Folded]
  |  Branch (994:35): [True: 1.78k, False: 803]
  ------------------
  995|  2.58k|        if (Collapse && idx == 0) {
  ------------------
  |  Branch (995:13): [True: 2.58k, Folded]
  |  Branch (995:25): [True: 1.33k, False: 1.25k]
  ------------------
  996|  1.33k|            auto res = mutate ? pos.towards_oh(this_t{}, last, idx, e)
  ------------------
  |  Branch (996:24): [True: 1.11k, False: 215]
  ------------------
  997|  1.33k|                              : pos.towards_oh(no_mut_t{}, last, idx, e);
  998|  1.33k|            if (Mutating)
  ------------------
  |  Branch (998:17): [True: 1.33k, Folded]
  ------------------
  999|  1.33k|                pos.visit(dec_right_visitor{}, count_t{1});
 1000|  1.33k|            return res;
 1001|  1.33k|        } else {
 1002|  1.25k|            using std::get;
 1003|  1.25k|            auto subs =
 1004|  1.25k|                mutate ? pos.towards_oh(no_collapse_t{}, last, idx, e)
  ------------------
  |  Branch (1004:17): [True: 666, False: 588]
  ------------------
 1005|  1.25k|                       : pos.towards_oh(no_collapse_no_mut_t{}, last, idx, e);
 1006|  1.25k|            auto next = get<1>(subs);
 1007|  1.25k|            auto ts   = get<2>(subs);
 1008|  1.25k|            auto tail = get<3>(subs);
 1009|  1.25k|            IMMER_TRY {
  ------------------
  |  |   49|  1.25k|#define IMMER_TRY try
  ------------------
 1010|  1.25k|                if (next) {
  ------------------
  |  Branch (1010:21): [True: 426, False: 828]
  ------------------
 1011|    426|                    if (mutate) {
  ------------------
  |  Branch (1011:25): [True: 231, False: 195]
  ------------------
 1012|    231|                        node->inner()[idx] = next;
 1013|    231|                        pos.each_right(dec_visitor{}, idx + 1);
 1014|    231|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1015|    231|                    } else {
 1016|    195|                        auto newn          = node_t::copy_inner_e(e, node, idx);
 1017|    195|                        newn->inner()[idx] = next;
 1018|    195|                        if (Mutating)
  ------------------
  |  Branch (1018:29): [True: 195, Folded]
  ------------------
 1019|    195|                            pos.visit(dec_visitor{});
 1020|    195|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1021|    195|                    }
 1022|    828|                } else if (idx == 0) {
  ------------------
  |  Branch (1022:28): [True: 0, False: 828]
  ------------------
 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|    828|                } else if (Collapse && idx == 1 && pos.shift() > BL) {
  ------------------
  |  Branch (1026:28): [True: 828, Folded]
  |  Branch (1026:40): [True: 608, False: 220]
  |  Branch (1026:52): [True: 209, False: 399]
  ------------------
 1027|    209|                    auto newn = pos.node()->inner()[0];
 1028|    209|                    if (!mutate)
  ------------------
  |  Branch (1028:25): [True: 193, False: 16]
  ------------------
 1029|    193|                        newn->inc();
 1030|    209|                    if (Mutating)
  ------------------
  |  Branch (1030:25): [True: 209, Folded]
  ------------------
 1031|    209|                        pos.visit(dec_right_visitor{}, count_t{2});
 1032|    209|                    return std::make_tuple(pos.shift() - B, newn, ts, tail);
 1033|    619|                } else {
 1034|    619|                    if (mutate) {
  ------------------
  |  Branch (1034:25): [True: 419, False: 200]
  ------------------
 1035|    419|                        pos.each_right(dec_visitor{}, idx + 1);
 1036|    419|                        return std::make_tuple(pos.shift(), node, ts, tail);
 1037|    419|                    } else {
 1038|    200|                        auto newn = node_t::copy_inner_e(e, node, idx);
 1039|    200|                        if (Mutating)
  ------------------
  |  Branch (1039:29): [True: 200, Folded]
  ------------------
 1040|    200|                            pos.visit(dec_visitor{});
 1041|    200|                        return std::make_tuple(pos.shift(), newn, ts, tail);
 1042|    200|                    }
 1043|    619|                }
 1044|  1.25k|            }
 1045|  1.25k|            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.25k|        }
 1055|  2.58k|    }
_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|    754|    {
 1060|    754|        auto old_tail_size = pos.count();
 1061|    754|        auto new_tail_size = pos.index(last) + 1;
 1062|    754|        auto node          = pos.node();
 1063|    754|        auto mutate        = Mutating && node->can_mutate(e);
  ------------------
  |  Branch (1063:30): [True: 754, Folded]
  |  Branch (1063:42): [True: 551, False: 203]
  ------------------
 1064|    754|        if (new_tail_size == old_tail_size) {
  ------------------
  |  Branch (1064:13): [True: 260, False: 494]
  ------------------
 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|    494|        } else if (mutate) {
  ------------------
  |  Branch (1068:20): [True: 298, False: 196]
  ------------------
 1069|    298|            detail::destroy_n(node->leaf() + new_tail_size,
 1070|    298|                              old_tail_size - new_tail_size);
 1071|    298|            return std::make_tuple(0, nullptr, new_tail_size, node);
 1072|    298|        } 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|    754|    }
_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.36k|    {
 2433|  3.36k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.36k|    }
_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|  14.3k|{
 2334|  14.3k|    auto lshift = lpos.shift();
 2335|  14.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|  14.3k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 14.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|  14.3k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 11.2k, False: 3.11k]
  ------------------
 2344|  11.2k|        auto cpos = rpos.first_sub(
 2345|  11.2k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  11.2k|        return concat_rebalance_mut<Node>(
 2347|  11.2k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  11.2k|    } else {
 2349|  3.11k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 3.11k, False: 0]
  ------------------
 2350|  3.11k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 3.11k]
  |  Branch (2350:9): [True: 3.11k, False: 0]
  |  Branch (2350:9): [True: 3.11k, False: 0]
  ------------------
 2351|  3.11k|        auto cpos = lpos.last_sub(
 2352|  3.11k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  3.11k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  3.11k|    }
 2355|  14.3k|}
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEC2ENSA_5applyIS7_E4type4editEjPjjSH_PSC_:
 2040|   874k|        : ec_{ec}
 2041|   874k|        , curr_{counts}
 2042|   874k|        , n_{n}
 2043|   874k|        , result_{shift + B, nullptr, 0}
 2044|   874k|    {
 2045|   874k|        if (candidate) {
  ------------------
  |  Branch (2045:13): [True: 480k, False: 393k]
  ------------------
 2046|   480k|            candidate->ensure_mutable_relaxed_e(candidate_e, ec);
 2047|   480k|            result_.nodes_[0] = candidate;
 2048|   480k|        } else {
 2049|   393k|            result_.nodes_[0] = node_t::make_inner_r_e(ec);
 2050|   393k|        }
 2051|   874k|    }
_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|   874k|    {
 1513|   874k|        if (shift_ == BL) {
  ------------------
  |  Branch (1513:13): [True: 117k, False: 757k]
  ------------------
 1514|   117k|            auto s = size_t{};
 1515|   462k|            for (auto i = count_t{0}; i < count_; ++i) {
  ------------------
  |  Branch (1515:39): [True: 345k, False: 117k]
  ------------------
 1516|   345k|                make_leaf_sub_pos(nodes_[i], sizes_[i] - s).visit(v, args...);
 1517|   345k|                s = sizes_[i];
 1518|   345k|            }
 1519|   757k|        } else {
 1520|  1.83M|            for (auto i = count_t{0}; i < count_; ++i)
  ------------------
  |  Branch (1520:39): [True: 1.07M, False: 757k]
  ------------------
 1521|  1.07M|                make_relaxed_pos(nodes_[i], shift_ - B, nodes_[i]->relaxed())
 1522|  1.07M|                    .visit(v, args...);
 1523|   757k|        }
 1524|   874k|    }
_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|   603k|    {
 2228|   603k|        merger.merge_leaf(p, e);
 2229|   603k|    }
_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|   603k|    {
 2098|   603k|        auto from       = p.node();
 2099|   603k|        auto from_size  = p.size();
 2100|   603k|        auto from_count = p.count();
 2101|   603k|        assert(from);
  ------------------
  |  Branch (2101:9): [True: 603k, False: 0]
  ------------------
 2102|   603k|        assert(from_size);
  ------------------
  |  Branch (2102:9): [True: 603k, False: 0]
  ------------------
 2103|   603k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2103:13): [True: 580k, False: 23.1k]
  |  Branch (2103:21): [True: 569k, False: 10.8k]
  ------------------
 2104|   569k|            add_child(from, from_size);
 2105|   569k|        } else {
 2106|  34.0k|            auto from_offset = count_t{};
 2107|  34.0k|            auto from_data   = from->leaf();
 2108|  34.0k|            auto from_mutate = from->can_mutate(e);
 2109|  45.5k|            do {
 2110|  45.5k|                if (!to_) {
  ------------------
  |  Branch (2110:21): [True: 22.3k, False: 23.1k]
  ------------------
 2111|  22.3k|                    if (from_mutate) {
  ------------------
  |  Branch (2111:25): [True: 1.62k, False: 20.7k]
  ------------------
 2112|  1.62k|                        node_t::ownee(from) = ec_;
 2113|  1.62k|                        to_                 = from->inc();
 2114|  1.62k|                        assert(from_count);
  ------------------
  |  Branch (2114:25): [True: 1.62k, False: 0]
  ------------------
 2115|  20.7k|                    } else {
 2116|  20.7k|                        to_ = node_t::make_leaf_e(ec_);
 2117|  20.7k|                    }
 2118|  22.3k|                    to_offset_ = 0;
 2119|  22.3k|                }
 2120|  45.5k|                auto data = to_->leaf();
 2121|  45.5k|                auto to_copy =
 2122|  45.5k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2123|  45.5k|                if (from == to_) {
  ------------------
  |  Branch (2123:21): [True: 1.62k, False: 43.8k]
  ------------------
 2124|  1.62k|                    if (from_offset != to_offset_)
  ------------------
  |  Branch (2124:25): [True: 380, False: 1.24k]
  ------------------
 2125|    380|                        std::move(from_data + from_offset,
 2126|    380|                                  from_data + from_offset + to_copy,
 2127|    380|                                  data + to_offset_);
 2128|  43.8k|                } else {
 2129|  43.8k|                    if (!from_mutate)
  ------------------
  |  Branch (2129:25): [True: 42.9k, False: 955]
  ------------------
 2130|  42.9k|                        detail::uninitialized_copy(from_data + from_offset,
 2131|  42.9k|                                                   from_data + from_offset +
 2132|  42.9k|                                                       to_copy,
 2133|  42.9k|                                                   data + to_offset_);
 2134|    955|                    else
 2135|    955|                        detail::uninitialized_move(from_data + from_offset,
 2136|    955|                                                   from_data + from_offset +
 2137|    955|                                                       to_copy,
 2138|    955|                                                   data + to_offset_);
 2139|  43.8k|                }
 2140|  45.5k|                to_offset_ += to_copy;
 2141|  45.5k|                from_offset += to_copy;
 2142|  45.5k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2142:21): [True: 22.3k, False: 23.1k]
  ------------------
 2143|  22.3k|                    add_child(to_, to_offset_);
 2144|  22.3k|                    to_ = nullptr;
 2145|  22.3k|                }
 2146|  45.5k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2146:22): [True: 11.4k, False: 34.0k]
  ------------------
 2147|  34.0k|        }
 2148|   603k|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9add_childEPSC_m:
 2064|  3.47M|    {
 2065|  3.47M|        assert(size);
  ------------------
  |  Branch (2065:9): [True: 3.47M, False: 0]
  ------------------
 2066|  3.47M|        ++curr_;
 2067|  3.47M|        auto parent  = result_.nodes_[result_.count_ - 1];
 2068|  3.47M|        auto relaxed = parent->relaxed();
 2069|  3.47M|        if (count_ == branches<B>) {
  ------------------
  |  Branch (2069:13): [True: 330k, False: 3.14M]
  ------------------
 2070|   330k|            parent->relaxed()->d.count = count_;
 2071|   330k|            assert(result_.count_ < result_t::max_children);
  ------------------
  |  Branch (2071:13): [True: 330k, False: 0]
  ------------------
 2072|   330k|            n_ -= branches<B>;
 2073|   330k|            if (candidate_) {
  ------------------
  |  Branch (2073:17): [True: 19.9k, False: 311k]
  ------------------
 2074|  19.9k|                parent = candidate_;
 2075|  19.9k|                parent->ensure_mutable_relaxed_e(candidate_e_, ec_);
 2076|  19.9k|                candidate_ = nullptr;
 2077|  19.9k|            } else
 2078|   311k|                parent = node_t::make_inner_r_e(ec_);
 2079|   330k|            count_                         = 0;
 2080|   330k|            relaxed                        = parent->relaxed();
 2081|   330k|            result_.nodes_[result_.count_] = parent;
 2082|   330k|            result_.sizes_[result_.count_] = result_.sizes_[result_.count_ - 1];
 2083|   330k|            assert(result_.sizes_[result_.count_]);
  ------------------
  |  Branch (2083:13): [True: 330k, False: 0]
  ------------------
 2084|   330k|            ++result_.count_;
 2085|   330k|        }
 2086|  3.47M|        auto idx = count_++;
 2087|  3.47M|        result_.sizes_[result_.count_ - 1] += size;
 2088|  3.47M|        assert(size);
  ------------------
  |  Branch (2088:9): [True: 3.47M, False: 0]
  ------------------
 2089|  3.47M|        assert(result_.sizes_[result_.count_ - 1]);
  ------------------
  |  Branch (2089:9): [True: 3.47M, False: 0]
  ------------------
 2090|  3.47M|        relaxed->d.sizes[idx] = size + (idx ? relaxed->d.sizes[idx - 1] : 0);
  ------------------
  |  Branch (2090:41): [True: 2.26M, False: 1.20M]
  ------------------
 2091|  3.47M|        assert(relaxed->d.sizes[idx]);
  ------------------
  |  Branch (2091:9): [True: 3.47M, False: 0]
  ------------------
 2092|  3.47M|        parent->inner()[idx] = p;
 2093|  3.47M|    };
_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.64M|    {
 2222|  2.64M|        merger.merge_inner(p, e);
 2223|  2.64M|    }
_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.64M|    {
 2153|  2.64M|        auto from       = p.node();
 2154|  2.64M|        auto from_size  = p.size();
 2155|  2.64M|        auto from_count = p.count();
 2156|  2.64M|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 2.64M, False: 0]
  ------------------
 2157|  2.64M|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 2.59M, False: 55.1k]
  |  Branch (2157:21): [True: 2.55M, False: 35.0k]
  ------------------
 2158|  2.55M|            add_child(from, from_size);
 2159|  2.55M|        } else {
 2160|  90.1k|            auto from_offset = count_t{};
 2161|  90.1k|            auto from_data   = from->inner();
 2162|  90.1k|            auto from_mutate = from->can_relax() && from->can_mutate(e);
  ------------------
  |  Branch (2162:32): [True: 90.1k, False: 0]
  |  Branch (2162:53): [True: 57.7k, False: 32.4k]
  ------------------
 2163|   108k|            do {
 2164|   108k|                if (!to_) {
  ------------------
  |  Branch (2164:21): [True: 53.8k, False: 55.1k]
  ------------------
 2165|  53.8k|                    if (from_mutate) {
  ------------------
  |  Branch (2165:25): [True: 36.7k, False: 17.1k]
  ------------------
 2166|  36.7k|                        node_t::ownee(from) = ec_;
 2167|  36.7k|                        from->ensure_mutable_relaxed_e(e, ec_);
 2168|  36.7k|                        to_ = from;
 2169|  36.7k|                    } else {
 2170|  17.1k|                        to_ = node_t::make_inner_r_e(ec_);
 2171|  17.1k|                    }
 2172|  53.8k|                    to_offset_ = 0;
 2173|  53.8k|                    to_size_   = 0;
 2174|  53.8k|                }
 2175|   108k|                auto data = to_->inner();
 2176|   108k|                auto to_copy =
 2177|   108k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2178|   108k|                auto sizes = to_->relaxed()->d.sizes;
 2179|   108k|                if (from != to_ || from_offset != to_offset_) {
  ------------------
  |  Branch (2179:21): [True: 72.2k, False: 36.7k]
  |  Branch (2179:36): [True: 15.1k, False: 21.5k]
  ------------------
 2180|  87.4k|                    std::copy(from_data + from_offset,
 2181|  87.4k|                              from_data + from_offset + to_copy,
 2182|  87.4k|                              data + to_offset_);
 2183|  87.4k|                    p.copy_sizes(
 2184|  87.4k|                        from_offset, to_copy, to_size_, sizes + to_offset_);
 2185|  87.4k|                }
 2186|   108k|                to_offset_ += to_copy;
 2187|   108k|                from_offset += to_copy;
 2188|   108k|                to_size_ = sizes[to_offset_ - 1];
 2189|   108k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2189:21): [True: 53.8k, False: 55.1k]
  ------------------
 2190|  53.8k|                    to_->relaxed()->d.count = to_offset_;
 2191|  53.8k|                    add_child(to_, to_size_);
 2192|  53.8k|                    to_ = nullptr;
 2193|  53.8k|                }
 2194|   108k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2194:22): [True: 18.7k, False: 90.1k]
  ------------------
 2195|  90.1k|        }
 2196|  2.64M|    }
_ZN5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13set_candidateENSA_5applyIS7_E4type4editEPSC_:
 2058|  46.3k|    {
 2059|  46.3k|        candidate_   = candidate;
 2060|  46.3k|        candidate_e_ = candidate_e;
 2061|  46.3k|    }
_ZNK5immer6detail4rbts17concat_merger_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6finishEv:
 2199|   874k|    {
 2200|   874k|        assert(!to_);
  ------------------
  |  Branch (2200:9): [True: 874k, False: 0]
  ------------------
 2201|   874k|        result_.nodes_[result_.count_ - 1]->relaxed()->d.count = count_;
 2202|   874k|        return result_;
 2203|   874k|    }
_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|  10.9k|    {
 2388|  10.9k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  10.9k|    }
_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|    252|    {
 2388|    252|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|    252|    }
_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.93k|{
 2334|  3.93k|    auto lshift = lpos.shift();
 2335|  3.93k|    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.93k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 3.93k]
  ------------------
 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.93k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 926, False: 3.01k]
  ------------------
 2344|    926|        auto cpos = rpos.first_sub(
 2345|    926|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    926|        return concat_rebalance_mut<Node>(
 2347|    926|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  3.01k|    } else {
 2349|  3.01k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 3.01k, False: 0]
  ------------------
 2350|  3.01k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 3.01k]
  |  Branch (2350:9): [True: 3.01k, False: 0]
  |  Branch (2350:9): [True: 3.01k, False: 0]
  ------------------
 2351|  3.01k|        auto cpos = lpos.last_sub(
 2352|  3.01k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  3.01k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  3.01k|    }
 2355|  3.93k|}
_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.60k|    {
 2388|  1.60k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  1.60k|    }
_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.60k|{
 2334|  1.60k|    auto lshift = lpos.shift();
 2335|  1.60k|    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.60k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 1.60k]
  ------------------
 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.60k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 680, False: 926]
  ------------------
 2344|    680|        auto cpos = rpos.first_sub(
 2345|    680|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    680|        return concat_rebalance_mut<Node>(
 2347|    680|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|    926|    } else {
 2349|    926|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 926, False: 0]
  ------------------
 2350|    926|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 926]
  |  Branch (2350:9): [True: 926, False: 0]
  |  Branch (2350:9): [True: 926, False: 0]
  ------------------
 2351|    926|        auto cpos = lpos.last_sub(
 2352|    926|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|    926|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|    926|    }
 2355|  1.60k|}
_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.20k|{
 2281|  1.20k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  1.20k|    plan.fill(lpos, cpos, rpos);
 2283|  1.20k|    plan.shuffle(cpos.shift());
 2284|  1.20k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  1.20k|}
_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.20k|    {
 2245|  1.20k|        using node_t    = node_type<CPos>;
 2246|  1.20k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  1.20k|        using visitor_t = concat_merger_mut_visitor;
 2248|  1.20k|        auto lnode      = ((node_t*) lpos.node());
 2249|  1.20k|        auto rnode      = ((node_t*) rpos.node());
 2250|  1.20k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 1.20k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  1.20k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 1.20k, False: 0]
  |  Branch (2251:36): [True: 1.20k, False: 0]
  |  Branch (2251:58): [True: 247, False: 956]
  ------------------
 2252|  1.20k|        auto merger     = merger_t{ec,
 2253|  1.20k|                               cpos.shift(),
 2254|  1.20k|                               this->counts,
 2255|  1.20k|                               this->n,
 2256|  1.20k|                               el,
 2257|  1.20k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 1.20k]
  ------------------
 2258|  1.20k|        IMMER_TRY {
  ------------------
  |  |   49|  1.20k|#define IMMER_TRY try
  ------------------
 2259|  1.20k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  1.20k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  1.20k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 247, False: 956]
  ------------------
 2262|    247|                merger.set_candidate(er, rnode);
 2263|  1.20k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  1.20k|            return merger.finish();
 2265|  1.20k|        }
 2266|  1.20k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  1.20k|    }
_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|  75.1k|    {
 2228|  75.1k|        merger.merge_leaf(p, e);
 2229|  75.1k|    }
_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|  75.1k|    {
 2098|  75.1k|        auto from       = p.node();
 2099|  75.1k|        auto from_size  = p.size();
 2100|  75.1k|        auto from_count = p.count();
 2101|  75.1k|        assert(from);
  ------------------
  |  Branch (2101:9): [True: 75.1k, False: 0]
  ------------------
 2102|  75.1k|        assert(from_size);
  ------------------
  |  Branch (2102:9): [True: 75.1k, False: 0]
  ------------------
 2103|  75.1k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2103:13): [True: 75.1k, False: 0]
  |  Branch (2103:21): [True: 75.1k, False: 0]
  ------------------
 2104|  75.1k|            add_child(from, from_size);
 2105|  75.1k|        } 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|  75.1k|    }
_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|   118k|    {
 2222|   118k|        merger.merge_inner(p, e);
 2223|   118k|    }
_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|   118k|    {
 2153|   118k|        auto from       = p.node();
 2154|   118k|        auto from_size  = p.size();
 2155|   118k|        auto from_count = p.count();
 2156|   118k|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 118k, False: 0]
  ------------------
 2157|   118k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 118k, False: 0]
  |  Branch (2157:21): [True: 118k, False: 0]
  ------------------
 2158|   118k|            add_child(from, from_size);
 2159|   118k|        } 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|   118k|    }
_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|    926|    {
 2417|    926|        return rpos.first_sub_leaf(
 2418|    926|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|    926|    }
_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.93k|    {
 2395|  3.93k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  3.93k|    }
_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.93k|{
 2295|  3.93k|    static_assert(Node::bits >= 2, "");
 2296|  3.93k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 3.93k, False: 0]
  ------------------
 2297|  3.93k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 3.93k, False: 0]
  ------------------
 2298|  3.93k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 3.93k, False: 0]
  ------------------
 2299|  3.93k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 0, False: 3.93k]
  ------------------
 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.93k|    else
 2310|  3.93k|        return {
 2311|  3.93k|            Node::bits_leaf,
 2312|  3.93k|            lpos.node(),
 2313|  3.93k|            lpos.count(),
 2314|  3.93k|            rpos.node(),
 2315|  3.93k|            rpos.count(),
 2316|  3.93k|        };
 2317|  3.93k|}
_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|    926|{
 2281|    926|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|    926|    plan.fill(lpos, cpos, rpos);
 2283|    926|    plan.shuffle(cpos.shift());
 2284|    926|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|    926|}
_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|    926|    {
 2245|    926|        using node_t    = node_type<CPos>;
 2246|    926|        using merger_t  = concat_merger_mut<node_t>;
 2247|    926|        using visitor_t = concat_merger_mut_visitor;
 2248|    926|        auto lnode      = ((node_t*) lpos.node());
 2249|    926|        auto rnode      = ((node_t*) rpos.node());
 2250|    926|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 926]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|    926|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 926, False: 0]
  |  Branch (2251:36): [True: 926, False: 0]
  |  Branch (2251:58): [True: 323, False: 603]
  ------------------
 2252|    926|        auto merger     = merger_t{ec,
 2253|    926|                               cpos.shift(),
 2254|    926|                               this->counts,
 2255|    926|                               this->n,
 2256|    926|                               el,
 2257|    926|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 926]
  ------------------
 2258|    926|        IMMER_TRY {
  ------------------
  |  |   49|    926|#define IMMER_TRY try
  ------------------
 2259|    926|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|    926|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|    926|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 323, False: 603]
  ------------------
 2262|    323|                merger.set_candidate(er, rnode);
 2263|    926|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|    926|            return merger.finish();
 2265|    926|        }
 2266|    926|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|    926|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_12null_sub_posERNS1_17concat_center_posISC_EERNS1_15regular_sub_posISC_EEEENSE_IT_EENSt3__15decayISK_E4type6node_t6edit_tESR_OT0_OT1_SR_OT2_:
 2280|  2.22k|{
 2281|  2.22k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.22k|    plan.fill(lpos, cpos, rpos);
 2283|  2.22k|    plan.shuffle(cpos.shift());
 2284|  2.22k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.22k|}
_ZN5immer6detail4rbts25concat_rebalance_plan_mutILj2ELj2EE5mergeIRNS1_12null_sub_posERNS1_17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEERNS1_15regular_sub_posISH_EEEENS7_INSt3__15decayIT0_E4type6node_tEEENSS_6edit_tESU_OT_OSP_SU_OT1_:
 2244|  2.22k|    {
 2245|  2.22k|        using node_t    = node_type<CPos>;
 2246|  2.22k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.22k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.22k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.22k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.22k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 2.22k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  2.22k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.22k, False: 0]
  |  Branch (2251:36): [True: 2.22k, False: 0]
  |  Branch (2251:58): [True: 397, False: 1.82k]
  ------------------
 2252|  2.22k|        auto merger     = merger_t{ec,
 2253|  2.22k|                               cpos.shift(),
 2254|  2.22k|                               this->counts,
 2255|  2.22k|                               this->n,
 2256|  2.22k|                               el,
 2257|  2.22k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 2.22k]
  ------------------
 2258|  2.22k|        IMMER_TRY {
  ------------------
  |  |   49|  2.22k|#define IMMER_TRY try
  ------------------
 2259|  2.22k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.22k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.22k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 397, False: 1.82k]
  ------------------
 2262|    397|                merger.set_candidate(er, rnode);
 2263|  2.22k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.22k|            return merger.finish();
 2265|  2.22k|        }
 2266|  2.22k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.22k|    }
_ZN5immer6detail4rbts25concat_merger_mut_visitor11visit_innerIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_17concat_merger_mutISE_EEEEvOT_RT0_NSt3__15decayISJ_E4type6node_t6edit_tE:
 2221|  78.0k|    {
 2222|  78.0k|        merger.merge_inner(p, e);
 2223|  78.0k|    }
_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|  78.0k|    {
 2153|  78.0k|        auto from       = p.node();
 2154|  78.0k|        auto from_size  = p.size();
 2155|  78.0k|        auto from_count = p.count();
 2156|  78.0k|        assert(from_size);
  ------------------
  |  Branch (2156:9): [True: 78.0k, False: 0]
  ------------------
 2157|  78.0k|        if (!to_ && *curr_ == from_count) {
  ------------------
  |  Branch (2157:13): [True: 76.5k, False: 1.44k]
  |  Branch (2157:21): [True: 76.5k, False: 0]
  ------------------
 2158|  76.5k|            add_child(from, from_size);
 2159|  76.5k|        } else {
 2160|  1.44k|            auto from_offset = count_t{};
 2161|  1.44k|            auto from_data   = from->inner();
 2162|  1.44k|            auto from_mutate = from->can_relax() && from->can_mutate(e);
  ------------------
  |  Branch (2162:32): [True: 1.44k, False: 0]
  |  Branch (2162:53): [True: 202, False: 1.24k]
  ------------------
 2163|  2.89k|            do {
 2164|  2.89k|                if (!to_) {
  ------------------
  |  Branch (2164:21): [True: 1.44k, False: 1.44k]
  ------------------
 2165|  1.44k|                    if (from_mutate) {
  ------------------
  |  Branch (2165:25): [True: 202, False: 1.24k]
  ------------------
 2166|    202|                        node_t::ownee(from) = ec_;
 2167|    202|                        from->ensure_mutable_relaxed_e(e, ec_);
 2168|    202|                        to_ = from;
 2169|  1.24k|                    } else {
 2170|  1.24k|                        to_ = node_t::make_inner_r_e(ec_);
 2171|  1.24k|                    }
 2172|  1.44k|                    to_offset_ = 0;
 2173|  1.44k|                    to_size_   = 0;
 2174|  1.44k|                }
 2175|  2.89k|                auto data = to_->inner();
 2176|  2.89k|                auto to_copy =
 2177|  2.89k|                    std::min(from_count - from_offset, *curr_ - to_offset_);
 2178|  2.89k|                auto sizes = to_->relaxed()->d.sizes;
 2179|  2.89k|                if (from != to_ || from_offset != to_offset_) {
  ------------------
  |  Branch (2179:21): [True: 2.69k, False: 202]
  |  Branch (2179:36): [True: 202, False: 0]
  ------------------
 2180|  2.89k|                    std::copy(from_data + from_offset,
 2181|  2.89k|                              from_data + from_offset + to_copy,
 2182|  2.89k|                              data + to_offset_);
 2183|  2.89k|                    p.copy_sizes(
 2184|  2.89k|                        from_offset, to_copy, to_size_, sizes + to_offset_);
 2185|  2.89k|                }
 2186|  2.89k|                to_offset_ += to_copy;
 2187|  2.89k|                from_offset += to_copy;
 2188|  2.89k|                to_size_ = sizes[to_offset_ - 1];
 2189|  2.89k|                if (*curr_ == to_offset_) {
  ------------------
  |  Branch (2189:21): [True: 1.44k, False: 1.44k]
  ------------------
 2190|  1.44k|                    to_->relaxed()->d.count = to_offset_;
 2191|  1.44k|                    add_child(to_, to_size_);
 2192|  1.44k|                    to_ = nullptr;
 2193|  1.44k|                }
 2194|  2.89k|            } while (from_offset != from_count);
  ------------------
  |  Branch (2194:22): [True: 1.44k, False: 1.44k]
  ------------------
 2195|  1.44k|        }
 2196|  78.0k|    }
_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|  3.01k|    {
 2417|  3.01k|        return rpos.first_sub_leaf(
 2418|  3.01k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  3.01k|    }
_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.11k|    {
 2395|  3.11k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  3.11k|    }
_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.11k|{
 2295|  3.11k|    static_assert(Node::bits >= 2, "");
 2296|  3.11k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 3.11k, False: 0]
  ------------------
 2297|  3.11k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 3.11k, False: 0]
  ------------------
 2298|  3.11k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 3.11k, False: 0]
  ------------------
 2299|  3.11k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 0, False: 3.11k]
  ------------------
 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.11k|    else
 2310|  3.11k|        return {
 2311|  3.11k|            Node::bits_leaf,
 2312|  3.11k|            lpos.node(),
 2313|  3.11k|            lpos.count(),
 2314|  3.11k|            rpos.node(),
 2315|  3.11k|            rpos.count(),
 2316|  3.11k|        };
 2317|  3.11k|}
_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|  3.01k|{
 2281|  3.01k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  3.01k|    plan.fill(lpos, cpos, rpos);
 2283|  3.01k|    plan.shuffle(cpos.shift());
 2284|  3.01k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  3.01k|}
_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|  3.01k|    {
 2245|  3.01k|        using node_t    = node_type<CPos>;
 2246|  3.01k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  3.01k|        using visitor_t = concat_merger_mut_visitor;
 2248|  3.01k|        auto lnode      = ((node_t*) lpos.node());
 2249|  3.01k|        auto rnode      = ((node_t*) rpos.node());
 2250|  3.01k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 3.01k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  3.01k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 3.01k, False: 0]
  |  Branch (2251:36): [True: 3.01k, False: 0]
  |  Branch (2251:58): [True: 379, False: 2.63k]
  ------------------
 2252|  3.01k|        auto merger     = merger_t{ec,
 2253|  3.01k|                               cpos.shift(),
 2254|  3.01k|                               this->counts,
 2255|  3.01k|                               this->n,
 2256|  3.01k|                               el,
 2257|  3.01k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 3.01k]
  ------------------
 2258|  3.01k|        IMMER_TRY {
  ------------------
  |  |   49|  3.01k|#define IMMER_TRY try
  ------------------
 2259|  3.01k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  3.01k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  3.01k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 379, False: 2.63k]
  ------------------
 2262|    379|                merger.set_candidate(er, rnode);
 2263|  3.01k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  3.01k|            return merger.finish();
 2265|  3.01k|        }
 2266|  3.01k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  3.01k|    }
_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|  68.2k|{
 2281|  68.2k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  68.2k|    plan.fill(lpos, cpos, rpos);
 2283|  68.2k|    plan.shuffle(cpos.shift());
 2284|  68.2k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  68.2k|}
_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|  68.2k|    {
 2245|  68.2k|        using node_t    = node_type<CPos>;
 2246|  68.2k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  68.2k|        using visitor_t = concat_merger_mut_visitor;
 2248|  68.2k|        auto lnode      = ((node_t*) lpos.node());
 2249|  68.2k|        auto rnode      = ((node_t*) rpos.node());
 2250|  68.2k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 68.2k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  68.2k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 68.2k, False: 0]
  |  Branch (2251:36): [True: 68.2k, False: 0]
  |  Branch (2251:58): [True: 29.0k, False: 39.1k]
  ------------------
 2252|  68.2k|        auto merger     = merger_t{ec,
 2253|  68.2k|                               cpos.shift(),
 2254|  68.2k|                               this->counts,
 2255|  68.2k|                               this->n,
 2256|  68.2k|                               el,
 2257|  68.2k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 68.2k]
  ------------------
 2258|  68.2k|        IMMER_TRY {
  ------------------
  |  |   49|  68.2k|#define IMMER_TRY try
  ------------------
 2259|  68.2k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  68.2k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  68.2k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 29.0k, False: 39.1k]
  ------------------
 2262|  29.0k|                merger.set_candidate(er, rnode);
 2263|  68.2k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  68.2k|            return merger.finish();
 2265|  68.2k|        }
 2266|  68.2k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  68.2k|    }
_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.11k|    {
 2417|  3.11k|        return rpos.first_sub_leaf(
 2418|  3.11k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  3.11k|    }
_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.11k|{
 2281|  3.11k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  3.11k|    plan.fill(lpos, cpos, rpos);
 2283|  3.11k|    plan.shuffle(cpos.shift());
 2284|  3.11k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  3.11k|}
_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.11k|    {
 2245|  3.11k|        using node_t    = node_type<CPos>;
 2246|  3.11k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  3.11k|        using visitor_t = concat_merger_mut_visitor;
 2248|  3.11k|        auto lnode      = ((node_t*) lpos.node());
 2249|  3.11k|        auto rnode      = ((node_t*) rpos.node());
 2250|  3.11k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 0, False: 3.11k]
  |  Branch (2250:36): [True: 0, False: 0]
  |  Branch (2250:58): [True: 0, False: 0]
  ------------------
 2251|  3.11k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 3.11k, False: 0]
  |  Branch (2251:36): [True: 3.11k, False: 0]
  |  Branch (2251:58): [True: 1.73k, False: 1.37k]
  ------------------
 2252|  3.11k|        auto merger     = merger_t{ec,
 2253|  3.11k|                               cpos.shift(),
 2254|  3.11k|                               this->counts,
 2255|  3.11k|                               this->n,
 2256|  3.11k|                               el,
 2257|  3.11k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 0, False: 3.11k]
  ------------------
 2258|  3.11k|        IMMER_TRY {
  ------------------
  |  |   49|  3.11k|#define IMMER_TRY try
  ------------------
 2259|  3.11k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  3.11k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  3.11k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 1.73k, False: 1.37k]
  ------------------
 2262|  1.73k|                merger.set_candidate(er, rnode);
 2263|  3.11k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  3.11k|            return merger.finish();
 2265|  3.11k|        }
 2266|  3.11k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  3.11k|    }
_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.68k|    {
 2433|  3.68k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.68k|    }
_ZN5immer6detail4rbts17concat_center_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9realize_eENSA_5applyIS7_E4type4editE:
 1548|   117k|    {
 1549|   117k|        if (count_ > 1) {
  ------------------
  |  Branch (1549:13): [True: 11.2k, False: 106k]
  ------------------
 1550|  11.2k|            auto result = node_t::make_inner_r_e(e);
 1551|  11.2k|            auto r      = result->relaxed();
 1552|  11.2k|            r->d.count  = count_;
 1553|  11.2k|            std::copy(nodes_, nodes_ + count_, result->inner());
 1554|  11.2k|            std::copy(sizes_, sizes_ + count_, r->d.sizes);
 1555|  11.2k|            return {result, shift_, r};
 1556|   106k|        } else {
 1557|   106k|            assert(shift_ >= B + BL);
  ------------------
  |  Branch (1557:13): [True: 106k, False: 0]
  ------------------
 1558|   106k|            return {nodes_[0], shift_ - B, nodes_[0]->relaxed()};
 1559|   106k|        }
 1560|   117k|    }
_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|   110k|{
 2475|   110k|    return visit_maybe_relaxed_sub(lroot,
 2476|   110k|                                   lshift,
 2477|   110k|                                   lsize,
 2478|   110k|                                   concat_trees_left_mut_visitor<Node>{},
 2479|   110k|                                   ec,
 2480|   110k|                                   el,
 2481|   110k|                                   make_leaf_pos(ltail, ltcount),
 2482|   110k|                                   er,
 2483|   110k|                                   rroot,
 2484|   110k|                                   rshift,
 2485|   110k|                                   rsize)
 2486|   110k|        .realize_e(ec);
 2487|   110k|}
_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|   104k|    {
 2452|   104k|        return visit_maybe_relaxed_sub(args...,
 2453|   104k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|   104k|                                       ec,
 2455|   104k|                                       el,
 2456|   104k|                                       lpos,
 2457|   104k|                                       tpos,
 2458|   104k|                                       er);
 2459|   104k|    }
_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|  61.6k|    {
 2433|  61.6k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  61.6k|    }
_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|   438k|{
 2334|   438k|    auto lshift = lpos.shift();
 2335|   438k|    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|   438k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 150k, False: 288k]
  ------------------
 2339|   150k|        auto cpos = lpos.last_sub(
 2340|   150k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|   150k|        return concat_rebalance_mut<Node>(
 2342|   150k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   288k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 48.5k, False: 239k]
  ------------------
 2344|  48.5k|        auto cpos = rpos.first_sub(
 2345|  48.5k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  48.5k|        return concat_rebalance_mut<Node>(
 2347|  48.5k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|   239k|    } else {
 2349|   239k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 239k, False: 0]
  ------------------
 2350|   239k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 239k]
  |  Branch (2350:9): [True: 239k, False: 0]
  |  Branch (2350:9): [True: 239k, False: 0]
  ------------------
 2351|   239k|        auto cpos = lpos.last_sub(
 2352|   239k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|   239k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|   239k|    }
 2355|   438k|}
_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|   148k|    {
 2367|   148k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|   148k|    }
_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.67k|    {
 2367|  3.67k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|  3.67k|    }
_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|  93.4k|{
 2334|  93.4k|    auto lshift = lpos.shift();
 2335|  93.4k|    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|  93.4k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 2.04k, False: 91.4k]
  ------------------
 2339|  2.04k|        auto cpos = lpos.last_sub(
 2340|  2.04k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|  2.04k|        return concat_rebalance_mut<Node>(
 2342|  2.04k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  91.4k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 8.46k, False: 82.9k]
  ------------------
 2344|  8.46k|        auto cpos = rpos.first_sub(
 2345|  8.46k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|  8.46k|        return concat_rebalance_mut<Node>(
 2347|  8.46k|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  82.9k|    } else {
 2349|  82.9k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 82.9k, False: 0]
  ------------------
 2350|  82.9k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 82.9k]
  |  Branch (2350:9): [True: 82.9k, False: 0]
  |  Branch (2350:9): [True: 82.9k, False: 0]
  ------------------
 2351|  82.9k|        auto cpos = lpos.last_sub(
 2352|  82.9k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  82.9k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  82.9k|    }
 2355|  93.4k|}
_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.42k|{
 2281|  3.42k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  3.42k|    plan.fill(lpos, cpos, rpos);
 2283|  3.42k|    plan.shuffle(cpos.shift());
 2284|  3.42k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  3.42k|}
_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.42k|    {
 2245|  3.42k|        using node_t    = node_type<CPos>;
 2246|  3.42k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  3.42k|        using visitor_t = concat_merger_mut_visitor;
 2248|  3.42k|        auto lnode      = ((node_t*) lpos.node());
 2249|  3.42k|        auto rnode      = ((node_t*) rpos.node());
 2250|  3.42k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 3.42k, False: 0]
  |  Branch (2250:36): [True: 3.42k, False: 0]
  |  Branch (2250:58): [True: 671, False: 2.75k]
  ------------------
 2251|  3.42k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 0, False: 3.42k]
  |  Branch (2251:36): [True: 0, False: 0]
  |  Branch (2251:58): [True: 0, False: 0]
  ------------------
 2252|  3.42k|        auto merger     = merger_t{ec,
 2253|  3.42k|                               cpos.shift(),
 2254|  3.42k|                               this->counts,
 2255|  3.42k|                               this->n,
 2256|  3.42k|                               el,
 2257|  3.42k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 671, False: 2.75k]
  ------------------
 2258|  3.42k|        IMMER_TRY {
  ------------------
  |  |   49|  3.42k|#define IMMER_TRY try
  ------------------
 2259|  3.42k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  3.42k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  3.42k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 0, False: 3.42k]
  ------------------
 2262|      0|                merger.set_candidate(er, rnode);
 2263|  3.42k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  3.42k|            return merger.finish();
 2265|  3.42k|        }
 2266|  3.42k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  3.42k|    }
_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|  86.2k|    {
 2388|  86.2k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  86.2k|    }
_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.96k|    {
 2388|  2.96k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  2.96k|    }
_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|  7.40k|{
 2334|  7.40k|    auto lshift = lpos.shift();
 2335|  7.40k|    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|  7.40k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 1.38k, False: 6.02k]
  ------------------
 2339|  1.38k|        auto cpos = lpos.last_sub(
 2340|  1.38k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|  1.38k|        return concat_rebalance_mut<Node>(
 2342|  1.38k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|  6.02k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 511, False: 5.51k]
  ------------------
 2344|    511|        auto cpos = rpos.first_sub(
 2345|    511|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    511|        return concat_rebalance_mut<Node>(
 2347|    511|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  5.51k|    } else {
 2349|  5.51k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 5.51k, False: 0]
  ------------------
 2350|  5.51k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 5.51k]
  |  Branch (2350:9): [True: 5.51k, False: 0]
  |  Branch (2350:9): [True: 5.51k, False: 0]
  ------------------
 2351|  5.51k|        auto cpos = lpos.last_sub(
 2352|  5.51k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  5.51k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  5.51k|    }
 2355|  7.40k|}
_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|  1.96k|    {
 2367|  1.96k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|  1.96k|    }
_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|  11.6k|    {
 2388|  11.6k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  11.6k|    }
_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|  11.6k|{
 2334|  11.6k|    auto lshift = lpos.shift();
 2335|  11.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|  11.6k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 11.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|  11.6k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 265, False: 11.3k]
  ------------------
 2344|    265|        auto cpos = rpos.first_sub(
 2345|    265|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    265|        return concat_rebalance_mut<Node>(
 2347|    265|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  11.3k|    } else {
 2349|  11.3k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 11.3k, False: 0]
  ------------------
 2350|  11.3k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 11.3k]
  |  Branch (2350:9): [True: 11.3k, False: 0]
  |  Branch (2350:9): [True: 11.3k, False: 0]
  ------------------
 2351|  11.3k|        auto cpos = lpos.last_sub(
 2352|  11.3k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  11.3k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  11.3k|    }
 2355|  11.6k|}
_ZN5immer6detail4rbts23concat_both_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EERNS1_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|  6.84k|    {
 2417|  6.84k|        return rpos.first_sub_leaf(
 2418|  6.84k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  6.84k|    }
_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|  49.6k|    {
 2395|  49.6k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  49.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_EERNS1_13full_leaf_posISC_EEEENS1_17concat_center_posIT_EENSt3__15decayISN_E4type6node_t6edit_tESU_OT0_OT1_SU_OT2_:
 2294|  49.6k|{
 2295|  49.6k|    static_assert(Node::bits >= 2, "");
 2296|  49.6k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 49.6k, False: 0]
  ------------------
 2297|  49.6k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 49.6k, False: 0]
  ------------------
 2298|  49.6k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 49.6k, False: 0]
  ------------------
 2299|  49.6k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 49.6k, False: 0]
  ------------------
 2300|  49.6k|        return {
 2301|  49.6k|            Node::bits_leaf,
 2302|  49.6k|            lpos.node(),
 2303|  49.6k|            lpos.count(),
 2304|  49.6k|            tpos.node(),
 2305|  49.6k|            tpos.count(),
 2306|  49.6k|            rpos.node(),
 2307|  49.6k|            rpos.count(),
 2308|  49.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|  49.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_8full_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2408|  6.31k|    {
 2409|  6.31k|        return rpos.first_sub(
 2410|  6.31k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  6.31k|    }
_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|  11.3k|{
 2281|  11.3k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  11.3k|    plan.fill(lpos, cpos, rpos);
 2283|  11.3k|    plan.shuffle(cpos.shift());
 2284|  11.3k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  11.3k|}
_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|  11.3k|    {
 2245|  11.3k|        using node_t    = node_type<CPos>;
 2246|  11.3k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  11.3k|        using visitor_t = concat_merger_mut_visitor;
 2248|  11.3k|        auto lnode      = ((node_t*) lpos.node());
 2249|  11.3k|        auto rnode      = ((node_t*) rpos.node());
 2250|  11.3k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 11.3k, False: 0]
  |  Branch (2250:36): [True: 11.3k, False: 0]
  |  Branch (2250:58): [True: 558, False: 10.7k]
  ------------------
 2251|  11.3k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 11.3k, False: 0]
  |  Branch (2251:36): [True: 11.3k, False: 0]
  |  Branch (2251:58): [True: 213, False: 11.1k]
  ------------------
 2252|  11.3k|        auto merger     = merger_t{ec,
 2253|  11.3k|                               cpos.shift(),
 2254|  11.3k|                               this->counts,
 2255|  11.3k|                               this->n,
 2256|  11.3k|                               el,
 2257|  11.3k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 558, False: 10.7k]
  ------------------
 2258|  11.3k|        IMMER_TRY {
  ------------------
  |  |   49|  11.3k|#define IMMER_TRY try
  ------------------
 2259|  11.3k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  11.3k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  11.3k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 213, False: 11.1k]
  ------------------
 2262|    213|                merger.set_candidate(er, rnode);
 2263|  11.3k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  11.3k|            return merger.finish();
 2265|  11.3k|        }
 2266|  11.3k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  11.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_15regular_sub_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESV_OT0_SV_OT1_:
 2416|  42.8k|    {
 2417|  42.8k|        return rpos.first_sub_leaf(
 2418|  42.8k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  42.8k|    }
_ZN5immer6detail4rbts24concat_right_mut_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10visit_leafIRNS1_12leaf_sub_posISC_EESH_RNS1_8leaf_posISC_EEEENS1_17concat_center_posISC_EEOT_NSA_5applyIS7_E4type4editESS_OT0_OT1_SS_:
 2394|  60.6k|    {
 2395|  60.6k|        return concat_leafs_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2396|  60.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|  60.6k|{
 2295|  60.6k|    static_assert(Node::bits >= 2, "");
 2296|  60.6k|    assert(lpos.shift() == tpos.shift());
  ------------------
  |  Branch (2296:5): [True: 60.6k, False: 0]
  ------------------
 2297|  60.6k|    assert(lpos.shift() == rpos.shift());
  ------------------
  |  Branch (2297:5): [True: 60.6k, False: 0]
  ------------------
 2298|  60.6k|    assert(lpos.shift() == 0);
  ------------------
  |  Branch (2298:5): [True: 60.6k, False: 0]
  ------------------
 2299|  60.6k|    if (tpos.count() > 0)
  ------------------
  |  Branch (2299:9): [True: 60.6k, False: 0]
  ------------------
 2300|  60.6k|        return {
 2301|  60.6k|            Node::bits_leaf,
 2302|  60.6k|            lpos.node(),
 2303|  60.6k|            lpos.count(),
 2304|  60.6k|            tpos.node(),
 2305|  60.6k|            tpos.count(),
 2306|  60.6k|            rpos.node(),
 2307|  60.6k|            rpos.count(),
 2308|  60.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|  60.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.51k|    {
 2409|  4.51k|        return rpos.first_sub(
 2410|  4.51k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  4.51k|    }
_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.51k|{
 2281|  5.51k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  5.51k|    plan.fill(lpos, cpos, rpos);
 2283|  5.51k|    plan.shuffle(cpos.shift());
 2284|  5.51k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  5.51k|}
_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.51k|    {
 2245|  5.51k|        using node_t    = node_type<CPos>;
 2246|  5.51k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  5.51k|        using visitor_t = concat_merger_mut_visitor;
 2248|  5.51k|        auto lnode      = ((node_t*) lpos.node());
 2249|  5.51k|        auto rnode      = ((node_t*) rpos.node());
 2250|  5.51k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 5.51k, False: 0]
  |  Branch (2250:36): [True: 5.51k, False: 0]
  |  Branch (2250:58): [True: 508, False: 5.00k]
  ------------------
 2251|  5.51k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 5.51k, False: 0]
  |  Branch (2251:36): [True: 5.51k, False: 0]
  |  Branch (2251:58): [True: 403, False: 5.10k]
  ------------------
 2252|  5.51k|        auto merger     = merger_t{ec,
 2253|  5.51k|                               cpos.shift(),
 2254|  5.51k|                               this->counts,
 2255|  5.51k|                               this->n,
 2256|  5.51k|                               el,
 2257|  5.51k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 508, False: 5.00k]
  ------------------
 2258|  5.51k|        IMMER_TRY {
  ------------------
  |  |   49|  5.51k|#define IMMER_TRY try
  ------------------
 2259|  5.51k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  5.51k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  5.51k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 403, False: 5.10k]
  ------------------
 2262|    403|                merger.set_candidate(er, rnode);
 2263|  5.51k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  5.51k|            return merger.finish();
 2265|  5.51k|        }
 2266|  5.51k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  5.51k|    }
_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|  60.6k|    {
 2417|  60.6k|        return rpos.first_sub_leaf(
 2418|  60.6k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2419|  60.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|  80.7k|    {
 2409|  80.7k|        return rpos.first_sub(
 2410|  80.7k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  80.7k|    }
_ZN5immer6detail4rbts20concat_rebalance_mutINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERNS1_15regular_sub_posISC_EERNS1_17concat_center_posISC_EERNS1_11relaxed_posISC_EEEENSG_IT_EENSt3__15decayISM_E4type6node_t6edit_tEST_OT0_OT1_ST_OT2_:
 2280|  82.9k|{
 2281|  82.9k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  82.9k|    plan.fill(lpos, cpos, rpos);
 2283|  82.9k|    plan.shuffle(cpos.shift());
 2284|  82.9k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  82.9k|}
_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|  82.9k|    {
 2245|  82.9k|        using node_t    = node_type<CPos>;
 2246|  82.9k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  82.9k|        using visitor_t = concat_merger_mut_visitor;
 2248|  82.9k|        auto lnode      = ((node_t*) lpos.node());
 2249|  82.9k|        auto rnode      = ((node_t*) rpos.node());
 2250|  82.9k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 82.9k, False: 0]
  |  Branch (2250:36): [True: 82.9k, False: 0]
  |  Branch (2250:58): [True: 3.90k, False: 79.0k]
  ------------------
 2251|  82.9k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 82.9k, False: 0]
  |  Branch (2251:36): [True: 82.9k, False: 0]
  |  Branch (2251:58): [True: 3.49k, False: 79.4k]
  ------------------
 2252|  82.9k|        auto merger     = merger_t{ec,
 2253|  82.9k|                               cpos.shift(),
 2254|  82.9k|                               this->counts,
 2255|  82.9k|                               this->n,
 2256|  82.9k|                               el,
 2257|  82.9k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 3.90k, False: 79.0k]
  ------------------
 2258|  82.9k|        IMMER_TRY {
  ------------------
  |  |   49|  82.9k|#define IMMER_TRY try
  ------------------
 2259|  82.9k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  82.9k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  82.9k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 3.49k, False: 79.4k]
  ------------------
 2262|  3.49k|                merger.set_candidate(er, rnode);
 2263|  82.9k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  82.9k|            return merger.finish();
 2265|  82.9k|        }
 2266|  82.9k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  82.9k|    }
_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|   408k|{
 2281|   408k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|   408k|    plan.fill(lpos, cpos, rpos);
 2283|   408k|    plan.shuffle(cpos.shift());
 2284|   408k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|   408k|}
_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|   408k|    {
 2245|   408k|        using node_t    = node_type<CPos>;
 2246|   408k|        using merger_t  = concat_merger_mut<node_t>;
 2247|   408k|        using visitor_t = concat_merger_mut_visitor;
 2248|   408k|        auto lnode      = ((node_t*) lpos.node());
 2249|   408k|        auto rnode      = ((node_t*) rpos.node());
 2250|   408k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 408k, False: 0]
  |  Branch (2250:36): [True: 408k, False: 0]
  |  Branch (2250:58): [True: 389k, False: 18.7k]
  ------------------
 2251|   408k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 0, False: 408k]
  |  Branch (2251:36): [True: 0, False: 0]
  |  Branch (2251:58): [True: 0, False: 0]
  ------------------
 2252|   408k|        auto merger     = merger_t{ec,
 2253|   408k|                               cpos.shift(),
 2254|   408k|                               this->counts,
 2255|   408k|                               this->n,
 2256|   408k|                               el,
 2257|   408k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 389k, False: 18.7k]
  ------------------
 2258|   408k|        IMMER_TRY {
  ------------------
  |  |   49|   408k|#define IMMER_TRY try
  ------------------
 2259|   408k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|   408k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|   408k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 0, False: 408k]
  ------------------
 2262|      0|                merger.set_candidate(er, rnode);
 2263|   408k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|   408k|            return merger.finish();
 2265|   408k|        }
 2266|   408k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|   408k|    }
_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|   228k|    {
 2388|   228k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|   228k|    }
_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.50k|    {
 2388|  1.50k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  1.50k|    }
_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|   301k|{
 2334|   301k|    auto lshift = lpos.shift();
 2335|   301k|    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|   301k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 257k, False: 43.6k]
  ------------------
 2339|   257k|        auto cpos = lpos.last_sub(
 2340|   257k|            concat_left_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2341|   257k|        return concat_rebalance_mut<Node>(
 2342|   257k|            ec, el, lpos, cpos, er, null_sub_pos{});
 2343|   257k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 784, False: 42.8k]
  ------------------
 2344|    784|        auto cpos = rpos.first_sub(
 2345|    784|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    784|        return concat_rebalance_mut<Node>(
 2347|    784|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  42.8k|    } else {
 2349|  42.8k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 42.8k, False: 0]
  ------------------
 2350|  42.8k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 42.8k]
  |  Branch (2350:9): [True: 42.8k, False: 0]
  |  Branch (2350:9): [True: 42.8k, False: 0]
  ------------------
 2351|  42.8k|        auto cpos = lpos.last_sub(
 2352|  42.8k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  42.8k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  42.8k|    }
 2355|   301k|}
_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|   257k|    {
 2367|   257k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2368|   257k|    }
_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.61k|    {
 2388|  2.61k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2389|  2.61k|    }
_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.61k|{
 2334|  2.61k|    auto lshift = lpos.shift();
 2335|  2.61k|    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.61k|    if (lshift > rshift) {
  ------------------
  |  Branch (2338:9): [True: 0, False: 2.61k]
  ------------------
 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.61k|    } else if (lshift < rshift) {
  ------------------
  |  Branch (2343:16): [True: 258, False: 2.35k]
  ------------------
 2344|    258|        auto cpos = rpos.first_sub(
 2345|    258|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2346|    258|        return concat_rebalance_mut<Node>(
 2347|    258|            ec, el, null_sub_pos{}, cpos, er, rpos);
 2348|  2.35k|    } else {
 2349|  2.35k|        assert(lshift == rshift);
  ------------------
  |  Branch (2349:9): [True: 2.35k, False: 0]
  ------------------
 2350|  2.35k|        assert(Node::bits_leaf == 0u || lshift > 0);
  ------------------
  |  Branch (2350:9): [Folded, False: 2.35k]
  |  Branch (2350:9): [True: 2.35k, False: 0]
  |  Branch (2350:9): [True: 2.35k, False: 0]
  ------------------
 2351|  2.35k|        auto cpos = lpos.last_sub(
 2352|  2.35k|            concat_both_mut_visitor<Node>{}, ec, el, tpos, er, rpos);
 2353|  2.35k|        return concat_rebalance_mut<Node>(ec, el, lpos, cpos, er, rpos);
 2354|  2.35k|    }
 2355|  2.61k|}
_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|    545|    {
 2409|    545|        return rpos.first_sub(
 2410|    545|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|    545|    }
_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.35k|{
 2281|  2.35k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  2.35k|    plan.fill(lpos, cpos, rpos);
 2283|  2.35k|    plan.shuffle(cpos.shift());
 2284|  2.35k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  2.35k|}
_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.35k|    {
 2245|  2.35k|        using node_t    = node_type<CPos>;
 2246|  2.35k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  2.35k|        using visitor_t = concat_merger_mut_visitor;
 2248|  2.35k|        auto lnode      = ((node_t*) lpos.node());
 2249|  2.35k|        auto rnode      = ((node_t*) rpos.node());
 2250|  2.35k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 2.35k, False: 0]
  |  Branch (2250:36): [True: 2.35k, False: 0]
  |  Branch (2250:58): [True: 860, False: 1.49k]
  ------------------
 2251|  2.35k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 2.35k, False: 0]
  |  Branch (2251:36): [True: 2.35k, False: 0]
  |  Branch (2251:58): [True: 199, False: 2.16k]
  ------------------
 2252|  2.35k|        auto merger     = merger_t{ec,
 2253|  2.35k|                               cpos.shift(),
 2254|  2.35k|                               this->counts,
 2255|  2.35k|                               this->n,
 2256|  2.35k|                               el,
 2257|  2.35k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 860, False: 1.49k]
  ------------------
 2258|  2.35k|        IMMER_TRY {
  ------------------
  |  |   49|  2.35k|#define IMMER_TRY try
  ------------------
 2259|  2.35k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  2.35k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  2.35k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 199, False: 2.16k]
  ------------------
 2262|    199|                merger.set_candidate(er, rnode);
 2263|  2.35k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  2.35k|            return merger.finish();
 2265|  2.35k|        }
 2266|  2.35k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  2.35k|    }
_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|  1.03k|    {
 2409|  1.03k|        return rpos.first_sub(
 2410|  1.03k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|  1.03k|    }
_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|  42.8k|{
 2281|  42.8k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|  42.8k|    plan.fill(lpos, cpos, rpos);
 2283|  42.8k|    plan.shuffle(cpos.shift());
 2284|  42.8k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|  42.8k|}
_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|  42.8k|    {
 2245|  42.8k|        using node_t    = node_type<CPos>;
 2246|  42.8k|        using merger_t  = concat_merger_mut<node_t>;
 2247|  42.8k|        using visitor_t = concat_merger_mut_visitor;
 2248|  42.8k|        auto lnode      = ((node_t*) lpos.node());
 2249|  42.8k|        auto rnode      = ((node_t*) rpos.node());
 2250|  42.8k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 42.8k, False: 0]
  |  Branch (2250:36): [True: 42.8k, False: 0]
  |  Branch (2250:58): [True: 40.0k, False: 2.80k]
  ------------------
 2251|  42.8k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 42.8k, False: 0]
  |  Branch (2251:36): [True: 42.8k, False: 0]
  |  Branch (2251:58): [True: 383, False: 42.4k]
  ------------------
 2252|  42.8k|        auto merger     = merger_t{ec,
 2253|  42.8k|                               cpos.shift(),
 2254|  42.8k|                               this->counts,
 2255|  42.8k|                               this->n,
 2256|  42.8k|                               el,
 2257|  42.8k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 40.0k, False: 2.80k]
  ------------------
 2258|  42.8k|        IMMER_TRY {
  ------------------
  |  |   49|  42.8k|#define IMMER_TRY try
  ------------------
 2259|  42.8k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|  42.8k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|  42.8k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 383, False: 42.4k]
  ------------------
 2262|    383|                merger.set_candidate(er, rnode);
 2263|  42.8k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|  42.8k|            return merger.finish();
 2265|  42.8k|        }
 2266|  42.8k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|  42.8k|    }
_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|   181k|    {
 2409|   181k|        return rpos.first_sub(
 2410|   181k|            concat_right_mut_visitor<Node>{}, ec, el, lpos, tpos, er);
 2411|   181k|    }
_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|   239k|{
 2281|   239k|    auto plan = concat_rebalance_plan_mut<Node::bits, Node::bits_leaf>{};
 2282|   239k|    plan.fill(lpos, cpos, rpos);
 2283|   239k|    plan.shuffle(cpos.shift());
 2284|   239k|    return plan.merge(ec, el, lpos, cpos, er, rpos);
 2285|   239k|}
_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|   239k|    {
 2245|   239k|        using node_t    = node_type<CPos>;
 2246|   239k|        using merger_t  = concat_merger_mut<node_t>;
 2247|   239k|        using visitor_t = concat_merger_mut_visitor;
 2248|   239k|        auto lnode      = ((node_t*) lpos.node());
 2249|   239k|        auto rnode      = ((node_t*) rpos.node());
 2250|   239k|        auto lmut2      = lnode && lnode->can_relax() && lnode->can_mutate(el);
  ------------------
  |  Branch (2250:27): [True: 239k, False: 0]
  |  Branch (2250:36): [True: 239k, False: 0]
  |  Branch (2250:58): [True: 44.9k, False: 194k]
  ------------------
 2251|   239k|        auto rmut2      = rnode && rnode->can_relax() && rnode->can_mutate(er);
  ------------------
  |  Branch (2251:27): [True: 239k, False: 0]
  |  Branch (2251:36): [True: 239k, False: 0]
  |  Branch (2251:58): [True: 9.52k, False: 230k]
  ------------------
 2252|   239k|        auto merger     = merger_t{ec,
 2253|   239k|                               cpos.shift(),
 2254|   239k|                               this->counts,
 2255|   239k|                               this->n,
 2256|   239k|                               el,
 2257|   239k|                               lmut2 ? lnode : nullptr};
  ------------------
  |  Branch (2257:32): [True: 44.9k, False: 194k]
  ------------------
 2258|   239k|        IMMER_TRY {
  ------------------
  |  |   49|   239k|#define IMMER_TRY try
  ------------------
 2259|   239k|            lpos.each_left_sub(visitor_t{}, merger, el);
 2260|   239k|            cpos.each_sub(visitor_t{}, merger, ec);
 2261|   239k|            if (rmut2)
  ------------------
  |  Branch (2261:17): [True: 9.52k, False: 230k]
  ------------------
 2262|  9.52k|                merger.set_candidate(er, rnode);
 2263|   239k|            rpos.each_right_sub(visitor_t{}, merger, er);
 2264|   239k|            return merger.finish();
 2265|   239k|        }
 2266|   239k|        IMMER_CATCH (...) {
 2267|      0|            merger.abort();
 2268|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
 2269|      0|        }
 2270|   239k|    }
_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|  42.7k|    {
 2433|  42.7k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  42.7k|    }
_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.00k|    {
 2452|  6.00k|        return visit_maybe_relaxed_sub(args...,
 2453|  6.00k|                                       concat_trees_right_mut_visitor<Node>{},
 2454|  6.00k|                                       ec,
 2455|  6.00k|                                       el,
 2456|  6.00k|                                       lpos,
 2457|  6.00k|                                       tpos,
 2458|  6.00k|                                       er);
 2459|  6.00k|    }
_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.52k|    {
 2433|  3.52k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  3.52k|    }
_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.48k|    {
 2433|  2.48k|        return concat_inners_mut<Node>(ec, el, lpos, tpos, er, rpos);
 2434|  2.48k|    }

_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_11dec_visitorEJEEEDcPT_jmT0_DpOT1_:
 1838|   242k|{
 1839|   242k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 242k, False: 0]
  ------------------
 1840|   242k|    auto relaxed = node->relaxed();
 1841|   242k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 198k, False: 43.4k]
  ------------------
 1842|   198k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 198k, False: 0]
  ------------------
 1843|   198k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   198k|            .visit(v, std::forward<Args>(args)...);
 1845|   198k|    } else {
 1846|  43.4k|        return make_regular_sub_pos(node, shift, size)
 1847|  43.4k|            .visit(v, std::forward<Args>(args)...);
 1848|  43.4k|    }
 1849|   242k|}
_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.4M|{
 1829|  11.4M|    assert(node);
  ------------------
  |  Branch (1829:5): [True: 11.4M, False: 0]
  ------------------
 1830|  11.4M|    assert(relaxed);
  ------------------
  |  Branch (1830:5): [True: 11.4M, False: 0]
  ------------------
 1831|  11.4M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1831:5): [True: 11.4M, False: 0]
  ------------------
 1832|  11.4M|    return {node, shift, relaxed};
 1833|  11.4M|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1813|   648k|    {
 1814|   648k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   648k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
 1431|  7.27M|    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.0M|    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.22M|{
 1045|  2.22M|    assert(node);
  ------------------
  |  Branch (1045:5): [True: 2.22M, False: 0]
  ------------------
 1046|  2.22M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1046:5): [True: 2.22M, False: 0]
  ------------------
 1047|  2.22M|    assert(size > 0);
  ------------------
  |  Branch (1047:5): [True: 2.22M, False: 0]
  ------------------
 1048|  2.22M|    assert(size <= (branches<NodeT::bits, size_t> << shift));
  ------------------
  |  Branch (1048:5): [True: 2.22M, False: 0]
  ------------------
 1049|  2.22M|    return {node, shift, size};
 1050|  2.22M|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1036|  54.7k|    {
 1037|  54.7k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  54.7k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  785|  4.25M|    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.53M|    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|   282k|{
  215|   282k|    assert(node);
  ------------------
  |  Branch (215:5): [True: 282k, False: 0]
  ------------------
  216|   282k|    return {node};
  217|   282k|}
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  207|  5.71k|    {
  208|  5.71k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  5.71k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  199|   200k|    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|   280k|    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|   171k|{
  120|   171k|    assert(node);
  ------------------
  |  Branch (120:5): [True: 171k, False: 0]
  ------------------
  121|   171k|    assert(size > 0);
  ------------------
  |  Branch (121:5): [True: 171k, False: 0]
  ------------------
  122|   171k|    return {node, size};
  123|   171k|}
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  786|  7.18M|    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.47k|    {
  113|  2.47k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.47k|    }
_ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  104|   174k|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
  103|   328k|    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|   338k|    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|   331k|{
 1413|   331k|    assert(node);
  ------------------
  |  Branch (1413:5): [True: 331k, False: 0]
  ------------------
 1414|   331k|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (1414:5): [True: 331k, False: 0]
  ------------------
 1415|   331k|    return {node, shift};
 1416|   331k|}
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
 1405|  8.45k|    {
 1406|  8.45k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  8.45k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
 1159|   197k|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5countEv:
 1158|   290k|    count_t count() const { return branches<B>; }
_ZN5immer6detail4rbts16make_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_11regular_posIT_EEPSE_jm:
  690|  9.39M|{
  691|  9.39M|    assert(node);
  ------------------
  |  Branch (691:5): [True: 9.39M, False: 0]
  ------------------
  692|  9.39M|    assert(shift >= NodeT::bits_leaf);
  ------------------
  |  Branch (692:5): [True: 9.39M, False: 0]
  ------------------
  693|  9.39M|    assert(size > 0);
  ------------------
  |  Branch (693:5): [True: 9.39M, False: 0]
  ------------------
  694|  9.39M|    return {node, shift, size};
  695|  9.39M|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  336|  3.58k|    {
  337|  3.58k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  3.58k|    }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  231|  17.0M|    node_t* node() const { return node_; }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  233|  17.0M|    shift_t shift() const { return shift_; }
_ZNK5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  232|  35.7M|    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.66M|    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|  26.4M|    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|  2.80M|    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|  2.82M|    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|   418k|{
   65|   418k|    return {node};
   66|   418k|}
_ZN5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
   57|   418k|    {
   58|   418k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
   59|   418k|    }
_ZNK5immer6detail4rbts17empty_regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
   41|   418k|    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.70M|{
  152|  2.70M|    assert(node);
  ------------------
  |  Branch (152:5): [True: 2.70M, False: 0]
  ------------------
  153|  2.70M|    assert(count <= branches<NodeT::bits_leaf>);
  ------------------
  |  Branch (153:5): [True: 2.70M, False: 0]
  ------------------
  154|  2.70M|    return {node, count};
  155|  2.70M|}
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
  144|   494k|    {
  145|   494k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   494k|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
  136|  1.76M|    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.20M|    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|   365k|{
   89|   365k|    assert(node);
  ------------------
  |  Branch (89:5): [True: 365k, False: 0]
  ------------------
   90|   365k|    return {node};
   91|   365k|}
_ZN5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_11dec_visitorEJEEEDcT_DpOT0_:
   81|   365k|    {
   82|   365k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
   83|   365k|    }
_ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4nodeEv:
   75|   365k|    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.4k|    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|  44.3k|    {
 1814|  44.3k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  44.3k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1433|  3.08M|    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.61M|    {
 1444|  2.61M|        return size_sbh(offset, size_before(offset));
 1445|  2.61M|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
 1448|  2.72M|    {
 1449|  2.72M|        assert(size_before_hint == size_before(offset));
  ------------------
  |  Branch (1449:9): [True: 2.72M, False: 0]
  ------------------
 1450|  2.72M|        return relaxed_->d.sizes[offset] - size_before_hint;
 1451|  2.72M|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11size_beforeEj:
 1438|  5.66M|    {
 1439|  5.66M|        return offset ? relaxed_->d.sizes[offset - 1] : 0;
  ------------------
  |  Branch (1439:16): [True: 4.71M, False: 953k]
  ------------------
 1440|  5.66M|    }
_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|  40.3k|    {
 1738|  40.3k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 40.3k, False: 0]
  ------------------
 1739|  40.3k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 40.3k, False: 0]
  ------------------
 1740|  40.3k|        auto child   = node_->inner()[offset_hint];
 1741|  40.3k|        auto is_leaf = shift_ == BL;
 1742|  40.3k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 40.3k]
  ------------------
 1743|  40.3k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|  40.3k|                   : visit_maybe_relaxed_sub(
 1745|  40.3k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|  40.3k|    }
_ZN5immer6detail4rbts23visit_maybe_relaxed_subINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcPT_jmT0_DpOT1_:
 1838|  40.3k|{
 1839|  40.3k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 40.3k, False: 0]
  ------------------
 1840|  40.3k|    auto relaxed = node->relaxed();
 1841|  40.3k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 33.2k, False: 7.12k]
  ------------------
 1842|  33.2k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 33.2k, False: 0]
  ------------------
 1843|  33.2k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  33.2k|            .visit(v, std::forward<Args>(args)...);
 1845|  33.2k|    } else {
 1846|  7.12k|        return make_regular_sub_pos(node, shift, size)
 1847|  7.12k|            .visit(v, std::forward<Args>(args)...);
 1848|  7.12k|    }
 1849|  40.3k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_RjEEEDcT_DpOT0_:
 1036|  7.12k|    {
 1037|  7.12k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  7.12k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  788|  3.62M|    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|  7.69k|    {
  953|  7.69k|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  7.69k|    }
_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|  7.69k|{
  678|  7.69k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 7.69k, False: 0]
  ------------------
  679|  7.69k|    constexpr auto B  = bits<Pos>;
  680|  7.69k|    constexpr auto BL = bits_leaf<Pos>;
  681|  7.69k|    auto child        = p.node()->inner()[offset_hint];
  682|  7.69k|    auto is_leaf      = p.shift() == BL;
  683|  7.69k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 7.69k]
  ------------------
  684|  7.69k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  7.69k|                         .visit(v, args...);
  686|  7.69k|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17push_tail_visitorISC_EEJRPSC_EEEDcT_DpOT0_:
  336|  28.6k|    {
  337|  28.6k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  28.6k|    }
_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|  20.9k|    {
  331|  20.9k|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  20.9k|    }
_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|  20.9k|{
  678|  20.9k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 20.9k, False: 0]
  ------------------
  679|  20.9k|    constexpr auto B  = bits<Pos>;
  680|  20.9k|    constexpr auto BL = bits_leaf<Pos>;
  681|  20.9k|    auto child        = p.node()->inner()[offset_hint];
  682|  20.9k|    auto is_leaf      = p.shift() == BL;
  683|  20.9k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 20.9k]
  ------------------
  684|  20.9k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  20.9k|                         .visit(v, args...);
  686|  20.9k|}
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
 1432|  5.03M|    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.04k|    {
 1037|  4.04k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.04k|    }
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|    612|    {
  145|    612|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    612|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  139|  35.8k|    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|  30.8k|{
 1839|  30.8k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 30.8k, False: 0]
  ------------------
 1840|  30.8k|    auto relaxed = node->relaxed();
 1841|  30.8k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 28.9k, False: 1.88k]
  ------------------
 1842|  28.9k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 28.9k, False: 0]
  ------------------
 1843|  28.9k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  28.9k|            .visit(v, std::forward<Args>(args)...);
 1845|  28.9k|    } else {
 1846|  1.88k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.88k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.88k|    }
 1849|  30.8k|}
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|  28.9k|    {
 1814|  28.9k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  28.9k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
 1454|   807k|    {
 1455|   807k|        auto offset = idx >> shift_;
 1456|   954k|        while (relaxed_->d.sizes[offset] <= idx)
  ------------------
  |  Branch (1456:16): [True: 147k, False: 807k]
  ------------------
 1457|   147k|            ++offset;
 1458|   807k|        return offset;
 1459|   807k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7relaxedEv:
 1435|  28.9k|    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|  28.9k|    {
 1687|  28.9k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 28.9k, False: 0]
  ------------------
 1688|  28.9k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 2.29k, False: 26.6k]
  ------------------
 1689|  28.9k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  28.9k|    }
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|  28.9k|    {
 1699|  28.9k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  28.9k|    }
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|  28.9k|    {
 1718|  28.9k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 28.9k, False: 0]
  ------------------
 1719|  28.9k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 2.29k, False: 26.6k]
  |  Branch (1719:9): [True: 28.9k, False: 0]
  ------------------
 1720|  28.9k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  28.9k|        auto child     = node_->inner()[offset_hint];
 1722|  28.9k|        auto is_leaf   = shift_ == BL;
 1723|  28.9k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  28.9k|        auto next_idx  = idx - left_size_hint;
 1725|  28.9k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 3.22k, False: 25.7k]
  ------------------
 1726|  28.9k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  3.22k|                         .visit(v, next_idx, args...)
 1728|  28.9k|                   : visit_maybe_relaxed_sub(
 1729|  25.7k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  28.9k|    }
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.22k|    {
  145|  3.22k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.22k|    }
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.88k|    {
 1037|  1.88k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.88k|    }
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.88k|    {
  939|  1.88k|        return towards_oh_ch_regular(
  940|  1.88k|            *this, v, idx, offset_hint, count(), args...);
  941|  1.88k|    }
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.88k|{
  633|  1.88k|    constexpr auto B  = bits<Pos>;
  634|  1.88k|    constexpr auto BL = bits_leaf<Pos>;
  635|  1.88k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 1.88k, False: 0]
  ------------------
  636|  1.88k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 1.88k, False: 0]
  ------------------
  637|  1.88k|    auto is_leaf = p.shift() == BL;
  638|  1.88k|    auto child   = p.node()->inner()[offset_hint];
  639|  1.88k|    auto is_full = offset_hint + 1 != count_hint;
  640|  1.88k|    return is_full
  ------------------
  |  Branch (640:12): [True: 877, False: 1.00k]
  ------------------
  641|  1.88k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 310, False: 567]
  ------------------
  642|    877|                          : make_full_pos(child, p.shift() - B)
  643|    567|                                .visit(v, idx, args...))
  644|  1.88k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 229, False: 780]
  ------------------
  645|  1.00k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.00k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    780|                            .visit(v, idx, args...));
  648|  1.88k|}
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.31k|    {
  208|  1.31k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.31k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
  202|  27.1k|    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.33k|    {
 1406|  1.33k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.33k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5indexEm:
 1162|  51.4k|    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.33k|    {
 1330|  1.33k|        return towards_oh(v, idx, offset_hint, args...);
 1331|  1.33k|    }
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.33k|    {
 1337|  1.33k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.33k, False: 0]
  ------------------
 1338|  1.33k|        auto is_leaf = shift_ == BL;
 1339|  1.33k|        auto child   = node_->inner()[offset_hint];
 1340|  1.33k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 769, False: 569]
  ------------------
 1341|  1.33k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.33k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.33k|    }
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|    572|    {
  113|    572|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    572|    }
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.18k|    {
  337|  1.18k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  1.18k|    }
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.18k|    {
  317|  1.18k|        return towards_oh_ch_regular(
  318|  1.18k|            *this, v, idx, offset_hint, count(), args...);
  319|  1.18k|    }
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.18k|{
  633|  1.18k|    constexpr auto B  = bits<Pos>;
  634|  1.18k|    constexpr auto BL = bits_leaf<Pos>;
  635|  1.18k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 1.18k, False: 0]
  ------------------
  636|  1.18k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 1.18k, False: 0]
  ------------------
  637|  1.18k|    auto is_leaf = p.shift() == BL;
  638|  1.18k|    auto child   = p.node()->inner()[offset_hint];
  639|  1.18k|    auto is_full = offset_hint + 1 != count_hint;
  640|  1.18k|    return is_full
  ------------------
  |  Branch (640:12): [True: 437, False: 746]
  ------------------
  641|  1.18k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 235, False: 202]
  ------------------
  642|    437|                          : make_full_pos(child, p.shift() - B)
  643|    202|                                .visit(v, idx, args...))
  644|  1.18k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 343, False: 403]
  ------------------
  645|    746|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    746|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    403|                            .visit(v, idx, args...));
  648|  1.18k|}
_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|  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: 11.8k, False: 4.96k]
  ------------------
 1842|  11.8k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 11.8k, False: 0]
  ------------------
 1843|  11.8k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  11.8k|            .visit(v, std::forward<Args>(args)...);
 1845|  11.8k|    } else {
 1846|  4.96k|        return make_regular_sub_pos(node, shift, size)
 1847|  4.96k|            .visit(v, std::forward<Args>(args)...);
 1848|  4.96k|    }
 1849|  16.7k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1813|  11.8k|    {
 1814|  11.8k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  11.8k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1686|  8.35k|    {
 1687|  8.35k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 8.35k, False: 0]
  ------------------
 1688|  8.35k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 8.35k]
  ------------------
 1689|  8.35k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  8.35k|    }
_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|  8.35k|    {
 1699|  8.35k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  8.35k|    }
_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|  8.35k|    {
 1718|  8.35k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 8.35k, False: 0]
  ------------------
 1719|  8.35k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 8.35k]
  |  Branch (1719:9): [True: 8.35k, False: 0]
  ------------------
 1720|  8.35k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  8.35k|        auto child     = node_->inner()[offset_hint];
 1722|  8.35k|        auto is_leaf   = shift_ == BL;
 1723|  8.35k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  8.35k|        auto next_idx  = idx - left_size_hint;
 1725|  8.35k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 741, False: 7.61k]
  ------------------
 1726|  8.35k|                   ? make_leaf_sub_pos(child, next_size)
 1727|    741|                         .visit(v, next_idx, args...)
 1728|  8.35k|                   : visit_maybe_relaxed_sub(
 1729|  7.61k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  8.35k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
  144|    741|    {
  145|    741|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    741|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1686|  7.61k|    {
 1687|  7.61k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 7.61k, False: 0]
  ------------------
 1688|  7.61k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 5.29k, False: 2.31k]
  ------------------
 1689|  7.61k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  7.61k|    }
_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|  7.61k|    {
 1699|  7.61k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  7.61k|    }
_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|  7.61k|    {
 1718|  7.61k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 7.61k, False: 0]
  ------------------
 1719|  7.61k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 5.29k, False: 2.31k]
  |  Branch (1719:9): [True: 7.61k, False: 0]
  ------------------
 1720|  7.61k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  7.61k|        auto child     = node_->inner()[offset_hint];
 1722|  7.61k|        auto is_leaf   = shift_ == BL;
 1723|  7.61k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  7.61k|        auto next_idx  = idx - left_size_hint;
 1725|  7.61k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 2.17k, False: 5.43k]
  ------------------
 1726|  7.61k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  2.17k|                         .visit(v, next_idx, args...)
 1728|  7.61k|                   : visit_maybe_relaxed_sub(
 1729|  5.43k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  7.61k|    }
_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.17k|    {
  145|  2.17k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  2.17k|    }
_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.43k|{
 1839|  5.43k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 5.43k, False: 0]
  ------------------
 1840|  5.43k|    auto relaxed = node->relaxed();
 1841|  5.43k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 4.16k, False: 1.27k]
  ------------------
 1842|  4.16k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 4.16k, False: 0]
  ------------------
 1843|  4.16k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  4.16k|            .visit(v, std::forward<Args>(args)...);
 1845|  4.16k|    } 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|  5.43k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1813|  4.16k|    {
 1814|  4.16k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.16k|    }
_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.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_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
  927|  3.60k|    {
  928|  3.60k|        return towards_oh_ch_regular(
  929|  3.60k|            *this, v, idx, offset_hint, count(), args...);
  930|  3.60k|    }
_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.60k|{
  633|  3.60k|    constexpr auto B  = bits<Pos>;
  634|  3.60k|    constexpr auto BL = bits_leaf<Pos>;
  635|  3.60k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 3.60k, False: 0]
  ------------------
  636|  3.60k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 3.60k, False: 0]
  ------------------
  637|  3.60k|    auto is_leaf = p.shift() == BL;
  638|  3.60k|    auto child   = p.node()->inner()[offset_hint];
  639|  3.60k|    auto is_full = offset_hint + 1 != count_hint;
  640|  3.60k|    return is_full
  ------------------
  |  Branch (640:12): [True: 1.07k, False: 2.52k]
  ------------------
  641|  3.60k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 418, False: 657]
  ------------------
  642|  1.07k|                          : make_full_pos(child, p.shift() - B)
  643|    657|                                .visit(v, idx, args...))
  644|  3.60k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 813, False: 1.71k]
  ------------------
  645|  2.52k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.52k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.71k|                            .visit(v, idx, args...));
  648|  3.60k|}
_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.80k|    {
  208|  2.80k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  2.80k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1405|  1.85k|    {
 1406|  1.85k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.85k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1336|  2.90k|    {
 1337|  2.90k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 2.90k, False: 0]
  ------------------
 1338|  2.90k|        auto is_leaf = shift_ == BL;
 1339|  2.90k|        auto child   = node_->inner()[offset_hint];
 1340|  2.90k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 1.91k, False: 992]
  ------------------
 1341|  2.90k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  2.90k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  2.90k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
 1161|  41.1k|    shift_t shift() const { return shift_; }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  112|  1.85k|    {
  113|  1.85k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  1.85k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
  336|  2.48k|    {
  337|  2.48k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.48k|    }
_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.48k|    {
  306|  2.48k|        return towards_oh_ch_regular(
  307|  2.48k|            *this, v, idx, offset_hint, count(), args...);
  308|  2.48k|    }
_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.48k|{
  633|  2.48k|    constexpr auto B  = bits<Pos>;
  634|  2.48k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.48k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.48k, False: 0]
  ------------------
  636|  2.48k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.48k, False: 0]
  ------------------
  637|  2.48k|    auto is_leaf = p.shift() == BL;
  638|  2.48k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.48k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.48k|    return is_full
  ------------------
  |  Branch (640:12): [True: 674, False: 1.81k]
  ------------------
  641|  2.48k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 468, False: 206]
  ------------------
  642|    674|                          : make_full_pos(child, p.shift() - B)
  643|    206|                                .visit(v, idx, args...))
  644|  2.48k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.03k, False: 772]
  ------------------
  645|  1.81k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.81k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    772|                            .visit(v, idx, args...));
  648|  2.48k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1036|  4.96k|    {
 1037|  4.96k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.96k|    }
_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.63k|    {
  928|  2.63k|        return towards_oh_ch_regular(
  929|  2.63k|            *this, v, idx, offset_hint, count(), args...);
  930|  2.63k|    }
_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.63k|{
  633|  2.63k|    constexpr auto B  = bits<Pos>;
  634|  2.63k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.63k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.63k, False: 0]
  ------------------
  636|  2.63k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.63k, False: 0]
  ------------------
  637|  2.63k|    auto is_leaf = p.shift() == BL;
  638|  2.63k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.63k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.63k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.19k, False: 440]
  ------------------
  641|  2.63k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 580, False: 1.61k]
  ------------------
  642|  2.19k|                          : make_full_pos(child, p.shift() - B)
  643|  1.61k|                                .visit(v, idx, args...))
  644|  2.63k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 440, False: 0]
  ------------------
  645|    440|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    440|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .visit(v, idx, args...));
  648|  2.63k|}
_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.14k|    {
  208|  1.14k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.14k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1405|  2.01k|    {
 1406|  2.01k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.01k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_19slice_right_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1336|    958|    {
 1337|    958|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 958, False: 0]
  ------------------
 1338|    958|        auto is_leaf = shift_ == BL;
 1339|    958|        auto child   = node_->inner()[offset_hint];
 1340|    958|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 560, False: 398]
  ------------------
 1341|    958|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|    958|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|    958|    }
_ZN5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_19slice_right_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
  112|    440|    {
  113|    440|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    440|    }
_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.8k|{
 1839|  16.8k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 16.8k, False: 0]
  ------------------
 1840|  16.8k|    auto relaxed = node->relaxed();
 1841|  16.8k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 14.4k, False: 2.36k]
  ------------------
 1842|  14.4k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 14.4k, False: 0]
  ------------------
 1843|  14.4k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  14.4k|            .visit(v, std::forward<Args>(args)...);
 1845|  14.4k|    } else {
 1846|  2.36k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.36k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.36k|    }
 1849|  16.8k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJRmEEEDcT_DpOT0_:
 1813|  14.4k|    {
 1814|  14.4k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  14.4k|    }
_ZNK5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8subindexEm:
 1434|   109k|    count_t subindex(size_t idx) const { return index(idx); }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjDpOT0_:
 1705|  1.36k|    {
 1706|  1.36k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1706:9): [True: 1.36k, False: 0]
  ------------------
 1707|  1.36k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1707:26): [True: 866, False: 494]
  ------------------
 1708|  1.36k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...);
 1709|  1.36k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_18slice_left_visitorISC_Lb1EEEJEEEDcT_mjmDpOT0_:
 1717|  1.36k|    {
 1718|  1.36k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 1.36k, False: 0]
  ------------------
 1719|  1.36k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 866, False: 494]
  |  Branch (1719:9): [True: 1.36k, False: 0]
  ------------------
 1720|  1.36k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  1.36k|        auto child     = node_->inner()[offset_hint];
 1722|  1.36k|        auto is_leaf   = shift_ == BL;
 1723|  1.36k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  1.36k|        auto next_idx  = idx - left_size_hint;
 1725|  1.36k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 0, False: 1.36k]
  ------------------
 1726|  1.36k|                   ? make_leaf_sub_pos(child, next_size)
 1727|      0|                         .visit(v, next_idx, args...)
 1728|  1.36k|                   : visit_maybe_relaxed_sub(
 1729|  1.36k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  1.36k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_sub_ohINS1_18slice_left_visitorISC_Lb0EEEJEEEDcT_mjDpOT0_:
 1705|   107k|    {
 1706|   107k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1706:9): [True: 107k, False: 0]
  ------------------
 1707|   107k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1707:26): [True: 19.8k, False: 87.9k]
  ------------------
 1708|   107k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size, args...);
 1709|   107k|    }
_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|   107k|    {
 1718|   107k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 107k, False: 0]
  ------------------
 1719|   107k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 19.8k, False: 87.9k]
  |  Branch (1719:9): [True: 107k, False: 0]
  ------------------
 1720|   107k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|   107k|        auto child     = node_->inner()[offset_hint];
 1722|   107k|        auto is_leaf   = shift_ == BL;
 1723|   107k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|   107k|        auto next_idx  = idx - left_size_hint;
 1725|   107k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 11.6k, False: 96.1k]
  ------------------
 1726|   107k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  11.6k|                         .visit(v, next_idx, args...)
 1728|   107k|                   : visit_maybe_relaxed_sub(
 1729|  96.1k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|   107k|    }
_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.6k|    {
  145|  11.6k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  11.6k|    }
_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|  96.1k|{
 1839|  96.1k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 96.1k, False: 0]
  ------------------
 1840|  96.1k|    auto relaxed = node->relaxed();
 1841|  96.1k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 94.6k, False: 1.48k]
  ------------------
 1842|  94.6k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 94.6k, False: 0]
  ------------------
 1843|  94.6k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  94.6k|            .visit(v, std::forward<Args>(args)...);
 1845|  94.6k|    } 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|  96.1k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJRmEEEDcT_DpOT0_:
 1813|  94.6k|    {
 1814|  94.6k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  94.6k|    }
_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.48k|    {
 1037|  1.48k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.48k|    }
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE11size_beforeEj:
  791|  12.3k|    {
  792|  12.3k|        return size_t{offset} << shift_;
  793|  12.3k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
  803|  4.20k|    {
  804|  4.20k|        assert(size_before_hint == size_before(offset));
  ------------------
  |  Branch (804:9): [True: 4.20k, False: 0]
  ------------------
  805|  4.20k|        return offset == subindex(size_ - 1) ? size_ - size_before_hint
  ------------------
  |  Branch (805:16): [True: 2.20k, False: 1.99k]
  ------------------
  806|  4.20k|                                             : size_t{1} << shift_;
  807|  4.20k|    }
_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.04k|    {
  947|  3.04k|        return towards_sub_oh_regular(*this, v, idx, offset_hint, args...);
  948|  3.04k|    }
_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.04k|{
  654|  3.04k|    constexpr auto B  = bits<Pos>;
  655|  3.04k|    constexpr auto BL = bits_leaf<Pos>;
  656|  3.04k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (656:5): [True: 3.04k, False: 0]
  ------------------
  657|  3.04k|    auto is_leaf = p.shift() == BL;
  658|  3.04k|    auto child   = p.node()->inner()[offset_hint];
  659|  3.04k|    auto lsize   = offset_hint << p.shift();
  660|  3.04k|    auto size    = p.this_size();
  661|  3.04k|    auto is_full = (size - lsize) >= (size_t{1} << p.shift());
  662|  3.04k|    return is_full
  ------------------
  |  Branch (662:12): [True: 3.04k, False: 0]
  ------------------
  663|  3.04k|               ? (is_leaf
  ------------------
  |  Branch (663:19): [True: 1.75k, False: 1.28k]
  ------------------
  664|  3.04k|                      ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
  665|  3.04k|                      : make_full_pos(child, p.shift() - B)
  666|  1.28k|                            .visit(v, idx - lsize, args...))
  667|  3.04k|               : (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.04k|}
_ZNK5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9this_sizeEv:
  794|  4.20k|    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|  3.85k|    {
  208|  3.85k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  3.85k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb0EEEJmEEEDcT_DpOT0_:
 1405|  2.56k|    {
 1406|  2.56k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.56k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8subindexEm:
 1163|  3.62k|    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.62k|    {
 1171|  3.62k|        return size_t{offset} << shift_;
 1172|  3.62k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8size_sbhEjm:
 1166|  3.62k|    {
 1167|  3.62k|        return size_t{1} << shift_;
 1168|  3.62k|    }
_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.36k|    {
 1349|  3.36k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1349:9): [True: 3.36k, False: 0]
  ------------------
 1350|  3.36k|        auto is_leaf = shift_ == BL;
 1351|  3.36k|        auto child   = node_->inner()[offset_hint];
 1352|  3.36k|        auto lsize   = size_t{offset_hint} << shift_;
 1353|  3.36k|        return is_leaf
  ------------------
  |  Branch (1353:16): [True: 2.09k, False: 1.27k]
  ------------------
 1354|  3.36k|                   ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
 1355|  3.36k|                   : make_full_pos(child, shift_ - B)
 1356|  1.27k|                         .visit(v, idx - lsize, args...);
 1357|  3.36k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10copy_sizesEjjmPm:
 1175|  3.36k|    {
 1176|  3.36k|        auto e = sizes + n;
 1177|  9.27k|        for (; sizes != e; ++sizes) {
  ------------------
  |  Branch (1177:16): [True: 5.90k, False: 3.36k]
  ------------------
 1178|  5.90k|            init = *sizes = init + (size_t{1} << shift_);
 1179|       |            assert(init);
  ------------------
  |  Branch (1179:13): [True: 5.90k, False: 0]
  ------------------
 1180|  5.90k|        }
 1181|  3.36k|    }
_ZNK5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
 1160|   143k|    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|  6.97k|    {
  811|  6.97k|        if (n) {
  ------------------
  |  Branch (811:13): [True: 5.93k, False: 1.04k]
  ------------------
  812|  5.93k|            auto last = offset + n - 1;
  813|  5.93k|            auto e    = sizes + n - 1;
  814|  11.6k|            for (; sizes != e; ++sizes) {
  ------------------
  |  Branch (814:20): [True: 5.74k, False: 5.93k]
  ------------------
  815|  5.74k|                init = *sizes = init + (size_t{1} << shift_);
  816|  5.74k|                assert(init);
  ------------------
  |  Branch (816:17): [True: 5.74k, False: 0]
  ------------------
  817|  5.74k|            }
  818|  5.93k|            *sizes = init + size(last);
  819|       |            assert(*sizes);
  ------------------
  |  Branch (819:13): [True: 5.93k, False: 0]
  ------------------
  820|  5.93k|        }
  821|  6.97k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEj:
  797|  5.93k|    {
  798|  5.93k|        return offset == subindex(size_ - 1) ? size_ - size_before(offset)
  ------------------
  |  Branch (798:16): [True: 3.96k, False: 1.96k]
  ------------------
  799|  5.93k|                                             : size_t{1} << shift_;
  800|  5.93k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10copy_sizesEjjmPm:
 1462|   208k|    {
 1463|   208k|        auto e     = sizes + n;
 1464|   208k|        auto prev  = size_before(offset);
 1465|   208k|        auto these = relaxed_->d.sizes + offset;
 1466|   572k|        for (; sizes != e; ++sizes, ++these) {
  ------------------
  |  Branch (1466:16): [True: 363k, False: 208k]
  ------------------
 1467|   363k|            auto this_size = *these;
 1468|   363k|            init = *sizes = init + (this_size - prev);
 1469|   363k|            assert(init);
  ------------------
  |  Branch (1469:13): [True: 363k, False: 0]
  ------------------
 1470|   363k|            prev = this_size;
 1471|   363k|        }
 1472|   208k|    }
_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.36k|    {
 1037|  2.36k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.36k|    }
_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.16k|    {
  947|  1.16k|        return towards_sub_oh_regular(*this, v, idx, offset_hint, args...);
  948|  1.16k|    }
_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.16k|{
  654|  1.16k|    constexpr auto B  = bits<Pos>;
  655|  1.16k|    constexpr auto BL = bits_leaf<Pos>;
  656|  1.16k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (656:5): [True: 1.16k, False: 0]
  ------------------
  657|  1.16k|    auto is_leaf = p.shift() == BL;
  658|  1.16k|    auto child   = p.node()->inner()[offset_hint];
  659|  1.16k|    auto lsize   = offset_hint << p.shift();
  660|  1.16k|    auto size    = p.this_size();
  661|  1.16k|    auto is_full = (size - lsize) >= (size_t{1} << p.shift());
  662|  1.16k|    return is_full
  ------------------
  |  Branch (662:12): [True: 807, False: 356]
  ------------------
  663|  1.16k|               ? (is_leaf
  ------------------
  |  Branch (663:19): [True: 0, False: 807]
  ------------------
  664|    807|                      ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
  665|    807|                      : make_full_pos(child, p.shift() - B)
  666|    807|                            .visit(v, idx - lsize, args...))
  667|  1.16k|               : (is_leaf
  ------------------
  |  Branch (667:19): [True: 0, False: 356]
  ------------------
  668|    356|                      ? make_leaf_sub_pos(child, size - lsize)
  669|      0|                            .visit(v, idx - lsize, args...)
  670|    356|                      : make_regular_sub_pos(child, p.shift() - B, size - lsize)
  671|    356|                            .visit(v, idx - lsize, args...));
  672|  1.16k|}
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_:
 1405|  1.06k|    {
 1406|  1.06k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.06k|    }
_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|    260|    {
 1349|    260|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1349:9): [True: 260, False: 0]
  ------------------
 1350|    260|        auto is_leaf = shift_ == BL;
 1351|    260|        auto child   = node_->inner()[offset_hint];
 1352|    260|        auto lsize   = size_t{offset_hint} << shift_;
 1353|    260|        return is_leaf
  ------------------
  |  Branch (1353:16): [True: 0, False: 260]
  ------------------
 1354|    260|                   ? make_full_leaf_pos(child).visit(v, idx - lsize, args...)
 1355|    260|                   : make_full_pos(child, shift_ - B)
 1356|    260|                         .visit(v, idx - lsize, args...);
 1357|    260|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_18slice_left_visitorISC_Lb1EEEJmEEEDcT_DpOT0_:
 1036|    356|    {
 1037|    356|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    356|    }
_ZN5immer6detail4rbts30make_singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEDaPT_j:
  766|  10.4k|{
  767|  10.4k|    assert(leaf);
  ------------------
  |  Branch (767:5): [True: 10.4k, False: 0]
  ------------------
  768|  10.4k|    IMMER_ASSERT_TAGGED(leaf->kind() == NodeT::kind_t::leaf);
  ------------------
  |  |   68|  10.4k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (768:5): [True: 10.4k, False: 0]
  ------------------
  769|  10.4k|    assert(count > 0);
  ------------------
  |  Branch (769:5): [True: 10.4k, False: 0]
  ------------------
  770|  10.4k|    return singleton_regular_sub_pos<NodeT>{leaf, count};
  771|  10.4k|}
_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.41k|    {
  760|  3.41k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  761|  3.41k|    }
_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.41k|{
 1839|  3.41k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 3.41k, False: 0]
  ------------------
 1840|  3.41k|    auto relaxed = node->relaxed();
 1841|  3.41k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 2.09k, False: 1.32k]
  ------------------
 1842|  2.09k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 2.09k, False: 0]
  ------------------
 1843|  2.09k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  2.09k|            .visit(v, std::forward<Args>(args)...);
 1845|  2.09k|    } else {
 1846|  1.32k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.32k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.32k|    }
 1849|  3.41k|}
_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|  2.09k|    {
 1814|  2.09k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  2.09k|    }
_ZNK5immer6detail4rbts25singleton_regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  735|  31.0k|    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.4k|    {
  745|  10.4k|    }
_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|   949k|    {
  145|   949k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   949k|    }
_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.07M|    {
 1814|  4.07M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.07M|    }
_ZN5immer6detail4rbts12null_sub_pos14each_right_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  707|   419k|    {
  708|   419k|    }
_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.41k|    {
  745|  3.41k|    }
_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|   345k|    {
  145|   345k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   345k|    }
_ZNK5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  137|   949k|    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.42M|    {
 1814|  1.42M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.42M|    }
_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|  7.93k|    {
  708|  7.93k|    }
_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|  6.65k|    {
 1763|  6.65k|        auto child      = node_->inner()[0];
 1764|  6.65k|        auto child_size = relaxed_->d.sizes[0];
 1765|  6.65k|        auto is_leaf    = shift_ == BL;
 1766|  6.65k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 6.65k, False: 0]
  ------------------
 1767|  6.65k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 6.65k]
  ------------------
 1768|  6.65k|                       : visit_maybe_relaxed_sub(
 1769|  6.65k|                             child, shift_ - B, child_size, v, args...);
 1770|  6.65k|    }
_ZNK5immer6detail4rbts14empty_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
   76|  10.4k|    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|   614k|    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|  6.65k|{
 1839|  6.65k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 6.65k, False: 0]
  ------------------
 1840|  6.65k|    auto relaxed = node->relaxed();
 1841|  6.65k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 6.45k, False: 198]
  ------------------
 1842|  6.45k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 6.45k, False: 0]
  ------------------
 1843|  6.45k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  6.45k|            .visit(v, std::forward<Args>(args)...);
 1845|  6.45k|    } else {
 1846|    198|        return make_regular_sub_pos(node, shift, size)
 1847|    198|            .visit(v, std::forward<Args>(args)...);
 1848|    198|    }
 1849|  6.65k|}
_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|  6.45k|    {
 1814|  6.45k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  6.45k|    }
_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|    198|    {
 1037|    198|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    198|    }
_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|    609|    {
  971|    609|        auto is_leaf = shift_ == BL;
  972|    609|        auto child   = node_->inner()[0];
  973|    609|        auto is_full = size_ >= (size_t{1} << shift_);
  974|    609|        return is_full
  ------------------
  |  Branch (974:16): [True: 609, False: 0]
  ------------------
  975|    609|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 609]
  ------------------
  976|    609|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|    609|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|    609|                   : (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|    609|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  201|  63.9k|    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.13k|    {
 1406|  1.13k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.13k|    }
_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|    523|    {
 1362|    523|        auto is_leaf = shift_ == BL;
 1363|    523|        auto child   = node_->inner()[0];
 1364|    523|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 523]
  ------------------
 1365|    523|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    523|    }
_ZN5immer6detail4rbts12null_sub_pos13each_left_subINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEvT_DpOT0_:
  711|  91.5k|    {
  712|  91.5k|    }
_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.6k|    {
 1305|  22.6k|        each_i(v, 1, branches<B>, args...);
 1306|  22.6k|    }
_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.6k|    {
 1264|  22.6k|        auto p = node_->inner() + i;
 1265|  22.6k|        auto e = node_->inner() + n;
 1266|  22.6k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 11.7k, False: 10.9k]
  ------------------
 1267|  47.1k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 35.3k, False: 11.7k]
  ------------------
 1268|  35.3k|                IMMER_PREFETCH(p + 1);
 1269|  35.3k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  35.3k|            }
 1271|  11.7k|        } else {
 1272|  10.9k|            auto ss = shift_ - B;
 1273|  43.6k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 32.7k, False: 10.9k]
  ------------------
 1274|  32.7k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  10.9k|        }
 1276|  22.6k|    }
_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|  95.5k|    {
  208|  95.5k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  95.5k|    }
_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|   139k|    {
 1406|   139k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|   139k|    }
_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|  19.9k|    {
  712|  19.9k|    }
_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|  6.86k|    {
 1305|  6.86k|        each_i(v, 1, branches<B>, args...);
 1306|  6.86k|    }
_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|  6.86k|    {
 1264|  6.86k|        auto p = node_->inner() + i;
 1265|  6.86k|        auto e = node_->inner() + n;
 1266|  6.86k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 4.02k, False: 2.84k]
  ------------------
 1267|  16.0k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 12.0k, False: 4.02k]
  ------------------
 1268|  12.0k|                IMMER_PREFETCH(p + 1);
 1269|  12.0k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  12.0k|            }
 1271|  4.02k|        } else {
 1272|  2.84k|            auto ss = shift_ - B;
 1273|  11.3k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 8.53k, False: 2.84k]
  ------------------
 1274|  8.53k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  2.84k|        }
 1276|  6.86k|    }
_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|  20.3k|    {
  208|  20.3k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  20.3k|    }
_ZNK5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE4sizeEv:
  200|  95.5k|    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|  21.8k|    {
 1406|  21.8k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  21.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_8full_posISC_EEEEEDcT_DpOT0_:
  753|    609|    {
  754|    609|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    609|    }
_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|    609|    {
  145|    609|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    609|    }
_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|    609|    {
 1371|    609|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 609, False: 0]
  ------------------
 1372|    609|        auto child = node_->inner()[0];
 1373|    609|        return make_full_leaf_pos(child).visit(v, args...);
 1374|    609|    }
_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.52k|    {
  208|  1.52k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.52k|    }
_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|  63.9k|    {
  907|  63.9k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 18.5k, False: 45.3k]
  ------------------
  908|  18.5k|            each_right_sub_(v, 1, args...);
  909|  63.9k|    }
_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|  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: 6.76k, False: 11.7k]
  ------------------
  885|  13.9k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 7.17k, False: 6.76k]
  ------------------
  886|  7.17k|                IMMER_PREFETCH(n + 1);
  887|  7.17k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  7.17k|            }
  889|  6.76k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  11.7k|        } else {
  891|  11.7k|            auto ss = shift_ - B;
  892|  22.1k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 10.3k, False: 11.7k]
  ------------------
  893|  10.3k|                make_full_pos(*n, ss).visit(v, args...);
  894|  11.7k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  11.7k|        }
  896|  18.5k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_34concat_rebalance_plan_fill_visitorEJRNS1_21concat_rebalance_planILj2ELj2EEEEEEDcT_DpOT0_:
 1036|  92.5k|    {
 1037|  92.5k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  92.5k|    }
_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.2k|    {
  907|  10.2k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 6.18k, False: 4.11k]
  ------------------
  908|  6.18k|            each_right_sub_(v, 1, args...);
  909|  10.2k|    }
_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.18k|    {
  880|  6.18k|        auto last  = count() - 1;
  881|  6.18k|        auto lsize = size_ - (last << shift_);
  882|  6.18k|        auto n     = node()->inner() + i;
  883|  6.18k|        auto e     = node()->inner() + last;
  884|  6.18k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 2.16k, False: 4.02k]
  ------------------
  885|  4.35k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 2.18k, False: 2.16k]
  ------------------
  886|  2.18k|                IMMER_PREFETCH(n + 1);
  887|  2.18k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  2.18k|            }
  889|  2.16k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  4.02k|        } else {
  891|  4.02k|            auto ss = shift_ - B;
  892|  5.91k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 1.89k, False: 4.02k]
  ------------------
  893|  1.89k|                make_full_pos(*n, ss).visit(v, args...);
  894|  4.02k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  4.02k|        }
  896|  6.18k|    }
_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|  14.5k|    {
 1037|  14.5k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  14.5k|    }
_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|    917|    {
  754|    917|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    917|    }
_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|    917|    {
  145|    917|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    917|    }
_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|    917|    {
  987|    917|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 917, False: 0]
  ------------------
  988|    917|        auto child   = node_->inner()[0];
  989|    917|        auto is_full = size_ >= branches<BL>;
  990|    917|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 917, False: 0]
  ------------------
  991|    917|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|    917|    }
_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.89k|    {
  145|  1.89k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.89k|    }
_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|   634k|    {
 1648|   634k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   634k|    }
_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|   634k|    {
 1654|   634k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 634k, False: 0]
  ------------------
 1655|   634k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 634k, False: 0]
  ------------------
 1656|   634k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   634k|        auto p = node_->inner();
 1658|   634k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 105k, False: 529k]
  ------------------
 1659|   376k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 270k, False: 105k]
  ------------------
 1660|   270k|                IMMER_PREFETCH(p + i + 1);
 1661|   270k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   270k|                    .visit(v, args...);
 1663|   270k|                s = relaxed_->d.sizes[i];
 1664|   270k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 270k, False: 0]
  ------------------
 1665|   270k|            }
 1666|   529k|        } else {
 1667|   529k|            auto ss = shift_ - B;
 1668|  1.83M|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 1.30M, False: 529k]
  ------------------
 1669|  1.30M|                visit_maybe_relaxed_sub(
 1670|  1.30M|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|  1.30M|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 1.30M, False: 0]
  ------------------
 1673|  1.30M|            }
 1674|   529k|        }
 1675|   634k|    }
_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.65M|{
 1839|  2.65M|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 2.65M, False: 0]
  ------------------
 1840|  2.65M|    auto relaxed = node->relaxed();
 1841|  2.65M|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 2.57M, False: 80.7k]
  ------------------
 1842|  2.57M|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 2.57M, False: 0]
  ------------------
 1843|  2.57M|        return make_relaxed_pos(node, shift, relaxed)
 1844|  2.57M|            .visit(v, std::forward<Args>(args)...);
 1845|  2.57M|    } else {
 1846|  80.7k|        return make_regular_sub_pos(node, shift, size)
 1847|  80.7k|            .visit(v, std::forward<Args>(args)...);
 1848|  80.7k|    }
 1849|  2.65M|}
_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|   240k|    {
 1648|   240k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   240k|    }
_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|   240k|    {
 1654|   240k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 240k, False: 0]
  ------------------
 1655|   240k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 240k, False: 0]
  ------------------
 1656|   240k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   240k|        auto p = node_->inner();
 1658|   240k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 41.8k, False: 199k]
  ------------------
 1659|   159k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 117k, False: 41.8k]
  ------------------
 1660|   117k|                IMMER_PREFETCH(p + i + 1);
 1661|   117k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   117k|                    .visit(v, args...);
 1663|   117k|                s = relaxed_->d.sizes[i];
 1664|   117k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 117k, False: 0]
  ------------------
 1665|   117k|            }
 1666|   199k|        } else {
 1667|   199k|            auto ss = shift_ - B;
 1668|   739k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 540k, False: 199k]
  ------------------
 1669|   540k|                visit_maybe_relaxed_sub(
 1670|   540k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|   540k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 540k, False: 0]
  ------------------
 1673|   540k|            }
 1674|   199k|        }
 1675|   240k|    }
_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|  1.01M|{
 1839|  1.01M|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 1.01M, False: 0]
  ------------------
 1840|  1.01M|    auto relaxed = node->relaxed();
 1841|  1.01M|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.00M, False: 10.5k]
  ------------------
 1842|  1.00M|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.00M, False: 0]
  ------------------
 1843|  1.00M|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.00M|            .visit(v, std::forward<Args>(args)...);
 1845|  1.00M|    } else {
 1846|  10.5k|        return make_regular_sub_pos(node, shift, size)
 1847|  10.5k|            .visit(v, std::forward<Args>(args)...);
 1848|  10.5k|    }
 1849|  1.01M|}
_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.89k|    {
  754|  1.89k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  1.89k|    }
_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.89k|    {
  145|  1.89k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.89k|    }
_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.89k|    {
 1775|  1.89k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 1.89k, False: 0]
  ------------------
 1776|  1.89k|        auto child      = node_->inner()[0];
 1777|  1.89k|        auto child_size = relaxed_->d.sizes[0];
 1778|  1.89k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  1.89k|    }
_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.32k|    {
 1037|  1.32k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.32k|    }
_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|  48.7k|{
 1839|  48.7k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 48.7k, False: 0]
  ------------------
 1840|  48.7k|    auto relaxed = node->relaxed();
 1841|  48.7k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 43.0k, False: 5.66k]
  ------------------
 1842|  43.0k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 43.0k, False: 0]
  ------------------
 1843|  43.0k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  43.0k|            .visit(v, std::forward<Args>(args)...);
 1845|  43.0k|    } else {
 1846|  5.66k|        return make_regular_sub_pos(node, shift, size)
 1847|  5.66k|            .visit(v, std::forward<Args>(args)...);
 1848|  5.66k|    }
 1849|  48.7k|}
_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|  43.0k|    {
 1814|  43.0k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  43.0k|    }
_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|  43.0k|{
 1839|  43.0k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 43.0k, False: 0]
  ------------------
 1840|  43.0k|    auto relaxed = node->relaxed();
 1841|  43.0k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 40.1k, False: 2.93k]
  ------------------
 1842|  40.1k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 40.1k, False: 0]
  ------------------
 1843|  40.1k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  40.1k|            .visit(v, std::forward<Args>(args)...);
 1845|  40.1k|    } else {
 1846|  2.93k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.93k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.93k|    }
 1849|  43.0k|}
_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|  40.1k|    {
 1814|  40.1k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  40.1k|    }
_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|  3.38k|    {
 1751|  3.38k|        auto offset     = relaxed_->d.count - 1;
 1752|  3.38k|        auto child      = node_->inner()[offset];
 1753|  3.38k|        auto child_size = size(offset);
 1754|  3.38k|        auto is_leaf    = shift_ == BL;
 1755|  3.38k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 3.38k]
  ------------------
 1756|  3.38k|                       : visit_maybe_relaxed_sub(
 1757|  3.38k|                             child, shift_ - B, child_size, v, args...);
 1758|  3.38k|    }
_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|  3.38k|{
 1839|  3.38k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 3.38k, False: 0]
  ------------------
 1840|  3.38k|    auto relaxed = node->relaxed();
 1841|  3.38k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 3.04k, False: 340]
  ------------------
 1842|  3.04k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 3.04k, False: 0]
  ------------------
 1843|  3.04k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  3.04k|            .visit(v, std::forward<Args>(args)...);
 1845|  3.04k|    } else {
 1846|    340|        return make_regular_sub_pos(node, shift, size)
 1847|    340|            .visit(v, std::forward<Args>(args)...);
 1848|    340|    }
 1849|  3.38k|}
_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|  3.04k|    {
 1814|  3.04k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  3.04k|    }
_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|    745|    {
 1037|    745|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    745|    }
_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|    405|    {
  959|    405|        auto offset  = count() - 1;
  960|    405|        auto child   = node_->inner()[offset];
  961|    405|        auto is_leaf = shift_ == BL;
  962|    405|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|    405|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 405]
  ------------------
  964|    405|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|    405|                             .visit(v, args...);
  966|    405|    }
_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|   123k|    {
  914|   123k|        each_left(v, count() - 1, args...);
  915|   123k|    }
_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|   123k|    {
  874|   123k|        return each_left_regular(*this, v, last, args...);
  875|   123k|    }
_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|   123k|{
  576|   123k|    constexpr auto B  = bits<Pos>;
  577|   123k|    constexpr auto BL = bits_leaf<Pos>;
  578|   123k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 123k, False: 0]
  ------------------
  579|   123k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 46.9k, False: 76.7k]
  ------------------
  580|  46.9k|        auto n = p.node()->inner();
  581|  46.9k|        auto e = n + last;
  582|  99.8k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 52.9k, False: 46.9k]
  ------------------
  583|  52.9k|            IMMER_PREFETCH(n + 1);
  584|  52.9k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  52.9k|        }
  586|  76.7k|    } else {
  587|  76.7k|        auto n  = p.node()->inner();
  588|  76.7k|        auto e  = n + last;
  589|  76.7k|        auto ss = p.shift() - B;
  590|   173k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 96.8k, False: 76.7k]
  ------------------
  591|  96.8k|            make_full_pos(*n, ss).visit(v, args...);
  592|  76.7k|    }
  593|   123k|}
_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|  20.4k|    {
  914|  20.4k|        each_left(v, count() - 1, args...);
  915|  20.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|  20.4k|    {
  874|  20.4k|        return each_left_regular(*this, v, last, args...);
  875|  20.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|  20.4k|{
  576|  20.4k|    constexpr auto B  = bits<Pos>;
  577|  20.4k|    constexpr auto BL = bits_leaf<Pos>;
  578|  20.4k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 20.4k, False: 0]
  ------------------
  579|  20.4k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 10.1k, False: 10.2k]
  ------------------
  580|  10.1k|        auto n = p.node()->inner();
  581|  10.1k|        auto e = n + last;
  582|  16.2k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 6.06k, False: 10.1k]
  ------------------
  583|  6.06k|            IMMER_PREFETCH(n + 1);
  584|  6.06k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  6.06k|        }
  586|  10.2k|    } else {
  587|  10.2k|        auto n  = p.node()->inner();
  588|  10.2k|        auto e  = n + last;
  589|  10.2k|        auto ss = p.shift() - B;
  590|  21.6k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 11.3k, False: 10.2k]
  ------------------
  591|  11.3k|            make_full_pos(*n, ss).visit(v, args...);
  592|  10.2k|    }
  593|  20.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.0k|    {
 1763|  11.0k|        auto child      = node_->inner()[0];
 1764|  11.0k|        auto child_size = relaxed_->d.sizes[0];
 1765|  11.0k|        auto is_leaf    = shift_ == BL;
 1766|  11.0k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 11.0k, False: 0]
  ------------------
 1767|  11.0k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 11.0k]
  ------------------
 1768|  11.0k|                       : visit_maybe_relaxed_sub(
 1769|  11.0k|                             child, shift_ - B, child_size, v, args...);
 1770|  11.0k|    }
_ZNK5immer6detail4rbts8leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5shiftEv:
  106|   159k|    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.0k|{
 1839|  11.0k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 11.0k, False: 0]
  ------------------
 1840|  11.0k|    auto relaxed = node->relaxed();
 1841|  11.0k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 10.2k, False: 798]
  ------------------
 1842|  10.2k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 10.2k, False: 0]
  ------------------
 1843|  10.2k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  10.2k|            .visit(v, std::forward<Args>(args)...);
 1845|  10.2k|    } else {
 1846|    798|        return make_regular_sub_pos(node, shift, size)
 1847|    798|            .visit(v, std::forward<Args>(args)...);
 1848|    798|    }
 1849|  11.0k|}
_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.2k|    {
 1814|  10.2k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  10.2k|    }
_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|    798|    {
 1037|    798|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    798|    }
_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|    968|    {
  959|    968|        auto offset  = count() - 1;
  960|    968|        auto child   = node_->inner()[offset];
  961|    968|        auto is_leaf = shift_ == BL;
  962|    968|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|    968|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 968]
  ------------------
  964|    968|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|    968|                             .visit(v, args...);
  966|    968|    }
_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.34k|    {
 1037|  1.34k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.34k|    }
_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.22k|    {
  971|  2.22k|        auto is_leaf = shift_ == BL;
  972|  2.22k|        auto child   = node_->inner()[0];
  973|  2.22k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  2.22k|        return is_full
  ------------------
  |  Branch (974:16): [True: 2.22k, False: 0]
  ------------------
  975|  2.22k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 2.22k]
  ------------------
  976|  2.22k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  2.22k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  2.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|  2.22k|    }
_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|  3.86k|    {
 1406|  3.86k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  3.86k|    }
_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|  1.64k|    {
 1362|  1.64k|        auto is_leaf = shift_ == BL;
 1363|  1.64k|        auto child   = node_->inner()[0];
 1364|  1.64k|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 1.64k]
  ------------------
 1365|  1.64k|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|  1.64k|    }
_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|  3.63k|    {
  959|  3.63k|        auto offset  = count() - 1;
  960|  3.63k|        auto child   = node_->inner()[offset];
  961|  3.63k|        auto is_leaf = shift_ == BL;
  962|  3.63k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  3.63k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 2.43k, False: 1.20k]
  ------------------
  964|  3.63k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.20k|                             .visit(v, args...);
  966|  3.63k|    }
_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.41k|    {
  145|  3.41k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.41k|    }
_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.41k|    {
 1371|  3.41k|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 3.41k, False: 0]
  ------------------
 1372|  3.41k|        auto child = node_->inner()[0];
 1373|  3.41k|        return make_full_leaf_pos(child).visit(v, args...);
 1374|  3.41k|    }
_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.77k|    {
  208|  8.77k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  8.77k|    }
_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.41k|    {
 1037|  1.41k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.41k|    }
_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.33k|    {
  959|  5.33k|        auto offset  = count() - 1;
  960|  5.33k|        auto child   = node_->inner()[offset];
  961|  5.33k|        auto is_leaf = shift_ == BL;
  962|  5.33k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  5.33k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 4.19k, False: 1.13k]
  ------------------
  964|  5.33k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.13k|                             .visit(v, args...);
  966|  5.33k|    }
_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.36k|    {
  145|  5.36k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  5.36k|    }
_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.36k|    {
  987|  5.36k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 5.36k, False: 0]
  ------------------
  988|  5.36k|        auto child   = node_->inner()[0];
  989|  5.36k|        auto is_full = size_ >= branches<BL>;
  990|  5.36k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 5.36k, False: 0]
  ------------------
  991|  5.36k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  5.36k|    }
_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|  39.9k|    {
  145|  39.9k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  39.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.57k|    {
 1037|  1.57k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.57k|    }
_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|  10.1k|    {
  959|  10.1k|        auto offset  = count() - 1;
  960|  10.1k|        auto child   = node_->inner()[offset];
  961|  10.1k|        auto is_leaf = shift_ == BL;
  962|  10.1k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  10.1k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 3.55k, False: 6.56k]
  ------------------
  964|  10.1k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  6.56k|                             .visit(v, args...);
  966|  10.1k|    }
_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|  39.9k|    {
  145|  39.9k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  39.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|  39.9k|    {
 1775|  39.9k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 39.9k, False: 0]
  ------------------
 1776|  39.9k|        auto child      = node_->inner()[0];
 1777|  39.9k|        auto child_size = relaxed_->d.sizes[0];
 1778|  39.9k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  39.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|  9.72k|    {
 1037|  9.72k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  9.72k|    }
_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|   915k|    {
 1618|   915k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   915k|    }
_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|   915k|    {
 1624|   915k|        auto p = node_->inner();
 1625|   915k|        auto s = size_t{};
 1626|   915k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 112k, False: 802k]
  ------------------
 1627|   286k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 174k, False: 112k]
  ------------------
 1628|   174k|                IMMER_PREFETCH(p + i + 1);
 1629|   174k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|   174k|                    .visit(v, args...);
 1631|   174k|                s = relaxed_->d.sizes[i];
 1632|   174k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 174k, False: 0]
  ------------------
 1633|   174k|            }
 1634|   802k|        } else {
 1635|   802k|            auto ss = shift_ - B;
 1636|  2.14M|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 1.34M, False: 802k]
  ------------------
 1637|  1.34M|                visit_maybe_relaxed_sub(
 1638|  1.34M|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|  1.34M|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 1.34M, False: 0]
  ------------------
 1641|  1.34M|            }
 1642|   802k|        }
 1643|   915k|    }
_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|   222k|    {
 1618|   222k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   222k|    }
_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|   222k|    {
 1624|   222k|        auto p = node_->inner();
 1625|   222k|        auto s = size_t{};
 1626|   222k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 38.5k, False: 183k]
  ------------------
 1627|   111k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 73.0k, False: 38.5k]
  ------------------
 1628|  73.0k|                IMMER_PREFETCH(p + i + 1);
 1629|  73.0k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|  73.0k|                    .visit(v, args...);
 1631|  73.0k|                s = relaxed_->d.sizes[i];
 1632|  73.0k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 73.0k, False: 0]
  ------------------
 1633|  73.0k|            }
 1634|   183k|        } else {
 1635|   183k|            auto ss = shift_ - B;
 1636|   656k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 472k, False: 183k]
  ------------------
 1637|   472k|                visit_maybe_relaxed_sub(
 1638|   472k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|   472k|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 472k, False: 0]
  ------------------
 1641|   472k|            }
 1642|   183k|        }
 1643|   222k|    }
_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|   181k|    {
 1763|   181k|        auto child      = node_->inner()[0];
 1764|   181k|        auto child_size = relaxed_->d.sizes[0];
 1765|   181k|        auto is_leaf    = shift_ == BL;
 1766|   181k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 181k, False: 0]
  ------------------
 1767|   181k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 181k]
  ------------------
 1768|   181k|                       : visit_maybe_relaxed_sub(
 1769|   181k|                             child, shift_ - B, child_size, v, args...);
 1770|   181k|    }
_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|   181k|{
 1839|   181k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 181k, False: 0]
  ------------------
 1840|   181k|    auto relaxed = node->relaxed();
 1841|   181k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 181k, False: 228]
  ------------------
 1842|   181k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 181k, False: 0]
  ------------------
 1843|   181k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   181k|            .visit(v, std::forward<Args>(args)...);
 1845|   181k|    } else {
 1846|    228|        return make_regular_sub_pos(node, shift, size)
 1847|    228|            .visit(v, std::forward<Args>(args)...);
 1848|    228|    }
 1849|   181k|}
_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|   181k|    {
 1814|   181k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   181k|    }
_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|    228|    {
 1037|    228|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    228|    }
_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|  3.17k|    {
 1751|  3.17k|        auto offset     = relaxed_->d.count - 1;
 1752|  3.17k|        auto child      = node_->inner()[offset];
 1753|  3.17k|        auto child_size = size(offset);
 1754|  3.17k|        auto is_leaf    = shift_ == BL;
 1755|  3.17k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 3.17k]
  ------------------
 1756|  3.17k|                       : visit_maybe_relaxed_sub(
 1757|  3.17k|                             child, shift_ - B, child_size, v, args...);
 1758|  3.17k|    }
_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|  3.17k|{
 1839|  3.17k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 3.17k, False: 0]
  ------------------
 1840|  3.17k|    auto relaxed = node->relaxed();
 1841|  3.17k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 2.80k, False: 377]
  ------------------
 1842|  2.80k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 2.80k, False: 0]
  ------------------
 1843|  2.80k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  2.80k|            .visit(v, std::forward<Args>(args)...);
 1845|  2.80k|    } else {
 1846|    377|        return make_regular_sub_pos(node, shift, size)
 1847|    377|            .visit(v, std::forward<Args>(args)...);
 1848|    377|    }
 1849|  3.17k|}
_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|  2.80k|    {
 1814|  2.80k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  2.80k|    }
_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.18k|    {
  971|  1.18k|        auto is_leaf = shift_ == BL;
  972|  1.18k|        auto child   = node_->inner()[0];
  973|  1.18k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  1.18k|        return is_full
  ------------------
  |  Branch (974:16): [True: 1.18k, False: 0]
  ------------------
  975|  1.18k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 1.18k]
  ------------------
  976|  1.18k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  1.18k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  1.18k|                   : (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.18k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1405|  1.86k|    {
 1406|  1.86k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.86k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_20concat_right_visitorISC_EEJRNS1_11relaxed_posISC_EERNS1_8leaf_posISC_EEEEEDcT_DpOT0_:
 1361|    680|    {
 1362|    680|        auto is_leaf = shift_ == BL;
 1363|    680|        auto child   = node_->inner()[0];
 1364|    680|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 680]
  ------------------
 1365|    680|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    680|    }
_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.59k|    {
 1751|  1.59k|        auto offset     = relaxed_->d.count - 1;
 1752|  1.59k|        auto child      = node_->inner()[offset];
 1753|  1.59k|        auto child_size = size(offset);
 1754|  1.59k|        auto is_leaf    = shift_ == BL;
 1755|  1.59k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 973, False: 617]
  ------------------
 1756|  1.59k|                       : visit_maybe_relaxed_sub(
 1757|    617|                             child, shift_ - B, child_size, v, args...);
 1758|  1.59k|    }
_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|    617|{
 1839|    617|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 617, False: 0]
  ------------------
 1840|    617|    auto relaxed = node->relaxed();
 1841|    617|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 405, False: 212]
  ------------------
 1842|    405|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 405, False: 0]
  ------------------
 1843|    405|        return make_relaxed_pos(node, shift, relaxed)
 1844|    405|            .visit(v, std::forward<Args>(args)...);
 1845|    405|    } else {
 1846|    212|        return make_regular_sub_pos(node, shift, size)
 1847|    212|            .visit(v, std::forward<Args>(args)...);
 1848|    212|    }
 1849|    617|}
_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|    405|    {
 1814|    405|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    405|    }
_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|  2.22k|    {
 1751|  2.22k|        auto offset     = relaxed_->d.count - 1;
 1752|  2.22k|        auto child      = node_->inner()[offset];
 1753|  2.22k|        auto child_size = size(offset);
 1754|  2.22k|        auto is_leaf    = shift_ == BL;
 1755|  2.22k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 1.16k, False: 1.06k]
  ------------------
 1756|  2.22k|                       : visit_maybe_relaxed_sub(
 1757|  1.06k|                             child, shift_ - B, child_size, v, args...);
 1758|  2.22k|    }
_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|  1.06k|{
 1839|  1.06k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 1.06k, False: 0]
  ------------------
 1840|  1.06k|    auto relaxed = node->relaxed();
 1841|  1.06k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 625, False: 437]
  ------------------
 1842|    625|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 625, False: 0]
  ------------------
 1843|    625|        return make_relaxed_pos(node, shift, relaxed)
 1844|    625|            .visit(v, std::forward<Args>(args)...);
 1845|    625|    } else {
 1846|    437|        return make_regular_sub_pos(node, shift, size)
 1847|    437|            .visit(v, std::forward<Args>(args)...);
 1848|    437|    }
 1849|  1.06k|}
_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|    625|    {
 1814|    625|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    625|    }
_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|   211k|    {
 1751|   211k|        auto offset     = relaxed_->d.count - 1;
 1752|   211k|        auto child      = node_->inner()[offset];
 1753|   211k|        auto child_size = size(offset);
 1754|   211k|        auto is_leaf    = shift_ == BL;
 1755|   211k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 36.3k, False: 175k]
  ------------------
 1756|   211k|                       : visit_maybe_relaxed_sub(
 1757|   175k|                             child, shift_ - B, child_size, v, args...);
 1758|   211k|    }
_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|   175k|{
 1839|   175k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 175k, False: 0]
  ------------------
 1840|   175k|    auto relaxed = node->relaxed();
 1841|   175k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 172k, False: 3.16k]
  ------------------
 1842|   172k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 172k, False: 0]
  ------------------
 1843|   172k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   172k|            .visit(v, std::forward<Args>(args)...);
 1845|   172k|    } else {
 1846|  3.16k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.16k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.16k|    }
 1849|   175k|}
_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|   172k|    {
 1814|   172k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   172k|    }
_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.93k|    {
 1037|  2.93k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.93k|    }
_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.66k|    {
 1037|  5.66k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  5.66k|    }
_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.66k|{
 1839|  5.66k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 5.66k, False: 0]
  ------------------
 1840|  5.66k|    auto relaxed = node->relaxed();
 1841|  5.66k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 856, False: 4.81k]
  ------------------
 1842|    856|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 856, False: 0]
  ------------------
 1843|    856|        return make_relaxed_pos(node, shift, relaxed)
 1844|    856|            .visit(v, std::forward<Args>(args)...);
 1845|  4.81k|    } else {
 1846|  4.81k|        return make_regular_sub_pos(node, shift, size)
 1847|  4.81k|            .visit(v, std::forward<Args>(args)...);
 1848|  4.81k|    }
 1849|  5.66k|}
_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|    856|    {
 1814|    856|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    856|    }
_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.81k|    {
 1037|  4.81k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.81k|    }
_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|   794k|    {
 1814|   794k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   794k|    }
_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|   783k|    {
 1738|   783k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 783k, False: 0]
  ------------------
 1739|   783k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 783k, False: 0]
  ------------------
 1740|   783k|        auto child   = node_->inner()[offset_hint];
 1741|   783k|        auto is_leaf = shift_ == BL;
 1742|   783k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 783k]
  ------------------
 1743|   783k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|   783k|                   : visit_maybe_relaxed_sub(
 1745|   783k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|   783k|    }
_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|   783k|{
 1839|   783k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 783k, False: 0]
  ------------------
 1840|   783k|    auto relaxed = node->relaxed();
 1841|   783k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 163k, False: 620k]
  ------------------
 1842|   163k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 163k, False: 0]
  ------------------
 1843|   163k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   163k|            .visit(v, std::forward<Args>(args)...);
 1845|   620k|    } else {
 1846|   620k|        return make_regular_sub_pos(node, shift, size)
 1847|   620k|            .visit(v, std::forward<Args>(args)...);
 1848|   620k|    }
 1849|   783k|}
_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|   620k|    {
 1037|   620k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|   620k|    }
_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.73M|    {
  953|  1.73M|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  1.73M|    }
_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.73M|{
  678|  1.73M|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 1.73M, False: 0]
  ------------------
  679|  1.73M|    constexpr auto B  = bits<Pos>;
  680|  1.73M|    constexpr auto BL = bits_leaf<Pos>;
  681|  1.73M|    auto child        = p.node()->inner()[offset_hint];
  682|  1.73M|    auto is_leaf      = p.shift() == BL;
  683|  1.73M|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 1.73M]
  ------------------
  684|  1.73M|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  1.73M|                         .visit(v, args...);
  686|  1.73M|}
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_21push_tail_mut_visitorISC_Lb1EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_DpOT0_:
  336|  9.34M|    {
  337|  9.34M|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  9.34M|    }
_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.60M|    {
  331|  7.60M|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  7.60M|    }
_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.60M|{
  678|  7.60M|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 7.60M, False: 0]
  ------------------
  679|  7.60M|    constexpr auto B  = bits<Pos>;
  680|  7.60M|    constexpr auto BL = bits_leaf<Pos>;
  681|  7.60M|    auto child        = p.node()->inner()[offset_hint];
  682|  7.60M|    auto is_leaf      = p.shift() == BL;
  683|  7.60M|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 7.60M]
  ------------------
  684|  7.60M|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  7.60M|                         .visit(v, args...);
  686|  7.60M|}
_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|  3.82k|    {
  331|  3.82k|        return last_oh_regular(*this, v, offset_hint, args...);
  332|  3.82k|    }
_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|  3.82k|{
  678|  3.82k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 3.82k, False: 0]
  ------------------
  679|  3.82k|    constexpr auto B  = bits<Pos>;
  680|  3.82k|    constexpr auto BL = bits_leaf<Pos>;
  681|  3.82k|    auto child        = p.node()->inner()[offset_hint];
  682|  3.82k|    auto is_leaf      = p.shift() == BL;
  683|  3.82k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 3.82k]
  ------------------
  684|  3.82k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  3.82k|                         .visit(v, args...);
  686|  3.82k|}
_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|  7.59k|    {
  337|  7.59k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  7.59k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE7last_ohINS1_21push_tail_mut_visitorISC_Lb0EEEJRNSA_5applyIS7_E4type4editERPSC_EEEDcT_jDpOT0_:
  952|  3.76k|    {
  953|  3.76k|        return last_oh_regular(*this, v, offset_hint, args...);
  954|  3.76k|    }
_ZN5immer6detail4rbts15last_oh_regularIRNS1_15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEENS1_21push_tail_mut_visitorISD_Lb0EEEJRNSB_5applyIS8_E4type4editERPSD_EEEDcOT_T0_jDpOT1_:
  677|  3.76k|{
  678|  3.76k|    assert(offset_hint == p.count() - 1);
  ------------------
  |  Branch (678:5): [True: 3.76k, False: 0]
  ------------------
  679|  3.76k|    constexpr auto B  = bits<Pos>;
  680|  3.76k|    constexpr auto BL = bits_leaf<Pos>;
  681|  3.76k|    auto child        = p.node()->inner()[offset_hint];
  682|  3.76k|    auto is_leaf      = p.shift() == BL;
  683|  3.76k|    return is_leaf ? make_leaf_pos(child, p.size()).visit(v, args...)
  ------------------
  |  Branch (683:12): [True: 0, False: 3.76k]
  ------------------
  684|  3.76k|                   : make_regular_pos(child, p.shift() - B, p.size())
  685|  3.76k|                         .visit(v, args...);
  686|  3.76k|}
_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.4k|    {
 1738|  21.4k|        assert(offset_hint == count() - 1);
  ------------------
  |  Branch (1738:9): [True: 21.4k, False: 0]
  ------------------
 1739|  21.4k|        assert(child_size_hint == size(offset_hint));
  ------------------
  |  Branch (1739:9): [True: 21.4k, False: 0]
  ------------------
 1740|  21.4k|        auto child   = node_->inner()[offset_hint];
 1741|  21.4k|        auto is_leaf = shift_ == BL;
 1742|  21.4k|        return is_leaf
  ------------------
  |  Branch (1742:16): [True: 0, False: 21.4k]
  ------------------
 1743|  21.4k|                   ? make_leaf_sub_pos(child, child_size_hint).visit(v, args...)
 1744|  21.4k|                   : visit_maybe_relaxed_sub(
 1745|  21.4k|                         child, shift_ - B, child_size_hint, v, args...);
 1746|  21.4k|    }
_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.4k|{
 1839|  21.4k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 21.4k, False: 0]
  ------------------
 1840|  21.4k|    auto relaxed = node->relaxed();
 1841|  21.4k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 18.4k, False: 2.98k]
  ------------------
 1842|  18.4k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 18.4k, False: 0]
  ------------------
 1843|  18.4k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  18.4k|            .visit(v, std::forward<Args>(args)...);
 1845|  18.4k|    } else {
 1846|  2.98k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.98k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.98k|    }
 1849|  21.4k|}
_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.4k|    {
 1814|  18.4k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  18.4k|    }
_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.98k|    {
 1037|  2.98k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.98k|    }
_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.14M|    {
 1037|  1.14M|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.14M|    }
_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|  9.58k|{
 1839|  9.58k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 9.58k, False: 0]
  ------------------
 1840|  9.58k|    auto relaxed = node->relaxed();
 1841|  9.58k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 4.55k, False: 5.02k]
  ------------------
 1842|  4.55k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 4.55k, False: 0]
  ------------------
 1843|  4.55k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  4.55k|            .visit(v, std::forward<Args>(args)...);
 1845|  5.02k|    } else {
 1846|  5.02k|        return make_regular_sub_pos(node, shift, size)
 1847|  5.02k|            .visit(v, std::forward<Args>(args)...);
 1848|  5.02k|    }
 1849|  9.58k|}
_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|  4.55k|    {
 1814|  4.55k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  4.55k|    }
_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|  21.9k|    {
 1687|  21.9k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 21.9k, False: 0]
  ------------------
 1688|  21.9k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 4.40k, False: 17.5k]
  ------------------
 1689|  21.9k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  21.9k|    }
_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|  21.9k|    {
 1699|  21.9k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  21.9k|    }
_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|  21.9k|    {
 1718|  21.9k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 21.9k, False: 0]
  ------------------
 1719|  21.9k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 4.40k, False: 17.5k]
  |  Branch (1719:9): [True: 21.9k, False: 0]
  ------------------
 1720|  21.9k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  21.9k|        auto child     = node_->inner()[offset_hint];
 1722|  21.9k|        auto is_leaf   = shift_ == BL;
 1723|  21.9k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  21.9k|        auto next_idx  = idx - left_size_hint;
 1725|  21.9k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 3.18k, False: 18.7k]
  ------------------
 1726|  21.9k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  3.18k|                         .visit(v, next_idx, args...)
 1728|  21.9k|                   : visit_maybe_relaxed_sub(
 1729|  18.7k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  21.9k|    }
_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.18k|    {
  145|  3.18k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.18k|    }
_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|  18.7k|{
 1839|  18.7k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 18.7k, False: 0]
  ------------------
 1840|  18.7k|    auto relaxed = node->relaxed();
 1841|  18.7k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 17.3k, False: 1.36k]
  ------------------
 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.36k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.36k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.36k|    }
 1849|  18.7k|}
_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.36k|    {
 1037|  1.36k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.36k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE13towards_oh_chINS1_15get_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editEPPSC_EEEDcT_mjjDpOT0_:
  938|  6.39k|    {
  939|  6.39k|        return towards_oh_ch_regular(
  940|  6.39k|            *this, v, idx, offset_hint, count(), args...);
  941|  6.39k|    }
_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|  6.39k|{
  633|  6.39k|    constexpr auto B  = bits<Pos>;
  634|  6.39k|    constexpr auto BL = bits_leaf<Pos>;
  635|  6.39k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 6.39k, False: 0]
  ------------------
  636|  6.39k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 6.39k, False: 0]
  ------------------
  637|  6.39k|    auto is_leaf = p.shift() == BL;
  638|  6.39k|    auto child   = p.node()->inner()[offset_hint];
  639|  6.39k|    auto is_full = offset_hint + 1 != count_hint;
  640|  6.39k|    return is_full
  ------------------
  |  Branch (640:12): [True: 4.22k, False: 2.17k]
  ------------------
  641|  6.39k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 758, False: 3.46k]
  ------------------
  642|  4.22k|                          : make_full_pos(child, p.shift() - B)
  643|  3.46k|                                .visit(v, idx, args...))
  644|  6.39k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 650, False: 1.52k]
  ------------------
  645|  2.17k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.17k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.52k|                            .visit(v, idx, args...));
  648|  6.39k|}
_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|  4.92k|    {
  208|  4.92k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  4.92k|    }
_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|  5.58k|    {
 1406|  5.58k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  5.58k|    }
_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|  5.58k|    {
 1330|  5.58k|        return towards_oh(v, idx, offset_hint, args...);
 1331|  5.58k|    }
_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|  5.58k|    {
 1337|  5.58k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 5.58k, False: 0]
  ------------------
 1338|  5.58k|        auto is_leaf = shift_ == BL;
 1339|  5.58k|        auto child   = node_->inner()[offset_hint];
 1340|  5.58k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 3.68k, False: 1.89k]
  ------------------
 1341|  5.58k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  5.58k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  5.58k|    }
_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.47k|    {
  113|  1.47k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  1.47k|    }
_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.24k|    {
  337|  2.24k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.24k|    }
_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.24k|    {
  317|  2.24k|        return towards_oh_ch_regular(
  318|  2.24k|            *this, v, idx, offset_hint, count(), args...);
  319|  2.24k|    }
_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.24k|{
  633|  2.24k|    constexpr auto B  = bits<Pos>;
  634|  2.24k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.24k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.24k, False: 0]
  ------------------
  636|  2.24k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.24k, False: 0]
  ------------------
  637|  2.24k|    auto is_leaf = p.shift() == BL;
  638|  2.24k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.24k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.24k|    return is_full
  ------------------
  |  Branch (640:12): [True: 696, False: 1.54k]
  ------------------
  641|  2.24k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 476, False: 220]
  ------------------
  642|    696|                          : make_full_pos(child, p.shift() - B)
  643|    220|                                .visit(v, idx, args...))
  644|  2.24k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 826, False: 719]
  ------------------
  645|  1.54k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.54k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    719|                            .visit(v, idx, args...));
  648|  2.24k|}
_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.02k|    {
 1037|  5.02k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  5.02k|    }
_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|  66.5k|{
 1839|  66.5k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 66.5k, False: 0]
  ------------------
 1840|  66.5k|    auto relaxed = node->relaxed();
 1841|  66.5k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 52.2k, False: 14.3k]
  ------------------
 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|  14.3k|        return make_regular_sub_pos(node, shift, size)
 1847|  14.3k|            .visit(v, std::forward<Args>(args)...);
 1848|  14.3k|    }
 1849|  66.5k|}
_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|  35.0k|    {
 1687|  35.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 35.0k, False: 0]
  ------------------
 1688|  35.0k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 35.0k]
  ------------------
 1689|  35.0k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  35.0k|    }
_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|  35.0k|    {
 1699|  35.0k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  35.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_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  35.0k|    {
 1718|  35.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 35.0k, False: 0]
  ------------------
 1719|  35.0k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 35.0k]
  |  Branch (1719:9): [True: 35.0k, False: 0]
  ------------------
 1720|  35.0k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  35.0k|        auto child     = node_->inner()[offset_hint];
 1722|  35.0k|        auto is_leaf   = shift_ == BL;
 1723|  35.0k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  35.0k|        auto next_idx  = idx - left_size_hint;
 1725|  35.0k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 2.29k, False: 32.7k]
  ------------------
 1726|  35.0k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  2.29k|                         .visit(v, next_idx, args...)
 1728|  35.0k|                   : visit_maybe_relaxed_sub(
 1729|  32.7k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  35.0k|    }
_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.29k|    {
  145|  2.29k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  2.29k|    }
_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|  23.5k|    {
 1687|  23.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 23.5k, False: 0]
  ------------------
 1688|  23.5k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 0, False: 23.5k]
  ------------------
 1689|  23.5k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  23.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1698|  23.5k|    {
 1699|  23.5k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  23.5k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  23.5k|    {
 1718|  23.5k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 23.5k, False: 0]
  ------------------
 1719|  23.5k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 0, False: 23.5k]
  |  Branch (1719:9): [True: 23.5k, False: 0]
  ------------------
 1720|  23.5k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  23.5k|        auto child     = node_->inner()[offset_hint];
 1722|  23.5k|        auto is_leaf   = shift_ == BL;
 1723|  23.5k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  23.5k|        auto next_idx  = idx - left_size_hint;
 1725|  23.5k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 1.05k, False: 22.5k]
  ------------------
 1726|  23.5k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  1.05k|                         .visit(v, next_idx, args...)
 1728|  23.5k|                   : visit_maybe_relaxed_sub(
 1729|  22.5k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  23.5k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  144|  1.05k|    {
  145|  1.05k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  1.05k|    }
_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|  22.5k|{
 1839|  22.5k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 22.5k, False: 0]
  ------------------
 1840|  22.5k|    auto relaxed = node->relaxed();
 1841|  22.5k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 21.3k, False: 1.11k]
  ------------------
 1842|  21.3k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 21.3k, False: 0]
  ------------------
 1843|  21.3k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  21.3k|            .visit(v, std::forward<Args>(args)...);
 1845|  21.3k|    } else {
 1846|  1.11k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.11k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.11k|    }
 1849|  22.5k|}
_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|  21.3k|    {
 1814|  21.3k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  21.3k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1036|  1.11k|    {
 1037|  1.11k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.11k|    }
_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.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_23slice_right_mut_visitorISD_Lb1ELb0EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_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: 2.78k, False: 783]
  ------------------
  641|  3.57k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 642, False: 2.14k]
  ------------------
  642|  2.78k|                          : make_full_pos(child, p.shift() - B)
  643|  2.14k|                                .visit(v, idx, args...))
  644|  3.57k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 783, False: 0]
  ------------------
  645|    783|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    783|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .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_23slice_right_mut_visitorISC_Lb1ELb0EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  1.72k|    {
  208|  1.72k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.72k|    }
_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.83k|    {
 1406|  3.83k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  3.83k|    }
_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.77k|    {
 1337|  2.77k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 2.77k, False: 0]
  ------------------
 1338|  2.77k|        auto is_leaf = shift_ == BL;
 1339|  2.77k|        auto child   = node_->inner()[offset_hint];
 1340|  2.77k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 1.08k, False: 1.68k]
  ------------------
 1341|  2.77k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  2.77k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  2.77k|    }
_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.49k|    {
 1337|  1.49k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.49k, False: 0]
  ------------------
 1338|  1.49k|        auto is_leaf = shift_ == BL;
 1339|  1.49k|        auto child   = node_->inner()[offset_hint];
 1340|  1.49k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 919, False: 572]
  ------------------
 1341|  1.49k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.49k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.49k|    }
_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.52k|    {
  208|  2.52k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  2.52k|    }
_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|  2.75k|    {
 1406|  2.75k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.75k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1405|  1.75k|    {
 1406|  1.75k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.75k|    }
_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|  7.77k|    {
 1337|  7.77k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 7.77k, False: 0]
  ------------------
 1338|  7.77k|        auto is_leaf = shift_ == BL;
 1339|  7.77k|        auto child   = node_->inner()[offset_hint];
 1340|  7.77k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 5.65k, False: 2.11k]
  ------------------
 1341|  7.77k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  7.77k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  7.77k|    }
_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|  7.47k|    {
  208|  7.47k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  7.47k|    }
_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|  3.97k|    {
 1406|  3.97k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  3.97k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
 1310|  1.46k|    {
 1311|  1.46k|        each_i(v, start, branches<B>, args...);
 1312|  1.46k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6each_iINS1_11dec_visitorEJEEEvT_jjDpOT0_:
 1263|  1.46k|    {
 1264|  1.46k|        auto p = node_->inner() + i;
 1265|  1.46k|        auto e = node_->inner() + n;
 1266|  1.46k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 913, False: 555]
  ------------------
 1267|  1.36k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 448, False: 913]
  ------------------
 1268|    448|                IMMER_PREFETCH(p + 1);
 1269|    448|                make_full_leaf_pos(*p).visit(v, args...);
 1270|    448|            }
 1271|    913|        } else {
 1272|    555|            auto ss = shift_ - B;
 1273|  1.18k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 625, False: 555]
  ------------------
 1274|    625|                make_full_pos(*p, ss).visit(v, args...);
 1275|    555|        }
 1276|  1.46k|    }
_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|    783|    {
  113|    783|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    783|    }
_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|  2.87k|    {
  306|  2.87k|        return towards_oh_ch_regular(
  307|  2.87k|            *this, v, idx, offset_hint, count(), args...);
  308|  2.87k|    }
_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|  2.87k|{
  633|  2.87k|    constexpr auto B  = bits<Pos>;
  634|  2.87k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.87k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.87k, False: 0]
  ------------------
  636|  2.87k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.87k, False: 0]
  ------------------
  637|  2.87k|    auto is_leaf = p.shift() == BL;
  638|  2.87k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.87k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.87k|    return is_full
  ------------------
  |  Branch (640:12): [True: 1.47k, False: 1.39k]
  ------------------
  641|  2.87k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 861, False: 611]
  ------------------
  642|  1.47k|                          : make_full_pos(child, p.shift() - B)
  643|    611|                                .visit(v, idx, args...))
  644|  2.87k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.01k, False: 382]
  ------------------
  645|  1.39k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.39k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    382|                            .visit(v, idx, args...));
  648|  2.87k|}
_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.35k|    {
  113|  2.35k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.35k|    }
_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|  3.32k|    {
  337|  3.32k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  3.32k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
  336|  1.03k|    {
  337|  1.03k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  1.03k|    }
_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|  2.82k|    {
  306|  2.82k|        return towards_oh_ch_regular(
  307|  2.82k|            *this, v, idx, offset_hint, count(), args...);
  308|  2.82k|    }
_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|  2.82k|{
  633|  2.82k|    constexpr auto B  = bits<Pos>;
  634|  2.82k|    constexpr auto BL = bits_leaf<Pos>;
  635|  2.82k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 2.82k, False: 0]
  ------------------
  636|  2.82k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 2.82k, False: 0]
  ------------------
  637|  2.82k|    auto is_leaf = p.shift() == BL;
  638|  2.82k|    auto child   = p.node()->inner()[offset_hint];
  639|  2.82k|    auto is_full = offset_hint + 1 != count_hint;
  640|  2.82k|    return is_full
  ------------------
  |  Branch (640:12): [True: 850, False: 1.97k]
  ------------------
  641|  2.82k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 608, False: 242]
  ------------------
  642|    850|                          : make_full_pos(child, p.shift() - B)
  643|    242|                                .visit(v, idx, args...))
  644|  2.82k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.29k, False: 680]
  ------------------
  645|  1.97k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  1.97k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|    680|                            .visit(v, idx, args...));
  648|  2.82k|}
_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.54k|    {
  113|  2.54k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|  2.54k|    }
_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.37k|    {
  337|  2.37k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
  338|  2.37k|    }
_ZN5immer6detail4rbts11regular_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
  285|  1.89k|    {
  286|  1.89k|        return each_right_regular(*this, v, start, args...);
  287|  1.89k|    }
_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|  1.89k|{
  598|  1.89k|    constexpr auto B  = bits<Pos>;
  599|  1.89k|    constexpr auto BL = bits_leaf<Pos>;
  600|       |
  601|  1.89k|    if (p.shift() == BL) {
  ------------------
  |  Branch (601:9): [True: 989, False: 909]
  ------------------
  602|    989|        auto n    = p.node()->inner() + start;
  603|    989|        auto last = p.count() - 1;
  604|    989|        auto e    = p.node()->inner() + last;
  605|    989|        if (n <= e) {
  ------------------
  |  Branch (605:13): [True: 472, False: 517]
  ------------------
  606|    666|            for (; n != e; ++n) {
  ------------------
  |  Branch (606:20): [True: 194, False: 472]
  ------------------
  607|    194|                IMMER_PREFETCH(n + 1);
  608|    194|                make_full_leaf_pos(*n).visit(v, args...);
  609|    194|            }
  610|    472|            make_leaf_pos(*n, p.size()).visit(v, args...);
  611|    472|        }
  612|    989|    } else {
  613|    909|        auto n    = p.node()->inner() + start;
  614|    909|        auto last = p.count() - 1;
  615|    909|        auto e    = p.node()->inner() + last;
  616|    909|        auto ss   = p.shift() - B;
  617|    909|        if (n <= e) {
  ------------------
  |  Branch (617:13): [True: 610, False: 299]
  ------------------
  618|  1.21k|            for (; n != e; ++n)
  ------------------
  |  Branch (618:20): [True: 609, False: 610]
  ------------------
  619|    609|                make_full_pos(*n, ss).visit(v, args...);
  620|    610|            make_regular_pos(*n, ss, p.size()).visit(v, args...);
  621|    610|        }
  622|    909|    }
  623|  1.89k|}
_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|  6.60k|    {
  928|  6.60k|        return towards_oh_ch_regular(
  929|  6.60k|            *this, v, idx, offset_hint, count(), args...);
  930|  6.60k|    }
_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|  6.60k|{
  633|  6.60k|    constexpr auto B  = bits<Pos>;
  634|  6.60k|    constexpr auto BL = bits_leaf<Pos>;
  635|  6.60k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 6.60k, False: 0]
  ------------------
  636|  6.60k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 6.60k, False: 0]
  ------------------
  637|  6.60k|    auto is_leaf = p.shift() == BL;
  638|  6.60k|    auto child   = p.node()->inner()[offset_hint];
  639|  6.60k|    auto is_full = offset_hint + 1 != count_hint;
  640|  6.60k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.32k, False: 4.28k]
  ------------------
  641|  6.60k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 746, False: 1.57k]
  ------------------
  642|  2.32k|                          : make_full_pos(child, p.shift() - B)
  643|  1.57k|                                .visit(v, idx, args...))
  644|  6.60k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.34k, False: 2.94k]
  ------------------
  645|  4.28k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  4.28k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  2.94k|                            .visit(v, idx, args...));
  648|  6.60k|}
_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|  5.77k|    {
  928|  5.77k|        return towards_oh_ch_regular(
  929|  5.77k|            *this, v, idx, offset_hint, count(), args...);
  930|  5.77k|    }
_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|  5.77k|{
  633|  5.77k|    constexpr auto B  = bits<Pos>;
  634|  5.77k|    constexpr auto BL = bits_leaf<Pos>;
  635|  5.77k|    assert(offset_hint == p.index(idx));
  ------------------
  |  Branch (635:5): [True: 5.77k, False: 0]
  ------------------
  636|  5.77k|    assert(count_hint == p.count());
  ------------------
  |  Branch (636:5): [True: 5.77k, False: 0]
  ------------------
  637|  5.77k|    auto is_leaf = p.shift() == BL;
  638|  5.77k|    auto child   = p.node()->inner()[offset_hint];
  639|  5.77k|    auto is_full = offset_hint + 1 != count_hint;
  640|  5.77k|    return is_full
  ------------------
  |  Branch (640:12): [True: 2.83k, False: 2.94k]
  ------------------
  641|  5.77k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 1.21k, False: 1.61k]
  ------------------
  642|  2.83k|                          : make_full_pos(child, p.shift() - B)
  643|  1.61k|                                .visit(v, idx, args...))
  644|  5.77k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 1.25k, False: 1.69k]
  ------------------
  645|  2.94k|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|  2.94k|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|  1.69k|                            .visit(v, idx, args...));
  648|  5.77k|}
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
  867|  4.82k|    {
  868|  4.82k|        return each_right_regular(*this, v, start, args...);
  869|  4.82k|    }
_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|  4.82k|{
  598|  4.82k|    constexpr auto B  = bits<Pos>;
  599|  4.82k|    constexpr auto BL = bits_leaf<Pos>;
  600|       |
  601|  4.82k|    if (p.shift() == BL) {
  ------------------
  |  Branch (601:9): [True: 1.44k, False: 3.37k]
  ------------------
  602|  1.44k|        auto n    = p.node()->inner() + start;
  603|  1.44k|        auto last = p.count() - 1;
  604|  1.44k|        auto e    = p.node()->inner() + last;
  605|  1.44k|        if (n <= e) {
  ------------------
  |  Branch (605:13): [True: 744, False: 705]
  ------------------
  606|    948|            for (; n != e; ++n) {
  ------------------
  |  Branch (606:20): [True: 204, False: 744]
  ------------------
  607|    204|                IMMER_PREFETCH(n + 1);
  608|    204|                make_full_leaf_pos(*n).visit(v, args...);
  609|    204|            }
  610|    744|            make_leaf_pos(*n, p.size()).visit(v, args...);
  611|    744|        }
  612|  3.37k|    } else {
  613|  3.37k|        auto n    = p.node()->inner() + start;
  614|  3.37k|        auto last = p.count() - 1;
  615|  3.37k|        auto e    = p.node()->inner() + last;
  616|  3.37k|        auto ss   = p.shift() - B;
  617|  3.37k|        if (n <= e) {
  ------------------
  |  Branch (617:13): [True: 1.37k, False: 1.99k]
  ------------------
  618|  2.04k|            for (; n != e; ++n)
  ------------------
  |  Branch (618:20): [True: 668, False: 1.37k]
  ------------------
  619|    668|                make_full_pos(*n, ss).visit(v, args...);
  620|  1.37k|            make_regular_pos(*n, ss, p.size()).visit(v, args...);
  621|  1.37k|        }
  622|  3.37k|    }
  623|  4.82k|}
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1813|  43.2k|    {
 1814|  43.2k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  43.2k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
 1686|  19.4k|    {
 1687|  19.4k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 19.4k, False: 0]
  ------------------
 1688|  19.4k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 15.7k, False: 3.64k]
  ------------------
 1689|  19.4k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  19.4k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14towards_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1698|  19.4k|    {
 1699|  19.4k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  19.4k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE18towards_sub_oh_sbhINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  19.4k|    {
 1718|  19.4k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 19.4k, False: 0]
  ------------------
 1719|  19.4k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 15.7k, False: 3.64k]
  |  Branch (1719:9): [True: 19.4k, False: 0]
  ------------------
 1720|  19.4k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  19.4k|        auto child     = node_->inner()[offset_hint];
 1722|  19.4k|        auto is_leaf   = shift_ == BL;
 1723|  19.4k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  19.4k|        auto next_idx  = idx - left_size_hint;
 1725|  19.4k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 5.07k, False: 14.3k]
  ------------------
 1726|  19.4k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  5.07k|                         .visit(v, next_idx, args...)
 1728|  19.4k|                   : visit_maybe_relaxed_sub(
 1729|  14.3k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  19.4k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb0ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  144|  5.07k|    {
  145|  5.07k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  5.07k|    }
_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.3k|{
 1839|  14.3k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 14.3k, False: 0]
  ------------------
 1840|  14.3k|    auto relaxed = node->relaxed();
 1841|  14.3k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 11.6k, False: 2.75k]
  ------------------
 1842|  11.6k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 11.6k, False: 0]
  ------------------
 1843|  11.6k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  11.6k|            .visit(v, std::forward<Args>(args)...);
 1845|  11.6k|    } else {
 1846|  2.75k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.75k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.75k|    }
 1849|  14.3k|}
_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.6k|    {
 1814|  11.6k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  11.6k|    }
_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|  2.75k|    {
 1037|  2.75k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.75k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_17dec_right_visitorEJjEEEDcT_DpOT0_:
 1036|  9.59k|    {
 1037|  9.59k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  9.59k|    }
_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|  15.0k|    {
 1687|  15.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1687:9): [True: 15.0k, False: 0]
  ------------------
 1688|  15.0k|        auto left_size = offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0;
  ------------------
  |  Branch (1688:26): [True: 10.9k, False: 4.12k]
  ------------------
 1689|  15.0k|        return towards_oh_sbh(v, idx, offset_hint, left_size, args...);
 1690|  15.0k|    }
_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|  15.0k|    {
 1699|  15.0k|        return towards_sub_oh_sbh(v, idx, offset_hint, left_size_hint, args...);
 1700|  15.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_Lb0ELb0EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjmDpOT0_:
 1717|  15.0k|    {
 1718|  15.0k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1718:9): [True: 15.0k, False: 0]
  ------------------
 1719|  15.0k|        assert(left_size_hint ==
  ------------------
  |  Branch (1719:9): [True: 10.9k, False: 4.12k]
  |  Branch (1719:9): [True: 15.0k, False: 0]
  ------------------
 1720|  15.0k|               (offset_hint ? relaxed_->d.sizes[offset_hint - 1] : 0));
 1721|  15.0k|        auto child     = node_->inner()[offset_hint];
 1722|  15.0k|        auto is_leaf   = shift_ == BL;
 1723|  15.0k|        auto next_size = relaxed_->d.sizes[offset_hint] - left_size_hint;
 1724|  15.0k|        auto next_idx  = idx - left_size_hint;
 1725|  15.0k|        return is_leaf
  ------------------
  |  Branch (1725:16): [True: 5.87k, False: 9.20k]
  ------------------
 1726|  15.0k|                   ? make_leaf_sub_pos(child, next_size)
 1727|  5.87k|                         .visit(v, next_idx, args...)
 1728|  15.0k|                   : visit_maybe_relaxed_sub(
 1729|  9.20k|                         child, shift_ - B, next_size, v, next_idx, args...);
 1730|  15.0k|    }
_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.87k|    {
  145|  5.87k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  5.87k|    }
_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.20k|{
 1839|  9.20k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 9.20k, False: 0]
  ------------------
 1840|  9.20k|    auto relaxed = node->relaxed();
 1841|  9.20k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 7.87k, False: 1.32k]
  ------------------
 1842|  7.87k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 7.87k, False: 0]
  ------------------
 1843|  7.87k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  7.87k|            .visit(v, std::forward<Args>(args)...);
 1845|  7.87k|    } else {
 1846|  1.32k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.32k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.32k|    }
 1849|  9.20k|}
_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.87k|    {
 1814|  7.87k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  7.87k|    }
_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.32k|    {
 1037|  1.32k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.32k|    }
_ZN5immer6detail4rbts11relaxed_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10each_rightINS1_11dec_visitorEJEEEvT_jDpOT0_:
 1653|  16.9k|    {
 1654|  16.9k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 16.9k, False: 0]
  ------------------
 1655|  16.9k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 16.9k, False: 0]
  ------------------
 1656|  16.9k|        auto s = relaxed_->d.sizes[start - 1];
 1657|  16.9k|        auto p = node_->inner();
 1658|  16.9k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 4.22k, False: 12.7k]
  ------------------
 1659|  8.21k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 3.99k, False: 4.22k]
  ------------------
 1660|  3.99k|                IMMER_PREFETCH(p + i + 1);
 1661|  3.99k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|  3.99k|                    .visit(v, args...);
 1663|  3.99k|                s = relaxed_->d.sizes[i];
 1664|  3.99k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 3.99k, False: 0]
  ------------------
 1665|  3.99k|            }
 1666|  12.7k|        } else {
 1667|  12.7k|            auto ss = shift_ - B;
 1668|  25.7k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 13.0k, False: 12.7k]
  ------------------
 1669|  13.0k|                visit_maybe_relaxed_sub(
 1670|  13.0k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|  13.0k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 13.0k, False: 0]
  ------------------
 1673|  13.0k|            }
 1674|  12.7k|        }
 1675|  16.9k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1036|  14.3k|    {
 1037|  14.3k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  14.3k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE10towards_ohINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRNSA_5applyIS7_E4type4editEEEEDcT_mjDpOT0_:
  927|  3.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_23slice_right_mut_visitorISD_Lb1ELb1EEEJRNSB_5applyIS8_E4type4editEEEEDcOT_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: 2.82k, False: 754]
  ------------------
  641|  3.57k|               ? (is_leaf ? make_full_leaf_pos(child).visit(v, idx, args...)
  ------------------
  |  Branch (641:19): [True: 592, False: 2.23k]
  ------------------
  642|  2.82k|                          : make_full_pos(child, p.shift() - B)
  643|  2.23k|                                .visit(v, idx, args...))
  644|  3.57k|               : (is_leaf
  ------------------
  |  Branch (644:19): [True: 754, False: 0]
  ------------------
  645|    754|                      ? make_leaf_pos(child, p.size()).visit(v, idx, args...)
  646|    754|                      : make_regular_pos(child, p.shift() - B, p.size())
  647|      0|                            .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_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  1.35k|    {
  208|  1.35k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  1.35k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_23slice_right_mut_visitorISC_Lb1ELb1EEEJRmRNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
 1405|  2.58k|    {
 1406|  2.58k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.58k|    }
_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.11k|    {
 1337|  1.11k|        assert(offset_hint == index(idx));
  ------------------
  |  Branch (1337:9): [True: 1.11k, False: 0]
  ------------------
 1338|  1.11k|        auto is_leaf = shift_ == BL;
 1339|  1.11k|        auto child   = node_->inner()[offset_hint];
 1340|  1.11k|        return is_leaf
  ------------------
  |  Branch (1340:16): [True: 764, False: 353]
  ------------------
 1341|  1.11k|                   ? make_full_leaf_pos(child).visit(v, idx, args...)
 1342|  1.11k|                   : make_full_pos(child, shift_ - B).visit(v, idx, args...);
 1343|  1.11k|    }
_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|    754|    {
  113|    754|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  114|    754|    }
_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.36k, False: 3.68k]
  ------------------
 1842|  3.36k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 3.36k, False: 0]
  ------------------
 1843|  3.36k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  3.36k|            .visit(v, std::forward<Args>(args)...);
 1845|  3.68k|    } else {
 1846|  3.68k|        return make_regular_sub_pos(node, shift, size)
 1847|  3.68k|            .visit(v, std::forward<Args>(args)...);
 1848|  3.68k|    }
 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.36k|    {
 1814|  3.36k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  3.36k|    }
_ZNK5immer6detail4rbts12null_sub_pos4nodeEv:
  699|   483k|    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|   603k|    {
  145|   603k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|   603k|    }
_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.64M|    {
 1814|  2.64M|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  2.64M|    }
_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|   411k|    {
  708|   411k|    }
_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|  11.2k|    {
 1763|  11.2k|        auto child      = node_->inner()[0];
 1764|  11.2k|        auto child_size = relaxed_->d.sizes[0];
 1765|  11.2k|        auto is_leaf    = shift_ == BL;
 1766|  11.2k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 11.2k, False: 0]
  ------------------
 1767|  11.2k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 11.2k]
  ------------------
 1768|  11.2k|                       : visit_maybe_relaxed_sub(
 1769|  11.2k|                             child, shift_ - B, child_size, v, args...);
 1770|  11.2k|    }
_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|  11.2k|{
 1839|  11.2k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 11.2k, False: 0]
  ------------------
 1840|  11.2k|    auto relaxed = node->relaxed();
 1841|  11.2k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 10.9k, False: 252]
  ------------------
 1842|  10.9k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 10.9k, False: 0]
  ------------------
 1843|  10.9k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  10.9k|            .visit(v, std::forward<Args>(args)...);
 1845|  10.9k|    } else {
 1846|    252|        return make_regular_sub_pos(node, shift, size)
 1847|    252|            .visit(v, std::forward<Args>(args)...);
 1848|    252|    }
 1849|  11.2k|}
_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|  10.9k|    {
 1814|  10.9k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  10.9k|    }
_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|    252|    {
 1037|    252|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|    252|    }
_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|    926|    {
  971|    926|        auto is_leaf = shift_ == BL;
  972|    926|        auto child   = node_->inner()[0];
  973|    926|        auto is_full = size_ >= (size_t{1} << shift_);
  974|    926|        return is_full
  ------------------
  |  Branch (974:16): [True: 926, False: 0]
  ------------------
  975|    926|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 926]
  ------------------
  976|    926|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|    926|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|    926|                   : (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|    926|    }
_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.60k|    {
 1406|  1.60k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  1.60k|    }
_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|    680|    {
 1362|    680|        auto is_leaf = shift_ == BL;
 1363|    680|        auto child   = node_->inner()[0];
 1364|    680|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 680]
  ------------------
 1365|    680|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    680|    }
_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|  71.6k|    {
  712|  71.6k|    }
_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|  15.8k|    {
 1305|  15.8k|        each_i(v, 1, branches<B>, args...);
 1306|  15.8k|    }
_ZN5immer6detail4rbts8full_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE6each_iINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEvT_jjDpOT0_:
 1263|  15.8k|    {
 1264|  15.8k|        auto p = node_->inner() + i;
 1265|  15.8k|        auto e = node_->inner() + n;
 1266|  15.8k|        if (shift_ == BL) {
  ------------------
  |  Branch (1266:13): [True: 7.76k, False: 8.06k]
  ------------------
 1267|  31.0k|            for (; p != e; ++p) {
  ------------------
  |  Branch (1267:20): [True: 23.2k, False: 7.76k]
  ------------------
 1268|  23.2k|                IMMER_PREFETCH(p + 1);
 1269|  23.2k|                make_full_leaf_pos(*p).visit(v, args...);
 1270|  23.2k|            }
 1271|  8.06k|        } else {
 1272|  8.06k|            auto ss = shift_ - B;
 1273|  32.2k|            for (; p != e; ++p)
  ------------------
  |  Branch (1273:20): [True: 24.1k, False: 8.06k]
  ------------------
 1274|  24.1k|                make_full_pos(*p, ss).visit(v, args...);
 1275|  8.06k|        }
 1276|  15.8k|    }
_ZN5immer6detail4rbts13full_leaf_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_25concat_merger_mut_visitorEJRNS1_17concat_merger_mutISC_EERNSA_5applyIS7_E4type4editEEEEDcT_DpOT0_:
  207|  75.1k|    {
  208|  75.1k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  75.1k|    }
_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|   118k|    {
 1406|   118k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|   118k|    }
_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|    926|    {
  754|    926|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|    926|    }
_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|    926|    {
  145|    926|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|    926|    }
_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|    926|    {
 1371|    926|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 926, False: 0]
  ------------------
 1372|    926|        auto child = node_->inner()[0];
 1373|    926|        return make_full_leaf_pos(child).visit(v, args...);
 1374|    926|    }
_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.93k|    {
  208|  3.93k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  3.93k|    }
_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|  53.6k|    {
  907|  53.6k|        if (count() > 1)
  ------------------
  |  Branch (907:13): [True: 12.3k, False: 41.2k]
  ------------------
  908|  12.3k|            each_right_sub_(v, 1, args...);
  909|  53.6k|    }
_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|  12.3k|    {
  880|  12.3k|        auto last  = count() - 1;
  881|  12.3k|        auto lsize = size_ - (last << shift_);
  882|  12.3k|        auto n     = node()->inner() + i;
  883|  12.3k|        auto e     = node()->inner() + last;
  884|  12.3k|        if (shift() == BL) {
  ------------------
  |  Branch (884:13): [True: 4.59k, False: 7.76k]
  ------------------
  885|  9.58k|            for (; n != e; ++n) {
  ------------------
  |  Branch (885:20): [True: 4.98k, False: 4.59k]
  ------------------
  886|  4.98k|                IMMER_PREFETCH(n + 1);
  887|  4.98k|                make_full_leaf_pos(*n).visit(v, args...);
  888|  4.98k|            }
  889|  4.59k|            make_leaf_sub_pos(*n, lsize).visit(v, args...);
  890|  7.76k|        } else {
  891|  7.76k|            auto ss = shift_ - B;
  892|  16.1k|            for (; n != e; ++n)
  ------------------
  |  Branch (892:20): [True: 8.42k, False: 7.76k]
  ------------------
  893|  8.42k|                make_full_pos(*n, ss).visit(v, args...);
  894|  7.76k|            make_regular_sub_pos(*n, ss, lsize).visit(v, args...);
  895|  7.76k|        }
  896|  12.3k|    }
_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|  78.0k|    {
 1037|  78.0k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  78.0k|    }
_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|  3.01k|    {
  754|  3.01k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  3.01k|    }
_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|  3.01k|    {
  145|  3.01k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.01k|    }
_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|  3.01k|    {
  987|  3.01k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 3.01k, False: 0]
  ------------------
  988|  3.01k|        auto child   = node_->inner()[0];
  989|  3.01k|        auto is_full = size_ >= branches<BL>;
  990|  3.01k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 3.01k, False: 0]
  ------------------
  991|  3.01k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  3.01k|    }
_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.11k|    {
  145|  3.11k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.11k|    }
_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|   393k|    {
 1648|   393k|        each_right(v, 1, std::forward<Args>(args)...);
 1649|   393k|    }
_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|   393k|    {
 1654|   393k|        assert(start > 0);
  ------------------
  |  Branch (1654:9): [True: 393k, False: 0]
  ------------------
 1655|   393k|        assert(start <= relaxed_->d.count);
  ------------------
  |  Branch (1655:9): [True: 393k, False: 0]
  ------------------
 1656|   393k|        auto s = relaxed_->d.sizes[start - 1];
 1657|   393k|        auto p = node_->inner();
 1658|   393k|        if (shift_ == BL) {
  ------------------
  |  Branch (1658:13): [True: 63.8k, False: 330k]
  ------------------
 1659|   216k|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1659:34): [True: 153k, False: 63.8k]
  ------------------
 1660|   153k|                IMMER_PREFETCH(p + i + 1);
 1661|   153k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1662|   153k|                    .visit(v, args...);
 1663|   153k|                s = relaxed_->d.sizes[i];
 1664|   153k|                assert(s);
  ------------------
  |  Branch (1664:17): [True: 153k, False: 0]
  ------------------
 1665|   153k|            }
 1666|   330k|        } else {
 1667|   330k|            auto ss = shift_ - B;
 1668|  1.09M|            for (auto i = start; i < relaxed_->d.count; ++i) {
  ------------------
  |  Branch (1668:34): [True: 767k, False: 330k]
  ------------------
 1669|   767k|                visit_maybe_relaxed_sub(
 1670|   767k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1671|   767k|                s = relaxed_->d.sizes[i];
 1672|       |                assert(s);
  ------------------
  |  Branch (1672:17): [True: 767k, False: 0]
  ------------------
 1673|   767k|            }
 1674|   330k|        }
 1675|   393k|    }
_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.64M|{
 1839|  1.64M|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 1.64M, False: 0]
  ------------------
 1840|  1.64M|    auto relaxed = node->relaxed();
 1841|  1.64M|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.57M, False: 70.2k]
  ------------------
 1842|  1.57M|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.57M, False: 0]
  ------------------
 1843|  1.57M|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.57M|            .visit(v, std::forward<Args>(args)...);
 1845|  1.57M|    } else {
 1846|  70.2k|        return make_regular_sub_pos(node, shift, size)
 1847|  70.2k|            .visit(v, std::forward<Args>(args)...);
 1848|  70.2k|    }
 1849|  1.64M|}
_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.11k|    {
  754|  3.11k|        return make_leaf_sub_pos(leaf_, count_).visit(v, args...);
  755|  3.11k|    }
_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.11k|    {
  145|  3.11k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  3.11k|    }
_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.11k|    {
 1775|  3.11k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 3.11k, False: 0]
  ------------------
 1776|  3.11k|        auto child      = node_->inner()[0];
 1777|  3.11k|        auto child_size = relaxed_->d.sizes[0];
 1778|  3.11k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  3.11k|    }
_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.68k|    {
 1037|  3.68k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.68k|    }
_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|   110k|{
 1839|   110k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 110k, False: 0]
  ------------------
 1840|   110k|    auto relaxed = node->relaxed();
 1841|   110k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 104k, False: 6.00k]
  ------------------
 1842|   104k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 104k, False: 0]
  ------------------
 1843|   104k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   104k|            .visit(v, std::forward<Args>(args)...);
 1845|   104k|    } else {
 1846|  6.00k|        return make_regular_sub_pos(node, shift, size)
 1847|  6.00k|            .visit(v, std::forward<Args>(args)...);
 1848|  6.00k|    }
 1849|   110k|}
_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|   104k|    {
 1814|   104k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   104k|    }
_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|   104k|{
 1839|   104k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 104k, False: 0]
  ------------------
 1840|   104k|    auto relaxed = node->relaxed();
 1841|   104k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 61.6k, False: 42.7k]
  ------------------
 1842|  61.6k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 61.6k, False: 0]
  ------------------
 1843|  61.6k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  61.6k|            .visit(v, std::forward<Args>(args)...);
 1845|  61.6k|    } else {
 1846|  42.7k|        return make_regular_sub_pos(node, shift, size)
 1847|  42.7k|            .visit(v, std::forward<Args>(args)...);
 1848|  42.7k|    }
 1849|   104k|}
_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|  61.6k|    {
 1814|  61.6k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  61.6k|    }
_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|   150k|    {
 1751|   150k|        auto offset     = relaxed_->d.count - 1;
 1752|   150k|        auto child      = node_->inner()[offset];
 1753|   150k|        auto child_size = size(offset);
 1754|   150k|        auto is_leaf    = shift_ == BL;
 1755|   150k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 150k]
  ------------------
 1756|   150k|                       : visit_maybe_relaxed_sub(
 1757|   150k|                             child, shift_ - B, child_size, v, args...);
 1758|   150k|    }
_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|   150k|{
 1839|   150k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 150k, False: 0]
  ------------------
 1840|   150k|    auto relaxed = node->relaxed();
 1841|   150k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 148k, False: 1.63k]
  ------------------
 1842|   148k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 148k, False: 0]
  ------------------
 1843|   148k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   148k|            .visit(v, std::forward<Args>(args)...);
 1845|   148k|    } else {
 1846|  1.63k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.63k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.63k|    }
 1849|   150k|}
_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|   148k|    {
 1814|   148k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   148k|    }
_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.67k|    {
 1037|  3.67k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  3.67k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE8last_subINS1_23concat_left_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_8leaf_posISC_EESL_RNS1_11relaxed_posISC_EEEEEDcT_DpOT0_:
  958|  2.04k|    {
  959|  2.04k|        auto offset  = count() - 1;
  960|  2.04k|        auto child   = node_->inner()[offset];
  961|  2.04k|        auto is_leaf = shift_ == BL;
  962|  2.04k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  2.04k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 2.04k]
  ------------------
  964|  2.04k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  2.04k|                             .visit(v, args...);
  966|  2.04k|    }
_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|   103k|    {
  914|   103k|        each_left(v, count() - 1, args...);
  915|   103k|    }
_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|   103k|    {
  874|   103k|        return each_left_regular(*this, v, last, args...);
  875|   103k|    }
_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|   103k|{
  576|   103k|    constexpr auto B  = bits<Pos>;
  577|   103k|    constexpr auto BL = bits_leaf<Pos>;
  578|   103k|    assert(last < p.count());
  ------------------
  |  Branch (578:5): [True: 103k, False: 0]
  ------------------
  579|   103k|    if (p.shift() == BL) {
  ------------------
  |  Branch (579:9): [True: 36.7k, False: 66.5k]
  ------------------
  580|  36.7k|        auto n = p.node()->inner();
  581|  36.7k|        auto e = n + last;
  582|  83.6k|        for (; n != e; ++n) {
  ------------------
  |  Branch (582:16): [True: 46.9k, False: 36.7k]
  ------------------
  583|  46.9k|            IMMER_PREFETCH(n + 1);
  584|  46.9k|            make_full_leaf_pos(*n).visit(v, args...);
  585|  46.9k|        }
  586|  66.5k|    } else {
  587|  66.5k|        auto n  = p.node()->inner();
  588|  66.5k|        auto e  = n + last;
  589|  66.5k|        auto ss = p.shift() - B;
  590|   151k|        for (; n != e; ++n)
  ------------------
  |  Branch (590:16): [True: 85.4k, False: 66.5k]
  ------------------
  591|  85.4k|            make_full_pos(*n, ss).visit(v, args...);
  592|  66.5k|    }
  593|   103k|}
_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|  89.2k|    {
 1763|  89.2k|        auto child      = node_->inner()[0];
 1764|  89.2k|        auto child_size = relaxed_->d.sizes[0];
 1765|  89.2k|        auto is_leaf    = shift_ == BL;
 1766|  89.2k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 89.2k, False: 0]
  ------------------
 1767|  89.2k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 89.2k]
  ------------------
 1768|  89.2k|                       : visit_maybe_relaxed_sub(
 1769|  89.2k|                             child, shift_ - B, child_size, v, args...);
 1770|  89.2k|    }
_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|  89.2k|{
 1839|  89.2k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 89.2k, False: 0]
  ------------------
 1840|  89.2k|    auto relaxed = node->relaxed();
 1841|  89.2k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 86.2k, False: 2.96k]
  ------------------
 1842|  86.2k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 86.2k, False: 0]
  ------------------
 1843|  86.2k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  86.2k|            .visit(v, std::forward<Args>(args)...);
 1845|  86.2k|    } else {
 1846|  2.96k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.96k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.96k|    }
 1849|  89.2k|}
_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|  86.2k|    {
 1814|  86.2k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  86.2k|    }
_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.96k|    {
 1037|  2.96k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.96k|    }
_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.38k|    {
  959|  1.38k|        auto offset  = count() - 1;
  960|  1.38k|        auto child   = node_->inner()[offset];
  961|  1.38k|        auto is_leaf = shift_ == BL;
  962|  1.38k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  1.38k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 0, False: 1.38k]
  ------------------
  964|  1.38k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  1.38k|                             .visit(v, args...);
  966|  1.38k|    }
_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|  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_policyELb0ELb0EEELj2ELj2EEEE9first_subINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  970|  5.02k|    {
  971|  5.02k|        auto is_leaf = shift_ == BL;
  972|  5.02k|        auto child   = node_->inner()[0];
  973|  5.02k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  5.02k|        return is_full
  ------------------
  |  Branch (974:16): [True: 5.02k, False: 0]
  ------------------
  975|  5.02k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 5.02k]
  ------------------
  976|  5.02k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  5.02k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  5.02k|                   : (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.02k|    }
_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|  11.6k|    {
 1406|  11.6k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  11.6k|    }
_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|  6.57k|    {
 1362|  6.57k|        auto is_leaf = shift_ == BL;
 1363|  6.57k|        auto child   = node_->inner()[0];
 1364|  6.57k|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 6.57k]
  ------------------
 1365|  6.57k|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|  6.57k|    }
_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|  11.3k|    {
  959|  11.3k|        auto offset  = count() - 1;
  960|  11.3k|        auto child   = node_->inner()[offset];
  961|  11.3k|        auto is_leaf = shift_ == BL;
  962|  11.3k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  11.3k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 5.28k, False: 6.05k]
  ------------------
  964|  11.3k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  6.05k|                             .visit(v, args...);
  966|  11.3k|    }
_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.84k|    {
  145|  6.84k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  6.84k|    }
_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.84k|    {
 1371|  6.84k|        assert(shift_ == BL);
  ------------------
  |  Branch (1371:9): [True: 6.84k, False: 0]
  ------------------
 1372|  6.84k|        auto child = node_->inner()[0];
 1373|  6.84k|        return make_full_leaf_pos(child).visit(v, args...);
 1374|  6.84k|    }
_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|  49.6k|    {
  208|  49.6k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  209|  49.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_8full_posISC_EEEEEDcT_DpOT0_:
 1036|  6.31k|    {
 1037|  6.31k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  6.31k|    }
_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.51k|    {
  959|  5.51k|        auto offset  = count() - 1;
  960|  5.51k|        auto child   = node_->inner()[offset];
  961|  5.51k|        auto is_leaf = shift_ == BL;
  962|  5.51k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  5.51k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 3.41k, False: 2.09k]
  ------------------
  964|  5.51k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  2.09k|                             .visit(v, args...);
  966|  5.51k|    }
_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|  42.8k|    {
  145|  42.8k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  42.8k|    }
_ZN5immer6detail4rbts15regular_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE14first_sub_leafINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RNS1_12leaf_sub_posISC_EERNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  986|  42.8k|    {
  987|  42.8k|        assert(shift_ == BL);
  ------------------
  |  Branch (987:9): [True: 42.8k, False: 0]
  ------------------
  988|  42.8k|        auto child   = node_->inner()[0];
  989|  42.8k|        auto is_full = size_ >= branches<BL>;
  990|  42.8k|        return is_full ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (990:16): [True: 42.8k, False: 0]
  ------------------
  991|  42.8k|                       : make_leaf_sub_pos(child, size_).visit(v, args...);
  992|  42.8k|    }
_ZN5immer6detail4rbts12leaf_sub_posINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEE5visitINS1_24concat_right_mut_visitorISC_EEJRNSA_5applyIS7_E4type4editESL_RSD_RNS1_8leaf_posISC_EESL_EEEDcT_DpOT0_:
  144|  60.6k|    {
  145|  60.6k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  60.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.51k|    {
 1037|  4.51k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  4.51k|    }
_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|  82.9k|    {
  959|  82.9k|        auto offset  = count() - 1;
  960|  82.9k|        auto child   = node_->inner()[offset];
  961|  82.9k|        auto is_leaf = shift_ == BL;
  962|  82.9k|        auto lsize   = size_ - (size_t{offset} << shift_);
  963|  82.9k|        return is_leaf ? make_leaf_sub_pos(child, lsize).visit(v, args...)
  ------------------
  |  Branch (963:16): [True: 28.0k, False: 54.9k]
  ------------------
  964|  82.9k|                       : make_regular_sub_pos(child, shift_ - B, lsize)
  965|  54.9k|                             .visit(v, args...);
  966|  82.9k|    }
_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|  60.6k|    {
  145|  60.6k|        return Visitor::visit_leaf(*this, std::forward<Args>(args)...);
  146|  60.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|  60.6k|    {
 1775|  60.6k|        assert(shift_ == BL);
  ------------------
  |  Branch (1775:9): [True: 60.6k, False: 0]
  ------------------
 1776|  60.6k|        auto child      = node_->inner()[0];
 1777|  60.6k|        auto child_size = relaxed_->d.sizes[0];
 1778|  60.6k|        return make_leaf_sub_pos(child, child_size).visit(v, args...);
 1779|  60.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|  80.7k|    {
 1037|  80.7k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  80.7k|    }
_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|   692k|    {
 1618|   692k|        each_left(v, relaxed_->d.count - 1, args...);
 1619|   692k|    }
_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|   692k|    {
 1624|   692k|        auto p = node_->inner();
 1625|   692k|        auto s = size_t{};
 1626|   692k|        if (shift_ == BL) {
  ------------------
  |  Branch (1626:13): [True: 73.6k, False: 619k]
  ------------------
 1627|   174k|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1627:39): [True: 100k, False: 73.6k]
  ------------------
 1628|   100k|                IMMER_PREFETCH(p + i + 1);
 1629|   100k|                make_leaf_sub_pos(p[i], relaxed_->d.sizes[i] - s)
 1630|   100k|                    .visit(v, args...);
 1631|   100k|                s = relaxed_->d.sizes[i];
 1632|   100k|                assert(s);
  ------------------
  |  Branch (1632:17): [True: 100k, False: 0]
  ------------------
 1633|   100k|            }
 1634|   619k|        } else {
 1635|   619k|            auto ss = shift_ - B;
 1636|  1.49M|            for (auto i = count_t{0}; i < n; ++i) {
  ------------------
  |  Branch (1636:39): [True: 872k, False: 619k]
  ------------------
 1637|   872k|                visit_maybe_relaxed_sub(
 1638|   872k|                    p[i], ss, relaxed_->d.sizes[i] - s, v, args...);
 1639|   872k|                s = relaxed_->d.sizes[i];
 1640|       |                assert(s);
  ------------------
  |  Branch (1640:17): [True: 872k, False: 0]
  ------------------
 1641|   872k|            }
 1642|   619k|        }
 1643|   692k|    }
_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|   229k|    {
 1763|   229k|        auto child      = node_->inner()[0];
 1764|   229k|        auto child_size = relaxed_->d.sizes[0];
 1765|   229k|        auto is_leaf    = shift_ == BL;
 1766|   229k|        assert(child_size);
  ------------------
  |  Branch (1766:9): [True: 229k, False: 0]
  ------------------
 1767|   229k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1767:16): [True: 0, False: 229k]
  ------------------
 1768|   229k|                       : visit_maybe_relaxed_sub(
 1769|   229k|                             child, shift_ - B, child_size, v, args...);
 1770|   229k|    }
_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|   229k|{
 1839|   229k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 229k, False: 0]
  ------------------
 1840|   229k|    auto relaxed = node->relaxed();
 1841|   229k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 228k, False: 1.50k]
  ------------------
 1842|   228k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 228k, False: 0]
  ------------------
 1843|   228k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   228k|            .visit(v, std::forward<Args>(args)...);
 1845|   228k|    } else {
 1846|  1.50k|        return make_regular_sub_pos(node, shift, size)
 1847|  1.50k|            .visit(v, std::forward<Args>(args)...);
 1848|  1.50k|    }
 1849|   229k|}
_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|   228k|    {
 1814|   228k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   228k|    }
_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.50k|    {
 1037|  1.50k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  1.50k|    }
_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|   257k|    {
 1751|   257k|        auto offset     = relaxed_->d.count - 1;
 1752|   257k|        auto child      = node_->inner()[offset];
 1753|   257k|        auto child_size = size(offset);
 1754|   257k|        auto is_leaf    = shift_ == BL;
 1755|   257k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 0, False: 257k]
  ------------------
 1756|   257k|                       : visit_maybe_relaxed_sub(
 1757|   257k|                             child, shift_ - B, child_size, v, args...);
 1758|   257k|    }
_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|   257k|{
 1839|   257k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 257k, False: 0]
  ------------------
 1840|   257k|    auto relaxed = node->relaxed();
 1841|   257k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 257k, False: 579]
  ------------------
 1842|   257k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 257k, False: 0]
  ------------------
 1843|   257k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   257k|            .visit(v, std::forward<Args>(args)...);
 1845|   257k|    } else {
 1846|    579|        return make_regular_sub_pos(node, shift, size)
 1847|    579|            .visit(v, std::forward<Args>(args)...);
 1848|    579|    }
 1849|   257k|}
_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|   257k|    {
 1814|   257k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   257k|    }
_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.81k|    {
  971|  1.81k|        auto is_leaf = shift_ == BL;
  972|  1.81k|        auto child   = node_->inner()[0];
  973|  1.81k|        auto is_full = size_ >= (size_t{1} << shift_);
  974|  1.81k|        return is_full
  ------------------
  |  Branch (974:16): [True: 1.81k, False: 0]
  ------------------
  975|  1.81k|                   ? (is_leaf
  ------------------
  |  Branch (975:23): [True: 0, False: 1.81k]
  ------------------
  976|  1.81k|                          ? make_full_leaf_pos(child).visit(v, args...)
  977|  1.81k|                          : make_full_pos(child, shift_ - B).visit(v, args...))
  978|  1.81k|                   : (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.81k|    }
_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.61k|    {
 1406|  2.61k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1407|  2.61k|    }
_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|    803|    {
 1362|    803|        auto is_leaf = shift_ == BL;
 1363|    803|        auto child   = node_->inner()[0];
 1364|    803|        return is_leaf ? make_full_leaf_pos(child).visit(v, args...)
  ------------------
  |  Branch (1364:16): [True: 0, False: 803]
  ------------------
 1365|    803|                       : make_full_pos(child, shift_ - B).visit(v, args...);
 1366|    803|    }
_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.35k|    {
 1751|  2.35k|        auto offset     = relaxed_->d.count - 1;
 1752|  2.35k|        auto child      = node_->inner()[offset];
 1753|  2.35k|        auto child_size = size(offset);
 1754|  2.35k|        auto is_leaf    = shift_ == BL;
 1755|  2.35k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 1.56k, False: 799]
  ------------------
 1756|  2.35k|                       : visit_maybe_relaxed_sub(
 1757|    799|                             child, shift_ - B, child_size, v, args...);
 1758|  2.35k|    }
_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|    799|{
 1839|    799|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 799, False: 0]
  ------------------
 1840|    799|    auto relaxed = node->relaxed();
 1841|    799|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 545, False: 254]
  ------------------
 1842|    545|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 545, False: 0]
  ------------------
 1843|    545|        return make_relaxed_pos(node, shift, relaxed)
 1844|    545|            .visit(v, std::forward<Args>(args)...);
 1845|    545|    } else {
 1846|    254|        return make_regular_sub_pos(node, shift, size)
 1847|    254|            .visit(v, std::forward<Args>(args)...);
 1848|    254|    }
 1849|    799|}
_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|    545|    {
 1814|    545|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|    545|    }
_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|  42.8k|    {
 1751|  42.8k|        auto offset     = relaxed_->d.count - 1;
 1752|  42.8k|        auto child      = node_->inner()[offset];
 1753|  42.8k|        auto child_size = size(offset);
 1754|  42.8k|        auto is_leaf    = shift_ == BL;
 1755|  42.8k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 39.4k, False: 3.44k]
  ------------------
 1756|  42.8k|                       : visit_maybe_relaxed_sub(
 1757|  3.44k|                             child, shift_ - B, child_size, v, args...);
 1758|  42.8k|    }
_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.44k|{
 1839|  3.44k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 3.44k, False: 0]
  ------------------
 1840|  3.44k|    auto relaxed = node->relaxed();
 1841|  3.44k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 1.03k, False: 2.41k]
  ------------------
 1842|  1.03k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 1.03k, False: 0]
  ------------------
 1843|  1.03k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  1.03k|            .visit(v, std::forward<Args>(args)...);
 1845|  2.41k|    } else {
 1846|  2.41k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.41k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.41k|    }
 1849|  3.44k|}
_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|  1.03k|    {
 1814|  1.03k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  1.03k|    }
_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|   239k|    {
 1751|   239k|        auto offset     = relaxed_->d.count - 1;
 1752|   239k|        auto child      = node_->inner()[offset];
 1753|   239k|        auto child_size = size(offset);
 1754|   239k|        auto is_leaf    = shift_ == BL;
 1755|   239k|        return is_leaf ? make_leaf_sub_pos(child, child_size).visit(v, args...)
  ------------------
  |  Branch (1755:16): [True: 32.6k, False: 206k]
  ------------------
 1756|   239k|                       : visit_maybe_relaxed_sub(
 1757|   206k|                             child, shift_ - B, child_size, v, args...);
 1758|   239k|    }
_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|   206k|{
 1839|   206k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 206k, False: 0]
  ------------------
 1840|   206k|    auto relaxed = node->relaxed();
 1841|   206k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 181k, False: 25.8k]
  ------------------
 1842|   181k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 181k, False: 0]
  ------------------
 1843|   181k|        return make_relaxed_pos(node, shift, relaxed)
 1844|   181k|            .visit(v, std::forward<Args>(args)...);
 1845|   181k|    } else {
 1846|  25.8k|        return make_regular_sub_pos(node, shift, size)
 1847|  25.8k|            .visit(v, std::forward<Args>(args)...);
 1848|  25.8k|    }
 1849|   206k|}
_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|   181k|    {
 1814|   181k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|   181k|    }
_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|  42.7k|    {
 1037|  42.7k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  42.7k|    }
_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.00k|    {
 1037|  6.00k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  6.00k|    }
_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.00k|{
 1839|  6.00k|    assert(node);
  ------------------
  |  Branch (1839:5): [True: 6.00k, False: 0]
  ------------------
 1840|  6.00k|    auto relaxed = node->relaxed();
 1841|  6.00k|    if (relaxed) {
  ------------------
  |  Branch (1841:9): [True: 3.52k, False: 2.48k]
  ------------------
 1842|  3.52k|        assert(size == relaxed->d.sizes[relaxed->d.count - 1]);
  ------------------
  |  Branch (1842:9): [True: 3.52k, False: 0]
  ------------------
 1843|  3.52k|        return make_relaxed_pos(node, shift, relaxed)
 1844|  3.52k|            .visit(v, std::forward<Args>(args)...);
 1845|  3.52k|    } else {
 1846|  2.48k|        return make_regular_sub_pos(node, shift, size)
 1847|  2.48k|            .visit(v, std::forward<Args>(args)...);
 1848|  2.48k|    }
 1849|  6.00k|}
_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.52k|    {
 1814|  3.52k|        return Visitor::visit_relaxed(*this, std::forward<Args>(args)...);
 1815|  3.52k|    }
_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.48k|    {
 1037|  2.48k|        return Visitor::visit_regular(*this, std::forward<Args>(args)...);
 1038|  2.48k|    }

_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
  114|   353k|        : size{0}
  115|   353k|        , shift{BL}
  116|   353k|        , root{empty_root()}
  117|   353k|        , tail{empty_tail()}
  118|   353k|    {
  119|       |        assert(check_tree());
  ------------------
  |  Branch (119:9): [True: 353k, False: 0]
  ------------------
  120|   353k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10empty_rootEv:
   61|   368k|    {
   62|   368k|        static const auto empty_ = [] {
   63|   368k|            constexpr auto size = node_t::sizeof_inner_n(0);
   64|   368k|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   65|   368k|                storage;
   66|   368k|            return node_t::make_inner_n_into(&storage, size, 0u);
   67|   368k|        }();
   68|   368k|        return empty_->inc();
   69|   368k|    }
_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|   357k|    {
   73|   357k|        static const auto empty_ = [] {
   74|   357k|            constexpr auto size = node_t::sizeof_leaf_n(0);
   75|   357k|            static std::aligned_storage_t<size, alignof(std::max_align_t)>
   76|   357k|                storage;
   77|   357k|            return node_t::make_leaf_n_into(&storage, size, 0u);
   78|   357k|        }();
   79|   357k|        return empty_->inc();
   80|   357k|    }
_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|   935k|    {
 1373|   935k|        IMMER_INVALID_STATE_ASSERT(shift <= sizeof(size_t) * 8 - BL);
  ------------------
  |  |   32|   935k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 935k]
  |  |  ------------------
  |  |   33|   935k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1374|   935k|        IMMER_INVALID_STATE_ASSERT(shift >= BL);
  ------------------
  |  |   32|   935k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 935k]
  |  |  ------------------
  |  |   33|   935k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1375|   935k|        IMMER_INVALID_STATE_ASSERT(tail_offset() <= size);
  ------------------
  |  |   32|   935k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 935k]
  |  |  ------------------
  |  |   33|   935k|    IMMER_THROW(invalid_tree{})
  |  |  ------------------
  |  |  |  |   51|      0|#define IMMER_THROW(expr) throw expr
  |  |  ------------------
  ------------------
 1376|   935k|        IMMER_INVALID_STATE_ASSERT(tail_size() <= branches<BL>);
  ------------------
  |  |   32|   935k|    if (!(expr))                                                               \
  |  |  ------------------
  |  |  |  Branch (32:9): [True: 0, False: 935k]
  |  |  ------------------
  |  |   33|   935k|    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|   935k|        return true;
 1382|   935k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE11tail_offsetEv:
  197|  7.06M|    {
  198|  7.06M|        auto r = root->relaxed();
  199|  7.06M|        assert(r == nullptr || r->d.count);
  ------------------
  |  Branch (199:9): [True: 4.67M, False: 2.39M]
  |  Branch (199:9): [True: 2.39M, False: 0]
  |  Branch (199:9): [True: 7.06M, False: 0]
  ------------------
  200|  7.06M|        return r      ? r->d.sizes[r->d.count - 1]
  ------------------
  |  Branch (200:16): [True: 2.39M, False: 4.67M]
  ------------------
  201|  7.06M|               : size ? (size - 1) & ~mask<BL>
  ------------------
  |  Branch (201:18): [True: 3.55M, False: 1.11M]
  ------------------
  202|       |                      /* otherwise */
  203|  4.67M|                      : 0;
  204|  7.06M|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9tail_sizeEv:
  194|  1.04M|    auto tail_size() const { return size - tail_offset(); }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EED2Ev:
  184|   642k|    ~rrbtree() { dec(); }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3decEv:
  192|   642k|    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|   642k|    {
  209|   642k|        auto tail_off  = tail_offset();
  210|   642k|        auto tail_size = size - tail_off;
  211|       |
  212|   642k|        if (tail_off)
  ------------------
  |  Branch (212:13): [True: 229k, False: 413k]
  ------------------
  213|   229k|            visit_maybe_relaxed_sub(root, shift, tail_off, v, args...);
  214|   413k|        else
  215|   413k|            make_empty_regular_pos(root).visit(v, args...);
  216|       |
  217|   642k|        if (tail_size)
  ------------------
  |  Branch (217:13): [True: 277k, False: 365k]
  ------------------
  218|   277k|            make_leaf_sub_pos(tail, tail_size).visit(v, args...);
  219|   365k|        else
  220|   365k|            make_empty_leaf_pos(tail).visit(v, args...);
  221|   642k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2ERKSB_:
  151|   134k|        : rrbtree{other.size, other.shift, other.root, other.tail}
  152|   134k|    {
  153|   134k|        inc();
  154|   134k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2EmjPNS1_4nodeIiSA_Lj2ELj2EEESE_:
  127|   289k|        : size{sz}
  128|   289k|        , shift{sh}
  129|   289k|        , root{r}
  130|   289k|        , tail{t}
  131|   289k|    {
  132|   289k|#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|   289k|        try {
  137|   289k|            check_tree();
  138|   289k|        } 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|   289k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE3incEv:
  187|   134k|    {
  188|   134k|        root->inc();
  189|   134k|        tail->inc();
  190|   134k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2EOSB_:
  157|   276k|        : rrbtree{}
  158|   276k|    {
  159|   276k|        swap(*this, other);
  160|   276k|    }
_ZN5immer6detail4rbts4swapERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEESC_:
  176|   578k|    {
  177|   578k|        using std::swap;
  178|   578k|        swap(x.size, y.size);
  179|   578k|        swap(x.shift, y.shift);
  180|   578k|        swap(x.root, y.root);
  181|   578k|        swap(x.tail, y.tail);
  182|   578k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEaSEOSB_:
  170|   294k|    {
  171|   294k|        swap(*this, other);
  172|   294k|        return *this;
  173|   294k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  500|  57.4k|    {
  501|  57.4k|        auto ts = tail_size();
  502|  57.4k|        if (ts < branches<BL>) {
  ------------------
  |  Branch (502:13): [True: 43.1k, False: 14.2k]
  ------------------
  503|  43.1k|            auto new_tail =
  504|  43.1k|                node_t::copy_leaf_emplace(tail, ts, std::move(value));
  505|  43.1k|            return {size + 1, shift, root->inc(), new_tail};
  506|  43.1k|        } else {
  507|  14.2k|            using std::get;
  508|  14.2k|            auto new_tail = node_t::make_leaf_n(1u, std::move(value));
  509|  14.2k|            auto tail_off = tail_offset();
  510|  14.2k|            IMMER_TRY {
  ------------------
  |  |   49|  14.2k|#define IMMER_TRY try
  ------------------
  511|  14.2k|                auto new_root =
  512|  14.2k|                    push_tail(root, shift, tail_off, tail, size - tail_off);
  513|  14.2k|                tail->inc();
  514|  14.2k|                return {size + 1, get<0>(new_root), get<1>(new_root), new_tail};
  515|  14.2k|            }
  516|  14.2k|            IMMER_CATCH (...) {
  517|      0|                node_t::delete_leaf(new_tail, 1u);
  518|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  519|      0|            }
  520|  14.2k|        }
  521|  57.4k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_tailEPNS1_4nodeIiSA_Lj2ELj2EEEjmSE_j:
  369|  22.3k|    {
  370|  22.3k|        if (auto r = root->relaxed()) {
  ------------------
  |  Branch (370:18): [True: 11.0k, False: 11.2k]
  ------------------
  371|  11.0k|            auto new_root =
  372|  11.0k|                make_relaxed_pos(root, shift, r)
  373|  11.0k|                    .visit(push_tail_visitor<node_t>{}, tail, tail_size);
  374|  11.0k|            if (new_root)
  ------------------
  |  Branch (374:17): [True: 10.5k, False: 595]
  ------------------
  375|  10.5k|                return std::make_tuple(shift, new_root);
  376|    595|            else {
  377|    595|                auto new_root = node_t::make_inner_r_n(2);
  378|    595|                IMMER_TRY {
  ------------------
  |  |   49|    595|#define IMMER_TRY try
  ------------------
  379|    595|                    auto new_path        = node_t::make_path(shift, tail);
  380|    595|                    new_root->inner()[0] = root->inc();
  381|    595|                    new_root->inner()[1] = new_path;
  382|    595|                    new_root->relaxed()->d.sizes[0] = size;
  383|    595|                    new_root->relaxed()->d.sizes[1] = size + tail_size;
  384|    595|                    assert(size);
  ------------------
  |  Branch (384:21): [True: 595, False: 0]
  ------------------
  385|    595|                    assert(tail_size);
  ------------------
  |  Branch (385:21): [True: 595, False: 0]
  ------------------
  386|    595|                    new_root->relaxed()->d.count = 2u;
  387|    595|                }
  388|    595|                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|    595|                return std::make_tuple(shift + B, new_root);
  393|    595|            }
  394|  11.2k|        } else if (size == size_t{branches<B>} << shift) {
  ------------------
  |  Branch (394:20): [True: 1.05k, False: 10.2k]
  ------------------
  395|  1.05k|            auto new_root = node_t::make_inner_n(2);
  396|  1.05k|            IMMER_TRY {
  ------------------
  |  |   49|  1.05k|#define IMMER_TRY try
  ------------------
  397|  1.05k|                auto new_path        = node_t::make_path(shift, tail);
  398|  1.05k|                new_root->inner()[0] = root->inc();
  399|  1.05k|                new_root->inner()[1] = new_path;
  400|  1.05k|            }
  401|  1.05k|            IMMER_CATCH (...) {
  402|      0|                node_t::delete_inner(new_root, 2);
  403|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  404|      0|            }
  405|  1.05k|            return std::make_tuple(shift + B, new_root);
  406|  10.2k|        } else if (size) {
  ------------------
  |  Branch (406:20): [True: 4.04k, False: 6.18k]
  ------------------
  407|  4.04k|            auto new_root = make_regular_sub_pos(root, shift, size)
  408|  4.04k|                                .visit(push_tail_visitor<node_t>{}, tail);
  409|  4.04k|            return std::make_tuple(shift, new_root);
  410|  6.18k|        } else {
  411|  6.18k|            return std::make_tuple(shift, node_t::make_path(shift, tail));
  412|  6.18k|        }
  413|  22.3k|    }
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.72k|    {
  581|  5.72k|        auto tail_off = tail_offset();
  582|  5.72k|        if (idx >= tail_off) {
  ------------------
  |  Branch (582:13): [True: 612, False: 5.11k]
  ------------------
  583|    612|            auto tail_size = size - tail_off;
  584|    612|            auto new_tail =
  585|    612|                make_leaf_sub_pos(tail, tail_size)
  586|    612|                    .visit(update_visitor<node_t>{}, idx - tail_off, fn);
  587|    612|            return {size, shift, root->inc(), new_tail};
  588|  5.11k|        } else {
  589|  5.11k|            auto new_root = visit_maybe_relaxed_sub(
  590|  5.11k|                root, shift, tail_off, update_visitor<node_t>{}, idx, fn);
  591|  5.11k|            return {size, shift, new_root, tail->inc()};
  592|  5.11k|        }
  593|  5.72k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  647|  11.0k|    {
  648|  11.0k|        auto tail_off = tail_offset();
  649|  11.0k|        if (new_size == 0) {
  ------------------
  |  Branch (649:13): [True: 1.29k, False: 9.73k]
  ------------------
  650|  1.29k|            return {};
  651|  9.73k|        } else if (new_size >= size) {
  ------------------
  |  Branch (651:20): [True: 295, False: 9.43k]
  ------------------
  652|    295|            return *this;
  653|  9.43k|        } else if (new_size > tail_off) {
  ------------------
  |  Branch (653:20): [True: 286, False: 9.15k]
  ------------------
  654|    286|            auto new_tail = node_t::copy_leaf(tail, new_size - tail_off);
  655|    286|            return {new_size, shift, root->inc(), new_tail};
  656|  9.15k|        } else {
  657|  9.15k|            using std::get;
  658|  9.15k|            auto l = new_size - 1;
  659|  9.15k|            auto v = slice_right_visitor<node_t>();
  660|  9.15k|            auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l);
  661|  9.15k|            auto new_shift = get<0>(r);
  662|  9.15k|            auto new_root  = get<1>(r);
  663|  9.15k|            auto new_tail  = get<3>(r);
  664|  9.15k|            if (new_root) {
  ------------------
  |  Branch (664:17): [True: 6.83k, False: 2.32k]
  ------------------
  665|  6.83k|                IMMER_ASSERT_TAGGED(new_root->compute_shift() == get<0>(r));
  ------------------
  |  |   68|  6.83k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (665:17): [True: 6.83k, False: 0]
  ------------------
  666|  6.83k|                assert(new_root->check(new_shift, new_size - get<2>(r)));
  ------------------
  |  Branch (666:17): [True: 6.83k, False: 0]
  ------------------
  667|  6.83k|                return {new_size, new_shift, new_root, new_tail};
  668|  6.83k|            } else {
  669|  2.32k|                return {new_size, BL, empty_root(), new_tail};
  670|  2.32k|            }
  671|  9.15k|        }
  672|  11.0k|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4dropEm:
  711|  17.6k|    {
  712|  17.6k|        if (elems == 0) {
  ------------------
  |  Branch (712:13): [True: 1.22k, False: 16.4k]
  ------------------
  713|  1.22k|            return *this;
  714|  16.4k|        } else if (elems >= size) {
  ------------------
  |  Branch (714:20): [True: 211, False: 16.2k]
  ------------------
  715|    211|            return {};
  716|  16.2k|        } else if (elems == tail_offset()) {
  ------------------
  |  Branch (716:20): [True: 201, False: 16.0k]
  ------------------
  717|    201|            return {size - elems, BL, empty_root(), tail->inc()};
  718|  16.0k|        } else if (elems > tail_offset()) {
  ------------------
  |  Branch (718:20): [True: 544, False: 15.4k]
  ------------------
  719|    544|            auto tail_off = tail_offset();
  720|    544|            auto new_tail =
  721|    544|                node_t::copy_leaf(tail, elems - tail_off, size - tail_off);
  722|    544|            return {size - elems, BL, empty_root(), new_tail};
  723|  15.4k|        } else {
  724|  15.4k|            using std::get;
  725|  15.4k|            auto v = slice_left_visitor<node_t>();
  726|  15.4k|            auto r =
  727|  15.4k|                visit_maybe_relaxed_sub(root, shift, tail_offset(), v, elems);
  728|  15.4k|            auto new_root  = get<1>(r);
  729|  15.4k|            auto new_shift = get<0>(r);
  730|  15.4k|            return {size - elems, new_shift, new_root, tail->inc()};
  731|  15.4k|        }
  732|  17.6k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8max_sizeEv:
   54|  2.07M|    {
   55|  2.07M|        auto S = sizeof(size_t) * 8;
   56|  2.07M|        return ((size_t{1} << BL) - std::min(size_t{BL}, size_t{2})) *
   57|  2.07M|               ipow((size_t{1} << B) - 2, (S - BL) / B);
   58|  2.07M|    }
_ZNK5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6concatERKSB_:
  735|  59.8k|    {
  736|  59.8k|        assert(r.size + size <= max_size());
  ------------------
  |  Branch (736:9): [True: 59.8k, False: 0]
  ------------------
  737|  59.8k|        using std::get;
  738|  59.8k|        if (size == 0)
  ------------------
  |  Branch (738:13): [True: 715, False: 59.1k]
  ------------------
  739|    715|            return r;
  740|  59.1k|        else if (r.size == 0)
  ------------------
  |  Branch (740:18): [True: 374, False: 58.7k]
  ------------------
  741|    374|            return *this;
  742|  58.7k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (742:18): [True: 6.61k, False: 52.1k]
  ------------------
  743|       |            // just concat the tail, similar to push_back
  744|  6.61k|            auto tail_offst = tail_offset();
  745|  6.61k|            auto tail_size  = size - tail_offst;
  746|  6.61k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (746:17): [True: 2.38k, False: 4.23k]
  ------------------
  747|  2.38k|                auto new_root =
  748|  2.38k|                    push_tail(root, shift, tail_offst, tail, tail_size);
  749|  2.38k|                tail->inc();
  750|  2.38k|                return {size + r.size,
  751|  2.38k|                        get<0>(new_root),
  752|  2.38k|                        get<1>(new_root),
  753|  2.38k|                        r.tail->inc()};
  754|  4.23k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (754:24): [True: 2.58k, False: 1.64k]
  ------------------
  755|  2.58k|                auto new_tail =
  756|  2.58k|                    node_t::copy_leaf(tail, tail_size, r.tail, r.size);
  757|  2.58k|                return {size + r.size, shift, root->inc(), new_tail};
  758|  2.58k|            } else {
  759|  1.64k|                auto remaining = branches<BL> - tail_size;
  760|  1.64k|                auto add_tail =
  761|  1.64k|                    node_t::copy_leaf(tail, tail_size, r.tail, remaining);
  762|  1.64k|                IMMER_TRY {
  ------------------
  |  |   49|  1.64k|#define IMMER_TRY try
  ------------------
  763|  1.64k|                    auto new_tail =
  764|  1.64k|                        node_t::copy_leaf(r.tail, remaining, r.size);
  765|  1.64k|                    IMMER_TRY {
  ------------------
  |  |   49|  1.64k|#define IMMER_TRY try
  ------------------
  766|  1.64k|                        auto new_root = push_tail(
  767|  1.64k|                            root, shift, tail_offst, add_tail, branches<BL>);
  768|  1.64k|                        return {size + r.size,
  769|  1.64k|                                get<0>(new_root),
  770|  1.64k|                                get<1>(new_root),
  771|  1.64k|                                new_tail};
  772|  1.64k|                    }
  773|  1.64k|                    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.64k|                }
  778|  1.64k|                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.64k|            }
  783|  52.1k|        } else if (tail_offset() == 0) {
  ------------------
  |  Branch (783:20): [True: 3.41k, False: 48.7k]
  ------------------
  784|  3.41k|            auto tail_offst = tail_offset();
  785|  3.41k|            auto tail_size  = size - tail_offst;
  786|  3.41k|            auto concated =
  787|  3.41k|                concat_trees(tail, tail_size, r.root, r.shift, r.tail_offset());
  788|  3.41k|            auto new_shift = concated.shift();
  789|  3.41k|            auto new_root  = concated.node();
  790|  3.41k|            IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift());
  ------------------
  |  |   68|  3.41k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (790:13): [True: 3.41k, False: 0]
  ------------------
  791|  3.41k|            assert(new_root->check(new_shift, size + r.tail_offset()));
  ------------------
  |  Branch (791:13): [True: 3.41k, False: 0]
  ------------------
  792|  3.41k|            return {size + r.size, new_shift, new_root, r.tail->inc()};
  793|  48.7k|        } else {
  794|  48.7k|            auto tail_offst = tail_offset();
  795|  48.7k|            auto tail_size  = size - tail_offst;
  796|  48.7k|            auto concated   = concat_trees(root,
  797|  48.7k|                                         shift,
  798|  48.7k|                                         tail_offst,
  799|  48.7k|                                         tail,
  800|  48.7k|                                         tail_size,
  801|  48.7k|                                         r.root,
  802|  48.7k|                                         r.shift,
  803|  48.7k|                                         r.tail_offset());
  804|  48.7k|            auto new_shift  = concated.shift();
  805|  48.7k|            auto new_root   = concated.node();
  806|  48.7k|            IMMER_ASSERT_TAGGED(new_shift == new_root->compute_shift());
  ------------------
  |  |   68|  48.7k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (806:13): [True: 48.7k, False: 0]
  ------------------
  807|  48.7k|            assert(new_root->check(new_shift, size + r.tail_offset()));
  ------------------
  |  Branch (807:13): [True: 48.7k, False: 0]
  ------------------
  808|  48.7k|            return {size + r.size, new_shift, new_root, r.tail->inc()};
  809|  48.7k|        }
  810|  59.8k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13push_back_mutENS9_5applyIS6_E4type4editEi:
  478|  49.1k|    {
  479|  49.1k|        auto ts = tail_size();
  480|  49.1k|        if (ts < branches<BL>) {
  ------------------
  |  Branch (480:13): [True: 31.4k, False: 17.7k]
  ------------------
  481|  31.4k|            ensure_mutable_tail(e, ts);
  482|  31.4k|            new (&tail->leaf()[ts]) T(std::move(value));
  483|  31.4k|        } else {
  484|  17.7k|            using std::get;
  485|  17.7k|            auto new_tail = node_t::make_leaf_e(e, std::move(value));
  486|  17.7k|            auto tail_off = tail_offset();
  487|  17.7k|            IMMER_TRY {
  ------------------
  |  |   49|  17.7k|#define IMMER_TRY try
  ------------------
  488|  17.7k|                push_tail_mut(e, tail_off, tail, ts);
  489|  17.7k|                tail = new_tail;
  490|  17.7k|            }
  491|  17.7k|            IMMER_CATCH (...) {
  492|      0|                node_t::delete_leaf(new_tail, 1u);
  493|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  494|      0|            }
  495|  17.7k|        }
  496|  49.1k|        ++size;
  497|  49.1k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE19ensure_mutable_tailENS9_5applyIS6_E4type4editEj:
  469|  1.35M|    {
  470|  1.35M|        if (!tail->can_mutate(e)) {
  ------------------
  |  Branch (470:13): [True: 21.5k, False: 1.32M]
  ------------------
  471|  21.5k|            auto new_tail = node_t::copy_leaf_e(e, tail, n);
  472|  21.5k|            dec_leaf(tail, n);
  473|  21.5k|            tail = new_tail;
  474|  21.5k|        }
  475|  1.35M|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE13push_tail_mutENS9_5applyIS6_E4type4editEmPNS1_4nodeIiSA_Lj2ELj2EEEj:
  417|  1.78M|    {
  418|  1.78M|        if (auto r = root->relaxed()) {
  ------------------
  |  Branch (418:18): [True: 631k, False: 1.15M]
  ------------------
  419|   631k|            auto new_root =
  420|   631k|                make_relaxed_pos(root, shift, r)
  421|   631k|                    .visit(push_tail_mut_visitor<node_t>{}, e, tail, tail_size);
  422|   631k|            if (new_root) {
  ------------------
  |  Branch (422:17): [True: 630k, False: 1.47k]
  ------------------
  423|   630k|                root = new_root;
  424|   630k|            } else {
  425|  1.47k|                auto new_root = node_t::make_inner_r_e(e);
  426|  1.47k|                IMMER_TRY {
  ------------------
  |  |   49|  1.47k|#define IMMER_TRY try
  ------------------
  427|  1.47k|                    auto new_path        = node_t::make_path_e(e, shift, tail);
  428|  1.47k|                    new_root->inner()[0] = root;
  429|  1.47k|                    new_root->inner()[1] = new_path;
  430|  1.47k|                    new_root->relaxed()->d.sizes[0] = tail_off;
  431|  1.47k|                    new_root->relaxed()->d.sizes[1] = tail_off + tail_size;
  432|  1.47k|                    assert(tail_off);
  ------------------
  |  Branch (432:21): [True: 1.47k, False: 0]
  ------------------
  433|  1.47k|                    assert(tail_size);
  ------------------
  |  Branch (433:21): [True: 1.47k, False: 0]
  ------------------
  434|  1.47k|                    new_root->relaxed()->d.count = 2u;
  435|  1.47k|                    root                         = new_root;
  436|  1.47k|                    shift += B;
  437|  1.47k|                }
  438|  1.47k|                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.47k|            }
  443|  1.15M|        } else if (tail_off == size_t{branches<B>} << shift) {
  ------------------
  |  Branch (443:20): [True: 5.03k, False: 1.14M]
  ------------------
  444|  5.03k|            auto new_root = node_t::make_inner_e(e);
  445|  5.03k|            IMMER_TRY {
  ------------------
  |  |   49|  5.03k|#define IMMER_TRY try
  ------------------
  446|  5.03k|                auto new_path        = node_t::make_path_e(e, shift, tail);
  447|  5.03k|                new_root->inner()[0] = root;
  448|  5.03k|                new_root->inner()[1] = new_path;
  449|  5.03k|                root                 = new_root;
  450|  5.03k|                shift += B;
  451|  5.03k|            }
  452|  5.03k|            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.14M|        } else if (tail_off) {
  ------------------
  |  Branch (456:20): [True: 1.14M, False: 5.13k]
  ------------------
  457|  1.14M|            auto new_root =
  458|  1.14M|                make_regular_sub_pos(root, shift, tail_off)
  459|  1.14M|                    .visit(push_tail_mut_visitor<node_t>{}, e, tail);
  460|  1.14M|            root = new_root;
  461|  1.14M|        } else {
  462|  5.13k|            auto new_root = node_t::make_path_e(e, shift, tail);
  463|  5.13k|            dec_empty_regular(root);
  464|  5.13k|            root = new_root;
  465|  5.13k|        }
  466|  1.78M|    }
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|  10.2k|    {
  574|  10.2k|        auto& elem = get_mut(e, idx);
  575|  10.2k|        elem       = std::forward<FnT>(fn)(std::move(elem));
  576|  10.2k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7get_mutENS9_5applyIS6_E4type4editEm:
  539|  10.2k|    {
  540|  10.2k|        auto tail_off = tail_offset();
  541|  10.2k|        if (idx >= tail_off) {
  ------------------
  |  Branch (541:13): [True: 691, False: 9.58k]
  ------------------
  542|    691|            ensure_mutable_tail(e, size - tail_off);
  543|    691|            return tail->leaf()[(idx - tail_off) & mask<BL>];
  544|  9.58k|        } else {
  545|  9.58k|            return visit_maybe_relaxed_sub(root,
  546|  9.58k|                                           shift,
  547|  9.58k|                                           tail_off,
  548|  9.58k|                                           get_mut_visitor<node_t>{},
  549|  9.58k|                                           idx,
  550|  9.58k|                                           e,
  551|  9.58k|                                           &root);
  552|  9.58k|        }
  553|  10.2k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8take_mutENS9_5applyIS6_E4type4editEm:
  606|  38.2k|    {
  607|  38.2k|        auto tail_off = tail_offset();
  608|  38.2k|        if (new_size == 0) {
  ------------------
  |  Branch (608:13): [True: 918, False: 37.3k]
  ------------------
  609|    918|            *this = {};
  610|  37.3k|        } else if (new_size >= size) {
  ------------------
  |  Branch (610:20): [True: 2.64k, False: 34.6k]
  ------------------
  611|  2.64k|            return;
  612|  34.6k|        } else if (new_size > tail_off) {
  ------------------
  |  Branch (612:20): [True: 873, False: 33.8k]
  ------------------
  613|    873|            auto ts    = size - tail_off;
  614|    873|            auto newts = new_size - tail_off;
  615|    873|            if (tail->can_mutate(e)) {
  ------------------
  |  Branch (615:17): [True: 635, False: 238]
  ------------------
  616|    635|                detail::destroy_n(tail->leaf() + newts, ts - newts);
  617|    635|            } else {
  618|    238|                auto new_tail = node_t::copy_leaf_e(e, tail, newts);
  619|    238|                dec_leaf(tail, ts);
  620|    238|                tail = new_tail;
  621|    238|            }
  622|    873|            size = new_size;
  623|    873|            return;
  624|  33.8k|        } else {
  625|  33.8k|            using std::get;
  626|  33.8k|            auto l = new_size - 1;
  627|  33.8k|            auto v = slice_right_mut_visitor<node_t>();
  628|  33.8k|            auto r = visit_maybe_relaxed_sub(root, shift, tail_off, v, l, e);
  629|  33.8k|            auto new_shift = get<0>(r);
  630|  33.8k|            auto new_root  = get<1>(r);
  631|  33.8k|            auto new_tail  = get<3>(r);
  632|  33.8k|            if (new_root) {
  ------------------
  |  Branch (632:17): [True: 25.8k, False: 7.96k]
  ------------------
  633|  25.8k|                root  = new_root;
  634|  25.8k|                shift = new_shift;
  635|  25.8k|            } else {
  636|  7.96k|                root  = empty_root();
  637|  7.96k|                shift = BL;
  638|  7.96k|            }
  639|  33.8k|            dec_leaf(tail, size - tail_off);
  640|  33.8k|            size = new_size;
  641|  33.8k|            tail = new_tail;
  642|  33.8k|            return;
  643|  33.8k|        }
  644|  38.2k|    }
_ZN5immer6detail4rbts12concat_mut_rERKNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEERSB_NS9_5applyIS6_E4type4editE:
  942|  32.6k|    {
  943|  32.6k|        assert(&l != &r);
  ------------------
  |  Branch (943:9): [True: 32.6k, False: 0]
  ------------------
  944|  32.6k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (944:9): [True: 32.6k, False: 0]
  ------------------
  945|  32.6k|        using std::get;
  946|  32.6k|        if (r.size == 0)
  ------------------
  |  Branch (946:13): [True: 3.26k, False: 29.4k]
  ------------------
  947|  3.26k|            r = std::move(l);
  948|  29.4k|        else if (l.size == 0)
  ------------------
  |  Branch (948:18): [True: 479, False: 28.9k]
  ------------------
  949|    479|            return;
  950|  28.9k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (950:18): [True: 6.45k, False: 22.4k]
  ------------------
  951|       |            // just concat the tail, similar to push_back
  952|  6.45k|            auto tail_offst = l.tail_offset();
  953|  6.45k|            auto tail_size  = l.size - tail_offst;
  954|  6.45k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (954:17): [True: 1.28k, False: 5.16k]
  ------------------
  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.28k|                auto res =
  959|  1.28k|                    l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size);
  960|  1.28k|                l.tail->inc(); // note: leak if mutably concatenated
  961|       |                               // with itself, but this is forbidden
  962|       |                               // by the interface
  963|  1.28k|                r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()};
  964|  1.28k|                return;
  965|  5.16k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (965:24): [True: 2.94k, False: 2.22k]
  ------------------
  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|  2.94k|                auto new_tail =
  974|  2.94k|                    node_t::copy_leaf(l.tail, tail_size, r.tail, r.size);
  975|  2.94k|                r = {l.size + r.size, l.shift, l.root->inc(), new_tail};
  976|  2.94k|                return;
  977|  2.94k|            } else {
  978|       |                // like the immutable version
  979|  2.22k|                auto remaining = branches<BL> - tail_size;
  980|  2.22k|                auto add_tail  = node_t::copy_leaf_e(
  981|  2.22k|                    er, l.tail, tail_size, r.tail, remaining);
  982|  2.22k|                IMMER_TRY {
  ------------------
  |  |   49|  2.22k|#define IMMER_TRY try
  ------------------
  983|  2.22k|                    auto new_tail =
  984|  2.22k|                        node_t::copy_leaf_e(er, r.tail, remaining, r.size);
  985|  2.22k|                    IMMER_TRY {
  ------------------
  |  |   49|  2.22k|#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.22k|                        auto new_root = l.push_tail(l.root,
  990|  2.22k|                                                    l.shift,
  991|  2.22k|                                                    tail_offst,
  992|  2.22k|                                                    add_tail,
  993|  2.22k|                                                    branches<BL>);
  994|  2.22k|                        r             = {l.size + r.size,
  995|  2.22k|                                         get<0>(new_root),
  996|  2.22k|                                         get<1>(new_root),
  997|  2.22k|                                         new_tail};
  998|  2.22k|                        return;
  999|  2.22k|                    }
 1000|  2.22k|                    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.22k|                }
 1005|  2.22k|                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.22k|            }
 1010|  22.4k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1010:20): [True: 2.52k, False: 19.9k]
  ------------------
 1011|  2.52k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1011:17): [True: 2.52k, Folded]
  ------------------
 1012|  2.52k|                auto tail_offst = l.tail_offset();
 1013|  2.52k|                auto tail_size  = l.size - tail_offst;
 1014|  2.52k|                auto concated =
 1015|  2.52k|                    concat_trees_mut(er,
 1016|  2.52k|                                     MemoryPolicy::transience_t::noone,
 1017|  2.52k|                                     l.tail,
 1018|  2.52k|                                     tail_size,
 1019|  2.52k|                                     er,
 1020|  2.52k|                                     r.root,
 1021|  2.52k|                                     r.shift,
 1022|  2.52k|                                     r.tail_offset());
 1023|  2.52k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  2.52k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1023:17): [True: 2.52k, False: 0]
  ------------------
 1024|  2.52k|                                    concated.node()->compute_shift());
 1025|  2.52k|                r.size += l.size;
 1026|  2.52k|                r.shift = concated.shift();
 1027|  2.52k|                r.root  = concated.node();
 1028|  2.52k|                assert(r.check_tree());
  ------------------
  |  Branch (1028:17): [True: 2.52k, False: 0]
  ------------------
 1029|  2.52k|            } 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.9k|        } else {
 1041|  19.9k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1041:17): [True: 19.9k, Folded]
  ------------------
 1042|  19.9k|                auto tail_offst = l.tail_offset();
 1043|  19.9k|                auto tail_size  = l.size - tail_offst;
 1044|  19.9k|                auto concated =
 1045|  19.9k|                    concat_trees_mut(er,
 1046|  19.9k|                                     MemoryPolicy::transience_t::noone,
 1047|  19.9k|                                     l.root,
 1048|  19.9k|                                     l.shift,
 1049|  19.9k|                                     tail_offst,
 1050|  19.9k|                                     l.tail,
 1051|  19.9k|                                     tail_size,
 1052|  19.9k|                                     er,
 1053|  19.9k|                                     r.root,
 1054|  19.9k|                                     r.shift,
 1055|  19.9k|                                     r.tail_offset());
 1056|  19.9k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  19.9k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1056:17): [True: 19.9k, False: 0]
  ------------------
 1057|  19.9k|                                    concated.node()->compute_shift());
 1058|  19.9k|                r.size += l.size;
 1059|  19.9k|                r.shift = concated.shift();
 1060|  19.9k|                r.root  = concated.node();
 1061|  19.9k|                assert(r.check_tree());
  ------------------
  |  Branch (1061:17): [True: 19.9k, False: 0]
  ------------------
 1062|  19.9k|                return;
 1063|  19.9k|            } 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.9k|        }
 1081|  32.6k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEaSERKSB_:
  163|  6.43k|    {
  164|  6.43k|        auto next{other};
  165|  6.43k|        swap(*this, next);
  166|  6.43k|        return *this;
  167|  6.43k|    }
_ZN5immer6detail4rbts15concat_mut_lr_rERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_:
 1220|  3.68k|    {
 1221|  3.68k|        assert(&l != &r);
  ------------------
  |  Branch (1221:9): [True: 3.68k, False: 0]
  ------------------
 1222|  3.68k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (1222:9): [True: 3.68k, False: 0]
  ------------------
 1223|  3.68k|        using std::get;
 1224|  3.68k|        if (r.size == 0)
  ------------------
  |  Branch (1224:13): [True: 272, False: 3.40k]
  ------------------
 1225|    272|            r = l;
 1226|  3.40k|        else if (l.size == 0)
  ------------------
  |  Branch (1226:18): [True: 395, False: 3.01k]
  ------------------
 1227|    395|            return;
 1228|  3.01k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (1228:18): [True: 1.14k, False: 1.86k]
  ------------------
 1229|       |            // just concat the tail, similar to push_back
 1230|  1.14k|            auto tail_offst = l.tail_offset();
 1231|  1.14k|            auto tail_size  = l.size - tail_offst;
 1232|  1.14k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (1232:17): [True: 321, False: 826]
  ------------------
 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|    321|                auto res =
 1237|    321|                    l.push_tail(l.root, l.shift, tail_offst, l.tail, tail_size);
 1238|    321|                r = {l.size + r.size, get<0>(res), get<1>(res), r.tail->inc()};
 1239|    321|                return;
 1240|    826|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (1240:24): [True: 579, False: 247]
  ------------------
 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|    579|                auto new_tail =
 1249|    579|                    node_t::copy_leaf(l.tail, tail_size, r.tail, r.size);
 1250|    579|                r = {l.size + r.size, l.shift, l.root->inc(), new_tail};
 1251|    579|                return;
 1252|    579|            } else {
 1253|       |                // like the immutable version.
 1254|       |                // we could improve this also by moving elements
 1255|       |                // instead of just copying them
 1256|    247|                auto remaining = branches<BL> - tail_size;
 1257|    247|                auto add_tail  = node_t::copy_leaf_e(
 1258|    247|                    er, l.tail, tail_size, r.tail, remaining);
 1259|    247|                IMMER_TRY {
  ------------------
  |  |   49|    247|#define IMMER_TRY try
  ------------------
 1260|    247|                    auto new_tail =
 1261|    247|                        node_t::copy_leaf_e(er, r.tail, remaining, r.size);
 1262|    247|                    IMMER_TRY {
  ------------------
  |  |   49|    247|#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|    247|                        auto new_root = l.push_tail(l.root,
 1267|    247|                                                    l.shift,
 1268|    247|                                                    tail_offst,
 1269|    247|                                                    add_tail,
 1270|    247|                                                    branches<BL>);
 1271|    247|                        r             = {l.size + r.size,
 1272|    247|                                         get<0>(new_root),
 1273|    247|                                         get<1>(new_root),
 1274|    247|                                         new_tail};
 1275|    247|                        return;
 1276|    247|                    }
 1277|    247|                    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|    247|                }
 1282|    247|                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|    247|            }
 1287|  1.86k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1287:20): [True: 641, False: 1.22k]
  ------------------
 1288|    641|            if (supports_transient_concat) {
  ------------------
  |  Branch (1288:17): [True: 641, Folded]
  ------------------
 1289|    641|                auto tail_offst = l.tail_offset();
 1290|    641|                auto tail_size  = l.size - tail_offst;
 1291|    641|                auto concated   = concat_trees_mut(er,
 1292|    641|                                                 el,
 1293|    641|                                                 l.tail,
 1294|    641|                                                 tail_size,
 1295|    641|                                                 er,
 1296|    641|                                                 r.root,
 1297|    641|                                                 r.shift,
 1298|    641|                                                 r.tail_offset());
 1299|    641|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|    641|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1299:17): [True: 641, False: 0]
  ------------------
 1300|    641|                                    concated.node()->compute_shift());
 1301|    641|                assert(concated.node()->check(concated.shift(),
  ------------------
  |  Branch (1301:17): [True: 641, False: 0]
  ------------------
 1302|    641|                                              l.size + r.tail_offset()));
 1303|    641|                r.size += l.size;
 1304|    641|                r.shift = concated.shift();
 1305|    641|                r.root  = concated.node();
 1306|    641|                assert(r.check_tree());
  ------------------
  |  Branch (1306:17): [True: 641, False: 0]
  ------------------
 1307|    641|                l.hard_reset();
 1308|    641|            } 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.22k|        } else {
 1320|  1.22k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1320:17): [True: 1.22k, Folded]
  ------------------
 1321|  1.22k|                auto tail_offst = l.tail_offset();
 1322|  1.22k|                auto tail_size  = l.size - tail_offst;
 1323|  1.22k|                auto concated   = concat_trees_mut(er,
 1324|  1.22k|                                                 el,
 1325|  1.22k|                                                 l.root,
 1326|  1.22k|                                                 l.shift,
 1327|  1.22k|                                                 tail_offst,
 1328|  1.22k|                                                 l.tail,
 1329|  1.22k|                                                 tail_size,
 1330|  1.22k|                                                 er,
 1331|  1.22k|                                                 r.root,
 1332|  1.22k|                                                 r.shift,
 1333|  1.22k|                                                 r.tail_offset());
 1334|  1.22k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  1.22k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1334:17): [True: 1.22k, False: 0]
  ------------------
 1335|  1.22k|                                    concated.node()->compute_shift());
 1336|  1.22k|                assert(concated.node()->check(concated.shift(),
  ------------------
  |  Branch (1336:17): [True: 1.22k, False: 0]
  ------------------
 1337|  1.22k|                                              l.size + r.tail_offset()));
 1338|  1.22k|                r.size += l.size;
 1339|  1.22k|                r.shift = concated.shift();
 1340|  1.22k|                r.root  = concated.node();
 1341|  1.22k|                assert(r.check_tree());
  ------------------
  |  Branch (1341:17): [True: 1.22k, False: 0]
  ------------------
 1342|  1.22k|                l.hard_reset();
 1343|  1.22k|            } 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.22k|        }
 1360|  3.68k|    }
_ZN5immer6detail4rbts7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10hard_resetEv:
 1363|  3.91k|    {
 1364|  3.91k|        assert(supports_transient_concat);
  ------------------
  |  Branch (1364:9): [True: 3.91k, Folded]
  ------------------
 1365|  3.91k|        size  = 0;
 1366|  3.91k|        shift = BL;
 1367|  3.91k|        root  = empty_root();
 1368|  3.91k|        tail  = empty_tail();
 1369|  3.91k|    }
_ZN5immer6detail4rbts12concat_mut_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editERKSB_:
  816|  1.87M|    {
  817|  1.87M|        assert(&l != &r);
  ------------------
  |  Branch (817:9): [True: 1.87M, False: 0]
  ------------------
  818|  1.87M|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (818:9): [True: 1.87M, False: 0]
  ------------------
  819|  1.87M|        using std::get;
  820|  1.87M|        if (l.size == 0)
  ------------------
  |  Branch (820:13): [True: 2.23k, False: 1.87M]
  ------------------
  821|  2.23k|            l = r;
  822|  1.87M|        else if (r.size == 0)
  ------------------
  |  Branch (822:18): [True: 14.7k, False: 1.85M]
  ------------------
  823|  14.7k|            return;
  824|  1.85M|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (824:18): [True: 1.76M, False: 91.0k]
  ------------------
  825|       |            // just concat the tail, similar to push_back
  826|  1.76M|            auto tail_offst = l.tail_offset();
  827|  1.76M|            auto tail_size  = l.size - tail_offst;
  828|  1.76M|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (828:17): [True: 450k, False: 1.31M]
  ------------------
  829|   450k|                l.push_tail_mut(el, tail_offst, l.tail, tail_size);
  830|   450k|                l.tail = r.tail->inc();
  831|   450k|                l.size += r.size;
  832|   450k|                return;
  833|  1.31M|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (833:24): [True: 3.48k, False: 1.31M]
  ------------------
  834|  3.48k|                l.ensure_mutable_tail(el, tail_size);
  835|  3.48k|                detail::uninitialized_copy(r.tail->leaf(),
  836|  3.48k|                                           r.tail->leaf() + r.size,
  837|  3.48k|                                           l.tail->leaf() + tail_size);
  838|  3.48k|                l.size += r.size;
  839|  3.48k|                return;
  840|  1.31M|            } else {
  841|  1.31M|                auto remaining = branches<BL> - tail_size;
  842|  1.31M|                l.ensure_mutable_tail(el, tail_size);
  843|  1.31M|                detail::uninitialized_copy(r.tail->leaf(),
  844|  1.31M|                                           r.tail->leaf() + remaining,
  845|  1.31M|                                           l.tail->leaf() + tail_size);
  846|  1.31M|                IMMER_TRY {
  ------------------
  |  |   49|  1.31M|#define IMMER_TRY try
  ------------------
  847|  1.31M|                    auto new_tail =
  848|  1.31M|                        node_t::copy_leaf_e(el, r.tail, remaining, r.size);
  849|  1.31M|                    IMMER_TRY {
  ------------------
  |  |   49|  1.31M|#define IMMER_TRY try
  ------------------
  850|  1.31M|                        l.push_tail_mut(el, tail_offst, l.tail, branches<BL>);
  851|  1.31M|                        l.tail = new_tail;
  852|  1.31M|                        l.size += r.size;
  853|  1.31M|                        return;
  854|  1.31M|                    }
  855|  1.31M|                    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.31M|                }
  860|  1.31M|                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.31M|            }
  865|  1.76M|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (865:20): [True: 3.21k, False: 87.8k]
  ------------------
  866|  3.21k|            if (supports_transient_concat) {
  ------------------
  |  Branch (866:17): [True: 3.21k, Folded]
  ------------------
  867|  3.21k|                auto tail_offst = l.tail_offset();
  868|  3.21k|                auto tail_size  = l.size - tail_offst;
  869|  3.21k|                auto concated =
  870|  3.21k|                    concat_trees_mut(el,
  871|  3.21k|                                     el,
  872|  3.21k|                                     l.tail,
  873|  3.21k|                                     tail_size,
  874|  3.21k|                                     MemoryPolicy::transience_t::noone,
  875|  3.21k|                                     r.root,
  876|  3.21k|                                     r.shift,
  877|  3.21k|                                     r.tail_offset());
  878|  3.21k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  3.21k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (878:17): [True: 3.21k, False: 0]
  ------------------
  879|  3.21k|                                    concated.node()->compute_shift());
  880|  3.21k|                l.size += r.size;
  881|  3.21k|                l.shift = concated.shift();
  882|  3.21k|                l.root  = concated.node();
  883|  3.21k|                l.tail  = r.tail;
  884|  3.21k|                assert(l.check_tree());
  ------------------
  |  Branch (884:17): [True: 3.21k, False: 0]
  ------------------
  885|  3.21k|            } 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|  87.8k|        } else {
  898|  87.8k|            if (supports_transient_concat) {
  ------------------
  |  Branch (898:17): [True: 87.8k, Folded]
  ------------------
  899|  87.8k|                auto tail_offst = l.tail_offset();
  900|  87.8k|                auto tail_size  = l.size - tail_offst;
  901|  87.8k|                assert(l.check_tree());
  ------------------
  |  Branch (901:17): [True: 87.8k, False: 0]
  ------------------
  902|  87.8k|                assert(r.check_tree());
  ------------------
  |  Branch (902:17): [True: 87.8k, False: 0]
  ------------------
  903|  87.8k|                auto concated =
  904|  87.8k|                    concat_trees_mut(el,
  905|  87.8k|                                     el,
  906|  87.8k|                                     l.root,
  907|  87.8k|                                     l.shift,
  908|  87.8k|                                     tail_offst,
  909|  87.8k|                                     l.tail,
  910|  87.8k|                                     tail_size,
  911|  87.8k|                                     MemoryPolicy::transience_t::noone,
  912|  87.8k|                                     r.root,
  913|  87.8k|                                     r.shift,
  914|  87.8k|                                     r.tail_offset());
  915|  87.8k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  87.8k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (915:17): [True: 87.8k, False: 0]
  ------------------
  916|  87.8k|                                    concated.node()->compute_shift());
  917|  87.8k|                l.size += r.size;
  918|  87.8k|                l.shift = concated.shift();
  919|  87.8k|                l.root  = concated.node();
  920|  87.8k|                l.tail  = r.tail;
  921|  87.8k|                assert(l.check_tree());
  ------------------
  |  Branch (921:17): [True: 87.8k, False: 0]
  ------------------
  922|  87.8k|            } 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|  87.8k|        }
  939|  1.87M|    }
_ZN5immer6detail4rbts15concat_mut_lr_lERNS1_7rrbtreeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEENS9_5applyIS6_E4type4editESC_SG_:
 1084|  5.87k|    {
 1085|  5.87k|        assert(&l != &r);
  ------------------
  |  Branch (1085:9): [True: 5.87k, False: 0]
  ------------------
 1086|  5.87k|        assert(r.size < (std::numeric_limits<size_t>::max() - l.size));
  ------------------
  |  Branch (1086:9): [True: 5.87k, False: 0]
  ------------------
 1087|  5.87k|        using std::get;
 1088|  5.87k|        if (l.size == 0)
  ------------------
  |  Branch (1088:13): [True: 651, False: 5.21k]
  ------------------
 1089|    651|            l = r;
 1090|  5.21k|        else if (r.size == 0)
  ------------------
  |  Branch (1090:18): [True: 498, False: 4.72k]
  ------------------
 1091|    498|            return;
 1092|  4.72k|        else if (r.tail_offset() == 0) {
  ------------------
  |  Branch (1092:18): [True: 2.67k, False: 2.04k]
  ------------------
 1093|       |            // just concat the tail, similar to push_back
 1094|  2.67k|            auto tail_offst = l.tail_offset();
 1095|  2.67k|            auto tail_size  = l.size - tail_offst;
 1096|  2.67k|            if (tail_size == branches<BL>) {
  ------------------
  |  Branch (1096:17): [True: 506, False: 2.16k]
  ------------------
 1097|    506|                l.push_tail_mut(el, tail_offst, l.tail, tail_size);
 1098|    506|                l.tail = r.tail->inc();
 1099|    506|                l.size += r.size;
 1100|    506|                return;
 1101|  2.16k|            } else if (tail_size + r.size <= branches<BL>) {
  ------------------
  |  Branch (1101:24): [True: 1.40k, False: 763]
  ------------------
 1102|  1.40k|                l.ensure_mutable_tail(el, tail_size);
 1103|  1.40k|                if (r.tail->can_mutate(er))
  ------------------
  |  Branch (1103:21): [True: 817, False: 589]
  ------------------
 1104|    817|                    detail::uninitialized_move(r.tail->leaf(),
 1105|    817|                                               r.tail->leaf() + r.size,
 1106|    817|                                               l.tail->leaf() + tail_size);
 1107|    589|                else
 1108|    589|                    detail::uninitialized_copy(r.tail->leaf(),
 1109|    589|                                               r.tail->leaf() + r.size,
 1110|    589|                                               l.tail->leaf() + tail_size);
 1111|  1.40k|                l.size += r.size;
 1112|  1.40k|                return;
 1113|  1.40k|            } else {
 1114|    763|                auto remaining = branches<BL> - tail_size;
 1115|    763|                l.ensure_mutable_tail(el, tail_size);
 1116|    763|                if (r.tail->can_mutate(er))
  ------------------
  |  Branch (1116:21): [True: 201, False: 562]
  ------------------
 1117|    201|                    detail::uninitialized_move(r.tail->leaf(),
 1118|    201|                                               r.tail->leaf() + remaining,
 1119|    201|                                               l.tail->leaf() + tail_size);
 1120|    562|                else
 1121|    562|                    detail::uninitialized_copy(r.tail->leaf(),
 1122|    562|                                               r.tail->leaf() + remaining,
 1123|    562|                                               l.tail->leaf() + tail_size);
 1124|    763|                IMMER_TRY {
  ------------------
  |  |   49|    763|#define IMMER_TRY try
  ------------------
 1125|    763|                    auto new_tail =
 1126|    763|                        node_t::copy_leaf_e(el, r.tail, remaining, r.size);
 1127|    763|                    IMMER_TRY {
  ------------------
  |  |   49|    763|#define IMMER_TRY try
  ------------------
 1128|    763|                        l.push_tail_mut(el, tail_offst, l.tail, branches<BL>);
 1129|    763|                        l.tail = new_tail;
 1130|    763|                        l.size += r.size;
 1131|    763|                        return;
 1132|    763|                    }
 1133|    763|                    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|    763|                }
 1138|    763|                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|    763|            }
 1143|  2.67k|        } else if (l.tail_offset() == 0) {
  ------------------
  |  Branch (1143:20): [True: 679, False: 1.36k]
  ------------------
 1144|    679|            if (supports_transient_concat) {
  ------------------
  |  Branch (1144:17): [True: 679, Folded]
  ------------------
 1145|    679|                auto tail_offst = l.tail_offset();
 1146|    679|                auto tail_size  = l.size - tail_offst;
 1147|    679|                auto concated   = concat_trees_mut(el,
 1148|    679|                                                 el,
 1149|    679|                                                 l.tail,
 1150|    679|                                                 tail_size,
 1151|    679|                                                 er,
 1152|    679|                                                 r.root,
 1153|    679|                                                 r.shift,
 1154|    679|                                                 r.tail_offset());
 1155|    679|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|    679|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1155:17): [True: 679, False: 0]
  ------------------
 1156|    679|                                    concated.node()->compute_shift());
 1157|    679|                l.size += r.size;
 1158|    679|                l.shift = concated.shift();
 1159|    679|                l.root  = concated.node();
 1160|    679|                l.tail  = r.tail;
 1161|    679|                assert(l.check_tree());
  ------------------
  |  Branch (1161:17): [True: 679, False: 0]
  ------------------
 1162|    679|                r.hard_reset();
 1163|    679|                return;
 1164|    679|            } 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.36k|        } else {
 1176|  1.36k|            if (supports_transient_concat) {
  ------------------
  |  Branch (1176:17): [True: 1.36k, Folded]
  ------------------
 1177|  1.36k|                auto tail_offst = l.tail_offset();
 1178|  1.36k|                auto tail_size  = l.size - tail_offst;
 1179|  1.36k|                auto concated   = concat_trees_mut(el,
 1180|  1.36k|                                                 el,
 1181|  1.36k|                                                 l.root,
 1182|  1.36k|                                                 l.shift,
 1183|  1.36k|                                                 tail_offst,
 1184|  1.36k|                                                 l.tail,
 1185|  1.36k|                                                 tail_size,
 1186|  1.36k|                                                 er,
 1187|  1.36k|                                                 r.root,
 1188|  1.36k|                                                 r.shift,
 1189|  1.36k|                                                 r.tail_offset());
 1190|  1.36k|                IMMER_ASSERT_TAGGED(concated.shift() ==
  ------------------
  |  |   68|  1.36k|#define IMMER_ASSERT_TAGGED(assertion) assert(assertion)
  ------------------
  |  Branch (1190:17): [True: 1.36k, False: 0]
  ------------------
 1191|  1.36k|                                    concated.node()->compute_shift());
 1192|  1.36k|                l.size += r.size;
 1193|  1.36k|                l.shift = concated.shift();
 1194|  1.36k|                l.root  = concated.node();
 1195|  1.36k|                l.tail  = r.tail;
 1196|  1.36k|                assert(l.check_tree());
  ------------------
  |  Branch (1196:17): [True: 1.36k, False: 0]
  ------------------
 1197|  1.36k|                r.hard_reset();
 1198|  1.36k|                return;
 1199|  1.36k|            } 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.36k|        }
 1217|  5.87k|    }

_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.4k|    {
   32|  14.4k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  14.4k|    }
_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|  94.6k|    {
   32|  94.6k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  94.6k|    }
_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.48k|    {
   38|  1.48k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.48k|    }
_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.56k|    {
   38|  2.56k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.56k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_18slice_left_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEELb1EEEE13visit_regularIJRNS1_15regular_sub_posISD_EERmEEEDcDpOT_:
   37|  2.36k|    {
   38|  2.36k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.36k|    }
_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.06k|    {
   38|  1.06k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.06k|    }
_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|    356|    {
   38|    356|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    356|    }
_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.41k|    {
   38|  3.41k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.41k|    }
_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.41k|    {
   44|  3.41k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.41k|    }
_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|  2.09k|    {
   32|  2.09k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  2.09k|    }
_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|  2.09k|    {
   44|  2.09k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  2.09k|    }
_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|   949k|    {
   50|   949k|        return Deriv::visit_node(std::forward<Args>(args)...);
   51|   949k|    }
_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.07M|    {
   32|  4.07M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  4.07M|    }
_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.07M|    {
   44|  4.07M|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  4.07M|    }
_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.42M|    {
   32|  1.42M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.42M|    }
_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|  6.45k|    {
   32|  6.45k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  6.45k|    }
_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|    198|    {
   38|    198|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    198|    }
_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.13k|    {
   38|  1.13k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.13k|    }
_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|  95.5k|    {
   50|  95.5k|        return Deriv::visit_node(std::forward<Args>(args)...);
   51|  95.5k|    }
_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|   139k|    {
   38|   139k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   139k|    }
_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|   139k|    {
   44|   139k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   139k|    }
_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|  21.8k|    {
   38|  21.8k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  21.8k|    }
_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|  92.5k|    {
   38|  92.5k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  92.5k|    }
_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|  92.5k|    {
   44|  92.5k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  92.5k|    }
_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|  14.5k|    {
   38|  14.5k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  14.5k|    }
_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.32k|    {
   38|  1.32k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.32k|    }
_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.32k|    {
   44|  1.32k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  1.32k|    }
_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|  43.0k|    {
   32|  43.0k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  43.0k|    }
_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|  43.0k|    {
   44|  43.0k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  43.0k|    }
_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|  40.1k|    {
   32|  40.1k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  40.1k|    }
_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|  40.1k|    {
   44|  40.1k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  40.1k|    }
_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|  3.04k|    {
   32|  3.04k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  3.04k|    }
_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|    745|    {
   38|    745|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    745|    }
_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.2k|    {
   32|  10.2k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  10.2k|    }
_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|    798|    {
   38|    798|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    798|    }
_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.34k|    {
   38|  1.34k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.34k|    }
_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|  3.86k|    {
   38|  3.86k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.86k|    }
_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.41k|    {
   38|  1.41k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.41k|    }
_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.57k|    {
   38|  1.57k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.57k|    }
_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|  9.72k|    {
   38|  9.72k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  9.72k|    }
_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|   181k|    {
   32|   181k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   181k|    }
_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|    228|    {
   38|    228|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    228|    }
_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|  2.80k|    {
   32|  2.80k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  2.80k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_20concat_right_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_regularIJRNS1_8full_posISD_EERNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EEEEEDcDpOT_:
   37|  1.86k|    {
   38|  1.86k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.86k|    }
_ZN5immer6detail4rbts12visitor_baseINS1_19concat_both_visitorINS1_4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEEEEE13visit_relaxedIJRNS1_11relaxed_posISD_EERNS1_8leaf_posISD_EERNS1_8full_posISD_EEEEEDcDpOT_:
   31|    405|    {
   32|    405|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    405|    }
_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|    625|    {
   32|    625|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    625|    }
_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|   172k|    {
   32|   172k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   172k|    }
_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.93k|    {
   38|  2.93k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.93k|    }
_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.93k|    {
   44|  2.93k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  2.93k|    }
_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.66k|    {
   38|  5.66k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  5.66k|    }
_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.66k|    {
   44|  5.66k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  5.66k|    }
_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|    856|    {
   32|    856|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    856|    }
_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|    856|    {
   44|    856|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|    856|    }
_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.81k|    {
   38|  4.81k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.81k|    }
_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.81k|    {
   44|  4.81k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  4.81k|    }
_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.36k|    {
   32|  3.36k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  3.36k|    }
_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.36k|    {
   44|  3.36k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.36k|    }
_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.64M|    {
   32|  2.64M|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  2.64M|    }
_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|  10.9k|    {
   32|  10.9k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  10.9k|    }
_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|    252|    {
   38|    252|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|    252|    }
_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.60k|    {
   38|  1.60k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.60k|    }
_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|   118k|    {
   38|   118k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|   118k|    }
_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|  78.0k|    {
   38|  78.0k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  78.0k|    }
_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.68k|    {
   38|  3.68k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.68k|    }
_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.68k|    {
   44|  3.68k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.68k|    }
_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|   104k|    {
   32|   104k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   104k|    }
_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|   104k|    {
   44|   104k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|   104k|    }
_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|  61.6k|    {
   32|  61.6k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  61.6k|    }
_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|  61.6k|    {
   44|  61.6k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  61.6k|    }
_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|   148k|    {
   32|   148k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   148k|    }
_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.67k|    {
   38|  3.67k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  3.67k|    }
_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|  86.2k|    {
   32|  86.2k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  86.2k|    }
_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.96k|    {
   38|  2.96k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.96k|    }
_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|  1.96k|    {
   38|  1.96k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.96k|    }
_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|  11.6k|    {
   38|  11.6k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  11.6k|    }
_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|  6.31k|    {
   38|  6.31k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  6.31k|    }
_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.51k|    {
   38|  4.51k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  4.51k|    }
_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|  80.7k|    {
   38|  80.7k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  80.7k|    }
_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|   228k|    {
   32|   228k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   228k|    }
_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.50k|    {
   38|  1.50k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  1.50k|    }
_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|   257k|    {
   32|   257k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   257k|    }
_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.61k|    {
   38|  2.61k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.61k|    }
_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|    545|    {
   32|    545|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|    545|    }
_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|  1.03k|    {
   32|  1.03k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  1.03k|    }
_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|   181k|    {
   32|   181k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|   181k|    }
_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|  42.7k|    {
   38|  42.7k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  42.7k|    }
_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|  42.7k|    {
   44|  42.7k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  42.7k|    }
_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.00k|    {
   38|  6.00k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  6.00k|    }
_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.00k|    {
   44|  6.00k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  6.00k|    }
_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.52k|    {
   32|  3.52k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   33|  3.52k|    }
_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.52k|    {
   44|  3.52k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  3.52k|    }
_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.48k|    {
   38|  2.48k|        return Deriv::visit_inner(std::forward<Args>(args)...);
   39|  2.48k|    }
_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.48k|    {
   44|  2.48k|        return Deriv::visit_node(std::forward<Args>(args)...);
   45|  2.48k|    }

_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE18get_storage_offsetEv:
  127|   908k|    {
  128|   908k|        check_base();
  129|   908k|        return sizeof(Derived);
  130|   908k|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE10check_baseEv:
  134|  37.4M|    {
  135|  37.4M|        static_assert(std::is_standard_layout<Derived>::value &&
  136|  37.4M|                          !std::is_empty<Derived>::value,
  137|  37.4M|                      "Please add 'true' if the derived class is emtpy");
  138|  37.4M|    }
_ZN5immer6detail15auto_const_castINS_18no_refcount_policyEEERT_RKS3_:
  143|  22.3M|{
  144|  22.3M|    return const_cast<T&>(x);
  145|  22.3M|}
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE18get_storage_offsetEv:
   87|   333k|    {
   88|   333k|        check_base();
   89|   333k|        return 0;
   90|   333k|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE10check_baseEv:
   94|  8.92M|    {
   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.92M|        static_assert(std::is_standard_layout<Derived>::value,
  100|  8.92M|                      "Please remove 'true' if the derived class is non emtpy");
  101|  8.92M|    }
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7inner_tEPSC_Lb0EE15get_storage_ptrEv:
  113|  36.5M|    {
  114|  36.5M|        check_base();
  115|  36.5M|        auto* base = static_cast<Derived*>(this);
  116|  36.5M|        return reinterpret_cast<T*>(base + 1);
  117|  36.5M|    }
_ZN5immer6detail9destroy_nIPijEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_:
  188|  3.31k|{
  189|  3.31k|    return first + n;
  190|  3.31k|}
_ZN5immer6detail21with_trailing_storageINS0_4rbts4nodeIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6leaf_tEiLb1EE15get_storage_ptrEv:
   75|  8.58M|    {
   76|  8.58M|        check_base();
   77|  8.58M|        return reinterpret_cast<T*>(this);
   78|  8.58M|    }
_ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_:
  236|  2.84M|{
  237|  2.84M|    return std::copy(first, last, out);
  238|  2.84M|}
_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|  28.9k|{
  345|  28.9k|    return std::forward<F2>(f2)(empty_t{});
  346|  28.9k|}
_ZN5immer6detail4ipowImEET_S2_j:
  323|  66.2M|{
  324|  66.2M|    return pow == 0 ? 1 : num * ipow(num, pow - 1);
  ------------------
  |  Branch (324:12): [True: 2.07M, False: 64.1M]
  ------------------
  325|  66.2M|}
_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|   801k|{
  345|   801k|    return std::forward<F2>(f2)(empty_t{});
  346|   801k|}
_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|   769k|{
  330|   769k|    std::forward<F>(f)(empty_t{});
  331|   769k|}
_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|  17.2k|{
  345|  17.2k|    return std::forward<F2>(f2)(empty_t{});
  346|  17.2k|}
_ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_:
  188|    635|{
  189|    635|    return first + n;
  190|    635|}
_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|   537k|{
  345|   537k|    return std::forward<F2>(f2)(empty_t{});
  346|   537k|}
_ZN5immer6detail18uninitialized_moveIPiS2_EENSt3__19enable_ifIX18can_trivially_copyIT_T0_EES6_E4typeES5_S5_S6_:
  210|  1.97k|{
  211|  1.97k|    return std::copy(first, last, out);
  212|  1.97k|}

_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
   96|  32.2k|    flex_vector() = default;
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9transientEv:
  507|   104k|    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|   172k|        : impl_(std::move(impl))
  537|   172k|    {
  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|   172k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  246|  57.4k|    {
  247|  57.4k|        return impl_.push_back(std::move(value));
  248|  57.4k|    }
_ZNK5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4sizeEv:
  181|   173k|    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.72k|    {
  324|  5.72k|        return impl_.update(index, std::forward<FnT>(fn));
  325|  5.72k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  350|  11.0k|    {
  351|  11.0k|        return impl_.take(elems);
  352|  11.0k|    }
_ZNKR5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4dropEm:
  376|  17.6k|    {
  377|  17.6k|        return impl_.drop(elems);
  378|  17.6k|    }
_ZN5immer11flex_vectorIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE8max_sizeEv:
   90|  2.01M|    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|  59.8k|    {
  404|  59.8k|        return l.impl_.concat(r.impl_);
  405|  59.8k|    }

_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2Ev:
   71|  41.7k|    flex_vector_transient() = default;
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EEC2ENS_6detail4rbts7rrbtreeIiS8_Lj2ELj2EEE:
  243|   104k|        : impl_(std::move(impl))
  244|   104k|    {
  245|   104k|    }
_ZNR5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE10persistentEv:
  233|  20.6k|    {
  234|  20.6k|        this->owner_t::operator=(owner_t{});
  235|  20.6k|        return impl_;
  236|  20.6k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE9push_backEi:
  156|  49.1k|    {
  157|  49.1k|        impl_.push_back_mut(*this, std::move(value));
  158|  49.1k|    }
_ZNK5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4sizeEv:
  127|  3.94M|    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|  10.2k|    {
  181|  10.2k|        impl_.update_mut(*this, index, std::forward<FnT>(fn));
  182|  10.2k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE4takeEm:
  189|  38.2k|    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|  32.6k|    {
  220|  32.6k|        l.owner_t::operator=(owner_t{});
  221|  32.6k|        concat_mut_r(l.impl_, impl_, *this);
  222|  32.6k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE7prependEOS9_:
  224|  3.68k|    {
  225|  3.68k|        concat_mut_lr_r(l.impl_, l, impl_, *this);
  226|  3.68k|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6appendERS9_:
  204|  1.87M|    {
  205|  1.87M|        r.owner_t::operator=(owner_t{});
  206|  1.87M|        concat_mut_l(impl_, *this, r.impl_);
  207|  1.87M|    }
_ZN5immer21flex_vector_transientIiNS_13memory_policyINS_11heap_policyINS_7gc_heapEEENS_18no_refcount_policyENS_15spinlock_policyENS_20gc_transience_policyELb0ELb0EEELj2ELj2EE6appendEOS9_:
  209|  5.87k|    {
  210|  5.87k|        concat_mut_lr_l(impl_, *this, r.impl_, r);
  211|  5.87k|    }

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

_ZN5immer18no_refcount_policyC2Ev:
   22|  5.19M|    no_refcount_policy(){};
_ZN5immer18no_refcount_policy3incEv:
   25|  4.21M|    void inc() {}
_ZN5immer18no_refcount_policy3decEv:
   26|  2.06M|    bool dec() { return false; }
_ZN5immer18no_refcount_policy6uniqueEv:
   27|  16.1M|    bool unique() { return false; }

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

