forked from malcolmgroves/FluentQuery
-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathFluentQuery.Core.EnumerationStrategies.pas
executable file
·226 lines (191 loc) · 6.46 KB
/
FluentQuery.Core.EnumerationStrategies.pas
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
{****************************************************}
{ }
{ FluentQuery }
{ }
{ Copyright (C) 2013 Malcolm Groves }
{ }
{ http://www.malcolmgroves.com }
{ }
{****************************************************}
{ }
{ This Source Code Form is subject to the terms of }
{ the Mozilla Public License, v. 2.0. If a copy of }
{ the MPL was not distributed with this file, You }
{ can obtain one at }
{ }
{ http://mozilla.org/MPL/2.0/ }
{ }
{****************************************************}
unit FluentQuery.Core.EnumerationStrategies;
interface
uses
System.SysUtils,
FluentQuery.Core.Types;
type
TEnumerationStrategy<T> = class
public
function MoveNext(Enumerator : IMinimalEnumerator<T>) : Boolean; virtual;
function GetCurrent(Enumerator : IMinimalEnumerator<T>): T; virtual;
end;
TSkipWhileEnumerationStrategy<T> = class(TEnumerationStrategy<T>)
private
FSkipWhilePredicate : TPredicate<T>;
FSkippingComplete : Boolean;
protected
function ShouldSkipItem(Enumerator : IMinimalEnumerator<T>) : Boolean;
public
function MoveNext(Enumerator : IMinimalEnumerator<T>): Boolean; override;
constructor Create(Predicate : TPredicate<T>); virtual;
end;
TTakeWhileEnumerationStrategy<T> = class(TEnumerationStrategy<T>)
private
FTakeWhilePredicate : TPredicate<T>;
protected
function ShouldTakeItem(Enumerator : IMinimalEnumerator<T>) : Boolean;
public
function MoveNext(Enumerator : IMinimalEnumerator<T>): Boolean; override;
constructor Create(Predicate : TPredicate<T>); virtual;
end;
TWhereEnumerationStrategy<T> = class(TEnumerationStrategy<T>)
protected
FWherePredicate : TPredicate<T>;
function ShouldIncludeItem(Enumerator : IMinimalEnumerator<T>) : Boolean; virtual;
public
function MoveNext(Enumerator : IMinimalEnumerator<T>): Boolean; override;
constructor Create(Predicate : TPredicate<T>); virtual;
end;
TIsomorphicTransformEnumerationStrategy<T> = class(TEnumerationStrategy<T>)
protected
FTransformFunc : TFunc<T, T>;
public
function GetCurrent(Enumerator : IMinimalEnumerator<T>): T; override;
constructor Create(TransformFunc : TFunc<T, T>); virtual;
end;
implementation
uses
FluentQuery.Core.Enumerators;
{ TEnumerationStrategy<T> }
function TEnumerationStrategy<T>.GetCurrent(Enumerator : IMinimalEnumerator<T>): T;
begin
if not Assigned(Enumerator) then
raise ENilEnumeratorException.Create('Enumerator is nil. Are you attempting to enumerate an Unbound Query?');
Result := Enumerator.Current;
end;
function TEnumerationStrategy<T>.MoveNext(Enumerator : IMinimalEnumerator<T>): Boolean;
begin
if not Assigned(Enumerator) then
raise ENilEnumeratorException.Create('Enumerator is nil. Are you attempting to enumerate an Unbound Query?');
Result := Enumerator.MoveNext;
end;
{ TSkipWhileEnumerationStrategy<T> }
constructor TSkipWhileEnumerationStrategy<T>.Create(Predicate: TPredicate<T>);
begin
FSkipWhilePredicate := Predicate;
FSkippingComplete := False;
end;
function TSkipWhileEnumerationStrategy<T>.MoveNext(Enumerator : IMinimalEnumerator<T>): Boolean;
var
LAtEnd : Boolean;
begin
if FSkippingComplete then
Result := inherited MoveNext(Enumerator)
else
begin
repeat
LAtEnd := not Enumerator.MoveNext;
if LAtEnd then
exit(False);
until not ShouldSkipItem(Enumerator);
FSkippingComplete := True;
Result := FSKippingComplete;
end;
end;
function TSkipWhileEnumerationStrategy<T>.ShouldSkipItem(Enumerator : IMinimalEnumerator<T>): Boolean;
begin
try
if Assigned(FSkipWhilePredicate) then
Result := FSkipWhilePredicate(Enumerator.Current)
else
Result := False;
except
on E : EArgumentOutOfRangeException do
Result := False;
end;
end;
{ TTakeWhileEnumerationStrategy<T> }
constructor TTakeWhileEnumerationStrategy<T>.Create(Predicate: TPredicate<T>);
begin
FTakeWhilePredicate := Predicate;
end;
function TTakeWhileEnumerationStrategy<T>.MoveNext(Enumerator : IMinimalEnumerator<T>): Boolean;
var
LAtEnd : Boolean;
begin
LAtEnd := not Enumerator.MoveNext;
if LAtEnd then
Exit(False);
if ShouldTakeItem(Enumerator) then
Result := True
else
begin
repeat
LAtEnd := not Enumerator.MoveNext;
until LAtEnd;
Result := False
end;
end;
function TTakeWhileEnumerationStrategy<T>.ShouldTakeItem(Enumerator : IMinimalEnumerator<T>): Boolean;
begin
try
if Assigned(FTakeWhilePredicate) then
Result := FTakeWhilePredicate(Enumerator.Current)
else
Result := False;
except
on E : EArgumentOutOfRangeException do
Result := False;
end;
end;
{ TWhereEnumerationStrategy<T> }
constructor TWhereEnumerationStrategy<T>.Create(Predicate: TPredicate<T>);
begin
FWherePredicate := Predicate;
end;
function TWhereEnumerationStrategy<T>.MoveNext(Enumerator : IMinimalEnumerator<T>): Boolean;
var
IncludeItem, IsDone : Boolean;
begin
repeat
IsDone := not Enumerator.MoveNext;
if not IsDone then
IncludeItem := ShouldIncludeItem(Enumerator);
until IsDone or IncludeItem;
Result := not IsDone;
end;
function TWhereEnumerationStrategy<T>.ShouldIncludeItem(Enumerator : IMinimalEnumerator<T>): Boolean;
begin
try
if Assigned(FWherePredicate) then
Result := FWherePredicate(Enumerator.Current)
else
Result := False;
except
on E : EArgumentOutOfRangeException do
Result := False;
end;
end;
{ TTransformEnumerationStrategy<T> }
constructor TIsomorphicTransformEnumerationStrategy<T>.Create(
TransformFunc: TFunc<T, T>);
begin
FTransformFunc := TransformFunc;
end;
function TIsomorphicTransformEnumerationStrategy<T>.GetCurrent(
Enumerator: IMinimalEnumerator<T>): T;
begin
if Assigned(FTransformFunc) then
Result := FTransformFunc(Enumerator.Current)
else
Result := Enumerator.Current;
end;
end.