Execution Time0.28s

Test: test-tcollex (Passed)
Build: master-aarch64-centos7-gcc48 (techlab-arm64-moonshot-xgene-004) on 2019-11-14 00:49:23
Repository revision: 32b17abcda23e44b64218a42d0ca69cb30cda7e0

Test Timing: Passed
Processors1

Show Command Line
Display graphs:

Test output
////////////////////////////////////////////////////////////////
// Test of TObjArray                                          //
////////////////////////////////////////////////////////////////
Filling TObjArray
Print array
Collection name='TObjArray', class='TObjArray', size=10
 TObjNum = 1
 TObjNum = 2
 TObjNum = 3
 TObjNum = 4
 TObjNum = 10
 TObjNum = 6
 TObjNum = 5
 TObjNum = 8
 TObjNum = 7
Sort array
TObjNum = 1
TObjNum = 2
TObjNum = 3
TObjNum = 4
TObjNum = 5
TObjNum = 6
TObjNum = 7
TObjNum = 8
TObjNum = 10
9 empty slot
Use binary search to get position of number 6
Error in <TObjArray::BinarySearch>: array must first be sorted
6 is at position -1
Find number before 6
TObjNum = 5
Find number after 3
TObjNum = 4
Remove 3 and print list again
~TObjNum = 3
Collection name='TObjArray', class='TObjArray', size=10
 TObjNum = 1
 TObjNum = 2
 TObjNum = 4
 TObjNum = 5
 TObjNum = 6
 TObjNum = 7
 TObjNum = 8
 TObjNum = 10
Iterate forward over list and remove 4 and 7
~TObjNum = 4
~TObjNum = 7
Iterate backward over list and remove 2
~TObjNum = 2
Delete remainder of list: 1,5,8,10 (6 not deleted since not on heap)
~TObjNum = 1
~TObjNum = 5
~TObjNum = 8
~TObjNum = 10
Delete stack based objects (6)
~TObjNum = 6
////////////////////////////////////////////////////////////////
// Test of TOrdCollection                                     //
////////////////////////////////////////////////////////////////
Filling TOrdCollection
Print collection
Collection name='TOrdCollection', class='TOrdCollection', size=7
 TObjString = bobo
 TObjString = fons
 TObjString = damon
 TObjString = gaia
 TObjString = anton
 TObjString = cassius
 TObjString = enigma
Sort collection
Collection name='TOrdCollection', class='TOrdCollection', size=7
 TObjString = anton
 TObjString = bobo
 TObjString = cassius
 TObjString = damon
 TObjString = enigma
 TObjString = fons
 TObjString = gaia
Use binary search to get position of string damon
damon is at position 3
Find str before fons
TObjString = enigma
Find string after damon
TObjString = enigma
Remove damon and print list again
Collection name='TOrdCollection', class='TOrdCollection', size=6
 TObjString = anton
 TObjString = bobo
 TObjString = cassius
 TObjString = enigma
 TObjString = fons
 TObjString = gaia
Iterate forward over list and remove cassius
Iterate backward over list and remove gaia
Delete remainder of list: anton,bobo,enigma (fons not deleted since not on heap)
Delete stack based objects (fons)
////////////////////////////////////////////////////////////////
// Test of TList                                              //
////////////////////////////////////////////////////////////////
Filling TList
Print list
Collection name='TList', class='TList', size=6
 TObjNum = 6
 TObjNum = 5
 TObjNum = 4
 TObjNum = 3
 TObjNum = 2
 TObjNum = 1
Remove 3 and print list again
~TObjNum = 3
Collection name='TList', class='TList', size=5
 TObjNum = 6
 TObjNum = 5
 TObjNum = 4
 TObjNum = 2
 TObjNum = 1
Iterate forward over list and remove 4
Iterate backward over list and remove 2
~TObjNum = 2
Delete remainder of list: 1, 5 (6 not deleted since not on heap)
~TObjNum = 5
~TObjNum = 1
Delete stack based objects (6)
~TObjNum = 6
////////////////////////////////////////////////////////////////
// Test of TSortedList                                        //
////////////////////////////////////////////////////////////////
Filling TSortedList
Print list
Collection name='TSortedList', class='TSortedList', size=6
 TObjNum = 1
 TObjNum = 2
 TObjNum = 3
 TObjNum = 4
 TObjNum = 5
 TObjNum = 6
Delete all heap based objects (6 not deleted since not on heap)
~TObjNum = 1
~TObjNum = 2
~TObjNum = 3
~TObjNum = 4
~TObjNum = 5
Delete stack based objects (6)
~TObjNum = 6
////////////////////////////////////////////////////////////////
// Test of THashTable                                         //
////////////////////////////////////////////////////////////////
Filling THashTable
Number of slots before filling: 23
Average collisions: 43.478260
Number of slots after rehash: 1009
Average collisions after rehash: 1.267427
Filling THashTable with automatic rehash when AverageCollisions>5
Number of slots before filling: 23
Number of slots after filling: 641
Average collisions: 1.838235

Delete all heap based objects
////////////////////////////////////////////////////////////////
// Test of TBtree                                             //
////////////////////////////////////////////////////////////////
Filling TBtree
Real time 0:00:00, CP time 0.000
Print TBtree
Collection name='TBtree', class='TBtree', size=56
 TObjNum = 0
 TObjNum = 1
 TObjNum = 1
 TObjNum = 2
 TObjNum = 2
 TObjNum = 3
 TObjNum = 3
 TObjNum = 4
 TObjNum = 4
 TObjNum = 5
 TObjNum = 5
 TObjNum = 6
 TObjNum = 6
 TObjNum = 7
 TObjNum = 8
 TObjNum = 9
 TObjNum = 10
 TObjNum = 11
 TObjNum = 12
 TObjNum = 13
 TObjNum = 14
 TObjNum = 15
 TObjNum = 16
 TObjNum = 17
 TObjNum = 18
 TObjNum = 19
 TObjNum = 20
 TObjNum = 21
 TObjNum = 22
 TObjNum = 23
 TObjNum = 24
 TObjNum = 25
 TObjNum = 26
 TObjNum = 27
 TObjNum = 28
 TObjNum = 29
 TObjNum = 30
 TObjNum = 31
 TObjNum = 32
 TObjNum = 33
 TObjNum = 34
 TObjNum = 35
 TObjNum = 36
 TObjNum = 37
 TObjNum = 38
 TObjNum = 39
 TObjNum = 40
 TObjNum = 41
 TObjNum = 42
 TObjNum = 43
 TObjNum = 44
 TObjNum = 45
 TObjNum = 46
 TObjNum = 47
 TObjNum = 48
 TObjNum = 49
Remove 3 and print TBtree again
Collection name='TBtree', class='TBtree', size=55
 TObjNum = 0
 TObjNum = 1
 TObjNum = 1
 TObjNum = 2
 TObjNum = 2
 TObjNum = 3
 TObjNum = 4
 TObjNum = 4
 TObjNum = 5
 TObjNum = 5
 TObjNum = 6
 TObjNum = 6
 TObjNum = 7
 TObjNum = 8
 TObjNum = 9
 TObjNum = 10
 TObjNum = 11
 TObjNum = 12
 TObjNum = 13
 TObjNum = 14
 TObjNum = 15
 TObjNum = 16
 TObjNum = 17
 TObjNum = 18
 TObjNum = 19
 TObjNum = 20
 TObjNum = 21
 TObjNum = 22
 TObjNum = 23
 TObjNum = 24
 TObjNum = 25
 TObjNum = 26
 TObjNum = 27
 TObjNum = 28
 TObjNum = 29
 TObjNum = 30
 TObjNum = 31
 TObjNum = 32
 TObjNum = 33
 TObjNum = 34
 TObjNum = 35
 TObjNum = 36
 TObjNum = 37
 TObjNum = 38
 TObjNum = 39
 TObjNum = 40
 TObjNum = 41
 TObjNum = 42
 TObjNum = 43
 TObjNum = 44
 TObjNum = 45
 TObjNum = 46
 TObjNum = 47
 TObjNum = 48
 TObjNum = 49
Iterate forward over TBtree and remove 4 from tree
Iterate backward over TBtree and remove 2 from tree

Delete all heap based objects
~TObjNum = 0
~TObjNum = 1
~TObjNum = 1
~TObjNum = 3
~TObjNum = 4
~TObjNum = 5
~TObjNum = 5
~TObjNum = 6
~TObjNum = 7
~TObjNum = 8
~TObjNum = 9
~TObjNum = 10
~TObjNum = 11
~TObjNum = 12
~TObjNum = 13
~TObjNum = 14
~TObjNum = 15
~TObjNum = 16
~TObjNum = 17
~TObjNum = 18
~TObjNum = 19
~TObjNum = 20
~TObjNum = 21
~TObjNum = 22
~TObjNum = 23
~TObjNum = 24
~TObjNum = 25
~TObjNum = 26
~TObjNum = 27
~TObjNum = 28
~TObjNum = 29
~TObjNum = 30
~TObjNum = 31
~TObjNum = 32
~TObjNum = 33
~TObjNum = 34
~TObjNum = 35
~TObjNum = 36
~TObjNum = 37
~TObjNum = 38
~TObjNum = 39
~TObjNum = 40
~TObjNum = 41
~TObjNum = 42
~TObjNum = 43
~TObjNum = 44
~TObjNum = 45
~TObjNum = 46
~TObjNum = 47
~TObjNum = 48
~TObjNum = 49
Delete stack based objects (6)
~TObjNum = 6