// Licensed to the Apache Software Foundation (ASF) under one // or more contributor license agreements. See the NOTICE file // distributed with this work for additional information // regarding copyright ownership. The ASF licenses this file // to you under the Apache License, Version 2.0 (the // "License"); you may not use this file except in compliance // with the License. You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, // software distributed under the License is distributed on an // "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY // KIND, either express or implied. See the License for the // specific language governing permissions and limitations // under the License. // This file is copied from // https://github.com/ClickHouse/ClickHouse/blob/master/src/Columns/ColumnStruct.cpp // and modified by Doris #include "vec/columns/column_struct.h" #include #include "vec/common/assert_cast.h" #include "vec/common/typeid_cast.h" class SipHash; namespace doris { namespace vectorized { class Arena; } // namespace vectorized } // namespace doris namespace doris::vectorized { std::string ColumnStruct::get_name() const { std::stringstream res; res << "Struct("; bool is_first = true; for (const auto& column : columns) { if (!is_first) { res << ", "; } is_first = false; res << column->get_name(); } res << ")"; return res.str(); } ColumnStruct::ColumnStruct(MutableColumns&& mutable_columns) { columns.reserve(mutable_columns.size()); for (auto& column : mutable_columns) { if (is_column_const(*column)) { throw doris::Exception(ErrorCode::INTERNAL_ERROR, "ColumnStruct cannot have ColumnConst as its element"); __builtin_unreachable(); } columns.push_back(std::move(column)); } } ColumnStruct::Ptr ColumnStruct::create(const Columns& columns) { for (const auto& column : columns) { if (is_column_const(*column)) { throw doris::Exception(ErrorCode::INTERNAL_ERROR, "ColumnStruct cannot have ColumnConst as its element"); __builtin_unreachable(); } } auto column_struct = ColumnStruct::create(MutableColumns()); column_struct->columns.assign(columns.begin(), columns.end()); return column_struct; } ColumnStruct::Ptr ColumnStruct::create(const TupleColumns& tuple_columns) { for (const auto& column : tuple_columns) { if (is_column_const(*column)) { throw doris::Exception(ErrorCode::INTERNAL_ERROR, "ColumnStruct cannot have ColumnConst as its element"); __builtin_unreachable(); } } auto column_struct = ColumnStruct::create(MutableColumns()); column_struct->columns = tuple_columns; return column_struct; } MutableColumnPtr ColumnStruct::clone_empty() const { const size_t tuple_size = columns.size(); MutableColumns new_columns(tuple_size); for (size_t i = 0; i < tuple_size; ++i) { new_columns[i] = columns[i]->clone_empty(); } return ColumnStruct::create(std::move(new_columns)); } MutableColumnPtr ColumnStruct::clone_resized(size_t new_size) const { const size_t tuple_size = columns.size(); MutableColumns new_columns(tuple_size); for (size_t i = 0; i < tuple_size; ++i) { new_columns[i] = columns[i]->clone_resized(new_size); } return ColumnStruct::create(std::move(new_columns)); } Field ColumnStruct::operator[](size_t n) const { Field res; get(n, res); return res; } void ColumnStruct::get(size_t n, Field& res) const { const size_t tuple_size = columns.size(); res = Tuple(); Tuple& res_tuple = res.get(); res_tuple.reserve(tuple_size); for (size_t i = 0; i < tuple_size; ++i) { res_tuple.push_back((*columns[i])[n]); } } bool ColumnStruct::is_default_at(size_t n) const { const size_t tuple_size = columns.size(); for (size_t i = 0; i < tuple_size; ++i) { if (!columns[i]->is_default_at(n)) { return false; } } return true; } void ColumnStruct::insert(const Field& x) { const auto& tuple = x.get(); const size_t tuple_size = columns.size(); if (tuple.size() != tuple_size) { throw doris::Exception(ErrorCode::INTERNAL_ERROR, "Cannot insert value of different size into tuple. field tuple size " "{}, columns size {}", tuple.size(), tuple_size); } for (size_t i = 0; i < tuple_size; ++i) { columns[i]->insert(tuple[i]); } } void ColumnStruct::insert_from(const IColumn& src_, size_t n) { const ColumnStruct& src = assert_cast(src_); const size_t tuple_size = columns.size(); if (src.columns.size() != tuple_size) { throw doris::Exception(ErrorCode::INTERNAL_ERROR, "Cannot insert value of different size into tuple."); __builtin_unreachable(); } for (size_t i = 0; i < tuple_size; ++i) { columns[i]->insert_from(*src.columns[i], n); } } void ColumnStruct::insert_default() { for (auto& column : columns) { column->insert_default(); } } void ColumnStruct::pop_back(size_t n) { for (auto& column : columns) { column->pop_back(n); } } StringRef ColumnStruct::serialize_value_into_arena(size_t n, Arena& arena, char const*& begin) const { StringRef res(begin, 0); for (const auto& column : columns) { auto value_ref = column->serialize_value_into_arena(n, arena, begin); res.data = value_ref.data - res.size; res.size += value_ref.size; } return res; } const char* ColumnStruct::deserialize_and_insert_from_arena(const char* pos) { for (auto& column : columns) { pos = column->deserialize_and_insert_from_arena(pos); } return pos; } int ColumnStruct::compare_at(size_t n, size_t m, const IColumn& rhs_, int nan_direction_hint) const { const ColumnStruct& rhs = assert_cast(rhs_); const size_t lhs_tuple_size = columns.size(); const size_t rhs_tuple_size = rhs.tuple_size(); const size_t min_size = std::min(lhs_tuple_size, rhs_tuple_size); for (size_t i = 0; i < min_size; ++i) { if (int res = columns[i]->compare_at(n, m, *rhs.columns[i], nan_direction_hint); res) { return res; } } return lhs_tuple_size > rhs_tuple_size ? 1 : (lhs_tuple_size < rhs_tuple_size ? -1 : 0); } void ColumnStruct::update_hash_with_value(size_t n, SipHash& hash) const { for (const auto& column : columns) { column->update_hash_with_value(n, hash); } } void ColumnStruct::update_xxHash_with_value(size_t start, size_t end, uint64_t& hash, const uint8_t* __restrict null_data) const { for (const auto& column : columns) { column->update_xxHash_with_value(start, end, hash, nullptr); } } void ColumnStruct::update_crc_with_value(size_t start, size_t end, uint32_t& hash, const uint8_t* __restrict null_data) const { for (const auto& column : columns) { column->update_crc_with_value(start, end, hash, nullptr); } } void ColumnStruct::update_hashes_with_value(uint64_t* __restrict hashes, const uint8_t* __restrict null_data) const { for (const auto& column : columns) { column->update_hashes_with_value(hashes, null_data); } } void ColumnStruct::update_crcs_with_value(uint32_t* __restrict hash, PrimitiveType type, uint32_t rows, uint32_t offset, const uint8_t* __restrict null_data) const { for (const auto& column : columns) { column->update_crcs_with_value(hash, type, rows, offset, null_data); } } void ColumnStruct::insert_indices_from(const IColumn& src, const uint32_t* indices_begin, const uint32_t* indices_end) { const auto& src_concrete = assert_cast(src); for (size_t i = 0; i < columns.size(); ++i) { columns[i]->insert_indices_from(src_concrete.get_column(i), indices_begin, indices_end); } } void ColumnStruct::insert_range_from(const IColumn& src, size_t start, size_t length) { const size_t tuple_size = columns.size(); for (size_t i = 0; i < tuple_size; ++i) { columns[i]->insert_range_from(*assert_cast(src).columns[i], start, length); } } void ColumnStruct::insert_range_from_ignore_overflow(const IColumn& src, size_t start, size_t length) { const size_t tuple_size = columns.size(); for (size_t i = 0; i < tuple_size; ++i) { columns[i]->insert_range_from_ignore_overflow( *assert_cast(src).columns[i], start, length); } } ColumnPtr ColumnStruct::filter(const Filter& filt, ssize_t result_size_hint) const { const size_t tuple_size = columns.size(); Columns new_columns(tuple_size); for (size_t i = 0; i < tuple_size; ++i) { new_columns[i] = columns[i]->filter(filt, result_size_hint); } return ColumnStruct::create(new_columns); } size_t ColumnStruct::filter(const Filter& filter) { const size_t tuple_size = columns.size(); size_t result_size = 0; for (size_t i = 0; i < tuple_size; ++i) { const auto this_result_size = columns[i]->filter(filter); CHECK(result_size == 0 || result_size == this_result_size); result_size = this_result_size; } return result_size; } ColumnPtr ColumnStruct::permute(const Permutation& perm, size_t limit) const { const size_t tuple_size = columns.size(); Columns new_columns(tuple_size); for (size_t i = 0; i < tuple_size; ++i) { new_columns[i] = columns[i]->permute(perm, limit); } return ColumnStruct::create(new_columns); } ColumnPtr ColumnStruct::replicate(const Offsets& offsets) const { const size_t tuple_size = columns.size(); Columns new_columns(tuple_size); for (size_t i = 0; i < tuple_size; ++i) { new_columns[i] = columns[i]->replicate(offsets); } return ColumnStruct::create(new_columns); } bool ColumnStruct::could_shrinked_column() { const size_t tuple_size = columns.size(); for (size_t i = 0; i < tuple_size; ++i) { if (columns[i]->could_shrinked_column()) { return true; } } return false; } MutableColumnPtr ColumnStruct::get_shrinked_column() { const size_t tuple_size = columns.size(); MutableColumns new_columns(tuple_size); for (size_t i = 0; i < tuple_size; ++i) { if (columns[i]->could_shrinked_column()) { new_columns[i] = columns[i]->get_shrinked_column(); } else { new_columns[i] = columns[i]->get_ptr(); } } return ColumnStruct::create(std::move(new_columns)); } void ColumnStruct::reserve(size_t n) { const size_t tuple_size = columns.size(); for (size_t i = 0; i < tuple_size; ++i) { get_column(i).reserve(n); } } //please check you real need size in data column, When it mixes various data types, eg: string column with int column void ColumnStruct::resize(size_t n) { const size_t tuple_size = columns.size(); for (size_t i = 0; i < tuple_size; ++i) { get_column(i).resize(n); } } size_t ColumnStruct::byte_size() const { size_t res = 0; for (const auto& column : columns) { res += column->byte_size(); } return res; } size_t ColumnStruct::allocated_bytes() const { size_t res = 0; for (const auto& column : columns) { res += column->allocated_bytes(); } return res; } void ColumnStruct::for_each_subcolumn(ColumnCallback callback) { for (auto& column : columns) { callback(column); } } bool ColumnStruct::structure_equals(const IColumn& rhs) const { if (const auto* rhs_tuple = typeid_cast(&rhs)) { const size_t tuple_size = columns.size(); if (tuple_size != rhs_tuple->columns.size()) { return false; } for (size_t i = 0; i < tuple_size; ++i) { if (!columns[i]->structure_equals(*rhs_tuple->columns[i])) { return false; } } return true; } else { return false; } } } // namespace doris::vectorized