Gael Guennebaud | 9e02e42 | 2008-10-21 00:05:45 +0000 | [diff] [blame^] | 1 | |
| 2 | #define NOGMM |
| 3 | #define NOMTL |
| 4 | |
| 5 | #include <map> |
| 6 | #include <ext/hash_map> |
| 7 | #include <google/dense_hash_map> |
| 8 | #include <google/sparse_hash_map> |
| 9 | |
| 10 | #ifndef SIZE |
| 11 | #define SIZE 10000 |
| 12 | #endif |
| 13 | |
| 14 | #ifndef DENSITY |
| 15 | #define DENSITY 0.01 |
| 16 | #endif |
| 17 | |
| 18 | #ifndef REPEAT |
| 19 | #define REPEAT 1 |
| 20 | #endif |
| 21 | |
| 22 | #include "BenchSparseUtil.h" |
| 23 | |
| 24 | #ifndef MINDENSITY |
| 25 | #define MINDENSITY 0.0004 |
| 26 | #endif |
| 27 | |
| 28 | #ifndef NBTRIES |
| 29 | #define NBTRIES 10 |
| 30 | #endif |
| 31 | |
| 32 | #define BENCH(X) \ |
| 33 | timer.reset(); \ |
| 34 | for (int _j=0; _j<NBTRIES; ++_j) { \ |
| 35 | timer.start(); \ |
| 36 | for (int _k=0; _k<REPEAT; ++_k) { \ |
| 37 | X \ |
| 38 | } timer.stop(); } |
| 39 | |
| 40 | int main(int argc, char *argv[]) |
| 41 | { |
| 42 | int rows = SIZE; |
| 43 | int cols = SIZE; |
| 44 | float density = DENSITY; |
| 45 | |
| 46 | EigenSparseMatrix sm1(rows,cols), sm2(rows,cols); |
| 47 | |
| 48 | |
| 49 | int n = rows*cols*density; |
| 50 | std::cout << "n = " << n << "\n"; |
| 51 | int dummy; |
| 52 | BenchTimer t; |
| 53 | |
| 54 | t.reset(); t.start(); |
| 55 | for (int k=0; k<n; ++k) |
| 56 | dummy = ei_random<int>(0,rows-1) + ei_random<int>(0,cols-1); |
| 57 | t.stop(); |
| 58 | double rtime = t.value(); |
| 59 | std::cout << "rtime = " << rtime << " (" << dummy << ")\n\n"; |
| 60 | const int Bits = 6; |
| 61 | for (;;) |
| 62 | { |
| 63 | { |
| 64 | RandomSetter<EigenSparseMatrix,StdMapTraits,Bits> set1(sm1); |
| 65 | t.reset(); t.start(); |
| 66 | for (int k=0; k<n; ++k) |
| 67 | set1(ei_random<int>(0,rows-1),ei_random<int>(0,cols-1)) += 1; |
| 68 | t.stop(); |
| 69 | std::cout << "std::map => \t" << t.value()-rtime |
| 70 | << " nnz=" << set1.nonZeros() << "\n";getchar(); |
| 71 | } |
| 72 | { |
| 73 | RandomSetter<EigenSparseMatrix,GnuHashMapTraits,Bits> set1(sm1); |
| 74 | t.reset(); t.start(); |
| 75 | for (int k=0; k<n; ++k) |
| 76 | set1(ei_random<int>(0,rows-1),ei_random<int>(0,cols-1)) += 1; |
| 77 | t.stop(); |
| 78 | std::cout << "gnu::hash_map => \t" << t.value()-rtime |
| 79 | << " nnz=" << set1.nonZeros() << "\n";getchar(); |
| 80 | } |
| 81 | { |
| 82 | RandomSetter<EigenSparseMatrix,GoogleDenseHashMapTraits,Bits> set1(sm1); |
| 83 | t.reset(); t.start(); |
| 84 | for (int k=0; k<n; ++k) |
| 85 | set1(ei_random<int>(0,rows-1),ei_random<int>(0,cols-1)) += 1; |
| 86 | t.stop(); |
| 87 | std::cout << "google::dense => \t" << t.value()-rtime |
| 88 | << " nnz=" << set1.nonZeros() << "\n";getchar(); |
| 89 | } |
| 90 | { |
| 91 | RandomSetter<EigenSparseMatrix,GoogleSparseHashMapTraits,Bits> set1(sm1); |
| 92 | t.reset(); t.start(); |
| 93 | for (int k=0; k<n; ++k) |
| 94 | set1(ei_random<int>(0,rows-1),ei_random<int>(0,cols-1)) += 1; |
| 95 | t.stop(); |
| 96 | std::cout << "google::sparse => \t" << t.value()-rtime |
| 97 | << " nnz=" << set1.nonZeros() << "\n";getchar(); |
| 98 | } |
| 99 | std::cout << "\n\n"; |
| 100 | } |
| 101 | |
| 102 | return 0; |
| 103 | } |
| 104 | |