| 64 | } |
| 65 | |
| 66 | void Duplicate::initPrimeArrays() { |
| 67 | uint64 number = 10000; |
| 68 | uint64 count = 0; |
| 69 | while(count < mBufNum * PRIME_ARRAY_LEN) { |
| 70 | number++; |
| 71 | bool isPrime = true; |
| 72 | for(uint64 i=2; i<=sqrt(number); i++) { |
| 73 | if(number%i == 0) { |
| 74 | isPrime = false; |
| 75 | break; |
| 76 | } |
| 77 | } |
| 78 | if(isPrime) { |
| 79 | mPrimeArrays[count] = number; |
| 80 | count++; |
| 81 | number += 10000; |
| 82 | } |
| 83 | } |
| 84 | } |
| 85 | |
| 86 | Duplicate::~Duplicate(){ |
| 87 | delete[] mDupBuf; |
nothing calls this directly
no outgoing calls
no test coverage detected