![[Index]](../../../../a_stock/images/btn_index.gif)
![[Previous]](../../../../a_stock/images/btn_prev_top.gif)
![[Next]](../../../../a_stock/images/btn_next_top.gif)
|
|
|
|
|
|
||
class RArray< TUint > : private RPointerArrayBase;
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.
RPointerArrayBase - No description.
RArray< TUint > -
Array of unsigned integers.
Defined in RArray< TUint >:
Append(TUint)Appends an unsigned integer onto the array.AppendL(TUint)Appends an unsigned integer onto the array.Array()constConstructs and returns a generic array.Close()Closes the array and frees all memory allocated to the array.Compress()Compresses the array down to a minimum.Count()constGets the number of unsigned integers in the array.Find(TUint)constFinds the first unsigned integer in the array which matches the specified value,...FindInOrder(TUint)constFinds the unsigned integer in the array which matches the specified value, using...FindInOrder(TUint,TInt &)constFinds the unsigned integer in the array which matches the specified value, using...FindInOrderL(TUint)constFinds the unsigned integer in the array which matches the specified value, using...FindInOrderL(TUint,TInt &)constFinds the unsigned integer in the array which matches the specified value, using...FindL(TUint)constFinds the first unsigned integer in the array which matches the specified value,...FindReverse(TUint)constFinds the last unsigned integer in the array which matches the specified value, ...FindReverseL(TUint)constFinds the last unsigned integer in the array which matches the specified value, ...GranularCompress()Compresses the array down to a granular boundary.Insert(TUint,TInt)Inserts an unsigned integer into the array at the specified position.InsertInOrder(TUint)Inserts an unsigned integer into the array in unsigned integer order.InsertInOrderAllowRepeats(TUint)Inserts an unsigned integer into the array in unsigned integer order, allowing d...InsertInOrderAllowRepeatsL(TUint)Inserts an unsigned integer into the array in unsigned integer order, allowing d...InsertInOrderL(TUint)Inserts an unsigned integer into the array in unsigned integer order.InsertL(TUint,TInt)Inserts an unsigned integer into the array at the specified position.RArray()Default C++ constructor.RArray(TInt)Constructs an array object for an array of unsigned integers with the specified ...RArray(TInt,TInt)C++ constructor with minimum growth step and exponential growth factor.RArray(TUint *,TInt)C++ constructor with a pointer to the first array entry in a pre-existing array,...Remove(TInt)Removes the unsigned integer at the specified position from the array.Reserve(TInt)Reserves space for the specified number of elements.ReserveL(TInt)Reserves space for the specified number of elements.Reset()Empties the array.Sort()Sorts the array entries into unsigned integer order. SpecificFindInOrder(TUint,TInt &,TInt)constFinds the unsigned integer in the array that matches the specified unsigned inte...SpecificFindInOrder(TUint,TInt)constFinds the unsigned integer in the array that matches the specified unsigned inte...SpecificFindInOrderL(TUint,TInt &,TInt)constFinds the unsigned integer in the array that matches the specified unsigned inte...SpecificFindInOrderL(TUint,TInt)constFinds the unsigned integer in the array that matches the specified unsigned inte...operator[](TInt)Gets a reference to the unsigned integer located at the specified position withi...operator[](TInt)constGets a reference to the unsigned integer located at the specified position withi...inline RArray();
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.
|
inline RArray(TInt aGranularity);
Constructs an array object for an array of unsigned integers with the specified granularity.
|
|
|
inline RArray(TInt aMinGrowBy, TInt aFactor);
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.
|
|
|
inline void Close();
Closes the array and frees all memory allocated to the array.
The function must be called before this array object goes out of scope.
inline TInt Count() const;
Gets the number of unsigned integers in the array.
|
inline const TUint& operator[](TInt anIndex) const;
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.
|
|
|
inline TUint& operator[](TInt anIndex);
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.
|
|
|
inline TInt Append(TUint anEntry);
Appends an unsigned integer onto the array.
|
|
inline TInt Insert(TUint anEntry, TInt aPos);
Inserts an unsigned integer into the array at the specified position.
|
|
|
inline void Remove(TInt anIndex);
Removes the unsigned integer at the specified position from the array.
|
|
inline void Compress();
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.
inline void Reset();
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.
inline TInt Find(TUint anEntry) const;
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.
|
|
inline TInt FindReverse(TUint anEntry) const;
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.
|
|
inline TInt FindInOrder(TUint anEntry) const;
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.
|
|
inline TInt FindInOrder(TUint anEntry, TInt &anIndex) const;
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.
|
|
inline 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.
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.
|
|
inline 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.
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.
|
|
inline TInt InsertInOrder(TUint anEntry);
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.
|
|
inline TInt InsertInOrderAllowRepeats(TUint anEntry);
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.
|
|
inline void AppendL(TUint anEntry);
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.
|
inline void InsertL(TUint anEntry, TInt aPos);
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.
|
|
inline TInt FindL(TUint anEntry) const;
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.
|
|
|
inline TInt FindReverseL(TUint anEntry) const;
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.
|
|
|
inline TInt FindInOrderL(TUint anEntry) const;
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.
|
|
|
inline void FindInOrderL(TUint anEntry, TInt &anIndex) const;
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.
|
|
inline 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.
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.
|
|
|
inline 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.
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.
|
|
inline void InsertInOrderL(TUint anEntry);
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.
|
inline void InsertInOrderAllowRepeatsL(TUint anEntry);
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.
|
inline 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.
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.
|
|
inline void GranularCompress();
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.
inline TInt Reserve(TInt aCount);
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.
|
|
inline void ReserveL(TInt aCount);
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.
|
|
|
Copyright © 2005-2008 Symbian Software Ltd. |
|
![[Previous]](../../../../a_stock/images/btn_prev.gif)
![[Top]](../../../../a_stock/images/btn_top.gif)
![[Next]](../../../../a_stock/images/btn_next.gif)