Stack which contains elements from [0..n] in sorted order. Duplicates are possible.
More...
#include <sorted_multi_stack_support.hpp >
Stack which contains elements from [0..n] in sorted order. Duplicates are possible.
Space complexity bits
Definition at line 31 of file sorted_multi_stack_support.hpp .
◆ size_type
◆ sorted_multi_stack_support() [1/3]
sdsl::sorted_multi_stack_support::sorted_multi_stack_support
(
size_type n )
inline
◆ sorted_multi_stack_support() [2/3]
◆ sorted_multi_stack_support() [3/3]
◆ CEREAL_LOAD_FUNCTION_NAME()
template<typename archive_t>
void sdsl::sorted_multi_stack_support::CEREAL_LOAD_FUNCTION_NAME
(
archive_t & ar )
◆ CEREAL_SAVE_FUNCTION_NAME()
template<typename archive_t>
void sdsl::sorted_multi_stack_support::CEREAL_SAVE_FUNCTION_NAME
(
archive_t & ar )
const
◆ empty()
bool sdsl::sorted_multi_stack_support::empty
(
)
const
inline
◆ load()
void sdsl::sorted_multi_stack_support::load
(
std::istream & in )
inline
◆ operator=() [1/2]
◆ operator=() [2/2]
◆ pop()
bool sdsl::sorted_multi_stack_support::pop
(
)
inline
Pop the topmost index of the stack.
Returns True if there the value of the top element after the execution of pop() is not equal to the value of the top element before the execution of pop() . False otherwise.
Definition at line 145 of file sorted_multi_stack_support.hpp .
◆ push()
bool sdsl::sorted_multi_stack_support::push
(
size_type x )
inline
Push the index x of vector vec onto the stack.
x value which should be pushed onto the stack.
Returns True if the value on the top of the stack is smaller than x. False if the value is equal.
Precondition top() <= x
Definition at line 119 of file sorted_multi_stack_support.hpp .
◆ serialize()
◆ size()
size_type sdsl::sorted_multi_stack_support::size
(
)
const
inline
◆ top()
The documentation for this class was generated from the following file: