From ac4dbd3b25f022b3ef025f6d3451712187308efb Mon Sep 17 00:00:00 2001 From: Lioncash Date: Tue, 15 Oct 2019 14:47:42 -0400 Subject: 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 include to satisfy the use of std::less. --- src/common/binary_find.h | 21 --------------------- 1 file changed, 21 deletions(-) delete mode 100644 src/common/binary_find.h (limited to 'src/common/binary_find.h') diff --git a/src/common/binary_find.h b/src/common/binary_find.h deleted file mode 100644 index 5cc523bf9..000000000 --- a/src/common/binary_find.h +++ /dev/null @@ -1,21 +0,0 @@ -// Copyright 2019 yuzu emulator team -// Licensed under GPLv2 or any later version -// Refer to the license.txt file included. - -#pragma once - -#include - -namespace Common { - -template > -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 -- cgit v1.2.3