Array of unsigned integers. More...

#include <e32cmn.h>

Inheritance diagram for RArray< TUint >:

Public Member Functions
	RArray ()
	Default C++ constructor.

	RArray (TInt aGranularity)
	Constructs an array object for an array of unsigned integers with the specified granularity.

	RArray (TInt aMinGrowBy, TInt aFactor)
	C++ constructor with minimum growth step and exponential growth factor.

void	Close ()
	Closes the array and frees all memory allocated to the array.

TInt	Count () const
	Gets the number of unsigned integers in the array.

const TUint &	operator[] (TInt anIndex) const
	Gets a reference to the unsigned integer located at the specified position within the array.

TUint &	operator[] (TInt anIndex)
	Gets a reference to the unsigned integer located at the specified position within the array.

TInt	Append (TUint anEntry)
	Appends an unsigned integer onto the array.

TInt	Insert (TUint anEntry, TInt aPos)
	Inserts an unsigned integer into the array at the specified position.

void	Remove (TInt anIndex)
	Removes the unsigned integer at the specified position from the array.

void	Compress ()
	Compresses the array down to a minimum.

void	Reset ()
	Empties the array.

TInt	Find (TUint anEntry) const
	Finds the first unsigned integer in the array which matches the specified value, using a sequential search.

TInt	FindReverse (TUint anEntry) const
	Finds the last unsigned integer in the array which matches the specified value, using a sequential search.

TInt	FindInOrder (TUint anEntry) const
	Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

TInt	FindInOrder (TUint anEntry, TInt &anIndex) const
	Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

TInt	SpecificFindInOrder (TUint anEntry, TInt aMode) const
	Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

TInt	SpecificFindInOrder (TUint anEntry, TInt &anIndex, TInt aMode) const
	Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

TInt	InsertInOrder (TUint anEntry)
	Inserts an unsigned integer into the array in unsigned integer order.

TInt	InsertInOrderAllowRepeats (TUint anEntry)
	Inserts an unsigned integer into the array in unsigned integer order, allowing duplicates.

void	AppendL (TUint anEntry)
	Appends an unsigned integer onto the array.

void	InsertL (TUint anEntry, TInt aPos)
	Inserts an unsigned integer into the array at the specified position.

TInt	FindL (TUint anEntry) const
	Finds the first unsigned integer in the array which matches the specified value, using a sequential search.

TInt	FindReverseL (TUint anEntry) const
	Finds the last unsigned integer in the array which matches the specified value, using a sequential search.

TInt	FindInOrderL (TUint anEntry) const
	Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

void	FindInOrderL (TUint anEntry, TInt &anIndex) const
	Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

TInt	SpecificFindInOrderL (TUint anEntry, TInt aMode) const
	Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

void	SpecificFindInOrderL (TUint anEntry, TInt &anIndex, TInt aMode) const
	Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

void	InsertInOrderL (TUint anEntry)
	Inserts an unsigned integer into the array in unsigned integer order.

void	InsertInOrderAllowRepeatsL (TUint anEntry)
	Inserts an unsigned integer into the array in unsigned integer order, allowing duplicates.

	RArray (TUint *aEntries, TInt aCount)
	C++ constructor with a pointer to the first array entry in a pre-existing array, and the number of entries in that array.

void	GranularCompress ()
	Compresses the array down to a granular boundary.

TInt	Reserve (TInt aCount)
	Reserves space for the specified number of elements.

void	ReserveL (TInt aCount)
	Reserves space for the specified number of elements.

void	Sort ()
	Sorts the array entries into unsigned integer order.

TArray< TUint >	Array () const
	Constructs and returns a generic array.

Detailed Description

Array of unsigned integers.

The array is a simple and efficient specialized array of unsigned integers offering standard array behaviour.

The derivation from RPointerArrayBase is private.

API status: Published to all clients. Released API.

Definition at line 6133 of file e32cmn.h.

Constructor & Destructor Documentation

◆ RArray() [1/4]

RArray< TUint >::RArray ( )

inline

Default C++ constructor.

This constructs an array object for an array of unsigned integers with default granularity.

The default granularity of the array is 8.

(generated from Symbian Developer Library)

◆ RArray() [2/4]

RArray< TUint >::RArray ( TInt aGranularity )

inlineexplicit

Constructs an array object for an array of unsigned integers with the specified granularity.

Parameters

aGranularity The granularity of the array.

Panic condition: USER 127, if aGranularity is not positive or is greater than or equal to 0x10000000.

(generated from Symbian Developer Library)

◆ RArray() [3/4]

RArray< TUint >::RArray	(	TInt	aMinGrowBy,
		TInt	aFactor
	)

inline

C++ constructor with minimum growth step and exponential growth factor.

This constructs an array object for an array of unsigned integers with the specified minimum growth step and exponential growth factor.

Parameters

aMinGrowBy	The minimum growth step of the array. Must be between 1 and 65535 inclusive.
aFactor	The factor by which the array grows, multiplied by 256. For example 512 specifies a factor of 2. Must be between 257 and 32767 inclusive.

Panic condition: USER 192, if aMinGrowBy<=0 or aMinGrowBy>65535.

Panic condition: USER 193, if aFactor<=257 or aFactor>32767.

(generated from Symbian Developer Library)

◆ RArray() [4/4]

RArray< TUint >::RArray	(	TUint *	aEntries,
		TInt	aCount
	)

inline

C++ constructor with a pointer to the first array entry in a pre-existing array, and the number of entries in that array.

This constructor takes a pointer to a pre-existing set of entries of type TUint objects. Ownership of the set of entries does not transfer to this RArray object.

The purpose of constructing an array in this way is to allow sorting and finding operations to be done without further allocation of memory.

Parameters

aEntries	A pointer to the first entry of type class TUint in the set of entries belonging to the existing array.
aCount	The number of entries in the existing array.

(generated from Symbian Developer Library)

Member Function Documentation

◆ Append()

TInt RArray< TUint >::Append ( TUint anEntry )

inline

Appends an unsigned integer onto the array.

Parameters

anEntry The unsigned integer to be appended.

(generated from Symbian Developer Library)

◆ AppendL()

void RArray< TUint >::AppendL ( TUint anEntry )

inline

Appends an unsigned integer onto the array.

The function leaves with one of the system wide error codes, if the operation fails.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry The unsigned integer to be appended.

(generated from Symbian Developer Library)

◆ Array()

TArray< TUint > RArray< TUint >::Array ( ) const

inline

Constructs and returns a generic array.

TArray

(generated from Symbian Developer Library)

◆ Close()

void RArray< TUint >::Close ( )

inline

Closes the array and frees all memory allocated to the array.

The function must be called before this array object goes out of scope.

(generated from Symbian Developer Library)

◆ Compress()

void RArray< TUint >::Compress ( )

inline

Compresses the array down to a minimum.

After a call to this function, the memory allocated to the array is just sufficient for its entries. Subsequently adding a new unsigned integer to the array always results in a re-allocation of memory.

(generated from Symbian Developer Library)

◆ Count()

TInt RArray< TUint >::Count ( ) const

inline

Gets the number of unsigned integers in the array.

(generated from Symbian Developer Library)

◆ Find()

TInt RArray< TUint >::Find ( TUint anEntry ) const

inline

Finds the first unsigned integer in the array which matches the specified value, using a sequential search.

The find operation always starts at the low index end of the array. There is no assumption about the order of entries in the array.

Parameters

anEntry The unsigned integer to be found.

(generated from Symbian Developer Library)

◆ FindInOrder() [1/2]

TInt RArray< TUint >::FindInOrder ( TUint anEntry ) const

inline

Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

The functions assume that existing entries within the array are in unsigned integer order.

Parameters

anEntry The unsigned integer to be found.

(generated from Symbian Developer Library)

◆ FindInOrder() [2/2]

TInt RArray< TUint >::FindInOrder	(	TUint	anEntry,
		TInt &	anIndex
	)		const

inline

Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

If the index cannot be found, the function returns the index of the last unsigned integer within the array which logically precedes anEntry.

The functions assume that existing entries within the array are in unsigned integer order.

Parameters

anEntry The unsigned integer to be found.

anIndex A TInt supplied by the caller. On return, contains an index value. If the function returns KErrNone, this is the index of the matching unsigned integer within the array. If the function returns KErrNotFound, this is the index of the first unsigned integer within the array that is bigger than the unsigned integer being searched for - if no unsigned integers within the array are bigger, then the index value is the same as the total number of unsigned integers within the array.

(generated from Symbian Developer Library)

◆ FindInOrderL() [1/2]

TInt RArray< TUint >::FindInOrderL ( TUint anEntry ) const

inline

Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

The functions assume that existing entries within the array are in unsigned integer order.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry The unsigned integer to be found.

Leave condition: KErrNotFound, if no matching entry can be found.

(generated from Symbian Developer Library)

◆ FindInOrderL() [2/2]

void RArray< TUint >::FindInOrderL	(	TUint	anEntry,
		TInt &	anIndex
	)		const

inline

Finds the unsigned integer in the array which matches the specified value, using a binary search technique.

If the index cannot be found, the function returns the index of the last unsigned integer within the array which logically precedes anEntry. The functions assume that existing entries within the array are in unsigned integer order.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry The unsigned integer to be found.

anIndex A TInt supplied by the caller. On return, contains an index value of the matching unsigned integer within the array. If the function leaves with KErrNotFound, this is the index of the first unsigned integer within the array that is bigger than the unsigned integer being searched for - if no unsigned integers within the array are bigger, then the index value is the same as the total number of unsigned integers within the array.

Leave condition: KErrNotFound, if no matching entry can be found.

(generated from Symbian Developer Library)

◆ FindL()

TInt RArray< TUint >::FindL ( TUint anEntry ) const

inline

Finds the first unsigned integer in the array which matches the specified value, using a sequential search.

The find operation always starts at the low index end of the array. There is no assumption about the order of entries in the array.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry The unsigned integer to be found.

Leave condition: KErrNotFound, if no matching entry can be found.

(generated from Symbian Developer Library)

◆ FindReverse()

TInt RArray< TUint >::FindReverse ( TUint anEntry ) const

inline

Finds the last unsigned integer in the array which matches the specified value, using a sequential search.

The find operation always starts at the high index end of the array. There is no assumption about the order of entries in the array.

Parameters

anEntry The unsigned integer to be found.

(generated from Symbian Developer Library)

◆ FindReverseL()

TInt RArray< TUint >::FindReverseL ( TUint anEntry ) const

inline

Finds the last unsigned integer in the array which matches the specified value, using a sequential search.

The find operation always starts at the high index end of the array. There is no assumption about the order of entries in the array.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry The unsigned integer to be found.

Leave condition: KErrNotFound, if no matching entry can be found.

(generated from Symbian Developer Library)

◆ GranularCompress()

void RArray< TUint >::GranularCompress ( )

inline

Compresses the array down to a granular boundary.

After a call to this function, the memory allocated to the array is sufficient for its contained entries. Adding new unsigned integers to the array does not result in a re-allocation of memory until the total number of entries reaches a multiple of the granularity.

(generated from Symbian Developer Library)

◆ Insert()

TInt RArray< TUint >::Insert	(	TUint	anEntry,
		TInt	aPos
	)

inline

Inserts an unsigned integer into the array at the specified position.

Parameters

anEntry	The unsigned integer to be inserted.
aPos	The position within the array where the unsigned integer is to be inserted. The position is relative to zero, i.e. zero implies that an entry is inserted at the beginning of the array.

Panic condition: USER 131, if aPos is negative, or is greater than the number of entries currently in the array.

(generated from Symbian Developer Library)

◆ InsertInOrder()

TInt RArray< TUint >::InsertInOrder ( TUint anEntry )

inline

Inserts an unsigned integer into the array in unsigned integer order.

No duplicate entries are permitted. The array remains unchanged following an attempt to insert a duplicate entry.

The function assumes that existing entries within the array are in unsigned integer order.

Parameters

anEntry The unsigned integer to be inserted.

(generated from Symbian Developer Library)

◆ InsertInOrderAllowRepeats()

TInt RArray< TUint >::InsertInOrderAllowRepeats ( TUint anEntry )

inline

Inserts an unsigned integer into the array in unsigned integer order, allowing duplicates.

If the new integer is a duplicate of an existing entry in the array, then the new unsigned integer is inserted after the existing one. If more than one duplicate entry already exists in the array, then any new duplicate unsigned integer is inserted after the last one.

The function assumes that existing entries within the array are in unsigned integer order.

Parameters

anEntry The unsigned integer to be inserted.

(generated from Symbian Developer Library)

◆ InsertInOrderAllowRepeatsL()

void RArray< TUint >::InsertInOrderAllowRepeatsL ( TUint anEntry )

inline

Inserts an unsigned integer into the array in unsigned integer order, allowing duplicates.

If the new integer is a duplicate of an existing entry in the array, then the new unsigned integer is inserted after the existing one. If more than one duplicate entry already exists in the array, then any new duplicate unsigned integer is inserted after the last one.

The function assumes that existing entries within the array are in unsigned integer order.

The function leaves with one of the system wide error codes, if the operation fails.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry The unsigned integer to be inserted.

(generated from Symbian Developer Library)

◆ InsertInOrderL()

void RArray< TUint >::InsertInOrderL ( TUint anEntry )

inline

Inserts an unsigned integer into the array in unsigned integer order.

No duplicate entries are permitted.

The function assumes that existing entries within the array are in unsigned integer order.

The function leaves with one of the system wide error codes, if the operation fails.

Note that the array remains unchanged following an attempt to insert a duplicate entry.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry The unsigned integer to be inserted.

(generated from Symbian Developer Library)

◆ InsertL()

void RArray< TUint >::InsertL	(	TUint	anEntry,
		TInt	aPos
	)

inline

Inserts an unsigned integer into the array at the specified position.

The function leaves with one of the system wide error codes, if the operation fails.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry	The unsigned integer to be inserted.
aPos	The position within the array where the unsigned integer is to be inserted. The position is relative to zero, i.e. zero implies that an entry is inserted at the beginning of the array.

Panic condition: USER 131, if aPos is negative, or is greater than the number of entries currently in the array.

(generated from Symbian Developer Library)

◆ operator[]() [1/2]

TUint & RArray< TUint >::operator[] ( TInt anIndex )

inline

Gets a reference to the unsigned integer located at the specified position within the array.

The compiler uses this variant if the returned reference is used in an expression where the reference can be modified.

Parameters

anIndex The position of the unsigned integer within the array, relative to zero, i.e. zero implies the entry at the beginning of the array.

Panic condition: USER 130, if anIndex is negative, or is greater than the number of entries currently in the array.

(generated from Symbian Developer Library)

◆ operator[]() [2/2]

const TUint & RArray< TUint >::operator[] ( TInt anIndex ) const

inline

Gets a reference to the unsigned integer located at the specified position within the array.

The compiler uses this variant if the returned reference is used in an expression where the reference cannot be modified.

Parameters

anIndex The position of the unsigned integer within the array, relative to zero, i.e. zero implies the entry at the beginning of the array.

Panic condition: USER 130, if anIndex is negative, or is greater than the number of entries currently in the array.

(generated from Symbian Developer Library)

◆ Remove()

void RArray< TUint >::Remove ( TInt anIndex )

inline

Removes the unsigned integer at the specified position from the array.

Parameters

anIndex The position within the array from where the unsigned integer is to be removed. The position is relative to zero, i.e. zero implies that an entry at the beginning of the array is to be removed.

Panic condition: USER 130, if anIndex is negative, or is greater than the number of entries currently in the array.

(generated from Symbian Developer Library)

◆ Reserve()

TInt RArray< TUint >::Reserve ( TInt aCount )

inline

Reserves space for the specified number of elements.

After a call to this function, the memory allocated to the array is sufficient to hold the number of integers specified. Adding new integers to the array does not result in a re-allocation of memory until the the total number of integers exceeds the specified count.

Parameters

aCount The number of integers for which space should be reserved

(generated from Symbian Developer Library)

◆ ReserveL()

void RArray< TUint >::ReserveL ( TInt aCount )

inline

Reserves space for the specified number of elements.

After a call to this function, the memory allocated to the array is sufficient to hold the number of integers specified. Adding new integers to the array does not result in a re-allocation of memory until the the total number of integers exceeds the specified count.

Parameters

aCount The number of integers for which space should be reserved

Leave condition: KErrNoMemory If the requested amount of memory could not be allocated

(generated from Symbian Developer Library)

◆ Reset()

void RArray< TUint >::Reset ( )

inline

Empties the array.

It frees all memory allocated to the array and resets the internal state so that it is ready to be reused.

This array object can be allowed to go out of scope after a call to this function.

(generated from Symbian Developer Library)

◆ Sort()

void RArray< TUint >::Sort ( )

inline

Sorts the array entries into unsigned integer order.

(generated from Symbian Developer Library)

◆ SpecificFindInOrder() [1/2]

TInt RArray< TUint >::SpecificFindInOrder	(	TUint	anEntry,
		TInt &	anIndex,
		TInt	aMode
	)		const

inline

Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

In the case that there is more than one matching element, finds the first, last or any match as specified.

The function assumes that the array is in unsigned integer order.

TArrayFindMode

Parameters

anEntry	The unsigned integer to be found.
anIndex	A TInt type supplied by the caller. On return, it contains an index value depending on whether a match is found and on the value of aMode. If there is no matching element in the array, then this is the index of the first element in the array that is bigger than the element being searched for - if no elements in the array are bigger, then the index value is the same as the total number of elements in the array. If there is a matching element, then what the index refers to depends on the value of aMode: if this is EArrayFindMode_First, then the index refers to the first matching element; if this is EArrayFindMode_Any, then the index can refer to any of the matching elements; if this is EArrayFindMode_Last, then the index refers to first element that follows the last matching element - if the last matching element is also the last element of the array, then the index value is the same as the total number of elements in the array.
aMode	Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values.

(generated from Symbian Developer Library)

◆ SpecificFindInOrder() [2/2]

TInt RArray< TUint >::SpecificFindInOrder	(	TUint	anEntry,
		TInt	aMode
	)		const

inline

Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

In the case that there is more than one matching element, finds the first, last or any match as specified by the value of aMode.

The function assumes that the array is in unsigned integer order.

TArrayFindMode

Parameters

anEntry	The unsigned integer to be found..
aMode	Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values.

(generated from Symbian Developer Library)

◆ SpecificFindInOrderL() [1/2]

void RArray< TUint >::SpecificFindInOrderL	(	TUint	anEntry,
		TInt &	anIndex,
		TInt	aMode
	)		const

inline

Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

Where there is more than one matching element, it finds the first, last or any matching element as specified by the value of aMode.

The function assumes that the array is in unsigned integer order.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry	The unsigned integer to be found.
anIndex	A TInt type supplied by the caller. On return, it contains an index value depending on whether a match is found and on the value of aMode. If there is no matching element in the array, then this is the index of the first element in the array that is bigger than the element being searched for - if no elements in the array are bigger, then the index value is the same as the total number of elements in the array. If there is a matching element, then what the index refers to depends on the value of aMode: if this is EArrayFindMode_First, then the index refers to the first matching element; if this is EArrayFindMode_Any, then the index can refer to any of the matching elements; if this is EArrayFindMode_Last, then the index refers to first element that follows the last matching element - if the last matching element is also the last element of the array, then the index value is the same as the total number of elements in the array.
aMode	Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values.

Leave condition: KErrNotFound if no matching entry exists.

(generated from Symbian Developer Library)

◆ SpecificFindInOrderL() [2/2]

TInt RArray< TUint >::SpecificFindInOrderL	(	TUint	anEntry,
		TInt	aMode
	)		const

inline

Finds the unsigned integer in the array that matches the specified unsigned integer using a binary search technique.

In the case that there is more than one matching element, finds the first, last or any match as specified.

The function assumes that the array is in unsigned integer order.

NOTE: This function is NOT AVAILABLE to code running on the kernel side.

Parameters

anEntry	The unsigned integer to be found.
aMode	Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values.

Leave condition: KErrNotFound if no matching entry exists.

(generated from Symbian Developer Library)

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

Public Member Functions

Detailed Description

Constructor & Destructor Documentation

◆ RArray() [1/4]

◆ RArray() [2/4]

◆ RArray() [3/4]

◆ RArray() [4/4]

Member Function Documentation

◆ Append()

◆ AppendL()

◆ Array()

◆ Close()

◆ Compress()

◆ Count()

◆ Find()

◆ FindInOrder() [1/2]

◆ FindInOrder() [2/2]

◆ FindInOrderL() [1/2]

◆ FindInOrderL() [2/2]

◆ FindL()

◆ FindReverse()

◆ FindReverseL()

◆ GranularCompress()

◆ Insert()

◆ InsertInOrder()

◆ InsertInOrderAllowRepeats()

◆ InsertInOrderAllowRepeatsL()

◆ InsertInOrderL()

◆ InsertL()

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ Remove()

◆ Reserve()

◆ ReserveL()

◆ Reset()

◆ Sort()

◆ SpecificFindInOrder() [1/2]

◆ SpecificFindInOrder() [2/2]

◆ SpecificFindInOrderL() [1/2]

◆ SpecificFindInOrderL() [2/2]