Navigation:  Classes > bItemList >

bItemList:BlockSize

Print this Topic    Previous pageReturn to chapter overviewNext page

Purpose

The block size of the list.

Class

bItemList

Type

Access / Assign

Data Type

Integer

Description

The items in the list are internally stored in an array. If a new item is added to the list, then this item is added to the internal array with the function AAdd(). This process requires a bit of time. If many items are added to the list, then this can negatively impact on the run-time. In this case it is better to expanded the internal array to a certain number of free items when the first item is added. Next the item and all further items are put in the free items of the internal array. Only if all free items are filled then the array is expanded again.

 

The number of free items is defined with this access. After creating the object the access contains the value 1.

See Also

bItemList:Add()

 


Page url: http://www.YOURSERVER.com/index.html?bitemlist_blocksize.htm