2011-08-22 08:43:52 +00:00
|
|
|
#pragma once
|
2010-03-12 18:25:35 +00:00
|
|
|
|
2017-04-01 09:19:00 +00:00
|
|
|
#include <Core/Field.h>
|
2017-12-13 01:27:53 +00:00
|
|
|
#include <Common/COWPtr.h>
|
2017-07-14 00:34:00 +00:00
|
|
|
#include <Common/PODArray.h>
|
2017-04-01 09:19:00 +00:00
|
|
|
#include <Common/Exception.h>
|
2017-06-23 20:22:35 +00:00
|
|
|
#include <common/StringRef.h>
|
2010-03-12 18:25:35 +00:00
|
|
|
|
2011-08-22 08:43:52 +00:00
|
|
|
|
2016-07-10 15:58:58 +00:00
|
|
|
class SipHash;
|
|
|
|
|
|
|
|
|
2010-03-12 18:25:35 +00:00
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
2016-01-11 21:46:36 +00:00
|
|
|
namespace ErrorCodes
|
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
extern const int CANNOT_GET_SIZE_OF_FIELD;
|
|
|
|
extern const int NOT_IMPLEMENTED;
|
|
|
|
extern const int SIZES_OF_COLUMNS_DOESNT_MATCH;
|
2016-01-11 21:46:36 +00:00
|
|
|
}
|
|
|
|
|
2015-10-04 03:17:36 +00:00
|
|
|
class Arena;
|
2017-07-06 13:54:55 +00:00
|
|
|
class ColumnGathererStream;
|
2011-08-22 08:43:52 +00:00
|
|
|
|
2017-02-17 17:39:02 +00:00
|
|
|
/// Declares interface to store columns in memory.
|
2017-12-13 01:27:53 +00:00
|
|
|
class IColumn : public COWPtr<IColumn>
|
2010-03-12 18:25:35 +00:00
|
|
|
{
|
2017-12-13 01:27:53 +00:00
|
|
|
private:
|
|
|
|
friend class COWPtr<IColumn>;
|
|
|
|
|
|
|
|
/// Creates the same column with the same data.
|
2017-12-19 01:57:06 +00:00
|
|
|
/// This is internal method to use from COWPtr.
|
|
|
|
/// It performs shallow copy with copy-ctor and not useful from outside.
|
|
|
|
/// If you want to copy column for modification, look at 'mutate' method.
|
2017-12-16 04:29:34 +00:00
|
|
|
virtual MutablePtr clone() const = 0;
|
2017-12-13 01:27:53 +00:00
|
|
|
|
2017-12-19 01:53:54 +00:00
|
|
|
public:
|
2017-04-01 07:20:54 +00:00
|
|
|
/// Name of a Column. It is used in info messages.
|
2018-06-03 16:51:31 +00:00
|
|
|
virtual std::string getName() const { return getFamilyName(); }
|
2017-12-07 22:11:51 +00:00
|
|
|
|
|
|
|
/// Name of a Column kind, without parameters (example: FixedString, Array).
|
|
|
|
virtual const char * getFamilyName() const = 0;
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
/** If column isn't constant, returns nullptr (or itself).
|
2019-01-22 19:56:53 +00:00
|
|
|
* If column is constant, transforms constant to full column (if column type allows such transform) and return it.
|
2017-04-01 07:20:54 +00:00
|
|
|
*/
|
2018-12-21 16:00:07 +00:00
|
|
|
virtual Ptr convertToFullColumnIfConst() const { return getPtr(); }
|
2017-04-01 07:20:54 +00:00
|
|
|
|
2018-09-27 15:55:22 +00:00
|
|
|
/// If column isn't ColumnLowCardinality, return itself.
|
|
|
|
/// If column is ColumnLowCardinality, transforms is to full column.
|
|
|
|
virtual Ptr convertToFullColumnIfLowCardinality() const { return getPtr(); }
|
2018-06-06 13:43:16 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
/// Creates empty column with the same type.
|
2017-12-13 01:27:53 +00:00
|
|
|
virtual MutablePtr cloneEmpty() const { return cloneResized(0); }
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
/// Creates column with the same type and specified size.
|
|
|
|
/// If size is less current size, then data is cut.
|
|
|
|
/// If size is greater, than default values are appended.
|
2017-12-13 01:27:53 +00:00
|
|
|
virtual MutablePtr cloneResized(size_t /*size*/) const { throw Exception("Cannot cloneResized() column " + getName(), ErrorCodes::NOT_IMPLEMENTED); }
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
/// Returns number of values in column.
|
|
|
|
virtual size_t size() const = 0;
|
|
|
|
|
|
|
|
/// There are no values in columns.
|
|
|
|
bool empty() const { return size() == 0; }
|
|
|
|
|
|
|
|
/// Returns value of n-th element in universal Field representation.
|
|
|
|
/// Is used in rare cases, since creation of Field instance is expensive usually.
|
|
|
|
virtual Field operator[](size_t n) const = 0;
|
|
|
|
|
|
|
|
/// Like the previous one, but avoids extra copying if Field is in a container, for example.
|
|
|
|
virtual void get(size_t n, Field & res) const = 0;
|
|
|
|
|
|
|
|
/// If possible, returns pointer to memory chunk which contains n-th element (if it isn't possible, throws an exception)
|
|
|
|
/// Is used to optimize some computations (in aggregation, for example).
|
|
|
|
virtual StringRef getDataAt(size_t n) const = 0;
|
|
|
|
|
|
|
|
/// Like getData, but has special behavior for columns that contain variable-length strings.
|
|
|
|
/// Returns zero-ending memory chunk (i.e. its size is 1 byte longer).
|
|
|
|
virtual StringRef getDataAtWithTerminatingZero(size_t n) const
|
|
|
|
{
|
|
|
|
return getDataAt(n);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// If column stores integers, it returns n-th element transformed to UInt64 using static_cast.
|
2018-12-04 12:49:21 +00:00
|
|
|
/// If column stores floating point numbers, bits of n-th elements are copied to lower bits of UInt64, the remaining bits are zeros.
|
2017-04-01 07:20:54 +00:00
|
|
|
/// Is used to optimize some computations (in aggregation, for example).
|
2017-12-01 17:49:12 +00:00
|
|
|
virtual UInt64 get64(size_t /*n*/) const
|
2017-04-01 07:20:54 +00:00
|
|
|
{
|
|
|
|
throw Exception("Method get64 is not supported for " + getName(), ErrorCodes::NOT_IMPLEMENTED);
|
|
|
|
}
|
|
|
|
|
2017-07-24 07:48:26 +00:00
|
|
|
/** If column is numeric, return value of n-th element, casted to UInt64.
|
2018-10-13 14:33:43 +00:00
|
|
|
* For NULL values of Nullable column it is allowed to return arbitrary value.
|
2017-07-24 06:32:02 +00:00
|
|
|
* Otherwise throw an exception.
|
|
|
|
*/
|
2017-12-01 17:49:12 +00:00
|
|
|
virtual UInt64 getUInt(size_t /*n*/) const
|
2017-07-24 07:48:26 +00:00
|
|
|
{
|
|
|
|
throw Exception("Method getUInt is not supported for " + getName(), ErrorCodes::NOT_IMPLEMENTED);
|
|
|
|
}
|
|
|
|
|
2017-12-01 17:49:12 +00:00
|
|
|
virtual Int64 getInt(size_t /*n*/) const
|
2017-07-24 06:32:02 +00:00
|
|
|
{
|
|
|
|
throw Exception("Method getInt is not supported for " + getName(), ErrorCodes::NOT_IMPLEMENTED);
|
|
|
|
}
|
|
|
|
|
2018-10-11 14:33:01 +00:00
|
|
|
virtual bool isDefaultAt(size_t n) const { return get64(n) == 0; }
|
2017-12-10 22:44:04 +00:00
|
|
|
virtual bool isNullAt(size_t /*n*/) const { return false; }
|
|
|
|
|
2018-05-06 11:29:17 +00:00
|
|
|
/** If column is numeric, return value of n-th element, casted to bool.
|
|
|
|
* For NULL values of Nullable column returns false.
|
|
|
|
* Otherwise throw an exception.
|
|
|
|
*/
|
|
|
|
virtual bool getBool(size_t /*n*/) const
|
|
|
|
{
|
|
|
|
throw Exception("Method getBool is not supported for " + getName(), ErrorCodes::NOT_IMPLEMENTED);
|
|
|
|
}
|
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
/// Removes all elements outside of specified range.
|
|
|
|
/// Is used in LIMIT operation, for example.
|
2018-03-20 14:17:09 +00:00
|
|
|
virtual Ptr cut(size_t start, size_t length) const
|
2017-04-01 07:20:54 +00:00
|
|
|
{
|
2017-12-13 01:27:53 +00:00
|
|
|
MutablePtr res = cloneEmpty();
|
2017-09-01 18:21:01 +00:00
|
|
|
res->insertRangeFrom(*this, start, length);
|
Get rid of useless std::move to get NRVO
http://eel.is/c++draft/class.copy.elision#:constructor,copy,elision
Some quote:
> Speaking of RVO, return std::move(w); prohibits it. It means "use move constructor or fail to compile", whereas return w; means "use RVO, and if you can't, use move constructor, and if you can't, use copy constructor, and if you can't, fail to compile."
There is one exception to this rule:
```cpp
Block FilterBlockInputStream::removeFilterIfNeed(Block && block)
{
if (block && remove_filter)
block.erase(static_cast<size_t>(filter_column));
return std::move(block);
}
```
because references are not eligible for NRVO, which is another rule "always move rvalue references and forward universal references" that takes precedence.
2018-08-27 14:04:22 +00:00
|
|
|
return res;
|
2017-04-01 07:20:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Appends new value at the end of column (column's size is increased by 1).
|
|
|
|
/// Is used to transform raw strings to Blocks (for example, inside input format parsers)
|
|
|
|
virtual void insert(const Field & x) = 0;
|
|
|
|
|
|
|
|
/// Appends n-th element from other column with the same type.
|
|
|
|
/// Is used in merge-sort and merges. It could be implemented in inherited classes more optimally than default implementation.
|
|
|
|
virtual void insertFrom(const IColumn & src, size_t n) { insert(src[n]); }
|
|
|
|
|
2018-08-29 12:10:18 +00:00
|
|
|
/// Appends range of elements from other column with the same type.
|
2017-04-01 07:20:54 +00:00
|
|
|
/// Could be used to concatenate columns.
|
|
|
|
virtual void insertRangeFrom(const IColumn & src, size_t start, size_t length) = 0;
|
|
|
|
|
|
|
|
/// Appends data located in specified memory chunk if it is possible (throws an exception if it cannot be implemented).
|
|
|
|
/// Is used to optimize some computations (in aggregation, for example).
|
2017-12-09 10:14:45 +00:00
|
|
|
/// Parameter length could be ignored if column values have fixed size.
|
2017-04-01 07:20:54 +00:00
|
|
|
virtual void insertData(const char * pos, size_t length) = 0;
|
|
|
|
|
|
|
|
/// Appends "default value".
|
|
|
|
/// Is used when there are need to increase column size, but inserting value doesn't make sense.
|
|
|
|
/// For example, ColumnNullable(Nested) absolutely ignores values of nested column if it is marked as NULL.
|
|
|
|
virtual void insertDefault() = 0;
|
|
|
|
|
|
|
|
/** Removes last n elements.
|
2019-01-22 19:56:53 +00:00
|
|
|
* Is used to support exception-safety of several operations.
|
2017-04-01 07:20:54 +00:00
|
|
|
* For example, sometimes insertion should be reverted if we catch an exception during operation processing.
|
|
|
|
* If column has less than n elements or n == 0 - undefined behavior.
|
|
|
|
*/
|
|
|
|
virtual void popBack(size_t n) = 0;
|
|
|
|
|
|
|
|
/** Serializes n-th element. Serialized element should be placed continuously inside Arena's memory.
|
|
|
|
* Serialized value can be deserialized to reconstruct original object. Is used in aggregation.
|
|
|
|
* The method is similar to getDataAt(), but can work when element's value cannot be mapped to existing continuous memory chunk,
|
|
|
|
* For example, to obtain unambiguous representation of Array of strings, strings data should be interleaved with their sizes.
|
|
|
|
* Parameter begin should be used with Arena::allocContinue.
|
|
|
|
*/
|
|
|
|
virtual StringRef serializeValueIntoArena(size_t n, Arena & arena, char const *& begin) const = 0;
|
|
|
|
|
|
|
|
/// Deserializes a value that was serialized using IColumn::serializeValueIntoArena method.
|
|
|
|
/// Returns pointer to the position after the read data.
|
|
|
|
virtual const char * deserializeAndInsertFromArena(const char * pos) = 0;
|
|
|
|
|
|
|
|
/// Update state of hash function with value of n-th element.
|
2018-10-13 14:33:43 +00:00
|
|
|
/// On subsequent calls of this method for sequence of column values of arbitrary types,
|
2017-04-01 07:20:54 +00:00
|
|
|
/// passed bytes to hash must identify sequence of values unambiguously.
|
|
|
|
virtual void updateHashWithValue(size_t n, SipHash & hash) const = 0;
|
|
|
|
|
|
|
|
/** Removes elements that don't match the filter.
|
|
|
|
* Is used in WHERE and HAVING operations.
|
|
|
|
* If result_size_hint > 0, then makes advance reserve(result_size_hint) for the result column;
|
|
|
|
* if 0, then don't makes reserve(),
|
|
|
|
* otherwise (i.e. < 0), makes reserve() using size of source column.
|
|
|
|
*/
|
|
|
|
using Filter = PaddedPODArray<UInt8>;
|
2018-03-20 14:17:09 +00:00
|
|
|
virtual Ptr filter(const Filter & filt, ssize_t result_size_hint) const = 0;
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
/// Permutes elements using specified permutation. Is used in sortings.
|
|
|
|
/// limit - if it isn't 0, puts only first limit elements in the result.
|
|
|
|
using Permutation = PaddedPODArray<size_t>;
|
2019-02-18 19:44:26 +00:00
|
|
|
virtual Ptr permute(const Permutation & perm, size_t limit) const = 0;
|
2017-04-01 07:20:54 +00:00
|
|
|
|
2018-04-18 21:00:47 +00:00
|
|
|
/// Creates new column with values column[indexes[:limit]]. If limit is 0, all indexes are used.
|
|
|
|
/// Indexes must be one of the ColumnUInt. For default implementation, see selectIndexImpl from ColumnsCommon.h
|
2019-02-18 17:28:53 +00:00
|
|
|
virtual Ptr index(const IColumn & indexes, size_t limit) const = 0;
|
2018-04-18 21:00:47 +00:00
|
|
|
|
2018-08-29 12:10:18 +00:00
|
|
|
/** Compares (*this)[n] and rhs[m]. Column rhs should have the same type.
|
2017-04-01 07:20:54 +00:00
|
|
|
* Returns negative number, 0, or positive number (*this)[n] is less, equal, greater than rhs[m] respectively.
|
|
|
|
* Is used in sortings.
|
|
|
|
*
|
|
|
|
* If one of element's value is NaN or NULLs, then:
|
|
|
|
* - if nan_direction_hint == -1, NaN and NULLs are considered as least than everything other;
|
|
|
|
* - if nan_direction_hint == 1, NaN and NULLs are considered as greatest than everything other.
|
|
|
|
* For example, if nan_direction_hint == -1 is used by descending sorting, NaNs will be at the end.
|
|
|
|
*
|
|
|
|
* For non Nullable and non floating point types, nan_direction_hint is ignored.
|
|
|
|
*/
|
|
|
|
virtual int compareAt(size_t n, size_t m, const IColumn & rhs, int nan_direction_hint) const = 0;
|
|
|
|
|
|
|
|
/** Returns a permutation that sorts elements of this column,
|
|
|
|
* i.e. perm[i]-th element of source column should be i-th element of sorted column.
|
|
|
|
* reverse - reverse ordering (acsending).
|
|
|
|
* limit - if isn't 0, then only first limit elements of the result column could be sorted.
|
|
|
|
* nan_direction_hint - see above.
|
|
|
|
*/
|
2019-02-18 19:44:26 +00:00
|
|
|
virtual void getPermutation(bool reverse, size_t limit, int nan_direction_hint, Permutation & res) const = 0;
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
/** Copies each element according offsets parameter.
|
|
|
|
* (i-th element should be copied offsets[i] - offsets[i - 1] times.)
|
|
|
|
* It is necessary in ARRAY JOIN operation.
|
|
|
|
*/
|
2017-12-15 21:32:25 +00:00
|
|
|
using Offset = UInt64;
|
|
|
|
using Offsets = PaddedPODArray<Offset>;
|
2018-03-20 14:17:09 +00:00
|
|
|
virtual Ptr replicate(const Offsets & offsets) const = 0;
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
/** Split column to smaller columns. Each value goes to column index, selected by corresponding element of 'selector'.
|
|
|
|
* Selector must contain values from 0 to num_columns - 1.
|
|
|
|
* For default implementation, see scatterImpl.
|
|
|
|
*/
|
|
|
|
using ColumnIndex = UInt64;
|
|
|
|
using Selector = PaddedPODArray<ColumnIndex>;
|
2017-12-13 01:27:53 +00:00
|
|
|
virtual std::vector<MutablePtr> scatter(ColumnIndex num_columns, const Selector & selector) const = 0;
|
2017-04-01 07:20:54 +00:00
|
|
|
|
2017-07-06 13:54:55 +00:00
|
|
|
/// Insert data from several other columns according to source mask (used in vertical merge).
|
|
|
|
/// For now it is a helper to de-virtualize calls to insert*() functions inside gather loop
|
|
|
|
/// (descendants should call gatherer_stream.gather(*this) to implement this function.)
|
|
|
|
/// TODO: interface decoupled from ColumnGathererStream that allows non-generic specializations.
|
|
|
|
virtual void gather(ColumnGathererStream & gatherer_stream) = 0;
|
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
/** Computes minimum and maximum element of the column.
|
2019-01-22 19:56:53 +00:00
|
|
|
* In addition to numeric types, the function is completely implemented for Date and DateTime.
|
|
|
|
* For strings and arrays function should return default value.
|
2017-04-01 07:20:54 +00:00
|
|
|
* (except for constant columns; they should return value of the constant).
|
|
|
|
* If column is empty function should return default value.
|
|
|
|
*/
|
|
|
|
virtual void getExtremes(Field & min, Field & max) const = 0;
|
|
|
|
|
|
|
|
/// Reserves memory for specified amount of elements. If reservation isn't possible, does nothing.
|
|
|
|
/// It affects performance only (not correctness).
|
2018-06-03 16:51:31 +00:00
|
|
|
virtual void reserve(size_t /*n*/) {}
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
/// Size of column data in memory (may be approximate) - for profiling. Zero, if could not be determined.
|
|
|
|
virtual size_t byteSize() const = 0;
|
|
|
|
|
|
|
|
/// Size of memory, allocated for column.
|
|
|
|
/// This is greater or equals to byteSize due to memory reservation in containers.
|
|
|
|
/// Zero, if could be determined.
|
2017-07-13 16:49:09 +00:00
|
|
|
virtual size_t allocatedBytes() const = 0;
|
2017-04-01 07:20:54 +00:00
|
|
|
|
2019-03-10 03:16:51 +00:00
|
|
|
/// Make memory region readonly with mprotect if it is large enough.
|
|
|
|
/// The operation is slow and performed only for debug builds.
|
|
|
|
virtual void protect() {}
|
|
|
|
|
2017-12-10 21:05:21 +00:00
|
|
|
/// If the column contains subcolumns (such as Array, Nullable, etc), do callback on them.
|
|
|
|
/// Shallow: doesn't do recursive calls; don't do call for itself.
|
2017-12-13 01:27:53 +00:00
|
|
|
using ColumnCallback = std::function<void(Ptr&)>;
|
2017-12-07 12:09:55 +00:00
|
|
|
virtual void forEachSubcolumn(ColumnCallback) {}
|
|
|
|
|
2017-12-14 01:43:19 +00:00
|
|
|
|
2018-03-20 10:58:16 +00:00
|
|
|
MutablePtr mutate() const &&
|
2017-12-14 01:43:19 +00:00
|
|
|
{
|
2017-12-14 03:56:56 +00:00
|
|
|
MutablePtr res = COWPtr<IColumn>::mutate();
|
2018-03-20 10:58:16 +00:00
|
|
|
res->forEachSubcolumn([](Ptr & subcolumn) { subcolumn = (*std::move(subcolumn)).mutate(); });
|
2017-12-14 01:43:19 +00:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-12-09 17:32:18 +00:00
|
|
|
/** Some columns can contain another columns inside.
|
|
|
|
* So, we have a tree of columns. But not all combinations are possible.
|
|
|
|
* There are the following rules:
|
|
|
|
*
|
|
|
|
* ColumnConst may be only at top. It cannot be inside any column.
|
|
|
|
* ColumnNullable can contain only simple columns.
|
|
|
|
*/
|
2017-12-09 07:32:32 +00:00
|
|
|
|
|
|
|
/// Various properties on behaviour of column type.
|
|
|
|
|
2017-12-09 10:14:45 +00:00
|
|
|
/// Is this column a container for Nullable values? It's true only for ColumnNullable.
|
|
|
|
/// Note that ColumnConst(ColumnNullable(...)) is not considered.
|
|
|
|
virtual bool isColumnNullable() const { return false; }
|
|
|
|
|
|
|
|
/// Column stores a constant value. It's true only for ColumnConst wrapper.
|
|
|
|
virtual bool isColumnConst() const { return false; }
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2017-12-09 10:14:45 +00:00
|
|
|
/// It's a special kind of column, that contain single value, but is not a ColumnConst.
|
|
|
|
virtual bool isDummy() const { return false; }
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2017-12-10 21:05:21 +00:00
|
|
|
/** Memory layout properties.
|
|
|
|
*
|
|
|
|
* Each value of a column can be placed in memory contiguously or not.
|
|
|
|
*
|
|
|
|
* Example: simple columns like UInt64 or FixedString store their values contiguously in single memory buffer.
|
|
|
|
*
|
|
|
|
* Example: Tuple store values of each component in separate subcolumn, so the values of Tuples with at least two components are not contiguous.
|
|
|
|
* Another example is Nullable. Each value have null flag, that is stored separately, so the value is not contiguous in memory.
|
|
|
|
*
|
|
|
|
* There are some important cases, when values are not stored contiguously, but for each value, you can get contiguous memory segment,
|
|
|
|
* that will unambiguously identify the value. In this case, methods getDataAt and insertData are implemented.
|
|
|
|
* Example: String column: bytes of strings are stored concatenated in one memory buffer
|
|
|
|
* and offsets to that buffer are stored in another buffer. The same is for Array of fixed-size contiguous elements.
|
|
|
|
*
|
|
|
|
* To avoid confusion between these cases, we don't have isContiguous method.
|
|
|
|
*/
|
|
|
|
|
2017-12-09 10:14:45 +00:00
|
|
|
/// Values in column have fixed size (including the case when values span many memory segments).
|
|
|
|
virtual bool valuesHaveFixedSize() const { return isFixedAndContiguous(); }
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2017-12-09 10:14:45 +00:00
|
|
|
/// Values in column are represented as continuous memory segment of fixed size. Implies valuesHaveFixedSize.
|
|
|
|
virtual bool isFixedAndContiguous() const { return false; }
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2018-04-25 15:16:48 +00:00
|
|
|
/// If isFixedAndContiguous, returns the underlying data array, otherwise throws an exception.
|
|
|
|
virtual StringRef getRawData() const { throw Exception("Column " + getName() + " is not a contiguous block of memory", ErrorCodes::NOT_IMPLEMENTED); }
|
|
|
|
|
2017-12-09 10:14:45 +00:00
|
|
|
/// If valuesHaveFixedSize, returns size of value, otherwise throw an exception.
|
|
|
|
virtual size_t sizeOfValueIfFixed() const { throw Exception("Values of column " + getName() + " are not fixed size.", ErrorCodes::CANNOT_GET_SIZE_OF_FIELD); }
|
|
|
|
|
|
|
|
/// Column is ColumnVector of numbers or ColumnConst of it. Note that Nullable columns are not numeric.
|
|
|
|
/// Implies isFixedAndContiguous.
|
|
|
|
virtual bool isNumeric() const { return false; }
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2017-12-09 10:14:45 +00:00
|
|
|
/// If the only value column can contain is NULL.
|
|
|
|
/// Does not imply type of object, because it can be ColumnNullable(ColumnNothing) or ColumnConst(ColumnNullable(ColumnNothing))
|
|
|
|
virtual bool onlyNull() const { return false; }
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2017-12-09 10:14:45 +00:00
|
|
|
/// Can be inside ColumnNullable.
|
|
|
|
virtual bool canBeInsideNullable() const { return false; }
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2018-09-27 15:55:22 +00:00
|
|
|
virtual bool lowCardinality() const { return false; }
|
2018-04-17 17:47:27 +00:00
|
|
|
|
2017-12-09 07:32:32 +00:00
|
|
|
|
2019-01-04 12:10:00 +00:00
|
|
|
virtual ~IColumn() = default;
|
|
|
|
IColumn() = default;
|
|
|
|
IColumn(const IColumn &) = default;
|
2017-02-11 20:20:57 +00:00
|
|
|
|
2017-12-10 21:05:21 +00:00
|
|
|
/** Print column name, size, and recursively print all subcolumns.
|
|
|
|
*/
|
2017-12-07 22:11:51 +00:00
|
|
|
String dumpStructure() const;
|
|
|
|
|
2017-02-11 20:20:57 +00:00
|
|
|
protected:
|
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
/// Template is to devirtualize calls to insertFrom method.
|
|
|
|
/// In derived classes (that use final keyword), implement scatter method as call to scatterImpl.
|
|
|
|
template <typename Derived>
|
2017-12-13 01:27:53 +00:00
|
|
|
std::vector<MutablePtr> scatterImpl(ColumnIndex num_columns, const Selector & selector) const
|
2017-04-01 07:20:54 +00:00
|
|
|
{
|
|
|
|
size_t num_rows = size();
|
2017-02-11 20:20:57 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
if (num_rows != selector.size())
|
2017-08-19 18:11:20 +00:00
|
|
|
throw Exception(
|
|
|
|
"Size of selector: " + std::to_string(selector.size()) + " doesn't match size of column: " + std::to_string(num_rows),
|
|
|
|
ErrorCodes::SIZES_OF_COLUMNS_DOESNT_MATCH);
|
2017-02-11 20:20:57 +00:00
|
|
|
|
2017-12-13 01:27:53 +00:00
|
|
|
std::vector<MutablePtr> columns(num_columns);
|
2017-04-01 07:20:54 +00:00
|
|
|
for (auto & column : columns)
|
|
|
|
column = cloneEmpty();
|
2017-02-11 20:20:57 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
{
|
2017-09-08 02:37:02 +00:00
|
|
|
size_t reserve_size = num_rows * 1.1 / num_columns; /// 1.1 is just a guess. Better to use n-sigma rule.
|
2017-02-11 20:20:57 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
if (reserve_size > 1)
|
|
|
|
for (auto & column : columns)
|
|
|
|
column->reserve(reserve_size);
|
|
|
|
}
|
2017-02-11 20:20:57 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
for (size_t i = 0; i < num_rows; ++i)
|
|
|
|
static_cast<Derived &>(*columns[selector[i]]).insertFrom(*this, i);
|
2017-02-11 20:20:57 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
return columns;
|
|
|
|
}
|
2010-03-12 18:25:35 +00:00
|
|
|
};
|
|
|
|
|
2017-12-13 01:27:53 +00:00
|
|
|
using ColumnPtr = IColumn::Ptr;
|
2018-11-26 00:56:50 +00:00
|
|
|
using MutableColumnPtr = IColumn::MutablePtr;
|
2017-12-13 01:27:53 +00:00
|
|
|
using Columns = std::vector<ColumnPtr>;
|
2017-12-14 04:25:22 +00:00
|
|
|
using MutableColumns = std::vector<MutableColumnPtr>;
|
2017-12-13 01:27:53 +00:00
|
|
|
|
|
|
|
using ColumnRawPtrs = std::vector<const IColumn *>;
|
2017-12-16 02:34:02 +00:00
|
|
|
//using MutableColumnRawPtrs = std::vector<IColumn *>;
|
2010-03-12 18:25:35 +00:00
|
|
|
|
2018-03-21 19:39:14 +00:00
|
|
|
template <typename ... Args>
|
|
|
|
struct IsMutableColumns;
|
|
|
|
|
|
|
|
template <typename Arg, typename ... Args>
|
|
|
|
struct IsMutableColumns<Arg, Args ...>
|
|
|
|
{
|
|
|
|
static const bool value = std::is_assignable<MutableColumnPtr &&, Arg>::value && IsMutableColumns<Args ...>::value;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct IsMutableColumns<> { static const bool value = true; };
|
|
|
|
|
2010-03-12 18:25:35 +00:00
|
|
|
}
|