summaryrefslogtreecommitdiffstats
path: root/rasodmg/test/test_set.cc
blob: a6bbc0f0641ea63a6a2dae97a3e194d2005b9e89 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/*
* This file is part of rasdaman community.
*
* Rasdaman community 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 of the License, or
* (at your option) any later version.
*
* Rasdaman community 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 rasdaman community.  If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
/
/**
 * SOURCE: test_set.cc
 *
 * MODULE: rasodmg
 *
 * COMMENTS:
 *
*/

#ifdef EARLY_TEMPLATE
#define __EXECUTABLE__
#include "raslib/template_inst.hh"
#endif

#include <iostream>
#include "rasodmg/set.hh"

int main()
{   
  int v,x,y,z;
  
  v = 100;
  x = 200;
  y = 100;
  z = 300;

  cout << endl << endl;
  cout << "Set Examples" << endl;
  cout << "=============" << endl << endl;

  cout << "Creating r_Set of type int." << endl;
  r_Set<int> a;
    
  cout << "Cardinality of empty set 'a': " << a.cardinality() << endl << endl;
  
  cout << "Now inserting four elements:" << endl << "v = 100" << endl;
  a.insert_element(v);
  
  cout << "x = 200" << endl;
  a.insert_element(x);
  
  cout << "y = 100 (should fail in sets)" << endl;
  a.insert_element(y);
  
  cout << "z = 300" << endl;
  a.insert_element(z);
  
  cout << "Cardinality of collection 'a' after four inserts: " << a.cardinality() << endl << endl;

  cout << "Does 'a' contain element '100' (1=TRUE/0=FALSE)? " << a.contains_element(100) << endl;
  
  cout << "Does 'a' contain element '500' (1=TRUE/0=FALSE)? " << a.contains_element(500) << endl << endl;
  
  cout << "Now removing element 'x=200' from 'a'." << endl;
  a.remove_element(x);
  cout << "Cardinality of 'a' now: " << a.cardinality() << endl << endl;

  cout << "Now removing element '100' from 'a'." << endl;
  a.remove_element(100);
  cout << "Cardinality of 'a' now: " << a.cardinality() << endl << endl;
  
  cout << "Now removing (non-existing) element '500' from 'a'." << endl;
  a.remove_element(500);
  cout << "Cardinality of 'a' now: " << a.cardinality() << endl << endl;
  
  cout << "Testing assignment operator on r_Sets." << endl << "(creating r_Set 'b' that is equal to 'a'.)" <<endl;
  r_Set<int> b;
  b = a;
  cout << "Cardinality of 'b': " << b.cardinality() << endl << endl;

  cout << "Testing copy constructor of r_Set." << endl << "(creating r_Set 'c' that is equal to 'a'.)" <<endl;
  r_Set<int> c(a);
  cout << "Cardinality of 'c': " << c.cardinality() << endl << endl;

  cout << "Now removing all elements from 'a'." << endl;
  a.remove_all();
  cout << "Cardinality of 'a' now: " << a.cardinality() << endl;
  cout << "Cardinality of 'b' is still: " << b.cardinality() << endl;
  cout << "Cardinality of 'c' is still: " << c.cardinality() << endl << endl;
  
  return 0;
}