Namensräume
Varianten
Aktionen

cpp/algorithm/includes: Unterschied zwischen den Versionen

Aus cppreference.com
< cpp‎ | algorithm
K (1 Version: Translate from the English version)
K (Fix previous edit)
 
(4 dazwischenliegende Versionen von 3 Benutzern werden nicht angezeigt)
Zeile 1: Zeile 1:
 +
 
{{cpp/title|includes}}
 
{{cpp/title|includes}}
 
{{cpp/algorithm/navbar}}
 
{{cpp/algorithm/navbar}}
−
{{ddcl list begin}}
+
{{begin}}
−
{{ddcl list header | algorithm}}
+
{{header | algorithm}}
−
{{ddcl list item | num=1 |
+
{{| num=1 |
 
template< class InputIt1, class InputIt2 >
 
template< class InputIt1, class InputIt2 >
 
bool includes( InputIt1 first1, InputIt1 last1,
 
bool includes( InputIt1 first1, InputIt1 last1,
 
               InputIt2 first2, InputIt2 last2 );
 
               InputIt2 first2, InputIt2 last2 );
 
}}
 
}}
−
{{ddcl list item | num=2 |
+
{{| num=2 |
 
template< class InputIt1, class InputIt2 >
 
template< class InputIt1, class InputIt2 >
 
bool includes( InputIt1 first1, InputIt1 last1,
 
bool includes( InputIt1 first1, InputIt1 last1,
 
               InputIt2 first2, InputIt2 last2, Compare comp );
 
               InputIt2 first2, InputIt2 last2, Compare comp );
 
}}
 
}}
−
{{ddcl list end}}
+
{{end}}
  
 
{{tr|Versandkosten {{c|true}} wenn jedes Element aus der sortierten Bereich {{tt|[first2, last2)}} wird innerhalb der sortierten Bereich {{tt|[first, last)}} gefunden. Gibt auch {{c|true}} wenn {{tt|[first2, last2)}} ist leer . |Returns {{c|true}} if every element from the sorted range {{tt|[first2, last2)}} is found within the sorted range {{tt|[first, last)}}. Also returns {{c|true}} if {{tt|[first2, last2)}} is empty. }}
 
{{tr|Versandkosten {{c|true}} wenn jedes Element aus der sortierten Bereich {{tt|[first2, last2)}} wird innerhalb der sortierten Bereich {{tt|[first, last)}} gefunden. Gibt auch {{c|true}} wenn {{tt|[first2, last2)}} ist leer . |Returns {{c|true}} if every element from the sorted range {{tt|[first2, last2)}} is found within the sorted range {{tt|[first, last)}}. Also returns {{c|true}} if {{tt|[first2, last2)}} is empty. }}
Zeile 20: Zeile 21:
  
 
===Parameter===
 
===Parameter===
−
{{param list begin}}
+
{{begin}}
−
{{param list item | first1, last1 |{{tr| die sortierte Palette von Elementen zu untersuchen| the sorted range of elements to examine}}}}
+
{{| first1, last1 |{{tr| die sortierte Palette von Elementen zu untersuchen| the sorted range of elements to examine}}}}
−
{{param list item | first2, last2 |{{tr| die sortierte Palette von Elementen zu suchen| the sorted range of elements to search for}}}}
+
{{| first2, last2 |{{tr| die sortierte Palette von Elementen zu suchen| the sorted range of elements to search for}}}}
−
{{param list cmp | comp | p1=InputIt}}  
+
{{cmp | comp | p1=InputIt}}  
−
{{param list hreq}}
+
{{hreq}}
−
{{param list req concept | InputIt | InputIterator}}
+
{{req concept | InputIt | InputIterator}}
−
{{param list end}}
+
{{end}}
  
 
===Rückgabewert===
 
===Rückgabewert===
Zeile 116: Zeile 117:
  
 
===Siehe auch===
 
===Siehe auch===
−
{{dcl list begin}}
+
{{begin}}
−
{{dcl list template | cpp/algorithm/dcl list set_difference}}
+
{{| cpp/algorithm/set_difference}}
−
{{dcl list template | cpp/algorithm/dcl list search}}
+
{{| cpp/algorithm/search}}
−
{{dcl list end}}
+
{{end}}
  
 +
 +
 +
 +
 +
 +
 
[[ru:cpp/algorithm/includes]]
 
[[ru:cpp/algorithm/includes]]
 +

Aktuelle Version vom 1. Juli 2013, 19:00 Uhr

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.

Click here for the English version of this page

 
C++
 
Algorithm Bibliothek
Funktionen
Original:
Functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Nicht-modifizierende Sequenz Operationen
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.
Modifizierende Sequenz Operationen
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.
Partitionierungsoperationen
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.
Sortierung Operationen (auf sortierten Bereiche)
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.
Binary Suchaktionen (auf sortierten Bereiche)
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.
Set-Operationen (auf sortierten Bereiche)
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
Heap-Operationen
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.
Minimum / Maximum Operationen
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.
Numerische Operationen
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.
C-Bibliothek
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.
 
definiert in Header <algorithm>
template< class InputIt1, class InputIt2 >

bool includes( InputIt1 first1, InputIt1 last1,

               InputIt2 first2, InputIt2 last2 );
 (1)
template< class InputIt1, class InputIt2 >

bool includes( InputIt1 first1, InputIt1 last1,

               InputIt2 first2, InputIt2 last2, Compare comp );
 (2)
Versandkosten true wenn jedes Element aus der sortierten Bereich [first2, last2) wird innerhalb der sortierten Bereich [first, last) gefunden. Gibt auch true wenn [first2, last2) ist leer .
Original:
Returns true if every element from the sorted range [first2, last2) is found within the sorted range [first, last). Also returns true if [first2, last2) is empty.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Die erste Version erwartet, dass beide Bereiche mit operator< sortiert werden, rechnet die zweite Version sie mit dem angegebenen Vergleichsfunktion comp sortiert werden .
Original:
The first version expects both ranges to be sorted with operator<, the second version expects them to be sorted with the given comparison function comp.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Inhaltsverzeichnis

[Bearbeiten] Parameter

first1, last1 -
die sortierte Palette von Elementen zu untersuchen
Original:
the sorted 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 -
die sortierte Palette von Elementen zu suchen
Original:
the sorted range of elements to search for
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:

 bool cmp(const Type1 &a, const Type2 &b);

The signature does not need to have const &, but the function must not modify the objects passed to it.
The types Type1 and Type2 must be such that an object of type InputIt can be dereferenced and then implicitly converted to both of them. ​

Type requirements
-
InputIt must meet the requirements of InputIterator.

[Bearbeiten] Rückgabewert

true wenn jedes Element von [first2, last2) ist ein Mitglied der [first, last) .
Original:
true if every element from [first2, last2) is a member of [first, last).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[Bearbeiten] Komplexität

Allenfalls 2·(N1+N2-1) Vergleiche, wo N1 = std::distance(first1, last1) und N2 = std::distance(first2, last2) .
Original:
At most 2·(N1+N2-1) comparisons, where N1 = std::distance(first1, last1) and N2 = std::distance(first2, last2).
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[Bearbeiten] Mögliche Implementierung

First version 
template<class InputIt1, class InputIt2>
bool includes(InputIt1 first1, InputIt1 last1,
              InputIt2 first2, InputIt2 last2)
{
    for (; first2 != last2; ++first1)
    {
        if (first1 == last1 || *first2 < *first1)
            return false;
        if ( !(*first1 < *first2) )
            ++first2;
    }
    return true;
}
Second version 
template<class InputIt1, class InputIt2>
bool includes(InputIt1 first1, InputIt1 last1,
              InputIt2 first2, InputIt2 last2, Compare comp)
{
    for (; first2 != last2; ++first1)
    {
        if (first1 == last1 || comp(*first2, *first1))
            return false;
        if (!comp(*first1, *first2))
            ++first2;
    }
    return true;
}

[Bearbeiten] Beispiel

#include <iostream>
#include <algorithm>
#include <cctype>
 
int main()
{
  std::vector<char> v1 {'a', 'b', 'c', 'f', 'h', 'x'};
  std::vector<char> v2 {'a', 'b', 'c'};
  std::vector<char> v3 {'a', 'c'};
  std::vector<char> v4 {'g'};
  std::vector<char> v5 {'a', 'c', 'g'};
  std::vector<char> v6;
 
  for (auto i : v1) std::cout << i << ' ';
  std::cout << "includes:\n";
 
  for (auto i : v2) std::cout << i << ' ';
  std::cout << ": " << std::includes(v1.begin(), v1.end(), v2.begin(), v2.end()) << '\n';
  for (auto i : v3) std::cout << i << ' ';
  std::cout << ": " << std::includes(v1.begin(), v1.end(), v3.begin(), v3.end()) << '\n';
  for (auto i : v4) std::cout << i << ' ';
  std::cout << ": " << std::includes(v1.begin(), v1.end(), v4.begin(), v4.end()) << '\n';
  for (auto i : v5) std::cout << i << ' ';
  std::cout << ": " << std::includes(v1.begin(), v1.end(), v5.begin(), v5.end()) << '\n';
  for (auto i : v6) std::cout << i << ' ';
  std::cout << ": " << std::includes(v1.begin(), v1.end(), v6.begin(), v6.end()) << '\n';
 
  auto cmp_nocase = [](char a, char b) {
    return std::tolower(a) < std::tolower(b);
  }
  std::vector<char> v7 {'A', 'B', 'C'};
  for (auto i : v7) std::cout << i << ' ';
  std::cout << ": "
            << std::includes(v1.begin(), v1.end(), v7.begin(), v7.end(), cmp_nocase)
            << '\n';
}

Output: 

a b c f h x includes:
a b c : 1
a c : 1
g : 0
a c g : 0
A B C : 1

[Bearbeiten] Siehe auch
berechnet die Differenz zwischen zwei Sätzen
Original:
computes the difference between two sets
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(Funktions-Template) [edit]
searches for a range of elements
(Funktions-Template) [edit]
Von „https://de.cppreference.com/mwiki/index.php?title=cpp/algorithm/includes&oldid=25915“