#include <ndarr.hxx>

Inheritance diagram for SwOutlineNodes:

Collaboration diagram for SwOutlineNodes:

Public Member Functions
bool	Seek_Entry (SwNode rP, size_type pnPos) const

Public Member Functions inherited from o3tl::sorted_vector< SwNode *, CompareSwOutlineNodes >
constexpr	sorted_vector (std::initializer_list< SwNode * > init)

	sorted_vector ()=default

	sorted_vector (sorted_vector const &)=default

	sorted_vector (sorted_vector &&)=default

sorted_vector &	operator= (sorted_vector const &)=default

sorted_vector &	operator= (sorted_vector &&)=default

std::pair< const_iterator, bool >	insert (SwNode * &&x)

std::pair< const_iterator, bool >	insert (const SwNode * &x)

void	insert (sorted_vector< SwNode *, CompareSwOutlineNodes, Find > const &rOther)

size_type	erase (const SwNode * &x)

void	erase (size_t index)

void	erase (const_iterator const &position)

void	erase (const_iterator const &first, const_iterator const &last)

SwNode *	erase_extract (size_t index)

void	clear ()

void	swap (sorted_vector &other)

void	reserve (size_type amount)

size_type	size () const

bool	empty () const

const_iterator	begin () const

const_iterator	end () const

const SwNode * &	front () const

const SwNode * &	back () const

const SwNode * &	operator[] (size_t index) const

const_iterator	lower_bound (const SwNode * &x) const

const_iterator	upper_bound (const SwNode * &x) const

const_iterator	find (const SwNode * &x) const

size_type	count (const SwNode * &v) const

bool	operator== (const sorted_vector &other) const

bool	operator!= (const sorted_vector &other) const

void	DeleteAndDestroyAll ()

void	Resort ()

Static Public Attributes
static constexpr auto	npos = std::numeric_limits<size_type>::max()

Additional Inherited Members
Public Types inherited from o3tl::sorted_vector< SwNode *, CompareSwOutlineNodes >
typedef std::vector< SwNode * >::const_iterator	const_iterator

typedef std::vector< SwNode * >::difference_type	difference_type

typedef std::vector< SwNode * >::size_type	size_type