Coverage Report

Created: 2026-05-09 15:32

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/exec/common/join_utils.h
Line
Count
Source
1
// Licensed to the Apache Software Foundation (ASF) under one
2
// or more contributor license agreements.  See the NOTICE file
3
// distributed with this work for additional information
4
// regarding copyright ownership.  The ASF licenses this file
5
// to you under the Apache License, Version 2.0 (the
6
// "License"); you may not use this file except in compliance
7
// with the License.  You may obtain a copy of the License at
8
//
9
//   http://www.apache.org/licenses/LICENSE-2.0
10
//
11
// Unless required by applicable law or agreed to in writing,
12
// software distributed under the License is distributed on an
13
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
14
// KIND, either express or implied.  See the License for the
15
// specific language governing permissions and limitations
16
// under the License.
17
18
#pragma once
19
20
#include <algorithm>
21
#include <variant>
22
23
#include "exec/common/hash_table/hash_crc32_return32.h"
24
#include "exec/common/hash_table/hash_key_type.h"
25
#include "exec/common/hash_table/hash_map_context.h"
26
#include "exec/common/hash_table/join_hash_table.h"
27
28
namespace doris {
29
30
// Devirtualize compare_at for ASOF JOIN supported column types.
31
// ASOF JOIN only supports DateV2, DateTimeV2, and TimestampTZ.
32
// Dispatches to the concrete ColumnVector<T> once so that all compare_at
33
// calls inside `func` are direct (non-virtual) calls.
34
// `func` receives a single argument: a const pointer to the concrete column
35
// (or const IColumn* as fallback for unexpected types).
36
template <typename Func>
37
4
decltype(auto) asof_column_dispatch(const IColumn* col, Func&& func) {
38
4
    if (const auto* c_dv2 = check_and_get_column<ColumnDateV2>(col)) {
39
1
        return std::forward<Func>(func)(c_dv2);
40
3
    } else if (const auto* c_dtv2 = check_and_get_column<ColumnDateTimeV2>(col)) {
41
1
        return std::forward<Func>(func)(c_dtv2);
42
2
    } else if (const auto* c_tstz = check_and_get_column<ColumnTimeStampTz>(col)) {
43
1
        return std::forward<Func>(func)(c_tstz);
44
1
    } else {
45
1
        return std::forward<Func>(func)(col);
46
1
    }
47
4
}
asof_join_test.cpp:_ZN5doris20asof_column_dispatchIZNS_42AsofColumnDispatchTest_DateV2Dispatch_Test8TestBodyEvE3$_0EEDcPKNS_7IColumnEOT_
Line
Count
Source
37
1
decltype(auto) asof_column_dispatch(const IColumn* col, Func&& func) {
38
1
    if (const auto* c_dv2 = check_and_get_column<ColumnDateV2>(col)) {
39
1
        return std::forward<Func>(func)(c_dv2);
40
1
    } else if (const auto* c_dtv2 = check_and_get_column<ColumnDateTimeV2>(col)) {
41
0
        return std::forward<Func>(func)(c_dtv2);
42
0
    } else if (const auto* c_tstz = check_and_get_column<ColumnTimeStampTz>(col)) {
43
0
        return std::forward<Func>(func)(c_tstz);
44
0
    } else {
45
0
        return std::forward<Func>(func)(col);
46
0
    }
47
1
}
asof_join_test.cpp:_ZN5doris20asof_column_dispatchIZNS_46AsofColumnDispatchTest_DateTimeV2Dispatch_Test8TestBodyEvE3$_0EEDcPKNS_7IColumnEOT_
Line
Count
Source
37
1
decltype(auto) asof_column_dispatch(const IColumn* col, Func&& func) {
38
1
    if (const auto* c_dv2 = check_and_get_column<ColumnDateV2>(col)) {
39
0
        return std::forward<Func>(func)(c_dv2);
40
1
    } else if (const auto* c_dtv2 = check_and_get_column<ColumnDateTimeV2>(col)) {
41
1
        return std::forward<Func>(func)(c_dtv2);
42
1
    } else if (const auto* c_tstz = check_and_get_column<ColumnTimeStampTz>(col)) {
43
0
        return std::forward<Func>(func)(c_tstz);
44
0
    } else {
45
0
        return std::forward<Func>(func)(col);
46
0
    }
47
1
}
asof_join_test.cpp:_ZN5doris20asof_column_dispatchIZNS_47AsofColumnDispatchTest_TimestampTZDispatch_Test8TestBodyEvE3$_0EEDcPKNS_7IColumnEOT_
Line
Count
Source
37
1
decltype(auto) asof_column_dispatch(const IColumn* col, Func&& func) {
38
1
    if (const auto* c_dv2 = check_and_get_column<ColumnDateV2>(col)) {
39
0
        return std::forward<Func>(func)(c_dv2);
40
1
    } else if (const auto* c_dtv2 = check_and_get_column<ColumnDateTimeV2>(col)) {
41
0
        return std::forward<Func>(func)(c_dtv2);
42
1
    } else if (const auto* c_tstz = check_and_get_column<ColumnTimeStampTz>(col)) {
43
1
        return std::forward<Func>(func)(c_tstz);
44
1
    } else {
45
0
        return std::forward<Func>(func)(col);
46
0
    }
47
1
}
asof_join_test.cpp:_ZN5doris20asof_column_dispatchIZNS_44AsofColumnDispatchTest_FallbackDispatch_Test8TestBodyEvE3$_0EEDcPKNS_7IColumnEOT_
Line
Count
Source
37
1
decltype(auto) asof_column_dispatch(const IColumn* col, Func&& func) {
38
1
    if (const auto* c_dv2 = check_and_get_column<ColumnDateV2>(col)) {
39
0
        return std::forward<Func>(func)(c_dv2);
40
1
    } else if (const auto* c_dtv2 = check_and_get_column<ColumnDateTimeV2>(col)) {
41
0
        return std::forward<Func>(func)(c_dtv2);
42
1
    } else if (const auto* c_tstz = check_and_get_column<ColumnTimeStampTz>(col)) {
43
0
        return std::forward<Func>(func)(c_tstz);
44
1
    } else {
45
1
        return std::forward<Func>(func)(col);
46
1
    }
47
1
}
Unexecuted instantiation: hashjoin_build_sink.cpp:_ZN5doris20asof_column_dispatchIZNS_27HashJoinBuildSinkLocalState16build_asof_indexERNS_5BlockEE3$_2EEDcPKNS_7IColumnEOT_
48
using JoinOpVariants =
49
        std::variant<std::integral_constant<TJoinOp::type, TJoinOp::INNER_JOIN>,
50
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_SEMI_JOIN>,
51
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_ANTI_JOIN>,
52
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_OUTER_JOIN>,
53
                     std::integral_constant<TJoinOp::type, TJoinOp::FULL_OUTER_JOIN>,
54
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_OUTER_JOIN>,
55
                     std::integral_constant<TJoinOp::type, TJoinOp::CROSS_JOIN>,
56
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_SEMI_JOIN>,
57
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_ANTI_JOIN>,
58
                     std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_ANTI_JOIN>,
59
                     std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_SEMI_JOIN>,
60
                     std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_INNER_JOIN>,
61
                     std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_OUTER_JOIN>>;
62
63
336k
inline bool is_asof_join(TJoinOp::type join_op) {
64
336k
    return join_op == TJoinOp::ASOF_LEFT_INNER_JOIN || join_op == TJoinOp::ASOF_LEFT_OUTER_JOIN;
65
336k
}
66
67
template <int JoinOpType>
68
inline constexpr bool is_asof_join_op_v =
69
        JoinOpType == TJoinOp::ASOF_LEFT_INNER_JOIN || JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN;
70
71
template <int JoinOpType>
72
inline constexpr bool is_asof_outer_join_op_v = JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN;
73
74
template <class T>
75
using PrimaryTypeHashTableContext = MethodOneNumber<T, JoinHashMap<T, HashCRC32Return32<T>, false>>;
76
77
template <class T>
78
using DirectPrimaryTypeHashTableContext =
79
        MethodOneNumberDirect<T, JoinHashMap<T, HashCRC32Return32<T>, true>>;
80
81
template <class Key>
82
using FixedKeyHashTableContext = MethodKeysFixed<JoinHashMap<Key, HashCRC32Return32<Key>, false>>;
83
84
using SerializedHashTableContext =
85
        MethodSerialized<JoinHashMap<StringRef, HashCRC32Return32<StringRef>, false>>;
86
using MethodOneString =
87
        MethodStringNoCache<JoinHashMap<StringRef, HashCRC32Return32<StringRef>, false>>;
88
89
using HashTableVariants = std::variant<
90
        std::monostate, SerializedHashTableContext, PrimaryTypeHashTableContext<UInt8>,
91
        PrimaryTypeHashTableContext<UInt16>, PrimaryTypeHashTableContext<UInt32>,
92
        PrimaryTypeHashTableContext<UInt64>, PrimaryTypeHashTableContext<UInt128>,
93
        PrimaryTypeHashTableContext<UInt256>, DirectPrimaryTypeHashTableContext<UInt8>,
94
        DirectPrimaryTypeHashTableContext<UInt16>, DirectPrimaryTypeHashTableContext<UInt32>,
95
        DirectPrimaryTypeHashTableContext<UInt64>, DirectPrimaryTypeHashTableContext<UInt128>,
96
        FixedKeyHashTableContext<UInt64>, FixedKeyHashTableContext<UInt72>,
97
        FixedKeyHashTableContext<UInt96>, FixedKeyHashTableContext<UInt104>,
98
        FixedKeyHashTableContext<UInt128>, FixedKeyHashTableContext<UInt136>,
99
        FixedKeyHashTableContext<UInt256>, MethodOneString>;
100
101
struct JoinDataVariants {
102
    HashTableVariants method_variant;
103
104
48.0k
    void init(const std::vector<DataTypePtr>& data_types, HashKeyType type) {
105
48.0k
        switch (type) {
106
14.1k
        case HashKeyType::serialized:
107
14.1k
            method_variant.emplace<SerializedHashTableContext>();
108
14.1k
            break;
109
160
        case HashKeyType::int8_key:
110
160
            method_variant.emplace<PrimaryTypeHashTableContext<UInt8>>();
111
160
            break;
112
80
        case HashKeyType::int16_key:
113
80
            method_variant.emplace<PrimaryTypeHashTableContext<UInt16>>();
114
80
            break;
115
324
        case HashKeyType::int32_key:
116
324
            method_variant.emplace<PrimaryTypeHashTableContext<UInt32>>();
117
324
            break;
118
800
        case HashKeyType::int64_key:
119
800
            method_variant.emplace<PrimaryTypeHashTableContext<UInt64>>();
120
800
            break;
121
240
        case HashKeyType::int128_key:
122
240
            method_variant.emplace<PrimaryTypeHashTableContext<UInt128>>();
123
240
            break;
124
0
        case HashKeyType::int256_key:
125
0
            method_variant.emplace<PrimaryTypeHashTableContext<UInt256>>();
126
0
            break;
127
324
        case HashKeyType::string_key:
128
324
            method_variant.emplace<MethodOneString>();
129
324
            break;
130
3.92k
        case HashKeyType::fixed64:
131
3.92k
            method_variant.emplace<FixedKeyHashTableContext<UInt64>>(get_key_sizes(data_types));
132
3.92k
            break;
133
3.20k
        case HashKeyType::fixed72:
134
3.20k
            method_variant.emplace<FixedKeyHashTableContext<UInt72>>(get_key_sizes(data_types));
135
3.20k
            break;
136
8.00k
        case HashKeyType::fixed96:
137
8.00k
            method_variant.emplace<FixedKeyHashTableContext<UInt96>>(get_key_sizes(data_types));
138
8.00k
            break;
139
0
        case HashKeyType::fixed104:
140
0
            method_variant.emplace<FixedKeyHashTableContext<UInt104>>(get_key_sizes(data_types));
141
0
            break;
142
8.00k
        case HashKeyType::fixed128:
143
8.00k
            method_variant.emplace<FixedKeyHashTableContext<UInt128>>(get_key_sizes(data_types));
144
8.00k
            break;
145
960
        case HashKeyType::fixed136:
146
960
            method_variant.emplace<FixedKeyHashTableContext<UInt136>>(get_key_sizes(data_types));
147
960
            break;
148
7.92k
        case HashKeyType::fixed256:
149
7.92k
            method_variant.emplace<FixedKeyHashTableContext<UInt256>>(get_key_sizes(data_types));
150
7.92k
            break;
151
0
        default:
152
0
            throw Exception(ErrorCode::INTERNAL_ERROR,
153
0
                            "JoinDataVariants meet invalid key type, type={}", type);
154
48.0k
        }
155
48.0k
    }
156
};
157
158
template <typename Method>
159
void primary_to_direct_mapping(Method* context, const ColumnRawPtrs& key_columns,
160
1.60k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
1.60k
    using FieldType = typename Method::Base::Key;
162
1.60k
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
1.60k
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
1.60k
    size_t num_rows = key_columns[0]->size();
166
1.60k
    if (key_columns[0]->is_nullable()) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
1.60k
    } else {
182
1.60k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
4.83k
        for (size_t i = 1; i < num_rows; i++) {
185
3.22k
            max_key = std::max(max_key, input_keys[i]);
186
3.22k
            min_key = std::min(min_key, input_keys[i]);
187
3.22k
        }
188
1.60k
    }
189
190
1.60k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
1.60k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
1.60k
    if (allow_direct_mapping) {
193
1.60k
        for (const auto& variant_ptr : variant_ptrs) {
194
1.60k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
1.60k
                    max_key, min_key);
196
1.60k
        }
197
1.60k
    }
198
1.60k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIhNS_13JoinHashTableIhNS_17HashCRC32Return32IhEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
160
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
160
    using FieldType = typename Method::Base::Key;
162
160
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
160
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
160
    size_t num_rows = key_columns[0]->size();
166
160
    if (key_columns[0]->is_nullable()) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
160
    } else {
182
160
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
480
        for (size_t i = 1; i < num_rows; i++) {
185
320
            max_key = std::max(max_key, input_keys[i]);
186
320
            min_key = std::min(min_key, input_keys[i]);
187
320
        }
188
160
    }
189
190
160
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
160
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
160
    if (allow_direct_mapping) {
193
160
        for (const auto& variant_ptr : variant_ptrs) {
194
160
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
160
                    max_key, min_key);
196
160
        }
197
160
    }
198
160
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberItNS_13JoinHashTableItNS_17HashCRC32Return32ItEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
80
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
80
    using FieldType = typename Method::Base::Key;
162
80
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
80
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
80
    size_t num_rows = key_columns[0]->size();
166
80
    if (key_columns[0]->is_nullable()) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
80
    } else {
182
80
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
240
        for (size_t i = 1; i < num_rows; i++) {
185
160
            max_key = std::max(max_key, input_keys[i]);
186
160
            min_key = std::min(min_key, input_keys[i]);
187
160
        }
188
80
    }
189
190
80
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
80
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
80
    if (allow_direct_mapping) {
193
80
        for (const auto& variant_ptr : variant_ptrs) {
194
80
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
80
                    max_key, min_key);
196
80
        }
197
80
    }
198
80
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIjNS_13JoinHashTableIjNS_17HashCRC32Return32IjEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
323
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
323
    using FieldType = typename Method::Base::Key;
162
323
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
323
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
323
    size_t num_rows = key_columns[0]->size();
166
323
    if (key_columns[0]->is_nullable()) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
323
    } else {
182
323
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
992
        for (size_t i = 1; i < num_rows; i++) {
185
669
            max_key = std::max(max_key, input_keys[i]);
186
669
            min_key = std::min(min_key, input_keys[i]);
187
669
        }
188
323
    }
189
190
323
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
323
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
323
    if (allow_direct_mapping) {
193
324
        for (const auto& variant_ptr : variant_ptrs) {
194
324
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
324
                    max_key, min_key);
196
324
        }
197
323
    }
198
323
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberImNS_13JoinHashTableImNS_17HashCRC32Return32ImEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
800
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
800
    using FieldType = typename Method::Base::Key;
162
800
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
800
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
800
    size_t num_rows = key_columns[0]->size();
166
800
    if (key_columns[0]->is_nullable()) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
800
    } else {
182
800
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
2.40k
        for (size_t i = 1; i < num_rows; i++) {
185
1.60k
            max_key = std::max(max_key, input_keys[i]);
186
1.60k
            min_key = std::min(min_key, input_keys[i]);
187
1.60k
        }
188
800
    }
189
190
800
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
800
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
800
    if (allow_direct_mapping) {
193
800
        for (const auto& variant_ptr : variant_ptrs) {
194
800
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
800
                    max_key, min_key);
196
800
        }
197
800
    }
198
800
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIN4wide7integerILm128EjEENS_13JoinHashTableIS4_NS_17HashCRC32Return32IS4_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
160
240
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
240
    using FieldType = typename Method::Base::Key;
162
240
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
240
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
240
    size_t num_rows = key_columns[0]->size();
166
240
    if (key_columns[0]->is_nullable()) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
240
    } else {
182
240
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
720
        for (size_t i = 1; i < num_rows; i++) {
185
480
            max_key = std::max(max_key, input_keys[i]);
186
480
            min_key = std::min(min_key, input_keys[i]);
187
480
        }
188
240
    }
189
190
240
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
240
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
240
    if (allow_direct_mapping) {
193
240
        for (const auto& variant_ptr : variant_ptrs) {
194
240
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
240
                    max_key, min_key);
196
240
        }
197
240
    }
198
240
}
199
200
template <typename Method>
201
void try_convert_to_direct_mapping(
202
        Method* method, const ColumnRawPtrs& key_columns,
203
46.4k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingISt9monostateEEvPT_RKSt6vectorIPKNS_7IColumnESaIS7_EERKS4_ISt10shared_ptrINS_16JoinDataVariantsEESaISE_EE
_ZN5doris29try_convert_to_direct_mappingINS_16MethodSerializedINS_13JoinHashTableINS_9StringRefENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
14.1k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_15MethodOneNumberIN4wide7integerILm256EjEENS_13JoinHashTableIS4_NS_17HashCRC32Return32IS4_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIhNS_13JoinHashTableIhNS_17HashCRC32Return32IhEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectItNS_13JoinHashTableItNS_17HashCRC32Return32ItEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIjNS_13JoinHashTableIjNS_17HashCRC32Return32IjEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectImNS_13JoinHashTableImNS_17HashCRC32Return32ImEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIN4wide7integerILm128EjEENS_13JoinHashTableIS4_NS_17HashCRC32Return32IS4_EELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableImNS_17HashCRC32Return32ImEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
203
3.92k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_6UInt72ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
3.20k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_6UInt96ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
8.00k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_7UInt104ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableIN4wide7integerILm128EjEENS_17HashCRC32Return32IS5_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
203
8.00k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_7UInt136ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
960
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableIN4wide7integerILm256EjEENS_17HashCRC32Return32IS5_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
203
7.92k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_19MethodStringNoCacheINS_13JoinHashTableINS_9StringRefENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
324
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
204
205
inline void try_convert_to_direct_mapping(
206
        PrimaryTypeHashTableContext<UInt8>* context, const ColumnRawPtrs& key_columns,
207
160
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
208
160
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
209
160
}
210
211
inline void try_convert_to_direct_mapping(
212
        PrimaryTypeHashTableContext<UInt16>* context, const ColumnRawPtrs& key_columns,
213
80
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
214
80
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
215
80
}
216
217
inline void try_convert_to_direct_mapping(
218
        PrimaryTypeHashTableContext<UInt32>* context, const ColumnRawPtrs& key_columns,
219
323
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
220
323
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
221
323
}
222
223
inline void try_convert_to_direct_mapping(
224
        PrimaryTypeHashTableContext<UInt64>* context, const ColumnRawPtrs& key_columns,
225
800
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
226
800
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
227
800
}
228
229
inline void try_convert_to_direct_mapping(
230
        PrimaryTypeHashTableContext<UInt128>* context, const ColumnRawPtrs& key_columns,
231
240
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
232
240
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
233
240
}
234
235
// ASOF JOIN index with inline values for cache-friendly branchless binary search.
236
// IntType is the integer representation of the ASOF column value:
237
//   uint32_t for DateV2, uint64_t for DateTimeV2 and TimestampTZ.
238
// Rows are sorted by asof_value during build, then materialized into SoA arrays
239
// so probe-side binary search only touches the ASOF values hot path.
240
template <typename IntType>
241
struct AsofIndexGroup {
242
    using int_type = IntType;
243
244
    struct Entry {
245
        IntType asof_value;
246
        uint32_t row_index; // 1-based, 0 = invalid/padding
247
    };
248
249
    std::vector<Entry> entries;
250
    std::vector<IntType> asof_values;
251
    std::vector<uint32_t> row_indexes;
252
253
1.06k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
_ZN5doris14AsofIndexGroupIjE7add_rowEjj
Line
Count
Source
253
1.05k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
_ZN5doris14AsofIndexGroupImE7add_rowEmj
Line
Count
Source
253
12
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
254
255
23
    void sort_and_finalize() {
256
23
        if (entries.empty()) {
257
4
            return;
258
4
        }
259
19
        if (entries.size() > 1) {
260
15
            pdqsort(entries.begin(), entries.end(),
261
2.06k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
_ZZN5doris14AsofIndexGroupIjE17sort_and_finalizeEvENKUlRKNS1_5EntryES4_E_clES4_S4_
Line
Count
Source
261
2.05k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
_ZZN5doris14AsofIndexGroupImE17sort_and_finalizeEvENKUlRKNS1_5EntryES4_E_clES4_S4_
Line
Count
Source
261
9
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
262
15
        }
263
264
19
        asof_values.resize(entries.size());
265
19
        row_indexes.resize(entries.size());
266
1.08k
        for (size_t i = 0; i < entries.size(); ++i) {
267
1.06k
            asof_values[i] = entries[i].asof_value;
268
1.06k
            row_indexes[i] = entries[i].row_index;
269
1.06k
        }
270
271
19
        std::vector<Entry>().swap(entries);
272
19
    }
_ZN5doris14AsofIndexGroupIjE17sort_and_finalizeEv
Line
Count
Source
255
19
    void sort_and_finalize() {
256
19
        if (entries.empty()) {
257
4
            return;
258
4
        }
259
15
        if (entries.size() > 1) {
260
12
            pdqsort(entries.begin(), entries.end(),
261
12
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
262
12
        }
263
264
15
        asof_values.resize(entries.size());
265
15
        row_indexes.resize(entries.size());
266
1.06k
        for (size_t i = 0; i < entries.size(); ++i) {
267
1.05k
            asof_values[i] = entries[i].asof_value;
268
1.05k
            row_indexes[i] = entries[i].row_index;
269
1.05k
        }
270
271
15
        std::vector<Entry>().swap(entries);
272
15
    }
_ZN5doris14AsofIndexGroupImE17sort_and_finalizeEv
Line
Count
Source
255
4
    void sort_and_finalize() {
256
4
        if (entries.empty()) {
257
0
            return;
258
0
        }
259
4
        if (entries.size() > 1) {
260
3
            pdqsort(entries.begin(), entries.end(),
261
3
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
262
3
        }
263
264
4
        asof_values.resize(entries.size());
265
4
        row_indexes.resize(entries.size());
266
16
        for (size_t i = 0; i < entries.size(); ++i) {
267
12
            asof_values[i] = entries[i].asof_value;
268
12
            row_indexes[i] = entries[i].row_index;
269
12
        }
270
271
4
        std::vector<Entry>().swap(entries);
272
4
    }
273
274
1
    const IntType* values_data() const { return asof_values.data(); }
_ZNK5doris14AsofIndexGroupIjE11values_dataEv
Line
Count
Source
274
1
    const IntType* values_data() const { return asof_values.data(); }
Unexecuted instantiation: _ZNK5doris14AsofIndexGroupImE11values_dataEv
275
276
    // Branchless lower_bound: first i where asof_values[i] >= target
277
39
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
278
39
        size_t lo = 0, n = asof_values.size();
279
181
        while (n > 1) {
280
142
            size_t half = n / 2;
281
142
            lo += half * (asof_values[lo + half] < target);
282
142
            n -= half;
283
142
        }
284
39
        if (lo < asof_values.size()) {
285
38
            lo += (asof_values[lo] < target);
286
38
        }
287
39
        return lo;
288
39
    }
_ZNK5doris14AsofIndexGroupIjE11lower_boundEj
Line
Count
Source
277
33
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
278
33
        size_t lo = 0, n = asof_values.size();
279
163
        while (n > 1) {
280
130
            size_t half = n / 2;
281
130
            lo += half * (asof_values[lo + half] < target);
282
130
            n -= half;
283
130
        }
284
33
        if (lo < asof_values.size()) {
285
32
            lo += (asof_values[lo] < target);
286
32
        }
287
33
        return lo;
288
33
    }
_ZNK5doris14AsofIndexGroupImE11lower_boundEm
Line
Count
Source
277
6
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
278
6
        size_t lo = 0, n = asof_values.size();
279
18
        while (n > 1) {
280
12
            size_t half = n / 2;
281
12
            lo += half * (asof_values[lo + half] < target);
282
12
            n -= half;
283
12
        }
284
6
        if (lo < asof_values.size()) {
285
6
            lo += (asof_values[lo] < target);
286
6
        }
287
6
        return lo;
288
6
    }
289
290
    // Branchless upper_bound: first i where asof_values[i] > target
291
44
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
292
44
        size_t lo = 0, n = asof_values.size();
293
226
        while (n > 1) {
294
182
            size_t half = n / 2;
295
182
            lo += half * (asof_values[lo + half] <= target);
296
182
            n -= half;
297
182
        }
298
44
        if (lo < asof_values.size()) {
299
43
            lo += (asof_values[lo] <= target);
300
43
        }
301
44
        return lo;
302
44
    }
_ZNK5doris14AsofIndexGroupIjE11upper_boundEj
Line
Count
Source
291
38
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
292
38
        size_t lo = 0, n = asof_values.size();
293
208
        while (n > 1) {
294
170
            size_t half = n / 2;
295
170
            lo += half * (asof_values[lo + half] <= target);
296
170
            n -= half;
297
170
        }
298
38
        if (lo < asof_values.size()) {
299
37
            lo += (asof_values[lo] <= target);
300
37
        }
301
38
        return lo;
302
38
    }
_ZNK5doris14AsofIndexGroupImE11upper_boundEm
Line
Count
Source
291
6
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
292
6
        size_t lo = 0, n = asof_values.size();
293
18
        while (n > 1) {
294
12
            size_t half = n / 2;
295
12
            lo += half * (asof_values[lo + half] <= target);
296
12
            n -= half;
297
12
        }
298
6
        if (lo < asof_values.size()) {
299
6
            lo += (asof_values[lo] <= target);
300
6
        }
301
6
        return lo;
302
6
    }
303
304
    // Semantics by (is_greater, is_strict):
305
    //   (true,  false): probe >= build  ->  find largest  build value <= probe
306
    //   (true,  true):  probe >  build  ->  find largest  build value <  probe
307
    //   (false, false): probe <= build  ->  find smallest build value >= probe
308
    //   (false, true):  probe <  build  ->  find smallest build value >  probe
309
    // Returns the build row index of the best match, or 0 if no match.
310
    template <bool IsGreater, bool IsStrict>
311
69
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
69
        if (asof_values.empty()) {
313
4
            return 0;
314
4
        }
315
65
        if constexpr (IsGreater) {
316
34
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
34
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
34
        } else {
319
31
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
31
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
31
        }
322
65
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb1ELb0EEEjj
Line
Count
Source
311
19
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
19
        if (asof_values.empty()) {
313
1
            return 0;
314
1
        }
315
18
        if constexpr (IsGreater) {
316
18
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
18
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
18
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb1ELb1EEEjj
Line
Count
Source
311
15
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
15
        if (asof_values.empty()) {
313
1
            return 0;
314
1
        }
315
14
        if constexpr (IsGreater) {
316
14
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
14
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
14
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb0ELb0EEEjj
Line
Count
Source
311
15
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
15
        if (asof_values.empty()) {
313
1
            return 0;
314
1
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
14
        } else {
319
14
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
14
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
14
        }
322
14
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb0ELb1EEEjj
Line
Count
Source
311
16
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
16
        if (asof_values.empty()) {
313
1
            return 0;
314
1
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
15
        } else {
319
15
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
15
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
15
        }
322
15
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb1ELb0EEEjm
Line
Count
Source
311
1
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
1
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
1
        if constexpr (IsGreater) {
316
1
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
1
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
1
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb1ELb1EEEjm
Line
Count
Source
311
1
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
1
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
1
        if constexpr (IsGreater) {
316
1
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
1
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
1
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb0ELb0EEEjm
Line
Count
Source
311
1
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
1
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
1
        } else {
319
1
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
1
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
1
        }
322
1
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb0ELb1EEEjm
Line
Count
Source
311
1
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
1
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
1
        } else {
319
1
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
1
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
1
        }
322
1
    }
323
};
324
325
// Type-erased container for all ASOF index groups.
326
// DateV2 -> uint32_t, DateTimeV2/TimestampTZ -> uint64_t.
327
using AsofIndexVariant = std::variant<std::monostate, std::vector<AsofIndexGroup<uint32_t>>,
328
                                      std::vector<AsofIndexGroup<uint64_t>>>;
329
330
} // namespace doris