forked from Neargye/magic_enum
-
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.
add enum_next_value and enum_prev_value
- Loading branch information
Showing
3 changed files
with
223 additions
and
0 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,97 @@ | ||
| // __ __ _ ______ _____ | ||
| // | \/ | (_) | ____| / ____|_ _ | ||
| // | \ / | __ _ __ _ _ ___ | |__ _ __ _ _ _ __ ___ | | _| |_ _| |_ | ||
| // | |\/| |/ _` |/ _` | |/ __| | __| | '_ \| | | | '_ ` _ \ | | |_ _|_ _| | ||
| // | | | | (_| | (_| | | (__ | |____| | | | |_| | | | | | | | |____|_| |_| | ||
| // |_| |_|\__,_|\__, |_|\___| |______|_| |_|\__,_|_| |_| |_| \_____| | ||
| // __/ | https://github.com/Neargye/magic_enum | ||
| // |___/ version 0.9.1 | ||
| // | ||
| // Licensed under the MIT License <http://opensource.org/licenses/MIT>. | ||
| // SPDX-License-Identifier: MIT | ||
| // Copyright (c) 2019 - 2023 Daniil Goncharov <neargye@gmail.com>. | ||
| // | ||
| // Permission is hereby granted, free of charge, to any person obtaining a copy | ||
| // of this software and associated documentation files (the "Software"), to deal | ||
| // in the Software without restriction, including without limitation the rights | ||
| // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | ||
| // copies of the Software, and to permit persons to whom the Software is | ||
| // furnished to do so, subject to the following conditions: | ||
| // | ||
| // The above copyright notice and this permission notice shall be included in all | ||
| // copies or substantial portions of the Software. | ||
| // | ||
| // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
| // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
| // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
| // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
| // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
| // SOFTWARE. | ||
|
|
||
| #ifndef NEARGYE_MAGIC_ENUM_UTILITY_HPP | ||
| #define NEARGYE_MAGIC_ENUM_UTILITY_HPP | ||
|
|
||
| #include "magic_enum.hpp" | ||
|
|
||
| namespace magic_enum { | ||
|
|
||
| template <typename E, detail::enum_subtype S = detail::subtype_v<E>> | ||
| [[nodiscard]] constexpr auto enum_next_value(E value, std::ptrdiff_t n = 1) noexcept -> detail::enable_if_t<E, optional<std::decay_t<E>>> { | ||
| using D = std::decay_t<E>; | ||
| constexpr auto count = detail::count_v<D, S>; | ||
|
|
||
| if (const auto i = enum_index<D, S>(value)) { | ||
| const std::ptrdiff_t index = (static_cast<std::ptrdiff_t>(*i) + n); | ||
| if (index >= 0 && index < count) { | ||
| return enum_value<D, S>(index); | ||
| } | ||
| } | ||
| return {}; | ||
| } | ||
|
|
||
| template <typename E, detail::enum_subtype S = detail::subtype_v<E>> | ||
| [[nodiscard]] constexpr auto enum_next_value_circular(E value, std::ptrdiff_t n = 1) noexcept -> detail::enable_if_t<E, std::decay_t<E>> { | ||
| using D = std::decay_t<E>; | ||
| constexpr std::ptrdiff_t count = detail::count_v<D, S>; | ||
|
|
||
| if (const auto i = enum_index<D, S>(value)) { | ||
| const std::ptrdiff_t index = ((((static_cast<std::ptrdiff_t>(*i) + n) % count) + count) % count); | ||
| if (index >= 0 && index < count) { | ||
| return enum_value<D, S>(index); | ||
| } | ||
| } | ||
| return MAGIC_ENUM_ASSERT(false), value; | ||
| } | ||
|
|
||
| template <typename E, detail::enum_subtype S = detail::subtype_v<E>> | ||
| [[nodiscard]] constexpr auto enum_prev_value(E value, std::ptrdiff_t n = 1) noexcept -> detail::enable_if_t<E, optional<std::decay_t<E>>> { | ||
| using D = std::decay_t<E>; | ||
| constexpr auto count = detail::count_v<D, S>; | ||
|
|
||
| if (const auto i = enum_index<D, S>(value)) { | ||
| const std::ptrdiff_t index = (static_cast<std::ptrdiff_t>(*i) - n); | ||
| if (index >= 0 && index < count) { | ||
| return enum_value<D, S>(index); | ||
| } | ||
| } | ||
| return {}; | ||
| } | ||
|
|
||
| template <typename E, detail::enum_subtype S = detail::subtype_v<E>> | ||
| [[nodiscard]] constexpr auto enum_prev_value_circular(E value, std::ptrdiff_t n = 1) noexcept -> detail::enable_if_t<E, std::decay_t<E>> { | ||
| using D = std::decay_t<E>; | ||
| constexpr std::ptrdiff_t count = detail::count_v<D, S>; | ||
|
|
||
| if (const auto i = enum_index<D, S>(value)) { | ||
| const std::ptrdiff_t index = ((((static_cast<std::ptrdiff_t>(*i) - n) % count) + count) % count); | ||
| if (index >= 0 && index < count) { | ||
| return enum_value<D, S>(index); | ||
| } | ||
| } | ||
| return MAGIC_ENUM_ASSERT(false), value; | ||
| } | ||
|
|
||
| } // namespace magic_enum | ||
|
|
||
| #endif // NEARGYE_MAGIC_ENUM_UTILITY_HPP |
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