Subject: [Boost-commit] svn:boost r73788 - sandbox/SOC/2011/checks/libs/checks/test
From: pierre.talbot.6114_at_[hidden]
Date: 2011-08-15 15:16:09
Author: trademark
Date: 2011-08-15 15:16:08 EDT (Mon, 15 Aug 2011)
New Revision: 73788
URL: http://svn.boost.org/trac/boost/changeset/73788
Log:
Code cleaning, test the latest function. The transpostions.
Text files modified:
sandbox/SOC/2011/checks/libs/checks/test/testModulus.cpp | 638 +--------------------------------------
1 files changed, 25 insertions(+), 613 deletions(-)
Modified: sandbox/SOC/2011/checks/libs/checks/test/testModulus.cpp
==============================================================================
--- sandbox/SOC/2011/checks/libs/checks/test/testModulus.cpp (original)
+++ sandbox/SOC/2011/checks/libs/checks/test/testModulus.cpp 2011-08-15 15:16:08 EDT (Mon, 15 Aug 2011)
@@ -20,632 +20,44 @@
#include <iomanip>
#include <list>
-#include <boost/test/unit_test.hpp> // Enhanced for unit_test framework autolink,
-#include <boost/array.hpp>
+#include <boost/test/unit_test.hpp> // Enhanced for unit_test framework autolink
+
+#include <boost/checks/luhn.hpp>
+#include <boost/checks/modulus10.hpp>
#include <boost/checks/checks_fwd.hpp> // Forward declarations.
-#include <boost/checks/modulus.hpp> // Modulo algorithms such the Luhn algorithm or the modulus 11 algorithm.
-BOOST_AUTO_TEST_SUITE(modulus_minimum_test)
-
-BOOST_AUTO_TEST_CASE(luhn_minimum_test)
-{
- // empty string
- std::string luhn = "";
- BOOST_CHECK_EQUAL( boost::checks::compute_luhn(luhn.begin(), luhn.end()), 0);
- BOOST_CHECK_EQUAL( boost::checks::check_luhn(luhn.begin(), luhn.end()), false);
- BOOST_CHECK_EQUAL( boost::checks::check_luhn(luhn.begin(), luhn.end(), 0), false);
- BOOST_CHECK_EQUAL( boost::checks::check_luhn(luhn.begin(), luhn.end(), 5), false); // wrong size
- // One digit string
- luhn = "0";
- char check_digit;
- for(int i =0; i<9; ++i)
- {
- BOOST_CHECK_NE( check_digit = boost::checks::compute_luhn(luhn.begin(), luhn.end(), 1), 0);
- luhn += check_digit;
- BOOST_CHECK_EQUAL( boost::checks::check_luhn(luhn.begin(), luhn.end(), 2), true);
- luhn = (char)(i+48);
- }
-}
+#include "alteration_test.hpp"
+#include "transposition_test.hpp"
-BOOST_AUTO_TEST_CASE(mod10_minimum_test)
-{
- // empty string
- std::string mod10 = "";
- boost::array<unsigned int, 1> weight = {1} ;
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight), 0);
- BOOST_CHECK_EQUAL( boost::checks::check_mod10(mod10.begin(), mod10.end(), weight), false);
- BOOST_CHECK_EQUAL( boost::checks::check_mod10(mod10.begin(), mod10.end(), weight, 0), false);
- BOOST_CHECK_EQUAL( boost::checks::check_mod10(mod10.begin(), mod10.end(), weight, 5), false); // wrong size
- // One digit string
- mod10 = "0";
- char check_digit;
- for(int i =0; i<9; ++i)
- {
- BOOST_CHECK_NE( check_digit = boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight, 1), 0);
- mod10 += check_digit;
- BOOST_CHECK_EQUAL( boost::checks::check_mod10(mod10.begin(), mod10.end(), weight, 2), true);
- mod10 = (char)(i+48);
- }
-}
+template <typename functor>
+unsigned int transposition( const functor &compute_checkdigit );
-BOOST_AUTO_TEST_CASE(mod11_minimum_test)
+struct luhn_functor
{
- // empty string
- std::string mod11 = "";
- BOOST_CHECK_EQUAL( boost::checks::compute_mod11(mod11.begin(), mod11.end()), 0);
- BOOST_CHECK_EQUAL( boost::checks::check_mod11(mod11.begin(), mod11.end()), false);
- BOOST_CHECK_EQUAL( boost::checks::check_mod11(mod11.begin(), mod11.end(), 0), false);
- BOOST_CHECK_EQUAL( boost::checks::check_mod11(mod11.begin(), mod11.end(), 5), false); // wrong size
- // One digit string
- mod11 = "0";
- char check_digit;
- for(int i =0; i<9; ++i)
+ template <typename range>
+ typename boost::checks::luhn_compute_algorithm::checkdigit<range>::type operator ()( const range &check_range ) const
{
- BOOST_CHECK_NE( check_digit = boost::checks::compute_mod11(mod11.begin(), mod11.end(), 1), 0);
- mod11 += check_digit;
- BOOST_CHECK_EQUAL( boost::checks::check_mod11(mod11.begin(), mod11.end(), 2), true);
- mod11 = (char)(i+48);
+ return boost::checks::compute_luhn( check_range ) ;
}
-}
-
-BOOST_AUTO_TEST_SUITE_END() //modulus_minimum_test
-
-
-BOOST_AUTO_TEST_SUITE(modulus_size_test)
-
-BOOST_AUTO_TEST_CASE(luhn_size_test)
-{
-}
-
-BOOST_AUTO_TEST_CASE(mod10_size_test)
-{
-}
+};
-BOOST_AUTO_TEST_CASE(mod11_size_test)
+struct verhoeff_functor
{
-}
-
-BOOST_AUTO_TEST_SUITE_END() //modulus_size_test
-
-BOOST_AUTO_TEST_SUITE(modulus_remainders_test)
-
-BOOST_AUTO_TEST_CASE(luhn_remainders_test)
-{
- BOOST_TEST_MESSAGE( "Boost.Checks.Modulus.Luhn : tests on the remainders.");
- // Initialization of the numbers with a odd and even size of digit (10 digits for 10 remainders).
- std::string luhn_numbers_odd[] =
- {
- "102345600",
- "102345691",
- "102345642",
- "102345683",
- "102345634",
- "102345675",
- "102345626",
- "102345667",
- "102345618",
- "102345659"
- };
- std::string luhn_numbers_even[] =
- {
- "1234567830",
- "1234567871",
- "1234567822",
- "1234567863",
- "1234567814",
- "1234567855",
- "1234567806",
- "1234567897",
- "1234567848",
- "1234567889",
- };
- char check_digit;
- // Test the numbers with a different remainder and an odd and even size of digits.
- for(int i=0; i<10; ++i)
+ template <typename range>
+ typename boost::checks::verhoeff_compute_algorithm::checkdigit<range>::type operator ()( const range &check_range ) const
{
- // Test the validation of the check digit with the luhn algorithm with the size precised.
- BOOST_CHECK( boost::checks::check_luhn ( luhn_numbers_even[i].begin(), luhn_numbers_even[i].end(), luhn_numbers_even[i].size()) );
- BOOST_CHECK( boost::checks::check_luhn ( luhn_numbers_odd[i].begin(), luhn_numbers_odd[i].end(), luhn_numbers_odd[i].size() ) );
-
- // Test the validation of the check digit with the luhn algorithm without the size precised.
- BOOST_CHECK( boost::checks::check_luhn ( luhn_numbers_even[i].begin(), luhn_numbers_even[i].end()) );
- BOOST_CHECK( boost::checks::check_luhn ( luhn_numbers_odd[i].begin(), luhn_numbers_odd[i].end() ) );
-
- // Test the equality between the check digit computed and the last digit with the size precised.
- BOOST_CHECK_EQUAL( boost::checks::compute_luhn(luhn_numbers_even[i].begin(), luhn_numbers_even[i].end(), luhn_numbers_even[i].size()-1), *(--luhn_numbers_even[i].end()) );
- BOOST_CHECK_EQUAL( boost::checks::compute_luhn(luhn_numbers_odd[i].begin(), luhn_numbers_odd[i].end(), luhn_numbers_odd[i].size()-1), *(--luhn_numbers_odd[i].end()) );
-
- // Test the equality between the check digit computed and the last digit without the size precised.
- BOOST_CHECK_EQUAL( boost::checks::compute_luhn(luhn_numbers_even[i].begin(), luhn_numbers_even[i].end()-1), *(--luhn_numbers_even[i].end()) );
- BOOST_CHECK_EQUAL( boost::checks::compute_luhn(luhn_numbers_odd[i].begin(), luhn_numbers_odd[i].end() -1), *(--luhn_numbers_odd[i].end()) );
-
- // Test the coherence between compute and check
- // compute
- BOOST_REQUIRE_NE ( check_digit = boost::checks::compute_luhn(luhn_numbers_even[i].begin(), luhn_numbers_even[i].end(), luhn_numbers_even[i].size()) , 0);
- std::string new_luhn_even = luhn_numbers_even[i] + check_digit ;
- BOOST_REQUIRE_NE ( check_digit = boost::checks::compute_luhn(luhn_numbers_odd[i].begin(), luhn_numbers_odd[i].end(), luhn_numbers_odd[i].size()) , 0);
- std::string new_luhn_odd = luhn_numbers_odd[i] + check_digit ;
- // check
- BOOST_CHECK_EQUAL( boost::checks::check_luhn( new_luhn_even.begin(), new_luhn_even.end(), new_luhn_even.size()), true);
- BOOST_CHECK_EQUAL( boost::checks::check_luhn( new_luhn_odd.begin(), new_luhn_odd.end(), new_luhn_odd.size()), true);
+ return boost::checks::compute_verhoeff( check_range ) ;
}
-} // BOOST_AUTO_TEST_CASE(luhn_remainders_test)
+};
-BOOST_AUTO_TEST_CASE(mod10_remainders_test)
+BOOST_AUTO_TEST_CASE(luhn_test)
{
- BOOST_TEST_MESSAGE( "Boost.Checks.Modulus.Modulus10 : tests on the remainders.");
- boost::array<unsigned int, 1> weight = {1} ;
- std::string mod10_numbers_odd[] =
- {
- "102345690",
- "102345681",
- "102345672",
- "102345663",
- "102345654",
- "102345645",
- "102345636",
- "102345627",
- "102345618",
- "102345609"
- };
- std::string mod10_numbers_even[] =
- {
- "1234567840",
- "1234567831",
- "1234567822",
- "1234567813",
- "1234567804",
- "1234567895",
- "1234567886",
- "1234567877",
- "1234567868",
- "1234567859"
- };
- char check_digit;
- // Test the numbers with a different remainder and an odd and even size of digits.
- for(int i=0; i<10; ++i)
- {
- // Test the validation of the check digit with the mod10 algorithm with the size precised.
- BOOST_CHECK( boost::checks::check_mod10 ( mod10_numbers_even[i].begin(), mod10_numbers_even[i].end(), weight, mod10_numbers_even[i].size()) );
- BOOST_CHECK( boost::checks::check_mod10 ( mod10_numbers_odd[i].begin(), mod10_numbers_odd[i].end(), weight, mod10_numbers_odd[i].size() ) );
- // Test the validation of the check digit with the mod10 algorithm without the size precised.
- BOOST_CHECK( boost::checks::check_mod10 ( mod10_numbers_even[i].begin(), mod10_numbers_even[i].end(), weight) );
- BOOST_CHECK( boost::checks::check_mod10 ( mod10_numbers_odd[i].begin(), mod10_numbers_odd[i].end(), weight) );
- // Test the equality between the check digit computed and the last digit with the size precised.
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10_numbers_even[i].begin(), mod10_numbers_even[i].end(), weight, mod10_numbers_even[i].size()-1), *(--mod10_numbers_even[i].end()) );
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10_numbers_odd[i].begin(), mod10_numbers_odd[i].end(), weight, mod10_numbers_odd[i].size()-1), *(--mod10_numbers_odd[i].end()) );
- // Test the equality between the check digit computed and the last digit without the size precised.
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10_numbers_even[i].begin(), mod10_numbers_even[i].end()-1, weight), *(--mod10_numbers_even[i].end()) );
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10_numbers_odd[i].begin(), mod10_numbers_odd[i].end() -1, weight), *(--mod10_numbers_odd[i].end()) );
- // Test the coherence between compute and check
- // compute
- BOOST_REQUIRE_NE ( check_digit = boost::checks::compute_mod10(mod10_numbers_even[i].begin(), mod10_numbers_even[i].end(),weight, mod10_numbers_even[i].size()) , 0);
- std::string new_mod10_even = mod10_numbers_even[i] + check_digit ;
- BOOST_REQUIRE_NE ( check_digit = boost::checks::compute_mod10(mod10_numbers_odd[i].begin(), mod10_numbers_odd[i].end(), weight, mod10_numbers_odd[i].size()) , 0);
- std::string new_mod10_odd = mod10_numbers_odd[i] + check_digit ;
- // check
- BOOST_CHECK_EQUAL( boost::checks::check_mod10( new_mod10_even.begin(), new_mod10_even.end(), weight, new_mod10_even.size()), true);
- BOOST_CHECK_EQUAL( boost::checks::check_mod10( new_mod10_odd.begin(), new_mod10_odd.end(), weight, new_mod10_odd.size()), true);
- }
-} // BOOST_AUTO_TEST_CASE(mod10_remainders_test)
-
-BOOST_AUTO_TEST_CASE(mod11_remainders_test)
-{
- BOOST_TEST_MESSAGE( "Boost.Checks.Modulus.Modulus11 : tests on the remainders.");
-
- std::string mod11_numbers_odd[] =
- {
- "123456711",
- "123456762",
- "123456703",
- "123456754",
- "123456835",
- "123456746",
- "123456797",
- "123456738",
- "123456789",
- "12345672X",
- "123456770"
- };
- std::string mod11_numbers_even[] =
- {
- "1234567881",
- "1234567822",
- "1234567873",
- "1234567814",
- "1234567865",
- "1234567806",
- "1234567857",
- "1234567938",
- "1234567849",
- "123456789X",
- "1234567830"
- };
- char check_digit;
- // Test the numbers with a different remainder and an odd and even size of digits.
- for(int i=0; i<11; ++i)
- {
- // Test the validation of the check digit with the mod11 algorithm with the size precised.
- BOOST_CHECK( boost::checks::check_mod11 ( mod11_numbers_even[i].begin(), mod11_numbers_even[i].end(), mod11_numbers_even[i].size()) );
- BOOST_CHECK( boost::checks::check_mod11 ( mod11_numbers_odd[i].begin(), mod11_numbers_odd[i].end(), mod11_numbers_odd[i].size() ) );
- // Test the validation of the check digit with the mod11 algorithm without the size precised.
- BOOST_CHECK( boost::checks::check_mod11 ( mod11_numbers_even[i].begin(), mod11_numbers_even[i].end()) );
- BOOST_CHECK( boost::checks::check_mod11 ( mod11_numbers_odd[i].begin(), mod11_numbers_odd[i].end()) );
- // Test the equality between the check digit computed and the last digit with the size precised.
- BOOST_CHECK_EQUAL( boost::checks::compute_mod11(mod11_numbers_even[i].begin(), mod11_numbers_even[i].end(), mod11_numbers_even[i].size()-1), *(--mod11_numbers_even[i].end()) );
- BOOST_CHECK_EQUAL( boost::checks::compute_mod11(mod11_numbers_odd[i].begin(), mod11_numbers_odd[i].end(), mod11_numbers_odd[i].size()-1), *(--mod11_numbers_odd[i].end()) );
- // Test the equality between the check digit computed and the last digit without the size precised.
- BOOST_CHECK_EQUAL( boost::checks::compute_mod11(mod11_numbers_even[i].begin(), mod11_numbers_even[i].end()-1), *(--mod11_numbers_even[i].end()) );
- BOOST_CHECK_EQUAL( boost::checks::compute_mod11(mod11_numbers_odd[i].begin(), mod11_numbers_odd[i].end() -1), *(--mod11_numbers_odd[i].end()) );
- // Test the coherence between compute and check
- // compute
- if(i != 9) // It don't work with 'X' because 'X' can only be the check digit and not another part of the number
- {
- BOOST_REQUIRE_NE ( check_digit = boost::checks::compute_mod11(mod11_numbers_even[i].begin(), mod11_numbers_even[i].end(), mod11_numbers_even[i].size()) , 0);
- std::string new_mod11_even = mod11_numbers_even[i] + check_digit ;
- BOOST_REQUIRE_NE ( check_digit = boost::checks::compute_mod11(mod11_numbers_odd[i].begin(), mod11_numbers_odd[i].end(), mod11_numbers_odd[i].size()) , 0);
- std::string new_mod11_odd = mod11_numbers_odd[i] + check_digit ;
- // check
- BOOST_CHECK_EQUAL( boost::checks::check_mod11( new_mod11_even.begin(), new_mod11_even.end(), new_mod11_even.size()), true);
- BOOST_CHECK_EQUAL( boost::checks::check_mod11( new_mod11_odd.begin(), new_mod11_odd.end(), new_mod11_odd.size()), true);
- }
- }
+ unsigned int transpositions_failures = transposition( luhn_functor() ) ;
+ BOOST_CHECK_MESSAGE( transpositions_failures == 2, "" << transpositions_failures << " catched on 90.") ;
}
-BOOST_AUTO_TEST_SUITE_END() //modulus_remainders_test
-BOOST_AUTO_TEST_SUITE(modulus_alteration_test)
-
-BOOST_AUTO_TEST_CASE(luhn_alteration_test)
+BOOST_AUTO_TEST_CASE(verhoeff_test)
{
- // Initialization of the numbers with a odd and even size of digit (10 digits for 10 remainders).
- std::string luhn_numbers_odd[] =
- {
- "102345600",
- "102345691",
- "102345642",
- "102345683",
- "102345634",
- "102345675",
- "102345626",
- "102345667",
- "102345618",
- "102345659"
- };
- std::string luhn_numbers_even[] =
- {
- "1234567830",
- "1234567871",
- "1234567822",
- "1234567863",
- "1234567814",
- "1234567855",
- "1234567806",
- "1234567897",
- "1234567848",
- "1234567889",
- };
- // Test the alteration of one digit
- for(int i=0; i<10; ++i)
- {
- // odd : test the alteration on each digits
- for(unsigned int j=0; j< luhn_numbers_odd[i].length(); ++j)
- {
- // alteration + [1|2|3|4|5|6|7|8|9] % 10
- for(int k=1; k <= 9; ++k)
- {
- std::string luhn_alterate = luhn_numbers_odd[i] ;
- luhn_alterate[j] = '0' + (luhn_alterate[j] + k) % 58 % 48 ;
- BOOST_CHECK_MESSAGE ( !boost::checks::check_luhn( luhn_alterate.begin(), luhn_alterate.end(), luhn_alterate.size() ), "The digit " << luhn_numbers_odd[i][j] << " is altered by " << luhn_alterate[j] << "." );
- BOOST_CHECK_MESSAGE ( !boost::checks::check_luhn( luhn_alterate.begin(), luhn_alterate.end()), "The digit " << luhn_numbers_odd[i][j] << " is altered by "<< luhn_alterate[j] << "." );
- }
- }
- // even : test the alteration of each digits
- for(unsigned int j=0; j< luhn_numbers_even[i].length(); ++j)
- {
- // alteration + ([1|2|3|4|5|6|7|8|9] % 10)
- for(int k=1; k <= 9; ++k)
- {
- std::string luhn_alterate = luhn_numbers_even[i] ;
- luhn_alterate[j] = '0' + (luhn_alterate[j] + k) % 58 % 48 ;
- BOOST_CHECK_MESSAGE ( !boost::checks::check_luhn( luhn_alterate.begin(), luhn_alterate.end(), luhn_alterate.size() ), "The digit " << luhn_numbers_even[i][j] << " is altered by "<< luhn_alterate[j] << "." );
- BOOST_CHECK_MESSAGE ( !boost::checks::check_luhn( luhn_alterate.begin(), luhn_alterate.end() ), "The digit " << luhn_numbers_even[i][j] << " is altered by "<< luhn_alterate[j] << "." );
- }
- }
- }
-} //BOOST_AUTO_TEST_CASE(luhn_alteration_test)
-
-BOOST_AUTO_TEST_CASE(mod10_alteration_test)
-{
- boost::array<unsigned int, 1> weight = {1} ;
- // Initialization of the numbers with a odd and even size of digit (10 digits for 10 remainders).
- std::string mod10_numbers_odd[] =
- {
- "102345690",
- "102345681",
- "102345672",
- "102345663",
- "102345654",
- "102345645",
- "102345636",
- "102345627",
- "102345618",
- "102345609"
- };
- std::string mod10_numbers_even[] =
- {
- "1234567840",
- "1234567831",
- "1234567822",
- "1234567813",
- "1234567804",
- "1234567895",
- "1234567886",
- "1234567877",
- "1234567868",
- "1234567859"
- };
- // Test the alteration of one digit
- for(int i=0; i<10; ++i)
- {
- // odd : test the alteration on each digits
- for(unsigned int j=0; j< mod10_numbers_odd[i].length(); ++j)
- {
- // alteration + [1|2|3|4|5|6|7|8|9] % 10
- for(int k=1; k <= 9; ++k)
- {
- std::string mod10_alterate = mod10_numbers_odd[i] ;
- mod10_alterate[j] = '0' + (mod10_alterate[j] + k) % 58 % 48 ;
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod10( mod10_alterate.begin(), mod10_alterate.end(), weight, mod10_alterate.size() ), "The digit " << mod10_numbers_odd[i][j] << " is altered by " << mod10_alterate[j] << "." );
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod10( mod10_alterate.begin(), mod10_alterate.end(), weight), "The digit " << mod10_numbers_odd[i][j] << " is altered by " << mod10_alterate[j] << "." );
- }
- }
- // even : test the alteration of each digits
- for(unsigned int j=0; j< mod10_numbers_even[i].length(); ++j)
- {
- // alteration + ([1|2|3|4|5|6|7|8|9] % 10)
- for(int k=1; k <= 9; ++k)
- {
- std::string mod10_alterate = mod10_numbers_even[i] ;
- mod10_alterate[j] = '0' + (mod10_alterate[j] + k) % 58 % 48 ;
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod10( mod10_alterate.begin(), mod10_alterate.end(), weight, mod10_alterate.size() ), "The digit " << mod10_numbers_even[i][j] << " is altered by " << mod10_alterate[j] << "." );
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod10( mod10_alterate.begin(), mod10_alterate.end(), weight ), "The digit " << mod10_numbers_even[i][j] << " is altered by " << mod10_alterate[j] << ".");
- }
- }
- }
-} //BOOST_AUTO_TEST_CASE(mod10_alteration_test)
-
-BOOST_AUTO_TEST_CASE(mod11_alteration_test)
-{
- // Initialization of the numbers with a odd and even size of digit (11 digits for 11 remainders).
- std::string mod11_numbers_odd[] =
- {
- "123456711",
- "123456762",
- "123456703",
- "123456754",
- "123456835",
- "123456746",
- "123456797",
- "123456738",
- "123456789",
- "12345672X",
- "123456770"
- };
- std::string mod11_numbers_even[] =
- {
- "1234567881",
- "1234567822",
- "1234567873",
- "1234567814",
- "1234567865",
- "1234567806",
- "1234567857",
- "1234567938",
- "1234567849",
- "123456789X",
- "1234567830"
- };
- // Test the alteration of one digit
- for(int i=0; i<11; ++i)
- {
- // odd : test the alteration on each digits
- for(unsigned int j=0; j< mod11_numbers_odd[i].length(); ++j)
- {
- // alteration + [1|2|3|4|5|6|7|8|9] % 10
- for(int k=1; k <= 9; ++k)
- {
- std::string mod11_alterate = mod11_numbers_odd[i] ;
- if(mod11_alterate[j] != 'X')
- mod11_alterate[j] = '0' + (mod11_alterate[j] + k) % 58 % 48 ;
- else
- mod11_alterate[j] = '0' + k;
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod11( mod11_alterate.begin(), mod11_alterate.end(), mod11_alterate.size() ), "The digit " << mod11_numbers_odd[i][j] << " is altered by "<< mod11_alterate[j] << "." );
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod11( mod11_alterate.begin(), mod11_alterate.end()), "The digit " << mod11_numbers_odd[i][j] << " is altered by " << mod11_alterate[j] << "." );
- }
- }
- // even : test the alteration of each digits
- for(unsigned int j=0; j< mod11_numbers_even[i].length(); ++j)
- {
- // alteration + ([1|2|3|4|5|6|7|8|9] % 10)
- for(int k=1; k <= 9; ++k)
- {
- std::string mod11_alterate = mod11_numbers_even[i] ;
- if(mod11_alterate[j] != 'X')
- mod11_alterate[j] = '0' + (mod11_alterate[j] + k) % 58 % 48 ;
- else
- mod11_alterate[j] = '0' + k;
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod11( mod11_alterate.begin(), mod11_alterate.end(), mod11_alterate.size() ), "The digit " << mod11_numbers_even[i][j] << " is altered by "<< mod11_alterate[j] << "." );
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod11( mod11_alterate.begin(), mod11_alterate.end() ), "The digit " << mod11_numbers_even[i][j] << " is altered by "<< mod11_alterate[j] << "." );
- }
- }
- }
-} //BOOST_AUTO_TEST_CASE(mod11_alteration_test)
-
-BOOST_AUTO_TEST_SUITE_END() //modulus_alteration_test
-
-BOOST_AUTO_TEST_SUITE(modulus_transposition_test)
-
-// Transposition of 9 and 0 fails with odd and even tests.
-BOOST_AUTO_TEST_CASE_EXPECTED_FAILURES( luhn_transposition_test, 2 )
-BOOST_AUTO_TEST_CASE(luhn_transposition_test)
-{
- std::string luhn_transposition_odd = "12345678903"; //odd
- std::string luhn_transposition_even = "123456789007"; // even
- std::string luhn_transposition;
- // for each digits
- for(int i=0; i < 9; ++i)
- {
- // Test a permutation with all the digits remaining
- for(int j=i+1; j < 10; j+=2)
- {
- // Odd
- luhn_transposition = luhn_transposition_odd;
- luhn_transposition[i] = luhn_transposition[j];
- luhn_transposition[j] = luhn_transposition_odd[i];
- BOOST_CHECK_MESSAGE ( !boost::checks::check_luhn( luhn_transposition.begin(), luhn_transposition.end(), luhn_transposition.size() ), "The digit " << luhn_transposition[j] << " is transposed with "<< luhn_transposition[i] << "." );
- // Even
- luhn_transposition = luhn_transposition_even;
- luhn_transposition[i] = luhn_transposition[j];
- luhn_transposition[j] = luhn_transposition_even[i];
- BOOST_CHECK_MESSAGE ( !boost::checks::check_luhn( luhn_transposition.begin(), luhn_transposition.end(), luhn_transposition.size() ), "The digit " << luhn_transposition[j] << " is transposed with "<< luhn_transposition[i] << "." );
- }
- }
-} // BOOST_AUTO_TEST_CASE(luhn_transposition_test)
-
-BOOST_AUTO_TEST_CASE(mod10_transposition_test)
-{
- // Untestable because the weight is customizable.
-} // BOOST_AUTO_TEST_CASE(mod10_transposition_test)
-
-BOOST_AUTO_TEST_CASE(mod11_transposition_test)
-{
- std::string mod11_transposition_odd = "12345678909"; //odd
- std::string mod11_transposition_even = "123456789009"; // even
- std::string mod11_transposition;
- // For each digits.
- for(int i=0; i < 9; ++i)
- {
- // Test a permutation with all the digits remaining.
- for(int j=i+1; j < 10; j+=2)
- {
- // Odd
- mod11_transposition = mod11_transposition_odd;
- mod11_transposition[i] = mod11_transposition[j];
- mod11_transposition[j] = mod11_transposition_odd[i];
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod11( mod11_transposition.begin(), mod11_transposition.end(), mod11_transposition.size() ), "The digit " << mod11_transposition[j] << " is transposed with "<< mod11_transposition[i] << "." );
- // Even
- mod11_transposition = mod11_transposition_even;
- mod11_transposition[i] = mod11_transposition[j];
- mod11_transposition[j] = mod11_transposition_even[i];
- BOOST_CHECK_MESSAGE ( !boost::checks::check_mod11( mod11_transposition.begin(), mod11_transposition.end(), mod11_transposition.size() ), "The digit " << mod11_transposition[j] << " is transposed with "<< mod11_transposition[i] << "." );
- }
- }
-} // BOOST_AUTO_TEST_CASE(mod11_transposition_test)
-
-BOOST_AUTO_TEST_SUITE_END() //modulus_transposition_test
-
-BOOST_AUTO_TEST_SUITE(modulus_encoding_test)
-
-BOOST_AUTO_TEST_CASE(luhn_encoding_test)
-{
- std::string raw_luhn = "123456781";
- std::wstring luhn(raw_luhn.begin(), raw_luhn.end());
- std::wstring::iterator iter1 = luhn.begin();
- BOOST_CHECK_EQUAL (boost::checks::compute_luhn<wchar_t>(luhn.begin(), luhn.end()), '4');
- BOOST_CHECK_EQUAL (boost::checks::compute_luhn<wchar_t>(luhn.begin(), luhn.end()), '4');
-
- luhn += '4';
- BOOST_CHECK_EQUAL (boost::checks::check_luhn(luhn.begin(), luhn.end()), true);
-} // BOOST_AUTO_TEST_CASE(modulus_encoding_test)
-
-BOOST_AUTO_TEST_CASE(mod10_encoding_test)
-{
- std::string raw_mod10 = "123456781";
- boost::array<unsigned int, 1> weight = {1} ;
- std::wstring mod10(raw_mod10.begin(), raw_mod10.end());
- BOOST_CHECK_EQUAL (boost::checks::compute_mod10<wchar_t>(mod10.begin(), mod10.end(), weight), '3');
- BOOST_CHECK_EQUAL (boost::checks::compute_mod10<wchar_t>(mod10.begin(), mod10.end(), weight, 9), '3');
-
- mod10 += '3';
- BOOST_CHECK_EQUAL (boost::checks::check_mod10(mod10.begin(), mod10.end(), weight), true);
-} // BOOST_AUTO_TEST_CASE(mod10_encoding_test)
-
-BOOST_AUTO_TEST_CASE(mod11_encoding_test)
-{
- std::string raw_mod11 = "123456781";
- std::wstring mod11(raw_mod11.begin(), raw_mod11.end());
- BOOST_CHECK_EQUAL (boost::checks::compute_mod11<wchar_t>(mod11.begin(), mod11.end()), '4');
- BOOST_CHECK_EQUAL (boost::checks::compute_mod11<wchar_t>(mod11.begin(), mod11.end(), 9), '4');
-
- mod11 += '4';
- BOOST_CHECK_EQUAL (boost::checks::check_mod11(mod11.begin(), mod11.end()), true);
-} // BOOST_AUTO_TEST_CASE(mod11_encoding_test)
-
-BOOST_AUTO_TEST_SUITE_END() //modulus_encoding_test
-
-BOOST_AUTO_TEST_SUITE(modulus_collection_test)
-BOOST_AUTO_TEST_CASE(luhn_collection_test)
-{
- std::list<char> luhn;
- for(char i=48; i < 53; ++i)
- luhn.push_back(i);
- char check_digit;
- BOOST_REQUIRE_NE( check_digit = boost::checks::compute_luhn(luhn.begin(), luhn.end(), 5) , 0);
- BOOST_REQUIRE_EQUAL( boost::checks::compute_luhn(luhn.begin(), luhn.end()) , check_digit);
- luhn.push_back(check_digit);
- BOOST_CHECK_EQUAL( boost::checks::check_luhn(luhn.begin(), luhn.end(), 6), true);
- BOOST_CHECK_EQUAL( boost::checks::check_luhn(luhn.begin(), luhn.end()), true);
-} // BOOST_AUTO_TEST_CASE(luhn_collection_test)
-
-BOOST_AUTO_TEST_CASE(mod10_collection_test)
-{
- std::list<char> mod10;
- boost::array<unsigned int, 1> weight = {1} ;
- for(char i=48; i < 53; ++i)
- mod10.push_back(i);
- char check_digit;
- BOOST_REQUIRE_NE( check_digit = boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight, 5) , 0);
- BOOST_REQUIRE_EQUAL( boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight) , check_digit);
- mod10.push_back(check_digit);
- BOOST_CHECK_EQUAL( boost::checks::check_mod10(mod10.begin(), mod10.end(), weight, 6), true);
- BOOST_CHECK_EQUAL( boost::checks::check_mod10(mod10.begin(), mod10.end(), weight), true);
-} // BOOST_AUTO_TEST_CASE(mod10_collection_test)
-
-BOOST_AUTO_TEST_CASE(mod11_collection_test)
-{
- std::list<char> mod11;
- for(char i=48; i < 53; ++i)
- mod11.push_back(i);
- char check_digit;
- BOOST_REQUIRE_NE( check_digit = boost::checks::compute_mod11(mod11.begin(), mod11.end(), 5) , 0);
- BOOST_REQUIRE_EQUAL( boost::checks::compute_mod11(mod11.begin(), mod11.end()) , check_digit);
- mod11.push_back(check_digit);
- BOOST_CHECK_EQUAL( boost::checks::check_mod11(mod11.begin(), mod11.end(), 6), true);
- BOOST_CHECK_EQUAL( boost::checks::check_mod11(mod11.begin(), mod11.end()), true);
-} // BOOST_AUTO_TEST_CASE(mod11_collection_test)
-
-
-BOOST_AUTO_TEST_SUITE_END() //modulus_collection_test
-
-
-BOOST_AUTO_TEST_SUITE(modulus_weight_test)
-BOOST_AUTO_TEST_CASE(mod10_weight_test)
-{
- // Test with a weight of 1 on each digit
- std::string mod10 = "1234";
- boost::array<unsigned int, 4> weight = {1,1,1,1};
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight, 4),
- boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight, 4));
-
- // Test with a weight of 1234
- for(int i=0; i<4; ++i) weight[i] = i+1;
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight, 4), '0');
-
- // Test with a weight of 0
- for(int i=0; i<4; ++i) weight[i] = 0 ;
- boost::array<unsigned int, 1> weight2 = {0};
- BOOST_CHECK_EQUAL( boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight, 4),
- boost::checks::compute_mod10(mod10.begin(), mod10.end(), weight2, 4));
-}// mod10_weight_test
-
-BOOST_AUTO_TEST_SUITE_END() //modulus_weight_test
\ No newline at end of file
+ unsigned int transpositions_failures = transposition( verhoeff_functor() ) ;
+ BOOST_CHECK_MESSAGE( transpositions_failures == 0, "" << transpositions_failures << " catched on 90.") ;
+}
\ No newline at end of file