1 /*
2 * (c) Copyright 2006-2020 by rapiddweller GmbH & Volker Bergmann. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, is permitted under the terms of the
6 * GNU General Public License.
7 *
8 * For redistributing this software or a derivative work under a license other
9 * than the GPL-compatible Free Software License as defined by the Free
10 * Software Foundation or approved by OSI, you must first obtain a commercial
11 * license to this software product from rapiddweller GmbH & Volker Bergmann.
12 *
13 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
14 * WITHOUT A WARRANTY OF ANY KIND. ALL EXPRESS OR IMPLIED CONDITIONS,
15 * REPRESENTATIONS AND WARRANTIES, INCLUDING ANY IMPLIED WARRANTY OF
16 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE
17 * HEREBY EXCLUDED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
18 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
19 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
20 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
21 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
22 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
23 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
24 * POSSIBILITY OF SUCH DAMAGE.
25 */
26
27 package com.rapiddweller.domain.person;
28
29 import com.rapiddweller.common.validator.bean.AbstractConstraintValidator;
30
31 import javax.validation.ConstraintValidatorContext;
32
33 /**
34 * Validates European Tax Identification Numbers.<br/>
35 * <br/>
36 * Created at 27.08.2008 00:06:33
37 *
38 * @author Volker Bergmann
39 * @since 0.5.5
40 */
41 public class TINValidator extends AbstractConstraintValidator<TIN, String> {
42
43 /**
44 * Calculate checksum int.
45 *
46 * @param number the number
47 * @return the int
48 */
49 public static int calculateChecksum(String number) {
50 int product = 0;
51 for (int i = 0; i < 10; i++) {
52 int sum = (number.charAt(i) - '0' + product) % 10;
53 if (sum == 0) {
54 sum = 10;
55 }
56 product = (sum * 2) % 11;
57 }
58 int checksum = 11 - product;
59 if (checksum == 10) {
60 checksum = 0;
61 }
62 return checksum;
63 }
64
65 @Override
66 public boolean isValid(String number, ConstraintValidatorContext context) {
67 if (number == null || number.length() != 11) {
68 return false;
69 }
70 boolean[] digitUsed = new boolean[10];
71 // assure that at most one digit is used twice
72 int doubleCount = 0;
73 for (int i = 0; i < 10; i++) {
74 int digit = number.charAt(i) - '0';
75 boolean used = digitUsed[digit];
76 if (!used) {
77 digitUsed[digit] = true;
78 } else {
79 doubleCount++;
80 if (doubleCount == 2) {
81 return false;
82 }
83 }
84 }
85 // assure that there is exactly one digit used twice
86 if (doubleCount == 0) {
87 return false;
88 }
89 int checksum = calculateChecksum(number);
90 return (number.charAt(10) == checksum + '0');
91 }
92
93 }