From Jason Turner

[lower.bound]

Diff to HTML by rtfpessoa

tmp/tmpnsncmm8s/{from.md → to.md} RENAMED
@@ -1,23 +1,26 @@
1
  #### `lower_bound` <a id="lower.bound">[[lower.bound]]</a>
2
 
3
  ``` cpp
4
- template<class ForwardIterator, class T>
5
  constexpr ForwardIterator
6
  lower_bound(ForwardIterator first, ForwardIterator last,
7
  const T& value);
8
 
9
- template<class ForwardIterator, class T, class Compare>
 
10
  constexpr ForwardIterator
11
  lower_bound(ForwardIterator first, ForwardIterator last,
12
  const T& value, Compare comp);
13
 
14
- template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
 
15
  indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
16
  constexpr I ranges::lower_bound(I first, S last, const T& value, Comp comp = {},
17
  Proj proj = {});
18
- template<forward_range R, class T, class Proj = identity,
 
19
  indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
20
  ranges::less>
21
  constexpr borrowed_iterator_t<R>
22
  ranges::lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});
23
  ```
 
1
  #### `lower_bound` <a id="lower.bound">[[lower.bound]]</a>
2
 
3
  ``` cpp
4
+ template<class ForwardIterator, class T = iterator_traits<ForwardIterator>::value_type>
5
  constexpr ForwardIterator
6
  lower_bound(ForwardIterator first, ForwardIterator last,
7
  const T& value);
8
 
9
+ template<class ForwardIterator, class T = iterator_traits<ForwardIterator>::value_type,
10
+ class Compare>
11
  constexpr ForwardIterator
12
  lower_bound(ForwardIterator first, ForwardIterator last,
13
  const T& value, Compare comp);
14
 
15
+ template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
16
+ class T = projected_value_t<I, Proj>,
17
  indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
18
  constexpr I ranges::lower_bound(I first, S last, const T& value, Comp comp = {},
19
  Proj proj = {});
20
+ template<forward_range R, class Proj = identity,
21
+ class T = projected_value_t<iterator_t<R>, Proj>,
22
  indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
23
  ranges::less>
24
  constexpr borrowed_iterator_t<R>
25
  ranges::lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});
26
  ```