Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
src/math/primes/primes_test_data.h
Go to the documentation of this file.
00001 #ifndef H_PRIMES_TEST_DATA
00002 #define H_PRIMES_TEST_DATA
00003 
00008 namespace testdata {
00015   long long int prime_twins_count[][2] = {
00016     {3, 0},
00017     {4, 0},
00018     {5, 0}, // range is not inclusive!
00019     {6, 1},
00020     {10, 2},
00021     {100, 8},
00022     {1000, 35},
00023     {10000, 205},
00024     {100000, 1224},
00025     {1000000, 8169},
00026     {10000000, 58980},
00027     {100000000, 440312},
00028     {1000000000, 3424506},
00029     {0, 0}
00030   };
00031 
00037   long long int prime_count_small[][2] = {
00038     {3, 1},
00039     {4, 2},
00040     {5, 2},
00041     {6, 3},
00042     {7, 3},
00043     {8, 4},
00044     {20, 8},
00045     {155, 36},
00046     {3331, 469},
00047     {12345, 1474},
00048     {0, 0}
00049   };
00050 
00056   long long int prime_count_big[][2] = {
00057     {123456, 11601},
00058     {1234567, 95360},
00059     {12345678, 809227},
00060     {123456789, 7027260},
00061     {1234567890, 62106578},
00062    // {12345678901ll, 556442057},
00063     // and something that even result count won't fit into int 
00064    // {120000000000ll, 4904759399ll},
00065     {0, 0}
00066   };
00067 
00068 }
00069 #endif
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines