File: count.cc

package info (click to toggle)
gcc-avr 1%3A5.4.0%2BAtmel3.6.2-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 589,884 kB
  • sloc: ansic: 2,775,581; ada: 756,757; cpp: 723,977; f90: 117,673; asm: 66,897; makefile: 62,756; xml: 44,466; sh: 29,549; exp: 23,315; objc: 15,216; fortran: 10,901; pascal: 4,185; python: 4,093; perl: 2,969; awk: 2,811; ml: 2,385; cs: 879; yacc: 316; lex: 198; haskell: 112; lisp: 8
file content (104 lines) | stat: -rw-r--r-- 2,323 bytes parent folder | download | duplicates (4)
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
// 2011-10-28  Paolo Carlini  <paolo.carlini@oracle.com>

// Copyright (C) 2011-2015 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/>.
//

#include <set>
#include <testsuite_hooks.h>

void test01()
{
  bool test __attribute__((unused)) = true;
  using namespace std;

  set<int> s0;
  VERIFY( s0.count(0) == 0 );
  VERIFY( s0.count(1) == 0 );

  s0.insert(1);
  VERIFY( s0.count(0) == 0 );
  VERIFY( s0.count(1) == 1 );

  s0.insert(1);
  VERIFY( s0.count(0) == 0 );
  VERIFY( s0.count(1) == 1 );

  s0.insert(2);
  VERIFY( s0.count(2) == 1 );

  s0.insert(3);
  s0.insert(3);
  s0.insert(3);
  VERIFY( s0.count(3) == 1 );

  s0.erase(2);
  VERIFY( s0.count(2) == 0 );

  s0.erase(0);
  VERIFY( s0.count(0) == 0 );

  set<int> s1(s0);
  VERIFY( s1.count(0) == 0 );
  VERIFY( s1.count(1) == 1 );
  VERIFY( s1.count(2) == 0 );
  VERIFY( s1.count(3) == 1 );

  s0.clear();
  VERIFY( s0.count(0) == 0 );
  VERIFY( s0.count(1) == 0 );
  VERIFY( s0.count(2) == 0 );
  VERIFY( s0.count(3) == 0 );

  s1.insert(4);
  s1.insert(5);
  s1.insert(5);
  s1.insert(5);
  s1.insert(5);
  VERIFY( s1.count(4) == 1 );
  VERIFY( s1.count(5) == 1 );

  s1.erase(1);
  VERIFY( s1.count(1) == 0 );

  s1.erase(s1.find(5));
  VERIFY( s1.count(5) == 0 );

  s1.insert(1);
  s1.insert(1);
  VERIFY( s1.count(1) == 1 );

  s1.erase(5);
  VERIFY( s1.count(5) == 0 );

  s1.erase(s1.find(4));
  VERIFY( s1.count(4) == 0 );

  s1.clear();
  VERIFY( s1.count(0) == 0 );
  VERIFY( s1.count(1) == 0 );
  VERIFY( s1.count(2) == 0 );
  VERIFY( s1.count(3) == 0 );
  VERIFY( s1.count(4) == 0 );
  VERIFY( s1.count(5) == 0 );
}

int main()
{
  test01();
  return 0;
}