[Boost-commit] svn:boost r73935 - sandbox/SOC/2011/checks/libs/checks/doc

Subject: [Boost-commit] svn:boost r73935 - sandbox/SOC/2011/checks/libs/checks/doc
From: pierre.talbot.6114_at_[hidden]
Date: 2011-08-19 20:03:45

Author: trademark
Date: 2011-08-19 20:03:44 EDT (Fri, 19 Aug 2011)
New Revision: 73935
URL: http://svn.boost.org/trac/boost/changeset/73935

Log:
Delete example section.
Text files modified: 
   sandbox/SOC/2011/checks/libs/checks/doc/modulus.qbk |    62 ++------------------------------------- 
   1 files changed, 4 insertions(+), 58 deletions(-)

Modified: sandbox/SOC/2011/checks/libs/checks/doc/modulus.qbk
==============================================================================
--- sandbox/SOC/2011/checks/libs/checks/doc/modulus.qbk	(original)
+++ sandbox/SOC/2011/checks/libs/checks/doc/modulus.qbk	2011-08-19 20:03:44 EDT (Fri, 19 Aug 2011)
@@ -56,65 +56,9 @@
 The weight decrease by one for the second position, one again for the third, etc.
 
 [endsect][/section:mod11 Modulus 11 algorithm]
-[section:modexamples Examples]
 
-[import ..\example\modulus_example.cpp]
 
-In this part, we'll see some basic examples which show how to check or compute a number with an algorithm.
-After this, we'll discuss about a few specific cases.
 
-Firstly, we need to include the file including the check and compute functions.
-
-[modulus_include_file]
-
-[h5 Check a number]
-
-We can check a number which is delimitated by two iterators. The most simple is using std::string.
-
-[checks_modulus_example_1]
-
-This provides this output:
-
-[checks_modulus_output_1]
-
-[h5 Compute a check digit]
-
-We can compute a check digit which is in the range [0..9] ( + 'X' for the modulus 11 algorithm). 
-The check digit can be of the type "char" or a custom type such as ['wchar_t].
-
-This example will show how to compute a serie of check digit retrieved from a UTF-8 file and put the result into another UTF-8 file.
-
-[checks_modulus_example_2]
-
-The contents of the input and output files are showed on the following table. We tested the program with 3 differents numbers, the digits of this number are separated with the unicode character '\u2020'.
-
-[table:id Contents of the input and output files
-    [[Input file] [Output file]]
-    [[1\u20202\u20203\u20204\u20205\u20201]     [1\u20202\u20203\u20204\u20205\u20201 check digit : X]]
-    [[2\u20203\u20204\u20205\u20206\u20207]     [2\u20203\u20204\u20205\u20206\u20207 check digit : 6]]
-    [[3\u20204\u20205\u20206\u20207\u20208]     [3\u20204\u20205\u20206\u20207\u20208 check digit : 1]]
-]
-
-[h5 Use the weight pattern]
-
-We can use a custom weight pattern with the modulus 10 algorithm. 
-In the following example, we'll see how to compute and check a Routing transit number (RTN).
-
-[checks_modulus_example_3]
-
-[h5 Special cases]
-
-# [_ Numbers one beside the others]
-
-The first special case is to test a collection of number which are in the same container without special separation.
-
-[checks_modulus_example_4]
-
-This provides this output:
-
-[checks_modulus_output_4]
-
-[endsect][/section:modexamples Examples]
 
 [section:summary Summary]
 
@@ -122,9 +66,11 @@
 
 [table:id Summary of the modular sum algorithms
     [[Algorithm] [Modulus] [Weight pattern] [check digit range]]
-    [[Luhn] [10] [...21] [0..9]]
+    [[Luhn] [10] [... 2 1 2 1] [0..9]]
         [[Modulus 10] [10] [custom] [0..9]]
-	[[Modulus 11] [11] [n...4321] [0..9 + 'X']]
+	[[Modulus 11] [11] [... 2 1 10 ... 4 3 2 1] [0..9 + 'X']]
+	[[Modulus 97] [97] [][]]
+	[[Verhoeff] [][] []]
 ]
 
 [endsect][/section:summary Summary]