/usr/include/boost/heap/priority_queue.hpp is in libboost1.55-dev 1.55.0+dfsg-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 | // boost heap: wrapper for stl heap
//
// Copyright (C) 2010 Tim Blechmann
//
// 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)
#ifndef BOOST_HEAP_PRIORITY_QUEUE_HPP
#define BOOST_HEAP_PRIORITY_QUEUE_HPP
#include <algorithm>
#include <queue>
#include <utility>
#include <vector>
#include <boost/assert.hpp>
#include <boost/heap/detail/heap_comparison.hpp>
#include <boost/heap/detail/stable_heap.hpp>
namespace boost {
namespace heap {
namespace detail {
typedef parameter::parameters<boost::parameter::optional<tag::allocator>,
boost::parameter::optional<tag::compare>,
boost::parameter::optional<tag::stable>,
boost::parameter::optional<tag::stability_counter_type>
> priority_queue_signature;
}
/**
* \class priority_queue
* \brief priority queue, based on stl heap functions
*
* The priority_queue class is a wrapper for the stl heap functions.<br>
* The template parameter T is the type to be managed by the container.
* The user can specify additional options and if no options are provided default options are used.
*
* The container supports the following options:
* - \c boost::heap::compare<>, defaults to \c compare<std::less<T> >
* - \c boost::heap::stable<>, defaults to \c stable<false>
* - \c boost::heap::stability_counter_type<>, defaults to \c stability_counter_type<boost::uintmax_t>
* - \c boost::heap::allocator<>, defaults to \c allocator<std::allocator<T> >
*
*/
#ifdef BOOST_DOXYGEN_INVOKED
template<class T, class ...Options>
#else
template <typename T,
class A0 = boost::parameter::void_,
class A1 = boost::parameter::void_,
class A2 = boost::parameter::void_,
class A3 = boost::parameter::void_
>
#endif
class priority_queue:
private detail::make_heap_base<T, typename detail::priority_queue_signature::bind<A0, A1, A2, A3>::type, false>::type
{
typedef detail::make_heap_base<T, typename detail::priority_queue_signature::bind<A0, A1, A2, A3>::type, false> heap_base_maker;
typedef typename heap_base_maker::type super_t;
typedef typename super_t::internal_type internal_type;
typedef typename heap_base_maker::allocator_argument::template rebind<internal_type>::other internal_type_allocator;
typedef std::vector<internal_type, internal_type_allocator> container_type;
template <typename Heap1, typename Heap2>
friend struct detail::heap_merge_emulate;
container_type q_;
#ifndef BOOST_DOXYGEN_INVOKED
struct implementation_defined:
detail::extract_allocator_types<typename heap_base_maker::allocator_argument>
{
typedef typename heap_base_maker::compare_argument value_compare;
typedef detail::stable_heap_iterator<T, typename container_type::const_iterator, super_t> iterator;
typedef iterator const_iterator;
typedef typename container_type::allocator_type allocator_type;
};
#endif
public:
typedef T value_type;
typedef typename implementation_defined::size_type size_type;
typedef typename implementation_defined::difference_type difference_type;
typedef typename implementation_defined::value_compare value_compare;
typedef typename implementation_defined::allocator_type allocator_type;
typedef typename implementation_defined::reference reference;
typedef typename implementation_defined::const_reference const_reference;
typedef typename implementation_defined::pointer pointer;
typedef typename implementation_defined::const_pointer const_pointer;
/**
* \b Note: The iterator does not traverse the priority queue in order of the priorities.
* */
typedef typename implementation_defined::iterator iterator;
typedef typename implementation_defined::const_iterator const_iterator;
static const bool constant_time_size = true;
static const bool has_ordered_iterators = false;
static const bool is_mergable = false;
static const bool is_stable = heap_base_maker::is_stable;
static const bool has_reserve = true;
/**
* \b Effects: constructs an empty priority queue.
*
* \b Complexity: Constant.
*
* */
explicit priority_queue(value_compare const & cmp = value_compare()):
super_t(cmp)
{}
/**
* \b Effects: copy-constructs priority queue from rhs.
*
* \b Complexity: Linear.
*
* */
priority_queue (priority_queue const & rhs):
super_t(rhs), q_(rhs.q_)
{}
#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
/**
* \b Effects: C++11-style move constructor.
*
* \b Complexity: Constant.
*
* \b Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined
* */
priority_queue(priority_queue && rhs):
super_t(std::move(rhs)), q_(std::move(rhs.q_))
{}
/**
* \b Effects: C++11-style move assignment.
*
* \b Complexity: Constant.
*
* \b Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined
* */
priority_queue & operator=(priority_queue && rhs)
{
super_t::operator=(std::move(rhs));
q_ = std::move(rhs.q_);
return *this;
}
#endif
/**
* \b Effects: Assigns priority queue from rhs.
*
* \b Complexity: Linear.
*
* */
priority_queue & operator=(priority_queue const & rhs)
{
static_cast<super_t&>(*this) = static_cast<super_t const &>(rhs);
q_ = rhs.q_;
return *this;
}
/**
* \b Effects: Returns true, if the priority queue contains no elements.
*
* \b Complexity: Constant.
*
* */
bool empty(void) const
{
return q_.empty();
}
/**
* \b Effects: Returns the number of elements contained in the priority queue.
*
* \b Complexity: Constant.
*
* */
size_type size(void) const
{
return q_.size();
}
/**
* \b Effects: Returns the maximum number of elements the priority queue can contain.
*
* \b Complexity: Constant.
*
* */
size_type max_size(void) const
{
return q_.max_size();
}
/**
* \b Effects: Removes all elements from the priority queue.
*
* \b Complexity: Linear.
*
* */
void clear(void)
{
q_.clear();
}
/**
* \b Effects: Returns allocator.
*
* \b Complexity: Constant.
*
* */
allocator_type get_allocator(void) const
{
return q_.get_allocator();
}
/**
* \b Effects: Returns a const_reference to the maximum element.
*
* \b Complexity: Constant.
*
* */
const_reference top(void) const
{
BOOST_ASSERT(!empty());
return super_t::get_value(q_.front());
}
/**
* \b Effects: Adds a new element to the priority queue.
*
* \b Complexity: Logarithmic (amortized). Linear (worst case).
*
* */
void push(value_type const & v)
{
q_.push_back(super_t::make_node(v));
std::push_heap(q_.begin(), q_.end(), static_cast<super_t const &>(*this));
}
#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
/**
* \b Effects: Adds a new element to the priority queue. The element is directly constructed in-place.
*
* \b Complexity: Logarithmic (amortized). Linear (worst case).
*
* */
template <class... Args>
void emplace(Args&&... args)
{
q_.emplace_back(super_t::make_node(std::forward<Args>(args)...));
std::push_heap(q_.begin(), q_.end(), static_cast<super_t const &>(*this));
}
#endif
/**
* \b Effects: Removes the top element from the priority queue.
*
* \b Complexity: Logarithmic (amortized). Linear (worst case).
*
* */
void pop(void)
{
BOOST_ASSERT(!empty());
std::pop_heap(q_.begin(), q_.end(), static_cast<super_t const &>(*this));
q_.pop_back();
}
/**
* \b Effects: Swaps two priority queues.
*
* \b Complexity: Constant.
*
* */
void swap(priority_queue & rhs)
{
super_t::swap(rhs);
q_.swap(rhs.q_);
}
/**
* \b Effects: Returns an iterator to the first element contained in the priority queue.
*
* \b Complexity: Constant.
*
* */
iterator begin(void) const
{
return iterator(q_.begin());
}
/**
* \b Effects: Returns an iterator to the end of the priority queue.
*
* \b Complexity: Constant.
*
* */
iterator end(void) const
{
return iterator(q_.end());
}
/**
* \b Effects: Reserves memory for element_count elements
*
* \b Complexity: Linear.
*
* \b Node: Invalidates iterators
*
* */
void reserve(size_type element_count)
{
q_.reserve(element_count);
}
/**
* \b Effect: Returns the value_compare object used by the priority queue
*
* */
value_compare const & value_comp(void) const
{
return super_t::value_comp();
}
/**
* \b Returns: Element-wise comparison of heap data structures
*
* \b Requirement: the \c value_compare object of both heaps must match.
*
* */
template <typename HeapType>
bool operator<(HeapType const & rhs) const
{
return detail::heap_compare(*this, rhs);
}
/**
* \b Returns: Element-wise comparison of heap data structures
*
* \b Requirement: the \c value_compare object of both heaps must match.
*
* */
template <typename HeapType>
bool operator>(HeapType const & rhs) const
{
return detail::heap_compare(rhs, *this);
}
/**
* \b Returns: Element-wise comparison of heap data structures
*
* \b Requirement: the \c value_compare object of both heaps must match.
*
* */
template <typename HeapType>
bool operator>=(HeapType const & rhs) const
{
return !operator<(rhs);
}
/**
* \b Returns: Element-wise comparison of heap data structures
*
* \b Requirement: the \c value_compare object of both heaps must match.
*
* */
template <typename HeapType>
bool operator<=(HeapType const & rhs) const
{
return !operator>(rhs);
}
/** \brief Equivalent comparison
* \b Returns: True, if both heap data structures are equivalent.
*
* \b Requirement: the \c value_compare object of both heaps must match.
*
* */
template <typename HeapType>
bool operator==(HeapType const & rhs) const
{
return detail::heap_equality(*this, rhs);
}
/** \brief Equivalent comparison
* \b Returns: True, if both heap data structures are not equivalent.
*
* \b Requirement: the \c value_compare object of both heaps must match.
*
* */
template <typename HeapType>
bool operator!=(HeapType const & rhs) const
{
return !(*this == rhs);
}
};
} /* namespace heap */
} /* namespace boost */
#endif /* BOOST_HEAP_PRIORITY_QUEUE_HPP */
|