[711] | 1 | // -*- mode:C++ -*- |
---|

| 2 | #ifndef HUGO_BENCH_TEST_H |
---|

| 3 | #define HUGO_BENCH_TEST_H |
---|

| 4 | |
---|

| 5 | #include<vector> |
---|

[718] | 6 | #include<iostream> |
---|

| 7 | |
---|

| 8 | #include<hugo/time_measure.h> |
---|

[711] | 9 | |
---|

| 10 | ///An experimental typedef factory |
---|

| 11 | #define GRAPH_TYPEDEF_FACTORY(Graph) \ |
---|

| 12 | typedef typename Graph:: Node Node;\ |
---|

| 13 | typedef typename Graph:: NodeIt NodeIn;\ |
---|

| 14 | typedef typename Graph:: Edge Edge;\ |
---|

| 15 | typedef typename Graph:: EdgeIt EdgeIt;\ |
---|

| 16 | typedef typename Graph:: InEdgeIt InEdgeIt;\ |
---|

| 17 | typedef typename Graph::OutEdgeIt OutEdgeIt; |
---|

| 18 | |
---|

| 19 | #define GRAPH_TYPEDEF_FACTORY_NOTYPENAME(Graph) \ |
---|

| 20 | typedef Graph:: Node Node;\ |
---|

| 21 | typedef Graph:: NodeIt NodeIn;\ |
---|

| 22 | typedef Graph:: Edge Edge;\ |
---|

| 23 | typedef Graph:: EdgeIt EdgeIt;\ |
---|

| 24 | typedef Graph:: InEdgeIt InEdgeIt;\ |
---|

| 25 | typedef Graph::OutEdgeIt OutEdgeIt; |
---|

| 26 | |
---|

| 27 | |
---|

| 28 | ///A primitive primtest |
---|

[718] | 29 | |
---|

| 30 | ///\bug 2 is not a prime according to this function! |
---|

[711] | 31 | bool isPrim(int n) |
---|

| 32 | { |
---|

| 33 | if(n%2) { |
---|

| 34 | for(int k=3;n/k>=k;k+=2) |
---|

| 35 | if(!(n%k)) return false; |
---|

| 36 | return true; |
---|

| 37 | } |
---|

| 38 | return false; |
---|

| 39 | } |
---|

| 40 | |
---|

| 41 | ///Finds the smallest prime not less then \c n. |
---|

| 42 | int nextPrim(int n) |
---|

| 43 | { |
---|

| 44 | for(n+=!(n%2);!isPrim(n);n+=2) ; |
---|

| 45 | return n; |
---|

| 46 | } |
---|

| 47 | |
---|

| 48 | |
---|

| 49 | /// Class to generate consecutive primes |
---|

| 50 | class Primes |
---|

| 51 | { |
---|

| 52 | std::vector<int> primes; |
---|

| 53 | int n; |
---|

| 54 | |
---|

| 55 | bool isPrime(int m) |
---|

| 56 | { |
---|

| 57 | for(int i=0;m<primes[i]*primes[i];i++) if(!(m%primes[i])) return false; |
---|

| 58 | return true; |
---|

| 59 | } |
---|

| 60 | public: |
---|

| 61 | Primes() : n(1) {} |
---|

| 62 | |
---|

| 63 | int operator() () |
---|

| 64 | { |
---|

| 65 | if(primes.size()==0) { |
---|

| 66 | primes.push_back(2); |
---|

| 67 | return 2; |
---|

| 68 | } |
---|

| 69 | else { |
---|

| 70 | do n+=2; while(!isPrime(n)); |
---|

| 71 | primes.push_back(n); |
---|

| 72 | return n; |
---|

| 73 | } |
---|

| 74 | } |
---|

| 75 | }; |
---|

| 76 | |
---|

[718] | 77 | inline void PrintTime(char *ID,hugo::Timer &T) |
---|

| 78 | { |
---|

| 79 | hugo::TimeStamp S(T); |
---|

| 80 | std::cout << ID << ' ' << S.getUserTime() << ' ' |
---|

| 81 | << S.getSystemTime() << ' ' << S.getRealTime() << std::endl; |
---|

| 82 | } |
---|

| 83 | |
---|

| 84 | |
---|

[711] | 85 | |
---|

| 86 | #endif |
---|