Class TList

Unit

Generics.Collections

Declaration

type TList<T> = class(TCustomListWithPointers<T>)

Description

More info: http://stackoverflow.com/questions/5232198/about-vectors-growth TODO: custom memory managers (as constraints) ˜approximation to golden ratio: n = n * 1.5 } {$DEFINE CUSTOM_LIST_CAPACITY_INC := Result * 2} // standard inc

Hierarchy

• TObject
• TEnumerable
• TEnumerableWithPointers
• TCustomList
• TCustomListWithPointers
• TList

Overview

Internal Classes and Records

TEnumerator = class(TCustomListEnumerator<T>)

Fields

var FComparer: IComparer<T>;

Methods

	function DoGetEnumerator: TEnumerator<T>; override;
	function GetEnumerator: TEnumerator; reintroduce;
	procedure SetCapacity(AValue: SizeInt); override;
	procedure SetCount(AValue: SizeInt);
	procedure InitializeList; virtual;
	procedure InternalInsert(AIndex: SizeInt; constref AValue: T);
	function GetItem(AIndex: SizeInt): T;
	procedure SetItem(AIndex: SizeInt; const AValue: T);
	constructor Create; overload;
	constructor Create(const AComparer: IComparer<T>); overload;
	constructor Create(ACollection: TEnumerable<T>); overload;
	destructor Destroy; override;
	function Add(constref AValue: T): SizeInt; virtual;
	procedure AddRange(constref AValues: array of T); virtual; overload;
	procedure AddRange(const AEnumerable: IEnumerable<T>); overload;
	procedure AddRange(AEnumerable: TEnumerable<T>); overload;
	procedure Insert(AIndex: SizeInt; constref AValue: T); virtual;
	procedure InsertRange(AIndex: SizeInt; constref AValues: array of T); virtual; overload;
	procedure InsertRange(AIndex: SizeInt; const AEnumerable: IEnumerable<T>); overload;
	procedure InsertRange(AIndex: SizeInt; const AEnumerable: TEnumerable<T>); overload;
	function Remove(constref AValue: T): SizeInt;
	procedure Delete(AIndex: SizeInt); inline;
	procedure DeleteRange(AIndex, ACount: SizeInt);
	function ExtractIndex(const AIndex: SizeInt): T; overload;
	function Extract(constref AValue: T): T; overload;
	procedure Exchange(AIndex1, AIndex2: SizeInt); virtual;
	procedure Move(AIndex, ANewIndex: SizeInt); virtual;
	function First: T; inline;
	function Last: T; inline;
	procedure Clear;
	function Contains(constref AValue: T): Boolean; inline;
	function IndexOf(constref AValue: T): SizeInt; virtual;
	function LastIndexOf(constref AValue: T): SizeInt; virtual;
	procedure Reverse;
	procedure TrimExcess; override;
	procedure Sort; overload;
	procedure Sort(const AComparer: IComparer<T>); overload;
	function BinarySearch(constref AItem: T; out AIndex: SizeInt): Boolean; overload;
	function BinarySearch(constref AItem: T; out AIndex: SizeInt; const AComparer: IComparer<T>): Boolean; overload;

Properties

	property Count: SizeInt read FLength write SetCount;
	property Items[Index:SizeInt]: T read GetItem write SetItem;

Description

Fields

	var FComparer: IComparer<T>;

Methods

	function DoGetEnumerator: TEnumerator<T>; override;
bug #24287 - workaround for generics type name conflict (Identifier not found) next bug workaround - for another error related to previous workaround change order (method must be declared before TEnumerator declaration)

	function GetEnumerator: TEnumerator; reintroduce;

	procedure SetCapacity(AValue: SizeInt); override;

	procedure SetCount(AValue: SizeInt);

	procedure InitializeList; virtual;

	procedure InternalInsert(AIndex: SizeInt; constref AValue: T);

	function GetItem(AIndex: SizeInt): T;

	procedure SetItem(AIndex: SizeInt; const AValue: T);

	constructor Create; overload;

	constructor Create(const AComparer: IComparer<T>); overload;

	constructor Create(ACollection: TEnumerable<T>); overload;

	destructor Destroy; override;

	function Add(constref AValue: T): SizeInt; virtual;

	procedure AddRange(constref AValues: array of T); virtual; overload;

	procedure AddRange(const AEnumerable: IEnumerable<T>); overload;

	procedure AddRange(AEnumerable: TEnumerable<T>); overload;

	procedure Insert(AIndex: SizeInt; constref AValue: T); virtual;

	procedure InsertRange(AIndex: SizeInt; constref AValues: array of T); virtual; overload;

	procedure InsertRange(AIndex: SizeInt; const AEnumerable: IEnumerable<T>); overload;

	procedure InsertRange(AIndex: SizeInt; const AEnumerable: TEnumerable<T>); overload;

	function Remove(constref AValue: T): SizeInt;

	procedure Delete(AIndex: SizeInt); inline;

	procedure DeleteRange(AIndex, ACount: SizeInt);

	function ExtractIndex(const AIndex: SizeInt): T; overload;

	function Extract(constref AValue: T): T; overload;

	procedure Exchange(AIndex1, AIndex2: SizeInt); virtual;

	procedure Move(AIndex, ANewIndex: SizeInt); virtual;

	function First: T; inline;

	function Last: T; inline;

	procedure Clear;

	function Contains(constref AValue: T): Boolean; inline;

	function IndexOf(constref AValue: T): SizeInt; virtual;

	function LastIndexOf(constref AValue: T): SizeInt; virtual;

	procedure Reverse;

	procedure TrimExcess; override;

	procedure Sort; overload;

	procedure Sort(const AComparer: IComparer<T>); overload;

	function BinarySearch(constref AItem: T; out AIndex: SizeInt): Boolean; overload;

	function BinarySearch(constref AItem: T; out AIndex: SizeInt; const AComparer: IComparer<T>): Boolean; overload;

Properties

	property Count: SizeInt read FLength write SetCount;

	property Items[Index:SizeInt]: T read GetItem write SetItem;