dust3d/thirdparty/cgal/CGAL-4.13/include/CGAL/Meshes/Simple_map_container.h

86 lines
2.0 KiB
C++
Executable File

// Copyright (c) 2007 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 3 of the License,
// or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
// SPDX-License-Identifier: LGPL-3.0+
//
//
// Author(s) : Laurent RINEAU
#ifndef CGAL_MESHES_SIMPLE_MAP_CONTAINER_H
#define CGAL_MESHES_SIMPLE_MAP_CONTAINER_H
#include <map>
namespace CGAL {
namespace Meshes {
template <typename Element, typename Info>
class Simple_map_container
{
public:
typedef std::map<Element, Info> Map;
typedef typename Map::size_type size_type;
typedef typename Map::value_type value_type;
protected:
// --- protected datas ---
Map map;
public:
bool no_longer_element_to_refine_impl() const
{
return map.empty();
}
const value_type& get_next_element_impl()
{
CGAL_assertion(!map.empty());
return *(map.begin());
}
void add_bad_element(const Element& e, const Info& i)
{
map.insert(std::make_pair(e, i));
}
void pop_next_element_impl()
{
map.erase(map.begin());
}
void remove_element(const Element& e)
{
map.erase(e);
}
const Info& info(const Element& e)
{
return map[e];
}
size_type size() const
{
return map.size();
}
}; // end Simple_map_container
} // end namespace Mesh_3
} // end namespace CGAL
#endif // CGAL_MESHES_SIMPLE_MAP_CONTAINER_H