min_element.qbk 2.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  1. [/
  2. Copyright 2010 Neil Groves
  3. Distributed under the Boost Software License, Version 1.0.
  4. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
  5. /]
  6. [section:min_element min_element]
  7. [heading Prototype]
  8. ``
  9. template<class ForwardRange>
  10. typename range_iterator<ForwardRange>::type
  11. min_element(ForwardRange& rng);
  12. template<class ForwardRange>
  13. typename range_iterator<const ForwardRange>::type
  14. min_element(const ForwardRange& rng);
  15. template<class ForwardRange, class BinaryPredicate>
  16. typename range_iterator<ForwardRange>::type
  17. min_element(ForwardRange& rng, BinaryPredicate pred);
  18. template<class ForwardRange, class BinaryPredicate>
  19. typename range_iterator<const ForwardRange>::type
  20. min_element(const ForwardRange& rng, BinaryPredicate pred);
  21. template<
  22. range_return_value re,
  23. class ForwardRange
  24. >
  25. typename range_return<ForwardRange, re>::type
  26. min_element(ForwardRange& rng);
  27. template<
  28. range_return_value_re,
  29. class ForwardRange
  30. >
  31. typename range_return<const ForwardRange, re>::type
  32. min_element(const ForwardRange& rng);
  33. template<
  34. range_return_value re,
  35. class ForwardRange,
  36. class BinaryPredicate
  37. >
  38. typename range_return<ForwardRange, re>::type
  39. min_element(ForwardRange& rng, BinaryPredicate pred);
  40. template<
  41. range_return_value re,
  42. class ForwardRange,
  43. class BinaryPredicate
  44. >
  45. typename range_return<const ForwardRange, re>::type
  46. min_element(const ForwardRange& rng, BinaryPredicate pred);
  47. ``
  48. [heading Description]
  49. The versions of `min_element` that return an iterator, return the iterator to the minimum value as determined by using `operator<` if a predicate is not supplied. Otherwise the predicate `pred` is used to determine the minimum value. The versions of `min_element` that return a `range_return`, defines `found` in the same manner as the returned iterator described above.
  50. [heading Definition]
  51. Defined in the header file `boost/range/algorithm/min_element.hpp`
  52. [heading Requirements]
  53. [*For the non-predicate versions:]
  54. * `ForwardRange` is a model of the __forward_range__ Concept.
  55. * `ForwardRange`'s value type is a model of the `LessThanComparableConcept`.
  56. [*For the predicate versions:]
  57. * `ForwardRange` is a model of the __forward_range__ Concept.
  58. * `BinaryPredicate` is a model of the `BinaryPredicateConcept`.
  59. * `ForwardRange`'s value type is convertible to both of `BinaryPredicate`'s argument types.
  60. [heading Complexity]
  61. Linear. Zero comparisons if `empty(rng)`, otherwise `distance(rng) - 1` comparisons.
  62. [endsect]