Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

inplaceds::beap_set

inplaceds::beap_set< _Tp, _Sequence, _Compare > Class Template Reference

#include <beap_set.hpp>

Collaboration diagram for inplaceds::beap_set< _Tp, _Sequence, _Compare >:

Collaboration graph
[legend]

Detailed Description

template<class _Tp, class _Sequence = std::vector<_Tp>, class _Compare = std::less<typename _Sequence::value_type>>
class inplaceds::beap_set< _Tp, _Sequence, _Compare >

Definition at line 24 of file beap_set.hpp.

Public Types

typedef _Sequence::value_type value_type
typedef _Sequence::size_type size_type
typedef _Sequence container_type
typedef _Sequence::iterator iterator
typedef _Sequence::const_iterator const_iterator

Public Member Functions

 beap_set (const value_type *first, const value_type *last)
 Create a new beap_set from the copy of the range [first, last).
 beap_set (const value_type *first, const value_type *last, const Comp &compare)
 Create a new beap_set from the copy of the range [first, last) with the given comparison functor.
reference find (_Tp x)
 Returns reference to the element x. If is not in the structure, last is returned.
bool is_empty ()
 Returns true if the structure is empty.
const_iterator top () const
 Returns reference to the top element.
const_iterator bottom () const
 Returns reference to the bottom element.
void insert (_Tp x)
 Insert element x into the beap_set.
bool remove (_Tp x)
 If element x is in the beap_set, it will be removed and true is returned. Else, false is returned.
void sort (reference first)
const_iterator end ()

Protected Attributes

_Sequence c
_Compare comp

The documentation for this class was generated from the following file:

Code Documentation generated Using Doxygen

Copyright © Ilya Katz and Hervé Brönnimann, 2005, 2006.