94 lines
2.2 KiB
C++
94 lines
2.2 KiB
C++
/* Copyright (C) 2009 Wildfire Games.
|
|
* This file is part of 0 A.D.
|
|
*
|
|
* 0 A.D. 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 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* 0 A.D. 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 0 A.D. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "lib/self_test.h"
|
|
|
|
#include "lib/adts.h"
|
|
#include "lib/rand.h"
|
|
|
|
class TestRingbuf : public CxxTest::TestSuite
|
|
{
|
|
static const size_t N = 49; // RingBuf capacity
|
|
static const int S = 100; // number of test items
|
|
public:
|
|
void test_insert_remove()
|
|
{
|
|
RingBuf<int, N> buf;
|
|
for(int i = 1; i < S; i++)
|
|
{
|
|
buf.push_back(i);
|
|
TS_ASSERT_EQUALS(buf.front(), i);
|
|
buf.pop_front();
|
|
}
|
|
TS_ASSERT(buf.size() == 0 && buf.empty());
|
|
}
|
|
|
|
void test_fill_overwrite_old()
|
|
{
|
|
RingBuf<int, N> buf;
|
|
for(int i = 1; i < S; i++)
|
|
buf.push_back(i);
|
|
TS_ASSERT_EQUALS(buf.size(), N);
|
|
int first = buf.front();
|
|
TS_ASSERT_EQUALS(first, (int)(S-1 -N +1));
|
|
for(size_t i = 0; i < N; i++)
|
|
{
|
|
TS_ASSERT_EQUALS(buf.front(), first);
|
|
first++;
|
|
buf.pop_front();
|
|
}
|
|
TS_ASSERT(buf.size() == 0 && buf.empty());
|
|
}
|
|
|
|
void test_randomized_insert_remove()
|
|
{
|
|
srand(1);
|
|
RingBuf<int, N> buf;
|
|
std::deque<int> deq;
|
|
for(size_t rep = 0; rep < 1000; rep++)
|
|
{
|
|
size_t rnd_op = rand(0, 10);
|
|
// 70% - insert
|
|
if(rnd_op >= 3)
|
|
{
|
|
int item = rand();
|
|
buf.push_back(item);
|
|
|
|
deq.push_back(item);
|
|
int excess_items = (int)deq.size() - N;
|
|
if(excess_items > 0)
|
|
{
|
|
for(int i = 0; i < excess_items; i++)
|
|
{
|
|
deq.pop_front();
|
|
}
|
|
}
|
|
}
|
|
// 30% - pop front (only if not empty)
|
|
else if(!deq.empty())
|
|
{
|
|
buf.pop_front();
|
|
deq.pop_front();
|
|
}
|
|
}
|
|
|
|
TS_ASSERT_EQUALS(buf.size(), deq.size());
|
|
RingBuf<int, N>::iterator begin = buf.begin(), end = buf.end();
|
|
TS_ASSERT(equal(begin, end, deq.begin()));
|
|
}
|
|
};
|