equal
deleted
inserted
replaced
25 is always extended by the process of reallocation. A flat array buffer is |
25 is always extended by the process of reallocation. A flat array buffer is |
26 implemented using a <codeph>CBufFlat</codeph> object.</p> |
26 implemented using a <codeph>CBufFlat</codeph> object.</p> |
27 <p>The following diagram illustrates how elements are organised within the |
27 <p>The following diagram illustrates how elements are organised within the |
28 array buffer:</p> |
28 array buffer:</p> |
29 <fig id="GUID-2A857FBF-943D-5665-9999-BC27EA321F73"> |
29 <fig id="GUID-2A857FBF-943D-5665-9999-BC27EA321F73"> |
30 <image href="GUID-924E26D6-8B9D-5C76-AF61-7C5514BB3D78_d0e219442_href.png" placement="inline"/> |
30 <image href="GUID-924E26D6-8B9D-5C76-AF61-7C5514BB3D78_d0e215705_href.png" placement="inline"/> |
31 </fig> |
31 </fig> |
32 <p>This kind of array is suitable for a small number of elements or for a |
32 <p>This kind of array is suitable for a small number of elements or for a |
33 moderately large but fixed maximum number of elements. It is not suitable |
33 moderately large but fixed maximum number of elements. It is not suitable |
34 for large arrays with a high turnover of elements. </p> |
34 for large arrays with a high turnover of elements. </p> |
35 <p>This class is immediately derived from the abstract templated base class <codeph>CArrayVar<class T></codeph> which |
35 <p>This class is immediately derived from the abstract templated base class <codeph>CArrayVar<class T></codeph> which |