| 12345678910111213141516171819202122232425262728 |
- // Copyright 2019 yuzu emulator team
- // Licensed under GPLv2 or any later version
- // Refer to the license.txt file included.
- #pragma once
- #include <algorithm>
- #include <functional>
- // Algorithms that operate on iterators, much like the <algorithm> header.
- //
- // Note: If the algorithm is not general-purpose and/or doesn't operate on iterators,
- // it should probably not be placed within this header.
- namespace Common {
- template <class ForwardIt, class T, class Compare = std::less<>>
- [[nodiscard]] ForwardIt BinaryFind(ForwardIt first, ForwardIt last, const T& value,
- Compare comp = {}) {
- // Note: BOTH type T and the type after ForwardIt is dereferenced
- // must be implicitly convertible to BOTH Type1 and Type2, used in Compare.
- // This is stricter than lower_bound requirement (see above)
- first = std::lower_bound(first, last, value, comp);
- return first != last && !comp(value, *first) ? first : last;
- }
- } // namespace Common
|
