diff -r 51a74ef9ed63 -r ae94777fff8f Symbian3/SDK/Source/GUID-63C60154-2A50-5A39-A188-515A607F498B.dita --- a/Symbian3/SDK/Source/GUID-63C60154-2A50-5A39-A188-515A607F498B.dita Wed Mar 31 11:11:55 2010 +0100 +++ b/Symbian3/SDK/Source/GUID-63C60154-2A50-5A39-A188-515A607F498B.dita Fri Jun 11 12:39:03 2010 +0100 @@ -1,42 +1,42 @@ - - - - - -Array -of same length elements, flat bufferDescribes how elements are organised within the array buffer. -

This can be either an RArray<class T> or a CArrayFixFlat<class T> object.

-

In both arrays, all elements:

- -

A flat buffer always occupies a single cell allocated from the heap and -is always extended by the process of reallocation.

-

The following diagram illustrates how elements are organised within the -array buffer:

- - - -

This kind of array is suitable for a small number of elements or for a -moderately large but fixed maximum number of elements. It is not suitable -for large arrays with a high turnover of elements.

-

The RArray<class T> array has the simpler and -more efficient implementation but the length of an element is limited to 640 -bytes. This array can also be constructed on te program stack.

-

The CArrayFixFlat<class T> array is more general -and is allocated on the heap. This class is immediately derived from the abstract -templated base class CArrayFix<class T> which is -itself derived from the abstract non-template base class CArrayFixBase. -Its array buffer is implemented using a CBufFlat object.

-
See also

Using -Dynamic Buffers .

+ + + + + +Array +of same length elements, flat bufferDescribes how elements are organised within the array buffer. +

This can be either an RArray<class T> or a CArrayFixFlat<class T> object.

+

In both arrays, all elements:

+
    +
  • have the same length.

  • +
  • are physically contiguous +within a flat array buffer. The length of an element is the size of the template +class.

  • +
+

A flat buffer always occupies a single cell allocated from the heap and +is always extended by the process of reallocation.

+

The following diagram illustrates how elements are organised within the +array buffer:

+ + + +

This kind of array is suitable for a small number of elements or for a +moderately large but fixed maximum number of elements. It is not suitable +for large arrays with a high turnover of elements.

+

The RArray<class T> array has the simpler and +more efficient implementation but the length of an element is limited to 640 +bytes. This array can also be constructed on te program stack.

+

The CArrayFixFlat<class T> array is more general +and is allocated on the heap. This class is immediately derived from the abstract +templated base class CArrayFix<class T> which is +itself derived from the abstract non-template base class CArrayFixBase. +Its array buffer is implemented using a CBufFlat object.

+
See also

Using +Dynamic Buffers .

\ No newline at end of file