| template <> |
| class RArray< TInt > : private RPointerArrayBase |
A simple and efficient specialized array of signed integers offering standard array behaviour.
Note that derivation from RPointerArrayBase is private.
| Public Member Functions | |
|---|---|
| RArray() | |
| RArray(TInt) | |
| RArray(TInt, TInt) | |
| RArray(TInt *, TInt) | |
| TInt | Append(TInt) |
| void | AppendL(TInt) |
| TArray< TInt > | Array() |
| void | Close() |
| void | Compress() |
| TInt | Count() |
| TInt | Find(TInt) |
| TInt | FindInOrder(TInt) |
| TInt | FindInOrder(TInt, TInt &) |
| TInt | FindInOrderL(TInt) |
| void | FindInOrderL(TInt, TInt &) |
| TInt | FindL(TInt) |
| TInt | FindReverse(TInt) |
| TInt | FindReverseL(TInt) |
| void | GranularCompress() |
| TInt | Insert(TInt, TInt) |
| TInt | InsertInOrder(TInt) |
| TInt | InsertInOrderAllowRepeats(TInt) |
| void | InsertInOrderAllowRepeatsL(TInt) |
| void | InsertInOrderL(TInt) |
| void | InsertL(TInt, TInt) |
| void | Remove(TInt) |
| TInt | Reserve(TInt) |
| void | ReserveL(TInt) |
| void | Reset() |
| void | Sort() |
| TInt | SpecificFindInOrder(TInt, TInt) |
| TInt | SpecificFindInOrder(TInt, TInt &, TInt) |
| TInt | SpecificFindInOrderL(TInt, TInt) |
| void | SpecificFindInOrderL(TInt, TInt &, TInt) |
| const TInt & | operator[](TInt) |
| TInt & | operator[](TInt) |
| RArray | ( | ) | [inline] |
Constructs an array object for an array of signed integers with default granularity.
The default granularity is 8.
| RArray | ( | TInt | aGranularity | ) | [inline, explicit] |
Constructs an array object for an array of signed integers with the specified granularity.
| TInt aGranularity | The granularity of the array. |
| 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 signed integers with the specified minimum growth step and exponential growth factor.
| RArray | ( | TInt * | 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 TInt 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.
| TInt | Append | ( | TInt | anEntry | ) | [inline] |
Appends a signed integer onto the array.
| TInt anEntry | The signed integer to be appended. |
| void | AppendL | ( | TInt | anEntry | ) | [inline] |
Appends a signed 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.
| TInt anEntry | The signed integer to be appended. |
| void | 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.
| void | 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 signed integer to the array always results in a re-allocation of memory.
| TInt | Find | ( | TInt | anEntry | ) | const [inline] |
Finds the first signed integer in the array which matches the specified signed integer 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.
| TInt anEntry | The signed integer to be found. |
| TInt | FindInOrder | ( | TInt | anEntry | ) | const [inline] |
Finds the signed integer in the array that matches the specified signed integer using a binary search technique.
The function assumes that the array is in signed integer order.
| TInt anEntry | The signed integer to find. |
| TInt | FindInOrder | ( | TInt | anEntry, |
| TInt & | anIndex | |||
| ) | const [inline] | |||
Finds the signed integer in the array that matches the specified signed integer using a binary search technique.
The function assumes that the array is in signed integer order.
| TInt anEntry | The signed integer to find. |
| TInt & anIndex | A TInt suplied by the caller. On return contains an index value. If the function returns KErrNone, this is the index of the matching signed integer within the array. If the function returns KErrNotFound, this is the index of the first signed integer within the array that is bigger than the signed integer being searched for - if no signed integers within the array are bigger, then the index value is the same as the total number of signed integers within the array. |
| TInt | FindInOrderL | ( | TInt | anEntry | ) | const [inline] |
Finds the signed integer in the array that matches the specified signed integer using a binary search technique.
The function assumes that the array is in signed integer order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| TInt anEntry | The signed integer to be found. |
| void | FindInOrderL | ( | TInt | anEntry, |
| TInt & | anIndex | |||
| ) | const [inline] | |||
Finds the signed integer in the array that matches the specified signed integer using a binary search technique.
The function assumes that the array is in signed integer order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| TInt anEntry | The signed integer to be found. |
| TInt & anIndex | A reference to a signed integer into which the function puts an index value: If the function returns , this is the index of the matching signed integer within the array. If the function leaves with KErrNotFound, this is the index of the first signed integer within the array that is bigger than the signed integer being searched for - if no signed integers within the array are bigger, then the index value is the same as the total number of signed integers within the array. |
| TInt | FindL | ( | TInt | anEntry | ) | const [inline] |
Finds the first signed integer in the array which matches the specified signed integer 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.
| TInt anEntry | The signed integer to be found. |
| TInt | FindReverse | ( | TInt | anEntry | ) | const [inline] |
Finds the last signed integer in the array which matches the specified signed integer 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.
| TInt anEntry | The signed integer to be found. |
| TInt | FindReverseL | ( | TInt | anEntry | ) | const [inline] |
Finds the last signed integer in the array which matches the specified signed integer 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.
| TInt anEntry | The signed integer to be found. |
| void | 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 signed 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.
| TInt | Insert | ( | TInt | anEntry, |
| TInt | aPos | |||
| ) | [inline] | |||
Inserts a signed integer into the array at the specified position.
| TInt | InsertInOrder | ( | TInt | anEntry | ) | [inline] |
Inserts a signed integer into the array in signed 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 signed integer order.
| TInt anEntry | The signed integer to be inserted |
| TInt | InsertInOrderAllowRepeats | ( | TInt | anEntry | ) | [inline] |
Inserts a signed integer into the array in signed integer order, allowing duplicates.
If anEntry is a duplicate of an existing entry in the array, then the new signed integer is inserted after the existing one. If more than one duplicate entry already exists in the array, then any new duplicate signed integer is inserted after the last one.
The function assumes that existing entries within the array are in signed integer order.
| TInt anEntry | The signed integer to be inserted. |
| void | InsertInOrderAllowRepeatsL | ( | TInt | anEntry | ) | [inline] |
Inserts a signed integer into the array in signed integer order, allowing duplicates.
If anEntry is a duplicate of an existing entry in the array, then the new signed integer is inserted after the existing one. If more than one duplicate entry already exists in the array, then any new duplicate signed integer is inserted after the last one.
The function assumes that existing entries within the array are in signed 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.
| TInt anEntry | The signed integer to be inserted. |
| void | InsertInOrderL | ( | TInt | anEntry | ) | [inline] |
Inserts a signed integer into the array in signed integer order.
No duplicate entries are permitted.
The function assumes that existing entries within the array are in signed 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.
| TInt anEntry | The signed integer to be inserted. |
| void | InsertL | ( | TInt | anEntry, |
| TInt | aPos | |||
| ) | [inline] | |||
Inserts a signed 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.
| void | Remove | ( | TInt | anIndex | ) | [inline] |
Removes the signed integer at the specified position from the array.
| TInt anIndex | The position within the array from where the signed 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. |
| TInt | 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.
| TInt aCount | The number of integers for which space should be reserved |
| void | 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.
| TInt aCount | The number of integers for which space should be reserved |
| void | Reset | ( | ) | [inline] |
Empties the array.
The function 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.
| TInt | SpecificFindInOrder | ( | TInt | anEntry, |
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the signed integer in the array that matches the specified signed 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 signed integer order.
| TInt | SpecificFindInOrder | ( | TInt | anEntry, |
| TInt & | anIndex, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the signed integer in the array that matches the specified signed 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 signed integer order.
| TInt anEntry | The signed integer to be found. |
| TInt & 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. |
| TInt aMode | Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values. |
| TInt | SpecificFindInOrderL | ( | TInt | anEntry, |
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the signed integer in the array that matches the specified signed 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 signed integer order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| void | SpecificFindInOrderL | ( | TInt | anEntry, |
| TInt & | anIndex, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the signed integer in the array that matches the specified signed 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 signed integer order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| TInt anEntry | The signed integer to be found. |
| TInt & 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. |
| TInt aMode | Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values. |
| const TInt & | operator[] | ( | TInt | anIndex | ) | const [inline] |
Gets a reference to the signed integer located at a specified position within the array.
The compiler chooses this function if the returned reference is used in an expression where the reference cannot be modified.
| TInt anIndex | The position of the signed integer within the array. The position is relative to zero, i.e. zero implies the entry at the beginning of the array. |
| TInt & | operator[] | ( | TInt | anIndex | ) | [inline] |
Gets a reference to the signed integer located at a specified position within the array.
The compiler chooses this function if the returned reference is used in an expression where the reference can be modified.
| TInt anIndex | The position of the signed integer within the array. The position is relative to zero, i.e. zero implies the entry at the beginning of the array. |
Copyright ©2010 Nokia Corporation and/or its subsidiary(-ies).
All rights
reserved. Unless otherwise stated, these materials are provided under the terms of the Eclipse Public License
v1.0.