2018-09-09 20:57:54 +00:00
|
|
|
#include <Functions/IFunction.h>
|
|
|
|
#include <Functions/FunctionFactory.h>
|
|
|
|
#include <Functions/FunctionHelpers.h>
|
|
|
|
#include <DataTypes/DataTypeArray.h>
|
2018-09-09 21:15:40 +00:00
|
|
|
#include <DataTypes/DataTypeNullable.h>
|
|
|
|
#include <DataTypes/DataTypeTuple.h>
|
2018-09-09 20:57:54 +00:00
|
|
|
#include <Core/ColumnNumbers.h>
|
|
|
|
#include <Columns/ColumnArray.h>
|
|
|
|
#include <Columns/ColumnNullable.h>
|
|
|
|
#include <Columns/ColumnsNumber.h>
|
|
|
|
#include <Columns/ColumnString.h>
|
|
|
|
#include <Columns/ColumnTuple.h>
|
|
|
|
#include <Common/typeid_cast.h>
|
|
|
|
|
|
|
|
|
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
|
|
|
namespace ErrorCodes
|
|
|
|
{
|
|
|
|
extern const int LOGICAL_ERROR;
|
|
|
|
extern const int ILLEGAL_COLUMN;
|
|
|
|
extern const int ILLEGAL_TYPE_OF_ARGUMENT;
|
|
|
|
extern const int ZERO_ARRAY_OR_TUPLE_INDEX;
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace ArrayImpl
|
|
|
|
{
|
|
|
|
class NullMapBuilder;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** arrayElement(arr, i) - get the array element by index. If index is not constant and out of range - return default value of data type.
|
|
|
|
* The index begins with 1. Also, the index can be negative - then it is counted from the end of the array.
|
|
|
|
*/
|
|
|
|
class FunctionArrayElement : public IFunction
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
static constexpr auto name = "arrayElement";
|
|
|
|
static FunctionPtr create(const Context & context);
|
|
|
|
|
|
|
|
String getName() const override;
|
|
|
|
|
|
|
|
bool useDefaultImplementationForConstants() const override { return true; }
|
|
|
|
size_t getNumberOfArguments() const override { return 2; }
|
|
|
|
|
|
|
|
DataTypePtr getReturnTypeImpl(const DataTypes & arguments) const override;
|
|
|
|
|
|
|
|
void executeImpl(Block & block, const ColumnNumbers & arguments, size_t result, size_t input_rows_count) override;
|
|
|
|
|
|
|
|
private:
|
|
|
|
void perform(Block & block, const ColumnNumbers & arguments, size_t result,
|
|
|
|
ArrayImpl::NullMapBuilder & builder, size_t input_rows_count);
|
|
|
|
|
|
|
|
template <typename DataType>
|
|
|
|
bool executeNumberConst(Block & block, const ColumnNumbers & arguments, size_t result, const Field & index,
|
|
|
|
ArrayImpl::NullMapBuilder & builder);
|
|
|
|
|
|
|
|
template <typename IndexType, typename DataType>
|
|
|
|
bool executeNumber(Block & block, const ColumnNumbers & arguments, size_t result, const PaddedPODArray<IndexType> & indices,
|
|
|
|
ArrayImpl::NullMapBuilder & builder);
|
|
|
|
|
|
|
|
bool executeStringConst(Block & block, const ColumnNumbers & arguments, size_t result, const Field & index,
|
|
|
|
ArrayImpl::NullMapBuilder & builder);
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool executeString(Block & block, const ColumnNumbers & arguments, size_t result, const PaddedPODArray<IndexType> & indices,
|
|
|
|
ArrayImpl::NullMapBuilder & builder);
|
|
|
|
|
|
|
|
bool executeGenericConst(Block & block, const ColumnNumbers & arguments, size_t result, const Field & index,
|
|
|
|
ArrayImpl::NullMapBuilder & builder);
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool executeGeneric(Block & block, const ColumnNumbers & arguments, size_t result, const PaddedPODArray<IndexType> & indices,
|
|
|
|
ArrayImpl::NullMapBuilder & builder);
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool executeConst(Block & block, const ColumnNumbers & arguments, size_t result,
|
|
|
|
const PaddedPODArray <IndexType> & indices, ArrayImpl::NullMapBuilder & builder,
|
|
|
|
size_t input_rows_count);
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool executeArgument(Block & block, const ColumnNumbers & arguments, size_t result,
|
|
|
|
ArrayImpl::NullMapBuilder & builder, size_t input_rows_count);
|
|
|
|
|
|
|
|
/** For a tuple array, the function is evaluated component-wise for each element of the tuple.
|
|
|
|
*/
|
|
|
|
bool executeTuple(Block & block, const ColumnNumbers & arguments, size_t result, size_t input_rows_count);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
namespace ArrayImpl
|
|
|
|
{
|
|
|
|
|
|
|
|
class NullMapBuilder
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
operator bool() const { return src_null_map; }
|
|
|
|
bool operator!() const { return !src_null_map; }
|
|
|
|
|
|
|
|
void initSource(const UInt8 * src_null_map_)
|
|
|
|
{
|
|
|
|
src_null_map = src_null_map_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void initSink(size_t size)
|
|
|
|
{
|
|
|
|
auto sink = ColumnUInt8::create(size);
|
|
|
|
sink_null_map = sink->getData().data();
|
|
|
|
sink_null_map_holder = std::move(sink);
|
|
|
|
}
|
|
|
|
|
|
|
|
void update(size_t from)
|
|
|
|
{
|
|
|
|
sink_null_map[index] = bool(src_null_map && src_null_map[from]);
|
|
|
|
++index;
|
|
|
|
}
|
|
|
|
|
|
|
|
void update()
|
|
|
|
{
|
|
|
|
sink_null_map[index] = bool(src_null_map);
|
|
|
|
++index;
|
|
|
|
}
|
|
|
|
|
|
|
|
ColumnPtr getNullMapColumnPtr() && { return std::move(sink_null_map_holder); }
|
|
|
|
|
|
|
|
private:
|
|
|
|
const UInt8 * src_null_map = nullptr;
|
|
|
|
UInt8 * sink_null_map = nullptr;
|
|
|
|
MutableColumnPtr sink_null_map_holder;
|
|
|
|
size_t index = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace
|
|
|
|
{
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
struct ArrayElementNumImpl
|
|
|
|
{
|
|
|
|
/** Implementation for constant index.
|
|
|
|
* If negative = false - index is from beginning of array, started from 0.
|
|
|
|
* If negative = true - index is from end of array, started from 0.
|
|
|
|
*/
|
|
|
|
template <bool negative>
|
|
|
|
static void vectorConst(
|
|
|
|
const PaddedPODArray<T> & data, const ColumnArray::Offsets & offsets,
|
|
|
|
const ColumnArray::Offset index,
|
|
|
|
PaddedPODArray<T> & result, ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
size_t size = offsets.size();
|
|
|
|
result.resize(size);
|
|
|
|
|
|
|
|
ColumnArray::Offset current_offset = 0;
|
|
|
|
for (size_t i = 0; i < size; ++i)
|
|
|
|
{
|
|
|
|
size_t array_size = offsets[i] - current_offset;
|
|
|
|
|
|
|
|
if (index < array_size)
|
|
|
|
{
|
|
|
|
size_t j = !negative ? (current_offset + index) : (offsets[i] - index - 1);
|
|
|
|
result[i] = data[j];
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
result[i] = T();
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.update();
|
|
|
|
}
|
|
|
|
|
|
|
|
current_offset = offsets[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Implementation for non-constant index.
|
|
|
|
*/
|
|
|
|
template <typename TIndex>
|
|
|
|
static void vector(
|
|
|
|
const PaddedPODArray<T> & data, const ColumnArray::Offsets & offsets,
|
|
|
|
const PaddedPODArray<TIndex> & indices,
|
|
|
|
PaddedPODArray<T> & result, ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
size_t size = offsets.size();
|
|
|
|
result.resize(size);
|
|
|
|
|
|
|
|
ColumnArray::Offset current_offset = 0;
|
|
|
|
for (size_t i = 0; i < size; ++i)
|
|
|
|
{
|
|
|
|
size_t array_size = offsets[i] - current_offset;
|
|
|
|
|
|
|
|
TIndex index = indices[i];
|
|
|
|
if (index > 0 && static_cast<size_t>(index) <= array_size)
|
|
|
|
{
|
|
|
|
size_t j = current_offset + index - 1;
|
|
|
|
result[i] = data[j];
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else if (index < 0 && static_cast<size_t>(-index) <= array_size)
|
|
|
|
{
|
|
|
|
size_t j = offsets[i] + index;
|
|
|
|
result[i] = data[j];
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
result[i] = T();
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.update();
|
|
|
|
}
|
|
|
|
|
|
|
|
current_offset = offsets[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ArrayElementStringImpl
|
|
|
|
{
|
|
|
|
template <bool negative>
|
|
|
|
static void vectorConst(
|
2018-11-25 00:08:50 +00:00
|
|
|
const ColumnString::Chars & data, const ColumnArray::Offsets & offsets, const ColumnString::Offsets & string_offsets,
|
2018-09-09 20:57:54 +00:00
|
|
|
const ColumnArray::Offset index,
|
2018-11-25 00:08:50 +00:00
|
|
|
ColumnString::Chars & result_data, ColumnArray::Offsets & result_offsets,
|
2018-09-09 20:57:54 +00:00
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
size_t size = offsets.size();
|
|
|
|
result_offsets.resize(size);
|
|
|
|
result_data.reserve(data.size());
|
|
|
|
|
|
|
|
ColumnArray::Offset current_offset = 0;
|
|
|
|
ColumnArray::Offset current_result_offset = 0;
|
|
|
|
for (size_t i = 0; i < size; ++i)
|
|
|
|
{
|
|
|
|
size_t array_size = offsets[i] - current_offset;
|
|
|
|
|
|
|
|
if (index < array_size)
|
|
|
|
{
|
|
|
|
size_t adjusted_index = !negative ? index : (array_size - index - 1);
|
|
|
|
|
|
|
|
size_t j = current_offset + adjusted_index;
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
|
|
|
|
ColumnArray::Offset string_pos = current_offset == 0 && adjusted_index == 0
|
|
|
|
? 0
|
|
|
|
: string_offsets[current_offset + adjusted_index - 1];
|
|
|
|
|
|
|
|
ColumnArray::Offset string_size = string_offsets[current_offset + adjusted_index] - string_pos;
|
|
|
|
|
|
|
|
result_data.resize(current_result_offset + string_size);
|
|
|
|
memcpySmallAllowReadWriteOverflow15(&result_data[current_result_offset], &data[string_pos], string_size);
|
|
|
|
current_result_offset += string_size;
|
|
|
|
result_offsets[i] = current_result_offset;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/// Insert an empty row.
|
|
|
|
result_data.resize(current_result_offset + 1);
|
|
|
|
result_data[current_result_offset] = 0;
|
|
|
|
current_result_offset += 1;
|
|
|
|
result_offsets[i] = current_result_offset;
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.update();
|
|
|
|
}
|
|
|
|
|
|
|
|
current_offset = offsets[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Implementation for non-constant index.
|
|
|
|
*/
|
|
|
|
template <typename TIndex>
|
|
|
|
static void vector(
|
2018-11-25 00:08:50 +00:00
|
|
|
const ColumnString::Chars & data, const ColumnArray::Offsets & offsets, const ColumnString::Offsets & string_offsets,
|
2018-09-09 20:57:54 +00:00
|
|
|
const PaddedPODArray<TIndex> & indices,
|
2018-11-25 00:08:50 +00:00
|
|
|
ColumnString::Chars & result_data, ColumnArray::Offsets & result_offsets,
|
2018-09-09 20:57:54 +00:00
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
size_t size = offsets.size();
|
|
|
|
result_offsets.resize(size);
|
|
|
|
result_data.reserve(data.size());
|
|
|
|
|
|
|
|
ColumnArray::Offset current_offset = 0;
|
|
|
|
ColumnArray::Offset current_result_offset = 0;
|
|
|
|
for (size_t i = 0; i < size; ++i)
|
|
|
|
{
|
|
|
|
size_t array_size = offsets[i] - current_offset;
|
|
|
|
size_t adjusted_index; /// index in array from zero
|
|
|
|
|
|
|
|
TIndex index = indices[i];
|
|
|
|
if (index > 0 && static_cast<size_t>(index) <= array_size)
|
|
|
|
adjusted_index = index - 1;
|
|
|
|
else if (index < 0 && static_cast<size_t>(-index) <= array_size)
|
|
|
|
adjusted_index = array_size + index;
|
|
|
|
else
|
|
|
|
adjusted_index = array_size; /// means no element should be taken
|
|
|
|
|
|
|
|
if (adjusted_index < array_size)
|
|
|
|
{
|
|
|
|
size_t j = current_offset + adjusted_index;
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
|
|
|
|
ColumnArray::Offset string_pos = current_offset == 0 && adjusted_index == 0
|
|
|
|
? 0
|
|
|
|
: string_offsets[current_offset + adjusted_index - 1];
|
|
|
|
|
|
|
|
ColumnArray::Offset string_size = string_offsets[current_offset + adjusted_index] - string_pos;
|
|
|
|
|
|
|
|
result_data.resize(current_result_offset + string_size);
|
|
|
|
memcpySmallAllowReadWriteOverflow15(&result_data[current_result_offset], &data[string_pos], string_size);
|
|
|
|
current_result_offset += string_size;
|
|
|
|
result_offsets[i] = current_result_offset;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/// Insert empty string
|
|
|
|
result_data.resize(current_result_offset + 1);
|
|
|
|
result_data[current_result_offset] = 0;
|
|
|
|
current_result_offset += 1;
|
|
|
|
result_offsets[i] = current_result_offset;
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.update();
|
|
|
|
}
|
|
|
|
|
|
|
|
current_offset = offsets[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
/// Generic implementation for other nested types.
|
|
|
|
struct ArrayElementGenericImpl
|
|
|
|
{
|
|
|
|
template <bool negative>
|
|
|
|
static void vectorConst(
|
|
|
|
const IColumn & data, const ColumnArray::Offsets & offsets,
|
|
|
|
const ColumnArray::Offset index,
|
|
|
|
IColumn & result, ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
size_t size = offsets.size();
|
|
|
|
result.reserve(size);
|
|
|
|
|
|
|
|
ColumnArray::Offset current_offset = 0;
|
|
|
|
for (size_t i = 0; i < size; ++i)
|
|
|
|
{
|
|
|
|
size_t array_size = offsets[i] - current_offset;
|
|
|
|
|
|
|
|
if (index < array_size)
|
|
|
|
{
|
|
|
|
size_t j = !negative ? current_offset + index : offsets[i] - index - 1;
|
|
|
|
result.insertFrom(data, j);
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
result.insertDefault();
|
|
|
|
if (builder)
|
|
|
|
builder.update();
|
|
|
|
}
|
|
|
|
|
|
|
|
current_offset = offsets[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Implementation for non-constant index.
|
|
|
|
*/
|
|
|
|
template <typename TIndex>
|
|
|
|
static void vector(
|
|
|
|
const IColumn & data, const ColumnArray::Offsets & offsets,
|
|
|
|
const PaddedPODArray<TIndex> & indices,
|
|
|
|
IColumn & result, ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
size_t size = offsets.size();
|
|
|
|
result.reserve(size);
|
|
|
|
|
|
|
|
ColumnArray::Offset current_offset = 0;
|
|
|
|
for (size_t i = 0; i < size; ++i)
|
|
|
|
{
|
|
|
|
size_t array_size = offsets[i] - current_offset;
|
|
|
|
|
|
|
|
TIndex index = indices[i];
|
|
|
|
if (index > 0 && static_cast<size_t>(index) <= array_size)
|
|
|
|
{
|
|
|
|
size_t j = current_offset + index - 1;
|
|
|
|
result.insertFrom(data, j);
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else if (index < 0 && static_cast<size_t>(-index) <= array_size)
|
|
|
|
{
|
|
|
|
size_t j = offsets[i] + index;
|
|
|
|
result.insertFrom(data, j);
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
result.insertDefault();
|
|
|
|
if (builder)
|
|
|
|
builder.update();
|
|
|
|
}
|
|
|
|
|
|
|
|
current_offset = offsets[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
FunctionPtr FunctionArrayElement::create(const Context &)
|
|
|
|
{
|
|
|
|
return std::make_shared<FunctionArrayElement>();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <typename DataType>
|
|
|
|
bool FunctionArrayElement::executeNumberConst(Block & block, const ColumnNumbers & arguments, size_t result, const Field & index,
|
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = checkAndGetColumn<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const ColumnVector<DataType> * col_nested = checkAndGetColumn<ColumnVector<DataType>>(&col_array->getData());
|
|
|
|
|
|
|
|
if (!col_nested)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
auto col_res = ColumnVector<DataType>::create();
|
|
|
|
|
|
|
|
if (index.getType() == Field::Types::UInt64)
|
|
|
|
ArrayElementNumImpl<DataType>::template vectorConst<false>(
|
|
|
|
col_nested->getData(), col_array->getOffsets(), safeGet<UInt64>(index) - 1, col_res->getData(), builder);
|
|
|
|
else if (index.getType() == Field::Types::Int64)
|
|
|
|
ArrayElementNumImpl<DataType>::template vectorConst<true>(
|
|
|
|
col_nested->getData(), col_array->getOffsets(), -safeGet<Int64>(index) - 1, col_res->getData(), builder);
|
|
|
|
else
|
|
|
|
throw Exception("Illegal type of array index", ErrorCodes::LOGICAL_ERROR);
|
|
|
|
|
|
|
|
block.getByPosition(result).column = std::move(col_res);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename IndexType, typename DataType>
|
|
|
|
bool FunctionArrayElement::executeNumber(Block & block, const ColumnNumbers & arguments, size_t result, const PaddedPODArray<IndexType> & indices,
|
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = checkAndGetColumn<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const ColumnVector<DataType> * col_nested = checkAndGetColumn<ColumnVector<DataType>>(&col_array->getData());
|
|
|
|
|
|
|
|
if (!col_nested)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
auto col_res = ColumnVector<DataType>::create();
|
|
|
|
|
|
|
|
ArrayElementNumImpl<DataType>::template vector<IndexType>(
|
|
|
|
col_nested->getData(), col_array->getOffsets(), indices, col_res->getData(), builder);
|
|
|
|
|
|
|
|
block.getByPosition(result).column = std::move(col_res);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool FunctionArrayElement::executeStringConst(Block & block, const ColumnNumbers & arguments, size_t result, const Field & index,
|
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = checkAndGetColumn<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const ColumnString * col_nested = checkAndGetColumn<ColumnString>(&col_array->getData());
|
|
|
|
|
|
|
|
if (!col_nested)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
auto col_res = ColumnString::create();
|
|
|
|
|
|
|
|
if (index.getType() == Field::Types::UInt64)
|
|
|
|
ArrayElementStringImpl::vectorConst<false>(
|
|
|
|
col_nested->getChars(),
|
|
|
|
col_array->getOffsets(),
|
|
|
|
col_nested->getOffsets(),
|
|
|
|
safeGet<UInt64>(index) - 1,
|
|
|
|
col_res->getChars(),
|
|
|
|
col_res->getOffsets(),
|
|
|
|
builder);
|
|
|
|
else if (index.getType() == Field::Types::Int64)
|
|
|
|
ArrayElementStringImpl::vectorConst<true>(
|
|
|
|
col_nested->getChars(),
|
|
|
|
col_array->getOffsets(),
|
|
|
|
col_nested->getOffsets(),
|
|
|
|
-safeGet<Int64>(index) - 1,
|
|
|
|
col_res->getChars(),
|
|
|
|
col_res->getOffsets(),
|
|
|
|
builder);
|
|
|
|
else
|
|
|
|
throw Exception("Illegal type of array index", ErrorCodes::LOGICAL_ERROR);
|
|
|
|
|
|
|
|
block.getByPosition(result).column = std::move(col_res);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool FunctionArrayElement::executeString(Block & block, const ColumnNumbers & arguments, size_t result, const PaddedPODArray<IndexType> & indices,
|
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = checkAndGetColumn<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const ColumnString * col_nested = checkAndGetColumn<ColumnString>(&col_array->getData());
|
|
|
|
|
|
|
|
if (!col_nested)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
auto col_res = ColumnString::create();
|
|
|
|
|
|
|
|
ArrayElementStringImpl::vector<IndexType>(
|
|
|
|
col_nested->getChars(),
|
|
|
|
col_array->getOffsets(),
|
|
|
|
col_nested->getOffsets(),
|
|
|
|
indices,
|
|
|
|
col_res->getChars(),
|
|
|
|
col_res->getOffsets(),
|
|
|
|
builder);
|
|
|
|
|
|
|
|
block.getByPosition(result).column = std::move(col_res);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool FunctionArrayElement::executeGenericConst(Block & block, const ColumnNumbers & arguments, size_t result, const Field & index,
|
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = checkAndGetColumn<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const auto & col_nested = col_array->getData();
|
|
|
|
auto col_res = col_nested.cloneEmpty();
|
|
|
|
|
|
|
|
if (index.getType() == Field::Types::UInt64)
|
|
|
|
ArrayElementGenericImpl::vectorConst<false>(
|
|
|
|
col_nested, col_array->getOffsets(), safeGet<UInt64>(index) - 1, *col_res, builder);
|
|
|
|
else if (index.getType() == Field::Types::Int64)
|
|
|
|
ArrayElementGenericImpl::vectorConst<true>(
|
|
|
|
col_nested, col_array->getOffsets(), -safeGet<Int64>(index) - 1, *col_res, builder);
|
|
|
|
else
|
|
|
|
throw Exception("Illegal type of array index", ErrorCodes::LOGICAL_ERROR);
|
|
|
|
|
|
|
|
block.getByPosition(result).column = std::move(col_res);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool FunctionArrayElement::executeGeneric(Block & block, const ColumnNumbers & arguments, size_t result, const PaddedPODArray<IndexType> & indices,
|
|
|
|
ArrayImpl::NullMapBuilder & builder)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = checkAndGetColumn<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const auto & col_nested = col_array->getData();
|
|
|
|
auto col_res = col_nested.cloneEmpty();
|
|
|
|
|
|
|
|
ArrayElementGenericImpl::vector<IndexType>(
|
|
|
|
col_nested, col_array->getOffsets(), indices, *col_res, builder);
|
|
|
|
|
|
|
|
block.getByPosition(result).column = std::move(col_res);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool FunctionArrayElement::executeConst(Block & block, const ColumnNumbers & arguments, size_t result,
|
|
|
|
const PaddedPODArray <IndexType> & indices, ArrayImpl::NullMapBuilder & builder,
|
|
|
|
size_t input_rows_count)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = checkAndGetColumnConstData<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
auto res = block.getByPosition(result).type->createColumn();
|
|
|
|
|
|
|
|
size_t rows = input_rows_count;
|
|
|
|
const IColumn & array_elements = col_array->getData();
|
|
|
|
size_t array_size = array_elements.size();
|
|
|
|
|
|
|
|
for (size_t i = 0; i < rows; ++i)
|
|
|
|
{
|
|
|
|
IndexType index = indices[i];
|
|
|
|
if (index > 0 && static_cast<size_t>(index) <= array_size)
|
|
|
|
{
|
|
|
|
size_t j = index - 1;
|
|
|
|
res->insertFrom(array_elements, j);
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else if (index < 0 && static_cast<size_t>(-index) <= array_size)
|
|
|
|
{
|
|
|
|
size_t j = array_size + index;
|
|
|
|
res->insertFrom(array_elements, j);
|
|
|
|
if (builder)
|
|
|
|
builder.update(j);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
res->insertDefault();
|
|
|
|
if (builder)
|
|
|
|
builder.update();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
block.getByPosition(result).column = std::move(res);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename IndexType>
|
|
|
|
bool FunctionArrayElement::executeArgument(Block & block, const ColumnNumbers & arguments, size_t result,
|
|
|
|
ArrayImpl::NullMapBuilder & builder, size_t input_rows_count)
|
|
|
|
{
|
|
|
|
auto index = checkAndGetColumn<ColumnVector<IndexType>>(block.getByPosition(arguments[1]).column.get());
|
|
|
|
|
|
|
|
if (!index)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const auto & index_data = index->getData();
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.initSink(index_data.size());
|
|
|
|
|
2018-11-24 01:48:06 +00:00
|
|
|
if (!(executeNumber<IndexType, UInt8>(block, arguments, result, index_data, builder)
|
2018-09-09 20:57:54 +00:00
|
|
|
|| executeNumber<IndexType, UInt16>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, UInt32>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, UInt64>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, Int8>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, Int16>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, Int32>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, Int64>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, Float32>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeNumber<IndexType, Float64>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeConst<IndexType>(block, arguments, result, index_data, builder, input_rows_count)
|
|
|
|
|| executeString<IndexType>(block, arguments, result, index_data, builder)
|
|
|
|
|| executeGeneric<IndexType>(block, arguments, result, index_data, builder)))
|
|
|
|
throw Exception("Illegal column " + block.getByPosition(arguments[0]).column->getName()
|
|
|
|
+ " of first argument of function " + getName(), ErrorCodes::ILLEGAL_COLUMN);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool FunctionArrayElement::executeTuple(Block & block, const ColumnNumbers & arguments, size_t result, size_t input_rows_count)
|
|
|
|
{
|
|
|
|
const ColumnArray * col_array = typeid_cast<const ColumnArray *>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
|
|
|
|
if (!col_array)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const ColumnTuple * col_nested = typeid_cast<const ColumnTuple *>(&col_array->getData());
|
|
|
|
|
|
|
|
if (!col_nested)
|
|
|
|
return false;
|
|
|
|
|
2019-03-25 01:43:54 +00:00
|
|
|
const auto & tuple_columns = col_nested->getColumns();
|
2018-09-09 20:57:54 +00:00
|
|
|
size_t tuple_size = tuple_columns.size();
|
|
|
|
|
|
|
|
const DataTypes & tuple_types = typeid_cast<const DataTypeTuple &>(
|
|
|
|
*typeid_cast<const DataTypeArray &>(*block.getByPosition(arguments[0]).type).getNestedType()).getElements();
|
|
|
|
|
|
|
|
/** We will calculate the function for the tuple of the internals of the array.
|
|
|
|
* To do this, create a temporary block.
|
|
|
|
* It will consist of the following columns
|
|
|
|
* - the index of the array to be taken;
|
|
|
|
* - an array of the first elements of the tuples;
|
|
|
|
* - the result of taking the elements by the index for an array of the first elements of the tuples;
|
|
|
|
* - array of the second elements of the tuples;
|
|
|
|
* - result of taking elements by index for an array of second elements of tuples;
|
|
|
|
* ...
|
|
|
|
*/
|
|
|
|
Block block_of_temporary_results;
|
|
|
|
block_of_temporary_results.insert(block.getByPosition(arguments[1]));
|
|
|
|
|
|
|
|
/// results of taking elements by index for arrays from each element of the tuples;
|
|
|
|
Columns result_tuple_columns;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
|
|
{
|
|
|
|
ColumnWithTypeAndName array_of_tuple_section;
|
|
|
|
array_of_tuple_section.column = ColumnArray::create(tuple_columns[i], col_array->getOffsetsPtr());
|
|
|
|
array_of_tuple_section.type = std::make_shared<DataTypeArray>(tuple_types[i]);
|
|
|
|
block_of_temporary_results.insert(array_of_tuple_section);
|
|
|
|
|
|
|
|
ColumnWithTypeAndName array_elements_of_tuple_section;
|
|
|
|
array_elements_of_tuple_section.type = getReturnTypeImpl(
|
|
|
|
{block_of_temporary_results.getByPosition(i * 2 + 1).type, block_of_temporary_results.getByPosition(0).type});
|
|
|
|
block_of_temporary_results.insert(array_elements_of_tuple_section);
|
|
|
|
|
|
|
|
executeImpl(block_of_temporary_results, ColumnNumbers{i * 2 + 1, 0}, i * 2 + 2, input_rows_count);
|
|
|
|
|
|
|
|
result_tuple_columns.emplace_back(std::move(block_of_temporary_results.getByPosition(i * 2 + 2).column));
|
|
|
|
}
|
|
|
|
|
|
|
|
block.getByPosition(result).column = ColumnTuple::create(result_tuple_columns);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
String FunctionArrayElement::getName() const
|
|
|
|
{
|
|
|
|
return name;
|
|
|
|
}
|
|
|
|
|
|
|
|
DataTypePtr FunctionArrayElement::getReturnTypeImpl(const DataTypes & arguments) const
|
|
|
|
{
|
|
|
|
const DataTypeArray * array_type = checkAndGetDataType<DataTypeArray>(arguments[0].get());
|
|
|
|
if (!array_type)
|
|
|
|
throw Exception("First argument for function " + getName() + " must be array.", ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT);
|
|
|
|
|
|
|
|
if (!isInteger(arguments[1]))
|
|
|
|
throw Exception("Second argument for function " + getName() + " must be integer.", ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT);
|
|
|
|
|
|
|
|
return array_type->getNestedType();
|
|
|
|
}
|
|
|
|
|
|
|
|
void FunctionArrayElement::executeImpl(Block & block, const ColumnNumbers & arguments, size_t result, size_t input_rows_count)
|
|
|
|
{
|
|
|
|
/// Check nullability.
|
|
|
|
bool is_array_of_nullable = false;
|
|
|
|
|
|
|
|
const ColumnArray * col_array = nullptr;
|
|
|
|
const ColumnArray * col_const_array = nullptr;
|
|
|
|
|
|
|
|
col_array = checkAndGetColumn<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
if (col_array)
|
|
|
|
is_array_of_nullable = col_array->getData().isColumnNullable();
|
|
|
|
else
|
|
|
|
{
|
|
|
|
col_const_array = checkAndGetColumnConstData<ColumnArray>(block.getByPosition(arguments[0]).column.get());
|
|
|
|
if (col_const_array)
|
|
|
|
is_array_of_nullable = col_const_array->getData().isColumnNullable();
|
|
|
|
else
|
|
|
|
throw Exception("Illegal column " + block.getByPosition(arguments[0]).column->getName()
|
|
|
|
+ " of first argument of function " + getName(), ErrorCodes::ILLEGAL_COLUMN);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!is_array_of_nullable)
|
|
|
|
{
|
|
|
|
ArrayImpl::NullMapBuilder builder;
|
|
|
|
perform(block, arguments, result, builder, input_rows_count);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/// Perform initializations.
|
|
|
|
ArrayImpl::NullMapBuilder builder;
|
|
|
|
Block source_block;
|
|
|
|
|
|
|
|
const auto & input_type = typeid_cast<const DataTypeNullable &>(*typeid_cast<const DataTypeArray &>(*block.getByPosition(arguments[0]).type).getNestedType()).getNestedType();
|
|
|
|
const auto & tmp_ret_type = typeid_cast<const DataTypeNullable &>(*block.getByPosition(result).type).getNestedType();
|
|
|
|
|
|
|
|
if (col_array)
|
|
|
|
{
|
|
|
|
const auto & nullable_col = typeid_cast<const ColumnNullable &>(col_array->getData());
|
|
|
|
const auto & nested_col = nullable_col.getNestedColumnPtr();
|
|
|
|
|
|
|
|
/// Put nested_col inside a ColumnArray.
|
|
|
|
source_block =
|
|
|
|
{
|
|
|
|
{
|
|
|
|
ColumnArray::create(nested_col, col_array->getOffsetsPtr()),
|
|
|
|
std::make_shared<DataTypeArray>(input_type),
|
|
|
|
""
|
|
|
|
},
|
|
|
|
block.getByPosition(arguments[1]),
|
|
|
|
{
|
|
|
|
nullptr,
|
|
|
|
tmp_ret_type,
|
|
|
|
""
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
builder.initSource(nullable_col.getNullMapData().data());
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/// ColumnConst(ColumnArray(ColumnNullable(...)))
|
|
|
|
const auto & nullable_col = static_cast<const ColumnNullable &>(col_const_array->getData());
|
|
|
|
const auto & nested_col = nullable_col.getNestedColumnPtr();
|
|
|
|
|
|
|
|
source_block =
|
|
|
|
{
|
|
|
|
{
|
|
|
|
ColumnConst::create(ColumnArray::create(nested_col, col_const_array->getOffsetsPtr()), input_rows_count),
|
|
|
|
std::make_shared<DataTypeArray>(input_type),
|
|
|
|
""
|
|
|
|
},
|
|
|
|
block.getByPosition(arguments[1]),
|
|
|
|
{
|
|
|
|
nullptr,
|
|
|
|
tmp_ret_type,
|
|
|
|
""
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
builder.initSource(nullable_col.getNullMapData().data());
|
|
|
|
}
|
|
|
|
|
|
|
|
perform(source_block, {0, 1}, 2, builder, input_rows_count);
|
|
|
|
|
|
|
|
/// Store the result.
|
|
|
|
const ColumnWithTypeAndName & source_col = source_block.getByPosition(2);
|
|
|
|
ColumnWithTypeAndName & dest_col = block.getByPosition(result);
|
|
|
|
dest_col.column = ColumnNullable::create(source_col.column, builder ? std::move(builder).getNullMapColumnPtr() : ColumnUInt8::create());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void FunctionArrayElement::perform(Block & block, const ColumnNumbers & arguments, size_t result,
|
|
|
|
ArrayImpl::NullMapBuilder & builder, size_t input_rows_count)
|
|
|
|
{
|
|
|
|
if (executeTuple(block, arguments, result, input_rows_count))
|
|
|
|
{
|
|
|
|
}
|
|
|
|
else if (!block.getByPosition(arguments[1]).column->isColumnConst())
|
|
|
|
{
|
|
|
|
if (!(executeArgument<UInt8>(block, arguments, result, builder, input_rows_count)
|
|
|
|
|| executeArgument<UInt16>(block, arguments, result, builder, input_rows_count)
|
|
|
|
|| executeArgument<UInt32>(block, arguments, result, builder, input_rows_count)
|
|
|
|
|| executeArgument<UInt64>(block, arguments, result, builder, input_rows_count)
|
|
|
|
|| executeArgument<Int8>(block, arguments, result, builder, input_rows_count)
|
|
|
|
|| executeArgument<Int16>(block, arguments, result, builder, input_rows_count)
|
|
|
|
|| executeArgument<Int32>(block, arguments, result, builder, input_rows_count)
|
|
|
|
|| executeArgument<Int64>(block, arguments, result, builder, input_rows_count)))
|
|
|
|
throw Exception("Second argument for function " + getName() + " must must have UInt or Int type.",
|
|
|
|
ErrorCodes::ILLEGAL_COLUMN);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
Field index = (*block.getByPosition(arguments[1]).column)[0];
|
|
|
|
|
|
|
|
if (builder)
|
|
|
|
builder.initSink(input_rows_count);
|
|
|
|
|
2018-10-22 08:54:54 +00:00
|
|
|
if (index == 0u)
|
2018-09-09 20:57:54 +00:00
|
|
|
throw Exception("Array indices is 1-based", ErrorCodes::ZERO_ARRAY_OR_TUPLE_INDEX);
|
|
|
|
|
2018-11-24 01:48:06 +00:00
|
|
|
if (!(executeNumberConst<UInt8>(block, arguments, result, index, builder)
|
2018-09-09 20:57:54 +00:00
|
|
|
|| executeNumberConst<UInt16>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<UInt32>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<UInt64>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<Int8>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<Int16>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<Int32>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<Int64>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<Float32>(block, arguments, result, index, builder)
|
|
|
|
|| executeNumberConst<Float64>(block, arguments, result, index, builder)
|
|
|
|
|| executeStringConst (block, arguments, result, index, builder)
|
|
|
|
|| executeGenericConst (block, arguments, result, index, builder)))
|
|
|
|
throw Exception("Illegal column " + block.getByPosition(arguments[0]).column->getName()
|
|
|
|
+ " of first argument of function " + getName(),
|
|
|
|
ErrorCodes::ILLEGAL_COLUMN);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void registerFunctionArrayElement(FunctionFactory & factory)
|
|
|
|
{
|
|
|
|
factory.registerFunction<FunctionArrayElement>();
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|