| 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
| ///////////////////////////////////////////////////////////////////////////
// //
// Copyright (c) 2015 by Charta Software B.V. //
// All rights reserved //
// //
// Version: 1.7.0.83525 //
// Web site: https://pascal.chartasoftware.com/ //
// //
// This code and information are provided "as is" without warranty of //
// any kind. Dissemination of this information or reproduction of //
// this material is strictly forbidden unless prior written permission //
// is obtained from Charta Software B.V.. //
// //
///////////////////////////////////////////////////////////////////////////
unit Collection.Stack.List;
interface
uses
Boolean,
Collection.List,
Collection.Stack,
Comparator,
Integer._32,
Iterator;
type
TListStack<TElement> = class(TStack<TElement>)
private
FElements: TList<TElement>;
protected
function GetComparator(): TComparator<TElement>; override;
procedure SetComparator(const Value: TComparator<TElement>); override;
function GetCount(): TInteger32; override;
function GetTop(): TElement; override;
function GetElements(Index: TInteger32): TElement; virtual;
public
constructor Create(); override;
destructor Destroy(); override;
procedure Push(Element: TElement); override;
function ExtractTop(): TElement; override;
function Contains(Element: TElement): TBoolean; override;
procedure Clear(); override;
function CreateIterator(): TIterator<TElement>; override;
property Elements[Index: TInteger32]: TElement read GetElements; default;
end;
implementation
uses
Collection.List.Array_;
{ TListStack<TElement> }
procedure TListStack<TElement>.Clear();
begin
ReleaseElements();
FElements.Clear();
end;
function TListStack<TElement>.Contains(Element: TElement): TBoolean;
begin
Result := FElements.Contains(Element);
end;
constructor TListStack<TElement>.Create();
begin
inherited Create();
FElements := TArrayList<TElement>.Create();
end;
function TListStack<TElement>.CreateIterator(): TIterator<TElement>;
begin
Result := FElements.CreateReverseIterator();
end;
destructor TListStack<TElement>.Destroy();
begin
FElements.Free();
inherited Destroy();
end;
function TListStack<TElement>.ExtractTop(): TElement;
begin
Result := FElements.ExtractLast();
end;
function TListStack<TElement>.GetComparator(): TComparator<TElement>;
begin
Result := FElements.Comparator;
end;
function TListStack<TElement>.GetCount(): TInteger32;
begin
Result := FElements.Count;
end;
function TListStack<TElement>.GetElements(Index: TInteger32): TElement;
begin
Result := FElements[FElements.Count - 1 - Index];
end;
function TListStack<TElement>.GetTop(): TElement;
begin
Result := FElements.Last;
end;
procedure TListStack<TElement>.Push(Element: TElement);
begin
AcquireElement(Element);
FElements.Add(Element);
end;
procedure TListStack<TElement>.SetComparator(const Value: TComparator<TElement>);
begin
FElements.Comparator := Value;
end;
end.
|