libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the terms
   7 // of the GNU General Public License as published by the Free Software
   8 // Foundation; either version 2, or (at your option) any later
   9 // version.
  10
  11 // This library is distributed in the hope that it will be useful, but
  12 // WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14 // General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License
  17 // along with this library; see the file COPYING.  If not, write to
  18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
  19 // MA 02111-1307, USA.
  20
  21 // As a special exception, you may use this file as part of a free
  22 // software library without restriction.  Specifically, if other files
  23 // instantiate templates or use macros or inline functions from this
  24 // file, or you compile this file and link it with other files to
  25 // produce an executable, this file does not by itself cause the
  26 // resulting executable to be covered by the GNU General Public
  27 // License.  This exception does not however invalidate any other
  28 // reasons why the executable file might be covered by the GNU General
  29 // Public License.
  30
  31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  32
  33 // Permission to use, copy, modify, sell, and distribute this software
  34 // is hereby granted without fee, provided that the above copyright
  35 // notice appears in all copies, and that both that copyright notice
  36 // and this permission notice appear in supporting documentation. None
  37 // of the above authors, nor IBM Haifa Research Laboratories, make any
  38 // representation about the suitability of this software for any
  39 // purpose. It is provided "as is" without express or implied
  40 // warranty.
  41
  42 /**
  43  * This example shows how to use priority queues. It defines a
  44  *    function performing a sequence of operations on
  45  *    a generic container. It then calls this function with some containers.
  46  */
  47
  48 #include <ext/pb_ds/priority_queue.hpp>
  49 #include <iostream>
  50 #include <cassert>
  51
  52 using namespace std;
  53 using namespace __gnu_pbds;
  54 using namespace __gnu_pbds;
  55
  56 template<typename Cntnr>
  57 void
  58 some_op_sequence(Cntnr& r_c)
  59 {
  60   assert(r_c.empty());
  61   assert(r_c.size() == 0);
  62
  63   for (size_t i = 0; i < 10; ++i)
  64     r_c.push(i);
  65
  66   cout << endl << "All values in the container:" << endl;
  67   for (typename Cntnr::const_iterator it = r_c.begin(); it != r_c.end();
  68        ++it)
  69     cout <<* it << endl;
  70
  71   assert(!r_c.empty());
  72   assert(r_c.size() == 10);
  73
  74   cout << "Popping all values: " << endl;
  75
  76   while (!r_c.empty())
  77     {
  78       cout << r_c.top() << endl;
  79
  80       r_c.pop();
  81     }
  82
  83   assert(r_c.empty());
  84   assert(r_c.size() == 0);
  85
  86   cout << endl;
  87 }
  88
  89 void
  90 priority_queue_link_regression_test_0()
  91 {
  92   {
  93     /*
  94      *  Perform operations on a pairing-heap queue.
  95      */
  96     cout << "Pairing heap" << endl;
  97     __gnu_pbds::priority_queue<int, less<int>, pairing_heap_tag> c;
  98     some_op_sequence(c);
  99   }
 100
 101   {
 102     /*
 103      *  Perform operations on a binomial-heap queue.
 104      */
 105     cout << "Binomial heap" << endl;
 106     __gnu_pbds::priority_queue<int, less<int>, binomial_heap_tag> c;
 107     some_op_sequence(c);
 108   }
 109
 110   {
 111     /*
 112      *  Perform operations on a binomial-heap queue.
 113      */
 114     cout << "Redundant-counter binomial heap" << endl;
 115     __gnu_pbds::priority_queue<int, less<int>, rc_binomial_heap_tag> c;
 116     some_op_sequence(c);
 117   }
 118
 119   {
 120     /*
 121      *  Perform operations on a binomial-heap queue.
 122      */
 123     cout << "Binary heap" << endl;
 124     __gnu_pbds::priority_queue<int, less<int>, binary_heap_tag> c;
 125     some_op_sequence(c);
 126   }
 127
 128   {
 129     /*
 130      *  Perform operations on a thin-heap queue.
 131      */
 132     cout << "Thin heap" << endl;
 133     __gnu_pbds::priority_queue<int, less<int>, thin_heap_tag> c;
 134     some_op_sequence(c);
 135   }
 136 }
 137
 138
 139 void
 140 priority_queue_link_regression_test_1()
 141 {
 142   {
 143     /*
 144      *  Perform operations on a pairing-heap queue.
 145      */
 146     cout << "Pairing heap" << endl;
 147     __gnu_pbds::priority_queue<int, less<int>, pairing_heap_tag> c;
 148     some_op_sequence(c);
 149   }
 150
 151   {
 152     /*
 153      *  Perform operations on a binomial-heap queue.
 154      */
 155     cout << "Binomial heap" << endl;
 156     __gnu_pbds::priority_queue<int, less<int>, binomial_heap_tag> c;
 157     some_op_sequence(c);
 158   }
 159
 160   {
 161     /*
 162      *  Perform operations on a binomial-heap queue.
 163      */
 164     cout << "Redundant-counter binomial heap" << endl;
 165     __gnu_pbds::priority_queue<int, less<int>, rc_binomial_heap_tag> c;
 166     some_op_sequence(c);
 167   }
 168
 169   {
 170     /*
 171      *  Perform operations on a binomial-heap queue.
 172      */
 173     cout << "Binary heap" << endl;
 174     __gnu_pbds::priority_queue<int, less<int>, binary_heap_tag> c;
 175     some_op_sequence(c);
 176   }
 177
 178   {
 179     /*
 180      *  Perform operations on a thin-heap queue.
 181      */
 182     cout << "Thin heap" << endl;
 183     __gnu_pbds::priority_queue<int, less<int>, thin_heap_tag> c;
 184     some_op_sequence(c);
 185   }
 186 }
 187
 188 int
 189 main()
 190 {
 191   priority_queue_link_regression_test_0();
 192   priority_queue_link_regression_test_1();
 193   return 0;
 194 }