2024-06-29 02:07:35 +00:00
|
|
|
// -*-mode:c++;indent-tabs-mode:nil;c-basic-offset:4;tab-width:8;coding:utf-8-*-
|
|
|
|
|
// vi: set et ft=cpp ts=4 sts=4 sw=4 fenc=utf-8 :vi
|
Introduce more CTL content
This change introduces accumulate, addressof, advance, all_of, distance,
array, enable_if, allocator_traits, back_inserter, bad_alloc, is_signed,
any_of, copy, exception, fill, fill_n, is_same, is_same_v, out_of_range,
lexicographical_compare, is_integral, uninitialized_fill_n, is_unsigned,
numeric_limits, uninitialized_fill, iterator_traits, move_backward, min,
max, iterator_tag, move_iterator, reverse_iterator, uninitialized_move_n
This change experiments with rewriting the ctl::vector class to make the
CTL design more similar to the STL. So far it has not slowed things down
to have 42 #include lines rather than 2, since it's still almost nothing
compared to LLVM's code. In fact the closer we can flirt with being just
like libcxx, the better chance we might have of discovering exactly what
makes it so slow to compile. It would be an enormous discovery if we can
find one simple trick to solving the issue there instead.
This also fixes a bug in `ctl::string(const string &s)` when `s` is big.
2024-06-28 05:18:55 +00:00
|
|
|
#ifndef CTL_ENABLE_IF_H_
|
|
|
|
|
#define CTL_ENABLE_IF_H_
|
|
|
|
|
|
|
|
|
|
namespace ctl {
|
|
|
|
|
|
|
|
|
|
template<bool B, class T = void>
|
|
|
|
|
struct enable_if
|
|
|
|
|
{};
|
|
|
|
|
|
|
|
|
|
template<class T>
|
|
|
|
|
struct enable_if<true, T>
|
|
|
|
|
{
|
|
|
|
|
typedef T type;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
template<bool B, class T = void>
|
|
|
|
|
using enable_if_t = typename enable_if<B, T>::type;
|
|
|
|
|
|
|
|
|
|
} // namespace ctl
|
|
|
|
|
|
|
|
|
|
#endif // CTL_ENABLE_IF_H_
|