multi_index/test/test_iterators.cpp
Joaquín M. López Muñoz eb2a1dbca3 license update
[SVN r22959]
2004-05-28 08:06:41 +00:00

88 lines
2.1 KiB
C++

/* Boost.MultiIndex test for iterators.
*
* Copyright 2003-2004 Joaquín M López Muñoz.
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
* See http://www.boost.org/libs/multi_index for library home page.
*/
#include "test_iterators.hpp"
#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
#include "pre_multi_index.hpp"
#include "employee.hpp"
#include <boost/test/test_tools.hpp>
using namespace boost::multi_index;
void test_iterators()
{
employee_set es;
es.insert(employee(0,"Joe",31));
es.insert(employee(1,"Robert",27));
es.insert(employee(2,"John",40));
es.insert(employee(3,"Albert",20));
es.insert(employee(4,"John",57));
{
int n=0;
for(employee_set::const_iterator it=es.begin();it!=es.end();++it){
n+=it->id;
}
int m=0;
for(employee_set::reverse_iterator rit=es.rbegin();rit!=es.rend();++rit){
m+=rit->id;
}
int p=0;
for(employee_set::const_iterator it2=es.end();it2!=es.begin();){
--it2;
p+=it2->id;
}
int q=0;
for(employee_set::reverse_iterator rit2=es.rend();rit2!=es.rbegin();){
--rit2;
q+=rit2->id;
}
BOOST_CHECK(n==0+1+2+3+4&&n==m&&n==p&&n==q);
}
{
int n=0;
employee_set_by_name& i1=get<by_name>(es);
for(employee_set_by_name::iterator it=i1.begin();it!=i1.end();++it){
n+=it->id;
}
int m=0;
const employee_set_by_age& i2=get<2>(es);
for(employee_set_by_age::const_reverse_iterator rit=i2.rbegin();
rit!=i2.rend();++rit){
m+=rit->id;
}
int p=0;
const employee_set_as_inserted& i3=get<3>(es);
for(
employee_set_as_inserted::const_reverse_iterator rit2=i3.rbegin();
rit2!=i3.rend();++rit2){
p+=rit2->id;
}
int q=0;
for(employee_set_by_name::iterator it2=i1.end();it2!=i1.begin();){
--it2;
q+=it2->id;
}
int r=0;
for(
employee_set_as_inserted::const_iterator it3=i3.end();
it3!=i3.begin();){
--it3;
r+=it3->id;
}
BOOST_CHECK(n==0+1+2+3+4&&n==m&&n==p&&n==q&&n==r);
}
}