reservable_priority_queue.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2014-2017, the neonavigation authors
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions are met:
7  *
8  * * Redistributions of source code must retain the above copyright
9  * notice, this list of conditions and the following disclaimer.
10  * * Redistributions in binary form must reproduce the above copyright
11  * notice, this list of conditions and the following disclaimer in the
12  * documentation and/or other materials provided with the distribution.
13  * * Neither the name of the copyright holder nor the names of its
14  * contributors may be used to endorse or promote products derived from
15  * this software without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27  * POSSIBILITY OF SUCH DAMAGE.
28  */
29 
30 #ifndef PLANNER_CSPACE_RESERVABLE_PRIORITY_QUEUE_H
31 #define PLANNER_CSPACE_RESERVABLE_PRIORITY_QUEUE_H
32 
33 #include <queue>
34 
35 namespace planner_cspace
36 {
37 template <class T>
38 class reservable_priority_queue : public std::priority_queue<T>
39 {
40 public:
41  typedef typename std::priority_queue<T>::size_type size_type;
42  explicit reservable_priority_queue(const size_type capacity = 0)
43  {
45  }
46  void reserve(const size_type capacity)
47  {
48  this->c.reserve(capacity);
49  }
50  size_type capacity() const
51  {
52  return this->c.capacity();
53  }
54  void clear()
55  {
56  this->c.clear();
57  }
58  void pop_back()
59  {
60  this->c.pop_back();
61  }
62 };
63 } // namespace planner_cspace
64 
65 #endif // PLANNER_CSPACE_RESERVABLE_PRIORITY_QUEUE_H
std::priority_queue< T >::size_type size_type


planner_cspace
Author(s): Atsushi Watanabe
autogenerated on Wed May 12 2021 02:20:42