A<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
		<id>http://www.cppe.ru/index.php?action=history&amp;feed=atom&amp;title=C%2B%2B_Tutorial%2Fset_multiset%2Fset_compare</id>
		<title>C++ Tutorial/set multiset/set compare - История изменений</title>
		<link rel="self" type="application/atom+xml" href="http://www.cppe.ru/index.php?action=history&amp;feed=atom&amp;title=C%2B%2B_Tutorial%2Fset_multiset%2Fset_compare"/>
		<link rel="alternate" type="text/html" href="http://www.cppe.ru/index.php?title=C%2B%2B_Tutorial/set_multiset/set_compare&amp;action=history"/>
		<updated>2026-04-17T19:35:59Z</updated>
		<subtitle>История изменений этой страницы в вики</subtitle>
		<generator>MediaWiki 1.30.0</generator>

	<entry>
		<id>http://www.cppe.ru/index.php?title=C%2B%2B_Tutorial/set_multiset/set_compare&amp;diff=2417&amp;oldid=prev</id>
		<title> в 14:21, 25 мая 2010</title>
		<link rel="alternate" type="text/html" href="http://www.cppe.ru/index.php?title=C%2B%2B_Tutorial/set_multiset/set_compare&amp;diff=2417&amp;oldid=prev"/>
				<updated>2010-05-25T14:21:17Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style=&quot;vertical-align: top;&quot; lang=&quot;ru&quot;&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Предыдущая&lt;/td&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Версия 14:21, 25 мая 2010&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; style=&quot;text-align: center;&quot; lang=&quot;ru&quot;&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(нет различий)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
			</entry>

	<entry>
		<id>http://www.cppe.ru/index.php?title=C%2B%2B_Tutorial/set_multiset/set_compare&amp;diff=2418&amp;oldid=prev</id>
		<title>Admin: 1 версия:&amp;#32;Импорт контента...</title>
		<link rel="alternate" type="text/html" href="http://www.cppe.ru/index.php?title=C%2B%2B_Tutorial/set_multiset/set_compare&amp;diff=2418&amp;oldid=prev"/>
				<updated>2010-05-25T10:29:40Z</updated>
		
		<summary type="html">&lt;p&gt;1 версия: Импорт контента...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;==Compare sets with &amp;quot;==&amp;quot; operator==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   &lt;br /&gt;
&amp;lt;source lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;set&amp;gt;&lt;br /&gt;
#include &amp;lt;iostream&amp;gt;&lt;br /&gt;
#include &amp;lt;string&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
template &amp;lt;class T&amp;gt;&lt;br /&gt;
void print(T&amp;amp; c){&lt;br /&gt;
   for( typename T::iterator i = c.begin(); i != c.end(); i++ ){&lt;br /&gt;
      std::cout &amp;lt;&amp;lt; *i &amp;lt;&amp;lt; endl;&lt;br /&gt;
   }&lt;br /&gt;
}&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
  set&amp;lt;string&amp;gt; first;&lt;br /&gt;
  first.insert(&amp;quot;r&amp;quot;);&lt;br /&gt;
  first.insert(&amp;quot;T&amp;quot;);&lt;br /&gt;
  first.insert(&amp;quot;s&amp;quot;);&lt;br /&gt;
  cout &amp;lt;&amp;lt; first.size() &amp;lt;&amp;lt; endl;&lt;br /&gt;
  set&amp;lt;string&amp;gt; second (first);   // Copy constructor&lt;br /&gt;
  second.insert(&amp;quot;r&amp;quot;);&lt;br /&gt;
  second.insert(&amp;quot;K&amp;quot;);&lt;br /&gt;
  second.insert(&amp;quot;S&amp;quot;);&lt;br /&gt;
  second.insert(&amp;quot;b&amp;quot;);&lt;br /&gt;
  cout &amp;lt;&amp;lt; second.size() &amp;lt;&amp;lt; endl;&lt;br /&gt;
  // Are the sets the same?&lt;br /&gt;
  if (first == second)&lt;br /&gt;
    cout &amp;lt;&amp;lt; &amp;quot;Sets have same elements\n&amp;quot;;&lt;br /&gt;
  else&lt;br /&gt;
    cout &amp;lt;&amp;lt; &amp;quot;Not same elements\n&amp;quot;;&lt;br /&gt;
}&amp;lt;/source&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==set comparison==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   &lt;br /&gt;
&amp;lt;source lang=&amp;quot;cpp&amp;quot;&amp;gt;/* The following code example is taken from the book&lt;br /&gt;
 * &amp;quot;The C++ Standard Library - A Tutorial and Reference&amp;quot;&lt;br /&gt;
 * by Nicolai M. Josuttis, Addison-Wesley, 1999&lt;br /&gt;
 *&lt;br /&gt;
 * (C) Copyright Nicolai M. Josuttis 1999.&lt;br /&gt;
 * Permission to copy, use, modify, sell and distribute this software&lt;br /&gt;
 * is granted provided this copyright notice appears in all copies.&lt;br /&gt;
 * This software is provided &amp;quot;as is&amp;quot; without express or implied&lt;br /&gt;
 * warranty, and with no claim as to its suitability for any purpose.&lt;br /&gt;
 */&lt;br /&gt;
#include &amp;lt;iostream&amp;gt;&lt;br /&gt;
#include &amp;lt;set&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
/* PRINT_ELEMENTS()&lt;br /&gt;
 * - prints optional C-string optcstr followed by&lt;br /&gt;
 * - all elements of the collection coll&lt;br /&gt;
 * - separated by spaces&lt;br /&gt;
 */&lt;br /&gt;
template &amp;lt;class T&amp;gt;&lt;br /&gt;
inline void PRINT_ELEMENTS (const T&amp;amp; coll, const char* optcstr=&amp;quot;&amp;quot;)&lt;br /&gt;
{&lt;br /&gt;
    typename T::const_iterator pos;&lt;br /&gt;
    std::cout &amp;lt;&amp;lt; optcstr;&lt;br /&gt;
    for (pos=coll.begin(); pos!=coll.end(); ++pos) {&lt;br /&gt;
        std::cout &amp;lt;&amp;lt; *pos &amp;lt;&amp;lt; &amp;quot; &amp;quot;;&lt;br /&gt;
    }&lt;br /&gt;
    std::cout &amp;lt;&amp;lt; std::endl;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
// type for sorting criterion&lt;br /&gt;
template &amp;lt;class T&amp;gt;&lt;br /&gt;
class RuntimeCmp {&lt;br /&gt;
  public:&lt;br /&gt;
    enum cmp_mode {normal, reverse};&lt;br /&gt;
  private:&lt;br /&gt;
    cmp_mode mode;&lt;br /&gt;
  public:&lt;br /&gt;
    // constructor for sorting criterion&lt;br /&gt;
    // - default criterion uses value normal&lt;br /&gt;
    RuntimeCmp (cmp_mode m=normal) : mode(m) {&lt;br /&gt;
    }&lt;br /&gt;
    // comparison of elements&lt;br /&gt;
    bool operator() (const T&amp;amp; t1, const T&amp;amp; t2) const {&lt;br /&gt;
        return mode == normal ? t1 &amp;lt; t2 : t2 &amp;lt; t1;&lt;br /&gt;
    }&lt;br /&gt;
    // comparison of sorting criteria&lt;br /&gt;
    bool operator== (const RuntimeCmp&amp;amp; rc) {&lt;br /&gt;
        return mode == rc.mode;&lt;br /&gt;
    }&lt;br /&gt;
};&lt;br /&gt;
// type of a set that uses this sorting criterion&lt;br /&gt;
typedef set&amp;lt;int,RuntimeCmp&amp;lt;int&amp;gt; &amp;gt; IntSet;&lt;br /&gt;
// forward declaration&lt;br /&gt;
void fill (IntSet&amp;amp; set);&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    // create, fill, and print set with normal element order&lt;br /&gt;
    // - uses default sorting criterion&lt;br /&gt;
    IntSet coll1;&lt;br /&gt;
    fill(coll1);&lt;br /&gt;
    PRINT_ELEMENTS (coll1, &amp;quot;coll1: &amp;quot;);&lt;br /&gt;
    // create sorting criterion with reverse element order&lt;br /&gt;
    RuntimeCmp&amp;lt;int&amp;gt; reverse_order(RuntimeCmp&amp;lt;int&amp;gt;::reverse);&lt;br /&gt;
    // create, fill, and print set with reverse element order&lt;br /&gt;
    IntSet coll2(reverse_order);&lt;br /&gt;
    fill(coll2);&lt;br /&gt;
    PRINT_ELEMENTS (coll2, &amp;quot;coll2: &amp;quot;);&lt;br /&gt;
    // assign elements AND sorting criterion&lt;br /&gt;
    coll1 = coll2;&lt;br /&gt;
    coll1.insert(3);&lt;br /&gt;
    PRINT_ELEMENTS (coll1, &amp;quot;coll1: &amp;quot;);&lt;br /&gt;
    // just to make sure...&lt;br /&gt;
    if (coll1.value_comp() == coll2.value_comp()) {&lt;br /&gt;
        cout &amp;lt;&amp;lt; &amp;quot;coll1 and coll2 have same sorting criterion&amp;quot;&lt;br /&gt;
             &amp;lt;&amp;lt; endl;&lt;br /&gt;
    }&lt;br /&gt;
    else {&lt;br /&gt;
        cout &amp;lt;&amp;lt; &amp;quot;coll1 and coll2 have different sorting criterion&amp;quot;&lt;br /&gt;
             &amp;lt;&amp;lt; endl;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
void fill (IntSet&amp;amp; set)&lt;br /&gt;
{&lt;br /&gt;
    // fill insert elements in random order&lt;br /&gt;
    set.insert(4);&lt;br /&gt;
    set.insert(7);&lt;br /&gt;
    set.insert(5);&lt;br /&gt;
    set.insert(1);&lt;br /&gt;
    set.insert(6);&lt;br /&gt;
    set.insert(2);&lt;br /&gt;
    set.insert(5);&lt;br /&gt;
}&amp;lt;/source&amp;gt;&lt;br /&gt;
&amp;lt;pre class=codeResult&amp;gt;coll1: 1 2 4 5 6 7&lt;br /&gt;
coll2: 7 6 5 4 2 1&lt;br /&gt;
coll1: 7 6 5 4 3 2 1&lt;br /&gt;
coll1 and coll2 have same sorting criterion&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>Admin</name></author>	</entry>

	</feed>