2012-12-05 12:44:55 +00:00
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
|
|
#include <sstream>
|
|
|
|
|
|
|
|
|
|
#include <DB/Interpreters/Context.h>
|
|
|
|
|
#include <DB/Core/SortDescription.h>
|
|
|
|
|
#include <DB/Parsers/ASTExpressionList.h>
|
|
|
|
|
#include <DB/Parsers/ASTSelectQuery.h>
|
|
|
|
|
#include <DB/Parsers/ASTFunction.h>
|
|
|
|
|
#include <DB/Parsers/ASTLiteral.h>
|
2014-03-26 18:19:25 +00:00
|
|
|
|
#include <DB/Storages/MergeTree/BoolMask.h>
|
2012-12-05 12:44:55 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
namespace DB
|
|
|
|
|
{
|
2013-12-12 00:50:54 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#pragma GCC diagnostic push
|
|
|
|
|
#pragma GCC diagnostic ignored "-Wsign-compare"
|
|
|
|
|
|
|
|
|
|
/** Более точное сравнение.
|
|
|
|
|
* Отличается от Field::operator< и Field::operator== тем, что сравнивает значения разных числовых типов между собой.
|
|
|
|
|
* Правила сравнения - такие же, что и в FunctionsComparison.
|
|
|
|
|
* В том числе, сравнение знаковых и беззнаковых оставляем UB.
|
|
|
|
|
*/
|
|
|
|
|
class FieldVisitorAccurateEquals : public StaticVisitor<bool>
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
bool operator() (const Null & l, const Null & r) const { return true; }
|
|
|
|
|
bool operator() (const Null & l, const UInt64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Null & l, const Int64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Null & l, const Float64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Null & l, const String & r) const { return false; }
|
|
|
|
|
bool operator() (const Null & l, const Array & r) const { return false; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const UInt64 & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const UInt64 & l, const UInt64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const UInt64 & l, const Int64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const UInt64 & l, const Float64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const UInt64 & l, const String & r) const { return false; }
|
|
|
|
|
bool operator() (const UInt64 & l, const Array & r) const { return false; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const Int64 & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const Int64 & l, const UInt64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const Int64 & l, const Int64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const Int64 & l, const Float64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const Int64 & l, const String & r) const { return false; }
|
|
|
|
|
bool operator() (const Int64 & l, const Array & r) const { return false; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const Float64 & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const Float64 & l, const UInt64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const Float64 & l, const Int64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const Float64 & l, const Float64 & r) const { return l == r; }
|
|
|
|
|
bool operator() (const Float64 & l, const String & r) const { return false; }
|
|
|
|
|
bool operator() (const Float64 & l, const Array & r) const { return false; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const String & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const UInt64 & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const Int64 & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const Float64 & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const String & r) const { return l == r; }
|
|
|
|
|
bool operator() (const String & l, const Array & r) const { return false; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const Array & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const UInt64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const Int64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const Float64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const String & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const Array & r) const { return l == r; }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
class FieldVisitorAccurateLess : public StaticVisitor<bool>
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
bool operator() (const Null & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const Null & l, const UInt64 & r) const { return true; }
|
|
|
|
|
bool operator() (const Null & l, const Int64 & r) const { return true; }
|
|
|
|
|
bool operator() (const Null & l, const Float64 & r) const { return true; }
|
|
|
|
|
bool operator() (const Null & l, const String & r) const { return true; }
|
|
|
|
|
bool operator() (const Null & l, const Array & r) const { return true; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const UInt64 & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const UInt64 & l, const UInt64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const UInt64 & l, const Int64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const UInt64 & l, const Float64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const UInt64 & l, const String & r) const { return true; }
|
|
|
|
|
bool operator() (const UInt64 & l, const Array & r) const { return true; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const Int64 & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const Int64 & l, const UInt64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const Int64 & l, const Int64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const Int64 & l, const Float64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const Int64 & l, const String & r) const { return true; }
|
|
|
|
|
bool operator() (const Int64 & l, const Array & r) const { return true; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const Float64 & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const Float64 & l, const UInt64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const Float64 & l, const Int64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const Float64 & l, const Float64 & r) const { return l < r; }
|
|
|
|
|
bool operator() (const Float64 & l, const String & r) const { return true; }
|
|
|
|
|
bool operator() (const Float64 & l, const Array & r) const { return true; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const String & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const UInt64 & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const Int64 & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const Float64 & r) const { return false; }
|
|
|
|
|
bool operator() (const String & l, const String & r) const { return l < r; }
|
|
|
|
|
bool operator() (const String & l, const Array & r) const { return true; }
|
|
|
|
|
|
|
|
|
|
bool operator() (const Array & l, const Null & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const UInt64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const Int64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const Float64 & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const String & r) const { return false; }
|
|
|
|
|
bool operator() (const Array & l, const Array & r) const { return l < r; }
|
|
|
|
|
};
|
|
|
|
|
|
2014-03-26 10:56:21 +00:00
|
|
|
|
#pragma GCC diagnostic pop
|
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/** Диапазон с открытыми или закрытыми концами; возможно, неограниченный.
|
2013-12-12 00:50:54 +00:00
|
|
|
|
*/
|
2012-12-05 12:44:55 +00:00
|
|
|
|
struct Range
|
|
|
|
|
{
|
2013-12-12 00:50:54 +00:00
|
|
|
|
private:
|
|
|
|
|
static bool equals(const Field & lhs, const Field & rhs) { return apply_visitor(FieldVisitorAccurateEquals(), lhs, rhs); }
|
|
|
|
|
static bool less(const Field & lhs, const Field & rhs) { return apply_visitor(FieldVisitorAccurateLess(), lhs, rhs); }
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2013-12-12 00:50:54 +00:00
|
|
|
|
public:
|
2012-12-05 12:44:55 +00:00
|
|
|
|
Field left; /// левая граница, если есть
|
|
|
|
|
Field right; /// правая граница, если есть
|
2015-05-26 00:35:13 +00:00
|
|
|
|
bool left_bounded = false; /// ограничен ли слева
|
|
|
|
|
bool right_bounded = false; /// ограничен ли справа
|
|
|
|
|
bool left_included = false; /// включает левую границу, если есть
|
|
|
|
|
bool right_included = false; /// включает правую границу, если есть
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// Всё множество.
|
2015-05-26 00:35:13 +00:00
|
|
|
|
Range() {}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// Одна точка.
|
|
|
|
|
Range(const Field & point) : left(point), right(point), left_bounded(true), right_bounded(true), left_included(true), right_included(true) {}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// Ограниченный с двух сторон диапазон.
|
|
|
|
|
Range(const Field & left_, bool left_included_, const Field & right_, bool right_included_)
|
|
|
|
|
: left(left_), right(right_), left_bounded(true), right_bounded(true), left_included(left_included_), right_included(right_included_) {}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2013-12-11 20:44:06 +00:00
|
|
|
|
static Range createRightBounded(const Field & right_point, bool right_included)
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
Range r;
|
|
|
|
|
r.right = right_point;
|
|
|
|
|
r.right_bounded = true;
|
|
|
|
|
r.right_included = right_included;
|
|
|
|
|
return r;
|
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2013-12-11 20:44:06 +00:00
|
|
|
|
static Range createLeftBounded(const Field & left_point, bool left_included)
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
Range r;
|
2013-12-11 20:44:06 +00:00
|
|
|
|
r.left = left_point;
|
2012-12-05 12:44:55 +00:00
|
|
|
|
r.left_bounded = true;
|
|
|
|
|
r.left_included = left_included;
|
|
|
|
|
return r;
|
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// Установить левую границу.
|
|
|
|
|
void setLeft(const Field & point, bool included)
|
|
|
|
|
{
|
|
|
|
|
left = point;
|
|
|
|
|
left_bounded = true;
|
|
|
|
|
left_included = included;
|
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// Установить правую границу.
|
|
|
|
|
void setRight(const Field & point, bool included)
|
|
|
|
|
{
|
|
|
|
|
right = point;
|
|
|
|
|
right_bounded = true;
|
|
|
|
|
right_included = included;
|
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// x входит в range
|
2013-12-11 20:44:06 +00:00
|
|
|
|
bool contains(const Field & x) const
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
return !leftThan(x) && !rightThan(x);
|
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// x находится левее
|
2013-12-11 20:44:06 +00:00
|
|
|
|
bool rightThan(const Field & x) const
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
return (left_bounded
|
2013-12-12 00:50:54 +00:00
|
|
|
|
? !(less(left, x) || (left_included && equals(x, left)))
|
2013-12-11 20:44:06 +00:00
|
|
|
|
: false);
|
2012-12-05 12:44:55 +00:00
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// x находится правее
|
2013-12-11 20:44:06 +00:00
|
|
|
|
bool leftThan(const Field & x) const
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
return (right_bounded
|
2013-12-12 00:50:54 +00:00
|
|
|
|
? !(less(x, right) || (right_included && equals(x, right)))
|
2013-12-11 20:44:06 +00:00
|
|
|
|
: false);
|
2012-12-05 12:44:55 +00:00
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2013-12-11 20:44:06 +00:00
|
|
|
|
bool intersectsRange(const Range & r) const
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
/// r левее меня.
|
2013-12-11 20:44:06 +00:00
|
|
|
|
if (r.right_bounded
|
|
|
|
|
&& left_bounded
|
2013-12-12 00:50:54 +00:00
|
|
|
|
&& (less(r.right, left)
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|| ((!left_included || !r.right_included)
|
2013-12-12 00:50:54 +00:00
|
|
|
|
&& equals(r.right, left))))
|
2012-12-05 12:44:55 +00:00
|
|
|
|
return false;
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// r правее меня.
|
2013-12-11 20:44:06 +00:00
|
|
|
|
if (r.left_bounded
|
|
|
|
|
&& right_bounded
|
2013-12-12 00:50:54 +00:00
|
|
|
|
&& (less(right, r.left) /// ...} {...
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|| ((!right_included || !r.left_included) /// ...)[... или ...](...
|
2013-12-12 00:50:54 +00:00
|
|
|
|
&& equals(r.left, right))))
|
2012-12-05 12:44:55 +00:00
|
|
|
|
return false;
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
return true;
|
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2013-12-11 20:44:06 +00:00
|
|
|
|
bool containsRange(const Range & r) const
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
/// r начинается левее меня.
|
2013-12-11 20:44:06 +00:00
|
|
|
|
if (left_bounded
|
|
|
|
|
&& (!r.left_bounded
|
2013-12-12 00:50:54 +00:00
|
|
|
|
|| less(r.left, left)
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|| (r.left_included
|
|
|
|
|
&& !left_included
|
2013-12-12 00:50:54 +00:00
|
|
|
|
&& equals(r.left, left))))
|
2012-12-05 12:44:55 +00:00
|
|
|
|
return false;
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// r заканчивается правее меня.
|
2013-12-11 20:44:06 +00:00
|
|
|
|
if (right_bounded
|
|
|
|
|
&& (!r.right_bounded
|
2013-12-12 00:50:54 +00:00
|
|
|
|
|| less(right, r.right)
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|| (r.right_included
|
|
|
|
|
&& !right_included
|
2013-12-12 00:50:54 +00:00
|
|
|
|
&& equals(r.right, right))))
|
2012-12-05 12:44:55 +00:00
|
|
|
|
return false;
|
2013-12-11 20:44:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
return true;
|
|
|
|
|
}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2013-12-11 20:44:06 +00:00
|
|
|
|
String toString() const
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
std::stringstream str;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
if (!left_bounded)
|
|
|
|
|
str << "(-inf, ";
|
|
|
|
|
else
|
2013-01-05 20:03:19 +00:00
|
|
|
|
str << (left_included ? '[' : '(') << apply_visitor(FieldVisitorToString(), left) << ", ";
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
if (!right_bounded)
|
|
|
|
|
str << "+inf)";
|
|
|
|
|
else
|
2013-01-05 20:03:19 +00:00
|
|
|
|
str << apply_visitor(FieldVisitorToString(), right) << (right_included ? ']' : ')');
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
return str.str();
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
2014-05-12 00:45:50 +00:00
|
|
|
|
class ASTSet;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/** Условие на индекс.
|
|
|
|
|
*
|
|
|
|
|
* Состоит из условий на принадлежность ключа всевозможным диапазонам или множествам,
|
|
|
|
|
* а также логических связок AND/OR/NOT над этими условиями.
|
|
|
|
|
*
|
|
|
|
|
* Составляет reverse polish notation от этих условий
|
|
|
|
|
* и умеет вычислять (интерпретировать) её выполнимость над диапазонами ключа.
|
|
|
|
|
*/
|
2012-12-10 10:23:10 +00:00
|
|
|
|
class PKCondition
|
2012-12-05 12:44:55 +00:00
|
|
|
|
{
|
|
|
|
|
public:
|
2013-05-06 12:15:34 +00:00
|
|
|
|
/// Не учитывает секцию SAMPLE. all_columns - набор всех столбцов таблицы.
|
|
|
|
|
PKCondition(ASTPtr query, const Context & context, const NamesAndTypesList & all_columns, const SortDescription & sort_descr);
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-06 09:45:09 +00:00
|
|
|
|
/// Выполнимо ли условие в диапазоне ключей.
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// left_pk и right_pk должны содержать все поля из sort_descr в соответствующем порядке.
|
2015-03-27 03:37:46 +00:00
|
|
|
|
bool mayBeTrueInRange(const Field * left_pk, const Field * right_pk) const;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-06 09:45:09 +00:00
|
|
|
|
/// Выполнимо ли условие в полубесконечном (не ограниченном справа) диапазоне ключей.
|
|
|
|
|
/// left_pk должен содержать все поля из sort_descr в соответствующем порядке.
|
2015-03-27 03:37:46 +00:00
|
|
|
|
bool mayBeTrueAfter(const Field * left_pk) const;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
|
|
|
|
/// Проверяет, что индекс не может быть использован.
|
2015-03-27 03:37:46 +00:00
|
|
|
|
bool alwaysUnknown() const;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-12 14:25:55 +00:00
|
|
|
|
/// Наложить дополнительное условие: значение в столбце column должно быть в диапазоне range.
|
|
|
|
|
/// Возвращает, есть ли такой столбец в первичном ключе.
|
|
|
|
|
bool addCondition(const String & column, const Range & range);
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2015-03-27 03:37:46 +00:00
|
|
|
|
String toString() const;
|
2012-12-05 12:44:55 +00:00
|
|
|
|
private:
|
2012-12-10 10:23:10 +00:00
|
|
|
|
/// Выражение хранится в виде обратной польской строки (Reverse Polish Notation).
|
2012-12-05 12:44:55 +00:00
|
|
|
|
struct RPNElement
|
|
|
|
|
{
|
|
|
|
|
enum Function
|
|
|
|
|
{
|
|
|
|
|
/// Атомы логического выражения.
|
|
|
|
|
FUNCTION_IN_RANGE,
|
|
|
|
|
FUNCTION_NOT_IN_RANGE,
|
2014-03-20 12:25:26 +00:00
|
|
|
|
FUNCTION_IN_SET,
|
2014-03-26 10:56:21 +00:00
|
|
|
|
FUNCTION_NOT_IN_SET,
|
2012-12-05 12:44:55 +00:00
|
|
|
|
FUNCTION_UNKNOWN, /// Может принимать любое значение.
|
|
|
|
|
/// Операторы логического выражения.
|
|
|
|
|
FUNCTION_NOT,
|
|
|
|
|
FUNCTION_AND,
|
|
|
|
|
FUNCTION_OR,
|
|
|
|
|
};
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
RPNElement() {}
|
|
|
|
|
RPNElement(Function function_) : function(function_) {}
|
|
|
|
|
RPNElement(Function function_, size_t key_column_) : function(function_), key_column(key_column_) {}
|
2012-12-12 14:25:55 +00:00
|
|
|
|
RPNElement(Function function_, size_t key_column_, const Range & range_)
|
2014-04-22 22:52:00 +00:00
|
|
|
|
: function(function_), range(range_), key_column(key_column_) {}
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2015-03-27 03:37:46 +00:00
|
|
|
|
String toString() const;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
Function function;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
/// Для FUNCTION_IN_RANGE и FUNCTION_NOT_IN_RANGE.
|
|
|
|
|
Range range;
|
|
|
|
|
size_t key_column;
|
2014-03-20 12:25:26 +00:00
|
|
|
|
/// Для FUNCTION_IN_SET
|
2014-03-31 14:49:43 +00:00
|
|
|
|
ASTPtr in_function;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2015-03-27 03:37:46 +00:00
|
|
|
|
const ASTSet * inFunctionToSet() const;
|
2012-12-05 12:44:55 +00:00
|
|
|
|
};
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
typedef std::vector<RPNElement> RPN;
|
|
|
|
|
typedef std::map<String, size_t> ColumnIndices;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2015-03-27 03:37:46 +00:00
|
|
|
|
bool mayBeTrueInRange(const Field * left_pk, const Field * right_pk, bool right_bounded) const;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
void traverseAST(ASTPtr & node, Block & block_with_constants);
|
|
|
|
|
bool atomFromAST(ASTPtr & node, Block & block_with_constants, RPNElement & out);
|
|
|
|
|
bool operatorFromAST(ASTFunction * func, RPNElement & out);
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
RPN rpn;
|
2015-03-27 03:06:06 +00:00
|
|
|
|
|
2012-12-05 12:44:55 +00:00
|
|
|
|
SortDescription sort_descr;
|
|
|
|
|
ColumnIndices pk_columns;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
}
|