equal
deleted
inserted
replaced
22 <p>A flat buffer always occupies a single cell allocated from the heap and |
22 <p>A flat buffer always occupies a single cell allocated from the heap and |
23 is always extended by the process of reallocation.</p> |
23 is always extended by the process of reallocation.</p> |
24 <p>The following diagram illustrates how elements are organised within the |
24 <p>The following diagram illustrates how elements are organised within the |
25 array buffer:</p> |
25 array buffer:</p> |
26 <fig id="GUID-7E9AF455-9CC4-5814-A746-36A94585488F"> |
26 <fig id="GUID-7E9AF455-9CC4-5814-A746-36A94585488F"> |
27 <image href="GUID-516D2E22-F5C0-56FE-ABDA-948F01CD50DB_d0e219305_href.png" placement="inline"/> |
27 <image href="GUID-516D2E22-F5C0-56FE-ABDA-948F01CD50DB_d0e215568_href.png" placement="inline"/> |
28 </fig> |
28 </fig> |
29 <p>This kind of array is suitable for a small number of elements or for a |
29 <p>This kind of array is suitable for a small number of elements or for a |
30 moderately large but fixed maximum number of elements. It is not suitable |
30 moderately large but fixed maximum number of elements. It is not suitable |
31 for large arrays with a high turnover of elements.</p> |
31 for large arrays with a high turnover of elements.</p> |
32 <p>The <codeph>RArray<class T></codeph> array has the simpler and |
32 <p>The <codeph>RArray<class T></codeph> array has the simpler and |