diff options
| author | Lioncash <mathew1800@gmail.com> | 2019-10-15 14:47:42 -0400 |
|---|---|---|
| committer | Lioncash <mathew1800@gmail.com> | 2019-10-15 15:24:50 -0400 |
| commit | ac4dbd3b25f022b3ef025f6d3451712187308efb (patch) | |
| tree | 0d2b2fac72afd6c8ae91935ff5c1968590bd2d8a /src/common/algorithm.h | |
| parent | cab2619aeb111bd6c5dbcc5adc0d2e8154a1e8fc (diff) | |
common: Rename binary_find.h to algorithm.h
Makes the header more general for other potential algorithms in the
future. While we're at it, include a missing <functional> include to
satisfy the use of std::less.
Diffstat (limited to 'src/common/algorithm.h')
| -rw-r--r-- | src/common/algorithm.h | 22 |
1 files changed, 22 insertions, 0 deletions
diff --git a/src/common/algorithm.h b/src/common/algorithm.h new file mode 100644 index 0000000000..18e7ece981 --- /dev/null +++ b/src/common/algorithm.h @@ -0,0 +1,22 @@ +// 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> + +namespace Common { + +template <class ForwardIt, class T, class Compare = std::less<>> +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 |