Class TDList (unit EZDSLDbl)

Inherits from

TAbstractContainer

---Place any compiler options you require here----------------------} {--------------------------------------------------------------------} {$I EZDSLOPT.INC

Constructors


constructor Clone(Source : TAbstractContainer; DataOwner : boolean; NewCompare : TCompareFunc);

--------

constructor Create(DataOwner : boolean);

===TDList===========================================================


Functions

function Delete(Cursor : TListCursor) : TListCursor;

--------

procedure Empty;

--------

function Erase(Cursor : TListCursor) : TListCursor;

--------

function Examine(Cursor : TListCursor) : pointer;

--------

procedure InsertAfter(Cursor : TListCursor; aData : pointer);

--------

procedure InsertBefore(Cursor : TListCursor; aData : pointer);

--------

procedure InsertSorted(aData : pointer);

--------

function IsAfterLast(Cursor : TListCursor) : boolean;

--------

function IsBeforeFirst(Cursor : TListCursor) : boolean;

--------

function Iterate(Action : TIterator; Backwards : boolean; ExtraData : pointer) : pointer;

--------

procedure Join(Cursor : TListCursor; List : TDList);

--------

function Next(Cursor : TListCursor) : TListCursor;

--------

function Prev(Cursor : TListCursor) : TListCursor;

--------

function Replace(Cursor : TListCursor; aData : pointer) : pointer;

--------

function Search(var Cursor : TListCursor; aData : pointer) : boolean;

--------

function SetAfterLast : TListCursor;

--------

function SetBeforeFirst : TListCursor;

--------

function Split(Cursor : TListCursor) : TDList;

--------

procedure acSort;

--------

procedure dlInsertBeforePrim(Cursor : TListCursor; aData : pointer);

--------

function dlMergeLists(aBeforeNode1 : PNode; aCount1 : longint; aBeforeNode2 : PNode; aCount2 : longint) : PNode;

--------

function dlMergeSort(aBeforeNode : PNode; aCount : longint) : PNode;

--------

Properties

Events

Variables

dlAL : PNode;


dlBF : PNode;



Constructors


constructor Clone(Source : TAbstractContainer; DataOwner : boolean; NewCompare : TCompareFunc);

--------


constructor Create(DataOwner : boolean);

===TDList===========================================================


Functions


function Delete(Cursor : TListCursor) : TListCursor;

--------


procedure Empty;

--------


function Erase(Cursor : TListCursor) : TListCursor;

--------


function Examine(Cursor : TListCursor) : pointer;

--------


procedure InsertAfter(Cursor : TListCursor; aData : pointer);

--------


procedure InsertBefore(Cursor : TListCursor; aData : pointer);

--------


procedure InsertSorted(aData : pointer);

--------


function IsAfterLast(Cursor : TListCursor) : boolean;

--------


function IsBeforeFirst(Cursor : TListCursor) : boolean;

--------


function Iterate(Action : TIterator; Backwards : boolean; ExtraData : pointer) : pointer;

--------


procedure Join(Cursor : TListCursor; List : TDList);

--------


function Next(Cursor : TListCursor) : TListCursor;

--------


function Prev(Cursor : TListCursor) : TListCursor;

--------


function Replace(Cursor : TListCursor; aData : pointer) : pointer;

--------


function Search(var Cursor : TListCursor; aData : pointer) : boolean;

--------


function SetAfterLast : TListCursor;

--------


function SetBeforeFirst : TListCursor;

--------


function Split(Cursor : TListCursor) : TDList;

--------


procedure acSort;

--------


procedure dlInsertBeforePrim(Cursor : TListCursor; aData : pointer);

--------


function dlMergeLists(aBeforeNode1 : PNode; aCount1 : longint; aBeforeNode2 : PNode; aCount2 : longint) : PNode;

--------


function dlMergeSort(aBeforeNode : PNode; aCount : longint) : PNode;

--------


Properties


Events


Variables


dlAL : PNode;


dlBF : PNode;