mirror of
https://github.com/coderkei/akmenu-next.git
synced 2025-06-20 01:45:31 -04:00
36 lines
1.1 KiB
C++
36 lines
1.1 KiB
C++
/*
|
|
binaryfind.h
|
|
Copyright (C) 2009 yellow wood goblin
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef __BINARYFIND_H__
|
|
#define __BINARYFIND_H__
|
|
|
|
#include <algorithm>
|
|
|
|
namespace akui
|
|
{
|
|
template<typename Iterator,typename T,typename Compare> Iterator binary_find(Iterator first,Iterator last,const T& value,Compare cmp)
|
|
{
|
|
Iterator result=std::lower_bound(first,last,value,cmp);
|
|
if(result==last) return last;
|
|
else if(!cmp(value,*result)) return result;
|
|
else return last;
|
|
}
|
|
}
|
|
|
|
#endif
|