std::is_sorted

 

C++

言語

コンセプト

ユーティリティライブラリ

ストリングスライブラリ

コンテナライブラリ

アルゴリズムライブラリ

イテレータライブラリ

ニューメリックスライブラリ

入力/出力ライブラリ

ローカライゼーションライブラリ

正規表現ライブラリ(C++11)

アトミック操作ライブラリ(C++11)

スレッドのサポートライブラリ(C++11)

 

アルゴリズムライブラリ

機能します Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
シーケンス動作を非改変 Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
シーケンス動作を変更する Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
操作を仕切る Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
（ソートされた範囲で）ソート操作 Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
バイナリ検索操作（ソート範囲で） Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
（ソートされた範囲で）操作を設定します Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
ヒープ操作 Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
最小値/最大値操作 Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
数値演算 Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
Cライブラリ Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template<class ForwardIt > bool is_sorted( ForwardIt first, ForwardIt last );	(1)	(C++11およびそれ以降)
template<class ForwardIt, class Compare > bool is_sorted( ForwardIt first, ForwardIt last, Compare comp );	(2)	(C++11およびそれ以降)

Checks if the elements in range [first, last) are sorted in ascending order. The first version of the function uses operator< to compare the elements, the second uses the given comparison function comp.

パラメータ

first, last	-	検討する要素の範囲 Original: the 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	-	比較関数. 最初の値が二つ目の値より小さい 場合、 ​trueを返します. 比較関数のシグネチャは以下と同等でなければなりません.  bool cmp(const Type1 &a, const Type2 &b); シグネチャはconstを含まなくても構いませんが, 比較関数は渡されたオブジェクトを変更してはなりません. The types Type1 and Type2 must be such that an object of type ForwardIt can be dereferenced and then implicitly converted to both of them. ​
型の要件
- ForwardIt は ForwardIterator の要求を満足しなければなりません。

値を返します

true if the elements in the range are sorted in ascending order

複雑性

firstlastとの間の距離の線形

Original:

linear in the distance between first and last

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

可能な実装

First version
template<class ForwardIt>bool is_sorted(ForwardIt first, ForwardIt last){returnstd::is_sorted_until(first, last)== last;}
Second version
template<class ForwardIt, class Compare>bool is_sorted(ForwardIt first, ForwardIt last, Compare comp){returnstd::is_sorted_until(first, last, comp)== last;}

例

このコードを実行します

#include <iostream>#include <algorithm>   int main(){constint N =5;int digits[N]={3, 1, 4, 1, 5};   for(auto i : digits)std::cout<< i <<' ';std::cout<<": is_sorted: "<< std::is_sorted(digits, digits+N)<<'\n';   std::sort(digits, digits+N);   for(auto i : digits)std::cout<< i <<' ';std::cout<<": is_sorted: "<< std::is_sorted(digits, digits+N)<<'\n';}

出力:

3 1 4 1 5 : is_sorted: 0 1 1 3 4 5 : is_sorted: 1

参照

is_sorted_until (C++11)	最大のソート部分範囲を見つけることができます Original: finds the largest sorted subrange The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (関数テンプレート)