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
|
{(*}
(*------------------------------------------------------------------------------
Delphi Code formatter source code
The Original Code is IntList.pas, released April 2000.
The Initial Developer of the Original Code is Anthony Steele.
Portions created by Anthony Steele are Copyright (C) 1999-2008 Anthony Steele.
All Rights Reserved.
Contributor(s): Anthony Steele.
The contents of this file are subject to the Mozilla Public License Version 1.1
(the "License"). you may not use this file except in compliance with the License.
You may obtain a copy of the License at http://www.mozilla.org/NPL/
Software distributed under the License is distributed on an "AS IS" basis,
WITHOUT WARRANTY OF ANY KIND, either express or implied.
See the License for the specific language governing rights and limitations
under the License.
Alternatively, the contents of this file may be used under the terms of
the GNU General Public License Version 2 or later (the "GPL")
See http://www.gnu.org/licenses/gpl.html
------------------------------------------------------------------------------*)
{*)}
unit IntList;
{ AFS 2 April 2K
A old concept, and a generic class
implemented here because I needed it in the LineBreaker
The internals are a hack, but so what?
They are internal & could be replaced if need be by a more
readable & less space-efficient implementation without anyone knowing
and changing not much code in this unit either.
anyway it works because a pointer = 4 bytes, an int = 4 bytes
Thus a pointer in a TList can actually store an int
If these sizes change, this will break
This class could be extended in mnay ways (e.g. math ops on the list like sum, min, max, avg etc)
Fns to add without duplicates, Sort, add another int list (and intersection, difference) etc
But I don't need any of that right now.
}
{$I JcfGlobal.inc}
interface
uses Classes, SysUtils;
type
TIntList = class
private
fcList: TList;
function GetItem(const piIndex: integer): integer;
procedure SetItem(const piIndex, piValue: integer);
protected
public
constructor Create;
destructor Destroy; override;
function Count: integer;
function Add(const piValue: integer): integer;
procedure Clear;
procedure ChangeValue(const liIndex, liDelta: integer);
function IndexOfMax: integer;
{ to use it as a stack }
function Top: integer;
function Pop: integer;
property Items[const piIndex: integer]: integer Read GetItem Write SetItem;
end;
implementation
{$ifndef fpc}
// Delphi is a 32bit compiler only, thus pointer is always uses 4 bytes and can be
// converted to integer and back. FPC uses PtrInt as a signed integer type wich
// equal to pointer in length. For 32bit PtrInt = integer
type
PtrInt = Integer;
{$endif}
{ TIntList }
constructor TIntList.Create;
begin
inherited;
fcList := TList.Create;
end;
destructor TIntList.Destroy;
begin
FreeAndNil(fcList);
inherited;
end;
function TIntList.Add(const piValue: integer): integer;
begin
Result := fcList.Add(Pointer(PtrInt(piValue)));
end;
procedure TIntList.Clear;
begin
fcList.Clear;
end;
function TIntList.Count: integer;
begin
Result := fcList.Count;
end;
function TIntList.GetItem(const piIndex: integer): integer;
begin
Result := integer(PtrInt(fcList.Items[piIndex]));
end;
procedure TIntList.SetItem(const piIndex, piValue: integer);
begin
fcList.Items[piIndex] := Pointer(PtrInt(piValue));
end;
procedure TIntList.ChangeValue(const liIndex, liDelta: integer);
begin
{ can fall out of bounds, easiest to ignore it here }
if (liIndex < 0) or (liIndex >= Count) then
exit;
Items[liIndex] := Items[liIndex] + liDelta;
end;
function TIntList.IndexOfMax: integer;
var
liItem, liMax: integer;
liLoop: integer;
begin
Result := -1;
liMax := Low(integer);
for liLoop := 0 to Count - 1 do
begin
liItem := Items[liLoop];
{ the >= is a hack kinda but for the purposes of the linebreaker,
in case of a tie, take the last item }
if liItem >= liMax then
begin
liMax := liItem;
Result := liLoop;
end;
end;
end;
function TIntList.Pop: integer;
begin
if Count > 0 then
begin
Result := Items[Count - 1];
fcList.Delete(Count - 1);
end
else
Result := 0;
end;
function TIntList.Top: integer;
begin
if Count > 0 then
Result := Items[Count - 1]
else
Result := 0;
end;
end.
|
