mirror of
https://github.com/autc04/Retro68.git
synced 2024-09-01 16:29:41 +00:00
107 lines
2.5 KiB
C++
107 lines
2.5 KiB
C++
// 2011-10-28 Paolo Carlini <paolo.carlini@oracle.com>
|
|
|
|
// Copyright (C) 2011-2014 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 <map>
|
|
#include <testsuite_hooks.h>
|
|
|
|
void test01()
|
|
{
|
|
bool test __attribute__((unused)) = true;
|
|
using namespace std;
|
|
|
|
typedef map<int, int>::value_type value_type;
|
|
|
|
map<int, int> m0;
|
|
VERIFY( m0.count(0) == 0 );
|
|
VERIFY( m0.count(1) == 0 );
|
|
|
|
m0.insert(value_type(1, 1));
|
|
VERIFY( m0.count(0) == 0 );
|
|
VERIFY( m0.count(1) == 1 );
|
|
|
|
m0.insert(value_type(1, 2));
|
|
VERIFY( m0.count(0) == 0 );
|
|
VERIFY( m0.count(1) == 1 );
|
|
|
|
m0.insert(value_type(2, 1));
|
|
VERIFY( m0.count(2) == 1 );
|
|
|
|
m0.insert(value_type(3, 1));
|
|
m0.insert(value_type(3, 2));
|
|
m0.insert(value_type(3, 3));
|
|
VERIFY( m0.count(3) == 1 );
|
|
|
|
m0.erase(2);
|
|
VERIFY( m0.count(2) == 0 );
|
|
|
|
m0.erase(0);
|
|
VERIFY( m0.count(0) == 0 );
|
|
|
|
map<int, int> m1(m0);
|
|
VERIFY( m1.count(0) == 0 );
|
|
VERIFY( m1.count(1) == 1 );
|
|
VERIFY( m1.count(2) == 0 );
|
|
VERIFY( m1.count(3) == 1 );
|
|
|
|
m0.clear();
|
|
VERIFY( m0.count(0) == 0 );
|
|
VERIFY( m0.count(1) == 0 );
|
|
VERIFY( m0.count(2) == 0 );
|
|
VERIFY( m0.count(3) == 0 );
|
|
|
|
m1.insert(value_type(4, 1));
|
|
m1.insert(value_type(5, 1));
|
|
m1.insert(value_type(5, 2));
|
|
m1.insert(value_type(5, 3));
|
|
m1.insert(value_type(5, 4));
|
|
VERIFY( m1.count(4) == 1 );
|
|
VERIFY( m1.count(5) == 1 );
|
|
|
|
m1.erase(1);
|
|
VERIFY( m1.count(1) == 0 );
|
|
|
|
m1.erase(m1.find(5));
|
|
VERIFY( m1.count(5) == 0 );
|
|
|
|
m1.insert(value_type(1, 1));
|
|
m1.insert(value_type(1, 2));
|
|
VERIFY( m1.count(1) == 1 );
|
|
|
|
m1.erase(5);
|
|
VERIFY( m1.count(5) == 0 );
|
|
|
|
m1.erase(m1.find(4));
|
|
VERIFY( m1.count(4) == 0 );
|
|
|
|
m1.clear();
|
|
VERIFY( m1.count(0) == 0 );
|
|
VERIFY( m1.count(1) == 0 );
|
|
VERIFY( m1.count(2) == 0 );
|
|
VERIFY( m1.count(3) == 0 );
|
|
VERIFY( m1.count(4) == 0 );
|
|
VERIFY( m1.count(5) == 0 );
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test01();
|
|
return 0;
|
|
}
|