mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-17 13:13:36 +00:00
d89ee33ce2
commitc567d4e1fe
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 20:35:01 2017 +0300 Style [#METR-2944]. commit26bf3e1228
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 20:33:11 2017 +0300 Miscellaneous [#METR-2944]. commiteb946f4c6f
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 20:30:19 2017 +0300 Miscellaneous [#METR-2944]. commit78c867a147
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 20:11:41 2017 +0300 Miscellaneous [#METR-2944]. commit6604c5c83c
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 19:56:15 2017 +0300 Miscellaneous [#METR-2944]. commit23fbf05c1d
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 19:47:52 2017 +0300 Miscellaneous [#METR-2944]. commit98772faf11
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 19:46:05 2017 +0300 Miscellaneous [#METR-2944]. commit3dc636ab9f
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 19:39:46 2017 +0300 Miscellaneous [#METR-2944]. commit3e16aee954
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 19:38:03 2017 +0300 Miscellaneous [#METR-2944]. commitae7e7e90eb
Author: Alexey Milovidov <milovidov@yandex-team.ru> Date: Fri Jan 6 19:34:15 2017 +0300 Miscellaneous [#METR-2944].
53 lines
1.3 KiB
C++
53 lines
1.3 KiB
C++
#pragma once
|
||
|
||
#include <vector>
|
||
|
||
#include <DB/Core/Field.h>
|
||
#include <DB/Core/FieldVisitors.h>
|
||
|
||
|
||
namespace DB
|
||
{
|
||
|
||
|
||
/** Параметры разных функций quantilesSomething.
|
||
* - список уровней квантилей.
|
||
* Также необходимо вычислить массив индексов уровней, идущих по возрастанию.
|
||
*
|
||
* Пример: quantiles(0.5, 0.99, 0.95)(x).
|
||
* levels: 0.5, 0.99, 0.95
|
||
* levels_permutation: 0, 2, 1
|
||
*/
|
||
template <typename T> /// float или double
|
||
struct QuantileLevels
|
||
{
|
||
using Levels = std::vector<T>;
|
||
using Permutation = std::vector<size_t>;
|
||
|
||
Levels levels;
|
||
Permutation permutation; /// Индекс i-го по величине уровня в массиве levels.
|
||
|
||
size_t size() const { return levels.size(); }
|
||
|
||
void set(const Array & params)
|
||
{
|
||
if (params.empty())
|
||
throw Exception("Aggregate function quantiles requires at least one parameter.", ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH);
|
||
|
||
size_t size = params.size();
|
||
levels.resize(size);
|
||
permutation.resize(size);
|
||
|
||
for (size_t i = 0; i < size; ++i)
|
||
{
|
||
levels[i] = applyVisitor(FieldVisitorConvertToNumber<Float64>(), params[i]);
|
||
permutation[i] = i;
|
||
}
|
||
|
||
std::sort(permutation.begin(), permutation.end(), [this] (size_t a, size_t b) { return levels[a] < levels[b]; });
|
||
}
|
||
};
|
||
|
||
|
||
}
|