KDevelop::ConstantConvenientEmbeddedSet< Data, Handler > Class Template Reference

A convenience-class for accessing the data in a set managed by the EmbeddedFreeTree algorithms. More...

#include <convenientfreelist.h>

Inheritance diagram for KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >:

[legend]

List of all members.

Public Types
typedef ConvenientEmbeddedSetIterator < Data, Handler >	Iterator
Public Member Functions
	ConstantConvenientEmbeddedSet (const Data *data, uint count, int centralFreeItem)
bool	contains (const Data &data) const
uint	countFreeItems ()
const Data *	data () const
uint	dataSize () const
int	firstValidItem (int start, int end=-1) const
int	indexOf (const Data &data) const
ConvenientEmbeddedSetIterator < Data, Handler >	iterator () const
int	lastValidItem (int start=0, int end=-1) const
int	lowerBound (const Data &data, uint start, uint end) const
int	lowerBound (const Data &data) const
int	validMiddle (uint start, uint end)
void	verify ()
Public Attributes
int	m_centralFreeItem
const Data *	m_data
uint	m_dataSize

---

Detailed Description

template<class Data, class Handler>
class KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >

A convenience-class for accessing the data in a set managed by the EmbeddedFreeTree algorithms.

Definition at line 39 of file convenientfreelist.h.

---

Member Function Documentation

template<class Data, class Handler>

bool KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::contains

(

const Data &

data

)

const [inline]

Returns whether the item is contained in this set.

Definition at line 47 of file convenientfreelist.h.

template<class Data, class Handler>

const Data* KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::data

(

)

const [inline]

Returns the underlying array. That array may contain invalid/free items.

Definition at line 74 of file convenientfreelist.h.

template<class Data, class Handler>

uint KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::dataSize

(

)

const [inline]

Returns the size of the underlying array.

Definition at line 58 of file convenientfreelist.h.

template<class Data, class Handler>

int KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::firstValidItem	(	int	start,
		int	end = -1
	)			const [inline]

Returns the first valid item in the range [pos, end), or -1.

Definition at line 120 of file convenientfreelist.h.

template<class Data, class Handler>

int KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::indexOf

(

const Data &

data

)

const [inline]

Returns the position of the item in the underlying array, or -1 if it is not contained.

Definition at line 52 of file convenientfreelist.h.

template<class Data, class Handler>

int KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::lastValidItem	(	int	start = 0,
		int	end = -1
	)			const [inline]

Returns the last valid item in the range [pos, end), or -1.

Definition at line 131 of file convenientfreelist.h.

template<class Data, class Handler>

int KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::lowerBound	(	const Data &	data,
		uint	start,
		uint	end
	)			const [inline]

Returns the first valid index that has a data-value larger or equal to.

Parameters:

data,and

that is in the range [start, end). Returns -1 if nothing is found.

Definition at line 88 of file convenientfreelist.h.

template<class Data, class Handler>

int KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::lowerBound

(

const Data &

data

)

const [inline]

Returns the first valid index that has a data-value larger or equal to.

Parameters:

data.

Returns -1 if nothing is found.

Definition at line 80 of file convenientfreelist.h.

template<class Data, class Handler>

int KDevelop::ConstantConvenientEmbeddedSet< Data, Handler >::validMiddle	(	uint	start,
		uint	end
	)			[inline]

Finds a valid most central in the range [start, end).

Returns -1 if no such item exists.

Definition at line 95 of file convenientfreelist.h.

---

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

• convenientfreelist.h