Menu

[r3166]: / trunk / Src / UContainers.pas  Maximize  Restore  History

Download this file

1343 lines (1238 with data), 45.4 kB

   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
 227
 228
 229
 230
 231
 232
 233
 234
 235
 236
 237
 238
 239
 240
 241
 242
 243
 244
 245
 246
 247
 248
 249
 250
 251
 252
 253
 254
 255
 256
 257
 258
 259
 260
 261
 262
 263
 264
 265
 266
 267
 268
 269
 270
 271
 272
 273
 274
 275
 276
 277
 278
 279
 280
 281
 282
 283
 284
 285
 286
 287
 288
 289
 290
 291
 292
 293
 294
 295
 296
 297
 298
 299
 300
 301
 302
 303
 304
 305
 306
 307
 308
 309
 310
 311
 312
 313
 314
 315
 316
 317
 318
 319
 320
 321
 322
 323
 324
 325
 326
 327
 328
 329
 330
 331
 332
 333
 334
 335
 336
 337
 338
 339
 340
 341
 342
 343
 344
 345
 346
 347
 348
 349
 350
 351
 352
 353
 354
 355
 356
 357
 358
 359
 360
 361
 362
 363
 364
 365
 366
 367
 368
 369
 370
 371
 372
 373
 374
 375
 376
 377
 378
 379
 380
 381
 382
 383
 384
 385
 386
 387
 388
 389
 390
 391
 392
 393
 394
 395
 396
 397
 398
 399
 400
 401
 402
 403
 404
 405
 406
 407
 408
 409
 410
 411
 412
 413
 414
 415
 416
 417
 418
 419
 420
 421
 422
 423
 424
 425
 426
 427
 428
 429
 430
 431
 432
 433
 434
 435
 436
 437
 438
 439
 440
 441
 442
 443
 444
 445
 446
 447
 448
 449
 450
 451
 452
 453
 454
 455
 456
 457
 458
 459
 460
 461
 462
 463
 464
 465
 466
 467
 468
 469
 470
 471
 472
 473
 474
 475
 476
 477
 478
 479
 480
 481
 482
 483
 484
 485
 486
 487
 488
 489
 490
 491
 492
 493
 494
 495
 496
 497
 498
 499
 500
 501
 502
 503
 504
 505
 506
 507
 508
 509
 510
 511
 512
 513
 514
 515
 516
 517
 518
 519
 520
 521
 522
 523
 524
 525
 526
 527
 528
 529
 530
 531
 532
 533
 534
 535
 536
 537
 538
 539
 540
 541
 542
 543
 544
 545
 546
 547
 548
 549
 550
 551
 552
 553
 554
 555
 556
 557
 558
 559
 560
 561
 562
 563
 564
 565
 566
 567
 568
 569
 570
 571
 572
 573
 574
 575
 576
 577
 578
 579
 580
 581
 582
 583
 584
 585
 586
 587
 588
 589
 590
 591
 592
 593
 594
 595
 596
 597
 598
 599
 600
 601
 602
 603
 604
 605
 606
 607
 608
 609
 610
 611
 612
 613
 614
 615
 616
 617
 618
 619
 620
 621
 622
 623
 624
 625
 626
 627
 628
 629
 630
 631
 632
 633
 634
 635
 636
 637
 638
 639
 640
 641
 642
 643
 644
 645
 646
 647
 648
 649
 650
 651
 652
 653
 654
 655
 656
 657
 658
 659
 660
 661
 662
 663
 664
 665
 666
 667
 668
 669
 670
 671
 672
 673
 674
 675
 676
 677
 678
 679
 680
 681
 682
 683
 684
 685
 686
 687
 688
 689
 690
 691
 692
 693
 694
 695
 696
 697
 698
 699
 700
 701
 702
 703
 704
 705
 706
 707
 708
 709
 710
 711
 712
 713
 714
 715
 716
 717
 718
 719
 720
 721
 722
 723
 724
 725
 726
 727
 728
 729
 730
 731
 732
 733
 734
 735
 736
 737
 738
 739
 740
 741
 742
 743
 744
 745
 746
 747
 748
 749
 750
 751
 752
 753
 754
 755
 756
 757
 758
 759
 760
 761
 762
 763
 764
 765
 766
 767
 768
 769
 770
 771
 772
 773
 774
 775
 776
 777
 778
 779
 780
 781
 782
 783
 784
 785
 786
 787
 788
 789
 790
 791
 792
 793
 794
 795
 796
 797
 798
 799
 800
 801
 802
 803
 804
 805
 806
 807
 808
 809
 810
 811
 812
 813
 814
 815
 816
 817
 818
 819
 820
 821
 822
 823
 824
 825
 826
 827
 828
 829
 830
 831
 832
 833
 834
 835
 836
 837
 838
 839
 840
 841
 842
 843
 844
 845
 846
 847
 848
 849
 850
 851
 852
 853
 854
 855
 856
 857
 858
 859
 860
 861
 862
 863
 864
 865
 866
 867
 868
 869
 870
 871
 872
 873
 874
 875
 876
 877
 878
 879
 880
 881
 882
 883
 884
 885
 886
 887
 888
 889
 890
 891
 892
 893
 894
 895
 896
 897
 898
 899
 900
 901
 902
 903
 904
 905
 906
 907
 908
 909
 910
 911
 912
 913
 914
 915
 916
 917
 918
 919
 920
 921
 922
 923
 924
 925
 926
 927
 928
 929
 930
 931
 932
 933
 934
 935
 936
 937
 938
 939
 940
 941
 942
 943
 944
 945
 946
 947
 948
 949
 950
 951
 952
 953
 954
 955
 956
 957
 958
 959
 960
 961
 962
 963
 964
 965
 966
 967
 968
 969
 970
 971
 972
 973
 974
 975
 976
 977
 978
 979
 980
 981
 982
 983
 984
 985
 986
 987
 988
 989
 990
 991
 992
 993
 994
 995
 996
 997
 998
 999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
{
* 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/
*
* Copyright (C) 2010-2013, Peter Johnson (www.delphidabbler.com).
*
* $Rev$
* $Date$
*
* Provides various generic container classes and enumerators.
}
unit UContainers;
interface
uses
// Delphi
Classes, // declare before Generics.Collections
Generics.Defaults, Generics.Collections;
type
{
TSortedList:
Represents an enumerable sorted list, with sorting defined by user. List
items are accessible by index.
}
TSortedList<T> = class(TEnumerable<T>)
strict private
fList: TList<T>; // Maintains list
fComparer: IComparer<T>; // Object that compares list items
fPermitDuplicates: Boolean; // Value of PermitDuplicates property
fOnNotify: TCollectionNotifyEvent<T>; // OnNotify event handler
function GetCount: Integer;
{Read accessor for Count property. Gets number of items in list.
@return Number of items in list.
}
function GetItem(Idx: Integer): T;
{Read accessor for Items[] property. Gets list item at a specified index
in list.
@param Idx [in] Index of required item.
@return Item at given index in list.
}
procedure SetPermitDuplicates(const Value: Boolean);
{Write accessor for PermitDuplicates property.
@param Value [in] New property value.
@except EListError raised if new value is False and list contains
duplicate entries.
}
procedure NotificationHandler(Sender: TObject; const Item: T;
Action: TCollectionNotification);
{Handles underlying list's OnNotify event. Triggered when something in
list changes. Passes event on to this class' own notification system.
@param Sender [in] Instance of list object that triggers event. Ignored.
@param Item [in] Item for which change has been detected.
@param Action [in] Kind of action: add, remove or extract.
}
strict protected
procedure Notify(const Item: T; Action: TCollectionNotification); virtual;
{Triggers list's OnNotify event.
@param Item [in] List item for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
function DoGetEnumerator: TEnumerator<T>; override;
{Gets a new instance of list's enumerator object.
@return Enumerator instance.
}
public
constructor Create; overload;
{Constructs new list object that uses default comparer.
}
constructor Create(const AComparer: IComparer<T>); overload;
{Constructs new list object that uses a specified comparer.
@param AComparer [in] Object used to compare list items. If nil, default
comparer is used.
}
constructor Create(Collection: TEnumerable<T>); overload;
{Constructs a new list object that uses the default comparer and adds all
the items from an enumerable collection to it.
@param Collection [in] Collection to be added.
}
constructor Create(const AComparer: IComparer<T>;
Collection: TEnumerable<T>); overload;
{Constructs a new list object that uses a specified comparer and adds all
the items from an enumerable collection to it.
@param AComparer [in] Object used to compare list items. If nil, default
comparer is used.
@param Collection [in] Collection to be added.
}
destructor Destroy; override;
{Destroys list object.
}
function Add(const Item: T): Integer;
{Adds a new item to the list.
@param Item [in] Item to be added.
@return Index of new item in list.
@except EListError raised if Item is already in list when duplicates are
not permitted.
}
procedure AddRange(const Values: array of T); overload;
{Adds an array of values to the list.
@param Values [in] Array to be added.
}
procedure AddRange(const Collection: IEnumerable<T>); overload;
{Adds an enumerable collection to the list.
@param Collection [in] Interface to collection to be added.
}
procedure AddRange(Collection: TEnumerable<T>); overload;
{Adds an enumerable collection to the list.
@param Collection [in] Collection to be added.
}
procedure Clear;
{Clears all items from list.
}
function Find(const Item: T; out Index: Integer): Boolean;
{Finds an item in list.
@param Item [in] Item to find.
@param Index [out] Index of Item in list if present.
@return True if Item found in list, False if not.
}
function IndexOf(const Item: T): Integer;
{Gets index of an item in list.
@param Item [in] List item to find.
@return Index of first occurence of Item in list or -1 if Item not in
list.
}
function Contains(const Item: T): Boolean;
{Checks if an item is in the list.
@param Item [in] Item to be checked.
@return True if at least one copy of Item is in list, False if not.
}
function IsEmpty: Boolean;
{Checks if list is empty.
@return True if list is empty, False if not.
}
function Remove(const Item: T): Integer;
{Removes an item from list.
@param Item [in] Item to be removed from list.
@return Former index of removed item.
}
procedure Delete(Index: Integer);
{Deletes item at a specified index from list.
@param Index [in] Index of item to be deleted.
}
function ContainsDuplicates: Boolean;
{Checks if list contains any duplicate items.
@return True if list contains duplicates, False if not.
}
property Count: Integer read GetCount;
{Number of items in list}
property PermitDuplicates: Boolean read fPermitDuplicates
write SetPermitDuplicates;
{Determines whether duplicate list items are permitted}
property Items[Idx: Integer]: T read GetItem; default;
{Provides access to list items by index}
property OnNotify: TCollectionNotifyEvent<T> read fOnNotify write fOnNotify;
{Event triggered when something changes in list}
end;
{
TSortedObjectList:
Represents an enumerable sorted list of objects, with sorting defined by
user. List can own the objects it contains, in which case it frees objects
removed from the list.
}
TSortedObjectList<T: class> = class(TSortedList<T>)
strict private
fOwnsObjects: Boolean; // Value of OwnsObjects property
strict protected
procedure Notify(const Item: T; Action: TCollectionNotification); override;
{Triggers OnNotify event for item and frees item if OwnsObjects is true
and item is being removed from list.
@param Item [in] Object affected by notification.
@param Action [in] Action that applies to Object.
}
public
constructor Create(AOwnsObjects: Boolean); overload;
{Constructs object list that owns objects in list and uses default
comparer.
@param AOwnsObjects [in] Whether list owns contained objects.
}
constructor Create(const AComparer: IComparer<T>;
AOwnsObjects: Boolean); overload;
{Constructs object list that owns objects in list and has user-specified
comparer.
@param AComparer [in] Object used to compare objects in list.
@param AOwnsObjects [in] Whether list owns contained objects.
}
constructor Create(const AComparer: IComparer<T>;
Collection: TEnumerable<T>; AOwnsObjects: Boolean); overload;
{Constructs object list that owns objects in list, has user-specified
comparer and adds all the items of an enumerable collection to the list.
@param AComparer [in] Object used to compare objects in list. Pass nil
to use default comparer
@param Collection [in] Collection of objects to be added.
@param AOwnsObjects [in] Whether list owns contained objects.
}
property OwnsObjects: Boolean read fOwnsObjects;
{Specifies whether the list owns the objects it contains or not}
end;
{
TSortedDictionary:
Represents an enumerable dictionary that is sorted on the key according to a
user defined sorting. Keys, values and key/value pairs are also accessible
by index.
}
TSortedDictionary<TKey,TValue> = class(TEnumerable<TPair<TKey,TValue>>)
public
type
{
TKeyEnumerator:
Enumerator for the dictionary's keys collection.
}
TKeyEnumerator = class(TEnumerator<TKey>)
strict private
fEnum: TEnumerator<TPair<TKey,TValue>>; // Underlying list enumerator
strict protected
function DoGetCurrent: TKey; override;
{Gets current key in enumeration.
@return Current key.
}
function DoMoveNext: Boolean; override;
{Moves to next key in enumeration.
@return True if there is a next key, False if at end of enumeration.
}
public
constructor Create(AItems: TSortedList<TPair<TKey,TValue>>);
{Constructs a new keys enumerator.
@param AItems [in] Ordered list of key / value pairs in dictionary.
}
destructor Destroy; override;
{Destroys enumerator object.
}
end;
{
TKeyCollection:
Provides access to dictionary's keys as an indexable and enumerable
collection.
}
TKeyCollection = class(TEnumerable<TKey>)
strict private
fItems: TSortedList<TPair<TKey,TValue>>; // List of key/value pairs
function GetCount: Integer;
{Read accessor for Count property.
@return Number of keys in collection.
}
function GetItem(Idx: Integer): TKey;
{Read accessor for Items[] property.
@param Idx [in] Index of required key.
@return Key at given index.
}
strict protected
function DoGetEnumerator: TEnumerator<TKey>; override;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
public
constructor Create(AItems: TSortedList<TPair<TKey,TValue>>);
{Constructs a new collection object for a given list of keys.
@param AItems [in] List of key / value pairs.
}
function GetEnumerator: TKeyEnumerator; reintroduce;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
property Items[Idx: Integer]: TKey read GetItem; default;
{Array of keys in collection accessed by zero based index}
property Count: Integer read GetCount;
{Number of items in collection}
end;
{
TValueEnumerator:
Enumerator for the dictionary's values collection.
}
TValueEnumerator = class(TEnumerator<TValue>)
strict private
fEnum: TEnumerator<TPair<TKey,TValue>>; // Underlying list enumerator
strict protected
function DoGetCurrent: TValue; override;
{Gets current value in enumeration.
@return Current value.
}
function DoMoveNext: Boolean; override;
{Moves to next value in enumeration.
@return True if there is a next value, False if at end of
enumeration.
}
public
constructor Create(AItems: TSortedList<TPair<TKey,TValue>>);
{Constructs a new values enumerator.
@param AItems [in] Ordered list of key / value pairs in dictionary.
}
destructor Destroy; override;
{Destroys enumerator object.
}
end;
{
TValueCollection:
Provides access to dictionary's values as an indexable and enumerable
collection.
}
TValueCollection = class(TEnumerable<TValue>)
strict private
fItems: TSortedList<TPair<TKey,TValue>>; // List of key/value pairs
function GetCount: Integer;
{Read accessor for Count property.
@return Number of values in collection.
}
function GetItem(Idx: Integer): TValue;
{Read accessor for Items[] property.
@param Idx [in] Index of required value.
@return Value at given index.
}
strict protected
function DoGetEnumerator: TEnumerator<TValue>; override;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
public
constructor Create(AItems: TSortedList<TPair<TKey,TValue>>);
{Constructs a new collection object for a given list of values.
@param AItems [in] List of key / value pairs.
}
function GetEnumerator: TValueEnumerator; reintroduce;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
property Items[Idx: Integer]: TValue read GetItem; default;
{Array of values in collection accessed by zero based index}
property Count: Integer read GetCount;
{Number of items in collection}
end;
{
TPairEnumerator:
Helper type for the dictionary's enumerator.
}
TPairEnumerator = TEnumerator<TPair<TKey,TValue>>;
strict private
fList: TSortedList<TPair<TKey,TValue>>; // Maintains dictionary's entries
fKeysCollection: TKeyCollection; // Dictionary's Keys collection
fValuesCollection: TValueCollection; // Dictionary's Values collection
fComparer: IComparer<TKey>; // Compares dictionary keys
fOnKeyNotify: // OnKeyNotify event handler
TCollectionNotifyEvent<TKey>;
fOnValueNotify: // OnValueNotify event handler
TCollectionNotifyEvent<TValue>;
function GetKeys: TKeyCollection;
{Read accessor for Keys collection property. Creates collection if
necessary.
@return Keys collection object.
}
function GetValues: TValueCollection;
{Read accessor for Values collection property. Creates collection if
necessary.
@return Values collection object.
}
function GetCount: Integer;
{Read accessor for Count property.
@return Number of items in dictionary.
}
function GetItem(const Key: TKey): TValue;
{Read accessor for Items[] property.
@param Key [in] Key for which value is required.
@return Required value.
@except EListError raised if Key is not in dictionary.
}
function GetItemByIndex(const Idx: Integer): TPair<TKey, TValue>;
{Read accessor for ItemsByIndex[] property.
@param Idx [in] Index of required key/value pair in dictionary.
@return Key/value pair at given index.
}
procedure NotificationHandler(Sender: TObject;
const Item: TPair<TKey,TValue>; Action: TCollectionNotification);
{Handles underlying list's OnNotify event. Triggered when something in
list changes. Passes event on to this class' own notification system.
@param Sender [in] Instance of list object that triggers event. Ignored.
@param Item [in] Item for which change has been detected.
@param Action [in] Kind of action: add, remove or extract.
}
strict protected
procedure KeyNotify(const Key: TKey;
Action: TCollectionNotification); virtual;
{Triggers OnKeyNotify event for key.
@param Key [in] Key for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
procedure ValueNotify(const Value: TValue;
Action: TCollectionNotification); virtual;
{Triggers OnValueNotify event for value.
@param Value [in] Value for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
function DoGetEnumerator: TEnumerator<TPair<TKey,TValue>>; override;
{Gets a new instance of dictionary's enumerator object.
@return Enumerator instance.
}
public
constructor Create; overload;
{Constructs new dictionary instance that uses default key comparisons.
}
constructor Create(const AComparer: IComparer<TKey>); overload;
{Constructs new dictionary instance that uses a specified comparer.
@param AComparer [in] Object to use to compare dictionary keys. If nil
default comparer is used.
}
destructor Destroy; override;
{Destroys dictionary object.
}
function Add(const Key: TKey; const Value: TValue): Integer; overload;
{Adds a new key and value to dictionary.
@param Key [in] New key.
@param Value [in] New value to associated with key.
@return Index at which new entry added to dictionary.
}
function Add(const Item: TPair<TKey,TValue>): Integer; overload;
{Added a new key/value pair to dictionary.
@return Index at which new entry added to dictionary.
}
procedure Clear;
{Clears all entries from dictionary.
}
function Find(const Key: TKey; out Index: Integer): Boolean;
{Finds index of a key in dictionary.
@param Key [in] Key to find.
@param Index [out] Set to index of Key if found.
@return True if key is in dictionary, False if not.
}
function IndexOf(const Key: TKey): Integer;
{Gets index of a key in dictionary.
@param Key [in] Key to be found.
@return Index of Key in dictionary or -1 if Key not in dictionary.
}
function Contains(const Key: TKey): Boolean;
{Checks if dictionary contains a key.
@param Key [in] Key to be checked.
@return True if Key is in dictionary, False if not.
}
function IsEmpty: Boolean;
{Checks if dictionary is empty.
@return True if dictionary is empty, False if not.
}
function Remove(const Key: TKey): Integer;
{Removes entry with a specified key from dictionary.
@param Key [in] Key of entry to be removed.
@return Index of item removed.
}
procedure Delete(Index: Integer);
{Deletes dictionary entry at a specified index.
@param Index [in] Index of item to be deleted.
}
function GetEnumerator: TPairEnumerator; reintroduce;
{Gets a new instance of dictionary's enumerator.
@return Enumerator instance.
}
property Count: Integer read GetCount;
{Number of items in dictionary}
property Items[const Key: TKey]: TValue read GetItem; default;
{Dictionary's values accessed by key}
property ItemsByIndex[const Idx: Integer]: TPair<TKey,TValue>
read GetItemByIndex;
{Dictionary's key/value pairs accessed by zero based index}
property Keys: TKeyCollection read GetKeys;
{Indexable and enumerable list of all dictionary keys}
property Values: TValueCollection read GetValues;
{Indexable and enumerable list of all dictionary values}
property OnKeyNotify: TCollectionNotifyEvent<TKey> read fOnKeyNotify
write fOnKeyNotify;
{Event triggered when something changes in dictionary. Provides key of
item that changed along with details of change}
property OnValueNotify: TCollectionNotifyEvent<TValue> read fOnValueNotify
write fOnValueNotify;
{Event triggered when something changes in dictionary. Provides value of
item that changed along with details of change}
end;
{
TSortedObjectDictionary:
Represents an enumerable dictionary that is sorted on the key according to a
user defined sorting. Keys, values and key/value pairs are also accessible
by index. If keys and / or values are objects they may optionally be owned
by the dictionary and freed when removed.
NOTE: If this class is instantiated with Ownerships = [] then its
functionality is identical to TSortedDictionary. In particular the class
can be instantiated with both TKey and TValue as non-objects.
}
TSortedObjectDictionary<TKey,TValue> = class(TSortedDictionary<TKey,TValue>)
strict private
fOwnerships: TDictionaryOwnerships; // Value of Ownerships property
strict protected
procedure KeyNotify(const Key: TKey;
Action: TCollectionNotification); override;
{Triggers OnKeyNotify event for key and frees key if Ownerships property
specifies it and key is being removed from list.
@param Key [in] Key for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
procedure ValueNotify(const Value: TValue;
Action: TCollectionNotification); override;
{Triggers OnValueNotify event for value and frees value if Ownerships
property specifies it and value is being removed from list.
@param Value [in] Value for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
public
constructor Create(AOwnerships: TDictionaryOwnerships); overload;
{Constructs dictionary where either keys or values or both are objects
that are optionally owned by dictionary and uses default comparer.
@param AOwnerships [in] Whether keys or values are owned by dictionary.
@except Raises EInvalidCast if ownership is specified for a key or value
that is not an object.
}
constructor Create(const AComparer: IComparer<TKey>;
AOwnerships: TDictionaryOwnerships); overload;
{Constructs dictionary where either keys or values or both are objects
that are optionally owned by dictionary and has user-specified comparer.
@param AComparer [in] Object used to compare objects in list.
@param AOwnerships [in] Whether keys or values are owned by dictionary.
@except Raises EInvalidCast if ownership is specified for a key or value
that is not an object.
}
property Ownerships: TDictionaryOwnerships read fOwnerships;
{Specifies whether the dictionary owns the keys and/or values if they are
objects}
end;
type
/// <summary>Generic enumerator for dynamic arrays.</summary>
TArrayEnumerator<T> = class(TEnumerator<T>)
strict private
var
/// <summary>Array being enumerated.</summary>
fArray: TArray<T>;
/// <summary>Index of current array element in enumeration.</summary>
fIndex: Integer;
strict protected
/// <summary>Gets current array element in enumeration.</summary>
/// <returns>T. Content of current array element.</returns>
function DoGetCurrent: T; override;
/// <summary>Moves to next item in enumeration.</summary>
/// <returns>Boolean. True if there is a next item, False if at end of
/// enumeration.</returns>
function DoMoveNext: Boolean; override;
public
/// <summary>Creates enumerator for given dynamic array.</summary>
/// <param name="A">array of T [in] Array to be enumerated.</param>
/// <remarks>Constructor makes a shallow copy of the given array: value
/// type elements are copied but reference type elements are simply
/// referenced.</remarks>
constructor Create(const A: array of T);
end;
resourcestring
// Error messages: must be in interface for parametised types
sOrderedListDuplicateErr = 'Duplicate item not permitted';
sOrderedListPermitDuplicatesError = 'List contains duplicates';
sKeyNotFound = 'Key not found';
sKeyNotObject = 'Key must be a TObject to be owned';
sValueNotObject = 'Value must be a TObject to be owned';
implementation
uses
// Project
SysUtils, RTTI, TypInfo;
{ TSortedList<T> }
function TSortedList<T>.Add(const Item: T): Integer;
{Adds a new item to the list.
@param Item [in] Item to be added.
@return Index of new item in list.
@except EListError raised if Item is already in list when duplicates are
not permitted.
}
begin
if Find(Item, Result) and not PermitDuplicates then
raise EListError.Create(sOrderedListDuplicateErr);
fList.Insert(Result, Item);
end;
procedure TSortedList<T>.AddRange(const Values: array of T);
var
Item: T;
begin
for Item in Values do
Add(Item);
end;
procedure TSortedList<T>.AddRange(const Collection: IEnumerable<T>);
var
Item: T;
begin
for Item in Collection do
Add(Item);
end;
procedure TSortedList<T>.AddRange(Collection: TEnumerable<T>);
var
Item: T;
begin
for Item in Collection do
Add(Item);
end;
procedure TSortedList<T>.Clear;
{Clears all items from list.
}
begin
fList.Clear;
end;
function TSortedList<T>.Contains(const Item: T): Boolean;
{Checks if an item is in the list.
@param Item [in] Item to be checked.
@return True if at least one copy of Item is in list, False if not.
}
var
Dummy: Integer; // unused index of Item in list
begin
Result := Find(Item, Dummy);
end;
function TSortedList<T>.ContainsDuplicates: Boolean;
{Checks if list contains any duplicate items.
@return True if list contains duplicates, False if not.
}
var
Idx: Integer; // loops thru list
begin
Result := False;
for Idx := 1 to Pred(fList.Count) do
if fComparer.Compare(fList[Idx], fList[Idx - 1]) = 0 then
Exit(True);
end;
constructor TSortedList<T>.Create(Collection: TEnumerable<T>);
begin
Create(nil, Collection);
end;
constructor TSortedList<T>.Create(const AComparer: IComparer<T>;
Collection: TEnumerable<T>);
begin
Create(AComparer);
AddRange(Collection);
end;
constructor TSortedList<T>.Create;
{Constructs new list object that uses default comparer.
}
begin
Create(nil);
end;
constructor TSortedList<T>.Create(const AComparer: IComparer<T>);
{Constructs new list object that uses a specified comparer.
@param AComparer [in] Object used to compare list items. If nil, default
comparer is used.
}
begin
inherited Create;
if Assigned(AComparer) then
fComparer := AComparer
else
fComparer := TComparer<T>.Default;
fList := TList<T>.Create(fComparer);
fList.OnNotify := NotificationHandler;
end;
procedure TSortedList<T>.Delete(Index: Integer);
{Deletes item at a specified index from list.
@param Index [in] Index of item to be deleted.
}
begin
fList.Delete(Index);
end;
destructor TSortedList<T>.Destroy;
{Destroys list object.
}
begin
fList.Free;
inherited;
end;
function TSortedList<T>.DoGetEnumerator: TEnumerator<T>;
{Gets a new instance of list's enumerator object.
@return Enumerator instance.
}
begin
Result := fList.GetEnumerator;
end;
function TSortedList<T>.Find(const Item: T; out Index: Integer): Boolean;
{Finds an item in list.
@param Item [in] Item to find.
@param Index [out] Index of Item in list if present.
@return True if Item found in list, False if not.
}
begin
Result := fList.BinarySearch(Item, Index);
end;
function TSortedList<T>.GetCount: Integer;
{Read accessor for Count property. Gets number of items in list.
@return Number of items in list.
}
begin
Result := fList.Count;
end;
function TSortedList<T>.GetItem(Idx: Integer): T;
{Read accessor for Items[] property. Gets list item at a specified index in
list.
@param Idx [in] Index of required item.
@return Item at given index in list.
}
begin
Result := fList[Idx];
end;
function TSortedList<T>.IndexOf(const Item: T): Integer;
{Gets index of an item in list.
@param Item [in] List item to find.
@return Index of first occurence of Item in list or -1 if Item not in list.
}
begin
if not Find(Item, Result) then
Result := -1;
end;
function TSortedList<T>.IsEmpty: Boolean;
{Checks if list is empty.
@return True if list is empty, False if not.
}
begin
Result := Count = 0;
end;
procedure TSortedList<T>.NotificationHandler(Sender: TObject; const Item: T;
Action: TCollectionNotification);
{Handles underlying list's OnNotify event. Triggered when something in list
changes. Passes event on to this class' own notification system.
@param Sender [in] Instance of list object that triggers event. Ignored.
@param Item [in] Item for which change has been detected.
@param Action [in] Kind of action: add, remove or extract.
}
begin
Notify(Item, Action);
end;
procedure TSortedList<T>.Notify(const Item: T;
Action: TCollectionNotification);
{Triggers list's OnNotify event.
@param Item [in] List item for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
begin
if Assigned(fOnNotify) then
fOnNotify(Self, Item, Action);
end;
function TSortedList<T>.Remove(const Item: T): Integer;
{Removes an item from list.
@param Item [in] Item to be removed from list.
@return Former index of removed item.
}
begin
Result := fList.Remove(Item);
end;
procedure TSortedList<T>.SetPermitDuplicates(const Value: Boolean);
{Write accessor for PermitDuplicates property.
@param Value [in] New property value.
@except EListError raised if new value is False and list contains
duplicate entries.
}
begin
if not Value and ContainsDuplicates then
raise EListError.Create(sOrderedListPermitDuplicatesError);
fPermitDuplicates := Value;
end;
{ TSortedObjectList<T> }
constructor TSortedObjectList<T>.Create(AOwnsObjects: Boolean);
{Constructs object list that owns objects in list and uses default comparer.
@param AOwnsObjects [in] Whether list owns contained objects.
}
begin
Create(nil, AOwnsObjects);
end;
constructor TSortedObjectList<T>.Create(const AComparer: IComparer<T>;
AOwnsObjects: Boolean);
{Constructs object list that owns objects in list and has user-specified
comparer.
@param AComparer [in] Object used to compare objects in list.
@param AOwnsObjects [in] Whether list owns contained objects.
}
begin
fOwnsObjects := AOwnsObjects;
Create(AComparer);
end;
constructor TSortedObjectList<T>.Create(const AComparer: IComparer<T>;
Collection: TEnumerable<T>; AOwnsObjects: Boolean);
begin
Create(AComparer, AOwnsObjects);
Add(Collection);
end;
procedure TSortedObjectList<T>.Notify(const Item: T;
Action: TCollectionNotification);
{Triggers OnNotify event for item and frees item if OwnsObjects is true and
item is being removed from list.
@param Item [in] Object affected by notification.
@param Action [in] Action that applies to Object.
}
begin
inherited;
if OwnsObjects and (Action = cnRemoved) then
Item.Free;
end;
{ TSortedDictionary<TKey, TValue> }
function TSortedDictionary<TKey, TValue>.Add(const Key: TKey;
const Value: TValue): Integer;
{Adds a new key and value to dictionary.
@param Key [in] New key.
@param Value [in] New value to associated with key.
@return Index at which new entry added to dictionary.
}
begin
Result := Add(TPair<TKey,TValue>.Create(Key, Value));
end;
function TSortedDictionary<TKey, TValue>.Add(
const Item: TPair<TKey, TValue>): Integer;
{Added a new key/value pair to dictionary.
@return Index at which new entry added to dictionary.
}
begin
Result := fList.Add(Item);
end;
procedure TSortedDictionary<TKey, TValue>.Clear;
{Clears all entries from dictionary.
}
begin
fList.Clear;
end;
function TSortedDictionary<TKey, TValue>.Contains(const Key: TKey): Boolean;
{Checks if dictionary contains a key.
@param Key [in] Key to be checked.
@return True if Key is in dictionary, False if not.
}
var
Dummy: Integer; // Index of key in dictionary. Not used.
begin
Result := Find(Key, Dummy);
end;
constructor TSortedDictionary<TKey, TValue>.Create(
const AComparer: IComparer<TKey>);
{Constructs new dictionary instance that uses a specified comparer.
@param AComparer [in] Object to use to compare dictionary keys. If nil
default comparer is used.
}
begin
inherited Create;
// determine comparer
if Assigned(AComparer) then
fComparer := AComparer
else
fComparer := TComparer<TKey>.Default;
// created ordered list for key value pair that compares only on key
fList := TSortedList<TPair<TKey,TValue>>.Create(
TComparer<TPair<TKey,TValue>>.Construct(
function(const Left, Right: TPair<TKey,TValue>): Integer
begin
Result := fComparer.Compare(Left.Key, Right.Key);
end
)
);
// initialize properties
fList.PermitDuplicates := False;
fList.OnNotify := NotificationHandler;
end;
constructor TSortedDictionary<TKey, TValue>.Create;
{Constructs new dictionary instance that uses default key comparisons.
}
begin
Create(nil);
end;
procedure TSortedDictionary<TKey, TValue>.Delete(Index: Integer);
{Deletes dictionary entry at a specified index.
@param Index [in] Index of item to be deleted.
}
begin
fList.Delete(Index);
end;
destructor TSortedDictionary<TKey, TValue>.Destroy;
{Destroys dictionary object.
}
begin
fValuesCollection.Free;
fKeysCollection.Free;
fList.Free;
inherited;
end;
function TSortedDictionary<TKey, TValue>.DoGetEnumerator:
TEnumerator<TPair<TKey,TValue>>;
{Gets a new instance of dictionary's enumerator object.
@return Enumerator instance.
}
begin
Result := GetEnumerator;
end;
function TSortedDictionary<TKey, TValue>.Find(const Key: TKey;
out Index: Integer): Boolean;
{Finds index of a key in dictionary.
@param Key [in] Key to find.
@param Index [out] Set to index of Key if found.
@return True if key is in dictionary, False if not.
}
begin
Result := fList.Find(TPair<TKey,TValue>.Create(Key, Default(TValue)), Index);
end;
function TSortedDictionary<TKey, TValue>.GetCount: Integer;
{Read accessor for Count property.
@return Number of items in dictionary.
}
begin
Result := fList.Count;
end;
function TSortedDictionary<TKey, TValue>.GetEnumerator: TPairEnumerator;
{Gets a new instance of dictionary's enumerator.
@return Enumerator instance.
}
begin
Result := fList.GetEnumerator;
end;
function TSortedDictionary<TKey, TValue>.GetItem(const Key: TKey): TValue;
{Read accessor for Items[] property.
@param Key [in] Key for which value is required.
@return Required value.
@except EListError raised if Key is not in dictionary.
}
var
Index: Integer; // index of Key in dictionary
begin
if not Find(Key, Index) then
raise EListError.Create(sKeyNotFound);
Result := fList[Index].Value;
end;
function TSortedDictionary<TKey, TValue>.GetItemByIndex(
const Idx: Integer): TPair<TKey, TValue>;
{Read accessor for ItemsByIndex[] property.
@param Idx [in] Index of required key/value pair in dictionary.
@return Key/value pair at given index.
}
begin
Result := fList[Idx];
end;
function TSortedDictionary<TKey, TValue>.GetKeys: TKeyCollection;
{Read accessor for Keys collection property. Creates collection if necessary.
@return Keys collection object.
}
begin
if not Assigned(fKeysCollection) then
fKeysCollection := TKeyCollection.Create(fList);
Result := fKeysCollection;
end;
function TSortedDictionary<TKey, TValue>.GetValues: TValueCollection;
{Read accessor for Values collection property. Creates collection if
necessary.
@return Values collection object.
}
begin
if not Assigned(fValuesCollection) then
fValuesCollection := TValueCollection.Create(fList);
Result := fValuesCollection;
end;
function TSortedDictionary<TKey, TValue>.IndexOf(const Key: TKey): Integer;
{Gets index of a key in dictionary.
@param Key [in] Key to be found.
@return Index of Key in dictionary or -1 if Key not in dictionary.
}
begin
if not Find(Key, Result) then
Exit(-1);
end;
function TSortedDictionary<TKey, TValue>.IsEmpty: Boolean;
{Checks if dictionary is empty.
@return True if dictionary is empty, False if not.
}
begin
Result := Count = 0;
end;
procedure TSortedDictionary<TKey, TValue>.KeyNotify(const Key: TKey;
Action: TCollectionNotification);
{Triggers OnKeyNotify event for key.
@param Key [in] Key for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
begin
if Assigned(fOnKeyNotify) then
fOnKeyNotify(Self, Key, Action);
end;
procedure TSortedDictionary<TKey, TValue>.NotificationHandler(Sender: TObject;
const Item: TPair<TKey,TValue>; Action: TCollectionNotification);
{Handles underlying list's OnNotify event. Triggered when something in list
changes. Passes event on to this class' own notification system.
@param Sender [in] Instance of list object that triggers event. Ignored.
@param Item [in] Item for which change has been detected.
@param Action [in] Kind of action: add, remove or extract.
}
begin
KeyNotify(Item.Key, Action);
ValueNotify(Item.Value, Action);
end;
function TSortedDictionary<TKey, TValue>.Remove(const Key: TKey): Integer;
{Removes entry with a specified key from dictionary.
@param Key [in] Key of entry to be removed.
@return Index of item removed.
}
begin
Result := fList.Remove(TPair<TKey,TValue>.Create(Key, Default(TValue)));
end;
procedure TSortedDictionary<TKey, TValue>.ValueNotify(const Value: TValue;
Action: TCollectionNotification);
{Triggers OnValueNotify event for value.
@param Value [in] Value for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
begin
if Assigned(fOnValueNotify) then
fOnValueNotify(Self, Value, Action);
end;
{ TSortedDictionary<TKey, TValue>.TKeyEnumerator }
constructor TSortedDictionary<TKey, TValue>.TKeyEnumerator.Create(
AItems: TSortedList<TPair<TKey, TValue>>);
{Constructs a new keys enumerator.
@param AItems [in] Ordered list of key / value pairs in dictionary.
}
begin
inherited Create;
// we simply use enumerator of list used to store key/value pairs and return
// key component of pair
fEnum := AItems.GetEnumerator;
end;
destructor TSortedDictionary<TKey, TValue>.TKeyEnumerator.Destroy;
{Destroys enumerator object.
}
begin
fEnum.Free;
inherited;
end;
function TSortedDictionary<TKey, TValue>.TKeyEnumerator.DoGetCurrent: TKey;
{Gets current key in enumeration.
@return Current key.
}
begin
Result := fEnum.Current.Key;
end;
function TSortedDictionary<TKey, TValue>.TKeyEnumerator.DoMoveNext: Boolean;
{Moves to next key in enumeration.
@return True if there is a next key, False if at end of enumeration.
}
begin
Result := fEnum.MoveNext;
end;
{ TSortedDictionary<TKey, TValue>.TKeyCollection }
constructor TSortedDictionary<TKey, TValue>.TKeyCollection.Create(
AItems: TSortedList<TPair<TKey, TValue>>);
{Constructs a new collection object for a given list of keys.
@param AItems [in] List of key / value pairs.
}
begin
inherited Create;
// We use the keys from the list of key/value pairs
fItems := AItems;
end;
function TSortedDictionary<TKey, TValue>.TKeyCollection.DoGetEnumerator:
TEnumerator<TKey>;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
begin
Result := GetEnumerator;
end;
function TSortedDictionary<TKey, TValue>.TKeyCollection.GetCount: Integer;
{Read accessor for Count property.
@return Number of keys in collection.
}
begin
Result := fItems.Count;
end;
function TSortedDictionary<TKey, TValue>.TKeyCollection.GetEnumerator:
TKeyEnumerator;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
begin
Result := TKeyEnumerator.Create(fItems);
end;
function TSortedDictionary<TKey, TValue>.TKeyCollection.GetItem(
Idx: Integer): TKey;
{Read accessor for Items[] property.
@param Idx [in] Index of required key.
@return Key at given index.
}
begin
Result := fItems[Idx].Key;
end;
{ TSortedDictionary<TKey, TValue>.TValueEnumerator }
constructor TSortedDictionary<TKey, TValue>.TValueEnumerator.Create(
AItems: TSortedList<TPair<TKey, TValue>>);
{Constructs a new values enumerator.
@param AItems [in] Ordered list of key / value pairs in dictionary.
}
begin
inherited Create;
// we simply use enumerator of list used to store key/value pairs and return
// value component of pair
fEnum := AItems.GetEnumerator;
end;
destructor TSortedDictionary<TKey, TValue>.TValueEnumerator.Destroy;
{Destroys enumerator object.
}
begin
fEnum.Free;
inherited;
end;
function TSortedDictionary<TKey, TValue>.TValueEnumerator.DoGetCurrent: TValue;
{Gets current value in enumeration.
@return Current value.
}
begin
Result := fEnum.Current.Value;
end;
function TSortedDictionary<TKey, TValue>.TValueEnumerator.DoMoveNext: Boolean;
{Moves to next value in enumeration.
@return True if there is a next value, False if at end of enumeration.
}
begin
Result := fEnum.MoveNext;
end;
{ TSortedDictionary<TKey, TValue>.TValueCollection }
constructor TSortedDictionary<TKey, TValue>.TValueCollection.Create(
AItems: TSortedList<TPair<TKey, TValue>>);
{Constructs a new collection object for a given list of values.
@param AItems [in] List of key / value pairs.
}
begin
inherited Create;
// We use the values from the list of key/value pairs
fItems := AItems;
end;
function TSortedDictionary<TKey, TValue>.TValueCollection.DoGetEnumerator:
TEnumerator<TValue>;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
begin
Result := GetEnumerator;
end;
function TSortedDictionary<TKey, TValue>.TValueCollection.GetCount: Integer;
{Read accessor for Count property.
@return Number of values in collection.
}
begin
Result := fItems.Count;
end;
function TSortedDictionary<TKey, TValue>.TValueCollection.GetEnumerator:
TValueEnumerator;
{Gets a new instance of the collection's enumerator.
@return Enumerator instance.
}
begin
Result := TValueEnumerator.Create(fItems);
end;
function TSortedDictionary<TKey, TValue>.TValueCollection.GetItem(
Idx: Integer): TValue;
{Read accessor for Items[] property.
@param Idx [in] Index of required value.
@return Value at given index.
}
begin
Result := fItems[Idx].Value;
end;
{ TSortedObjectDictionary<TKey, TValue> }
constructor TSortedObjectDictionary<TKey, TValue>.Create(
AOwnerships: TDictionaryOwnerships);
{Constructs dictionary where either keys or values or both are objects that
are optionally owned by dictionary and uses default comparer.
@param AOwnerships [in] Whether keys or values are owned by dictionary.
@except Raises EInvalidCast if ownership is specified for a key or value
that is not an object.
}
begin
Create(nil, AOwnerships);
end;
constructor TSortedObjectDictionary<TKey, TValue>.Create(
const AComparer: IComparer<TKey>; AOwnerships: TDictionaryOwnerships);
{Constructs dictionary where either keys or values or both are objects that
are optionally owned by dictionary and has user-specified comparer.
@param AComparer [in] Object used to compare objects in list.
@param AOwnerships [in] Whether keys or values are owned by dictionary.
@except Raises EInvalidCast if ownership is specified for a key or value
that is not an object.
}
var
RTTICtx: TRTTIContext; // context for accessing RTTI
begin
Create(AComparer);
// Check that any key or value specified in AOwnership is actually a class
// type
RTTICtx := TRttiContext.Create;
try
if (doOwnsKeys in AOwnerships) and
(RTTICtx.GetType(TypeInfo(TKey)).TypeKind <> tkClass) then
raise EInvalidCast.Create(sKeyNotObject);
if (doOwnsValues in AOwnerships) and
(RTTICtx.GetType(TypeInfo(TValue)).TypeKind <> tkClass) then
raise EInvalidCast.Create(sValueNotObject);
finally
RTTICtx.Free;
end;
// Ownerships validated: record in property
fOwnerships := AOwnerships;
end;
procedure TSortedObjectDictionary<TKey, TValue>.KeyNotify(const Key: TKey;
Action: TCollectionNotification);
{Triggers OnKeyNotify event for key and frees key if Ownerships property
specifies it and key is being removed from list.
@param Key [in] Key for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
begin
inherited;
if (Action = cnRemoved) and (doOwnsKeys in fOwnerships) then
TObject(Key).Free;
end;
procedure TSortedObjectDictionary<TKey, TValue>.ValueNotify(const Value: TValue;
Action: TCollectionNotification);
{Triggers OnValueNotify event for value and frees value if Ownerships property
specifies it and value is being removed from list.
@param Value [in] Value for which notification triggered.
@param Action [in] Kind of notification: add, remove or extract.
}
begin
inherited;
if (Action = cnRemoved) and (doOwnsValues in fOwnerships) then
TObject(Value).Free;
end;
{ TArrayEnumerator<T> }
constructor TArrayEnumerator<T>.Create(const A: array of T);
var
Idx: Integer;
begin
inherited Create;
SetLength(fArray, Length(A));
for Idx := Low(A) to High(A) do
fArray[Idx] := A[Idx];
fIndex := -1;
end;
function TArrayEnumerator<T>.DoGetCurrent: T;
begin
Result := fArray[fIndex];
end;
function TArrayEnumerator<T>.DoMoveNext: Boolean;
begin
if fIndex >= Length(fArray) then
Exit(False);
Inc(fIndex);
Result := fIndex < Length(fArray);
end;
end.
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.