mirror of
https://github.com/boostorg/multi_index.git
synced 2025-05-10 15:34:03 +00:00
15accb2836
passim: supressed non-ASCII chars in C++ code bidir_node_iterator.hpp: deleted unused template parameter bucket_array.hpp: avoided allocator<void> instantiations hash_index_iterator.hpp: avoided allocator<void> instantiations hash_index_node.hpp: avoided allocator<void> instantiations, renamed var ord_index_node.hpp: avoided allocator<void> instantiations rnd_index_loader.hpp: avoided allocator<void> instantiations rnd_index_node.hpp: avoided allocator<void> instantiations rnd_index_ptr_array.hpp: avoided allocator<void> instantiations rnd_node_iterator.hpp: deleted unused template parameter seq_index_node.hpp: avoided allocator<void> instantiations hashed_index.hpp: rewritten modify_ so that elements with unmodified key do not change position multi_index_container.hpp: added allocator ctor acknowledgements.html: added acknowledgements for Boost 1.36 compiler_specifics.html: typo hash_indices.html: documented updating functions behavior wrt unmodified keys, formatting typos key_extraction.html: formatting typos multi_index_container.html: added allocator ctor, formatting typos ord_indices.html: documented updating functions behavior wrt unmodified keys, formatting typos rnd_indices.html: formatting typos seq_indices.html: formatting typos release_notes.html: added release notes for Boost 1.36 hashed.cpp: blocked Boost inspect tool check for ASCII only chars non_std_allocator.hpp: removed void specialization to verify that no allocator<void> instantiations are generated test_copy_assignment.cpp: added test for multi_index_container allocator ctor test_update.cpp: added test for stability of update functions wrt to unmodified keys [SVN r46770]
82 lines
2.0 KiB
C++
82 lines
2.0 KiB
C++
/* Boost.MultiIndex basic test.
|
|
*
|
|
* Copyright 2003-2008 Joaquin M Lopez Munoz.
|
|
* 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_basic.hpp"
|
|
|
|
#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
|
|
#include <algorithm>
|
|
#include <vector>
|
|
#include "pre_multi_index.hpp"
|
|
#include "employee.hpp"
|
|
#include <boost/test/test_tools.hpp>
|
|
|
|
using namespace boost::multi_index;
|
|
|
|
struct less_by_employee_age
|
|
{
|
|
bool operator()(const employee& e1,const employee& e2)const
|
|
{
|
|
return e1.age<e2.age;
|
|
}
|
|
};
|
|
|
|
void test_basic()
|
|
{
|
|
employee_set es;
|
|
std::vector<employee> v;
|
|
|
|
#if defined(BOOST_NO_MEMBER_TEMPLATES)
|
|
employee_set_by_name& i1=get<by_name>(es);
|
|
#else
|
|
employee_set_by_name& i1=es.get<by_name>();
|
|
#endif
|
|
|
|
const employee_set_by_age& i2=get<2>(es);
|
|
employee_set_as_inserted& i3=get<3>(es);
|
|
employee_set_by_ssn& i4=get<ssn>(es);
|
|
employee_set_randomly& i5=get<randomly>(es);
|
|
|
|
es.insert(employee(0,"Joe",31,1123));
|
|
es.insert(employee(5,"Anna",41,1123)); /* clash*/
|
|
i1.insert(employee(1,"Robert",27,5601));
|
|
es.insert(employee(2,"John",40,7889));
|
|
i3.push_back(employee(3,"Albert",20,9012));
|
|
i4.insert(employee(4,"John",57,1002));
|
|
i5.push_back(employee(0,"Andrew",60,2302)); /* clash */
|
|
|
|
v.push_back(employee(0,"Joe",31,1123));
|
|
v.push_back(employee(1,"Robert",27,5601));
|
|
v.push_back(employee(2,"John",40,7889));
|
|
v.push_back(employee(3,"Albert",20,9012));
|
|
v.push_back(employee(4,"John",57,1002));
|
|
|
|
{
|
|
/* by insertion order */
|
|
|
|
BOOST_CHECK(std::equal(i3.begin(),i3.end(),v.begin()));
|
|
BOOST_CHECK(std::equal(i5.begin(),i5.end(),v.begin()));
|
|
}
|
|
|
|
{
|
|
/* by id */
|
|
|
|
std::sort(v.begin(),v.end());
|
|
BOOST_CHECK(std::equal(es.begin(),es.end(),v.begin()));
|
|
}
|
|
|
|
{
|
|
/* by age */
|
|
|
|
std::sort(v.begin(),v.end(),less_by_employee_age());
|
|
BOOST_CHECK(std::equal(i2.begin(),i2.end(),v.begin()));
|
|
}
|
|
|
|
}
|