-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathluhn.cpp
503 lines (449 loc) · 8.68 KB
/
luhn.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
# include <cmath>
# include <cstdlib>
# include <cstring>
# include <ctime>
# include <iomanip>
# include <iostream>
using namespace std;
# include "luhn.hpp"
//****************************************************************************80
bool ch_is_digit ( char ch )
//****************************************************************************80
//
// Purpose:
//
// CH_IS_DIGIT returns TRUE if a character is a decimal digit.
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 10 September 2015
//
// Author:
//
// John Burkardt
//
// Parameters:
//
// Input, char CH, the character to be analyzed.
//
// Output, bool CH_IS_DIGIT, is TRUE if the character is a digit.
//
{
bool value;
if ( '0' <= ch && ch <= '9' )
{
value = true;
}
else
{
value = false;
}
return value;
}
//****************************************************************************80
int ch_to_digit ( char ch )
//****************************************************************************80
//
// Purpose:
//
// CH_TO_DIGIT returns the integer value of a base 10 digit.
//
// Example:
//
// CH DIGIT
// --- -----
// '0' 0
// '1' 1
// ... ...
// '9' 9
// ' ' -1
// 'X' -1
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 10 September 2015
//
// Author:
//
// John Burkardt
//
// Parameters:
//
// Input, char CH, the decimal digit, '0' through '9' are legal.
//
// Output, int CH_TO_DIGIT, the corresponding integer value. If the
// character was 'illegal', then DIGIT is -1.
//
{
int value;
if ( '0' <= ch && ch <= '9' )
{
value = ch - '0';
}
else
{
value = -1;
}
return value;
}
//****************************************************************************80
void i4vec_print ( int n, int a[], string title )
//****************************************************************************80
//
// Purpose:
//
// I4VEC_PRINT prints an I4VEC.
//
// Discussion:
//
// An I4VEC is a vector of integer values.
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 30 August 2009
//
// Author:
//
// John Burkardt
//
// Parameters:
//
// Input, int N, the number of components of the vector.
//
// Input, int A[N], the vector to be printed.
//
// Input, string TITLE, a title to be printed first.
// TITLE may be blank.
//
{
int i;
cout << "\n";
cout << title << "\n";
cout << "\n";
for ( i = 0; i <= n-1; i++ )
{
cout << setw(6) << i + 1 << " "
<< setw(8) << a[i] << "\n";
}
return;
}
//****************************************************************************80
int luhn_check_digit_calculate ( string s )
//****************************************************************************80
//
// Purpose:
//
// LUHN_CHECK_DIGIT_CALCULATE determines the Luhn check digit of a string.
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 11 September 2015
//
// Reference:
//
// https://en.wikipedia.org/wiki/Luhn_algorithm
//
// Parameters:
//
// Input, string S, the string of digits to be checked.
//
// Output, integer LUHN_CHECK_DIGIT_CALCULATE, the Luhn check digit for
// this string.
//
{
int s_len;
string s2;
int value;
s_len = s.length ( );
s2 = s + '0';
value = luhn_checksum ( s2 );
if ( value != 0 )
{
value = 10 - value;
}
return value;
}
//****************************************************************************80
int luhn_checksum ( string s )
//****************************************************************************80
//
// Purpose:
//
// LUHN_CHECKSUM determines the Luhn checksum of a string.
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 11 September 2015
//
// Reference:
//
// https://en.wikipedia.org/wiki/Luhn_algorithm
//
// Parameters:
//
// Input, string S, the string of digits to be checked.
//
// Output, int VALUE, is the Luhn checksum for this string.
//
{
int d2;
int *dvec;
int i;
int n;
int value;
//
// Count the digits in S.
//
n = s_digits_count ( s );
//
// Extract the digits from S.
//
dvec = s_to_digits ( s, n );
//
// Starting with the last-th digit, and going down by 2's,
// add the digit to the sum.
//
value = 0;
for ( i = n - 1; 0 <= i; i = i - 2 )
{
value = value + dvec[i];
}
//
// Starting with the next to the last digit, and going down by 2's,
// double the digit, and ADD THE DIGITS to the sum.
//
for ( i = n - 2; 0 <= i; i = i - 2 )
{
d2 = 2 * dvec[i];
value = value + ( d2 / 10 ) + ( d2 % 10 );
}
value = ( value % 10 );
delete [] dvec;
return value;
}
//****************************************************************************80
bool luhn_is_valid ( string s )
//****************************************************************************80
//
// Purpose:
//
// LUHN_IS_VALID determines whether a string with Luhn check digit is valid.
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 11 September 2015
//
// Reference:
//
// https://en.wikipedia.org/wiki/Luhn_algorithm
//
// Parameters:
//
// Input, string S, the string of digits to be checked.
//
// Output, bool LUHN_IS_VALID, TRUE if the string is valid.
//
{
int d;
bool value;
d = luhn_checksum ( s );
if ( d == 0 )
{
value = true;
}
else
{
value = false;
}
return value;
}
//****************************************************************************80
int s_digits_count ( string s )
//****************************************************************************80
//
// Purpose:
//
// S_DIGITS_COUNT counts the digits in a string.
//
// Discussion:
//
// The string may include spaces, letters, and dashes, but only the
// digits 0 through 9 will be counted.
//
// Example:
//
// S => 34E94-70.6
// N <= 7
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 09 September 2015
//
// Author:
//
// John Burkardt
//
// Parameters:
//
// Input, string S, the string.
//
// Output, int S_DIGITS_COUNT, the number of digits.
//
{
char c;
int n;
int s_len;
int s_pos;
s_len = s.length ( );
s_pos = 0;
n = 0;
while ( s_pos < s_len )
{
c = s[s_pos];
s_pos = s_pos + 1;
if ( ch_is_digit ( c ) )
{
n = n + 1;
}
}
return n;
}
//****************************************************************************80
int *s_to_digits ( string s, int n )
//****************************************************************************80
//
// Purpose:
//
// S_TO_DIGITS extracts N digits from a string.
//
// Discussion:
//
// The string may include spaces, letters, and dashes, but only the
// digits 0 through 9 will be extracted.
//
// Example:
//
// S => 34E94-70.6
// N => 5
// D <= (/ 3, 4, 9, 4, 7 /)
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 09 September 2015
//
// Author:
//
// John Burkardt
//
// Parameters:
//
// Input, string S, the string.
//
// Input, int N, the number of digits to extract.
//
// Output, int S_TO_DIGITS[N], the extracted digits.
//
{
char c;
int d;
int d_pos;
int *dvec;
int s_len;
int s_pos;
dvec = new int[n];
s_len = s.length ( );
s_pos = 0;
d_pos = 0;
while ( d_pos < n )
{
if ( s_len <= s_pos )
{
cerr << "\n";
cerr << "S_TO_DIGITS - Fatal error!\n";
cerr << " Could not read enough data from string.\n";
exit ( 1 );
}
c = s[s_pos];
s_pos = s_pos + 1;
if ( ch_is_digit ( c ) )
{
d = ch_to_digit ( c );
dvec[d_pos] = d;
d_pos = d_pos + 1;
}
}
return dvec;
}
//****************************************************************************80
void timestamp ( )
//****************************************************************************80
//
// Purpose:
//
// TIMESTAMP prints the current YMDHMS date as a time stamp.
//
// Example:
//
// 31 May 2001 09:45:54 AM
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 08 July 2009
//
// Author:
//
// John Burkardt
//
// Parameters:
//
// None
//
{
# define TIME_SIZE 40
static char time_buffer[TIME_SIZE];
const struct std::tm *tm_ptr;
size_t len;
std::time_t now;
now = std::time ( NULL );
tm_ptr = std::localtime ( &now );
len = std::strftime ( time_buffer, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm_ptr );
std::cout << time_buffer << "\n";
return;
# undef TIME_SIZE
}