diff --git a/docs/_sources/libs/sprout/algorithm/index.txt b/docs/_sources/libs/sprout/algorithm/index.txt index a222dfd5..41aa7b0c 100644 --- a/docs/_sources/libs/sprout/algorithm/index.txt +++ b/docs/_sources/libs/sprout/algorithm/index.txt @@ -39,6 +39,9 @@ Sprout.Algorithm binary_search is_heap is_heap_until + min + max + minmax .. _sprout-algorithm-non_modifying: ******************************************************************************* diff --git a/docs/_sources/libs/sprout/algorithm/max.txt b/docs/_sources/libs/sprout/algorithm/max.txt new file mode 100644 index 00000000..e67a51c4 --- /dev/null +++ b/docs/_sources/libs/sprout/algorithm/max.txt @@ -0,0 +1,85 @@ +.. _sprout-algorithm-max: +############################################################################### +max +############################################################################### + +Interface +======================================== +.. sourcecode:: c++ + + template + inline SPROUT_CONSTEXPR T const& + max(T const& a, T const& b); + + template + inline SPROUT_CONSTEXPR T const& + max(T const& a, T const& b, Compare comp); + +Requires +======================================== + +| Type T is LessThanComparable. + +Returns +======================================== + +| The larger value. + +Remarks +======================================== + +| Returns the first argument when the arguments are equivalent. + +Examples +======================================== +.. sourcecode:: c++ + + #include + #include + using namespace sprout; + + SPROUT_STATIC_CONSTEXPR auto input = array{{-1, 1}}; + SPROUT_STATIC_CONSTEXPR auto result = sprout::max(input[0], input[1]); + static_assert(result == 1, "max value is 1."); + +------------------------------------------------------------------------------- + +Interface +======================================== +.. sourcecode:: c++ + + template + inline SPROUT_CONSTEXPR T + max(std::initializer_list t, Compare comp); + + template + inline SPROUT_CONSTEXPR T + max(std::initializer_list t); + +Requires +======================================== + +| T is LessThanComparable and CopyConstructible and ``t.size() > 0``. + +Returns +======================================== + +| The largest value in the initializer_list. + +Remarks +======================================== + +| Returns a copy of the leftmost argument when several arguments are equivalent to the largest. +| If an implementation not support C++14 initializer_list (SPROUT_NO_CXX14_INITIALIZER_LIST defined), then this function is not specified constexpr. + +Complexity +======================================== + +| Recursive function invocations in *O(logN)* (logarithmic) depth. + +Header +======================================== + +| ``sprout/algorithm/max.hpp`` +| Convenience header: ``sprout/algorithm.hpp`` + diff --git a/docs/_sources/libs/sprout/algorithm/min.txt b/docs/_sources/libs/sprout/algorithm/min.txt new file mode 100644 index 00000000..a49b99c7 --- /dev/null +++ b/docs/_sources/libs/sprout/algorithm/min.txt @@ -0,0 +1,85 @@ +.. _sprout-algorithm-min: +############################################################################### +min +############################################################################### + +Interface +======================================== +.. sourcecode:: c++ + + template + inline SPROUT_CONSTEXPR T const& + min(T const& a, T const& b); + + template + inline SPROUT_CONSTEXPR T const& + min(T const& a, T const& b, Compare comp); + +Requires +======================================== + +| Type T is LessThanComparable. + +Returns +======================================== + +| The smaller value. + +Remarks +======================================== + +| Returns the first argument when the arguments are equivalent. + +Examples +======================================== +.. sourcecode:: c++ + + #include + #include + using namespace sprout; + + SPROUT_STATIC_CONSTEXPR auto input = array{{-1, 1}}; + SPROUT_STATIC_CONSTEXPR auto result = sprout::min(input[0], input[1]); + static_assert(result == -1, "min value is -1."); + +------------------------------------------------------------------------------- + +Interface +======================================== +.. sourcecode:: c++ + + template + inline SPROUT_CONSTEXPR T + min(std::initializer_list t, Compare comp); + + template + inline SPROUT_CONSTEXPR T + min(std::initializer_list t); + +Requires +======================================== + +| T is LessThanComparable and CopyConstructible and ``t.size() > 0``. + +Returns +======================================== + +| The smallest value in the initializer_list. + +Remarks +======================================== + +| Returns a copy of the leftmost argument when several arguments are equivalent to the smallest. +| If an implementation not support C++14 initializer_list (SPROUT_NO_CXX14_INITIALIZER_LIST defined), then this function is not specified constexpr. + +Complexity +======================================== + +| Recursive function invocations in *O(logN)* (logarithmic) depth. + +Header +======================================== + +| ``sprout/algorithm/min.hpp`` +| Convenience header: ``sprout/algorithm.hpp`` + diff --git a/docs/_sources/libs/sprout/algorithm/minmax.txt b/docs/_sources/libs/sprout/algorithm/minmax.txt new file mode 100644 index 00000000..c748d2a1 --- /dev/null +++ b/docs/_sources/libs/sprout/algorithm/minmax.txt @@ -0,0 +1,96 @@ +.. _sprout-algorithm-minmax: +############################################################################### +minmax +############################################################################### + +Interface +======================================== +.. sourcecode:: c++ + + template + inline SPROUT_CONSTEXPR sprout::pair + minmax(T const& a, T const& b); + + template + inline SPROUT_CONSTEXPR sprout::pair + minmax(T const& a, T const& b, Compare comp); + +Requires +======================================== + +| Type T shall be LessThanComparable. + +Returns +======================================== + +| ``pair(x, y)``, where x has the smallest and y has the largest value in the initializer list. + +Remarks +======================================== + +| Returns ``pair(a, b)`` when the arguments are equivalent. + +Remarks +======================================== + +Examples +======================================== +.. sourcecode:: c++ + + #include + #include + using namespace sprout; + + SPROUT_STATIC_CONSTEXPR auto input = array{{-1, 1}}; + SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax(input[0], input[1]); + static_assert(result.first == -1, "min value is -1."); + static_assert(result.second == 1, "max value is 1."); + +Complexity +======================================== + +| Exactly one comparison. + +------------------------------------------------------------------------------- + +Interface +======================================== +.. sourcecode:: c++ + + template + inline SPROUT_CONSTEXPR sprout::pair + minmax(std::initializer_list t, Compare comp); + + template + inline SPROUT_CONSTEXPR sprout::pair + minmax(std::initializer_list t); + +Requires +======================================== + +| T is LessThanComparable and CopyConstructible and ``t.size() > 0``. + +Returns +======================================== + +| ``pair(x, y)``, where x has the smallest and y has the largest value in the initializer list. + +Remarks +======================================== + +| x is a copy of the leftmost argument when several arguments are equivalent to the smallest. +| y is a copy of the rightmost argument when several arguments are equivalent to the largest. +| If an implementation not support C++14 initializer_list (SPROUT_NO_CXX14_INITIALIZER_LIST defined), then this function is not specified constexpr. + +Complexity +======================================== + +| At most ``(3/2) * t.size()`` applications of the corresponding predicate. +| Recursive function invocations in *O(logN)* (logarithmic) depth. + +Header +======================================== + +| ``sprout/algorithm/minmax.hpp`` +| Convenience header: ``sprout/algorithm.hpp`` + diff --git a/docs/libs/sprout/algorithm/index.html b/docs/libs/sprout/algorithm/index.html index 4d72a2a3..bec5aaf5 100644 --- a/docs/libs/sprout/algorithm/index.html +++ b/docs/libs/sprout/algorithm/index.html @@ -105,9 +105,9 @@

Minimum and maximum

    -
  • min
  • -
  • max
  • -
  • minmax
  • +
  • min
  • +
  • max
  • +
  • minmax
  • min_element
  • max_element
  • minmax_element
  • diff --git a/docs/libs/sprout/algorithm/is_heap_until.html b/docs/libs/sprout/algorithm/is_heap_until.html index 44b7d428..f069b0e6 100644 --- a/docs/libs/sprout/algorithm/is_heap_until.html +++ b/docs/libs/sprout/algorithm/is_heap_until.html @@ -21,6 +21,7 @@ + @@ -30,6 +31,9 @@
  • index
  • +
  • + next |
  • previous |
  • @@ -116,6 +120,9 @@

    Previous topic

    is_heap

    +

    Next topic

    +

    min

    This Page

    • index
    • +
    • + next |
    • previous |
    • diff --git a/docs/libs/sprout/algorithm/max.html b/docs/libs/sprout/algorithm/max.html new file mode 100644 index 00000000..05fde89a --- /dev/null +++ b/docs/libs/sprout/algorithm/max.html @@ -0,0 +1,218 @@ + + + + + + + max — Sprout v1.0 documentation + + + + + + + + + + + + + +
      +
      +
      +
      + +
      +

      max

      +
      +

      Interface

      +
      template<typename T>
      +inline SPROUT_CONSTEXPR T const&
      +max(T const& a, T const& b);
      +
      +template<typename T, typename Compare>
      +inline SPROUT_CONSTEXPR T const&
      +max(T const& a, T const& b, Compare comp);
      +
      +
      +
      +
      +

      Requires

      +
      +
      Type T is LessThanComparable.
      +
      +
      +
      +

      Returns

      +
      +
      The larger value.
      +
      +
      +
      +

      Remarks

      +
      +
      Returns the first argument when the arguments are equivalent.
      +
      +
      +
      +

      Examples

      +
      #include <sprout/algorithm/max.hpp>
      +#include <sprout/array.hpp>
      +using namespace sprout;
      +
      +SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{-1, 1}};
      +SPROUT_STATIC_CONSTEXPR auto result = sprout::max(input[0], input[1]);
      +static_assert(result == 1, "max value is 1.");
      +
      +
      +
      +
      +
      +

      Interface

      +
      template<typename T, typename Compare>
      +inline SPROUT_CONSTEXPR T
      +max(std::initializer_list<T> t, Compare comp);
      +
      +template<typename T>
      +inline SPROUT_CONSTEXPR T
      +max(std::initializer_list<T> t);
      +
      +
      +
      +
      +

      Requires

      +
      +
      T is LessThanComparable and CopyConstructible and t.size() > 0.
      +
      +
      +
      +

      Returns

      +
      +
      The largest value in the initializer_list.
      +
      +
      +
      +

      Remarks

      +
      +
      Returns a copy of the leftmost argument when several arguments are equivalent to the largest.
      +
      If an implementation not support C++14 initializer_list (SPROUT_NO_CXX14_INITIALIZER_LIST defined), then this function is not specified constexpr.
      +
      +
      +
      +

      Complexity

      +
      +
      Recursive function invocations in O(logN) (logarithmic) depth.
      +
      +
      + +
      + + +
      +
      +
      +
      +
      +

      Table Of Contents

      + + +

      Previous topic

      +

      min

      +

      Next topic

      +

      minmax

      +

      This Page

      + + + +
      +
      +
      +
      + + + + \ No newline at end of file diff --git a/docs/libs/sprout/algorithm/min.html b/docs/libs/sprout/algorithm/min.html new file mode 100644 index 00000000..ef255702 --- /dev/null +++ b/docs/libs/sprout/algorithm/min.html @@ -0,0 +1,218 @@ + + + + + + + min — Sprout v1.0 documentation + + + + + + + + + + + + + +
      +
      +
      +
      + +
      +

      min

      +
      +

      Interface

      +
      template<typename T>
      +inline SPROUT_CONSTEXPR T const&
      +min(T const& a, T const& b);
      +
      +template<typename T, typename Compare>
      +inline SPROUT_CONSTEXPR T const&
      +min(T const& a, T const& b, Compare comp);
      +
      +
      +
      +
      +

      Requires

      +
      +
      Type T is LessThanComparable.
      +
      +
      +
      +

      Returns

      +
      +
      The smaller value.
      +
      +
      +
      +

      Remarks

      +
      +
      Returns the first argument when the arguments are equivalent.
      +
      +
      +
      +

      Examples

      +
      #include <sprout/algorithm/min.hpp>
      +#include <sprout/array.hpp>
      +using namespace sprout;
      +
      +SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{-1, 1}};
      +SPROUT_STATIC_CONSTEXPR auto result = sprout::min(input[0], input[1]);
      +static_assert(result == -1, "min value is -1.");
      +
      +
      +
      +
      +
      +

      Interface

      +
      template<typename T, typename Compare>
      +inline SPROUT_CONSTEXPR T
      +min(std::initializer_list<T> t, Compare comp);
      +
      +template<typename T>
      +inline SPROUT_CONSTEXPR T
      +min(std::initializer_list<T> t);
      +
      +
      +
      +
      +

      Requires

      +
      +
      T is LessThanComparable and CopyConstructible and t.size() > 0.
      +
      +
      +
      +

      Returns

      +
      +
      The smallest value in the initializer_list.
      +
      +
      +
      +

      Remarks

      +
      +
      Returns a copy of the leftmost argument when several arguments are equivalent to the smallest.
      +
      If an implementation not support C++14 initializer_list (SPROUT_NO_CXX14_INITIALIZER_LIST defined), then this function is not specified constexpr.
      +
      +
      +
      +

      Complexity

      +
      +
      Recursive function invocations in O(logN) (logarithmic) depth.
      +
      +
      + +
      + + +
      +
      +
      +
      +
      +

      Table Of Contents

      + + +

      Previous topic

      +

      is_heap_until

      +

      Next topic

      +

      max

      +

      This Page

      + + + +
      +
      +
      +
      + + + + \ No newline at end of file diff --git a/docs/libs/sprout/algorithm/minmax.html b/docs/libs/sprout/algorithm/minmax.html new file mode 100644 index 00000000..59981d7d --- /dev/null +++ b/docs/libs/sprout/algorithm/minmax.html @@ -0,0 +1,222 @@ + + + + + + + minmax — Sprout v1.0 documentation + + + + + + + + + + + + +
      +
      +
      +
      + +
      +

      minmax

      +
      +

      Interface

      +
      template<typename T>
      +inline SPROUT_CONSTEXPR sprout::pair<T const&, T const&>
      +minmax(T const& a, T const& b);
      +
      +template<typename T, typename Compare>
      +inline SPROUT_CONSTEXPR sprout::pair<T const&, T const&>
      +minmax(T const& a, T const& b, Compare comp);
      +
      +
      +
      +
      +

      Requires

      +
      +
      Type T shall be LessThanComparable.
      +
      +
      +
      +

      Returns

      +
      +
      pair<T, T>(x, y), where x has the smallest and y has the largest value in the initializer list.
      +
      +
      +
      +

      Remarks

      +
      +
      Returns pair<const T&, const T&>(a, b) when the arguments are equivalent.
      +
      +
      +
      +

      Remarks

      +
      +
      +

      Examples

      +
      #include <sprout/algorithm/minmax.hpp>
      +#include <sprout/array.hpp>
      +using namespace sprout;
      +
      +SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{-1, 1}};
      +SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax(input[0], input[1]);
      +static_assert(result.first == -1, "min value is -1.");
      +static_assert(result.second == 1, "max value is 1.");
      +
      +
      +
      +
      +

      Complexity

      +
      +
      Exactly one comparison.
      +
      +
      +
      +
      +

      Interface

      +
      template<typename T, typename Compare>
      +inline SPROUT_CONSTEXPR sprout::pair<T, T>
      +minmax(std::initializer_list<T> t, Compare comp);
      +
      +template<typename T>
      +inline SPROUT_CONSTEXPR sprout::pair<T, T>
      +minmax(std::initializer_list<T> t);
      +
      +
      +
      +
      +

      Requires

      +
      +
      T is LessThanComparable and CopyConstructible and t.size() > 0.
      +
      +
      +
      +

      Returns

      +
      +
      pair<T, T>(x, y), where x has the smallest and y has the largest value in the initializer list.
      +
      +
      +
      +

      Remarks

      +
      +
      x is a copy of the leftmost argument when several arguments are equivalent to the smallest.
      +
      y is a copy of the rightmost argument when several arguments are equivalent to the largest.
      +
      If an implementation not support C++14 initializer_list (SPROUT_NO_CXX14_INITIALIZER_LIST defined), then this function is not specified constexpr.
      +
      +
      +
      +

      Complexity

      +
      +
      At most (3/2) * t.size() applications of the corresponding predicate.
      +
      Recursive function invocations in O(logN) (logarithmic) depth.
      +
      +
      + +
      + + +
      +
      +
      +
      +
      +

      Table Of Contents

      + + +

      Previous topic

      +

      max

      +

      This Page

      + + + +
      +
      +
      +
      + + + + \ No newline at end of file diff --git a/docs/searchindex.js b/docs/searchindex.js index 8688ba53..568c82cf 100644 --- a/docs/searchindex.js +++ b/docs/searchindex.js @@ -1 +1 @@ -Search.setIndex({desctypes:{},terms:{logarithm:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],static_s:21,all:[12,35,5,17],distanc:[11,28,7],set:4,c_arrai:21,less:[10,25,14,17,36],sprout:[0,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38],random:[11,0,20],greater_equ:15,all_of:[18,17],accompani:20,through:20,binarypred:[0,11,4,14,23,25,37,16],follow:[0,19,37,31,3,4,14,23,25,36,27,16,13,38],pointer:21,find:[18,19,4,14,23,25],find_if:[18,38],is_strictly_increas:[18,30],content:9,onli:[21,33,26,20],inlin:[32,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],"const":[32,19,31,3,12,5,21,35,24,22,26,25,27],miscellan:2,copyright:[9,20],also:[35,5],front:21,is_sort:[18,30,10,34,15,6],fix:2,binary_search:[18,35],less_equ:30,blog:20,destroi:21,forwarditerator2:[11,23,4,14],exposit:21,requir:[0,3,5,11,35,25,27],under:20,mail:20,subsequ:[23,25,14],is_strictly_decreas:[18,15],arrai:[32,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],match:4,applic:[0,29,19,1,31,11,12,4,22,14,33,23,24,25,36,26,37,16,13,17,38],non:[18,32,25],license_1_0:20,"return":[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],string:2,murakami:20,fals:[0,29,1,11,12,22,33,24,26,17],auto:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],is_sorted_until:[18,6,7],express:[3,35,27,5],clang:20,number:[13,31,20],range_adaptor:2,facebook:20,increas:[30,10],none_of:[18,29],rbegin:21,recurs:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],min_el:18,lexicographical_compar:18,document:[9,20],like:2,specif:2,one_of_equ:[18,26],list:[11,0,37,2],synthes:[2,20],iter:[1,26,3,4,7,11,12,13,14,16,17,0,19,21,22,23,24,25,2,27,28,29,31,33,35,36,37,38],const_refer:21,mode:20,partit:[3,35,27,5],each:[16,20],pars:[2,20],found:[19,4,14,23,35,25,36,37,16,38],path:20,elem:21,where:[11,16],page:[9,20],compil:[9,20],upper:[27,5],impli:[35,5],find_end:[18,23],version:20,twitter:20,linux:20,some:4,back:21,range_numer:2,minmax:18,see:20,last1:[0,11,4,14,23,37],integ:[23,25,14],domain:2,instal:[9,20],logn:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],any_of_equ:[18,22],make_pair:5,librari:[9,2,20],integr:25,compat:2,index:9,txt:20,slideshar:20,neg:25,brief:20,all_of_equ:[18,12,5],categori:2,inputiterator1:[0,4,37],inputiterator2:[0,37],mathemat:2,const_point:21,sequenc:[18,23,25,14,2],nonempti:16,condit:[0,19,37,31,3,4,14,23,35,25,36,27,16,13,38],size:[21,25,2],boost:20,refer:21,value_typ:21,log2:[3,35,27,5],linear:[28,7],forwarditerator1:[11,23,14],numer:2,comp:[3,5,6,35,7,27,28,8],gener:2,contain:[1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,20,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],tristate_lexicographical_compar:18,effect:[23,4,25,14],cbegin:21,constexpr:20,base:20,bitset:2,repositori:20,otherwis:[0,29,1,11,12,22,14,33,24,26,7,28,17],org:20,decreas:[15,34],modifi:[18,21],randomaccessiter:[28,8],valu:[19,31,3,12,4,5,14,23,11,35,24,21,26,22,25,27,16],satisfi:35,search:[18,9,35,14],store:2,last:[1,3,5,6,7,8,10,12,13,15,16,17,19,22,30,24,25,26,27,28,29,23,31,33,34,35,36,38],upper_bound:[18,27,5],most:[0,29,19,1,3,12,4,5,14,33,23,35,24,22,36,26,25,27,37,17,38],until:[28,7],equal:[18,0,19,31,11,12,4,5,14,23,24,22,26,25,16],greater:[29,1,33,34,38],static_assert:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],is_heap_until:[18,28,8],range_algorithm:2,ptrdiff_t:21,implement:21,bolero:20,support:[9,2,20],search_n:[18,25],oper:[18,21],softwar:20,rang:[1,3,4,5,7,11,12,13,14,16,17,0,19,22,23,24,25,26,27,28,29,31,33,35,36,37,38],compar:[3,5,6,35,7,27,28,8],declval:21,adjacent_find:[18,16],modul:9,bound:[3,27,5],forwarditer:[30,15,10,3,5,34,6,35,25,7,27,16],header:[0,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38],permut:11,empti:[29,1,21,12,4,22,14,33,23,24,26,17],is_permut:[18,11],max_el:18,respect:[3,35,27,5],minmax_el:18,lexicograph:18,inputiter:[29,19,1,31,12,13,22,33,24,36,26,17,38],preprocessor:2,bind2nd:[29,1,13,33,36,17,38],given:[11,0,37],fill:21,would:11,pred:[0,29,1,11,4,14,33,23,25,36,37,16,13,17,38],licens:20,capac:21,construct:21,bool:[0,15,10,1,29,11,12,22,33,34,6,21,35,24,26,30,17,8],websit:20,start:20,adjac:16,interfac:[32,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],includ:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],find_first_of:[18,4],second:[37,5],strictli:[15,30],conveni:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],type:[21,25],individu:20,compliant:2,swap:[21,32],"function":[32,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],from:[19,31,4,14,23,25,36,16,13,38],option:2,both:16,namespac:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],tupl:2,copi:[21,20],mismatch:[18,37],metaprogram:2,ani:[1,3,22,14,23,25,27],std:[21,32,13,31],link:20,indic:9,sprout_noexcept_expr:[21,32],iterator_trait:[13,31],first1:[0,11,4,14,23,37],first2:[0,11,4,14,23,37],hold:[0,19,37,31,3,4,14,23,25,36,27,16,13,38],"true":[0,29,1,11,12,22,33,35,24,26,17],than:[29,1,14,33,25,36,17,38],count:[18,13,25,31],none:[29,24],input:[1,3,5,6,7,8,10,12,13,15,16,17,19,22,30,24,26,27,28,29,31,33,34,35,36,38],stl:2,hpp:[0,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38],access:[11,0,21],maximum:18,structur:2,const_reverse_iter:21,project:[9,20],defin:21,sprout_constexpr:[32,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],minimum:18,below:[11,0,37],cend:21,www:20,crend:21,furthermost:[3,27],meet:[11,0],invoc:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],other:[16,20],arr:32,none_of_equ:[18,24],result:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],point:20,sort:[18,6,7],input1:[0,19,11,4,14,23,25,36,37,38],constant:21,rend:21,give:20,"int":[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],can:20,last2:[0,11,4,14,23,37],argument:[11,0,37],templat:[32,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],rai:[2,20],typedef:21,exist:11,file:20,tabl:9,everi:[0,12,24,29,17],clamp:18,predic:[0,29,19,1,31,11,12,4,22,14,33,23,24,25,36,26,37,16,13,17,38],worst:11,count_if:[18,13],denot:[11,0,37],to_arrai:32,end:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],welcom:[9,20],author:[9,20],odd:13,nonneg:[23,14],depth:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],same:[15,30,10,34],data:[21,2],member:[21,32],binari:[18,35],complex:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],find_if_not:[18,36],modulu:13,which:[19,31,20,16,13,36,7,37,28,38],lower_bound:[18,3,5],difference_typ:[21,13,31],size_t:[21,32],equal_rang:[18,5],"void":[21,32],sprout_noexcept:21,sprout_static_constexpr:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],begin:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],http:20,distribut:20,trace:[2,20],shall:[3,25,27,5],max:18,"class":[21,32,2],object:2,variant:2,gcc:20,posit:[19,37,3,28,4,5,14,23,25,36,7,27,16,38],size_typ:21,initi:21,max_siz:21,typenam:[32,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],pair:[37,5],crbegin:21,comparison:[18,3,35,27,5],const_iter:21,one_of:[18,33],heap:[18,28,8],remark:[11,0,37],input2:[0,11,4,14,23,37],exactli:[11,13,16,31],lower:[3,5],github:20,is_decreas:[18,34],algorithm:[0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],reverse_iter:21,directori:20,min:[18,0,37,16],descript:[21,20],correspond:[0,19,37,31,3,4,14,23,11,35,25,36,27,16,13,38],assign:21,is_heap:[18,8],exampl:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,0,19,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38],thi:20,alphabet:2,is_increas:[18,10],element:[19,31,3,4,5,11,35,21,36,27,16,13,38],first:[1,3,4,5,6,7,8,10,12,13,14,15,16,17,19,22,30,24,25,26,27,28,29,31,33,34,35,36,37,38],convert:25,any_of:[18,1]},titles:["equal","any_of","Libraries","lower_bound","find_first_of","equal_range","is_sorted","is_sorted_until","is_heap","Welcome to Sprout’s documentation!","is_increasing","is_permutation","all_of_equal","count_if","search","is_strictly_decreasing","adjacent_find","all_of","Sprout.Algorithm","find","Sprout C++ Libraries","Class template array","any_of_equal","find_end","none_of_equal","search_n","one_of_equal","upper_bound","is_heap_until","none_of","is_strictly_increasing","count","Sprout.Array","one_of","is_decreasing","binary_search","find_if_not","mismatch","find_if"],modules:{},descrefs:{},filenames:["libs/sprout/algorithm/equal","libs/sprout/algorithm/any_of","libs/libraries","libs/sprout/algorithm/lower_bound","libs/sprout/algorithm/find_first_of","libs/sprout/algorithm/equal_range","libs/sprout/algorithm/is_sorted","libs/sprout/algorithm/is_sorted_until","libs/sprout/algorithm/is_heap","index","libs/sprout/algorithm/is_increasing","libs/sprout/algorithm/is_permutation","libs/sprout/algorithm/all_of_equal","libs/sprout/algorithm/count_if","libs/sprout/algorithm/search","libs/sprout/algorithm/is_strictly_decreasing","libs/sprout/algorithm/adjacent_find","libs/sprout/algorithm/all_of","libs/sprout/algorithm/index","libs/sprout/algorithm/find","libs/index","libs/sprout/array/array/index","libs/sprout/algorithm/any_of_equal","libs/sprout/algorithm/find_end","libs/sprout/algorithm/none_of_equal","libs/sprout/algorithm/search_n","libs/sprout/algorithm/one_of_equal","libs/sprout/algorithm/upper_bound","libs/sprout/algorithm/is_heap_until","libs/sprout/algorithm/none_of","libs/sprout/algorithm/is_strictly_increasing","libs/sprout/algorithm/count","libs/sprout/array/index","libs/sprout/algorithm/one_of","libs/sprout/algorithm/is_decreasing","libs/sprout/algorithm/binary_search","libs/sprout/algorithm/find_if_not","libs/sprout/algorithm/mismatch","libs/sprout/algorithm/find_if"]}) \ No newline at end of file +Search.setIndex({desctypes:{},terms:{all:[13,38,5,20],follow:[0,22,40,34,3,4,15,26,28,39,30,19,14,41],find_if:[21,41],value_typ:24,content:9,"const":[35,22,18,11,3,13,5,24,38,27,25,29,17,28,30,34],bind2nd:[32,1,14,36,39,20,41],rightmost:11,swap:[24,35],under:23,iterator_trait:[14,34],is_strictly_decreas:[21,16],sprout_no_cxx14_initializer_list:[17,18,11],everi:[0,13,27,32,20],string:2,fals:[0,32,1,12,13,25,36,27,29,20],"void":[24,35],worst:12,greater_equ:16,min_el:21,one_of_equ:[21,29],list:[12,0,40,2,11],iter:[1,29,3,4,7,12,13,14,15,19,20,0,22,24,25,26,27,28,2,30,31,32,34,36,38,39,40,41],initializer_list:[17,18,11],upper:[30,5],impli:[38,5],find_end:[21,26],second:[40,5,11],odd:14,forwarditerator2:[12,26,4,15],compat:2,index:9,compar:[11,3,5,6,17,38,18,7,30,31,8],neg:28,brief:23,access:[12,24,0],inputiterator1:[0,4,40],inputiterator2:[0,40],version:23,boost:23,gener:2,satisfi:38,path:23,modifi:[21,24],valu:[22,18,11,3,13,4,5,15,26,12,38,27,24,29,25,17,28,30,19,34],search:[21,9,38,15],larger:17,base:23,is_heap_until:[21,31,8],implement:[24,17,18,11],modul:9,instal:[9,23],txt:23,range_numer:2,from:[22,34,4,15,26,28,39,19,14,41],would:12,pred:[0,32,1,12,4,15,36,26,28,39,40,19,14,20,41],websit:23,type:[24,17,28,18,11],until:[31,7],sort:[21,6,7],mismatch:[21,40],indic:9,hold:[0,22,40,34,3,4,15,26,28,39,30,19,14,41],logarithm:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],none:[32,27],can:23,meet:[12,0],input2:[0,12,4,15,26,40],input1:[0,22,12,4,15,26,28,39,40,41],give:23,templat:[35,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],minimum:21,count_if:[21,14],gcc:23,end:[1,3,4,5,6,7,8,10,12,13,14,15,16,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],find_if_not:[21,39],is_sorted_until:[21,6,7],max:[21,17,11],variant:2,data:[24,2],github:23,correspond:[0,22,40,34,11,3,4,15,26,12,38,28,39,30,19,14,41],element:[22,34,3,4,5,12,38,24,39,30,19,14,41],facebook:23,sprout:[0,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41],through:23,binarypred:[0,12,4,15,26,28,40,19],pointer:24,tristate_lexicographical_compar:21,fix:2,mail:23,non:[21,35,28],"return":[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],greater:[32,1,36,37,41],murakami:23,auto:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],initi:[24,11],front:24,lexicographical_compar:21,mode:23,each:[19,23],found:[22,4,15,26,38,28,39,40,19,41],compil:[9,23],adjacent_find:[21,19],domain:2,individu:23,logn:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],all_of_equ:[21,13,5],categori:2,typenam:[35,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],size:[18,11,24,17,28,2],log2:[3,38,30,5],linear:[31,7],forwarditerator1:[12,26,15],none_of_equ:[21,27],org:23,upper_bound:[21,30,5],one_of:[21,36],assign:24,first:[1,3,4,5,6,7,8,10,11,13,14,15,16,18,19,20,22,17,25,33,27,28,29,30,31,32,34,36,37,38,39,40,41],oper:[21,24],softwar:23,rang:[1,3,4,5,7,12,13,14,15,19,20,0,22,25,26,27,28,29,30,31,32,34,36,38,39,40,41],declval:24,arrai:[35,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],number:[14,34,23],smaller:18,max_el:21,lexicograph:21,inputiter:[32,22,1,34,13,14,25,36,27,39,29,20,41],given:[12,0,40],const_iter:24,licens:23,capac:24,construct:24,conveni:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],store:2,option:2,namespac:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],copi:[24,17,23,18,11],specifi:[17,18,11],pars:[2,23],c_arrai:24,first1:[0,12,4,15,26,40],first2:[0,12,4,15,26,40],exactli:[12,14,19,34,11],than:[32,1,15,36,28,39,20,41],std:[35,34,11,24,14,17,18],stl:2,structur:2,project:[9,23],posit:[22,40,3,31,4,5,15,26,28,39,7,30,19,41],rend:24,ani:[1,3,25,15,26,28,30],rai:[2,23],tabl:9,predic:[1,4,11,12,13,14,15,19,20,0,22,25,26,27,28,29,32,34,36,39,40,41],equival:[17,18,11],min:[21,0,11,18,40,19],destroi:24,also:[38,5],exposit:24,which:[22,34,23,19,14,39,7,40,31,41],equal_rang:[21,5],const_refer:24,sprout_noexcept:24,begin:[1,3,4,5,6,7,8,10,12,13,14,15,16,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],distribut:23,trace:[2,23],shall:[3,28,30,5,11],object:2,most:[1,3,4,5,11,13,15,20,0,22,25,26,27,28,29,30,32,36,38,39,40,41],pair:[40,5,11],crbegin:24,"class":[24,35,2],accompani:23,binary_search:[21,38],random:[12,0,23],rbegin:24,all_of:[21,20],find:[21,22,4,15,26,28],onli:[24,36,29,23],copyright:[9,23],lower_bound:[21,3,5],express:[3,38,30,5],clang:23,range_adaptor:2,increas:[33,10],none_of:[21,32],is_sort:[21,33,10,37,16,6],requir:[0,11,3,5,12,38,28,18,17,30],synthes:[2,23],integr:28,partit:[3,38,30,5],contain:[1,2,3,4,5,6,7,8,10,12,13,14,15,16,19,20,0,22,23,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],where:[12,19,11],arr:35,set:4,minmax:[21,11],see:23,result:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],any_of_equ:[21,25],modulu:14,slideshar:23,less_equ:33,smallest:[18,11],numer:2,comp:[11,3,5,6,17,38,18,7,30,31,8],typedef:24,cbegin:24,constexpr:[17,23,18,11],bitset:2,randomaccessiter:[31,8],both:19,metaprogram:2,last:[1,3,5,6,7,8,10,13,14,16,19,20,22,25,33,27,28,29,30,31,32,26,34,36,37,38,39,41],equal:[21,0,22,34,12,13,4,5,15,26,27,25,29,28,19],range_algorithm:2,preprocessor:2,static_s:24,point:23,header:[0,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41],permut:12,linux:23,respect:[3,38,30,5],minmax_el:21,difference_typ:[24,14,34],empti:[32,1,24,13,4,25,15,36,26,27,29,20],cend:24,remark:[0,11,12,17,18,40],argument:[0,11,12,17,18,40],sprout_noexcept_expr:[24,35],defin:[24,17,18,11],sprout_constexpr:[35,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],furthermost:[3,30],decreas:[16,37],invoc:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],bolero:23,sever:[17,18,11],welcom:[9,23],author:[9,23],alphabet:2,nonneg:[26,15],same:[16,33,10,37],member:[24,35],binari:[21,38],complex:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],largest:[17,11],document:[9,23],http:23,effect:[26,4,28,15],lower:[3,5],elem:24,is_heap:[21,8],exampl:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],thi:[17,23,18,11],sprout_static_constexpr:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],distanc:[12,31,7],less:[10,28,15,20,39],license_1_0:23,is_strictly_increas:[21,33],static_assert:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],miscellan:2,size_t:[24,35],blog:23,input:[1,3,5,6,7,8,10,11,13,14,16,18,19,20,22,17,25,33,27,29,30,31,32,34,36,37,38,39,41],subsequ:[26,28,15],match:4,applic:[1,4,11,12,13,14,15,19,20,0,22,25,26,27,28,29,32,34,36,39,40,41],is_increas:[21,10],recurs:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],like:2,specif:2,integ:[26,28,15],page:[9,23],www:23,twitter:23,is_permut:[21,12],some:4,back:24,last1:[0,12,4,15,26,40],last2:[0,12,4,15,26,40],make_pair:5,librari:[9,2,23],mathemat:2,const_point:24,nonempti:19,condit:[0,22,40,34,3,4,15,26,38,28,39,30,19,14,41],leftmost:[17,18,11],refer:24,repositori:23,lessthancompar:[17,18,11],comparison:[21,11,3,5,38,30],size_typ:24,find_first_of:[21,4],ptrdiff_t:24,search_n:[21,28],any_of:[21,1],clamp:21,bound:[3,30,5],forwarditer:[33,16,10,3,5,37,6,38,28,7,30,19],support:[9,18,23,17,11,2],start:23,compliant:2,interfac:[35,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],includ:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],strictli:[16,33],const_reverse_iter:24,"function":[35,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,0,22,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],tupl:2,link:23,heap:[21,31,8],inlin:[35,1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],"true":[0,32,1,12,13,25,36,38,27,29,20],count:[21,14,28,34],maximum:21,is_decreas:[21,37],below:[12,0,40],crend:24,otherwis:[0,32,1,12,13,25,15,36,27,29,7,31,20],constant:24,"int":[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],to_arrai:35,exist:12,file:23,adjac:19,fill:24,denot:[12,0,40],copyconstruct:[17,18,11],hpp:[0,1,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41],when:[17,18,11],other:[19,23],bool:[0,16,10,1,32,12,13,25,36,37,6,24,38,27,29,33,20,8],sequenc:[21,26,28,15,2],max_siz:24,algorithm:[0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,21,22,23,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],reverse_iter:24,directori:23,descript:[24,23],depth:[1,3,4,5,6,7,8,10,11,12,13,14,15,16,18,19,20,0,22,17,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41],convert:28},titles:["equal","any_of","Libraries","lower_bound","find_first_of","equal_range","is_sorted","is_sorted_until","is_heap","Welcome to Sprout’s documentation!","is_increasing","minmax","is_permutation","all_of_equal","count_if","search","is_strictly_decreasing","max","min","adjacent_find","all_of","Sprout.Algorithm","find","Sprout C++ Libraries","Class template array","any_of_equal","find_end","none_of_equal","search_n","one_of_equal","upper_bound","is_heap_until","none_of","is_strictly_increasing","count","Sprout.Array","one_of","is_decreasing","binary_search","find_if_not","mismatch","find_if"],modules:{},descrefs:{},filenames:["libs/sprout/algorithm/equal","libs/sprout/algorithm/any_of","libs/libraries","libs/sprout/algorithm/lower_bound","libs/sprout/algorithm/find_first_of","libs/sprout/algorithm/equal_range","libs/sprout/algorithm/is_sorted","libs/sprout/algorithm/is_sorted_until","libs/sprout/algorithm/is_heap","index","libs/sprout/algorithm/is_increasing","libs/sprout/algorithm/minmax","libs/sprout/algorithm/is_permutation","libs/sprout/algorithm/all_of_equal","libs/sprout/algorithm/count_if","libs/sprout/algorithm/search","libs/sprout/algorithm/is_strictly_decreasing","libs/sprout/algorithm/max","libs/sprout/algorithm/min","libs/sprout/algorithm/adjacent_find","libs/sprout/algorithm/all_of","libs/sprout/algorithm/index","libs/sprout/algorithm/find","libs/index","libs/sprout/array/array/index","libs/sprout/algorithm/any_of_equal","libs/sprout/algorithm/find_end","libs/sprout/algorithm/none_of_equal","libs/sprout/algorithm/search_n","libs/sprout/algorithm/one_of_equal","libs/sprout/algorithm/upper_bound","libs/sprout/algorithm/is_heap_until","libs/sprout/algorithm/none_of","libs/sprout/algorithm/is_strictly_increasing","libs/sprout/algorithm/count","libs/sprout/array/index","libs/sprout/algorithm/one_of","libs/sprout/algorithm/is_decreasing","libs/sprout/algorithm/binary_search","libs/sprout/algorithm/find_if_not","libs/sprout/algorithm/mismatch","libs/sprout/algorithm/find_if"]}) \ No newline at end of file diff --git a/index.html b/index.html index 5e3de8c6..0b6b08a6 100644 --- a/index.html +++ b/index.html @@ -23,7 +23,7 @@ - Bolero's website + Bolero's website