mirror of https://github.com/CGAL/cgal
73 lines
1.6 KiB
C++
73 lines
1.6 KiB
C++
// Copyright (c) 2004-2005 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
|
|
// 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$
|
|
//
|
|
//
|
|
// Author(s) : Laurent RINEAU
|
|
|
|
#ifndef CGAL_MESH_3_SIMPLE_QUEUE_CONTAINER_H
|
|
#define CGAL_MESH_3_SIMPLE_QUEUE_CONTAINER_H
|
|
|
|
#include <queue>
|
|
|
|
namespace CGAL {
|
|
|
|
namespace Mesh_3 {
|
|
|
|
template <typename Elt>
|
|
class Simple_queue_container
|
|
{
|
|
public:
|
|
typedef Elt Element;
|
|
typedef std::queue<Element> Queue;
|
|
typedef typename Queue::size_type size_type;
|
|
|
|
protected:
|
|
// --- protected datas ---
|
|
Queue q;
|
|
|
|
public:
|
|
bool no_longer_element_to_refine_impl() const
|
|
{
|
|
return q.empty();
|
|
}
|
|
|
|
Element& get_next_element_impl()
|
|
{
|
|
return q.front();
|
|
}
|
|
|
|
void add_bad_element(const Element& e)
|
|
{
|
|
q.push(e);
|
|
}
|
|
|
|
void pop_next_element_impl()
|
|
{
|
|
q.pop();
|
|
}
|
|
|
|
size_type size() const
|
|
{
|
|
return q.size();
|
|
}
|
|
}; // end Simple_queue_container
|
|
|
|
} // end namespace Mesh_3
|
|
} // end namespace CGAL
|
|
|
|
#endif // CGAL_MESH_3_SIMPLE_QUEUE_CONTAINER_H
|