/* Ranges for OctaSTD. * * This file is part of OctaSTD. See COPYING.md for futher information. */ #ifndef OCTA_RANGE_HH #define OCTA_RANGE_HH #include #include #include "octa/new.hh" #include "octa/types.hh" #include "octa/utility.hh" #include "octa/type_traits.hh" namespace octa { struct InputRangeTag {}; struct OutputRangeTag {}; struct ForwardRangeTag: InputRangeTag {}; struct BidirectionalRangeTag: ForwardRangeTag {}; struct RandomAccessRangeTag: BidirectionalRangeTag {}; struct FiniteRandomAccessRangeTag: RandomAccessRangeTag {}; template struct RangeHalf; #define OCTA_RANGE_TRAIT(Name) \ namespace detail { \ template \ struct Range##Name##Test { \ template static char test(RemoveReference *); \ template static int test(...); \ static constexpr bool value = (sizeof(test(0)) == sizeof(char)); \ }; \ template::value> \ struct Range##Name##Base {}; \ template \ struct Range##Name##Base { \ using Type = typename T::Name; \ }; \ } \ template \ using Range##Name = typename detail::Range##Name##Base::Type; OCTA_RANGE_TRAIT(Category) OCTA_RANGE_TRAIT(Size) OCTA_RANGE_TRAIT(Value) OCTA_RANGE_TRAIT(Reference) OCTA_RANGE_TRAIT(Difference) #undef OCTA_RANGE_TRAIT namespace detail { template struct IsRangeTest { template static char test(typename U::Category *, typename U::Size *, typename U::Difference *, typename U::Value *, RemoveReference< typename U::Reference > *); template static int test(...); static constexpr bool value = (sizeof(test(0, 0, 0, 0, 0)) == sizeof(char)); }; } // is input range namespace detail { template, InputRangeTag >::value> struct IsInputRangeBase: False {}; template struct IsInputRangeBase: True {}; } template::value> struct IsInputRange: False {}; template struct IsInputRange: detail::IsInputRangeBase::Type {}; // is forward range namespace detail { template, ForwardRangeTag >::value> struct IsForwardRangeBase: False {}; template struct IsForwardRangeBase: True {}; } template::value> struct IsForwardRange: False {}; template struct IsForwardRange: detail::IsForwardRangeBase::Type {}; // is bidirectional range namespace detail { template, BidirectionalRangeTag >::value> struct IsBidirectionalRangeBase: False {}; template struct IsBidirectionalRangeBase: True {}; } template::value> struct IsBidirectionalRange: False {}; template struct IsBidirectionalRange: detail::IsBidirectionalRangeBase::Type {}; // is random access range namespace detail { template, RandomAccessRangeTag >::value> struct IsRandomAccessRangeBase: False {}; template struct IsRandomAccessRangeBase: True {}; } template::value> struct IsRandomAccessRange: False {}; template struct IsRandomAccessRange: detail::IsRandomAccessRangeBase::Type {}; // is finite random access range namespace detail { template, FiniteRandomAccessRangeTag >::value> struct IsFiniteRandomAccessRangeBase: False {}; template struct IsFiniteRandomAccessRangeBase: True {}; } template::value> struct IsFiniteRandomAccessRange: False {}; template struct IsFiniteRandomAccessRange: detail::IsFiniteRandomAccessRangeBase::Type {}; // is infinite random access range template struct IsInfiniteRandomAccessRange: IntegralConstant::value && !IsFiniteRandomAccessRange::value) > {}; // is output range namespace detail { template struct OutputRangeTest { template struct Test {}; template static char test(Test *); template static int test(...); static constexpr bool value = (sizeof(test(0)) == sizeof(char)); }; } template, OutputRangeTag >::value || (IsInputRange::value && (detail::OutputRangeTest &>::value || detail::OutputRangeTest &&>::value || detail::OutputRangeTest >::value) ))> struct IsOutputRange: False {}; template struct IsOutputRange: True {}; namespace detail { // range iterator template struct RangeIterator { RangeIterator(): p_range() {} explicit RangeIterator(const T &range) { ::new(&get_ref()) T(range); } explicit RangeIterator(T &&range) { ::new(&get_ref()) T(move(range)); } RangeIterator &operator++() { get_ref().pop_front(); return *this; } RangeReference operator*() const { return get_ref().front(); } bool operator!=(RangeIterator) const { return !get_ref().empty(); } private: T &get_ref() { return *((T *)&p_range); } const T &get_ref() const { return *((T *)&p_range); } AlignedStorage p_range; }; } // range half template struct HalfRange; namespace detail { template::value> struct RangeAdd; template struct RangeAdd { using Diff = RangeDifference; static Diff add_n(R &half, Diff n) { if (n < 0) return -half.prev_n(n); return half.next_n(n); } static Diff sub_n(R &half, Diff n) { if (n < 0) return -half.next_n(n); return half.prev_n(n); } }; template struct RangeAdd { using Diff = RangeDifference; static Diff add_n(R &half, Diff n) { if (n < 0) return 0; return half.next_n(n); } static Diff sub_n(R &half, Diff n) { if (n < 0) return 0; return half.prev_n(n); } }; } template struct RangeHalf { private: T p_range; public: using Range = T; RangeHalf() = delete; RangeHalf(const T &range): p_range(range) {} template::value >> RangeHalf(const RangeHalf &half): p_range(half.p_range) {} RangeHalf(const RangeHalf &half): p_range(half.p_range) {} RangeHalf(RangeHalf &&half): p_range(move(half.p_range)) {} RangeHalf &operator=(const RangeHalf &half) { p_range = half.p_range; return *this; } RangeHalf &operator=(RangeHalf &&half) { p_range = move(half.p_range); return *this; } bool next() { return p_range.pop_front(); } bool prev() { return p_range.push_front(); } RangeSize next_n(RangeSize n) { return p_range.pop_front_n(n); } RangeSize prev_n(RangeSize n) { return p_range.push_front_n(n); } RangeDifference add_n(RangeDifference n) { return detail::RangeAdd>::add_n(*this, n); } RangeDifference sub_n(RangeDifference n) { return detail::RangeAdd>::sub_n(*this, n); } RangeReference get() const { return p_range.front(); } RangeDifference distance(const RangeHalf &half) const { return p_range.distance_front(half.p_range); } bool equals(const RangeHalf &half) const { return p_range.equals_front(half.p_range); } bool operator==(const RangeHalf &half) const { return equals(half); } bool operator!=(const RangeHalf &half) const { return !equals(half); } /* iterator like interface */ RangeReference operator*() const { return get(); } RangeReference operator[](RangeSize idx) const { return p_range[idx]; } RangeHalf &operator++() { next(); return *this; } RangeHalf operator++(int) { RangeHalf tmp(*this); next(); return tmp; } RangeHalf &operator--() { prev(); return *this; } RangeHalf operator--(int) { RangeHalf tmp(*this); prev(); return tmp; } RangeHalf operator+(RangeDifference n) const { RangeHalf tmp(*this); tmp.add_n(n); return tmp; } RangeHalf operator-(RangeDifference n) const { RangeHalf tmp(*this); tmp.sub_n(n); return tmp; } RangeHalf &operator+=(RangeDifference n) { add_n(n); return *this; } RangeHalf &operator-=(RangeDifference n) { sub_n(n); return *this; } T iter() const { return p_range; } HalfRange iter(const RangeHalf &other) const { return HalfRange(*this, other); } }; template RangeDifference operator-(const R &lhs, const R &rhs) { return rhs.distance(lhs); } namespace detail { template RangeSize pop_front_n(R &range, RangeSize n) { for (RangeSize i = 0; i < n; ++i) if (!range.pop_front()) return i; return n; } template RangeSize pop_back_n(R &range, RangeSize n) { for (RangeSize i = 0; i < n; ++i) if (!range.pop_back()) return i; return n; } template RangeSize push_front_n(R &range, RangeSize n) { for (RangeSize i = 0; i < n; ++i) if (!range.push_front()) return i; return n; } template RangeSize push_back_n(R &range, RangeSize n) { for (RangeSize i = 0; i < n; ++i) if (!range.push_back()) return i; return n; } } template struct ReverseRange; template struct MoveRange; template struct InputRange { using Category = C; using Size = S; using Difference = D; using Value = V; using Reference = R; detail::RangeIterator begin() const { return detail::RangeIterator((const B &)*this); } detail::RangeIterator end() const { return detail::RangeIterator(); } Size pop_front_n(Size n) { return detail::pop_front_n(*((B *)this), n); } Size pop_back_n(Size n) { return detail::pop_back_n(*((B *)this), n); } Size push_front_n(Size n) { return detail::push_front_n(*((B *)this), n); } Size push_back_n(Size n) { return detail::push_back_n(*((B *)this), n); } B iter() const { return B(*((B *)this)); } ReverseRange reverse() const { return ReverseRange(iter()); } MoveRange movable() const { return MoveRange(iter()); } RangeHalf half() const { return RangeHalf(iter()); } Size put_n(const Value *p, Size n) { B &r = *((B *)this); Size on = n; for (; n && r.put(*p++); --n); return (on - n); } template::value> > Size copy(OR &&orange, Size n = -1) { B r(*((B *)this)); Size on = n; for (; n && !r.empty(); --n) { orange.put(r.front()); r.pop_front(); } return (on - n); } Size copy(RemoveCv *p, Size n = -1) { B r(*((B *)this)); Size on = n; for (; n && !r.empty(); --n) { *p++ = r.front(); r.pop_front(); } return (on - n); } }; template auto iter(T &r) -> decltype(r.iter()) { return r.iter(); } template auto iter(const T &r) -> decltype(r.iter()) { return r.iter(); } template auto citer(const T &r) -> decltype(r.iter()) { return r.iter(); } template struct OutputRange { using Category = OutputRangeTag; using Size = S; using Difference = D; using Value = V; using Reference = R; Size put_n(const Value *p, Size n) { B &r = *((B *)this); Size on = n; for (; n && r.put(*p++); --n); return (on - n); } }; template struct HalfRange: InputRange, RangeCategory, RangeValue, RangeReference, RangeSize, RangeDifference > { private: using Rtype = typename T::Range; T p_beg; T p_end; public: HalfRange() = delete; HalfRange(const HalfRange &range): p_beg(range.p_beg), p_end(range.p_end) {} HalfRange(HalfRange &&range): p_beg(move(range.p_beg)), p_end(move(range.p_end)) {} HalfRange(const T &beg, const T &end): p_beg(beg), p_end(end) {} HalfRange(T &&beg, T &&end): p_beg(move(beg)), p_end(move(end)) {} HalfRange &operator=(const HalfRange &range) { p_beg = range.p_beg; p_end = range.p_end; return *this; } HalfRange &operator=(HalfRange &&range) { p_beg = move(range.p_beg); p_end = move(range.p_end); return *this; } bool empty() const { return p_beg == p_end; } bool pop_front() { if (empty()) return false; return p_beg.next(); } bool push_front() { return p_beg.prev(); } bool pop_back() { if (empty()) return false; return p_end.prev(); } bool push_back() { return p_end.next(); } RangeReference front() const { return *p_beg; } RangeReference back() const { return *(p_end - 1); } bool equals_front(const HalfRange &range) const { return p_beg == range.p_beg; } bool equals_back(const HalfRange &range) const { return p_end == range.p_end; } RangeDifference distance_front(const HalfRange &range) const { return range.p_beg - p_beg; } RangeDifference distance_back(const HalfRange &range) const { return range.p_end - p_end; } RangeSize size() const { return p_end - p_beg; } HalfRange slice(RangeSize start, RangeSize p_end) const { return HalfRange(p_beg + start, p_beg + p_end); } RangeReference operator[](RangeSize idx) const { return p_beg[idx]; } bool put(const RangeValue &v) { return p_beg.range().put(v); } bool put(RangeValue &&v) { return p_beg.range().put(move(v)); } }; template struct ReverseRange: InputRange, RangeCategory, RangeValue, RangeReference, RangeSize, RangeDifference > { private: using Rref = RangeReference; using Rsize = RangeSize; T p_range; public: ReverseRange() = delete; ReverseRange(const T &range): p_range(range) {} ReverseRange(const ReverseRange &it): p_range(it.p_range) {} ReverseRange(ReverseRange &&it): p_range(move(it.p_range)) {} ReverseRange &operator=(const ReverseRange &v) { p_range = v.p_range; return *this; } ReverseRange &operator=(ReverseRange &&v) { p_range = move(v.p_range); return *this; } ReverseRange &operator=(const T &v) { p_range = v; return *this; } ReverseRange &operator=(T &&v) { p_range = move(v); return *this; } bool empty() const { return p_range.empty(); } Rsize size() const { return p_range.size(); } bool equals_front(const ReverseRange &r) const { return p_range.equals_back(r.p_range); } bool equals_back(const ReverseRange &r) const { return p_range.equals_front(r.p_range); } RangeDifference distance_front(const ReverseRange &r) const { return -p_range.distance_back(r.p_range); } RangeDifference distance_back(const ReverseRange &r) const { return -p_range.distance_front(r.p_range); } bool pop_front() { return p_range.pop_back(); } bool pop_back() { return p_range.pop_front(); } bool push_front() { return p_range.push_back(); } bool push_back() { return p_range.push_front(); } Rsize pop_front_n(Rsize n) { return p_range.pop_front_n(n); } Rsize pop_back_n(Rsize n) { return p_range.pop_back_n(n); } Rsize push_front_n(Rsize n) { return p_range.push_front_n(n); } Rsize push_back_n(Rsize n) { return p_range.push_back_n(n); } Rref front() const { return p_range.back(); } Rref back() const { return p_range.front(); } Rref operator[](Rsize i) const { return p_range[size() - i - 1]; } ReverseRange slice(Rsize start, Rsize end) const { Rsize len = p_range.size(); return ReverseRange(p_range.slice(len - end, len - start)); } }; template struct MoveRange: InputRange, RangeCategory, RangeValue, RangeValue &&, RangeSize, RangeDifference > { private: using Rval = RangeValue; using Rref = RangeValue &&; using Rsize = RangeSize; T p_range; public: MoveRange() = delete; MoveRange(const T &range): p_range(range) {} MoveRange(const MoveRange &it): p_range(it.p_range) {} MoveRange(MoveRange &&it): p_range(move(it.p_range)) {} MoveRange &operator=(const MoveRange &v) { p_range = v.p_range; return *this; } MoveRange &operator=(MoveRange &&v) { p_range = move(v.p_range); return *this; } MoveRange &operator=(const T &v) { p_range = v; return *this; } MoveRange &operator=(T &&v) { p_range = move(v); return *this; } bool empty() const { return p_range.empty(); } Rsize size() const { return p_range.size(); } bool equals_front(const MoveRange &r) const { return p_range.equals_front(r.p_range); } bool equals_back(const MoveRange &r) const { return p_range.equals_back(r.p_range); } RangeDifference distance_front(const MoveRange &r) const { return p_range.distance_front(r.p_range); } RangeDifference distance_back(const MoveRange &r) const { return p_range.distance_back(r.p_range); } bool pop_front() { return p_range.pop_front(); } bool pop_back() { return p_range.pop_back(); } bool push_front() { return p_range.push_front(); } bool push_back() { return p_range.push_back(); } Rsize pop_front_n(Rsize n) { return p_range.pop_front_n(n); } Rsize pop_back_n(Rsize n) { return p_range.pop_back_n(n); } Rsize push_front_n(Rsize n) { return p_range.push_front_n(n); } Rsize push_back_n(Rsize n) { return p_range.push_back_n(n); } Rref front() const { return move(p_range.front()); } Rref back() const { return move(p_range.back()); } Rref operator[](Rsize i) const { return move(p_range[i]); } MoveRange slice(Rsize start, Rsize end) const { return MoveRange(p_range.slice(start, end)); } bool put(const Rval &v) { return p_range.put(v); } bool put(Rval &&v) { return p_range.put(move(v)); } }; template struct NumberRange: InputRange, ForwardRangeTag, T, T> { NumberRange() = delete; NumberRange(const NumberRange &it): p_a(it.p_a), p_b(it.p_b), p_step(it.p_step) {} NumberRange(T a, T b, T step = T(1)): p_a(a), p_b(b), p_step(step) {} NumberRange(T v): p_a(0), p_b(v), p_step(1) {} bool empty() const { return p_a * p_step >= p_b * p_step; } bool equals_front(const NumberRange &range) const { return p_a == range.p_a; } bool pop_front() { p_a += p_step; return true; } T front() const { return p_a; } private: T p_a, p_b, p_step; }; template NumberRange range(T a, T b, T step = T(1)) { return NumberRange(a, b, step); } template NumberRange range(T v) { return NumberRange(v); } template struct PointerRange: InputRange, FiniteRandomAccessRangeTag, T> { PointerRange() = delete; PointerRange(T *beg, T *end): p_beg(beg), p_end(end) {} PointerRange(T *beg, Size n): p_beg(beg), p_end(beg + n) {} template::value >> PointerRange(const PointerRange &v): p_beg(&v[0]), p_end(&v[v.size()]) {} PointerRange &operator=(const PointerRange &v) { p_beg = v.p_beg; p_end = v.p_end; return *this; } /* satisfy InputRange / ForwardRange */ bool empty() const { return p_beg == p_end; } bool pop_front() { if (p_beg == p_end) return false; ++p_beg; return true; } bool push_front() { --p_beg; return true; } Size pop_front_n(Size n) { Size olen = p_end - p_beg; p_beg += n; if (p_beg > p_end) { p_beg = p_end; return olen; } return n; } Size push_front_n(Size n) { p_beg -= n; return true; } T &front() const { return *p_beg; } bool equals_front(const PointerRange &range) const { return p_beg == range.p_beg; } Ptrdiff distance_front(const PointerRange &range) const { return range.p_beg - p_beg; } /* satisfy BidirectionalRange */ bool pop_back() { if (p_end == p_beg) return false; --p_end; return true; } bool push_back() { ++p_end; return true; } Size pop_back_n(Size n) { Size olen = p_end - p_beg; p_end -= n; if (p_end < p_beg) { p_end = p_beg; return olen; } return n; } Size push_back_n(Size n) { p_end += n; return true; } T &back() const { return *(p_end - 1); } bool equals_back(const PointerRange &range) const { return p_end == range.p_end; } Ptrdiff distance_back(const PointerRange &range) const { return range.p_end - p_end; } /* satisfy FiniteRandomAccessRange */ Size size() const { return p_end - p_beg; } PointerRange slice(Size start, Size end) const { return PointerRange(p_beg + start, p_beg + end); } T &operator[](Size i) const { return p_beg[i]; } /* satisfy OutputRange */ bool put(const T &v) { if (empty()) return false; *(p_beg++) = v; return true; } bool put(T &&v) { if (empty()) return false; *(p_beg++) = move(v); return true; } Size put_n(const T *p, Size n) { Size ret = size(); if (n < ret) ret = n; if (IsPod()) { memcpy(p_beg, p, ret * sizeof(T)); p_beg += ret; return ret; } for (Size i = ret; i; --i) *p_beg++ = *p++; return ret; } template::value >> Size copy(R &&orange, Size n = -1) { Size c = size(); if (n < c) c = n; return orange.put_n(p_beg, c); } Size copy(RemoveCv *p, Size n = -1) { Size c = size(); if (n < c) c = n; return copy(PointerRange(p, c), c); } private: T *p_beg, *p_end; }; template PointerRange iter(T (&array)[N]) { return PointerRange(array, N); } template PointerRange iter(const T (&array)[N]) { return PointerRange(array, N); } template struct EnumeratedValue { S index; T value; }; template struct EnumeratedRange: InputRange, CommonType, ForwardRangeTag>, RangeValue, EnumeratedValue, RangeSize>, RangeSize > { private: using Rref = RangeReference; using Rsize = RangeSize; T p_range; Rsize p_index; public: EnumeratedRange() = delete; EnumeratedRange(const T &range): p_range(range), p_index(0) {} EnumeratedRange(const EnumeratedRange &it): p_range(it.p_range), p_index(it.p_index) {} EnumeratedRange(EnumeratedRange &&it): p_range(move(it.p_range)), p_index(it.p_index) {} EnumeratedRange &operator=(const EnumeratedRange &v) { p_range = v.p_range; p_index = v.p_index; return *this; } EnumeratedRange &operator=(EnumeratedRange &&v) { p_range = move(v.p_range); p_index = v.p_index; return *this; } EnumeratedRange &operator=(const T &v) { p_range = v; p_index = 0; return *this; } EnumeratedRange &operator=(T &&v) { p_range = move(v); p_index = 0; return *this; } bool empty() const { return p_range.empty(); } bool equals_front(const EnumeratedRange &r) const { return p_range.equals_front(r.p_range); } bool pop_front() { if (p_range.pop_front()) { ++p_index; return true; } return false; } Rsize pop_front_n(Rsize n) { Rsize ret = p_range.pop_front_n(n); p_index += ret; return ret; } EnumeratedValue front() const { return EnumeratedValue { p_index, p_range.front() }; } }; template EnumeratedRange enumerate(const T &it) { return EnumeratedRange(it); } template struct TakeRange: InputRange, CommonType, ForwardRangeTag>, RangeValue, RangeReference, RangeSize > { private: T p_range; RangeSize p_remaining; public: TakeRange() = delete; TakeRange(const T &range, RangeSize rem): p_range(range), p_remaining(rem) {} TakeRange(const TakeRange &it): p_range(it.p_range), p_remaining(it.p_remaining) {} TakeRange(TakeRange &&it): p_range(move(it.p_range)), p_remaining(it.p_remaining) {} TakeRange &operator=(const TakeRange &v) { p_range = v.p_range; p_remaining = v.p_remaining; return *this; } TakeRange &operator=(TakeRange &&v) { p_range = move(v.p_range); p_remaining = v.p_remaining; return *this; } bool empty() const { return (p_remaining <= 0) || p_range.empty(); } bool pop_front() { if (p_range.pop_front()) { --p_remaining; return true; } return false; } RangeSize pop_front_n(RangeSize n) { RangeSize ret = p_range.pop_front_n(n); p_remaining -= ret; return ret; } RangeReference front() const { return p_range.front(); } bool equals_front(const TakeRange &r) const { return p_range.equals_front(r.p_range); } }; template TakeRange take(const T &it, RangeSize n) { return TakeRange(it, n); } template struct ChunksRange: InputRange, CommonType, ForwardRangeTag>, TakeRange, TakeRange, RangeSize > { private: T p_range; RangeSize p_chunksize; public: ChunksRange() = delete; ChunksRange(const T &range, RangeSize chs): p_range(range), p_chunksize(chs) {} ChunksRange(const ChunksRange &it): p_range(it.p_range), p_chunksize(it.p_chunksize) {} ChunksRange(ChunksRange &&it): p_range(move(it.p_range)), p_chunksize(it.p_chunksize) {} ChunksRange &operator=(const ChunksRange &v) { p_range = v.p_range; p_chunksize = v.p_chunksize; return *this; } ChunksRange &operator=(ChunksRange &&v) { p_range = move(v.p_range); p_chunksize = v.p_chunksize; return *this; } bool empty() const { return p_range.empty(); } bool equals_front(const ChunksRange &r) const { return p_range.equals_front(r.p_range); } bool pop_front() { return p_range.pop_front_n(p_chunksize) > 0; } RangeSize pop_front_n(RangeSize n) { return p_range.pop_front_n(p_chunksize * n) / p_chunksize; } TakeRange front() const { return take(p_range, p_chunksize); } }; template ChunksRange chunks(const T &it, RangeSize chs) { return ChunksRange(it, chs); } template struct AppenderRange: OutputRange, typename T::Value, typename T::Reference, typename T::Size, typename T::Difference> { AppenderRange(): p_data() {} AppenderRange(const T &v): p_data(v) {} AppenderRange(T &&v): p_data(move(v)) {} AppenderRange(const AppenderRange &v): p_data(v.p_data) {} AppenderRange(AppenderRange &&v): p_data(move(v.p_data)) {} AppenderRange &operator=(const AppenderRange &v) { p_data = v.p_data; return *this; } AppenderRange &operator=(AppenderRange &&v) { p_data = move(v.p_data); return *this; } AppenderRange &operator=(const T &v) { p_data = v; return *this; } AppenderRange &operator=(T &&v) { p_data = move(v); return *this; } void clear() { p_data.clear(); } void reserve(typename T::Size cap) { p_data.reserve(cap); } void resize(typename T::Size len) { p_data.resize(len); } typename T::Size size() const { return p_data.size(); } typename T::Size capacity() const { return p_data.capacity(); } bool put(typename T::ConstReference v) { p_data.push(v); return true; } bool put(typename T::Value &&v) { p_data.push(move(v)); return true; } T &get() { return p_data; } private: T p_data; }; template AppenderRange appender() { return AppenderRange(); } template AppenderRange appender(T &&v) { return AppenderRange(forward(v)); } // range of template using RangeOf = decltype(iter(declval())); } /* namespace octa */ #endif