/
lasersquad
/
DynamicArrays
Обзор
Документация
Войти
/
lasersquad
/
DynamicArrays
Код
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
dynamicarrays/prj/Delphi/DynamicArraysOTests/DynamicArraysTest.pas
1 901 строка
55 KB
lasersquad0
updated tests
19 май 2026, 23:54
19 май 2026, 23:54
8fbe9ff
Код
Авторство
О чём код?
unit DynamicArraysTest; interface uses DUnitX.TestFramework, {TestBase,} DynamicArrays; type [TestFixture] TDynamicArraysTest<TTestArr: constructor, THArray; InnerT: record> = class //(TTestBase) private type TTestingArrayType = TTestArr; private function FindProc(arr : THArray; i : Cardinal; FindData: Pointer): Integer; function Compare1(arr: THArray; i, j: Cardinal): Integer; function Compare2(Item1, Item2: InnerT): Integer; function IsTTBoolean: Boolean; function IsTTUnsigned: Boolean; procedure VerifySorting(arr: TTestArr); procedure CopyArray(arr1, arr2: TTestingArrayType); protected array1: TTestingArrayType; array2: TTestingArrayType; public [TearDownFixture] procedure TearDownFixture; // this method is called when all tests of this fixture are executed. so we have to free objects from FObjects [Setup] procedure Setup; [TearDown] procedure TearDown; [Test] procedure TestEmpty1; [Test] procedure TestEmpty2; [Test] procedure TestCountOne; [Test] procedure TestUpdate; [Test] procedure TestZero; [Test] procedure TestSwap; [Test] procedure TestAddFillValues; [Test] procedure TestIndexOF1; [Test] [TestCase('TestIndexofA','4, 1, 2, 0')] // last figure is used for assers when TTestArr=Boolean [TestCase('TestIndexofB','1,-1, 3, 0')] [TestCase('TestIndexofC','0, 3,-1, 1')] [TestCase('TestIndexofD','-13, 13, -1, 0')] procedure TestIndexOf2(const AValue1, AValue2, AValue3, AValue4: Integer); [Test] procedure TestCapacity1; [Test] procedure TestCapacity2; [Test] [TestCase('TestA','5,1')] [TestCase('TestB','4,3')] [TestCase('TestD','0,-1')] procedure TestAddTwoDiff(const AValue1, AValue2 : Integer); [Test] [TestCase('TestA','11, 11')] [TestCase('TestB',' 3999,3999')] [TestCase('TestC',' 0, 0')] //[TestCase('TestD','00000000, 0000000')] procedure TestAddTwoEqual(const AValue1, AValue2 : Integer); [Test] procedure TestGrow; [Test] procedure TestInsert1; [Test] procedure TestInsert2; [Test] procedure TestDeleteValue1; [Test] procedure TestDeleteValue2; [Test] procedure TestAddClearAdd1; [Test] procedure TestAddClearAdd2; [Test] procedure TestSort1; [TestCase('TestA', '1;2;3;4;5, 1;2;3;4;5')] [TestCase('TestB', '5;4;3;2;1, 1;2;3;4;5')] [TestCase('TestC', '44;53;1;12;100;999;9, 1;9;12;44;53;100;999')] [TestCase('TestD', '44;44;44;44;44;44;9, ;9;44;44;44;44;44;44')] [TestCase('TestE', '9;1;9;1;9;1;9;1, 1;1;1;1;;9;9;9;9;;')] [TestCase('TestF', '15, 15')] [TestCase('TestG', '0, 0')] [TestCase('TestH', '0;0, 0;0')] [TestCase('TestK', '16;15, 15;16')] procedure TestSort2(AValue1, AValue2: string); [Test] procedure TestQuickSort1; // <unsorted items> , <sorted items to verify> [TestCase('TestA', '1;2;3;4;5, 1;2;3;4;5')] [TestCase('TestB', '5;4;3;2;1, 1;2;3;4;5')] [TestCase('TestC', '44;53;1;12;100;999;9, 1;9;12;44;53;100;999')] [TestCase('TestD', '44;44;44;44;44;44;9, ;9;44;44;44;44;44;44')] [TestCase('TestE', '9;1;9;1;9;1;9;1, 1;1;1;1;;9;9;9;9;;')] [TestCase('TestF', '15, 15')] [TestCase('TestG', '0, 0')] [TestCase('TestH', '0;0, 0;0')] [TestCase('TestK', '16;15, 15;16')] procedure TestQuickSort2(AValue1, AValue2: string); [Test] procedure TestHGetToken1; [Test] procedure TestAddMany; [Test] procedure TestInsertMany; [Test] procedure TestQuickSortPerformance; [Test] procedure TestSortPerformance; { [Test(false)] procedure TestShakerSortPerformance;} [Test] // [MaxTime(5000)] procedure TestBubbleSortPerformance; { [Test] //[Ignore('Ignore this test to save testing time')] procedure TestAllSortAlgsPerformance; // the same data array is sorted by 5 different sorting algs, time is measured } // <unsorted items> , <value to find> , <value index to verify> [TestCase('TestA1', '1;2;3;4;5, 1 , 0')] [TestCase('TestA2', '1;2;3;4;5, 2 , 1')] [TestCase('TestA3', '1;2;3;4;5, 0 , -1')] [TestCase('TestA4', '5;4;3;2;1, 3 , 2')] [TestCase('TestA5', '5;4;3;2;1, 6 , -6')] [TestCase('TestA6', '5;4;3;2;1, 5 , 4')] [TestCase('TestA7', '5;4;3;2;1, 4 , 3')] [TestCase('TestA8', '5;4;3;2;6;1, 6 , 5')] [TestCase('TestC1', '44;53;1;12;100;109;9, 100, 5 ')] [TestCase('TestC2', '44;53;1;12;100;109;9, 109, 6 ')] [TestCase('TestC3', '44;53;1;12;100;109;9, 1000, -8 ')] [TestCase('TestD1', '44;44;44;44;44;44;9, 9 , 0 ')] [TestCase('TestD2', '44;44;44;44;44;44;9, 44 , 1 ')] [TestCase('TestD3', '44;44;44;44;44;44;9, 0 , -1 ')] [TestCase('TestE1', '9;1;9;1;9;1;9;1, 1, 0')] [TestCase('TestE2', '9;1;9;1;9;1;9;1, 9, 4')] [TestCase('TestE3', '9;1;9;1;9;1;9;1, 10, -9')] [TestCase('TestH', '15, 15, 0')] [TestCase('TestK1', '0, 0, 0')] [TestCase('TestK2', '0, 1, -2')] [TestCase('TestL1', '0;0, 0, 0')] [TestCase('TestL2', '0;0, -1, -1')] [TestCase('TestM', '16;15, 16, 1')] //[Ignore('temporary IMGORE')] [Category('QuickFindTests')] procedure TestQuickFind(AValue1, AValue2, AValue3: string); end; function MillisecToStr(ms: Cardinal): string; const ARRAYSIZE_FOR_SORTING = 25_000; implementation uses System.TypInfo, System.Generics.Defaults, SysUtils, Winapi.Windows; function MillisecToStr(ms: Cardinal): string; var milliseconds: Cardinal; seconds: Cardinal; minutes: Cardinal; hours: Cardinal; begin milliseconds := ms mod 1000; seconds := (ms div 1000) mod 60; minutes := (ms div 60000) mod 60; hours := (ms div 3600000) mod 24; //char buf[100]; if hours > 0 then Result := Format('%u h %u min %u sec %u ms', [hours, minutes, seconds, milliseconds]) else if minutes > 0 then Result := Format('%u min %u sec %u ms', [minutes, seconds, milliseconds]) else Result := Format('%u sec %u ms', [seconds, milliseconds]); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TearDownFixture; begin //FreeTObjects; end; procedure TDynamicArraysTest<TTestArr, InnerT>.Setup; begin //FComparableTypes := [tkInteger, tkInt64, tkFloat, tkChar, tkWChar, tkString, tkUString, tkLString, tkWString, tkPointer, tkEnumeration]; array1 := TTestingArrayType.Create; array2 := TTestingArrayType.Create; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TearDown; begin FreeAndNil(array1); FreeAndNil(array2); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestEmpty1; begin Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(Cardinal(sizeof(InnerT)), array1.ItemSize); array1.Clear(); Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(Cardinal(sizeof(InnerT)), array1.ItemSize); array1.ClearMem(); Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(Cardinal(sizeof(InnerT)), array1.ItemSize); array1.Hold; Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(Cardinal(sizeof(InnerT)), array1.ItemSize); {array1.Zero; Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(Cardinal(sizeof(TTestArr)), array1.ItemSize); } end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestEmpty2; var val: InnerT; begin //val := CreateValue<TTestArr>(33); Assert.WillRaise(procedure begin array1.Delete(0) end, ERangeError, 'd0'); Assert.WillRaise(procedure begin array1.Delete(1) end, ERangeError, 'd1'); Assert.WillRaise(procedure begin array1.Delete(2) end, ERangeError, 'd2'); Assert.WillRaise(procedure begin array1.Delete(10000) end, ERangeError, 'd10000'); Assert.WillRaise(procedure begin array1.GetAddr(0) end, ERangeError, 'g0'); Assert.WillRaise(procedure begin array1.GetAddr(1) end, ERangeError, 'g1'); Assert.WillRaise(procedure begin array1.GetAddr(2) end, ERangeError, 'g2'); Assert.WillRaise(procedure begin array1.GetAddr(10000) end, ERangeError, 'g10000'); Assert.WillRaise(procedure begin array1.Get(0, @val) end, ERangeError, 'g0'); Assert.WillRaise(procedure begin array1.Get(1, @val) end, ERangeError, 'g1'); Assert.WillRaise(procedure begin array1.Get(2, @val) end, ERangeError, 'g2'); Assert.WillRaise(procedure begin array1.Get(10000, @val) end, ERangeError, 'g10000'); Assert.WillRaise(procedure begin array1.Update(0, @val) end, ERangeError, 'u0'); Assert.WillRaise(procedure begin array1.Update(1, @val) end, ERangeError, 'u1'); Assert.WillRaise(procedure begin array1.Update(2, @val) end, ERangeError, 'u2'); Assert.WillRaise(procedure begin array1.Update(10000, @val) end, ERangeError, 'u10000'); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestCountOne; var val, val2, valTmp: InnerT; begin val := 666; val2 := 9999; array1.Add(@val); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); //Assert.WillRaise(procedure begin arr.Delete(0) end, ERangeError, 'd0'); Assert.WillRaise(procedure begin array1.Delete(1) end, ERangeError, 'd1'); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); Assert.WillRaise(procedure begin array1.Delete(2) end, ERangeError, 'd2'); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); Assert.WillRaise(procedure begin array1.Delete(10000) end, ERangeError, 'd10000'); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); Assert.WillRaise(procedure begin array1.Get(1, @valTmp) end, ERangeError, 'g1'); Assert.WillRaise(procedure begin array1.Get(2, @valTmp) end, ERangeError, 'g2'); Assert.WillRaise(procedure begin array1.Get(10000, @valTmp) end, ERangeError, 'g10000'); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); Assert.WillNotRaiseAny(procedure begin array1.Update(0, @val2) end); Assert.WillRaise(procedure begin array1.Update(1, @val) end, ERangeError, 'u1'); Assert.WillRaise(procedure begin array1.Update(2, @val) end, ERangeError, 'u2'); Assert.WillRaise(procedure begin array1.Update(10000, @val) end, ERangeError, 'u10000'); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestUpdate; var val, val2, val3, valTmp: InnerT; newVal0, newVal1, newVal2: InnerT; begin val := 666; val2 := 9999; val3 := 15003; array1.Insert(0, @val); array1.Insert(1, @val2); array1.Insert(2, @val3); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val3, valTmp); newVal0 := 1; newVal1 := 22; newVal2 := 444; array1.Update(0, @newVal0); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(newVal0, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val3, valTmp); array1.Update(1, @newVal1); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(newVal0, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(newVal1, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val3, valTmp); array1.Update(2, @newVal2); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(newVal0, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(newVal1, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(newVal2, valTmp); Assert.AreEqual(3, array1.Count); Assert.AreEqual(4, array1.Capacity); Assert.WillRaise(procedure begin array1.Update(3, @newVal0) end, ERangeError, 'g1'); Assert.WillRaise(procedure begin array1.Update(4, @newVal0) end, ERangeError, 'g2'); Assert.WillRaise(procedure begin array1.Update(1000, @newVal0) end, ERangeError, 'g10000'); Assert.AreEqual(3, array1.Count); Assert.AreEqual(4, array1.Capacity); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestZero; var val, val2, val3, valTmp: InnerT; newVal: InnerT; i: Integer; begin Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); array1.Zero; Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); val := 666; val2 := 9999; val3 := 15003; array1.Insert(0, @val); array1.Insert(1, @val2); array1.Insert(2, @val3); Assert.AreEqual(3, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val3, valTmp); array1.Zero; Assert.AreEqual(3, array1.Count); Assert.AreEqual(4, array1.Capacity); newVal := 0; array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(newVal, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(newVal, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(newVal, valTmp); val := 1; val2 := 22; val3 := 444; array1.Insert(1, @val); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Insert(3, @val2); array1.Get(3, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Insert(5, @val3); array1.Get(5, @valTmp); Assert.AreEqual<InnerT>(val3, valTmp); array1.Zero; newVal := 0; for i := 0 to 5 do begin array1.Get(i, @valTmp); Assert.AreEqual<InnerT>(newVal, valTmp); end; Assert.AreEqual(6, array1.Count); Assert.AreEqual(8, array1.Capacity); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestSwap; var val0, val1, val2, valTmp: InnerT; begin val0 := 666; val1 := 9999; val2 := 15003; array1.Insert(0, @val0); array1.Insert(1, @val1); array1.Add(@val2); Assert.AreEqual(3, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Swap(0, 1); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Swap(0, 1); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Swap(1, 1); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Swap(2, 2); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Swap(1, 0); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Swap(0, 2); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Swap(2, 1); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val0, valTmp); Assert.WillRaise(procedure begin array1.Swap(0, 3); end, ERangeError, 'index out of bounds 1'); Assert.WillRaise(procedure begin array1.Swap(1, 4); end, ERangeError, 'index out of bounds 2'); Assert.WillRaise(procedure begin array1.Swap(3, 3); end, ERangeError, 'index out of bounds 3'); Assert.WillRaise(procedure begin array1.Swap(3, 0); end, ERangeError, 'index out of bounds 4'); Assert.WillRaise(procedure begin array1.Swap(4, 0); end, ERangeError, 'index out of bounds 5'); Assert.WillRaise(procedure begin array1.Swap(10, 10); end, ERangeError, 'index out of bounds 6'); Assert.WillRaise(procedure begin array1.Swap(11, 109); end, ERangeError, 'index out of bounds 7'); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestDeleteValue1; var I: Integer; v, v2: InnerT; begin for I := 0 to 9 do begin v := i + 1; array1.Add(@v); array2.Add(@v); end; Assert.AreEqual(10, array1.Count); Assert.AreEqual(10, array2.Count); Assert.AreEqual(12, array1.Capacity); Assert.AreEqual(12, array2.Capacity); array1.Delete(0); array2.Delete(0); Assert.AreEqual(9, array1.Count); Assert.AreEqual(9, array2.Count); Assert.AreEqual(12, array1.Capacity); Assert.AreEqual(12, array2.Capacity); for I := 0 to 8 do begin array1.Get(i, @v); v2 := i + 2; Assert.AreEqual<InnerT>(v2, v); end; Assert.WillRaise(procedure begin array1.Delete(array1.Count); end, ERangeError, 'DeleteCalue at Count'); // try to delete out of range element Assert.AreEqual(9, array1.Count); array1.Delete(array1.Count - 1); //try to delete last element in the array array2.Delete(array2.Count - 1); //try to delete last element in the array Assert.AreEqual(8, array1.Count); Assert.AreEqual(8, array2.Count); Assert.AreEqual(12, array1.Capacity); Assert.AreEqual(12, array2.Capacity); for I := 0 to 7 do begin array1.Get(i, @v); v2 := i + 2; Assert.AreEqual<InnerT>(v, v2) end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestDeleteValue2; var I: Integer; v: InnerT; begin for I := 1 to 5 do begin v := i + 1; array1.Add(@v); end; Assert.AreEqual(5, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(0); Assert.AreEqual(4, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(0); Assert.AreEqual(3, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(0); Assert.AreEqual(2, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(0); Assert.AreEqual(1, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(0); Assert.AreEqual(0, array1.Count); Assert.AreEqual(8, array1.Capacity); Assert.WillRaise(procedure begin array1.Delete(0); end, ERangeError, 'DeleteCalue at 0'); // try to delete out of range element Assert.WillRaise(procedure begin array1.Delete(0); end, ERangeError, 'DeleteCalue at 0'); // try to delete out of range element for I := 1 to 5 do begin v := i + 1; array1.Add(@v); end; Assert.AreEqual(5, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(1); Assert.AreEqual(4, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(1); Assert.AreEqual(3, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(1); Assert.AreEqual(2, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(1); Assert.AreEqual(1, array1.Count); Assert.AreEqual(8, array1.Capacity); Assert.WillRaise(procedure begin array1.Delete(1); end, ERangeError, 'DeleteCalue at 0'); // try to delete out of range element Assert.AreEqual(1, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Clear; for I := 1 to 5 do begin v := i + 1; array1.Add(@v); end; Assert.AreEqual(5, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(array1.Count - 1); Assert.AreEqual(4, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(array1.Count - 1); Assert.AreEqual(3, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(array1.Count - 1); Assert.AreEqual(2, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(array1.Count - 1); Assert.AreEqual(1, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Delete(array1.Count - 1); Assert.AreEqual(0, array1.Count); Assert.AreEqual(8, array1.Capacity); Assert.WillRaise(procedure begin array1.Delete(array1.Count); end, ERangeError, 'DeleteCalue at 0'); // try to delete out of range element Assert.AreEqual(0, array1.Count); Assert.AreEqual(8, array1.Capacity); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestIndexOf1; var v, vv, vvv: InnerT; begin v := 777; vv := 4; vvv := 0; Assert.AreEqual(-1, array1.IndexOf(nil)); Assert.AreEqual(-1, array1.IndexOf(@v)); Assert.AreEqual(-1, array1.IndexOfFrom(nil, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(nil, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(nil, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(nil, 1000)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 1000)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 1000)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 1000)); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestIndexOf2(const AValue1, AValue2, AValue3, AValue4: Integer); var v, vv, vvv, vcmp: InnerT; Ind: Cardinal; bvvv : Boolean absolute vvv; begin Assert.AreNotEqual(AValue1, AValue2, 'AValue1 and AValue2 must not be equal in TestIndexOf2()!'); if IsTTUnsigned AND ((AValue1 < 0) OR (AValue2 < 0) OR (AValue3 < 0)) then Exit; v := AValue1; vv := AValue2; vvv := AValue3; Ind := array1.Add(@v); Assert.AreEqual(0, Ind); array1.Get(Ind, @vcmp); Assert.AreEqual<InnerT>(v, vcmp); Assert.AreEqual(array1.IndexOf(@vcmp), array1.IndexOf(@v)); Ind := array1.Add(@vv); Assert.AreEqual(1, Ind); array1.Get(Ind, @vcmp); Assert.AreEqual<InnerT>(vv, vcmp); Assert.AreEqual(array1.IndexOf(@vcmp), array1.IndexOf(@vv)); { if IsTTBoolean() then begin Assert.AreEqual(AValue4, array1.IndexOfFrom(true, 0)); // Assert.AreEqual(AValue4, array1.IndexOfFrom(true, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(true, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(true, 333)); Assert.AreEqual(AValue4, array1.IndexOfFrom(true, 0)); // Assert.AreEqual(AValue4, array1.IndexOfFrom(vv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(true, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(true, 333)); Assert.AreEqual(true, bvvv); Assert.AreEqual(AValue4, array1.IndexOf(vvv)); Assert.AreEqual(AValue4, array1.IndexOfFrom(vvv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(vvv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(vvv, 333)); end else begin } // classes (e.g. TObject) cannot be compared by Assert.AreEqual<TTestArr> because it calls v.Equals(vv) // while v and vv are fake instances of TObject and calling any method raises an exception // if GetTypeKind(TTestArr) = tkClass // then Assert.AreEqual(CreateInteger<TTestArr>(v), CreateInteger<TTestArr>(vv)) // else Assert.AreEqual(0, array1.IndexOfFrom(@v, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 333)); Assert.AreEqual(1, array1.IndexOfFrom(@vv, 0)); Assert.AreEqual(1, array1.IndexOfFrom(@vv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 333)); Assert.AreEqual(-1, array1.IndexOf(@vvv)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 333)); // end; {if GetTypeKind(TTestArr) = tkClass then begin // for non-Class types nil is converted into 0 (zero) and produces incorrect assert results when AValue1 or Avalue2 is also = 0. Assert.AreEqual(-1, array1.IndexOfFrom(nil, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(nil, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(nil, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(nil, 555)); end;} end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestInsert1; var I: Integer; val, val2: InnerT; begin for I := 0 to 99 do begin val := i + 1000; array1.Insert(0, @val); array2.Insert(0, @val); if array1.Count < 4 then Assert.AreEqual(4, array1.Capacity); if (array1.Count >= 4) AND (array1.Count < 8) then Assert.AreEqual(8, array1.Capacity); if (array1.Count >= 8) AND (array1.Count < 12) then Assert.AreEqual(12, array1.Capacity); if (array1.Count >= 12) AND (array1.Count < 28) then Assert.AreEqual(28, array1.Capacity); if (array1.Count >= 28) AND (array1.Count < 44) then Assert.AreEqual(44, array1.Capacity); if (array1.Count >= 44) AND (array1.Count < 60) then Assert.AreEqual(60, array1.Capacity); if (array1.Count >= 60) AND (array1.Count < 76) then Assert.AreEqual(76, array1.Capacity); if (array1.Count >= 76) AND (array1.Count < 95) then Assert.AreEqual(95, array1.Capacity); if (array1.Count >= 95) then Assert.AreEqual(118, array1.Capacity); end; Assert.AreEqual(118, array1.Capacity); Assert.AreEqual(118, array2.Capacity); Assert.AreEqual(100, array1.Count); Assert.AreEqual(100, array2.Count); for I := 0 to 99 do begin array1.Get(i, @val); val2 := 1100 - I - 1; Assert.AreEqual<InnerT>(val2, val); end end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestInsert2; var //I: Integer; v1, v2,v3, vv: InnerT; begin v1 := 111; v2 := 222; v3 := 333; array1.Add(@v1); Assert.AreEqual(4, array1.Capacity); array1.Add(@v3); Assert.AreEqual(4, array1.Capacity); array1.Insert(1, @v2); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @v1); vv := 111; Assert.AreEqual<InnerT>(vv, v1); array1.Get(1, @v1); vv := 222; Assert.AreEqual<InnerT>(vv, v1); array1.Get(2, @v1); vv := 333; Assert.AreEqual<InnerT>(vv, v1); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestQuickFind(AValue1, AValue2, AValue3: string); var token: string; I, Cnt: Integer; FindVal, valTmp: InnerT; begin if IsTTUnsigned AND (StrToInt(Trim(AValue2)) < 0) then Exit; Cnt := HGetTokenCount(AValue1, ';', False); for I := 1 to Cnt do begin token := HGetToken(AValue1, ';', False, i - 1); valTmp := StrToInt(Trim(token)); array1.Add(@valTmp); end; array1.QuickSort(Compare1); VerifySorting(array1); FindVal := StrToInt(Trim(AValue2)); Assert.AreEqual(StrToInt(Trim(AValue3)), array1.QuickFind(FindProc, @FindVal)); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestQuickSort1; var v, v2: InnerT; begin Assert.AreEqual(0, array1.Count); array1.QuickSort(nil); // array is empty so QuickSort will NOT generate an exception that CompareProc is not set. v := 9; array1.Add(@v); array1.QuickSort(nil); // array contains one element so QuickSort will NOT generate an exception that CompareProc is not set. array1.Add(@v); try array1.QuickSort(nil); // here will be exception because array is NOT empty Assert.Fail('We should not be here!'); except on E:Exception do Assert.AreEqual('Cannot sort without CompareProc!', e.Message) end; array1.Clear; array1.QuickSort(Compare1); Assert.AreEqual(0, array1.Count); v := 4; array1.Add(@v); v := 3; array1.Add(@v); v := 5; array1.Add(@v); v := 7; array1.Add(@v); array1.QuickSort(Compare1); array1.Get(0, @v); v2 := 3; Assert.AreEqual<InnerT>(v2, v); array1.Get(1, @v); v2 := 4; Assert.AreEqual<InnerT>(v2, v); array1.Get(2, @v); v2 := 5; Assert.AreEqual<InnerT>(v2, v); array1.Get(3, @v); v2 := 7; Assert.AreEqual<InnerT>(v2, v); array1.Clear; v := 4; array1.Add(@v); v := 3; array1.Add(@v); v := 7; array1.Add(@v); v := 6; array1.Add(@v); array1.QuickSort(Compare1); array1.Get(0, @v); v2 := 3; Assert.AreEqual<InnerT>(v2, v); array1.Get(1, @v); v2 := 4; Assert.AreEqual<InnerT>(v2, v); array1.Get(2, @v); v2 := 6; Assert.AreEqual<InnerT>(v2, v); array1.Get(3, @v); v2 := 7; Assert.AreEqual<InnerT>(v2, v); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestQuickSort2(AValue1, AValue2: string); var Cnt: Integer; I: Integer; token: string; v: InnerT; cmp: IComparer<TTestArr>; begin cmp := TComparer<TTestArr>.Default; Cnt := HGetTokenCount(AValue1, ';', False); for I := 1 to Cnt do begin token := HGetToken(AValue1, ';', False, i - 1); v := StrToInt(Trim(token)); array1.Add(@v); end; array1.QuickSort(Compare1); VerifySorting(array1); Assert.Pass('TestQuickSort2: success.'); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestSort1; var v, v3, v4, v5, v7: InnerT; begin // if GetTypeKind(TTestArr) in FComparableTypes then // begin Assert.AreEqual(0, array1.Count); array1.SelectionSort(nil); // no exception if CompareProc=nil and array contains <2 elements v5 := 5; array1.Add(@v4); Assert.AreEqual(1, array1.Count); array1.SelectionSort(nil); // no exception if CompareProc=nil and array contains <2 elements array1.Clear; Assert.AreEqual(0, array1.Count); array1.SelectionSort(Compare1); Assert.AreEqual(0, array1.Count); v5 := 5; array1.Add(@v4); Assert.AreEqual(1, array1.Count); array1.SelectionSort(Compare1); array1.Clear; v4 := 4; v3 := 3; v7 := 7; v5 := 5; array1.Add(@v4); array1.Add(@v3); array1.Add(@v7); array1.Add(@v5); try array1.SelectionSort(nil); except on E:Exception do Assert.AreEqual('Cannot sort without CompareProc!', E.Message); end; array1.Clear; array1.Add(@v4); array1.Add(@v3); array1.Add(@v7); array1.Add(@v5); array1.SelectionSort(Compare1); array1.Get(0, @v); Assert.AreEqual<InnerT>(v3, v); array1.Get(1, @v); Assert.AreEqual<InnerT>(v4, v); array1.Get(2, @v); Assert.AreEqual<InnerT>(v5, v); array1.Get(3, @v); Assert.AreEqual<InnerT>(v7, v); // end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestSort2(AValue1, AValue2: string); var token: string; valTmp: InnerT; I: Integer; cmp: IComparer<InnerT>; begin cmp := TComparer<InnerT>.Default; for I := 1 to HGetTokenCount(AValue1, ';', False) do begin token := HGetToken(AValue1, ';', False, i - 1); valTmp := StrToInt(Trim(token)); array1.Add(@valTmp); end; array1.SelectionSort(Compare1); VerifySorting(array1); //for I := 1 to array1.Count - 1 do // Assert.isTrue(cmp.Compare(array1[i-1], array1[i]) <= 0); // if Avalue1 and Avalue2 contain only one value then no Assert.isTrue called in for loop above. // and DUnitX generates a warning "No assertion were made duringhe test" // to eliminate such warning Assert.Pass is added below Assert.Pass('TestSort2: success.'); end; procedure TDynamicArraysTest<TTestArr, InnerT>.VerifySorting(arr: TTestArr); var i: Cardinal; v, vv: InnerT; cmp: IComparer<InnerT>; begin cmp := TComparer<InnerT>.Default; for i := 1 to arr.Count - 1 do begin arr.Get(i - 1, @v); arr.Get(i, @vv); Assert.IsTrue(cmp.Compare(v, vv) <= 0, '*** Array is NOT sorted ***'); end; //Assert.Pass('VerifySorting: Array is properly sorted.'); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestQuickSortPerformance; var i: Integer; r: InnerT; begin // if GetTypeKind(TTestArr) in FComparableTypes then begin array1.SetCapacity(ARRAYSIZE_FOR_SORTING); for i := 0 to ARRAYSIZE_FOR_SORTING - 1 do begin r := random(10_000); array1.Add(@r); end; var start := GetTickCount; array1.QuickSort(Compare1); TDUnitX.CurrentRunner.Log(Format('QuickSort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array1); // end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestBubbleSortPerformance; var i: Integer; r: InnerT; begin array1.SetCapacity(ARRAYSIZE_FOR_SORTING); for i := 0 to ARRAYSIZE_FOR_SORTING - 1 do begin r := random(10_000); array1.Add(@r); end; var start := GetTickCount; array1.BubbleSort(Compare1); TDUnitX.CurrentRunner.Log(Format('BubbleSort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array1); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestSortPerformance; var i: Integer; r: InnerT; begin //if GetTypeKind(TTestArr) in FComparableTypes then begin array1.SetCapacity(ARRAYSIZE_FOR_SORTING); for i := 0 to ARRAYSIZE_FOR_SORTING - 1 do begin r := random(10_000); array1.Add(@r); end; var start := GetTickCount; array1.SelectionSort(Compare1); TDUnitX.CurrentRunner.Log(Format('Sort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array1); // end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.CopyArray(arr1, arr2: TTestingArrayType); var i: Cardinal; v: InnerT; begin arr2.Clear; arr2.SetCapacity(arr1.Capacity); for i := 0 to arr1.Count - 1 do begin arr1.Get(i, @v); arr2.Add(@v); end; end; { procedure TDynamicArraysTest<TTestArr, InnerT>.TestAllSortAlgsPerformance; var i: Integer; begin if GetTypeKind(TTestArr) in FComparableTypes then begin array1.SetCapacity(ARRAYSIZE_FOR_SORTING); // then same initial array for all algs for i := 0 to ARRAYSIZE_FOR_SORTING - 1 do begin var r := random(32_767); array1.AddValue(CreateValue<TTestArr>(r)); end; // we will be sorting array2 CopyArray(array1, array2); var start := GetTickCount; array2.BubbleSort(nil); TDUnitX.CurrentRunner.Log(Format('BubbleSort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array2); CopyArray(array1, array2); start := GetTickCount; array2.SelectionSort(nil); TDUnitX.CurrentRunner.Log(Format('SelectingSort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array2); CopyArray(array1, array2); start := GetTickCount; array2.InsertSort(nil); TDUnitX.CurrentRunner.Log(Format('InsertSort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array2); CopyArray(array1, array2); start := GetTickCount; array2.ShakerSort(nil); TDUnitX.CurrentRunner.Log(Format('ShakerSort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array2); CopyArray(array1, array2); start := GetTickCount; array2.QuickSort(nil); TDUnitX.CurrentRunner.Log(Format('QuiuckSort(%d) = %s', [ARRAYSIZE_FOR_SORTING, MillisecToStr(GetTickCount - start)])); VerifySorting(array2); end; end; } procedure TDynamicArraysTest<TTestArr, InnerT>.TestCapacity1; begin Assert.AreEqual(0, array1.Capacity); array1.SetCapacity(1); Assert.AreEqual(1, array1.Capacity); Assert.AreEqual(0, array1.Count); array1.SetCapacity(0); Assert.AreEqual(0, array1.Capacity); array1.SetCapacity(2); Assert.AreEqual(2, array1.Capacity); Assert.AreEqual(0, array1.Count); array1.SetCapacity(3); Assert.AreEqual(3, array1.Capacity); Assert.AreEqual(0, array1.Count); array1.SetCapacity(100_000_000); Assert.AreEqual(100_000_000, array1.Capacity); Assert.AreEqual(0, array1.Count); array1.SetCapacity(0); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(0, array1.Count); array1.SetCapacity(100); Assert.AreEqual(100, array1.Capacity); Assert.AreEqual(0, array1.Count); //array1.Zero; //Assert.AreEqual(100, array1.Capacity); array1.Clear(); Assert.AreEqual(100, array1.Capacity); array1.Hold; Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(0, array1.Count); array1.SetCapacity(200); array1.ClearMem(); Assert.AreEqual(0, array1.Capacity); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestCapacity2; var i: Integer; v: InnerT; begin for i := 0 to 499 do begin v := i; array1.Add(@v); end; Assert.AreEqual(556, array1.Capacity); array1.Hold(); Assert.AreEqual(500, array1.Capacity); array1.SetCapacity(600); Assert.AreEqual(600, array1.Capacity); Assert.AreEqual(500, array1.Count); array1.SetCapacity(400); Assert.AreEqual(400, array1.Capacity); Assert.AreEqual(400, array1.Count); array1.SetCapacity(0); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(0, array1.Count); end; function TDynamicArraysTest<TTestArr, InnerT>.Compare1(arr: THArray; i, j: Cardinal): Integer; const cmp: IComparer<InnerT> = nil; // analogue of static variable which saves its value between function calls var v1, v2: InnerT; begin if NOT Assigned(cmp) then cmp := TComparer<InnerT>.Default; // should be called only once arr.Get(i, @v1); arr.Get(j, @v2); Result := cmp.Compare(v1, v2); end; function TDynamicArraysTest<TTestArr, InnerT>.FindProc(arr: THArray; i: Cardinal; FindData: Pointer): Integer; const cmp: IComparer<InnerT> = nil; // analogue of static variable which saves its value between function calls type PInnerT = ^InnerT; var v1, v2: InnerT; begin if NOT Assigned(cmp) then cmp := TComparer<InnerT>.Default; // should be called only once v1 := PInnerT(FindData)^; arr.Get(i, @v2); Result := cmp.Compare(v1, v2); end; function TDynamicArraysTest<TTestArr, InnerT>.Compare2(Item1, Item2: InnerT): Integer; const cmp: IComparer<InnerT> = nil; // analogue of static variable which saves its value between function calls begin if NOT Assigned(cmp) then cmp := TComparer<InnerT>.Default; // should be called only once Result := cmp.Compare(Item1, Item2); end; function TDynamicArraysTest<TTestArr, InnerT>.IsTTBoolean: Boolean; var TypeInfoPtr: PTypeInfo; begin TypeInfoPtr := TypeInfo(TTestArr); Result := (GetTypeKind(TTestArr) = tkEnumeration) AND (TypeInfoPtr.Name = 'Boolean'); end; function TDynamicArraysTest<TTestArr, InnerT>.IsTTUnsigned: Boolean; var TypeInfoPtr: PTypeInfo; begin TypeInfoPtr := TypeInfo(InnerT); Result := (GetTypeKind(InnerT) = tkInteger) AND ((TypeInfoPtr.Name = 'Cardinal') OR (TypeInfoPtr.Name = 'LongWord') OR (TypeInfoPtr.Name = 'Word') OR (TypeInfoPtr.Name = 'NativeUint')); Result := Result OR ((GetTypeKind(InnerT) = tkInt64) AND (TypeInfoPtr.Name = 'UInt64')); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestAddClearAdd1; var I: Integer; v, v2: InnerT; begin for I := 5 to 9 do begin v := I; array1.Insert(array1.Count, @v); array2.Insert(array2.Count, @v); end; Assert.AreEqual(8, array1.Capacity); Assert.AreEqual(8, array2.Capacity); Assert.AreEqual(5, array1.Count); Assert.AreEqual(5, array2.Count); array1.ClearMem; array2.ClearMem; Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array2.Count); Assert.AreEqual(0, array1.Capacity); Assert.AreEqual(0, array2.Capacity); for I := 15 to 19 do begin v := I; array1.Insert(array1.Count, @v); array2.Insert(array2.Count, @v); end; Assert.AreEqual(8, array1.Capacity); Assert.AreEqual(8, array2.Capacity); Assert.AreEqual(5, array1.Count); Assert.AreEqual(5, array2.Count); for I := 0 to 4 do begin array2.Get(I, @v); v2 := I + 15; Assert.AreEqual<InnerT>(v2, v); end; for I := 0 to 4 do begin array2.Get(I, @v2); array1.Get(I, @v); Assert.AreEqual<InnerT>(v2, v); end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestAddClearAdd2; var I: Integer; v, v2: InnerT; begin if IsTTUnsigned then Exit; for I := -9 to -5 do begin v := I; array1.Insert(array1.Count, @v); array2.Insert(array2.Count, @v); end; Assert.AreEqual(8, array1.Capacity); Assert.AreEqual(8, array2.Capacity); Assert.AreEqual(5, array1.Count); Assert.AreEqual(5, array2.Count); array1.Clear; array2.Clear; Assert.AreEqual(8, array1.Capacity); Assert.AreEqual(8, array2.Capacity); Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array2.Count); for I := -19 to -15 do begin v := I; array1.Insert(array1.Count, @v); array2.Insert(array2.Count, @v); end; Assert.AreEqual(8, array1.Capacity); Assert.AreEqual(8, array2.Capacity); Assert.AreEqual(5, array1.Count); Assert.AreEqual(5, array2.Count); for I := 0 to 4 do begin array2.Get(I, @v); v2 := I - 19; Assert.AreEqual<InnerT>(v2, v); end; for I := 0 to 4 do begin array2.Get(I, @v2); array1.Get(I, @v); Assert.AreEqual<InnerT>(v2, v); end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestAddMany; var val, valTmp: InnerT; val1, val2, val3: InnerT; arr: TArray<InnerT>; begin val := 999; //CreateValue<TTestArr>(999); array1.AddMany(@val, 0); Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); array1.AddMany(nil, 0); Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); array1.AddMany(@val, 1); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Clear; SetLength(arr, 4); arr[0] := val; arr[1] := val; arr[2] := val; arr[3] := val; array1.AddMany(@(arr[0]), 4); Assert.AreEqual(4, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(3, @valTmp); Assert.AreEqual<InnerT>(val, valTMp); array1.Clear; val1 := 44; val2 := 105; val3 := 909; array1.Add(@val1); array1.Add(@val2); array1.Add(@val3); Assert.AreEqual(3, array1.Count); Assert.AreEqual(4, array1.Capacity); SetLength(arr, 5); arr[4] := val; array1.AddMany(@(arr[0]), 5); Assert.AreEqual(8, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val3, valTmp); array1.Get(3, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(4, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(5, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(6, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(7, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Clear; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestAddFillValues; var i: Integer; val, valTmp: InnerT; begin array1.AddFillValues(0); Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); array1.AddFillValues(1); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); val := 0; Assert.AreEqual<InnerT>(val, valTmp); array1.AddFillValues(4); Assert.AreEqual(5, array1.Count); Assert.AreEqual(8, array1.Capacity); val := 0; for i := 0 to 4 do begin array1.Get(i, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestInsertMany; var val, valTmp: InnerT; val1, val2, val3: InnerT; arr: TArray<InnerT>; begin val := 999; array1.InsertMany(0, @val, 0); array1.InsertMany(1, @val, 0); Assert.AreEqual(0, array1.Count); Assert.AreEqual(0, array1.Capacity); array1.InsertMany(0, @val, 1); Assert.AreEqual(1, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Clear; SetLength(arr, 4); arr[0] := val; arr[1] := val; arr[2] := val; arr[3] := val; array1.InsertMany(0, @(arr[0]), 4); Assert.AreEqual(4, array1.Count); Assert.AreEqual(4, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(3, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Clear; val1 := 44; val2 := 105; val3 := 909; array1.Add(@val1); array1.Add(@val2); array1.Add(@val3); Assert.AreEqual(3, array1.Count); Assert.AreEqual(4, array1.Capacity); SetLength(arr, 5); arr[4] := val; array1.InsertMany(1, @arr[0], 5); Assert.AreEqual(8, array1.Count); Assert.AreEqual(8, array1.Capacity); array1.Get(0, @valTmp); Assert.AreEqual<InnerT>(val1, valTmp); array1.Get(1, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(2, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(3, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(4, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(5, @valTmp); Assert.AreEqual<InnerT>(val, valTmp); array1.Get(6, @valTmp); Assert.AreEqual<InnerT>(val2, valTmp); array1.Get(7, @valTmp); Assert.AreEqual<InnerT>(val3, valTmp); array1.InsertMany(0, @arr[0], 5); Assert.AreEqual(13, array1.Count); Assert.AreEqual(13, array1.Capacity); array1.InsertMany(1, @arr[0], 5); Assert.AreEqual(18, array1.Count); Assert.AreEqual(29, array1.Capacity); array1.InsertMany(array1.Count, @arr[0], 5); Assert.AreEqual(23, array1.Count); Assert.AreEqual(29, array1.Capacity); Assert.WillRaise(procedure begin array1.InsertMany(array1.Count + 1, @arr[0], 5) end, ERangeError, 'insertMany1'); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestAddTwoDiff(const AValue1, AValue2 : Integer); var v, vv, vvv, vTmp: InnerT; cmp: IComparer<InnerT>; begin if IsTTUnsigned AND ((AValue1 < 0) OR (AValue2 < 0)) then Exit; Assert.AreNotEqual(AValue1, AValue2, 'AValue1 and AValue2 must be not equal in TestAddTwoDiff()!'); v := AValue1; vv := AValue2; array1.Add(@v); array1.Add(@vv); array1.Get(0, @vTmp); Assert.AreEqual<InnerT>(v, vTmp); array1.Get(1, @vTmp); Assert.AreEqual<InnerT>(vv, vTmp); array1.Get(0, @vTmp); Assert.AreEqual<InnerT>(v, vTmp); Assert.WillRaise(procedure begin array1.GetAddr(2) end, ERangeError, 'get2'); Assert.WillRaise(procedure begin array1.GetAddr(3) end, ERangeError, 'get3'); Assert.WillRaise(procedure begin array1.GetAddr(11) end, ERangeError, 'get11'); Assert.AreEqual(0, array1.IndexOf(@v)); Assert.AreEqual(1, array1.IndexOf(@vv)); Assert.AreEqual(0, array1.IndexOfFrom(@v, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 3)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 555)); Assert.AreEqual(1, array1.IndexOfFrom(@vv, 0)); Assert.AreEqual(1, array1.IndexOfFrom(@vv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 3)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 555)); cmp := TComparer<InnerT>.Default; if (AValue1 <> 0) AND (AValue2 <> 0) then begin vvv := AValue1 + AValue2; if (cmp.Compare(vvv, v) <> 0) AND (cmp.Compare(vvv, vv) <> 0) then Assert.AreEqual(-1, array1.IndexOf(@vvv)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 555)); vvv := AValue1 - AValue2; if (cmp.Compare(vvv, v) <> 0) AND (cmp.Compare(vvv, vv) <> 0) then Assert.AreEqual(-1, array1.IndexOf(@vvv)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 555)); end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestAddTwoEqual(const AValue1, AValue2: Integer); var v,vv,vvv, vTmp: InnerT; s: string absolute v; ss: string absolute vv; cmp: IComparer<InnerT>; begin Assert.AreEqual(AValue1, AValue2, 'AValue1 and AValue2 must be equal in TestAddTwoEqual()!'); v := AValue1; vv := AValue2; array1.Add(@v); array1.Add(@vv); Assert.AreEqual<InnerT>(v, vv); array1.Get(1, @vTmp); Assert.AreEqual<InnerT>(v, vTmp); array1.Get(0, @vTmp); Assert.AreEqual<InnerT>(vv, vTmp); Assert.AreEqual(0, array1.IndexOf(@v)); Assert.AreEqual(0, array1.IndexOf(@vv)); array1.Get(0, @vTmp); Assert.AreEqual<InnerT>(v, vTmp); array1.Get(1, @vTmp); Assert.AreEqual<InnerT>(vv, vTmp); Assert.WillRaise(procedure begin array1.GetAddr(2) end, ERangeError, 'get2'); Assert.WillRaise(procedure begin array1.GetAddr(3) end, ERangeError, 'get3'); Assert.WillRaise(procedure begin array1.GetAddr(66) end, ERangeError, 'get66'); Assert.AreEqual(0, array1.IndexOfFrom(@v, 0)); Assert.AreEqual(1, array1.IndexOfFrom(@v, 1)); Assert.AreEqual(0, array1.IndexOfFrom(@vv, 0)); Assert.AreEqual(1, array1.IndexOfFrom(@vv, 1)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 3)); Assert.AreEqual(-1, array1.IndexOfFrom(@v, 555)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 3)); Assert.AreEqual(-1, array1.IndexOfFrom(@vv, 555)); cmp := TComparer<InnerT>.Default; if AValue1 <> 0 then begin vvv := AValue1 + AValue2; if (cmp.Compare(vvv, v) <> 0) AND (cmp.Compare(vvv, vv) <> 0) then begin Assert.AreEqual(-1, array1.IndexOf(@vvv)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 1)); end; Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 555)); vvv := AValue1 - AValue2; if (cmp.Compare(vvv, v) <> 0) AND (cmp.Compare(vvv, vv) <> 0) then begin Assert.AreEqual(-1, array1.IndexOf(@vvv)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 0)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 1)); end; Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 2)); Assert.AreEqual(-1, array1.IndexOfFrom(@vvv, 555)); end; end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestGrow; var i: Integer; v: InnerT; begin Assert.AreEqual(0, array1.Capacity); v := 11; array1.Add(@v); Assert.AreEqual(4, array1.Capacity); v := 22; array1.Add(@v); v := 33; array1.Add(@v); Assert.AreEqual(4, array1.Capacity); v := 44; array1.Add(@v); Assert.AreEqual(8, array1.Capacity); v := 11; array1.Add(@v); v := 55; array1.Add(@v); v := 66; array1.Add(@v); v := 77; array1.Add(@v); Assert.AreEqual(12, array1.Capacity); v := 11; array1.Add(@v); Assert.AreEqual(12, array1.Capacity); Assert.AreEqual(9, array1.Count); for i := 0 to 2 do begin v := i + 11; array1.Add(@v); end; Assert.AreEqual(28, array1.Capacity); for i := 0 to 15 do begin v := i + 11; array1.Add(@v); end; Assert.AreEqual(28, array1.Count); Assert.AreEqual(44, array1.Capacity); for i := 0 to 15 do begin v := i + 11; array1.Add(@v); end; Assert.AreEqual(44, array1.Count); Assert.AreEqual(60, array1.Capacity); for i := 0 to 15 do begin v := i + 11; array1.Add(@v); end; Assert.AreEqual(60, array1.Count); Assert.AreEqual(76, array1.Capacity); for i := 0 to 15 do begin v := i + 11; array1.Add(@v); end; Assert.AreEqual(76, array1.Count); Assert.AreEqual(95, array1.Capacity); for i := 0 to 18 do begin v := i + 11; array1.Add(@v); end; Assert.AreEqual(95, array1.Count); Assert.AreEqual(118, array1.Capacity); array1.Clear(); Assert.AreEqual(0, array1.Count); Assert.AreEqual(118, array1.Capacity); array1.GrowTo(100); Assert.AreEqual(0, array1.Count); Assert.AreEqual(118, array1.Capacity); end; procedure TDynamicArraysTest<TTestArr, InnerT>.TestHGetToken1; var flag: Boolean; begin for flag := False to True do begin Assert.AreEqual(0, HGetTokenCount('', '', flag)); Assert.AreEqual(1, HGetTokenCount('a', '', flag)); Assert.AreEqual('a', HGetToken('a', '', flag, 0)); Assert.AreEqual(1, HGetTokenCount('abc', '', flag)); Assert.AreEqual('abc', HGetToken('abc', '', flag, 0)); Assert.AreEqual(0, HGetTokenCount('', '.', flag)); Assert.AreEqual(0, HGetTokenCount('', '..', flag)); Assert.AreEqual(0, HGetTokenCount('', 'a', flag)); Assert.AreEqual(2, HGetTokenCount('a c', ' ', flag)); Assert.AreEqual('a', HGetToken('a c', ' ', flag, 0)); Assert.AreEqual('c', HGetToken('a c', ' ', flag, 1)); Assert.AreEqual(2, HGetTokenCount('a c', ' ', flag)); Assert.AreEqual('a', HGetToken('a c', ' ', flag, 0)); Assert.AreEqual('c', HGetToken('a c', ' ', flag, 1)); Assert.AreEqual(1, HGetTokenCount(';a c;', ';', flag)); Assert.AreEqual('a c', HGetToken(';a c;', ';', flag, 0)); Assert.AreEqual(2, HGetTokenCount(';a;c;', ';;', flag)); Assert.AreEqual('a', HGetToken(';a;c;', ';;', flag, 0)); Assert.AreEqual('c', HGetToken(';a;c;', ';;', flag, 1)); Assert.AreEqual(2, HGetTokenCount('auto;moto velo foto;', ';', flag)); Assert.AreEqual('auto', HGetToken('auto;moto velo foto;', ';', flag, 0)); Assert.AreEqual('moto velo foto', HGetToken('auto;moto velo foto;', ';', flag, 1)); Assert.AreEqual(3, HGetTokenCount('auto;moto velo foto;.', ';', flag)); Assert.AreEqual('auto', HGetToken('auto;moto velo foto;.', ';', flag, 0)); Assert.AreEqual('moto velo foto', HGetToken('auto;moto velo foto;.', ';', flag, 1)); Assert.AreEqual('.', HGetToken('auto;moto velo foto;.', ';', flag, 2)); end; Assert.AreEqual(2, HGetTokenCount(';;a;;c;;', ';', False)); Assert.AreEqual('a', HGetToken(';;a;;c;;', ';', False, 0)); Assert.AreEqual('c', HGetToken(';;a;;c;;', ';', False, 1)); Assert.AreEqual(4, HGetTokenCount(';;a;;c;;', ';', True)); Assert.AreEqual('a', HGetToken(';;a;;c;;', ';', True, 0)); Assert.AreEqual('', HGetToken(';;a;;c;;', ';', True, 1)); Assert.AreEqual('c', HGetToken(';;a;;c;;', ';', True, 2)); Assert.AreEqual('', HGetToken(';;a;;c;;', ';', True, 3)); Assert.AreEqual(2, HGetTokenCount(';.a;;c..', ';.', False)); Assert.AreEqual('a', HGetToken(';.a;;c..', ';.', False, 0)); Assert.AreEqual('c', HGetToken(';.a;;c..', ';.', False, 1)); Assert.AreEqual(4, HGetTokenCount(';.a;;c..', ';.', True)); Assert.AreEqual('a', HGetToken(';.a;;c.', ';.', True, 0)); Assert.AreEqual('', HGetToken(';.a;;c..', ';.', True, 1)); Assert.AreEqual('c', HGetToken(';.a;;c..', ';.', True, 2)); Assert.AreEqual('', HGetToken(';.a;;c..', ';.', True, 3)); end; initialization Randomize; // need for testing sorting algs performance // TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArrayStringFix, Integer>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArrayInteger, Integer>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArraySmallInt, SmallInt>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArrayLongWord, LongWord>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArrayWord, Word>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArrayInt64, Int64>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArrayUInt64, UInt64>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THarrayDouble, Double>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THarrayCurrency, Currency>); TDUnitX.RegisterTestFixture(TDynamicArraysTest<THarrayExtended, Extended>); // TDUnitX.RegisterTestFixture(TDynamicArraysTest<THarrayPointer, Pointer>); // TDUnitX.RegisterTestFixture(TDynamicArraysTest<THarrayObjects, TObject>); // TDUnitX.RegisterTestFixture(TDynamicArraysTest<THArrayByte, Byte>); // TDUnitX.RegisterTestFixture(TDynamicArraysTest<THarrayBoolean, Boolean>); end.