-
Notifications
You must be signed in to change notification settings - Fork 5
/
Memory.pas
207 lines (160 loc) · 4.96 KB
/
Memory.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
unit Memory;
(*
Game memory tools and enhancements.
*)
(***) interface (***)
uses
SysUtils, Math, Windows,
Utils, Crypto, AssocArrays, StrLib, DataLib;
type
(* Import *)
TDict = DataLib.TDict;
PUniqueStringsItemValue = ^TUniqueStringsItemValue;
TUniqueStringsItemValue = record
{O} Str: pchar;
Hash: integer;
end;
TUniqueStringsValueChain = array of TUniqueStringsItemValue;
PUniqueStringsItem = ^TUniqueStringsItem;
TUniqueStringsItem = record
Value: TUniqueStringsItemValue;
ValueChain: TUniqueStringsValueChain;
end;
TUniqueStringsItems = array of TUniqueStringsItem;
TUniqueStrings = class
const
MIN_CAPACITY = 100;
CRITICAL_SIZE_CAPACITY_RATIO = 0.75;
GROWTH_FACTOR = 2;
MIN_CAPACITY_GROWTH = 16;
protected
fItems: TUniqueStringsItems;
fSize: integer;
fCapacity: integer;
function Find ({n} Str: pchar; out StrLen: integer; out KeyHash: integer; out ItemInd: integer): {n} pchar;
function GetItem ({n} Str: pchar): {n} pchar;
procedure AddValue (var Value: TUniqueStringsItemValue);
procedure Grow;
public
constructor Create;
destructor Destroy; override;
property Items[Str: pchar]: pchar read GetItem; default;
end; // .class TUniqueStrings
var
UniqueStrings: TUniqueStrings;
(***) implementation (***)
constructor TUniqueStrings.Create;
begin
SetLength(Self.fItems, MIN_CAPACITY);
Self.fSize := 0;
Self.fCapacity := MIN_CAPACITY;
end;
destructor TUniqueStrings.Destroy;
var
Item: PUniqueStringsItem;
i, j: integer;
begin
for i := 0 to Self.fSize - 1 do begin
Item := @fItems[i];
FreeMem(Item.Value.Str);
for j := 0 to Length(Item.ValueChain) - 1 do begin
FreeMem(Item.ValueChain[j].Str);
end;
end;
end; // .destructor TUniqueStrings.Destroy
function TUniqueStrings.Find ({n} Str: pchar; out StrLen: integer; out KeyHash: integer; out ItemInd: integer): {n} pchar;
var
Item: PUniqueStringsItem;
i: integer;
begin
result := nil;
if Str <> nil then begin
{!} Assert(integer(Str) > 100);
StrLen := SysUtils.StrLen(Str);
KeyHash := Crypto.FastHash(Str, StrLen);
ItemInd := integer(cardinal(KeyHash) mod cardinal(Self.fCapacity));
Item := @Self.fItems[ItemInd];
if Item.Value.Str <> nil then begin
if (KeyHash = Item.Value.Hash) and (StrLib.ComparePchars(Str, Item.Value.Str) = 0) then begin
result := Item.Value.Str;
exit;
end;
for i := 0 to Length(Item.ValueChain) - 1 do begin
if (KeyHash = Item.ValueChain[i].Hash) and (StrLib.ComparePchars(Str, Item.ValueChain[i].Str) = 0) then begin
result := Item.ValueChain[i].Str;
exit;
end;
end;
end; // .if
end; // .if
end; // .function TUniqueStrings.Find
function TUniqueStrings.GetItem ({n} Str: pchar): {n} pchar;
var
StrLen: integer;
KeyHash: integer;
ItemInd: integer;
Item: PUniqueStringsItem;
NumValues: integer;
begin
result := nil;
if Str <> nil then begin
result := Self.Find(Str, StrLen, KeyHash, ItemInd);
if result = nil then begin
GetMem(result, StrLen + 1);
Utils.CopyMem(StrLen + 1, Str, result);
Item := @Self.fItems[ItemInd];
if Item.Value.Str = nil then begin
Item.Value.Str := result;
Item.Value.Hash := KeyHash;
end else begin
NumValues := Length(Item.ValueChain);
SetLength(Item.ValueChain, NumValues + 1);
Item.ValueChain[NumValues].Str := result;
Item.ValueChain[NumValues].Hash := KeyHash;
end; // .else
Inc(Self.fSize);
if (Self.fSize / Self.fCapacity >= CRITICAL_SIZE_CAPACITY_RATIO) then begin
Self.Grow;
end;
end; // .if
end; // .if
end; // .function TUniqueStrings.GetItem
procedure TUniqueStrings.AddValue (var Value: TUniqueStringsItemValue);
var
Item: PUniqueStringsItem;
NumValues: integer;
begin
Item := @Self.fItems[integer(cardinal(Value.Hash) mod cardinal(Self.fCapacity))];
if Item.Value.Str = nil then begin
Item.Value := Value;
end else begin
NumValues := Length(Item.ValueChain);
SetLength(Item.ValueChain, NumValues + 1);
Item.ValueChain[NumValues] := Value;
end;
end;
procedure TUniqueStrings.Grow;
var
OldCapacity: integer;
OldItems: TUniqueStringsItems;
Item: PUniqueStringsItem;
i, j: integer;
begin
OldItems := Self.fItems;
Self.fItems := nil;
OldCapacity := Self.fCapacity;
Self.fCapacity := Max(Self.fCapacity + MIN_CAPACITY_GROWTH, trunc(Self.fCapacity * GROWTH_FACTOR));
SetLength(Self.fItems, Self.fCapacity);
for i := 0 to OldCapacity - 1 do begin
Item := @OldItems[i];
if Item.Value.Str <> nil then begin
Self.AddValue(Item.Value);
for j := 0 to Length(Item.ValueChain) - 1 do begin
Self.AddValue(Item.ValueChain[j]);
end;
end;
end;
end; // .procedure TUniqueStrings.Grow
begin
UniqueStrings := TUniqueStrings.Create;
end.