Of course, if its an array of TBitmap, you're not shuffling large lumps of
data - you're shuffling pointers to bitmaps.
I'd go for a TList myself. If I was really keen I'd override the Items[]
property to get & set TBitmaps instead of pointers so I didn't have to
typecast in calling code.
> -----Original Message-----
> From: Paul Lowman [SMTP:[EMAIL PROTECTED]]
> Sent: Friday, July 16, 1999 8:58 AM
> To: Multiple recipients of list delphi
> Subject: Re: [DUG]: The trick question - bitmap array
>
> Al
>
> What I would do in this case is to fall back on the trusty double linked
> list or some suitable container class (like the old TCollection from BP7)
> and then allocate space on the heap for each bitmap as it is loaded. When
> you wish to delete one simply remove its pointer from the linked list and
> fix up the pointer linkages and free up the allocated heap space. The big
> advantage of linked lists is that you are able to manipulate the list very
> simply and -quickly- without having to shuffle huge lumps of data around
> the
> place -
>
> Paul
>
> --------------------------------------------------------------------------
> -
> New Zealand Delphi Users group - Delphi List - [EMAIL PROTECTED]
> Website: http://www.delphi.org.nz
---------------------------------------------------------------------------
New Zealand Delphi Users group - Delphi List - [EMAIL PROTECTED]
Website: http://www.delphi.org.nz
