blob: 16dc1dd361734ae6f013ada870f1efde8bd866ae (
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include "cppunit/TestAssert.h"
#include "cppunit/TestFixture.h"
#include "cppunit/extensions/HelperMacros.h"
#include <o3tl/sorted_vector.hxx>
using namespace ::o3tl;
// helper class
class SwContent
{
public:
int x;
SwContent(int x_) : x(x_) {}
bool operator<( const SwContent &rCmp) const
{
return x < rCmp.x;
}
};
class sorted_vector_test : public CppUnit::TestFixture
{
public:
void testBasics()
{
o3tl::sorted_vector<SwContent*, o3tl::less_ptr_to<SwContent> > aVec;
SwContent *p1 = new SwContent(1);
SwContent *p2 = new SwContent(2);
SwContent *p3 = new SwContent(3);
SwContent *p4 = new SwContent(4);
CPPUNIT_ASSERT( aVec.insert(p3).second );
CPPUNIT_ASSERT( aVec.insert(p1).second );
CPPUNIT_ASSERT( !aVec.insert(p3).second );
CPPUNIT_ASSERT( aVec.size() == 2 );
CPPUNIT_ASSERT( aVec[0] == p1 );
CPPUNIT_ASSERT( aVec[1] == p3 );
CPPUNIT_ASSERT( *aVec.begin() == p1 );
CPPUNIT_ASSERT( *(aVec.end()-1) == p3 );
CPPUNIT_ASSERT( aVec.front() == p1 );
CPPUNIT_ASSERT( aVec.back() == p3 );
CPPUNIT_ASSERT( aVec.find(p1) != aVec.end() );
CPPUNIT_ASSERT( aVec.find(p1) - aVec.begin() == 0 );
CPPUNIT_ASSERT( aVec.find(p3) != aVec.end() );
CPPUNIT_ASSERT( aVec.find(p3) - aVec.begin() == 1 );
CPPUNIT_ASSERT( aVec.find(p2) == aVec.end() );
CPPUNIT_ASSERT( aVec.find(p4) == aVec.end() );
CPPUNIT_ASSERT( aVec.erase(p1) == 1 );
CPPUNIT_ASSERT( aVec.size() == 1 );
CPPUNIT_ASSERT( aVec.erase(p2) == 0 );
aVec.DeleteAndDestroyAll();
}
void testInsertRange()
{
o3tl::sorted_vector<SwContent*, o3tl::less_ptr_to<SwContent> > aVec1;
SwContent *p1 = new SwContent(1);
SwContent *p2 = new SwContent(2);
SwContent *p3 = new SwContent(3);
aVec1.insert(p1);
aVec1.insert(p2);
aVec1.insert(p3);
o3tl::sorted_vector<SwContent*, o3tl::less_ptr_to<SwContent> > aVec2;
aVec2.insert( aVec1 );
CPPUNIT_ASSERT( aVec2.size() == 3 );
}
void testLowerBound()
{
o3tl::sorted_vector<SwContent*, o3tl::less_ptr_to<SwContent> > aVec;
SwContent *p1 = new SwContent(1);
SwContent *p2 = new SwContent(2);
SwContent *p3 = new SwContent(3);
SwContent *p4 = new SwContent(4);
aVec.insert(p1);
aVec.insert(p2);
aVec.insert(p3);
CPPUNIT_ASSERT( aVec.lower_bound(p1) == aVec.begin() );
CPPUNIT_ASSERT( aVec.lower_bound(p4) == aVec.end() );
}
// Change the following lines only, if you add, remove or rename
// member functions of the current class,
// because these macros are need by auto register mechanism.
CPPUNIT_TEST_SUITE(sorted_vector_test);
CPPUNIT_TEST(testBasics);
CPPUNIT_TEST(testInsertRange);
CPPUNIT_TEST(testLowerBound);
CPPUNIT_TEST_SUITE_END();
};
// -----------------------------------------------------------------------------
CPPUNIT_TEST_SUITE_REGISTRATION(sorted_vector_test);
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
