std::lexicographical_compare
|
|
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
| Defined in header <algorithm>
|
||
| template< class InputIt1, class InputIt2 > bool lexicographical_compare( InputIt1 first1, InputIt1 last1, |
(1) | |
| template< class InputIt1, class InputIt2, class Compare > bool lexicographical_compare( InputIt1 first1, InputIt1 last1, |
(2) | |
compを使用しています.comp.You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
- 二つのレンジは要素ごとに比較されます.Original:Two ranges are compared element by element.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions. - 第一の不整合要素が辞書順でどの範囲定義小さいや大きい他より.Original:The first mismatching element defines which range is lexicographically less or greater than the other.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions. - 1範囲が別の接頭辞である場合は、より短い範囲は辞書的に他より少ない'です.Original:If one range is a prefix of another, the shorter range is lexicographically less than the other.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions. - 2つの範囲に等価な要素を持ち、同じ長さのものである場合、その範囲は、辞書的には'等しい.Original:If two ranges have equivalent elements and are of the same length, then the ranges are lexicographically equal.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions. - 空の範囲は、任意の非空の範囲がより辞書式に小さい'です.Original:An empty range is lexicographically less than any non-empty range.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions. - 二つの空の範囲は、辞書的には'等しい.Original:Two empty ranges are lexicographically equal.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
目次 |
[編集] パラメータ
| first1, last1 | - | 検討する要素の最初の範囲
Original: the first range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. | |||||||||
| first2, last2 | - | 検討する要素の第2の範囲
Original: the second range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. | |||||||||
| comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. | |||||||||
| Type requirements | |||||||||||
-InputIt1, InputIt2 must meet the requirements of InputIterator.
| |||||||||||
[編集] 値を返します
You can help to correct and verify the translation. Click here for instructions.
[編集] 複雑
You can help to correct and verify the translation. Click here for instructions.
[編集] 可能な実装
| First version |
|---|
template<class InputIt1, class InputIt2> bool lexicographical_compare(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2) { for ( ; (first1 != last1) && (first2 != last2); first1++, first2++ ) { if (*first1 < *first2) return true; if (*first2 < *first1) return false; } return (first1 == last1) && (first2 != last2); } |
| Second version |
template<class InputIt1, class InputIt2, class Compare> bool lexicographical_compare(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, Compare comp) { for ( ; (first1 != last1) && (first2 != last2); first1++, first2++ ) { if (comp(*first1, *first2)) return true; if (comp(*first2, *first1)) return false; } return (first1 == last1) && (first2 != last2); } |
[編集] 例
#include <algorithm> #include <iostream> #include <vector> #include <cstdlib> #include <ctime> int main() { std::vector<char> v1 {'a', 'b', 'c', 'd'}; std::vector<char> v2 {'a', 'b', 'c', 'd'}; std::srand(std::time(0)); while (!std::lexicographical_compare(v1.begin(), v1.end(), v2.begin(), v2.end())) { for (auto c : v1) std::cout << c << ' '; std::cout << ">= "; for (auto c : v2) std::cout << c << ' '; std::cout << '\n'; std::random_shuffle(v1.begin(), v1.end()); std::random_shuffle(v2.begin(), v2.end()); } for (auto c : v1) std::cout << c << ' '; std::cout << "< "; for (auto c : v2) std::cout << c << ' '; std::cout << '\n'; }
Possible output:
a b c d >= a b c d d a b c >= c b d a b d a c >= a d c b a c d b < c d a b