RRequestorStack Class Reference

class RRequestorStack : public RPointerArray< CRequestor >

Most standard applications will not use the RRequestorStack . Instead, they will call the simpler RPositioner::SetRequestor() method to identify themselves.

RRequestorStack will typically only be used if the application needs to identify a chain of requestors. For example, a remote party is requesting the location and this is routed through a local application. In this situation, the application should identify both itself and the remote party.

RPointerArray

Public Member Functions
IMPORT_C void ExternalizeL ( RWriteStream &)
IMPORT_C void InternalizeL ( RReadStream &)
Private Member Functions
void CleanupResetAndDestroy ( TAny *)
Inherited Functions
RPointerArray< CRequestor >::Append(const CRequestor *)
RPointerArray< CRequestor >::AppendL(const CRequestor *)
RPointerArray< CRequestor >::Array()const
RPointerArray< CRequestor >::Close()
RPointerArray< CRequestor >::Compress()
RPointerArray< CRequestor >::Count()const
RPointerArray< CRequestor >::Find(const CRequestor *)const
RPointerArray< CRequestor >::Find(const CRequestor *,TIdentityRelation< CRequestor >)const
RPointerArray< CRequestor >::Find(const K &,TBool(*)(const K *k, const CRequestor &t))const
RPointerArray< CRequestor >::FindInAddressOrder(const CRequestor *)const
RPointerArray< CRequestor >::FindInAddressOrder(const CRequestor *,TInt &)const
RPointerArray< CRequestor >::FindInAddressOrderL(const CRequestor *)const
RPointerArray< CRequestor >::FindInAddressOrderL(const CRequestor *,TInt &)const
RPointerArray< CRequestor >::FindInOrder(const CRequestor *,TInt &,TLinearOrder< CRequestor >)const
RPointerArray< CRequestor >::FindInOrder(const CRequestor *,TLinearOrder< CRequestor >)const
RPointerArray< CRequestor >::FindInOrder(const K &,TInt(*)(const K *k, const CRequestor &t))const
RPointerArray< CRequestor >::FindInOrderL(const CRequestor *,TInt &,TLinearOrder< CRequestor >)const
RPointerArray< CRequestor >::FindInOrderL(const CRequestor *,TLinearOrder< CRequestor >)const
RPointerArray< CRequestor >::FindL(const CRequestor *)const
RPointerArray< CRequestor >::FindL(const CRequestor *,TIdentityRelation< CRequestor >)const
RPointerArray< CRequestor >::FindReverse(const CRequestor *)const
RPointerArray< CRequestor >::FindReverse(const CRequestor *,TIdentityRelation< CRequestor >)const
RPointerArray< CRequestor >::FindReverse(const K &,TInt(*)(const K *k, const CRequestor &t))const
RPointerArray< CRequestor >::FindReverseL(const CRequestor *)const
RPointerArray< CRequestor >::FindReverseL(const CRequestor *,TIdentityRelation< CRequestor >)const
RPointerArray< CRequestor >::GranularCompress()
RPointerArray< CRequestor >::Insert(const CRequestor *,TInt)
RPointerArray< CRequestor >::InsertInAddressOrder(const CRequestor *)
RPointerArray< CRequestor >::InsertInAddressOrderAllowRepeats(const CRequestor *)
RPointerArray< CRequestor >::InsertInAddressOrderAllowRepeatsL(const CRequestor *)
RPointerArray< CRequestor >::InsertInAddressOrderL(const CRequestor *)
RPointerArray< CRequestor >::InsertInOrder(const CRequestor *,TLinearOrder< CRequestor >)
RPointerArray< CRequestor >::InsertInOrderAllowRepeats(const CRequestor *,TLinearOrder< CRequestor >)
RPointerArray< CRequestor >::InsertInOrderAllowRepeatsL(const CRequestor *,TLinearOrder< CRequestor >)
RPointerArray< CRequestor >::InsertInOrderL(const CRequestor *,TLinearOrder< CRequestor >)
RPointerArray< CRequestor >::InsertL(const CRequestor *,TInt)
RPointerArray< CRequestor >::RPointerArray()
RPointerArray< CRequestor >::RPointerArray(CRequestor **,TInt)
RPointerArray< CRequestor >::RPointerArray(TInt)
RPointerArray< CRequestor >::RPointerArray(TInt,TInt)
RPointerArray< CRequestor >::Remove(TInt)
RPointerArray< CRequestor >::Reserve(TInt)
RPointerArray< CRequestor >::ReserveL(TInt)
RPointerArray< CRequestor >::Reset()
RPointerArray< CRequestor >::ResetAndDestroy()
RPointerArray< CRequestor >::Sort(TLinearOrder< CRequestor >)
RPointerArray< CRequestor >::SortIntoAddressOrder()
RPointerArray< CRequestor >::SpecificFindInAddressOrder(const CRequestor *,TInt &,TInt)const
RPointerArray< CRequestor >::SpecificFindInAddressOrder(const CRequestor *,TInt)const
RPointerArray< CRequestor >::SpecificFindInAddressOrderL(const CRequestor *,TInt &,TInt)const
RPointerArray< CRequestor >::SpecificFindInAddressOrderL(const CRequestor *,TInt)const
RPointerArray< CRequestor >::SpecificFindInOrder(const CRequestor *,TInt &,TLinearOrder< CRequestor >,TInt)const
RPointerArray< CRequestor >::SpecificFindInOrder(const CRequestor *,TLinearOrder< CRequestor >,TInt)const
RPointerArray< CRequestor >::SpecificFindInOrderL(const CRequestor *,TInt &,TLinearOrder< CRequestor >,TInt)const
RPointerArray< CRequestor >::SpecificFindInOrderL(const CRequestor *,TLinearOrder< CRequestor >,TInt)const
RPointerArray< CRequestor >::operator[](TInt)
RPointerArray< CRequestor >::operator[](TInt)const
Private Attributes
TUint8 iReserved

Member Functions Documentation

CleanupResetAndDestroy(TAny *)

void CleanupResetAndDestroy ( TAny * aArray ) [private, static]

An internal function for cleaning up the requestor stack if a leave occurs during the internalization process.

Parameters

TAny * aArray is a pointer to an RRequestorStack

ExternalizeL(RWriteStream &)

IMPORT_C void ExternalizeL ( RWriteStream & aStream ) const

Stores a collection of requestors member data to a stream.

Parameters

RWriteStream & aStream the stream to which each of the requestors data is written.

InternalizeL(RReadStream &)

IMPORT_C void InternalizeL ( RReadStream & aStream )

Restores a collection of requestors member data from a stream.

Parameters

RReadStream & aStream the stream from which each of the requestors data is read.

Member Data Documentation

TUint8 iReserved

TUint8 iReserved [private]

Unused variable for future expansion.