LibreOffice Module svl (master) 1
Public Member Functions | Private Attributes | List of all members
SfxPoolItemArray_Impl Struct Reference

This array contains a set of SfxPoolItems, if those items are poolable then each item has a unique set of properties, and we often search linearly to ensure uniqueness. More...

#include <poolio.hxx>

Collaboration diagram for SfxPoolItemArray_Impl:
[legend]

Public Member Functions

o3tl::sorted_vector< SfxPoolItem * >::const_iterator begin () const
 
o3tl::sorted_vector< SfxPoolItem * >::const_iterator end () const
 
void clear ()
 clear array of PoolItem variants after all PoolItems are deleted or all ref counts are decreased More...
 
size_t size () const
 
bool empty () const
 
o3tl::sorted_vector< SfxPoolItem * >::const_iterator find (SfxPoolItem *pItem) const
 
void insert (SfxPoolItem *pItem)
 
const SfxPoolItemfindByLessThan (const SfxPoolItem *pNeedle) const
 
std::vector< const SfxPoolItem * > findSurrogateRange (const SfxPoolItem *pNeedle) const
 
void erase (o3tl::sorted_vector< SfxPoolItem * >::const_iterator it)
 

Private Attributes

o3tl::sorted_vector< SfxPoolItem * > maPoolItemSet
 
std::vector< SfxPoolItem * > maSortablePoolItems
 

Detailed Description

This array contains a set of SfxPoolItems, if those items are poolable then each item has a unique set of properties, and we often search linearly to ensure uniqueness.

If they are non-poolable we maintain an (often large) list of pointers.

Definition at line 46 of file poolio.hxx.

Member Function Documentation

◆ begin()

o3tl::sorted_vector< SfxPoolItem * >::const_iterator SfxPoolItemArray_Impl::begin ( ) const
inline

◆ clear()

void SfxPoolItemArray_Impl::clear ( )

clear array of PoolItem variants after all PoolItems are deleted or all ref counts are decreased

Definition at line 91 of file itempool.cxx.

References o3tl::sorted_vector< typename Value, typename Compare, template< typename, typename > class Find, bool >::clear(), maPoolItemSet, and maSortablePoolItems.

◆ empty()

bool SfxPoolItemArray_Impl::empty ( ) const
inline

◆ end()

o3tl::sorted_vector< SfxPoolItem * >::const_iterator SfxPoolItemArray_Impl::end ( ) const
inline

◆ erase()

void SfxPoolItemArray_Impl::erase ( o3tl::sorted_vector< SfxPoolItem * >::const_iterator  it)
inline

◆ find()

o3tl::sorted_vector< SfxPoolItem * >::const_iterator SfxPoolItemArray_Impl::find ( SfxPoolItem pItem) const
inline

◆ findByLessThan()

const SfxPoolItem * SfxPoolItemArray_Impl::findByLessThan ( const SfxPoolItem pNeedle) const
inline

◆ findSurrogateRange()

std::vector< const SfxPoolItem * > SfxPoolItemArray_Impl::findSurrogateRange ( const SfxPoolItem pNeedle) const
inline

Definition at line 97 of file poolio.hxx.

References CompareSortablePoolItems(), maPoolItemSet, maSortablePoolItems, and p.

Referenced by SfxItemPool::FindItemSurrogate().

◆ insert()

void SfxPoolItemArray_Impl::insert ( SfxPoolItem pItem)
inline

◆ size()

size_t SfxPoolItemArray_Impl::size ( ) const
inline

Member Data Documentation

◆ maPoolItemSet

o3tl::sorted_vector<SfxPoolItem*> SfxPoolItemArray_Impl::maPoolItemSet
private

Definition at line 49 of file poolio.hxx.

Referenced by begin(), clear(), empty(), end(), erase(), find(), findByLessThan(), findSurrogateRange(), insert(), and size().

◆ maSortablePoolItems

std::vector<SfxPoolItem*> SfxPoolItemArray_Impl::maSortablePoolItems
private

Definition at line 54 of file poolio.hxx.

Referenced by clear(), erase(), findByLessThan(), findSurrogateRange(), and insert().


The documentation for this struct was generated from the following files: