| Description | Hierarchy | Fields | Methods | Properties |
type TObjectsList_1 = class(TObjectsList_Abstract)
![]() |
function High: Integer; |
![]() |
function IsFirst(Value: TObjectsListItem_1): boolean; |
![]() |
function IsLast(Value: TObjectsListItem_1): boolean; |
![]() |
procedure Sort(FirstIndex, LastIndex: Cardinal; IsSmallerFunction: TObjectsListIsSmallerFunction_1); overload; |
![]() |
procedure Sort(IsSmallerFunction: TObjectsListIsSmallerFunction_1); overload; |
![]() |
procedure Assign(Source: TObjectsList_1); |
![]() |
function Equals(SecondValue: TObjectsList_1): boolean; |
![]() |
procedure Insert(Index: integer; Item: TObjectsListItem_1); |
![]() |
procedure InsertArray(Index: integer; const A: array of TObjectsListItem_1); |
![]() |
procedure InsertList(Index: integer; List: TObjectsList_1); |
![]() |
procedure Add(Item: TObjectsListItem_1); |
![]() |
procedure AddArray(const A: array of TObjectsListItem_1); |
![]() |
procedure AddList(List: TObjectsList_1); |
![]() |
function IndexOf(Item: TObjectsListItem_1; StartIndex: integer): integer; overload; |
![]() |
function IndexOf(Item: TObjectsListItem_1): integer; overload; |
![]() |
procedure Delete(Index: integer); overload; |
![]() |
function Delete(Item: TObjectsListItem_1): boolean; overload; |
![]() |
function DeleteAll(Item: TObjectsListItem_1): integer; |
![]() |
procedure DeleteDuplicates; |
![]() |
procedure Clear; |
![]() |
procedure Exchange(index1, index2: integer); |
![]() |
procedure Move(oldIndex, newIndex: integer); |
![]() |
procedure ReplaceAll(OldItem, NewItem: TObjectsListItem_1); |
![]() |
procedure FreeAndNil(Index: integer); |
![]() |
procedure FreeContents; override; |
![]() |
constructor Create; |
![]() |
constructor CreateFromArray(const InitialItems: array of TObjectsListItem_1); |
![]() |
constructor CreateFromList(InitialItems: TObjectsList_1); |
![]() |
destructor Destroy; override; |
![]() |
property Items[i: integer]: TObjectsListItem_1
read GetItem write SetItem; |
![]() |
property Count: Integer read fCount write SetCount; |
![]() |
property Capacity: integer read fCapacity write SetCapacity; |
![]() |
property First: TObjectsListItem_1 read GetFirst write SetFirst; |
![]() |
property Last: TObjectsListItem_1 read GetLast write SetLast; |
![]() |
function High: Integer; |
![]() |
function IsFirst(Value: TObjectsListItem_1): boolean; |
![]() |
function IsLast(Value: TObjectsListItem_1): boolean; |
![]() |
procedure Sort(FirstIndex, LastIndex: Cardinal; IsSmallerFunction: TObjectsListIsSmallerFunction_1); overload; |
|
Sort Items between FirstIndex and LastIndex. FirstIndex and LastIndex must be valid indexes, i.e. between 0 and High and FirstIndex <= LastIndex. | |
![]() |
procedure Sort(IsSmallerFunction: TObjectsListIsSmallerFunction_1); overload; |
|
Sorts all items. | |
![]() |
procedure Assign(Source: TObjectsList_1); |
|
This assigns Source items references and count to our list. Note that Source.Capacity is not copied (Capacity is only a performance-tuning setting anyway). TODO: untested yet! | |
![]() |
function Equals(SecondValue: TObjectsList_1): boolean; |
|
TODO: untested yet! | |
![]() |
procedure Insert(Index: integer; Item: TObjectsListItem_1); |
![]() |
procedure InsertArray(Index: integer; const A: array of TObjectsListItem_1); |
![]() |
procedure InsertList(Index: integer; List: TObjectsList_1); |
![]() |
procedure Add(Item: TObjectsListItem_1); |
|
| |
![]() |
procedure AddArray(const A: array of TObjectsListItem_1); |
![]() |
procedure AddList(List: TObjectsList_1); |
![]() |
function IndexOf(Item: TObjectsListItem_1; StartIndex: integer): integer; overload; |
|
szuka zaczynajac od StartIndex obiektu Item , zwraca -1 jesli nie znalazl. Jesli nie podasz StartIndex to tak jakbys podal StartIndex = 0. | |
![]() |
function IndexOf(Item: TObjectsListItem_1): integer; overload; |
![]() |
procedure Delete(Index: integer); overload; |
![]() |
function Delete(Item: TObjectsListItem_1): boolean; overload; |
|
Robi IndexOf i | |
![]() |
function DeleteAll(Item: TObjectsListItem_1): integer; |
|
| |
![]() |
procedure DeleteDuplicates; |
|
dla kazdego obiektu na liscie kasuje wszystkie jego nastepujace duplikaty | |
![]() |
procedure Clear; |
|
Equivalent to doing Count := 0 | |
![]() |
procedure Exchange(index1, index2: integer); |
|
przesuwanie, zmienianie | |
![]() |
procedure Move(oldIndex, newIndex: integer); |
![]() |
procedure ReplaceAll(OldItem, NewItem: TObjectsListItem_1); |
|
zamieni wszystkie wystapienia OldItem na NewItem | |
![]() |
procedure FreeAndNil(Index: integer); |
![]() |
procedure FreeContents; override; |
|
robi jakby Clear tyle ze wszystkim wyrzucanym obiektom robi najpierw .Free. Jesli nie masz pewnosci - upewnij sie najpierw ze na liscie nie ma duplikatow przez DeleteDuplicates | |
![]() |
constructor Create; |
|
procedure FreeWithContents; in _Abstract | |
![]() |
constructor CreateFromArray(const InitialItems: array of TObjectsListItem_1); |
|
Inits list contents with InitialItems. This is just a shortcut for Create + AddArray(InitialItems). | |
![]() |
constructor CreateFromList(InitialItems: TObjectsList_1); |
|
Similiar to CreateFromArray: shortcut for Create + AddList(InitialItems) | |
![]() |
destructor Destroy; override; |
![]() |
property Items[i: integer]: TObjectsListItem_1
read GetItem write SetItem; |
![]() |
property Count: Integer read fCount write SetCount; |
|
ustawianie Counta : zmniejszanie oznacza kasowanie koncowych elementow, zwiekszanie - dodawanie nil'i | |
![]() |
property Capacity: integer read fCapacity write SetCapacity; |
![]() |
property First: TObjectsListItem_1 read GetFirst write SetFirst; |
|
Shortcut for Items[0]. | |
![]() |
property Last: TObjectsListItem_1 read GetLast write SetLast; |
|
Shortcut for Items[Count-1]. | |