mirror of
https://github.com/red0124/ssp.git
synced 2025-12-14 05:49:55 +01:00
make indent with 4 caracters instead of 8
This commit is contained in:
@@ -28,12 +28,12 @@ struct no_validator;
|
||||
|
||||
template <typename T>
|
||||
struct no_validator<T, typename std::enable_if_t<has_m_ss_valid_t<T>>> {
|
||||
using type = typename member_wrapper<decltype(&T::ss_valid)>::arg_type;
|
||||
using type = typename member_wrapper<decltype(&T::ss_valid)>::arg_type;
|
||||
};
|
||||
|
||||
template <typename T, typename U>
|
||||
struct no_validator {
|
||||
using type = T;
|
||||
using type = T;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
@@ -41,18 +41,17 @@ using no_validator_t = typename no_validator<T>::type;
|
||||
|
||||
template <typename... Ts>
|
||||
struct no_validator_tup {
|
||||
using type =
|
||||
typename apply_trait<no_validator, std::tuple<Ts...>>::type;
|
||||
using type = typename apply_trait<no_validator, std::tuple<Ts...>>::type;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
struct no_validator_tup<std::tuple<Ts...>> {
|
||||
using type = typename no_validator_tup<Ts...>::type;
|
||||
using type = typename no_validator_tup<Ts...>::type;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
struct no_validator_tup<std::tuple<T>> {
|
||||
using type = no_validator_t<T>;
|
||||
using type = no_validator_t<T>;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
@@ -64,8 +63,8 @@ using no_validator_tup_t = typename no_validator_tup<Ts...>::type;
|
||||
|
||||
template <typename... Ts>
|
||||
struct no_void_tup {
|
||||
using type =
|
||||
typename filter_not<std::is_void, no_validator_tup_t<Ts...>>::type;
|
||||
using type =
|
||||
typename filter_not<std::is_void, no_validator_tup_t<Ts...>>::type;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
@@ -78,12 +77,12 @@ using no_void_tup_t = filter_not_t<std::is_void, Ts...>;
|
||||
// replace 'validators' and remove void from tuple
|
||||
template <typename... Ts>
|
||||
struct no_void_validator_tup {
|
||||
using type = no_validator_tup_t<no_void_tup_t<Ts...>>;
|
||||
using type = no_validator_tup_t<no_void_tup_t<Ts...>>;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
struct no_void_validator_tup<std::tuple<Ts...>> {
|
||||
using type = no_validator_tup_t<no_void_tup_t<Ts...>>;
|
||||
using type = no_validator_tup_t<no_void_tup_t<Ts...>>;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
@@ -97,8 +96,8 @@ using no_void_validator_tup_t = typename no_void_validator_tup<Ts...>::type;
|
||||
// the 'tied' method which is to be used for type deduction when converting
|
||||
template <typename T, typename... Ts>
|
||||
struct tied_class {
|
||||
constexpr static bool value =
|
||||
(sizeof...(Ts) == 0 && std::is_class_v<T> && has_m_tied<T>::value);
|
||||
constexpr static bool value =
|
||||
(sizeof...(Ts) == 0 && std::is_class_v<T> && has_m_tied<T>::value);
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
@@ -112,286 +111,277 @@ enum class error_mode { String, Bool };
|
||||
////////////////
|
||||
|
||||
class converter {
|
||||
using string_range = std::pair<const char*, const char*>;
|
||||
constexpr static auto default_delimiter = ',';
|
||||
using string_range = std::pair<const char*, const char*>;
|
||||
constexpr static auto default_delimiter = ',';
|
||||
|
||||
public:
|
||||
using split_input = std::vector<string_range>;
|
||||
public:
|
||||
using split_input = std::vector<string_range>;
|
||||
|
||||
// parses line with given delimiter, returns a 'T' object created with
|
||||
// extracted values of type 'Ts'
|
||||
template <typename T, typename... Ts>
|
||||
T convert_object(const char* const line,
|
||||
const std::string& delim = "") {
|
||||
return to_object<T>(convert<Ts...>(line, delim));
|
||||
// parses line with given delimiter, returns a 'T' object created with
|
||||
// extracted values of type 'Ts'
|
||||
template <typename T, typename... Ts>
|
||||
T convert_object(const char* const line, const std::string& delim = "") {
|
||||
return to_object<T>(convert<Ts...>(line, delim));
|
||||
}
|
||||
|
||||
// parses line with given delimiter, returns tuple of objects with
|
||||
// extracted values of type 'Ts'
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<Ts...> convert(const char* const line,
|
||||
const std::string& delim = "") {
|
||||
input_ = split(line, delim);
|
||||
return convert<Ts...>(input_);
|
||||
}
|
||||
|
||||
// parses already split line, returns 'T' object with extracted values
|
||||
template <typename T, typename... Ts>
|
||||
T convert_object(const split_input& elems) {
|
||||
return to_object<T>(convert<Ts...>(elems));
|
||||
}
|
||||
|
||||
// parses already split line, returns either a tuple of objects with
|
||||
// parsed values (returns raw element (no tuple) if Ts is empty), or if
|
||||
// one argument is given which is a class which has a tied
|
||||
// method which returns a tuple, returns that type
|
||||
template <typename T, typename... Ts>
|
||||
no_void_validator_tup_t<T, Ts...> convert(const split_input& elems) {
|
||||
if constexpr (tied_class_v<T, Ts...>) {
|
||||
using arg_ref_tuple =
|
||||
typename std::result_of_t<decltype (&T::tied)(T)>;
|
||||
|
||||
using arg_tuple =
|
||||
typename apply_trait<std::decay, arg_ref_tuple>::type;
|
||||
|
||||
return to_object<T>(convert_impl(elems, (arg_tuple*){}));
|
||||
} else if constexpr (sizeof...(Ts) == 0 &&
|
||||
is_instance_of<T, std::tuple>::value) {
|
||||
return convert_impl(elems, (T*){});
|
||||
|
||||
} else {
|
||||
return convert_impl<T, Ts...>(elems);
|
||||
}
|
||||
}
|
||||
|
||||
bool valid() const {
|
||||
return (error_mode_ == error_mode::String) ? string_error_.empty()
|
||||
: bool_error_ == false;
|
||||
}
|
||||
|
||||
const std::string& error_msg() const {
|
||||
return string_error_;
|
||||
}
|
||||
|
||||
void set_error_mode(error_mode mode) {
|
||||
error_mode_ = mode;
|
||||
}
|
||||
|
||||
// 'splits' string by given delimiter, returns vector of pairs which
|
||||
// contain the beginings and the ends of each column of the string
|
||||
const split_input& split(const char* const line,
|
||||
const std::string& delim = "") {
|
||||
input_.clear();
|
||||
if (line[0] == '\0') {
|
||||
return input_;
|
||||
}
|
||||
|
||||
// parses line with given delimiter, returns tuple of objects with
|
||||
// extracted values of type 'Ts'
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<Ts...> convert(const char* const line,
|
||||
const std::string& delim = "") {
|
||||
input_ = split(line, delim);
|
||||
return convert<Ts...>(input_);
|
||||
}
|
||||
|
||||
// parses already split line, returns 'T' object with extracted values
|
||||
template <typename T, typename... Ts>
|
||||
T convert_object(const split_input& elems) {
|
||||
return to_object<T>(convert<Ts...>(elems));
|
||||
}
|
||||
|
||||
// parses already split line, returns either a tuple of objects with
|
||||
// parsed values (returns raw element (no tuple) if Ts is empty), or if
|
||||
// one argument is given which is a class which has a tied
|
||||
// method which returns a tuple, returns that type
|
||||
template <typename T, typename... Ts>
|
||||
no_void_validator_tup_t<T, Ts...> convert(const split_input& elems) {
|
||||
if constexpr (tied_class_v<T, Ts...>) {
|
||||
using arg_ref_tuple =
|
||||
typename std::result_of_t<decltype (&T::tied)(T)>;
|
||||
|
||||
using arg_tuple =
|
||||
typename apply_trait<std::decay,
|
||||
arg_ref_tuple>::type;
|
||||
|
||||
return to_object<T>(
|
||||
convert_impl(elems, (arg_tuple*){}));
|
||||
} else if constexpr (sizeof...(Ts) == 0 &&
|
||||
is_instance_of<T, std::tuple>::value) {
|
||||
return convert_impl(elems, (T*){});
|
||||
|
||||
} else {
|
||||
return convert_impl<T, Ts...>(elems);
|
||||
}
|
||||
}
|
||||
|
||||
bool valid() const {
|
||||
return (error_mode_ == error_mode::String)
|
||||
? string_error_.empty()
|
||||
: bool_error_ == false;
|
||||
}
|
||||
|
||||
const std::string& error_msg() const {
|
||||
return string_error_;
|
||||
}
|
||||
|
||||
void set_error_mode(error_mode mode) {
|
||||
error_mode_ = mode;
|
||||
}
|
||||
|
||||
// 'splits' string by given delimiter, returns vector of pairs which
|
||||
// contain the beginings and the ends of each column of the string
|
||||
const split_input& split(const char* const line,
|
||||
const std::string& delim = "") {
|
||||
input_.clear();
|
||||
if (line[0] == '\0') {
|
||||
return input_;
|
||||
}
|
||||
|
||||
switch (delim.size()) {
|
||||
case 0:
|
||||
return split_impl(line, ',');
|
||||
case 1:
|
||||
return split_impl(line, delim[0]);
|
||||
default:
|
||||
return split_impl(line, delim, delim.size());
|
||||
};
|
||||
}
|
||||
|
||||
private:
|
||||
////////////////
|
||||
// error
|
||||
////////////////
|
||||
|
||||
void clear_error() {
|
||||
string_error_.clear();
|
||||
bool_error_ = false;
|
||||
}
|
||||
|
||||
std::string error_sufix(const string_range msg, size_t pos) const {
|
||||
std::string error;
|
||||
error.reserve(32);
|
||||
error.append("at column ")
|
||||
.append(std::to_string(pos + 1))
|
||||
.append(": \'")
|
||||
.append(msg.first, msg.second)
|
||||
.append("\'");
|
||||
return error;
|
||||
}
|
||||
|
||||
void set_error_invalid_conversion(const string_range msg, size_t pos) {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.clear();
|
||||
string_error_
|
||||
.append("invalid conversion for parameter ")
|
||||
.append(error_sufix(msg, pos));
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_validate(const char* const error, const string_range msg,
|
||||
size_t pos) {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.clear();
|
||||
string_error_.append(error).append(" ").append(
|
||||
error_sufix(msg, pos));
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_number_of_colums(size_t expected_pos, size_t pos) {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.clear();
|
||||
string_error_
|
||||
.append("invalid number of columns, expected: ")
|
||||
.append(std::to_string(expected_pos))
|
||||
.append(", got: ")
|
||||
.append(std::to_string(pos));
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
////////////////
|
||||
// convert implementation
|
||||
////////////////
|
||||
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<Ts...> convert_impl(const split_input& elems) {
|
||||
clear_error();
|
||||
no_void_validator_tup_t<Ts...> ret{};
|
||||
if (sizeof...(Ts) != elems.size()) {
|
||||
set_error_number_of_colums(sizeof...(Ts), elems.size());
|
||||
return ret;
|
||||
}
|
||||
return extract_tuple<Ts...>(elems);
|
||||
}
|
||||
|
||||
// do not know how to specialize by return type :(
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<std::tuple<Ts...>> convert_impl(
|
||||
const split_input& elems, const std::tuple<Ts...>*) {
|
||||
return convert_impl<Ts...>(elems);
|
||||
}
|
||||
|
||||
////////////////
|
||||
// substring
|
||||
////////////////
|
||||
|
||||
template <typename Delim>
|
||||
const split_input& split_impl(const char* const line, Delim delim,
|
||||
size_t delim_size = 1) {
|
||||
auto range = substring(line, delim);
|
||||
input_.push_back(range);
|
||||
while (range.second[0] != '\0') {
|
||||
range = substring(range.second + delim_size, delim);
|
||||
input_.push_back(range);
|
||||
}
|
||||
return input_;
|
||||
}
|
||||
|
||||
bool no_match(const char* end, char delim) const {
|
||||
return *end != delim;
|
||||
}
|
||||
|
||||
bool no_match(const char* end, const std::string& delim) const {
|
||||
return strncmp(end, delim.c_str(), delim.size()) != 0;
|
||||
}
|
||||
|
||||
template <typename Delim>
|
||||
string_range substring(const char* const begin, Delim delim) const {
|
||||
const char* end;
|
||||
for (end = begin; *end != '\0' && no_match(end, delim); ++end)
|
||||
;
|
||||
|
||||
return string_range{begin, end};
|
||||
}
|
||||
|
||||
////////////////
|
||||
// conversion
|
||||
////////////////
|
||||
|
||||
template <typename T>
|
||||
void extract_one(no_validator_t<T>& dst, const string_range msg,
|
||||
size_t pos) {
|
||||
if (!valid()) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (!extract(msg.first, msg.second, dst)) {
|
||||
set_error_invalid_conversion(msg, pos);
|
||||
return;
|
||||
}
|
||||
|
||||
if constexpr (has_m_ss_valid_t<T>) {
|
||||
if (T validator; !validator.ss_valid(dst)) {
|
||||
if constexpr (has_m_error_t<T>) {
|
||||
set_error_validate(validator.error(),
|
||||
msg, pos);
|
||||
} else {
|
||||
set_error_validate("validation error",
|
||||
msg, pos);
|
||||
}
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
template <size_t ArgN, size_t TupN, typename... Ts>
|
||||
void extract_multiple(no_void_validator_tup_t<Ts...>& tup,
|
||||
const split_input& elems) {
|
||||
using elem_t = std::tuple_element_t<ArgN, std::tuple<Ts...>>;
|
||||
|
||||
constexpr bool not_void = !std::is_void_v<elem_t>;
|
||||
constexpr bool one_element =
|
||||
count_not<std::is_void, Ts...>::size == 1;
|
||||
|
||||
if constexpr (not_void) {
|
||||
if constexpr (one_element) {
|
||||
extract_one<elem_t>(tup, elems[ArgN], ArgN);
|
||||
} else {
|
||||
auto& el = std::get<TupN>(tup);
|
||||
extract_one<elem_t>(el, elems[ArgN], ArgN);
|
||||
}
|
||||
}
|
||||
|
||||
if constexpr (sizeof...(Ts) > ArgN + 1) {
|
||||
constexpr size_t NewTupN = (not_void) ? TupN + 1 : TupN;
|
||||
extract_multiple<ArgN + 1, NewTupN, Ts...>(tup, elems);
|
||||
}
|
||||
}
|
||||
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<Ts...> extract_tuple(const split_input& elems) {
|
||||
static_assert(!all_of<std::is_void, Ts...>::value,
|
||||
"at least one parameter must be non void");
|
||||
no_void_validator_tup_t<Ts...> ret;
|
||||
extract_multiple<0, 0, Ts...>(ret, elems);
|
||||
return ret;
|
||||
switch (delim.size()) {
|
||||
case 0:
|
||||
return split_impl(line, ',');
|
||||
case 1:
|
||||
return split_impl(line, delim[0]);
|
||||
default:
|
||||
return split_impl(line, delim, delim.size());
|
||||
};
|
||||
}
|
||||
|
||||
////////////////
|
||||
// members
|
||||
////////////////
|
||||
private:
|
||||
////////////////
|
||||
// error
|
||||
////////////////
|
||||
|
||||
std::vector<string_range> input_;
|
||||
std::string string_error_;
|
||||
bool bool_error_;
|
||||
enum error_mode error_mode_ { error_mode::String };
|
||||
void clear_error() {
|
||||
string_error_.clear();
|
||||
bool_error_ = false;
|
||||
}
|
||||
|
||||
std::string error_sufix(const string_range msg, size_t pos) const {
|
||||
std::string error;
|
||||
error.reserve(32);
|
||||
error.append("at column ")
|
||||
.append(std::to_string(pos + 1))
|
||||
.append(": \'")
|
||||
.append(msg.first, msg.second)
|
||||
.append("\'");
|
||||
return error;
|
||||
}
|
||||
|
||||
void set_error_invalid_conversion(const string_range msg, size_t pos) {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.clear();
|
||||
string_error_.append("invalid conversion for parameter ")
|
||||
.append(error_sufix(msg, pos));
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_validate(const char* const error, const string_range msg,
|
||||
size_t pos) {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.clear();
|
||||
string_error_.append(error).append(" ").append(
|
||||
error_sufix(msg, pos));
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_number_of_colums(size_t expected_pos, size_t pos) {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.clear();
|
||||
string_error_.append("invalid number of columns, expected: ")
|
||||
.append(std::to_string(expected_pos))
|
||||
.append(", got: ")
|
||||
.append(std::to_string(pos));
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
////////////////
|
||||
// convert implementation
|
||||
////////////////
|
||||
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<Ts...> convert_impl(const split_input& elems) {
|
||||
clear_error();
|
||||
no_void_validator_tup_t<Ts...> ret{};
|
||||
if (sizeof...(Ts) != elems.size()) {
|
||||
set_error_number_of_colums(sizeof...(Ts), elems.size());
|
||||
return ret;
|
||||
}
|
||||
return extract_tuple<Ts...>(elems);
|
||||
}
|
||||
|
||||
// do not know how to specialize by return type :(
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<std::tuple<Ts...>> convert_impl(
|
||||
const split_input& elems, const std::tuple<Ts...>*) {
|
||||
return convert_impl<Ts...>(elems);
|
||||
}
|
||||
|
||||
////////////////
|
||||
// substring
|
||||
////////////////
|
||||
|
||||
template <typename Delim>
|
||||
const split_input& split_impl(const char* const line, Delim delim,
|
||||
size_t delim_size = 1) {
|
||||
auto range = substring(line, delim);
|
||||
input_.push_back(range);
|
||||
while (range.second[0] != '\0') {
|
||||
range = substring(range.second + delim_size, delim);
|
||||
input_.push_back(range);
|
||||
}
|
||||
return input_;
|
||||
}
|
||||
|
||||
bool no_match(const char* end, char delim) const {
|
||||
return *end != delim;
|
||||
}
|
||||
|
||||
bool no_match(const char* end, const std::string& delim) const {
|
||||
return strncmp(end, delim.c_str(), delim.size()) != 0;
|
||||
}
|
||||
|
||||
template <typename Delim>
|
||||
string_range substring(const char* const begin, Delim delim) const {
|
||||
const char* end;
|
||||
for (end = begin; *end != '\0' && no_match(end, delim); ++end)
|
||||
;
|
||||
|
||||
return string_range{begin, end};
|
||||
}
|
||||
|
||||
////////////////
|
||||
// conversion
|
||||
////////////////
|
||||
|
||||
template <typename T>
|
||||
void extract_one(no_validator_t<T>& dst, const string_range msg,
|
||||
size_t pos) {
|
||||
if (!valid()) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (!extract(msg.first, msg.second, dst)) {
|
||||
set_error_invalid_conversion(msg, pos);
|
||||
return;
|
||||
}
|
||||
|
||||
if constexpr (has_m_ss_valid_t<T>) {
|
||||
if (T validator; !validator.ss_valid(dst)) {
|
||||
if constexpr (has_m_error_t<T>) {
|
||||
set_error_validate(validator.error(), msg, pos);
|
||||
} else {
|
||||
set_error_validate("validation error", msg, pos);
|
||||
}
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
template <size_t ArgN, size_t TupN, typename... Ts>
|
||||
void extract_multiple(no_void_validator_tup_t<Ts...>& tup,
|
||||
const split_input& elems) {
|
||||
using elem_t = std::tuple_element_t<ArgN, std::tuple<Ts...>>;
|
||||
|
||||
constexpr bool not_void = !std::is_void_v<elem_t>;
|
||||
constexpr bool one_element = count_not<std::is_void, Ts...>::size == 1;
|
||||
|
||||
if constexpr (not_void) {
|
||||
if constexpr (one_element) {
|
||||
extract_one<elem_t>(tup, elems[ArgN], ArgN);
|
||||
} else {
|
||||
auto& el = std::get<TupN>(tup);
|
||||
extract_one<elem_t>(el, elems[ArgN], ArgN);
|
||||
}
|
||||
}
|
||||
|
||||
if constexpr (sizeof...(Ts) > ArgN + 1) {
|
||||
constexpr size_t NewTupN = (not_void) ? TupN + 1 : TupN;
|
||||
extract_multiple<ArgN + 1, NewTupN, Ts...>(tup, elems);
|
||||
}
|
||||
}
|
||||
|
||||
template <typename... Ts>
|
||||
no_void_validator_tup_t<Ts...> extract_tuple(const split_input& elems) {
|
||||
static_assert(!all_of<std::is_void, Ts...>::value,
|
||||
"at least one parameter must be non void");
|
||||
no_void_validator_tup_t<Ts...> ret;
|
||||
extract_multiple<0, 0, Ts...>(ret, elems);
|
||||
return ret;
|
||||
};
|
||||
|
||||
////////////////
|
||||
// members
|
||||
////////////////
|
||||
|
||||
std::vector<string_range> input_;
|
||||
std::string string_error_;
|
||||
bool bool_error_;
|
||||
enum error_mode error_mode_ { error_mode::String };
|
||||
};
|
||||
|
||||
template <>
|
||||
inline void converter::extract_one<std::string>(std::string& dst,
|
||||
const string_range msg,
|
||||
size_t) {
|
||||
if (!valid()) {
|
||||
return;
|
||||
}
|
||||
if (!valid()) {
|
||||
return;
|
||||
}
|
||||
|
||||
extract(msg.first, msg.second, dst);
|
||||
extract(msg.first, msg.second, dst);
|
||||
}
|
||||
|
||||
} /* ss */
|
||||
|
||||
@@ -20,108 +20,108 @@ namespace ss {
|
||||
////////////////
|
||||
template <typename T>
|
||||
std::enable_if_t<std::is_floating_point_v<T>, T> pow10(int n) {
|
||||
T ret = 1.0;
|
||||
T r = 10.0;
|
||||
if (n < 0) {
|
||||
n = -n;
|
||||
r = 0.1;
|
||||
}
|
||||
T ret = 1.0;
|
||||
T r = 10.0;
|
||||
if (n < 0) {
|
||||
n = -n;
|
||||
r = 0.1;
|
||||
}
|
||||
|
||||
while (n) {
|
||||
if (n & 1) {
|
||||
ret *= r;
|
||||
}
|
||||
r *= r;
|
||||
n >>= 1;
|
||||
while (n) {
|
||||
if (n & 1) {
|
||||
ret *= r;
|
||||
}
|
||||
return ret;
|
||||
r *= r;
|
||||
n >>= 1;
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
std::enable_if_t<std::is_floating_point_v<T>, std::optional<T>> to_num(
|
||||
const char* begin, const char* const end) {
|
||||
if (begin == end) {
|
||||
return std::nullopt;
|
||||
}
|
||||
int sign = 1;
|
||||
T int_part = 0.0;
|
||||
T frac_part = 0.0;
|
||||
bool has_frac = false;
|
||||
bool has_exp = false;
|
||||
if (begin == end) {
|
||||
return std::nullopt;
|
||||
}
|
||||
int sign = 1;
|
||||
T int_part = 0.0;
|
||||
T frac_part = 0.0;
|
||||
bool has_frac = false;
|
||||
bool has_exp = false;
|
||||
|
||||
// +/- sign
|
||||
if (*begin == '-') {
|
||||
++begin;
|
||||
sign = -1;
|
||||
// +/- sign
|
||||
if (*begin == '-') {
|
||||
++begin;
|
||||
sign = -1;
|
||||
}
|
||||
|
||||
while (begin != end) {
|
||||
if (*begin >= '0' && *begin <= '9') {
|
||||
int_part = int_part * 10 + (*begin - '0');
|
||||
} else if (*begin == '.') {
|
||||
has_frac = true;
|
||||
++begin;
|
||||
break;
|
||||
} else if (*begin == 'e') {
|
||||
has_exp = true;
|
||||
++begin;
|
||||
break;
|
||||
} else {
|
||||
return std::nullopt;
|
||||
}
|
||||
++begin;
|
||||
}
|
||||
|
||||
if (has_frac) {
|
||||
T frac_exp = 0.1;
|
||||
|
||||
while (begin != end) {
|
||||
if (*begin >= '0' && *begin <= '9') {
|
||||
int_part = int_part * 10 + (*begin - '0');
|
||||
} else if (*begin == '.') {
|
||||
has_frac = true;
|
||||
++begin;
|
||||
break;
|
||||
} else if (*begin == 'e') {
|
||||
has_exp = true;
|
||||
++begin;
|
||||
break;
|
||||
} else {
|
||||
return std::nullopt;
|
||||
}
|
||||
if (*begin >= '0' && *begin <= '9') {
|
||||
frac_part += frac_exp * (*begin - '0');
|
||||
frac_exp *= 0.1;
|
||||
} else if (*begin == 'e') {
|
||||
has_exp = true;
|
||||
++begin;
|
||||
}
|
||||
|
||||
if (has_frac) {
|
||||
T frac_exp = 0.1;
|
||||
|
||||
while (begin != end) {
|
||||
if (*begin >= '0' && *begin <= '9') {
|
||||
frac_part += frac_exp * (*begin - '0');
|
||||
frac_exp *= 0.1;
|
||||
} else if (*begin == 'e') {
|
||||
has_exp = true;
|
||||
++begin;
|
||||
break;
|
||||
} else {
|
||||
return std::nullopt;
|
||||
}
|
||||
++begin;
|
||||
}
|
||||
}
|
||||
|
||||
// parsing exponent part
|
||||
T exp_part = 1.0;
|
||||
if (begin != end && has_exp) {
|
||||
int exp_sign = 1;
|
||||
if (*begin == '-') {
|
||||
exp_sign = -1;
|
||||
++begin;
|
||||
} else if (*begin == '+') {
|
||||
++begin;
|
||||
}
|
||||
|
||||
int e = 0;
|
||||
while (begin != end && *begin >= '0' && *begin <= '9') {
|
||||
e = e * 10 + *begin - '0';
|
||||
++begin;
|
||||
}
|
||||
|
||||
exp_part = pow10<T>(exp_sign * e);
|
||||
}
|
||||
|
||||
if (begin != end) {
|
||||
break;
|
||||
} else {
|
||||
return std::nullopt;
|
||||
}
|
||||
++begin;
|
||||
}
|
||||
}
|
||||
|
||||
// parsing exponent part
|
||||
T exp_part = 1.0;
|
||||
if (begin != end && has_exp) {
|
||||
int exp_sign = 1;
|
||||
if (*begin == '-') {
|
||||
exp_sign = -1;
|
||||
++begin;
|
||||
} else if (*begin == '+') {
|
||||
++begin;
|
||||
}
|
||||
|
||||
return sign * (int_part + frac_part) * exp_part;
|
||||
int e = 0;
|
||||
while (begin != end && *begin >= '0' && *begin <= '9') {
|
||||
e = e * 10 + *begin - '0';
|
||||
++begin;
|
||||
}
|
||||
|
||||
exp_part = pow10<T>(exp_sign * e);
|
||||
}
|
||||
|
||||
if (begin != end) {
|
||||
return std::nullopt;
|
||||
}
|
||||
|
||||
return sign * (int_part + frac_part) * exp_part;
|
||||
}
|
||||
|
||||
inline std::optional<short> from_char(char c) {
|
||||
if (c >= '0' && c <= '9') {
|
||||
return c - '0';
|
||||
}
|
||||
return std::nullopt;
|
||||
if (c >= '0' && c <= '9') {
|
||||
return c - '0';
|
||||
}
|
||||
return std::nullopt;
|
||||
}
|
||||
|
||||
#if defined(__clang__) || defined(__GNUC__) || defined(__GUNG__)
|
||||
@@ -130,38 +130,38 @@ inline std::optional<short> from_char(char c) {
|
||||
////////////////
|
||||
template <typename T>
|
||||
bool mul_overflow(T& result, T operand) {
|
||||
return __builtin_mul_overflow(result, operand, &result);
|
||||
return __builtin_mul_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool mul_overflow(int& result, int operand) {
|
||||
return __builtin_smul_overflow(result, operand, &result);
|
||||
return __builtin_smul_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool mul_overflow(long& result, long operand) {
|
||||
return __builtin_smull_overflow(result, operand, &result);
|
||||
return __builtin_smull_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool mul_overflow(long long& result, long long operand) {
|
||||
return __builtin_smulll_overflow(result, operand, &result);
|
||||
return __builtin_smulll_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool mul_overflow(unsigned int& result, unsigned int operand) {
|
||||
return __builtin_umul_overflow(result, operand, &result);
|
||||
return __builtin_umul_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool mul_overflow(unsigned long& result, unsigned long operand) {
|
||||
return __builtin_umull_overflow(result, operand, &result);
|
||||
return __builtin_umull_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool mul_overflow(unsigned long long& result,
|
||||
unsigned long long operand) {
|
||||
return __builtin_umulll_overflow(result, operand, &result);
|
||||
return __builtin_umulll_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
////////////////
|
||||
@@ -170,38 +170,38 @@ inline bool mul_overflow(unsigned long long& result,
|
||||
|
||||
template <typename T>
|
||||
inline bool add_overflow(T& result, T operand) {
|
||||
return __builtin_add_overflow(result, operand, &result);
|
||||
return __builtin_add_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool add_overflow(int& result, int operand) {
|
||||
return __builtin_sadd_overflow(result, operand, &result);
|
||||
return __builtin_sadd_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool add_overflow(long& result, long operand) {
|
||||
return __builtin_saddl_overflow(result, operand, &result);
|
||||
return __builtin_saddl_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool add_overflow(long long& result, long long operand) {
|
||||
return __builtin_saddll_overflow(result, operand, &result);
|
||||
return __builtin_saddll_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool add_overflow(unsigned int& result, unsigned int operand) {
|
||||
return __builtin_uadd_overflow(result, operand, &result);
|
||||
return __builtin_uadd_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool add_overflow(unsigned long& result, unsigned long operand) {
|
||||
return __builtin_uaddl_overflow(result, operand, &result);
|
||||
return __builtin_uaddl_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool add_overflow(unsigned long long& result,
|
||||
unsigned long long operand) {
|
||||
return __builtin_uaddll_overflow(result, operand, &result);
|
||||
return __builtin_uaddll_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
////////////////
|
||||
@@ -209,62 +209,61 @@ inline bool add_overflow(unsigned long long& result,
|
||||
////////////////
|
||||
template <typename T>
|
||||
inline bool sub_overflow(T& result, T operand) {
|
||||
return __builtin_sub_overflow(result, operand, &result);
|
||||
return __builtin_sub_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool sub_overflow(int& result, int operand) {
|
||||
return __builtin_ssub_overflow(result, operand, &result);
|
||||
return __builtin_ssub_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool sub_overflow(long& result, long operand) {
|
||||
return __builtin_ssubl_overflow(result, operand, &result);
|
||||
return __builtin_ssubl_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool sub_overflow(long long& result, long long operand) {
|
||||
return __builtin_ssubll_overflow(result, operand, &result);
|
||||
return __builtin_ssubll_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool sub_overflow(unsigned int& result, unsigned int operand) {
|
||||
return __builtin_usub_overflow(result, operand, &result);
|
||||
return __builtin_usub_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool sub_overflow(unsigned long& result, unsigned long operand) {
|
||||
return __builtin_usubl_overflow(result, operand, &result);
|
||||
return __builtin_usubl_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool sub_overflow(unsigned long long& result,
|
||||
unsigned long long operand) {
|
||||
return __builtin_usubll_overflow(result, operand, &result);
|
||||
return __builtin_usubll_overflow(result, operand, &result);
|
||||
}
|
||||
|
||||
template <typename T, typename F>
|
||||
bool shift_and_add_overflow(T& value, T digit, F add_last_digit_owerflow) {
|
||||
if (mul_overflow<T>(value, 10) ||
|
||||
add_last_digit_owerflow(value, digit)) {
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
if (mul_overflow<T>(value, 10) || add_last_digit_owerflow(value, digit)) {
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
#else
|
||||
|
||||
#warning "use clang or gcc!!!"
|
||||
template <typename T, typename U>
|
||||
bool shift_and_add_overflow(T& value, T digit, U is_negative) {
|
||||
digit = (is_negative) ? -digit : digit;
|
||||
T old_value = value;
|
||||
value = 10 * value + digit;
|
||||
digit = (is_negative) ? -digit : digit;
|
||||
T old_value = value;
|
||||
value = 10 * value + digit;
|
||||
|
||||
T expected_old_value = (value - digit) / 10;
|
||||
if (old_value != expected_old_value) {
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
T expected_old_value = (value - digit) / 10;
|
||||
if (old_value != expected_old_value) {
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
#endif
|
||||
@@ -272,35 +271,34 @@ bool shift_and_add_overflow(T& value, T digit, U is_negative) {
|
||||
template <typename T>
|
||||
std::enable_if_t<std::is_integral_v<T>, std::optional<T>> to_num(
|
||||
const char* begin, const char* end) {
|
||||
if (begin == end) {
|
||||
return std::nullopt;
|
||||
}
|
||||
bool is_negative = false;
|
||||
if constexpr (std::is_signed_v<T>) {
|
||||
is_negative = *begin == '-';
|
||||
if (is_negative) {
|
||||
++begin;
|
||||
}
|
||||
if (begin == end) {
|
||||
return std::nullopt;
|
||||
}
|
||||
bool is_negative = false;
|
||||
if constexpr (std::is_signed_v<T>) {
|
||||
is_negative = *begin == '-';
|
||||
if (is_negative) {
|
||||
++begin;
|
||||
}
|
||||
}
|
||||
|
||||
#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__)
|
||||
auto add_last_digit_owerflow =
|
||||
(is_negative) ? sub_overflow<T> : add_overflow<T>;
|
||||
auto add_last_digit_owerflow =
|
||||
(is_negative) ? sub_overflow<T> : add_overflow<T>;
|
||||
#else
|
||||
auto add_last_digit_owerflow = is_negative;
|
||||
auto add_last_digit_owerflow = is_negative;
|
||||
#endif
|
||||
|
||||
T value = 0;
|
||||
for (auto i = begin; i != end; ++i) {
|
||||
if (auto digit = from_char(*i);
|
||||
!digit ||
|
||||
shift_and_add_overflow<T>(value, digit.value(),
|
||||
add_last_digit_owerflow)) {
|
||||
return std::nullopt;
|
||||
}
|
||||
T value = 0;
|
||||
for (auto i = begin; i != end; ++i) {
|
||||
if (auto digit = from_char(*i);
|
||||
!digit || shift_and_add_overflow<T>(value, digit.value(),
|
||||
add_last_digit_owerflow)) {
|
||||
return std::nullopt;
|
||||
}
|
||||
}
|
||||
|
||||
return value;
|
||||
return value;
|
||||
}
|
||||
|
||||
////////////////
|
||||
@@ -310,7 +308,7 @@ std::enable_if_t<std::is_integral_v<T>, std::optional<T>> to_num(
|
||||
namespace error {
|
||||
template <typename T>
|
||||
struct unsupported_type {
|
||||
constexpr static bool value = false;
|
||||
constexpr static bool value = false;
|
||||
};
|
||||
} /* namespace */
|
||||
|
||||
@@ -320,51 +318,51 @@ std::enable_if_t<!std::is_integral_v<T> && !std::is_floating_point_v<T> &&
|
||||
!is_instance_of<T, std::variant>::value,
|
||||
bool>
|
||||
extract(const char*, const char*, T&) {
|
||||
static_assert(error::unsupported_type<T>::value,
|
||||
"Conversion for given type is not defined, an "
|
||||
"\'extract\' function needs to be defined!");
|
||||
static_assert(error::unsupported_type<T>::value,
|
||||
"Conversion for given type is not defined, an "
|
||||
"\'extract\' function needs to be defined!");
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
std::enable_if_t<std::is_integral_v<T> || std::is_floating_point_v<T>, bool>
|
||||
extract(const char* begin, const char* end, T& value) {
|
||||
auto optional_value = to_num<T>(begin, end);
|
||||
if (!optional_value) {
|
||||
return false;
|
||||
}
|
||||
value = optional_value.value();
|
||||
return true;
|
||||
auto optional_value = to_num<T>(begin, end);
|
||||
if (!optional_value) {
|
||||
return false;
|
||||
}
|
||||
value = optional_value.value();
|
||||
return true;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
std::enable_if_t<is_instance_of<T, std::optional>::value, bool> extract(
|
||||
const char* begin, const char* end, T& value) {
|
||||
typename T::value_type raw_value;
|
||||
if (extract(begin, end, raw_value)) {
|
||||
value = raw_value;
|
||||
} else {
|
||||
value = std::nullopt;
|
||||
}
|
||||
return true;
|
||||
typename T::value_type raw_value;
|
||||
if (extract(begin, end, raw_value)) {
|
||||
value = raw_value;
|
||||
} else {
|
||||
value = std::nullopt;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
template <typename T, size_t I>
|
||||
bool extract_variant(const char* begin, const char* end, T& value) {
|
||||
using IthType = std::variant_alternative_t<I, std::decay_t<T>>;
|
||||
IthType ithValue;
|
||||
if (extract<IthType>(begin, end, ithValue)) {
|
||||
value = ithValue;
|
||||
return true;
|
||||
} else if constexpr (I + 1 < std::variant_size_v<T>) {
|
||||
return extract_variant<T, I + 1>(begin, end, value);
|
||||
}
|
||||
return false;
|
||||
using IthType = std::variant_alternative_t<I, std::decay_t<T>>;
|
||||
IthType ithValue;
|
||||
if (extract<IthType>(begin, end, ithValue)) {
|
||||
value = ithValue;
|
||||
return true;
|
||||
} else if constexpr (I + 1 < std::variant_size_v<T>) {
|
||||
return extract_variant<T, I + 1>(begin, end, value);
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
std::enable_if_t<is_instance_of<T, std::variant>::value, bool> extract(
|
||||
const char* begin, const char* end, T& value) {
|
||||
return extract_variant<T, 0>(begin, end, value);
|
||||
return extract_variant<T, 0>(begin, end, value);
|
||||
}
|
||||
|
||||
////////////////
|
||||
@@ -373,38 +371,38 @@ std::enable_if_t<is_instance_of<T, std::variant>::value, bool> extract(
|
||||
|
||||
template <>
|
||||
inline bool extract(const char* begin, const char* end, bool& value) {
|
||||
if (end == begin + 1) {
|
||||
if (*begin == '1') {
|
||||
value = true;
|
||||
} else if (*begin == '0') {
|
||||
value = false;
|
||||
} else {
|
||||
return false;
|
||||
}
|
||||
if (end == begin + 1) {
|
||||
if (*begin == '1') {
|
||||
value = true;
|
||||
} else if (*begin == '0') {
|
||||
value = false;
|
||||
} else {
|
||||
size_t size = end - begin;
|
||||
if (size == 4 && strncmp(begin, "true", size) == 0) {
|
||||
value = true;
|
||||
} else if (size == 5 && strncmp(begin, "false", size) == 0) {
|
||||
value = false;
|
||||
} else {
|
||||
return false;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
} else {
|
||||
size_t size = end - begin;
|
||||
if (size == 4 && strncmp(begin, "true", size) == 0) {
|
||||
value = true;
|
||||
} else if (size == 5 && strncmp(begin, "false", size) == 0) {
|
||||
value = false;
|
||||
} else {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
return true;
|
||||
return true;
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool extract(const char* begin, const char* end, char& value) {
|
||||
value = *begin;
|
||||
return (end == begin + 1);
|
||||
value = *begin;
|
||||
return (end == begin + 1);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline bool extract(const char* begin, const char* end, std::string& value) {
|
||||
value = std::string(begin, end);
|
||||
return true;
|
||||
value = std::string(begin, end);
|
||||
return true;
|
||||
}
|
||||
|
||||
} /* ss */
|
||||
|
||||
@@ -12,13 +12,13 @@ namespace ss {
|
||||
|
||||
template <size_t N, typename T, typename... Ts>
|
||||
struct decayed_arg_n {
|
||||
static_assert(N - 1 != sizeof...(Ts), "index out of range");
|
||||
using type = typename decayed_arg_n<N - 1, Ts...>::type;
|
||||
static_assert(N - 1 != sizeof...(Ts), "index out of range");
|
||||
using type = typename decayed_arg_n<N - 1, Ts...>::type;
|
||||
};
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
struct decayed_arg_n<0, T, Ts...> {
|
||||
using type = std::decay_t<T>;
|
||||
using type = std::decay_t<T>;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
@@ -26,12 +26,12 @@ struct function_traits;
|
||||
|
||||
template <typename R, typename C, typename Arg>
|
||||
struct function_traits<std::function<R(C&, const Arg&) const>> {
|
||||
using arg_type = Arg;
|
||||
using arg_type = Arg;
|
||||
};
|
||||
|
||||
template <typename R, typename... Ts>
|
||||
struct function_traits<R(Ts...)> {
|
||||
using arg0 = typename decayed_arg_n<0, Ts...>::type;
|
||||
using arg0 = typename decayed_arg_n<0, Ts...>::type;
|
||||
};
|
||||
|
||||
template <typename R, typename... Ts>
|
||||
@@ -54,7 +54,7 @@ struct member_wrapper;
|
||||
|
||||
template <typename R, typename T>
|
||||
struct member_wrapper<R T::*> {
|
||||
using arg_type = typename function_traits<R>::arg0;
|
||||
using arg_type = typename function_traits<R>::arg0;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -62,19 +62,19 @@ struct member_wrapper<R T::*> {
|
||||
////////////////
|
||||
|
||||
#define INIT_HAS_METHOD(method) \
|
||||
template <typename T> \
|
||||
class has_m_##method { \
|
||||
template <typename C> \
|
||||
static std::true_type test(decltype(&C::method)); \
|
||||
template <typename T> \
|
||||
class has_m_##method { \
|
||||
template <typename C> \
|
||||
static std::true_type test(decltype(&C::method)); \
|
||||
\
|
||||
template <typename C> \
|
||||
static std::false_type test(...); \
|
||||
template <typename C> \
|
||||
static std::false_type test(...); \
|
||||
\
|
||||
public: \
|
||||
constexpr static bool value = decltype(test<T>(0))::value; \
|
||||
}; \
|
||||
public: \
|
||||
constexpr static bool value = decltype(test<T>(0))::value; \
|
||||
}; \
|
||||
\
|
||||
template <typename T> \
|
||||
constexpr bool has_m_##method##_t = has_m_##method<T>::value;
|
||||
template <typename T> \
|
||||
constexpr bool has_m_##method##_t = has_m_##method<T>::value;
|
||||
|
||||
} /* trait */
|
||||
|
||||
@@ -16,344 +16,328 @@ template <typename...>
|
||||
class composite;
|
||||
|
||||
class parser {
|
||||
public:
|
||||
parser(const std::string& file_name, const std::string& delimiter)
|
||||
: file_name_{file_name}, delim_{delimiter},
|
||||
file_{fopen(file_name_.c_str(), "rb")} {
|
||||
if (file_) {
|
||||
read_line();
|
||||
} else {
|
||||
set_error_file_not_open();
|
||||
eof_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
~parser() {
|
||||
fclose(file_);
|
||||
}
|
||||
|
||||
bool valid() const {
|
||||
return (error_mode_ == error_mode::String) ? string_error_.empty()
|
||||
: bool_error_ == false;
|
||||
}
|
||||
|
||||
void set_error_mode(error_mode mode) {
|
||||
error_mode_ = mode;
|
||||
converter_.set_error_mode(mode);
|
||||
}
|
||||
|
||||
const std::string& error_msg() const {
|
||||
return string_error_;
|
||||
}
|
||||
|
||||
bool eof() const {
|
||||
return eof_;
|
||||
}
|
||||
|
||||
bool ignore_next() {
|
||||
return buff_.read(file_);
|
||||
}
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
T get_object() {
|
||||
return to_object<T>(get_next<Ts...>());
|
||||
}
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
no_void_validator_tup_t<T, Ts...> get_next() {
|
||||
buff_.update();
|
||||
clear_error();
|
||||
if (eof_) {
|
||||
set_error_eof_reached();
|
||||
return {};
|
||||
}
|
||||
|
||||
split_input_ = converter_.split(buff_.get(), delim_);
|
||||
auto value = converter_.convert<T, Ts...>(split_input_);
|
||||
|
||||
if (!converter_.valid()) {
|
||||
set_error_invalid_conversion();
|
||||
}
|
||||
|
||||
read_line();
|
||||
return value;
|
||||
}
|
||||
|
||||
////////////////
|
||||
// composite conversion
|
||||
////////////////
|
||||
template <typename... Ts>
|
||||
class composite {
|
||||
public:
|
||||
parser(const std::string& file_name, const std::string& delimiter)
|
||||
: file_name_{file_name}, delim_{delimiter},
|
||||
file_{fopen(file_name_.c_str(), "rb")} {
|
||||
if (file_) {
|
||||
read_line();
|
||||
} else {
|
||||
set_error_file_not_open();
|
||||
eof_ = true;
|
||||
}
|
||||
composite(std::tuple<Ts...>&& values, parser& parser)
|
||||
: values_{std::move(values)}, parser_{parser} {
|
||||
}
|
||||
|
||||
~parser() {
|
||||
fclose(file_);
|
||||
}
|
||||
|
||||
bool valid() const {
|
||||
return (error_mode_ == error_mode::String)
|
||||
? string_error_.empty()
|
||||
: bool_error_ == false;
|
||||
}
|
||||
|
||||
void set_error_mode(error_mode mode) {
|
||||
error_mode_ = mode;
|
||||
converter_.set_error_mode(mode);
|
||||
}
|
||||
|
||||
const std::string& error_msg() const {
|
||||
return string_error_;
|
||||
}
|
||||
|
||||
bool eof() const {
|
||||
return eof_;
|
||||
}
|
||||
|
||||
bool ignore_next() {
|
||||
return buff_.read(file_);
|
||||
}
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
T get_object() {
|
||||
return to_object<T>(get_next<Ts...>());
|
||||
}
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
no_void_validator_tup_t<T, Ts...> get_next() {
|
||||
buff_.update();
|
||||
clear_error();
|
||||
if (eof_) {
|
||||
set_error_eof_reached();
|
||||
return {};
|
||||
}
|
||||
|
||||
split_input_ = converter_.split(buff_.get(), delim_);
|
||||
auto value = converter_.convert<T, Ts...>(split_input_);
|
||||
|
||||
if (!converter_.valid()) {
|
||||
set_error_invalid_conversion();
|
||||
}
|
||||
|
||||
read_line();
|
||||
return value;
|
||||
}
|
||||
|
||||
////////////////
|
||||
// composite conversion
|
||||
////////////////
|
||||
template <typename... Ts>
|
||||
class composite {
|
||||
public:
|
||||
composite(std::tuple<Ts...>&& values, parser& parser)
|
||||
: values_{std::move(values)}, parser_{parser} {
|
||||
}
|
||||
|
||||
// tries to convert the same line with a different output type
|
||||
// only if the previous conversion was not successful,
|
||||
// returns composite containing itself and the new output
|
||||
// as optional, additionally, if a parameter is passed, and
|
||||
// that parameter can be invoked using the converted value,
|
||||
// than it will be invoked in the case of a valid conversion
|
||||
template <typename... Us, typename Fun = None>
|
||||
composite<Ts..., std::optional<no_void_validator_tup_t<Us...>>>
|
||||
or_else(Fun&& fun = None{}) {
|
||||
using Value = no_void_validator_tup_t<Us...>;
|
||||
std::optional<Value> value;
|
||||
try_convert_and_invoke<Value, Us...>(value, fun);
|
||||
return composite_with(std::move(value));
|
||||
}
|
||||
|
||||
// same as or_else, but saves the result into a 'U' object
|
||||
// instead of a tuple
|
||||
template <typename U, typename... Us, typename Fun = None>
|
||||
composite<Ts..., std::optional<U>> or_else_object(
|
||||
Fun&& fun = None{}) {
|
||||
std::optional<U> value;
|
||||
try_convert_and_invoke<U, Us...>(value, fun);
|
||||
return composite_with(std::move(value));
|
||||
}
|
||||
|
||||
std::tuple<Ts...> values() {
|
||||
return values_;
|
||||
}
|
||||
|
||||
template <typename Fun>
|
||||
auto on_error(Fun&& fun) {
|
||||
if (!parser_.valid()) {
|
||||
if constexpr (std::is_invocable_v<Fun>) {
|
||||
fun();
|
||||
} else {
|
||||
std::invoke(std::forward<Fun>(fun),
|
||||
parser_.error_msg());
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
private:
|
||||
template <typename T>
|
||||
composite<Ts..., T> composite_with(T&& new_value) {
|
||||
auto merged_values =
|
||||
std::tuple_cat(std::move(values_),
|
||||
std::tuple{
|
||||
std::forward<T>(new_value)});
|
||||
return {std::move(merged_values), parser_};
|
||||
}
|
||||
|
||||
template <typename U, typename... Us, typename Fun = None>
|
||||
void try_convert_and_invoke(std::optional<U>& value,
|
||||
Fun&& fun) {
|
||||
if (!parser_.valid()) {
|
||||
std::optional<U> new_value;
|
||||
auto tuple_output = try_same<Us...>();
|
||||
if constexpr (!std::is_same_v<
|
||||
U, decltype(tuple_output)>) {
|
||||
new_value = to_object<U>(
|
||||
std::move(tuple_output));
|
||||
} else {
|
||||
new_value = std::move(tuple_output);
|
||||
}
|
||||
if (parser_.valid()) {
|
||||
value = std::move(new_value);
|
||||
parser_.try_invoke(*value,
|
||||
std::forward<Fun>(
|
||||
fun));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
template <typename U, typename... Us>
|
||||
no_void_validator_tup_t<U, Us...> try_same() {
|
||||
parser_.clear_error();
|
||||
auto value = parser_.converter_.convert<U, Us...>(
|
||||
parser_.split_input_);
|
||||
if (!parser_.converter_.valid()) {
|
||||
parser_.set_error_invalid_conversion();
|
||||
}
|
||||
return value;
|
||||
}
|
||||
|
||||
std::tuple<Ts...> values_;
|
||||
parser& parser_;
|
||||
};
|
||||
|
||||
// tries to convert a line and returns a composite which is
|
||||
// able to try additional conversions in case of failure
|
||||
template <typename... Ts, typename Fun = None>
|
||||
composite<std::optional<no_void_validator_tup_t<Ts...>>> try_next(
|
||||
// tries to convert the same line with a different output type
|
||||
// only if the previous conversion was not successful,
|
||||
// returns composite containing itself and the new output
|
||||
// as optional, additionally, if a parameter is passed, and
|
||||
// that parameter can be invoked using the converted value,
|
||||
// than it will be invoked in the case of a valid conversion
|
||||
template <typename... Us, typename Fun = None>
|
||||
composite<Ts..., std::optional<no_void_validator_tup_t<Us...>>> or_else(
|
||||
Fun&& fun = None{}) {
|
||||
std::optional<no_void_validator_tup_t<Ts...>> value;
|
||||
auto new_value = get_next<Ts...>();
|
||||
if (valid()) {
|
||||
value = std::move(new_value);
|
||||
try_invoke(*value, std::forward<Fun>(fun));
|
||||
using Value = no_void_validator_tup_t<Us...>;
|
||||
std::optional<Value> value;
|
||||
try_convert_and_invoke<Value, Us...>(value, fun);
|
||||
return composite_with(std::move(value));
|
||||
}
|
||||
|
||||
// same as or_else, but saves the result into a 'U' object
|
||||
// instead of a tuple
|
||||
template <typename U, typename... Us, typename Fun = None>
|
||||
composite<Ts..., std::optional<U>> or_else_object(Fun&& fun = None{}) {
|
||||
std::optional<U> value;
|
||||
try_convert_and_invoke<U, Us...>(value, fun);
|
||||
return composite_with(std::move(value));
|
||||
}
|
||||
|
||||
std::tuple<Ts...> values() {
|
||||
return values_;
|
||||
}
|
||||
|
||||
template <typename Fun>
|
||||
auto on_error(Fun&& fun) {
|
||||
if (!parser_.valid()) {
|
||||
if constexpr (std::is_invocable_v<Fun>) {
|
||||
fun();
|
||||
} else {
|
||||
std::invoke(std::forward<Fun>(fun), parser_.error_msg());
|
||||
}
|
||||
return {std::move(value), *this};
|
||||
};
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
private:
|
||||
template <typename...>
|
||||
friend class composite;
|
||||
|
||||
// tries to invoke the given function (see below), if the function
|
||||
// returns a value which can be used as a conditional, and it returns
|
||||
// false, the function sets an error, and allows the invoke of the
|
||||
// next possible conversion as if the validation of the current one
|
||||
// failed
|
||||
template <typename Arg, typename Fun = None>
|
||||
void try_invoke(Arg&& arg, Fun&& fun) {
|
||||
constexpr bool is_none =
|
||||
std::is_same_v<std::decay_t<Fun>, None>;
|
||||
if constexpr (!is_none) {
|
||||
using Ret = decltype(
|
||||
try_invoke_impl(arg, std::forward<Fun>(fun)));
|
||||
constexpr bool returns_void = std::is_same_v<Ret, void>;
|
||||
if constexpr (!returns_void) {
|
||||
if (!try_invoke_impl(arg,
|
||||
std::forward<Fun>(fun))) {
|
||||
set_error_failed_check();
|
||||
}
|
||||
} else {
|
||||
try_invoke_impl(arg, std::forward<Fun>(fun));
|
||||
}
|
||||
}
|
||||
template <typename T>
|
||||
composite<Ts..., T> composite_with(T&& new_value) {
|
||||
auto merged_values =
|
||||
std::tuple_cat(std::move(values_),
|
||||
std::tuple{std::forward<T>(new_value)});
|
||||
return {std::move(merged_values), parser_};
|
||||
}
|
||||
|
||||
// tries to invoke the function if not None
|
||||
// it first tries to invoke the function without arguments,
|
||||
// than with one argument if the function accepts the whole tuple
|
||||
// as an argument, and finally tries to invoke it with the tuple
|
||||
// laid out as a parameter pack
|
||||
template <typename Arg, typename Fun = None>
|
||||
auto try_invoke_impl(Arg&& arg, Fun&& fun) {
|
||||
constexpr bool is_none =
|
||||
std::is_same_v<std::decay_t<Fun>, None>;
|
||||
if constexpr (!is_none) {
|
||||
if constexpr (std::is_invocable_v<Fun>) {
|
||||
return fun();
|
||||
} else if constexpr (std::is_invocable_v<Fun, Arg>) {
|
||||
return std::invoke(std::forward<Fun>(fun),
|
||||
std::forward<Arg>(arg));
|
||||
} else {
|
||||
return std::apply(std::forward<Fun>(fun),
|
||||
std::forward<Arg>(arg));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
////////////////
|
||||
// line reading
|
||||
////////////////
|
||||
|
||||
class buffer {
|
||||
char* buffer_{nullptr};
|
||||
char* new_buffer_{nullptr};
|
||||
size_t size_{0};
|
||||
|
||||
public:
|
||||
~buffer() {
|
||||
free(buffer_);
|
||||
free(new_buffer_);
|
||||
}
|
||||
|
||||
bool read(FILE* file) {
|
||||
ssize_t size = getline(&new_buffer_, &size_, file);
|
||||
size_t string_end = size - 1;
|
||||
|
||||
if (size == -1) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (size >= 2 && new_buffer_[size - 2] == '\r') {
|
||||
string_end--;
|
||||
}
|
||||
|
||||
new_buffer_[string_end] = '\0';
|
||||
return true;
|
||||
}
|
||||
|
||||
const char* get() const {
|
||||
return buffer_;
|
||||
}
|
||||
|
||||
void update() {
|
||||
std::swap(buffer_, new_buffer_);
|
||||
}
|
||||
};
|
||||
|
||||
void read_line() {
|
||||
eof_ = !buff_.read(file_);
|
||||
++line_number_;
|
||||
}
|
||||
|
||||
////////////////
|
||||
// error
|
||||
////////////////
|
||||
|
||||
void clear_error() {
|
||||
string_error_.clear();
|
||||
bool_error_ = false;
|
||||
}
|
||||
|
||||
void set_error_failed_check() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_)
|
||||
.append(" failed check.");
|
||||
template <typename U, typename... Us, typename Fun = None>
|
||||
void try_convert_and_invoke(std::optional<U>& value, Fun&& fun) {
|
||||
if (!parser_.valid()) {
|
||||
std::optional<U> new_value;
|
||||
auto tuple_output = try_same<Us...>();
|
||||
if constexpr (!std::is_same_v<U, decltype(tuple_output)>) {
|
||||
new_value = to_object<U>(std::move(tuple_output));
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
new_value = std::move(tuple_output);
|
||||
}
|
||||
if (parser_.valid()) {
|
||||
value = std::move(new_value);
|
||||
parser_.try_invoke(*value, std::forward<Fun>(fun));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_file_not_open() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_)
|
||||
.append(" could not be not open.");
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
template <typename U, typename... Us>
|
||||
no_void_validator_tup_t<U, Us...> try_same() {
|
||||
parser_.clear_error();
|
||||
auto value =
|
||||
parser_.converter_.convert<U, Us...>(parser_.split_input_);
|
||||
if (!parser_.converter_.valid()) {
|
||||
parser_.set_error_invalid_conversion();
|
||||
}
|
||||
return value;
|
||||
}
|
||||
|
||||
void set_error_eof_reached() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_)
|
||||
.append(" reached end of file.");
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
std::tuple<Ts...> values_;
|
||||
parser& parser_;
|
||||
};
|
||||
|
||||
// tries to convert a line and returns a composite which is
|
||||
// able to try additional conversions in case of failure
|
||||
template <typename... Ts, typename Fun = None>
|
||||
composite<std::optional<no_void_validator_tup_t<Ts...>>> try_next(
|
||||
Fun&& fun = None{}) {
|
||||
std::optional<no_void_validator_tup_t<Ts...>> value;
|
||||
auto new_value = get_next<Ts...>();
|
||||
if (valid()) {
|
||||
value = std::move(new_value);
|
||||
try_invoke(*value, std::forward<Fun>(fun));
|
||||
}
|
||||
return {std::move(value), *this};
|
||||
};
|
||||
|
||||
private:
|
||||
template <typename...>
|
||||
friend class composite;
|
||||
|
||||
// tries to invoke the given function (see below), if the function
|
||||
// returns a value which can be used as a conditional, and it returns
|
||||
// false, the function sets an error, and allows the invoke of the
|
||||
// next possible conversion as if the validation of the current one
|
||||
// failed
|
||||
template <typename Arg, typename Fun = None>
|
||||
void try_invoke(Arg&& arg, Fun&& fun) {
|
||||
constexpr bool is_none = std::is_same_v<std::decay_t<Fun>, None>;
|
||||
if constexpr (!is_none) {
|
||||
using Ret = decltype(try_invoke_impl(arg, std::forward<Fun>(fun)));
|
||||
constexpr bool returns_void = std::is_same_v<Ret, void>;
|
||||
if constexpr (!returns_void) {
|
||||
if (!try_invoke_impl(arg, std::forward<Fun>(fun))) {
|
||||
set_error_failed_check();
|
||||
}
|
||||
} else {
|
||||
try_invoke_impl(arg, std::forward<Fun>(fun));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// tries to invoke the function if not None
|
||||
// it first tries to invoke the function without arguments,
|
||||
// than with one argument if the function accepts the whole tuple
|
||||
// as an argument, and finally tries to invoke it with the tuple
|
||||
// laid out as a parameter pack
|
||||
template <typename Arg, typename Fun = None>
|
||||
auto try_invoke_impl(Arg&& arg, Fun&& fun) {
|
||||
constexpr bool is_none = std::is_same_v<std::decay_t<Fun>, None>;
|
||||
if constexpr (!is_none) {
|
||||
if constexpr (std::is_invocable_v<Fun>) {
|
||||
return fun();
|
||||
} else if constexpr (std::is_invocable_v<Fun, Arg>) {
|
||||
return std::invoke(std::forward<Fun>(fun),
|
||||
std::forward<Arg>(arg));
|
||||
} else {
|
||||
return std::apply(std::forward<Fun>(fun),
|
||||
std::forward<Arg>(arg));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
////////////////
|
||||
// line reading
|
||||
////////////////
|
||||
|
||||
class buffer {
|
||||
char* buffer_{nullptr};
|
||||
char* new_buffer_{nullptr};
|
||||
size_t size_{0};
|
||||
|
||||
public:
|
||||
~buffer() {
|
||||
free(buffer_);
|
||||
free(new_buffer_);
|
||||
}
|
||||
|
||||
void set_error_invalid_conversion() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_)
|
||||
.append(" ")
|
||||
.append(std::to_string(line_number_))
|
||||
.append(": ")
|
||||
.append(converter_.error_msg())
|
||||
.append(": \"")
|
||||
.append(buff_.get())
|
||||
.append("\"");
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
bool read(FILE* file) {
|
||||
ssize_t size = getline(&new_buffer_, &size_, file);
|
||||
size_t string_end = size - 1;
|
||||
|
||||
if (size == -1) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (size >= 2 && new_buffer_[size - 2] == '\r') {
|
||||
string_end--;
|
||||
}
|
||||
|
||||
new_buffer_[string_end] = '\0';
|
||||
return true;
|
||||
}
|
||||
|
||||
////////////////
|
||||
// members
|
||||
////////////////
|
||||
const char* get() const {
|
||||
return buffer_;
|
||||
}
|
||||
|
||||
const std::string file_name_;
|
||||
const std::string delim_;
|
||||
std::string string_error_;
|
||||
bool bool_error_;
|
||||
error_mode error_mode_{error_mode::String};
|
||||
converter converter_;
|
||||
converter::split_input split_input_;
|
||||
FILE* file_{nullptr};
|
||||
buffer buff_;
|
||||
size_t line_number_{0};
|
||||
bool eof_{false};
|
||||
void update() {
|
||||
std::swap(buffer_, new_buffer_);
|
||||
}
|
||||
};
|
||||
|
||||
void read_line() {
|
||||
eof_ = !buff_.read(file_);
|
||||
++line_number_;
|
||||
}
|
||||
|
||||
////////////////
|
||||
// error
|
||||
////////////////
|
||||
|
||||
void clear_error() {
|
||||
string_error_.clear();
|
||||
bool_error_ = false;
|
||||
}
|
||||
|
||||
void set_error_failed_check() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_).append(" failed check.");
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_file_not_open() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_).append(" could not be not open.");
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_eof_reached() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_).append(" reached end of file.");
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
void set_error_invalid_conversion() {
|
||||
if (error_mode_ == error_mode::String) {
|
||||
string_error_.append(file_name_)
|
||||
.append(" ")
|
||||
.append(std::to_string(line_number_))
|
||||
.append(": ")
|
||||
.append(converter_.error_msg())
|
||||
.append(": \"")
|
||||
.append(buff_.get())
|
||||
.append("\"");
|
||||
} else {
|
||||
bool_error_ = true;
|
||||
}
|
||||
}
|
||||
|
||||
////////////////
|
||||
// members
|
||||
////////////////
|
||||
|
||||
const std::string file_name_;
|
||||
const std::string delim_;
|
||||
std::string string_error_;
|
||||
bool bool_error_;
|
||||
error_mode error_mode_{error_mode::String};
|
||||
converter converter_;
|
||||
converter::split_input split_input_;
|
||||
FILE* file_{nullptr};
|
||||
buffer buff_;
|
||||
size_t line_number_{0};
|
||||
bool eof_{false};
|
||||
};
|
||||
|
||||
} /* ss */
|
||||
|
||||
@@ -8,23 +8,23 @@ namespace ss {
|
||||
|
||||
template <typename T, auto... Values>
|
||||
struct ax {
|
||||
private:
|
||||
template <auto X, auto... Xs>
|
||||
bool ss_valid_impl(const T& x) const {
|
||||
if constexpr (sizeof...(Xs) != 0) {
|
||||
return x != X && ss_valid_impl<Xs...>(x);
|
||||
}
|
||||
return x != X;
|
||||
private:
|
||||
template <auto X, auto... Xs>
|
||||
bool ss_valid_impl(const T& x) const {
|
||||
if constexpr (sizeof...(Xs) != 0) {
|
||||
return x != X && ss_valid_impl<Xs...>(x);
|
||||
}
|
||||
return x != X;
|
||||
}
|
||||
|
||||
public:
|
||||
bool ss_valid(const T& value) const {
|
||||
return ss_valid_impl<Values...>(value);
|
||||
}
|
||||
public:
|
||||
bool ss_valid(const T& value) const {
|
||||
return ss_valid_impl<Values...>(value);
|
||||
}
|
||||
|
||||
const char* error() const {
|
||||
return "value excluded";
|
||||
}
|
||||
const char* error() const {
|
||||
return "value excluded";
|
||||
}
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -33,23 +33,23 @@ struct ax {
|
||||
|
||||
template <typename T, auto... Values>
|
||||
struct nx {
|
||||
private:
|
||||
template <auto X, auto... Xs>
|
||||
bool ss_valid_impl(const T& x) const {
|
||||
if constexpr (sizeof...(Xs) != 0) {
|
||||
return x == X || ss_valid_impl<Xs...>(x);
|
||||
}
|
||||
return x == X;
|
||||
private:
|
||||
template <auto X, auto... Xs>
|
||||
bool ss_valid_impl(const T& x) const {
|
||||
if constexpr (sizeof...(Xs) != 0) {
|
||||
return x == X || ss_valid_impl<Xs...>(x);
|
||||
}
|
||||
return x == X;
|
||||
}
|
||||
|
||||
public:
|
||||
bool ss_valid(const T& value) const {
|
||||
return ss_valid_impl<Values...>(value);
|
||||
}
|
||||
public:
|
||||
bool ss_valid(const T& value) const {
|
||||
return ss_valid_impl<Values...>(value);
|
||||
}
|
||||
|
||||
const char* error() const {
|
||||
return "value excluded";
|
||||
}
|
||||
const char* error() const {
|
||||
return "value excluded";
|
||||
}
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -58,13 +58,13 @@ struct nx {
|
||||
|
||||
template <typename T, auto Min, auto Max>
|
||||
struct ir {
|
||||
bool ss_valid(const T& value) const {
|
||||
return value >= Min && value <= Max;
|
||||
}
|
||||
bool ss_valid(const T& value) const {
|
||||
return value >= Min && value <= Max;
|
||||
}
|
||||
|
||||
const char* error() const {
|
||||
return "out of range";
|
||||
}
|
||||
const char* error() const {
|
||||
return "out of range";
|
||||
}
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -73,13 +73,13 @@ struct ir {
|
||||
|
||||
template <typename T, auto Min, auto Max>
|
||||
struct oor {
|
||||
bool ss_valid(const T& value) const {
|
||||
return value < Min || value > Max;
|
||||
}
|
||||
bool ss_valid(const T& value) const {
|
||||
return value < Min || value > Max;
|
||||
}
|
||||
|
||||
const char* error() const {
|
||||
return "in restricted range";
|
||||
}
|
||||
const char* error() const {
|
||||
return "in restricted range";
|
||||
}
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -88,13 +88,13 @@ struct oor {
|
||||
|
||||
template <typename T>
|
||||
struct ne {
|
||||
bool ss_valid(const T& value) const {
|
||||
return !value.empty();
|
||||
}
|
||||
bool ss_valid(const T& value) const {
|
||||
return !value.empty();
|
||||
}
|
||||
|
||||
const char* error() const {
|
||||
return "empty field";
|
||||
}
|
||||
const char* error() const {
|
||||
return "empty field";
|
||||
}
|
||||
};
|
||||
|
||||
} /* ss */
|
||||
|
||||
@@ -14,12 +14,12 @@ struct tup_cat;
|
||||
|
||||
template <typename... Ts, typename... Us>
|
||||
struct tup_cat<std::tuple<Ts...>, std::tuple<Us...>> {
|
||||
using type = std::tuple<Ts..., Us...>;
|
||||
using type = std::tuple<Ts..., Us...>;
|
||||
};
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
struct tup_cat<T, std::tuple<Ts...>> {
|
||||
using type = std::tuple<T, Ts...>;
|
||||
using type = std::tuple<T, Ts...>;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
@@ -34,14 +34,14 @@ struct left_of_impl;
|
||||
|
||||
template <size_t N, typename T, typename... Ts>
|
||||
struct left_of_impl {
|
||||
static_assert(N < 128, "recursion limit reached");
|
||||
static_assert(N != 0, "cannot take the whole tuple");
|
||||
using type = tup_cat_t<T, typename left_of_impl<N - 1, Ts...>::type>;
|
||||
static_assert(N < 128, "recursion limit reached");
|
||||
static_assert(N != 0, "cannot take the whole tuple");
|
||||
using type = tup_cat_t<T, typename left_of_impl<N - 1, Ts...>::type>;
|
||||
};
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
struct left_of_impl<0, T, Ts...> {
|
||||
using type = std::tuple<T>;
|
||||
using type = std::tuple<T>;
|
||||
};
|
||||
|
||||
template <size_t N, typename... Ts>
|
||||
@@ -62,12 +62,12 @@ struct right_of_impl;
|
||||
|
||||
template <size_t N, typename T, typename... Ts>
|
||||
struct right_of_impl {
|
||||
using type = typename right_of_impl<N - 1, Ts...>::type;
|
||||
using type = typename right_of_impl<N - 1, Ts...>::type;
|
||||
};
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
struct right_of_impl<0, T, Ts...> {
|
||||
using type = std::tuple<T, Ts...>;
|
||||
using type = std::tuple<T, Ts...>;
|
||||
};
|
||||
|
||||
template <size_t N, typename... Ts>
|
||||
@@ -88,19 +88,19 @@ struct apply_trait;
|
||||
|
||||
template <template <typename...> class Trait, typename T, typename... Ts>
|
||||
struct apply_trait<Trait, std::tuple<T, Ts...>> {
|
||||
using type =
|
||||
tup_cat_t<typename Trait<T>::type,
|
||||
typename apply_trait<Trait, std::tuple<Ts...>>::type>;
|
||||
using type =
|
||||
tup_cat_t<typename Trait<T>::type,
|
||||
typename apply_trait<Trait, std::tuple<Ts...>>::type>;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename T>
|
||||
struct apply_trait {
|
||||
using type = std::tuple<typename Trait<T>::type>;
|
||||
using type = std::tuple<typename Trait<T>::type>;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename T>
|
||||
struct apply_trait<Trait, std::tuple<T>> {
|
||||
using type = std::tuple<typename Trait<T>::type>;
|
||||
using type = std::tuple<typename Trait<T>::type>;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -113,12 +113,12 @@ struct optional_trait;
|
||||
|
||||
template <typename U>
|
||||
struct optional_trait<std::true_type, U> {
|
||||
using type = U;
|
||||
using type = U;
|
||||
};
|
||||
|
||||
template <typename U>
|
||||
struct optional_trait<std::false_type, U> {
|
||||
using type = std::false_type;
|
||||
using type = std::false_type;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename T>
|
||||
@@ -126,21 +126,21 @@ struct apply_optional_trait;
|
||||
|
||||
template <template <typename...> class Trait, typename T, typename... Ts>
|
||||
struct apply_optional_trait<Trait, std::tuple<T, Ts...>> {
|
||||
using type = tup_cat_t<
|
||||
typename optional_trait<typename Trait<T>::type, T>::type,
|
||||
typename apply_optional_trait<Trait, std::tuple<Ts...>>::type>;
|
||||
using type = tup_cat_t<
|
||||
typename optional_trait<typename Trait<T>::type, T>::type,
|
||||
typename apply_optional_trait<Trait, std::tuple<Ts...>>::type>;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename T>
|
||||
struct apply_optional_trait {
|
||||
using type = std::tuple<
|
||||
typename optional_trait<typename Trait<T>::type, T>::type>;
|
||||
using type =
|
||||
std::tuple<typename optional_trait<typename Trait<T>::type, T>::type>;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename T>
|
||||
struct apply_optional_trait<Trait, std::tuple<T>> {
|
||||
using type = std::tuple<
|
||||
typename optional_trait<typename Trait<T>::type, T>::type>;
|
||||
using type =
|
||||
std::tuple<typename optional_trait<typename Trait<T>::type, T>::type>;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -149,37 +149,37 @@ struct apply_optional_trait<Trait, std::tuple<T>> {
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
struct remove_false {
|
||||
using type = tup_cat_t<T, typename remove_false<Ts...>::type>;
|
||||
using type = tup_cat_t<T, typename remove_false<Ts...>::type>;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
struct remove_false<std::false_type, Ts...> {
|
||||
using type = typename remove_false<Ts...>::type;
|
||||
using type = typename remove_false<Ts...>::type;
|
||||
};
|
||||
|
||||
template <typename T, typename... Ts>
|
||||
struct remove_false<std::tuple<T, Ts...>> {
|
||||
using type = tup_cat_t<T, typename remove_false<Ts...>::type>;
|
||||
using type = tup_cat_t<T, typename remove_false<Ts...>::type>;
|
||||
};
|
||||
|
||||
template <typename... Ts>
|
||||
struct remove_false<std::tuple<std::false_type, Ts...>> {
|
||||
using type = typename remove_false<Ts...>::type;
|
||||
using type = typename remove_false<Ts...>::type;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
struct remove_false<T> {
|
||||
using type = std::tuple<T>;
|
||||
using type = std::tuple<T>;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
struct remove_false<std::tuple<T>> {
|
||||
using type = std::tuple<T>;
|
||||
using type = std::tuple<T>;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct remove_false<std::false_type> {
|
||||
using type = std::tuple<>;
|
||||
using type = std::tuple<>;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -188,8 +188,8 @@ struct remove_false<std::false_type> {
|
||||
|
||||
template <template <typename...> class Trait>
|
||||
struct negate_impl {
|
||||
template <typename... Ts>
|
||||
using type = std::integral_constant<bool, !Trait<Ts...>::value>;
|
||||
template <typename... Ts>
|
||||
using type = std::integral_constant<bool, !Trait<Ts...>::value>;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -198,14 +198,14 @@ struct negate_impl {
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct filter_if {
|
||||
using type = typename filter_if<Trait, std::tuple<Ts...>>::type;
|
||||
using type = typename filter_if<Trait, std::tuple<Ts...>>::type;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct filter_if<Trait, std::tuple<Ts...>> {
|
||||
|
||||
using type = typename remove_false<typename apply_optional_trait<
|
||||
Trait, std::tuple<Ts...>>::type>::type;
|
||||
using type = typename remove_false<
|
||||
typename apply_optional_trait<Trait, std::tuple<Ts...>>::type>::type;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
@@ -213,14 +213,14 @@ using filter_if_t = typename filter_if<Trait, Ts...>::type;
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct filter_not {
|
||||
using type = typename filter_not<Trait, std::tuple<Ts...>>::type;
|
||||
using type = typename filter_not<Trait, std::tuple<Ts...>>::type;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct filter_not<Trait, std::tuple<Ts...>> {
|
||||
|
||||
using type = typename remove_false<typename apply_optional_trait<
|
||||
negate_impl<Trait>::template type, std::tuple<Ts...>>::type>::type;
|
||||
using type = typename remove_false<typename apply_optional_trait<
|
||||
negate_impl<Trait>::template type, std::tuple<Ts...>>::type>::type;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
@@ -235,13 +235,13 @@ struct count;
|
||||
|
||||
template <template <typename...> class Trait, typename T, typename... Ts>
|
||||
struct count {
|
||||
static constexpr size_t size =
|
||||
std::tuple_size<filter_if_t<Trait, T, Ts...>>::value;
|
||||
static constexpr size_t size =
|
||||
std::tuple_size<filter_if_t<Trait, T, Ts...>>::value;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename T>
|
||||
struct count<Trait, T> {
|
||||
static constexpr size_t size = Trait<T>::value;
|
||||
static constexpr size_t size = Trait<T>::value;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -253,13 +253,13 @@ struct count;
|
||||
|
||||
template <template <typename...> class Trait, typename T, typename... Ts>
|
||||
struct count_not {
|
||||
static constexpr size_t size =
|
||||
std::tuple_size<filter_not_t<Trait, T, Ts...>>::value;
|
||||
static constexpr size_t size =
|
||||
std::tuple_size<filter_not_t<Trait, T, Ts...>>::value;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename T>
|
||||
struct count_not<Trait, T> {
|
||||
static constexpr size_t size = !Trait<T>::value;
|
||||
static constexpr size_t size = !Trait<T>::value;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -268,14 +268,12 @@ struct count_not<Trait, T> {
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct all_of {
|
||||
static constexpr bool value =
|
||||
count<Trait, Ts...>::size == sizeof...(Ts);
|
||||
static constexpr bool value = count<Trait, Ts...>::size == sizeof...(Ts);
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct all_of<Trait, std::tuple<Ts...>> {
|
||||
static constexpr bool value =
|
||||
count<Trait, Ts...>::size == sizeof...(Ts);
|
||||
static constexpr bool value = count<Trait, Ts...>::size == sizeof...(Ts);
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -284,14 +282,14 @@ struct all_of<Trait, std::tuple<Ts...>> {
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct any_of {
|
||||
static_assert(sizeof...(Ts) > 0);
|
||||
static constexpr bool value = count<Trait, Ts...>::size > 0;
|
||||
static_assert(sizeof...(Ts) > 0);
|
||||
static constexpr bool value = count<Trait, Ts...>::size > 0;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct any_of<Trait, std::tuple<Ts...>> {
|
||||
static_assert(sizeof...(Ts) > 0);
|
||||
static constexpr bool value = count<Trait, Ts...>::size > 0;
|
||||
static_assert(sizeof...(Ts) > 0);
|
||||
static constexpr bool value = count<Trait, Ts...>::size > 0;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -300,12 +298,12 @@ struct any_of<Trait, std::tuple<Ts...>> {
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct none_of {
|
||||
static constexpr bool value = count<Trait, Ts...>::size == 0;
|
||||
static constexpr bool value = count<Trait, Ts...>::size == 0;
|
||||
};
|
||||
|
||||
template <template <typename...> class Trait, typename... Ts>
|
||||
struct none_of<Trait, std::tuple<Ts...>> {
|
||||
static constexpr bool value = count<Trait, Ts...>::size == 0;
|
||||
static constexpr bool value = count<Trait, Ts...>::size == 0;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -314,12 +312,12 @@ struct none_of<Trait, std::tuple<Ts...>> {
|
||||
|
||||
template <typename T, template <typename...> class Template>
|
||||
struct is_instance_of {
|
||||
constexpr static bool value = false;
|
||||
constexpr static bool value = false;
|
||||
};
|
||||
|
||||
template <typename ...Ts, template <typename...> class Template>
|
||||
template <typename... Ts, template <typename...> class Template>
|
||||
struct is_instance_of<Template<Ts...>, Template> {
|
||||
constexpr static bool value = true;
|
||||
constexpr static bool value = true;
|
||||
};
|
||||
|
||||
////////////////
|
||||
@@ -328,14 +326,14 @@ struct is_instance_of<Template<Ts...>, Template> {
|
||||
|
||||
template <class S, std::size_t... Is, class Tup>
|
||||
S to_object(std::index_sequence<Is...>, Tup&& tup) {
|
||||
return {std::get<Is>(std::forward<Tup>(tup))...};
|
||||
return {std::get<Is>(std::forward<Tup>(tup))...};
|
||||
}
|
||||
|
||||
template <class S, class Tup>
|
||||
S to_object(Tup&& tup) {
|
||||
using T = std::remove_reference_t<Tup>;
|
||||
return to_object<S>(std::make_index_sequence<std::tuple_size<T>{}>{},
|
||||
std::forward<Tup>(tup));
|
||||
using T = std::remove_reference_t<Tup>;
|
||||
return to_object<S>(std::make_index_sequence<std::tuple_size<T>{}>{},
|
||||
std::forward<Tup>(tup));
|
||||
}
|
||||
|
||||
} /* trait */
|
||||
|
||||
Reference in New Issue
Block a user