From 554fd8c5195424bdbcabf5de30fdc183aba391bd Mon Sep 17 00:00:00 2001
From: upstream source tree <ports@midipix.org>
Date: Sun, 15 Mar 2015 20:14:05 -0400
Subject: obtained gcc-4.6.4.tar.bz2 from upstream website; verified
 gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream
 tarball.

downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.

if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.
---
 .../ext/pb_ds/example/basic_priority_queue.cc      | 119 +++++++++++++++++++++
 1 file changed, 119 insertions(+)
 create mode 100644 libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc

(limited to 'libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc')

diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc
new file mode 100644
index 000000000..24ebe2e28
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc
@@ -0,0 +1,119 @@
+// -*- 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 basic_priority_queue_example.cpp
+ * A basic example showing how to use priority queues.
+ */
+
+/**
+ * This example shows how to use priority queues. It defines a
+ * function performing a sequence of operations on
+ * a generic container. It then calls this function with some containers.
+ */
+
+#include <cassert>
+#include <iostream>
+#include <ext/pb_ds/priority_queue.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+// The following function performs a sequence of operations on a
+// priority queue object storing integers.
+template<class Cntnr>
+void
+some_op_sequence(Cntnr& r_c)
+{
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  for (size_t i = 0; i < 10; ++i)
+    r_c.push(i);
+  cout << endl << "All values in the container:" << endl;
+
+  typedef typename Cntnr::const_iterator const_iterator;
+  for (const_iterator it = r_c.begin(); it != r_c.end();  ++it)
+    cout <<* it << endl;
+  assert(!r_c.empty());
+  assert(r_c.size() == 10);
+
+  cout << "Popping all values: " << endl;
+  while (!r_c.empty())
+    {
+      cout << r_c.top() << endl;
+      r_c.pop();
+    }
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  cout << endl;
+}
+
+int main()
+{
+  {
+    // Perform operations on a pairing-heap queue.
+    cout << "Pairing heap" << endl;
+    __gnu_pbds::priority_queue<int, less<int>, pairing_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a binomial-heap queue.
+    cout << "Binomial heap" << endl;
+    __gnu_pbds::priority_queue<int, less<int>, binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a binomial-heap queue.
+    cout << "Redundant-counter binomial heap" << endl;
+    __gnu_pbds::priority_queue<int, less<int>, rc_binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a binomial-heap queue.
+    cout << "Binary heap" << endl;
+    __gnu_pbds::priority_queue<int, less<int>, binary_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a thin-heap queue.
+    cout << "Thin heap" << endl;
+    __gnu_pbds::priority_queue<int, less<int>, thin_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  return 0;
+}
-- 
cgit v1.2.3