forked from OpenEnroth/OpenEnroth
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
e486d7d
commit ebd8810
Showing
6 changed files
with
165 additions
and
112 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,122 @@ | ||
| #pragma once | ||
|
|
||
| #include <cassert> | ||
| #include <vector> | ||
| #include <algorithm> | ||
| #include <numeric> | ||
| #include <iterator> | ||
|
|
||
| template<class Base> | ||
| class Accessible; | ||
|
|
||
| template<class T> | ||
| using AccessibleVector = Accessible<std::vector<T>>; | ||
|
|
||
| template<class T> | ||
| T calculateDelta(const T &l, const T &r) { | ||
| return r - l; | ||
| } | ||
|
|
||
| template<class Base> | ||
| class Accessible : public Base { | ||
| public: | ||
| using Base::Base; | ||
| using Base::begin; | ||
| using Base::end; | ||
| using value_type = std::iter_value_t<decltype(std::declval<const Base *>()->begin())>; | ||
|
|
||
| friend AccessibleVector<value_type> calculateDelta(const Accessible &l, const Accessible &r) { | ||
| AccessibleVector<value_type> result; | ||
| auto lpos = l.begin(); | ||
| auto rpos = r.begin(); | ||
| while (lpos != l.end()) | ||
| result.push_back(calculateDelta(*lpos++, *rpos++)); | ||
| assert(rpos == r.end()); | ||
| return result; | ||
| } | ||
|
|
||
| size_t size() const { | ||
| return end() - begin(); | ||
| } | ||
|
|
||
| const value_type &front() const { | ||
| assert(begin() != end()); | ||
| return *begin(); | ||
| } | ||
|
|
||
| const value_type &back() const { | ||
| assert(begin() != end()); | ||
| return *end(); | ||
| } | ||
|
|
||
| AccessibleVector<value_type> frontBack() const { | ||
| assert(begin() != end()); | ||
| return {*begin(), *std::prev(end())}; | ||
| } | ||
|
|
||
| value_type delta() const { | ||
| assert(begin() != end()); | ||
| return calculateDelta(*begin(), *std::prev(end())); | ||
| } | ||
|
|
||
| AccessibleVector<value_type> adjacentDeltas() const { | ||
| AccessibleVector<value_type> result; | ||
|
|
||
| auto l0 = begin(); | ||
| auto r = end(); | ||
| if (l0 == r) | ||
| return result; | ||
|
|
||
| auto l1 = std::next(l0); | ||
| while (l1 != r) | ||
| result.push_back(calculateDelta(*l0++, *l1++)); | ||
| return result; | ||
| } | ||
|
|
||
| value_type min() const { | ||
| assert(begin() != end()); | ||
| return *std::min_element(begin(), end()); | ||
| } | ||
|
|
||
| value_type max() const { | ||
| assert(begin() != end()); | ||
| return *std::max_element(begin(), end()); | ||
| } | ||
|
|
||
| AccessibleVector<value_type> minMax() const { | ||
| assert(begin() != end()); | ||
| auto pair = std::minmax_element(begin(), end()); | ||
| return {*pair.first, *pair.second}; | ||
| } | ||
|
|
||
| auto flattened() const { | ||
| using element_type = std::iter_value_t<decltype(std::declval<const value_type *>()->begin())>; | ||
| AccessibleVector<element_type> result; | ||
| for (const auto &chunk : *this) | ||
| for (const auto &element : chunk) | ||
| result.push_back(element); | ||
| return result; | ||
| } | ||
|
|
||
| template<class Filter> | ||
| AccessibleVector<value_type> filtered(Filter filter) const { | ||
| AccessibleVector<value_type> result; | ||
| std::copy_if(begin(), end(), std::back_inserter(result), std::move(filter)); | ||
| return result; | ||
| } | ||
|
|
||
| AccessibleVector<value_type> reversed() const { | ||
| AccessibleVector<value_type> result; | ||
| std::reverse_copy(begin(), end(), std::back_inserter(result)); | ||
| return result; | ||
| } | ||
|
|
||
| bool contains(const value_type &value) const { | ||
| return std::find(begin(), end(), value) != end(); | ||
| } | ||
| }; | ||
|
|
||
| template<class L, class R> | ||
| bool operator==(const Accessible<L> &l, const Accessible<R> &r) { | ||
| return std::equal(l.begin(), l.end(), r.begin(), r.end()); | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.