Mark Olesen
|
db552fb751
|
DEFEATURE: remove StaticHashTable
- unused, unmaintained and slower than the regular HashTable
|
2017-10-30 21:35:05 +01:00 |
|
Mark Olesen
|
8ec64d8128
|
STYLE: compilation of some unit tests
|
2017-10-26 23:59:18 +02:00 |
|
Henry Weller
|
56fa7c0906
|
Update code to use the simpler C++11 template syntax removing spaces between closing ">"s
|
2016-01-10 22:41:16 +00:00 |
|
Henry
|
c2dd153a14
|
Copyright transfered to the OpenFOAM Foundation
|
2011-08-14 12:17:30 +01:00 |
|
Mark Olesen
|
129695a950
|
STYLE: adjust executable names for some tests
|
2011-01-19 14:29:56 +01:00 |
|
andy
|
099cc39e2e
|
Revert "STYLE: 2011 copyright date."
This reverts commit b18f6cc1ce.
|
2011-01-05 18:24:29 +00:00 |
|
graham
|
b18f6cc1ce
|
STYLE: 2011 copyright date.
|
2011-01-05 11:14:26 +00:00 |
|
graham
|
012494fdb5
|
STYLE: Fixing code style requirements for all apps.
Exception: applyWallFunctionBoundaryConditions.C cannot split #include
directives.
|
2010-07-27 15:27:05 +01:00 |
|
Mark Olesen
|
d29c438657
|
STYLE: use url for FSF license instead of postal address, switch to GPL v3
|
2010-03-29 14:07:56 +02:00 |
|
henry
|
35c9d7bbd5
|
Corrected test applications.
|
2009-11-20 12:40:19 +00:00 |
|
Mark Olesen
|
1fbcb6e2c0
|
Added HashTbl::shrink() - but it only be useful in particular situations
- for the hashTableTest3, it seemed to slow things down a bit
loop 0 - Erased 100000 elements (size 2900000 capacity 4194304) 0.31 s
loop 1 - Erased 100000 elements (size 2800000 capacity 4194304) 0.01 s
loop 2 - Erased 100000 elements (size 2700000 capacity 4194304) 0 s
loop 3 - Erased 100000 elements (size 2600000 capacity 4194304) 0 s
loop 4 - Erased 100000 elements (size 2500000 capacity 4194304) 0.01 s
loop 5 - Erased 100000 elements (size 2400000 capacity 4194304) 0 s
loop 6 - Erased 100000 elements (size 2300000 capacity 4194304) 0 s
loop 7 - Erased 100000 elements (size 2200000 capacity 4194304) 0 s
loop 8 - Erased 100000 elements (size 2100000 capacity 4194304) 0.01 s
loop 9 - Erased 100000 elements (size 2000000 capacity 4194304) 0.44 s
loop 10 - Erased 100000 elements (size 1900000 capacity 4194304) 0.44 s
loop 11 - Erased 100000 elements (size 1800000 capacity 4194304) 0.39 s
loop 12 - Erased 100000 elements (size 1700000 capacity 4194304) 0.4 s
loop 13 - Erased 100000 elements (size 1600000 capacity 2097152) 0.15 s
loop 14 - Erased 100000 elements (size 1500000 capacity 2097152) 0.01 s
loop 15 - Erased 100000 elements (size 1400000 capacity 2097152) 0 s
loop 16 - Erased 100000 elements (size 1300000 capacity 2097152) 0 s
loop 17 - Erased 100000 elements (size 1200000 capacity 2097152) 0.01 s
loop 18 - Erased 100000 elements (size 1100000 capacity 2097152) 0 s
loop 19 - Erased 100000 elements (size 1000000 capacity 2097152) 0.27 s
loop 20 - Erased 100000 elements (size 900000 capacity 2097152) 0.2 s
loop 21 - Erased 100000 elements (size 800000 capacity 1048576) 0.1 s
loop 22 - Erased 100000 elements (size 700000 capacity 1048576) 0 s
loop 23 - Erased 100000 elements (size 600000 capacity 1048576) 0 s
loop 24 - Erased 100000 elements (size 500000 capacity 1048576) 0.12 s
loop 25 - Erased 100000 elements (size 400000 capacity 524288) 0.04 s
loop 26 - Erased 100000 elements (size 300000 capacity 524288) 0.01 s
loop 27 - Erased 100000 elements (size 200000 capacity 262144) 0.02 s
loop 28 - Erased 100000 elements (size 100000 capacity 131072) 0.02 s
loop 29 - Erased 100000 elements (size 0 capacity 2) 0 s
|
2009-10-30 19:28:39 +01:00 |
|
Mark Olesen
|
2c73afb6ec
|
HashTbl avoid backward search in erase()
- The ideas as discussed in email
- The speedup is really there.
Before
loop 0 - Erased 100000 elements: 3.82 s
loop 1 - Erased 100000 elements: 11.45 s
loop 2 - Erased 100000 elements: 19.46 s
loop 3 - Erased 100000 elements: 27.73 s
loop 4 - Erased 100000 elements: 38.74 s
^C
After
loop 0 - Erased 100000 elements (size 2900000 capacity 8388608) 0.01 s
loop 1 - Erased 100000 elements (size 2800000 capacity 8388608) 0 s
loop 2 - Erased 100000 elements (size 2700000 capacity 8388608) 0.01 s
loop 3 - Erased 100000 elements (size 2600000 capacity 8388608) 0 s
loop 4 - Erased 100000 elements (size 2500000 capacity 8388608) 0 s
loop 5 - Erased 100000 elements (size 2400000 capacity 8388608) 0 s
loop 6 - Erased 100000 elements (size 2300000 capacity 8388608) 0 s
loop 7 - Erased 100000 elements (size 2200000 capacity 8388608) 0 s
...
|
2009-10-30 18:54:51 +01:00 |
|
Mark Olesen
|
55a89e9db3
|
added HashTbl as development replacement for HashTable
- rename to HashTable later when it is considered stable
|
2009-10-30 18:31:28 +01:00 |
|