King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-07-02 14:04:09 +00:00
Code Issues Releases Wiki Activity

fix doc: tristate_lexicographical_compare

Browse source
This commit is contained in:
Bolero-MURAKAMI 2013-09-04 12:32:12 +09:00
parent 2766cb0ca5
commit 32f501da05
5 changed files with 16 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

2
source/libs/algorithm/tristate_lexicographical_compare.rst
View file

@ -45,7 +45,7 @@ Returns
| Otherwise, a value greater than zero if the sequence of elements defined by the range [first1,last1) is lexicographically greater than the sequence of elements defined by the range [first2,last2).
| Otherwise, returns a zero value.
| If the delimiter version, last1 and last2 are replaced by ``find(first1, last1, delim1)`` and ``find(first2,last2,delim2)``.
| If the delimiter version, last1 and last2 the following corresponding transformations: ``find_if(first1, last1, bind2nd(equiv(), delim1))`` and ``find_if(first2, last2, bind2nd(equiv(), delim1))``, ``find_if(first1, last1, bind2nd(equiv(comp), delim1))`` and ``find_if(first2, last2, bind2nd(equiv(comp), delim1))``.
Remarks
========================================