X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Ftestsuite%2Fext%2Fpb_ds%2Fexample%2Fpriority_queue_split_join.cc;fp=libstdc%2B%2B-v3%2Ftestsuite%2Fext%2Fpb_ds%2Fexample%2Fpriority_queue_split_join.cc;h=c2d83c0b2a04bc88cc1422e34b6529244aebc2d0;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git

diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_split_join.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_split_join.cc
new file mode 100644
index 00000000..c2d83c0b
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_split_join.cc
@@ -0,0 +1,124 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 3, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING3.  If not see
+// <http://www.gnu.org/licenses/>.
+
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// Permission to use, copy, modify, sell, and distribute this software
+// is hereby granted without fee, provided that the above copyright
+// notice appears in all copies, and that both that copyright notice
+// and this permission notice appear in supporting documentation. None
+// of the above authors, nor IBM Haifa Research Laboratories, make any
+// representation about the suitability of this software for any
+// purpose. It is provided "as is" without express or implied
+// warranty.
+
+/**
+ * @file priority_queue_split_join_example.cpp
+ * A basic example showing how to split and join priority queues.
+ */
+
+/**
+ * This example shows how to split and join priority queues.
+ */
+
+#include <functional>
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/priority_queue.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+int
+main()
+{
+  // Two priority queue objects.
+  __gnu_pbds::priority_queue<int> even_p, odd_p;
+
+  // First we insert some values: even ones into even_p, and odd ones
+  // into odd_p.
+  for (size_t i = 0; i < 10; ++i)
+    {
+      even_p.push(2*  i);
+      odd_p.push(2*  i + 1);
+    }
+
+  // Check that each one contains the appropriate 10 values.
+  assert(even_p.size() == 10);
+  assert(even_p.top() == 18);
+
+  // Print out the values.
+  cout << "Initial values in even priority queue:" << endl;
+  __gnu_pbds::priority_queue<int>::const_iterator it;
+  for (it = even_p.begin(); it != even_p.end(); ++it)
+    cout <<* it << endl;
+
+  assert(odd_p.size() == 10);
+  assert(odd_p.top() == 19);
+
+  // Print out the values.
+  cout << "Initial values in odd priority queue:" << endl;
+  for (it = odd_p.begin(); it != odd_p.end(); ++it)
+    cout <<* it << endl;
+
+  // Now join the queues.
+  even_p.join(odd_p);
+
+  // Check that each one contains the appropriate values.
+
+  assert(even_p.size() == 20);
+  assert(even_p.top() == 19);
+
+  // Print out the values.
+  cout << "After-join values in even priority queue:" << endl;
+  for (it = even_p.begin(); it != even_p.end(); ++it)
+    cout <<* it << endl;
+
+  assert(odd_p.size() == 0);
+
+  // Print out the values.
+  cout << "After-join values in odd priority queue:" << endl;
+  for (it = odd_p.begin(); it != odd_p.end(); ++it)
+    cout <<* it << endl;
+
+  // Now split the queues.
+  even_p.split(bind2nd(modulus<int>(), 2), odd_p);
+
+  // Check that each one contains the appropriate 10 values.
+
+  assert(even_p.size() == 10);
+  assert(even_p.top() == 18);
+
+  // Print out the values.
+  cout << "After-split values in even priority queue:" << endl;
+  for (it = even_p.begin(); it != even_p.end(); ++it)
+    cout <<* it << endl;
+
+  assert(odd_p.size() == 10);
+  assert(odd_p.top() == 19);
+
+  // Print out the values.
+  cout << "After-split values in odd priority queue:" << endl;
+  for (it = odd_p.begin(); it != odd_p.end(); ++it)
+    cout <<* it << endl;
+
+  return 0;
+}
+