| class RArray : private RArrayBase |
A simple and efficient array of fixed length objects.
The elements of the array are instances of a class; this class is specified as the template parameter T.
The array offers standard array behaviour which includes insertion, appending and sorting of elements.
Note:
1. where possible, this class should be used in preference to CArrayFixFlat<classT>.
2. the derivation from RArrayBase is private.
3. for performance reasons, RArray stores objects in the array as word (4 byte) aligned quantities. This means that some member functions do not work when RArray is instantiated for classes of less than 4 bytes in size, or when the class's alignment requirement is not 4. Be aware that it is possible to get an unhandled exception on hardware that enforces strict alignment.
The affected functions are:
3.1 the constructor: RArray(TInt, T*, TInt)
3.2 Append(const T&)
3.4 the [] operator, and then using the pointer to iterate through the array as you would with a C array.
| RArray | ( | ) | [inline] |
Default C++ constructor.
This constructs an array object for an array of type class T objects with default granularity and key offset value. The default granularity is 8 and the defaul key offset value is zero.
| RArray | ( | TInt | aGranularity | ) | [inline, explicit] |
C++ constructor with granularity.
This constructs an array object for an array of type class T objects with a specified granularity and default key offset value. The default key offset value is zero.
| TInt aGranularity | The granularity of the array. |
| RArray | ( | TInt | aGranularity, |
| TInt | aKeyOffset | ||
| ) | [inline] | ||
C++ constructor with granularity and key offset.
This constructs an array object for an array of type class T objects with a specified granularity and a specified key offset value.
| RArray | ( | TInt | aMinGrowBy, |
| TInt | aKeyOffset, | ||
| TInt | aFactor | ||
| ) | [inline] | ||
C++ constructor with minimum growth step and exponential growth factor.
This constructs an array object for an array of class T objects with the specified minimum growth step and exponential growth factor.
| RArray | ( | TInt | aEntrySize, |
| T * | aEntries, | ||
| TInt | aCount | ||
| ) | [inline] | ||
C++ constructor with size of entry, 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 class T objects owned by another RArray object. Ownership of the set of entries still resides with the original RArray object.
This array is assigned a default granularity and key offset value. The default granularity is 8 and the default key offset value is zero.
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 | ( | const T & | anEntry | ) | [inline] |
Apends an object onto the array.
| const T & anEntry | A reference to the object of type class T to be appended. |
| void | AppendL | ( | const T & | anEntry | ) | [inline] |
Apends an object 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.
| const T & anEntry | A reference to the object of type class T 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 is destroyed.
| 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 contained objects. Subsequently adding a new object to the array always results in a re-allocation of memory.
| TInt | Find | ( | const T & | anEntry | ) | const [inline] |
Finds the first object in the array which matches the specified object using a sequential search.
Matching is based on the comparison of a TInt value at the key offset position within the objects.
For classes which define their own equality operator (==), the alternative method Find(const T& anEntry, TIdentityRelation<T> anIdentity) is recommended.
The find operation always starts at the low index end of the array. There is no assumption about the order of objects in the array.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt | Find | ( | const T & | anEntry, |
| TIdentityRelation < T > | anIdentity | |||
| ) | const [inline] | |||
Finds the first object in the array which matches the specified object using a sequential search and a matching algorithm.
The algorithm for determining whether two class T type objects match is provided by a function supplied by the caller.
Such a function need not be supplied if an equality operator (==) is defined for class T. In this case, default construction of anIdentity provides matching, as in the example below:
//Construct a TPoint and append to an RArray<TPoint>
TPoint p1(0,0);
RArray<TPoint> points;
points.AppendL(p1);
//Find position of p1 in points using TIdentityRelation<TPoint> default construction
TInt r = points.Find(p1, TIdentityRelation<TPoint>());
The find operation always starts at the low index end of the array. There is no assumption about the order of objects in the array.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TIdentityRelation < T > anIdentity | A package encapsulating the function which determines whether two class T type objects match. |
| TInt | Find | ( | const K & | aKey, |
| TBool (*)(const K *k, const T &t) | apfnCompare | |||
| ) | const [inline] | |||
Finds the first object in the array which matches aKey using the comparison algorithm provided by apfnCompare.
The find operation always starts at the low index end of the array. There is no assumption about the order of objects in the array.
| const K & aKey | The key of type K to be compared with the elements of the array using apfnCompare. |
| TBool (*)(const K *k, const T &t) apfnCompare | A function defining the identity relation between the object in the array, and their keys of type K. The function returns true if k and t match based on this relationship. |
| TInt | FindInOrder | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and an ordering algorithm.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T>.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| TInt | FindInOrder | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TLinearOrder < T > | anOrder | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and an ordering algorithm.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T>.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt & anIndex | On return contains an index value. If the function returns KErrNone, this is the index of the matching object within the array. If the function returns KErrNotFound, 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. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| TInt | FindInOrder | ( | const K & | aKey, |
| TInt (*)(const K *k, const T &t) | apfnCompare | |||
| ) | const [inline] | |||
Finds the object in the array whose object matches the specified key, (Using the relationship defined within apfnCompare) using a binary search technique and an ordering algorithm.
The function assumes that existing objects in the array are ordered so that the objects themselves are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T>.
| const K & aKey | The key of type K to be compared with the elements of the array using apfnCompare. |
| TInt (*)(const K *k, const T &t) apfnCompare | A function which defines the order that the array was sorted, where in it aKey (via the defined relationship) should fit, and if the key is present. |
| TInt | FindInOrderL | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and an ordering algorithm.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T>.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| void | FindInOrderL | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TLinearOrder < T > | anOrder | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and an ordering algorithm.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T>.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt & anIndex | On return contains the index value of the matching object within the array If the function leaves with KErrNotFound, 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. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| TInt | FindInSignedKeyOrder | ( | const T & | anEntry | ) | const [inline] |
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in signed key order.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt | FindInSignedKeyOrder | ( | const T & | anEntry, |
| TInt & | anIndex | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in signed key order.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt & anIndex | On return contains an index value. If the function returns KErrNone, this is the index of the matching object within the array. If the function returns KErrNotFound, this is the index of the first element in the array whose key is bigger than the key of the element being sought. If there are no elements in the array with a bigger key, then the index value is the same as the total number of elements in the array. |
| TInt | FindInSignedKeyOrderL | ( | const T & | anEntry | ) | const [inline] |
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in signed key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| void | FindInSignedKeyOrderL | ( | const T & | anEntry, |
| TInt & | anIndex | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in signed key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt & anIndex | On return contains an index value of the matching object within the array. If the function leaves with KErrNotFound,this is the index of the first element in the array whose key is bigger than the key of the element being sought. If there are no elements in the array with a bigger key, then the index value is the same as the total number of elements in the array. |
| TInt | FindInUnsignedKeyOrder | ( | const T & | anEntry | ) | const [inline] |
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in unsigned key order.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt | FindInUnsignedKeyOrder | ( | const T & | anEntry, |
| TInt & | anIndex | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in unsigned key order.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt & anIndex | On return contains an index value. If the function returns KErrNone, this is the index of the matching object within the array. If the function returns KErrNotFound, this is the index of the first element in the array whose key is bigger than the key of the element being sought. If there are no elements in the array with a bigger key, then the index value is the same as the total number of elements in the array. |
| TInt | FindInUnsignedKeyOrderL | ( | const T & | anEntry | ) | const [inline] |
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in unsigned key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| void | FindInUnsignedKeyOrderL | ( | const T & | anEntry, |
| TInt & | anIndex | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The function assumes that existing objects within the array are in unsigned key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt & anIndex | On return contains an index value of the matching object within the array. If the function leaves with KErrNotFound, this is the index of the first element in the array whose key is bigger than the key of the element being sought. If there are no elements in the array with a bigger key, then the index value is the same as the total number of elements in the array. |
| TInt | FindL | ( | const T & | anEntry | ) | const [inline] |
Finds the first object in the array which matches the specified object using a sequential search.
Matching is based on the comparison of a TInt value at the key offset position within the objects.
For classes which define their own equality operator (==), the alternative method FindL(const T& anEntry, TIdentityRelation<T> anIdentity) is recommended.
The find operation always starts at the low index end of the array. There is no assumption about the order of objects in the array.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt | FindL | ( | const T & | anEntry, |
| TIdentityRelation < T > | anIdentity | |||
| ) | const [inline] | |||
Finds the first object in the array which matches the specified object using a sequential search and a matching algorithm.
The algorithm for determining whether two class T type objects match is provided by a function supplied by the caller.
Such a function need not be supplied if an equality operator (==) is defined for class T. In this case, default construction of anIdentity provides matching.
See Find(const T& anEntry, TIdentityRelation<T> anIdentity) for more details.
The find operation always starts at the low index end of the array. There is no assumption about the order of objects in the array.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TIdentityRelation < T > anIdentity | A package encapsulating the function which determines whether two class T type objects match. |
| TInt | FindReverse | ( | const T & | anEntry | ) | const [inline] |
Finds the last object in the array which matches the specified object using a sequential search.
Matching is based on the comparison of a TInt value at the key offset position within the objects.
For classes which define their own equality operator (==), the alternative method FindReverse(const T& anEntry, TIdentityRelation<T> anIdentity) is recommended.
The find operation always starts at the high index end of the array. There is no assumption about the order of objects in the array.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt | FindReverse | ( | const T & | anEntry, |
| TIdentityRelation < T > | anIdentity | |||
| ) | const [inline] | |||
Finds the last object in the array which matches the specified object using a sequential search and a matching algorithm.
The algorithm for determining whether two class T type objects match is provided by a function supplied by the caller.
Such a function need not be supplied if an equality operator (==) is defined for class T. In this case, default construction of anIdentity provides matching.
See Find(const T& anEntry, TIdentityRelation<T> anIdentity) for more details.
The find operation always starts at the high index end of the array. There is no assumption about the order of objects in the array.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TIdentityRelation < T > anIdentity | A package encapsulating the function which determines whether two class T type objects match. |
| TInt | FindReverse | ( | const K & | aKey, |
| TInt (*)(const K *k, const T &t) | apfnMatch | |||
| ) | const [inline] | |||
Finds the first object in the array which matches aKey using the comparison algorithm provided by apfnCompare.
The find operation always starts at the high index end of the array. There is no assumption about the order of objects in the array.
| const K & aKey | The key of type K to be compared with the elements of the array using apfnMatch. |
| TInt (*)(const K *k, const T &t) apfnMatch | A function defining the identity relation between the object in the array, and their keys of type K. The function returns true if k and t match based on this relationship. |
| TInt | FindReverseL | ( | const T & | anEntry | ) | const [inline] |
Finds the last object in the array which matches the specified object using a sequential search.
Matching is based on the comparison of a TInt value at the key offset position within the objects.
For classes which define their own equality operator (==), the alternative method FindReverseL(const T& anEntry, TIdentityRelation<T> anIdentity) is recommended.
The find operation always starts at the high index end of the array. There is no assumption about the order of objects in the array.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt | FindReverseL | ( | const T & | anEntry, |
| TIdentityRelation < T > | anIdentity | |||
| ) | const [inline] | |||
Finds the last object in the array which matches the specified object using a sequential search and a matching algorithm.
The algorithm for determining whether two class T type objects match is provided by a function supplied by the caller.
Such a function need not be supplied if an equality operator (==) is defined for class T. In this case, default construction of anIdentity provides matching.
See Find(const T& anEntry, TIdentityRelation<T> anIdentity) for more details.
The find operation always starts at the high index end of the array. There is no assumption about the order of objects in the array.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TIdentityRelation < T > anIdentity | A package encapsulating the function which determines whether two class T type objects match. |
| 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 objects. Adding new objects to the array does not result in a re-allocation of memory until the the total number of objects reaches a multiple of the granularity.
| TInt | Insert | ( | const T & | anEntry, |
| TInt | aPos | |||
| ) | [inline] | |||
Inserts an object into the array at a specified position.
| const T & anEntry | The class T object to be inserted. |
| TInt aPos | The position within the array where the object is to be inserted. The position is relative to zero, i.e. zero implies that an object is inserted at the beginning of the array. |
| TInt | InsertInOrder | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder | |||
| ) | [inline] | |||
Inserts an object of into the array in object order.
The algorithm for determining the order of two class T type objects is provided by a function supplied by the caller.
No duplicate entries are permitted. The array remains unchanged following an attempt to insert a duplicate entry.
The function assumes that existing objects within the array are in object order.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| TInt | InsertInOrderAllowRepeats | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder | |||
| ) | [inline] | |||
Inserts an object into the array in object order, allowing duplicates.
The algorithm for determining the order of two class T type objects is provided by a function supplied by the caller.
If anEntry is a duplicate of an existing object in the array, then the new object is inserted after the existing object. If more than one duplicate object already exists in the array, then anEntry is inserted after the last one.
The function assumes that existing objects within the array are in object order.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| void | InsertInOrderAllowRepeatsL | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder | |||
| ) | [inline] | |||
Inserts an object into the array in object order, allowing duplicates.
The algorithm for determining the order of two class T type objects is provided by a function supplied by the caller.
If anEntry is a duplicate of an existing object in the array, then the new object is inserted after the existing object. If more than one duplicate object already exists in the array, then anEntry is inserted after the last one.
The function assumes that existing objects within the array are in object 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.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| void | InsertInOrderL | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder | |||
| ) | [inline] | |||
Inserts an object of into the array in object order.
The algorithm for determining the order of two class T type objects is provided by a function supplied by the caller.
No duplicate entries are permitted.
The function assumes that existing objects within the array are in object 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.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| TInt | InsertInSignedKeyOrder | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending signed key order.
The order of two class T type objects is based on comparing a TInt value located at the key offset position within the class T object.
No duplicate entries are permitted. The array remains unchanged following an attempt to insert a duplicate entry.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| TInt | InsertInSignedKeyOrderAllowRepeats | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending signed key order, allowing duplicates.
The order of two class T type objects is based on comparing a TInt value located at the key offset position within the class T object.
If anEntry is a duplicate of an existing object in the array, then the new object is inserted after the existing object. If more than one duplicate object already exists in the array, then any new duplicate object is inserted after the last one.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| void | InsertInSignedKeyOrderAllowRepeatsL | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending signed key order, allowing duplicates.
The order of two class T type objects is based on comparing a TInt value located at the key offset position within the class T object.
If anEntry is a duplicate of an existing object in the array, then the new object is inserted after the existing object. If more than one duplicate object already exists in the array, then any new duplicate object is inserted after the last one.
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.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| void | InsertInSignedKeyOrderL | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending signed key order.
The order of two class T type objects is based on comparing a TInt value located at the key offset position within the class T object.
No duplicate entries are permitted.
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.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| TInt | InsertInUnsignedKeyOrder | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending unsigned key order.
The order of two class T type objects is based on comparing a TUint value located at the key offset position within the class T object.
No duplicate entries are permitted. The array remains unchanged following an attempt to insert a duplicate entry.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| TInt | InsertInUnsignedKeyOrderAllowRepeats | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending unsigned key order, allowing duplicates.
The order of two class T type objects is based on comparing a TUint value located at the key offset position within the class T object.
If anEntry is a duplicate of an existing object in the array, then the new object is inserted after the existing object. If more than one duplicate object already exists in the array, then any new duplicate object is inserted after the last one.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| void | InsertInUnsignedKeyOrderAllowRepeatsL | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending unsigned key order, allowing duplicates.
The order of two class T type objects is based on comparing a TUint value located at the key offset position within the class T object.
If anEntry is a duplicate of an existing object in the array, then the new object is inserted after the existing object. If more than one duplicate object already exists in the array, then any new duplicate object is inserted after the last one.
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.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| void | InsertInUnsignedKeyOrderL | ( | const T & | anEntry | ) | [inline] |
Inserts an object into the array in ascending unsigned key order, not allowing duplicate entries.
The order of two class T type objects is based on comparing a TUint value located at the key offset position within the class T object.
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.
| const T & anEntry | A reference to the object of type class T to be inserted. |
| void | InsertL | ( | const T & | anEntry, |
| TInt | aPos | |||
| ) | [inline] | |||
Inserts an object into the array at a 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.
| const T & anEntry | The class T object to be inserted. |
| TInt aPos | The position within the array where the object is to be inserted. The position is relative to zero, i.e. zero implies that an object is inserted at the beginning of the array. |
| void | Remove | ( | TInt | anIndex | ) | [inline] |
Removes the object at a specified position from the array.
| TInt anIndex | The position within the array from where the object is to be removed. The position is relative to zero, i.e. zero implies that an object 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 objects specified. Adding new objects to the array does not result in a re-allocation of memory until the the total number of objects exceeds the specified count.
| TInt aCount | The number of objects 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 objects specified. Adding new objects to the array does not result in a re-allocation of memory until the the total number of objects exceeds the specified count.
| TInt aCount | The number of objects for which space should be reserved |
| void | Reset | ( | ) | [inline] |
Empties the array, so that it is ready to be reused.
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.
| void | SetKeyOffset | ( | TInt | aKeyOffset | ) | [inline] |
Sets the offset of the ordering key within each array entry.
| TInt aKeyOffset | The key offset. |
| void | Sort | ( | TLinearOrder < T > | anOrder | ) | [inline] |
Sorts the objects within the array using the specified TLinearOrder .
The sort order is determined by an algorithm supplied by the caller and packaged as a TLinerOrder<T>.
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T type objects. |
| void | SortSigned | ( | ) | [inline] |
Sorts the objects within the array; the sort order is assumed to be in signed integer order.
| void | SortUnsigned | ( | ) | [inline] |
Sorts the objects within the array; the sort order is assumed to be in unsigned integer order.
| TInt | SpecificFindInOrder | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and an ordering algorithm.
Where there is more than one matching element, it finds the first, the last or any matching element as specified by the value of aMode.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T> type.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| 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 | SpecificFindInOrder | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TLinearOrder < T > | anOrder, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and a specified ordering algorithm.
Where there is more than one matching element, it finds the first, the last or any matching element as specified by the value of aMode.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T> type.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| 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 | ( | const T & | anEntry, |
| TLinearOrder < T > | anOrder, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and an ordering algorithm.
Where there is more than one matching element, it finds the first, the last or any matching element as specified by the value of aMode.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T> type.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| TInt aMode | Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values. |
| void | SpecificFindInOrderL | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TLinearOrder < T > | anOrder, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique and a specified ordering algorithm.
Where there is more than one matching element, it finds the first, the last or any matching element as specified by the value of aMode.
The function assumes that existing objects within the array are in object order as determined by an algorithm supplied by the caller and packaged as a TLinearOrder<T> type.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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. |
| TLinearOrder < T > anOrder | A package encapsulating the function which determines the order of two class T objects. |
| 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 | SpecificFindInSignedKeyOrder | ( | const T & | anEntry, |
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by a signed 32-bit word (the key) embedded in each array element. 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 existing objects within the array are in signed key order.
TArrayFindMode
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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 | SpecificFindInSignedKeyOrder | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by a signed 32-bit word (the key) embedded in each array element. Where there is more than one matching element, finds the first, last or any matching element as specified specified by the value of aMode.
The function assumes that existing objects within the array are in signed key order.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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 | SpecificFindInSignedKeyOrderL | ( | const T & | anEntry, |
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by a signed 32-bit word (the key) embedded in each array element. In the case that there is more than one matching element, finds the first, last or any match as specified.
The function assumes that existing objects within the array are in signed key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt aMode | Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values. |
| void | SpecificFindInSignedKeyOrderL | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by a signed 32-bit word (the key) embedded in each array element. In the case that there is more than one matching element, finds the first, last or any match as specified.
The function assumes that existing objects within the array are in signed key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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 | SpecificFindInUnsignedKeyOrder | ( | const T & | anEntry, |
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by an unsigned 32-bit word (the key) embedded in each array element. 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 existing objects within the array are in unsigned key order.
TArrayFindMode
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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 | SpecificFindInUnsignedKeyOrder | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by an unsigned 32-bit word (the key) embedded in each array element. 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 existing objects within the array are in unsigned key order.
TArrayFindMode
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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 | SpecificFindInUnsignedKeyOrderL | ( | const T & | anEntry, |
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by an unsigned 32-bit word (the key) embedded in each array element. In the case that there is more than one matching element, finds the first, last or any match as specified.
The function assumes that existing objects within the array are in unsigned key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| TInt aMode | Specifies whether to find the first match, the last match or any match, as defined by one of the TArrayFindMode enum values. |
| void | SpecificFindInUnsignedKeyOrderL | ( | const T & | anEntry, |
| TInt & | anIndex, | |||
| TInt | aMode | |||
| ) | const [inline] | |||
Finds the object in the array which matches the specified object using a binary search technique.
The element ordering is determined by an unsigned 32-bit word (the key) embedded in each array element. In the case that there is more than one matching element, finds the first, last or any match as specified.
The function assumes that existing objects within the array are in unsigned key order.
NOTE: This function is NOT AVAILABLE to code running on the kernel side.
| const T & anEntry | A reference to an object of type class T to be used for matching. |
| 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 T & | operator[] | ( | TInt | anIndex | ) | const [inline] |
Gets a reference to an object 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 object within the array. The position is relative to zero, i.e. zero implies the object at the beginning of the array. |
| T & | operator[] | ( | TInt | anIndex | ) | [inline] |
Gets a reference to an object 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 object within the array. The position is relative to zero, i.e. zero implies the object 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.