libstdc++-v3/testsuite/ext/pb_ds/regression/associative_containers.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  * @file assoc_link_regression_test_1.cpp
  44  * A linkage regression test.
  45  */
  46
  47
  48 #include <ext/pb_ds/assoc_container.hpp>
  49 #include <iostream>
  50 #include <cassert>
  51
  52 using namespace std;
  53 using namespace __gnu_pbds;
  54
  55 /**
  56  * The following function performs a sequence of operations on an
  57  * associative container object mapping integers to characters.
  58  */
  59 template<typename Cntnr>
  60 void
  61 some_op_sequence(Cntnr& r_c)
  62 {
  63   assert(r_c.empty());
  64   assert(r_c.size() == 0);
  65
  66   r_c.insert(make_pair(1, 'a'));
  67
  68   r_c[2] = 'b';
  69
  70   assert(!r_c.empty());
  71   assert(r_c.size() == 2);
  72
  73   cout << "Key 1 is mapped to " << r_c[1] << endl;
  74   cout << "Key 2 is mapped to " << r_c[2] << endl;
  75
  76   cout << endl << "All value types in the container:" << endl;
  77   for (typename Cntnr::const_iterator it = r_c.begin(); it != r_c.end(); ++it)
  78     cout << it->first << " -> " << it->second << endl;
  79
  80   cout << endl;
  81
  82   r_c.clear();
  83
  84   assert(r_c.empty());
  85   assert(r_c.size() == 0);
  86 }
  87
  88 void
  89 assoc_link_regression_test_0()
  90 {
  91   {
  92     // Perform operations on a collision-chaining hash map.
  93     cc_hash_table<int, char> c;
  94     some_op_sequence(c);
  95   }
  96
  97   {
  98     // Perform operations on a general-probing hash map.
  99     gp_hash_table<int, char> c;
 100     some_op_sequence(c);
 101   }
 102
 103   {
 104     // Perform operations on a red-black tree map.
 105     tree<int, char> c;
 106     some_op_sequence(c);
 107   }
 108
 109   {
 110     // Perform operations on a splay tree map.
 111     tree<int, char, less<int>, splay_tree_tag> c;
 112     some_op_sequence(c);
 113   }
 114
 115   {
 116     // Perform operations on a splay tree map.
 117     tree<int, char, less<int>, ov_tree_tag> c;
 118     some_op_sequence(c);
 119   }
 120
 121   {
 122     // Perform operations on a list-update map.
 123     list_update<int, char> c;
 124     some_op_sequence(c);
 125   }
 126 }
 127
 128
 129 void
 130 assoc_link_regression_test_1()
 131 {
 132   {
 133     // Perform operations on a collision-chaining hash map.
 134     cc_hash_table<int, char> c;
 135     some_op_sequence(c);
 136   }
 137
 138   {
 139     // Perform operations on a general-probing hash map.
 140     gp_hash_table<int, char> c;
 141     some_op_sequence(c);
 142   }
 143
 144   {
 145     // Perform operations on a red-black tree map.
 146     tree<int, char> c;
 147     some_op_sequence(c);
 148   }
 149
 150   {
 151     // Perform operations on a splay tree map.
 152     tree<int, char, less<int>, splay_tree_tag> c;
 153     some_op_sequence(c);
 154   }
 155
 156   {
 157     // Perform operations on a splay tree map.
 158     tree<int, char, less<int>, ov_tree_tag> c;
 159     some_op_sequence(c);
 160   }
 161
 162   {
 163     // Perform operations on a list-update map.
 164     list_update<int, char> c;
 165     some_op_sequence(c);
 166   }
 167 }
 168
 169 int
 170 main()
 171 {
 172   assoc_link_regression_test_0();
 173   assoc_link_regression_test_1();
 174   return 0;
 175 }