mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 03:27:39 +00:00
38921dc46b
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.
28 lines
618 B
C++
28 lines
618 B
C++
// -*-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
|
|
#ifndef CTL_OUTPUT_ITERATOR_TAG_H_
|
|
#define CTL_OUTPUT_ITERATOR_TAG_H_
|
|
|
|
namespace ctl {
|
|
|
|
struct input_iterator_tag
|
|
{};
|
|
|
|
struct output_iterator_tag
|
|
{};
|
|
|
|
struct forward_iterator_tag : public input_iterator_tag
|
|
{};
|
|
|
|
struct bidirectional_iterator_tag : public forward_iterator_tag
|
|
{};
|
|
|
|
struct random_access_iterator_tag : public bidirectional_iterator_tag
|
|
{};
|
|
|
|
struct contiguous_iterator_tag : public random_access_iterator_tag
|
|
{};
|
|
|
|
} // namespace ctl
|
|
|
|
#endif // CTL_OUTPUT_ITERATOR_TAG_H_
|