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
|
/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify
* it under the terms of version 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* Konclude 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. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "CQHashVsQMapTester.h"
namespace Konclude {
namespace Test {
CQHashVsQMapTester::CQHashVsQMapTester() {
}
CQHashVsQMapTester::~CQHashVsQMapTester() {
}
void CQHashVsQMapTester::startModificationTest(cint64 modificationCount) {
cint64 maxValue = 1000000;
mMeasurementTimer.start();
for (cint64 i = 0; i < modificationCount; ++i) {
qint64 modHashKey = qrand() % maxValue;
mTestMap.insert(modHashKey,i);
}
cint64 elapsedTimeMap = mMeasurementTimer.elapsed();
cout<<"map modification time: "<<elapsedTimeMap<<" ms, modification count: "<<modificationCount<<"\n";
mMeasurementTimer.restart();
for (cint64 i = 0; i < modificationCount; ++i) {
qint64 modHashKey = qrand() % maxValue;
mTestHash.insert(modHashKey,i);
}
cint64 elapsedTimeHash = mMeasurementTimer.elapsed();
cout<<"hash modification time: "<<elapsedTimeHash<<" ms, modification count: "<<modificationCount<<"\n";
}
}; // end namespace Test
}; // end namespace Konclude
|
