From 669ebea02fae91b78e881a807e02c1917daffd33 Mon Sep 17 00:00:00 2001 From: "Keith A. Lewis" Date: Fri, 31 May 2024 05:43:25 -0400 Subject: [PATCH] input constexpr --- fms_iterable.h | 57 ++++++++++++++++++++++++++++---------------------- 1 file changed, 32 insertions(+), 25 deletions(-) diff --git a/fms_iterable.h b/fms_iterable.h index c2b03a9..7a0caf2 100644 --- a/fms_iterable.h +++ b/fms_iterable.h @@ -11,16 +11,14 @@ namespace fms::iterable { - template + template concept input = requires(I i) { //typename I::iterator_concept; typename I::iterator_category; typename I::value_type; { i.operator bool() } -> std::same_as; - { i.operator *() } -> std::convertible_to; + { i.operator *() } -> std::convertible_to; { i.operator++() } -> std::same_as; - //{ i.swap(i) } -> std::same_as; - // { ++i } -> IsReferenceToBase; }; template @@ -42,7 +40,7 @@ namespace fms::iterable { // All elements equal. template - inline bool equal(I i, J j) noexcept + constexpr bool equal(I i, J j) noexcept { while (i && j) { if (*i != *j) { @@ -57,8 +55,12 @@ namespace fms::iterable { // length(i, length(j)) = length(i) + length(j) template - inline std::size_t length(I i, std::size_t n = 0) noexcept + constexpr std::size_t length(I i, std::size_t n = 0) noexcept { + if constexpr (has_end) { + return n + std::distance(i, i.end()); + } + while (i) { ++i; ++n; @@ -69,11 +71,18 @@ namespace fms::iterable { // Drop at most n from the beginning. template - inline I drop(I i, std::size_t n) noexcept + constexpr I drop(I i, std::size_t n) noexcept { - while (i && n) { - ++i; - --n; + using category = typename I::iterator_category; + + if constexpr (std::is_base_of_v) { + std::advance(i, std::min(n, length(i))); + } + else { + while (i && n) { + ++i; + --n; + } } return i; @@ -81,7 +90,7 @@ namespace fms::iterable { // Last element of iterable. template - inline I back(I i) + constexpr I back(I i) { if constexpr (has_back) { return i.back(); @@ -98,7 +107,7 @@ namespace fms::iterable { // For use with STL template - inline I begin(I i) + constexpr I begin(I i) { if constexpr (has_begin) { return i.begin(); @@ -108,7 +117,7 @@ namespace fms::iterable { } // ++back(i) template - inline I end(I i) + constexpr I end(I i) { if constexpr (has_end) { return i.end(); @@ -121,7 +130,7 @@ namespace fms::iterable { return i; } - /* + /* TODO: use when deducing this supported struct add_postfix_increment { template auto operator++(this Self && self, int) { @@ -140,36 +149,36 @@ namespace fms::iterable { using iterator_category = std::input_iterator_tag; using value_type = T; - interval(I b, I e) + constexpr interval(I b, I e) : b(b), e(e) { } - auto begin() const + constexpr auto begin() const { return b; } - auto end() const + constexpr auto end() const { return e; } // same container - bool operator==(const interval& i) const + constexpr bool operator==(const interval& i) const { return b == i.b && e == i.e; } // TODO: size() ??? - explicit operator bool() const + constexpr explicit operator bool() const { return b != e; } - value_type operator*() const + constexpr value_type operator*() const { return *b; } - interval& operator++() + constexpr interval& operator++() { if (operator bool()) { ++b; @@ -177,8 +186,7 @@ namespace fms::iterable { return *this; } - /* - interval operator++(int) + constexpr interval operator++(int) { auto i = *this; @@ -186,10 +194,9 @@ namespace fms::iterable { return i; } - */ }; template // container - inline auto make_interval(C& c) + constexpr auto make_interval(C& c) { return interval(c.begin(), c.end()); }