69 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			C++
		
	
	
	
			
		
		
	
	
			69 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			C++
		
	
	
	
//===----------------------------------------------------------------------===//
 | 
						|
//
 | 
						|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
 | 
						|
// See https://llvm.org/LICENSE.txt for license information.
 | 
						|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
 | 
						|
//
 | 
						|
//===----------------------------------------------------------------------===//
 | 
						|
 | 
						|
#ifndef _LIBCPP___ALGORITHM_UPPER_BOUND_H
 | 
						|
#define _LIBCPP___ALGORITHM_UPPER_BOUND_H
 | 
						|
 | 
						|
#include <__algorithm/comp.h>
 | 
						|
#include <__algorithm/half_positive.h>
 | 
						|
#include <__config>
 | 
						|
#include <__iterator/advance.h>
 | 
						|
#include <__iterator/distance.h>
 | 
						|
#include <__iterator/iterator_traits.h>
 | 
						|
 | 
						|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
 | 
						|
#  pragma GCC system_header
 | 
						|
#endif
 | 
						|
 | 
						|
_LIBCPP_BEGIN_NAMESPACE_STD
 | 
						|
 | 
						|
template <class _Compare, class _ForwardIterator, class _Tp>
 | 
						|
_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator
 | 
						|
__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
 | 
						|
{
 | 
						|
    typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
 | 
						|
    difference_type __len = _VSTD::distance(__first, __last);
 | 
						|
    while (__len != 0)
 | 
						|
    {
 | 
						|
        difference_type __l2 = _VSTD::__half_positive(__len);
 | 
						|
        _ForwardIterator __m = __first;
 | 
						|
        _VSTD::advance(__m, __l2);
 | 
						|
        if (__comp(__value_, *__m))
 | 
						|
            __len = __l2;
 | 
						|
        else
 | 
						|
        {
 | 
						|
            __first = ++__m;
 | 
						|
            __len -= __l2 + 1;
 | 
						|
        }
 | 
						|
    }
 | 
						|
    return __first;
 | 
						|
}
 | 
						|
 | 
						|
template <class _ForwardIterator, class _Tp, class _Compare>
 | 
						|
_LIBCPP_NODISCARD_EXT inline
 | 
						|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
 | 
						|
_ForwardIterator
 | 
						|
upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
 | 
						|
{
 | 
						|
    return _VSTD::__upper_bound<_Compare&>(__first, __last, __value_, __comp);
 | 
						|
}
 | 
						|
 | 
						|
template <class _ForwardIterator, class _Tp>
 | 
						|
_LIBCPP_NODISCARD_EXT inline
 | 
						|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
 | 
						|
_ForwardIterator
 | 
						|
upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
 | 
						|
{
 | 
						|
    return _VSTD::upper_bound(__first, __last, __value_,
 | 
						|
                             __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>());
 | 
						|
}
 | 
						|
 | 
						|
_LIBCPP_END_NAMESPACE_STD
 | 
						|
 | 
						|
#endif // _LIBCPP___ALGORITHM_UPPER_BOUND_H
 |