mirror of
https://github.com/Telecominfraproject/wlan-cloud-lib-poco.git
synced 2025-11-03 03:57:49 +00:00
206 lines
4.2 KiB
C++
206 lines
4.2 KiB
C++
//
|
|
// HashSetTest.cpp
|
|
//
|
|
// $Id: //poco/svn/Foundation/testsuite/src/HashSetTest.cpp#2 $
|
|
//
|
|
// Copyright (c) 2006, Applied Informatics Software Engineering GmbH.
|
|
// and Contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person or organization
|
|
// obtaining a copy of the software and accompanying documentation covered by
|
|
// this license (the "Software") to use, reproduce, display, distribute,
|
|
// execute, and transmit the Software, and to prepare derivative works of the
|
|
// Software, and to permit third-parties to whom the Software is furnished to
|
|
// do so, all subject to the following:
|
|
//
|
|
// The copyright notices in the Software and this entire statement, including
|
|
// the above license grant, this restriction and the following disclaimer,
|
|
// must be included in all copies of the Software, in whole or in part, and
|
|
// all derivative works of the Software, unless such copies or derivative
|
|
// works are solely in the form of machine-executable object code generated by
|
|
// a source language processor.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
|
|
// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
|
|
// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
|
|
// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
// DEALINGS IN THE SOFTWARE.
|
|
//
|
|
|
|
|
|
#include "HashSetTest.h"
|
|
#include "CppUnit/TestCaller.h"
|
|
#include "CppUnit/TestSuite.h"
|
|
#include "Poco/HashSet.h"
|
|
#include <set>
|
|
|
|
|
|
using Poco::HashSet;
|
|
|
|
|
|
HashSetTest::HashSetTest(const std::string& name): CppUnit::TestCase(name)
|
|
{
|
|
}
|
|
|
|
|
|
HashSetTest::~HashSetTest()
|
|
{
|
|
}
|
|
|
|
|
|
void HashSetTest::testInsert()
|
|
{
|
|
const int N = 1000;
|
|
|
|
HashSet<int> hs;
|
|
|
|
assert (hs.empty());
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
std::pair<HashSet<int>::Iterator, bool> res = hs.insert(i);
|
|
assert (*res.first == i);
|
|
assert (res.second);
|
|
HashSet<int>::Iterator it = hs.find(i);
|
|
assert (it != hs.end());
|
|
assert (*it == i);
|
|
assert (hs.size() == i + 1);
|
|
}
|
|
|
|
assert (!hs.empty());
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
HashSet<int>::Iterator it = hs.find(i);
|
|
assert (it != hs.end());
|
|
assert (*it == i);
|
|
}
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
std::pair<HashSet<int>::Iterator, bool> res = hs.insert(i);
|
|
assert (*res.first == i);
|
|
assert (!res.second);
|
|
}
|
|
}
|
|
|
|
|
|
void HashSetTest::testErase()
|
|
{
|
|
const int N = 1000;
|
|
|
|
HashSet<int> hs;
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
hs.insert(i);
|
|
}
|
|
assert (hs.size() == N);
|
|
|
|
for (int i = 0; i < N; i += 2)
|
|
{
|
|
hs.erase(i);
|
|
HashSet<int>::Iterator it = hs.find(i);
|
|
assert (it == hs.end());
|
|
}
|
|
assert (hs.size() == N/2);
|
|
|
|
for (int i = 0; i < N; i += 2)
|
|
{
|
|
HashSet<int>::Iterator it = hs.find(i);
|
|
assert (it == hs.end());
|
|
}
|
|
|
|
for (int i = 1; i < N; i += 2)
|
|
{
|
|
HashSet<int>::Iterator it = hs.find(i);
|
|
assert (it != hs.end());
|
|
assert (*it == i);
|
|
}
|
|
|
|
for (int i = 0; i < N; i += 2)
|
|
{
|
|
hs.insert(i);
|
|
}
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
HashSet<int>::Iterator it = hs.find(i);
|
|
assert (it != hs.end());
|
|
assert (*it == i);
|
|
}
|
|
}
|
|
|
|
|
|
void HashSetTest::testIterator()
|
|
{
|
|
const int N = 1000;
|
|
|
|
HashSet<int> hs;
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
hs.insert(i);
|
|
}
|
|
|
|
std::set<int> values;
|
|
HashSet<int>::Iterator it = hs.begin();
|
|
while (it != hs.end())
|
|
{
|
|
assert (values.find(*it) == values.end());
|
|
values.insert(*it);
|
|
++it;
|
|
}
|
|
|
|
assert (values.size() == N);
|
|
}
|
|
|
|
|
|
void HashSetTest::testConstIterator()
|
|
{
|
|
const int N = 1000;
|
|
|
|
HashSet<int> hs;
|
|
|
|
for (int i = 0; i < N; ++i)
|
|
{
|
|
hs.insert(i);
|
|
}
|
|
|
|
std::set<int> values;
|
|
HashSet<int>::ConstIterator it = hs.begin();
|
|
while (it != hs.end())
|
|
{
|
|
assert (values.find(*it) == values.end());
|
|
values.insert(*it);
|
|
++it;
|
|
}
|
|
|
|
assert (values.size() == N);
|
|
}
|
|
|
|
|
|
void HashSetTest::setUp()
|
|
{
|
|
}
|
|
|
|
|
|
void HashSetTest::tearDown()
|
|
{
|
|
}
|
|
|
|
|
|
CppUnit::Test* HashSetTest::suite()
|
|
{
|
|
CppUnit::TestSuite* pSuite = new CppUnit::TestSuite("HashSetTest");
|
|
|
|
CppUnit_addTest(pSuite, HashSetTest, testInsert);
|
|
CppUnit_addTest(pSuite, HashSetTest, testErase);
|
|
CppUnit_addTest(pSuite, HashSetTest, testIterator);
|
|
CppUnit_addTest(pSuite, HashSetTest, testConstIterator);
|
|
|
|
return pSuite;
|
|
}
|