Collapse all Symbian^3 Product Developer Library

RSafePointerArray Class Reference

class RSafePointerArray : public RPointerArray

Inherits from

RSafePointerArray
- RPointerArray
  - RPointerArrayBase

Public Member Functions
void	Remove(TInt)

Inherited Functions
	RPointerArray::Append(const T *)
	RPointerArray::AppendL(const T *)
	RPointerArray::Array()const
	RPointerArray::Close()
	RPointerArray::Compress()
	RPointerArray::Count()const
	RPointerArray::Find(const K &,TBool()(const K k, const T &t))const
	RPointerArray::Find(const T *)const
	RPointerArray::Find(const T *,TIdentityRelation< T >)const
	RPointerArray::FindInAddressOrder(const T *)const
	RPointerArray::FindInAddressOrder(const T *,TInt &)const
	RPointerArray::FindInAddressOrderL(const T *)const
	RPointerArray::FindInAddressOrderL(const T *,TInt &)const
	RPointerArray::FindInOrder(const K &,TInt()(const K k, const T &t))const
	RPointerArray::FindInOrder(const T *,TInt &,TLinearOrder< T >)const
	RPointerArray::FindInOrder(const T *,TLinearOrder< T >)const
	RPointerArray::FindInOrderL(const T *,TInt &,TLinearOrder< T >)const
	RPointerArray::FindInOrderL(const T *,TLinearOrder< T >)const
	RPointerArray::FindL(const T *)const
	RPointerArray::FindL(const T *,TIdentityRelation< T >)const
	RPointerArray::FindReverse(const K &,TInt()(const K k, const T &t))const
	RPointerArray::FindReverse(const T *)const
	RPointerArray::FindReverse(const T *,TIdentityRelation< T >)const
	RPointerArray::FindReverseL(const T *)const
	RPointerArray::FindReverseL(const T *,TIdentityRelation< T >)const
	RPointerArray::GranularCompress()
	RPointerArray::Insert(const T *,TInt)
	RPointerArray::InsertInAddressOrder(const T *)
	RPointerArray::InsertInAddressOrderAllowRepeats(const T *)
	RPointerArray::InsertInAddressOrderAllowRepeatsL(const T *)
	RPointerArray::InsertInAddressOrderL(const T *)
	RPointerArray::InsertInOrder(const T *,TLinearOrder< T >)
	RPointerArray::InsertInOrderAllowRepeats(const T *,TLinearOrder< T >)
	RPointerArray::InsertInOrderAllowRepeatsL(const T *,TLinearOrder< T >)
	RPointerArray::InsertInOrderL(const T *,TLinearOrder< T >)
	RPointerArray::InsertL(const T *,TInt)
	RPointerArray::RPointerArray()
	RPointerArray::RPointerArray(T **,TInt)
	RPointerArray::RPointerArray(TInt)
	RPointerArray::RPointerArray(TInt,TInt)
	RPointerArray::Reserve(TInt)
	RPointerArray::ReserveL(TInt)
	RPointerArray::Reset()
	RPointerArray::ResetAndDestroy()
	RPointerArray::Sort(TLinearOrder< T >)
	RPointerArray::SortIntoAddressOrder()
	RPointerArray::SpecificFindInAddressOrder(const T *,TInt &,TInt)const
	RPointerArray::SpecificFindInAddressOrder(const T *,TInt)const
	RPointerArray::SpecificFindInAddressOrderL(const T *,TInt &,TInt)const
	RPointerArray::SpecificFindInAddressOrderL(const T *,TInt)const
	RPointerArray::SpecificFindInOrder(const T *,TInt &,TLinearOrder< T >,TInt)const
	RPointerArray::SpecificFindInOrder(const T *,TLinearOrder< T >,TInt)const
	RPointerArray::SpecificFindInOrderL(const T *,TInt &,TLinearOrder< T >,TInt)const
	RPointerArray::SpecificFindInOrderL(const T *,TLinearOrder< T >,TInt)const
	RPointerArray::operator[](TInt)
	RPointerArray::operator[](TInt)const

Member Functions Documentation

Remove(TInt)

void

Remove

(

TInt

anIndex

)

[inline]

Removes the object pointer at the specified position from the array.

Note that the function does not delete the object whose pointer is removed.

panic: USER 130, if anIndex is negative, or is greater than the number of objects currently in the array.

Parameters

TInt anIndex

The position within the array from where the object pointer is to be removed. The position is relative to zero, i.e. zero implies that a pointer at the beginning of the array is to be removed.