mirror of
https://gitlab.com/freepascal.org/fpc/source.git
synced 2025-11-23 01:21:26 +01:00
b0b119995b
* New collections:
- TSortedList<T>
- THashSet<T>
- TAVLTreeMap<TKey, TValue>
- TIndexedAVLTreeMap<TKey, TValue>
- TAVLTree<T>
- TIndexedAVLTree<T>
- TSortedSet<T>
- TSortedHashSet<T> (this one collection is especially interesting - optimized mix of dictionary and AVL tree)
* Ptr property for all collections
* New hash functions (the optimal hash function for collections is selected depending on environment)
* Bug fixes
* Tests
git-svn-id: trunk@38462 -
98 lines
3.0 KiB
ObjectPascal
98 lines
3.0 KiB
ObjectPascal
{
|
|
This file is part of the Free Pascal run time library.
|
|
Copyright (c) 2018 by Maciej Izak (hnb),
|
|
member of the Free Pascal development team
|
|
|
|
It contains tests for the Free Pascal generics library
|
|
|
|
See the file COPYING.FPC, included in this distribution,
|
|
for details about the copyright.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
Acknowledgment
|
|
|
|
Thanks to Sphere 10 Software (http://sphere10.com) for sponsoring
|
|
many new types, tests and major refactoring of entire library
|
|
|
|
**********************************************************************}
|
|
|
|
unit tests.generics.arrayhelper;
|
|
|
|
{$mode delphi}
|
|
|
|
interface
|
|
|
|
uses
|
|
fpcunit, testregistry, testutils,
|
|
Classes, SysUtils, Generics.Collections;
|
|
|
|
type
|
|
|
|
{ TTestArrayHelper }
|
|
|
|
TTestArrayHelper = class(TTestCase)
|
|
protected
|
|
procedure CheckBinarySearch(constref AArray: TArray<Integer>;
|
|
AValue: Integer; AExpectedResult: boolean; out ASearchResult: TBinarySearchResult);
|
|
procedure CheckSearchResult(constref ASearchResult: TBinarySearchResult;
|
|
AValue: Integer; ACandidateIndex, AFoundIndex: SizeInt; ACompareResult: Boolean);
|
|
published
|
|
procedure Test_BinarySearch_Integers;
|
|
procedure Test_BinarySearch_EmptyArray;
|
|
end;
|
|
|
|
implementation
|
|
|
|
{ TTestArrayHelper }
|
|
|
|
procedure TTestArrayHelper.CheckBinarySearch(constref AArray: TArray<Integer>;
|
|
AValue: Integer; AExpectedResult: boolean; out
|
|
ASearchResult: TBinarySearchResult);
|
|
begin
|
|
CheckEquals(AExpectedResult,
|
|
TArrayHelper<Integer>.BinarySearch(AArray,AValue,ASearchResult),
|
|
'Wrong BinarySearch result for ' + AValue.ToString);
|
|
end;
|
|
|
|
procedure TTestArrayHelper.CheckSearchResult(constref
|
|
ASearchResult: TBinarySearchResult; AValue: Integer; ACandidateIndex,
|
|
AFoundIndex: SizeInt; ACompareResult: Boolean);
|
|
begin
|
|
with ASearchResult do
|
|
begin
|
|
CheckEquals(ACandidateIndex, CandidateIndex, 'Wrong binary search result (CandidateIndex) for ' + AValue.ToString);
|
|
CheckEquals(AFoundIndex, FoundIndex, 'Wrong binary search result (FoundIndex) for ' + AValue.ToString);
|
|
Check(ACompareResult, 'Wrong binary search result (CompareResult) for ' + AValue.ToString);
|
|
end;
|
|
end;
|
|
|
|
procedure TTestArrayHelper.Test_BinarySearch_Integers;
|
|
var
|
|
a: TArray<Integer>;
|
|
LSearchResult: TBinarySearchResult;
|
|
begin
|
|
a := TArray<Integer>.Create(1,3,5,7,9,11,13,15,20);
|
|
|
|
CheckBinarySearch(a, 10, False, LSearchResult);
|
|
CheckSearchResult(LSearchResult, 10, 5, -1, LSearchResult.CompareResult>0);
|
|
|
|
CheckBinarySearch(a, 20, True, LSearchResult);
|
|
CheckSearchResult(LSearchResult, 20, 8, 8, LSearchResult.CompareResult=0);
|
|
end;
|
|
|
|
procedure TTestArrayHelper.Test_BinarySearch_EmptyArray;
|
|
var
|
|
LSearchResult: TBinarySearchResult;
|
|
begin
|
|
CheckBinarySearch(nil, 1, False, LSearchResult);
|
|
CheckSearchResult(LSearchResult, 1, -1, -1, LSearchResult.CompareResult=0);
|
|
end;
|
|
|
|
begin
|
|
RegisterTest(TTestArrayHelper);
|
|
end.
|
|
|