1 /*
2 * Licensed to the Apache Software Foundation (ASF) under one or more
3 * contributor license agreements. See the NOTICE file distributed with
4 * this work for additional information regarding copyright ownership.
5 * The ASF licenses this file to You under the Apache License, Version 2.0
6 * (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 *
9 * http://www.apache.org/licenses/LICENSE-2.0
10 *
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
16 */
17 package org.apache.commons.validator.routines.checkdigit;
18
19 import org.apache.commons.validator.GenericValidator;
20 import org.apache.commons.validator.routines.CodeValidator;
21
22 /**
23 * Modulus 10 <b>CAS Registry Number</b> (or <b>Chemical Abstracts Service</b> (CAS RN)) Check Digit
24 * calculation/validation.
25 *
26 * <p>
27 * CAS Numbers are unique identification numbers used
28 * to identify chemical substance described in the open scientific literature.
29 * </p>
30 *
31 * <p>
32 * Check digit calculation is based on <i>modulus 10</i> with digits being weighted
33 * based on their position (from right to left).
34 * </p>
35 *
36 * <p>
37 * The check digit is found by taking the last digit times 1, the preceding digit times 2,
38 * the preceding digit times 3 etc., adding all these up and computing the sum modulo 10.
39 * For example, the CAS number of water is <code>7732-18-5</code>:
40 * the checksum 5 is calculated as (8×1 + 1×2 + 2×3 + 3×4 + 7×5 + 7×6) = 105; 105 mod 10 = 5.
41 * </p>
42 *
43 * <p>
44 * For further information see
45 * <a href="https://en.wikipedia.org/wiki/CAS_Registry_Number">Wikipedia - CAS Registry Number</a>.
46 * </p>
47 *
48 * @since 1.9.0
49 */
50 public final class CASNumberCheckDigit extends ModulusCheckDigit {
51
52 private static final long serialVersionUID = -5387334603220786657L;
53
54 /** Singleton Check Digit instance */
55 private static final CASNumberCheckDigit INSTANCE = new CASNumberCheckDigit();
56
57 /**
58 * Gets the singleton instance of this validator.
59 * @return A singleton instance of the CAS Number validator.
60 */
61 public static CheckDigit getInstance() {
62 return INSTANCE;
63 }
64
65 /**
66 * CAS number consists of 3 groups of numbers separated dashes (-).
67 * First group has 2 to 7 digits.
68 * Example: water is 7732-18-5
69 */
70 private static final String GROUP1 = "(\\d{2,7})";
71 private static final String DASH = "(?:\\-)";
72 static final String CAS_REGEX = "^(?:" + GROUP1 + DASH + "(\\d{2})" + DASH + "(\\d))$";
73
74 private static final int CAS_MIN_LEN = 4; // 9-99-9 LEN without SEP
75 /** maximum capacity of 1,000,000,000 == 9999999-99-9*/
76 private static final int CAS_MAX_LEN = 10;
77 static final CodeValidator REGEX_VALIDATOR = new CodeValidator(CAS_REGEX, CAS_MIN_LEN, CAS_MAX_LEN, null);
78
79 /** Weighting given to digits depending on their right position */
80 private static final int[] POSITION_WEIGHT = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
81
82 /**
83 * Constructs a modulus 10 Check Digit routine for CAS Numbers.
84 */
85 private CASNumberCheckDigit() {
86 }
87
88 /**
89 * Calculates the <i>weighted</i> value of a character in the code at a specified position.
90 * <p>
91 * CAS numbers are weighted in the following manner:
92 * </p>
93 * <pre><code>
94 * right position: 1 2 3 4 5 6 7 8 9 10
95 * weight: 1 2 3 4 5 6 7 8 9 0
96 * </code></pre>
97 *
98 * @param charValue The numeric value of the character.
99 * @param leftPos The position of the character in the code, counting from left to right
100 * @param rightPos The positionof the character in the code, counting from right to left
101 * @return The weighted value of the character.
102 */
103 @Override
104 protected int weightedValue(final int charValue, final int leftPos, final int rightPos) {
105 final int weight = POSITION_WEIGHT[(rightPos - 1) % MODULUS_10];
106 return charValue * weight;
107 }
108
109 /**
110 * {@inheritDoc}
111 */
112 @Override
113 public String calculate(final String code) throws CheckDigitException {
114 if (GenericValidator.isBlankOrNull(code)) {
115 throw new CheckDigitException("Code is missing");
116 }
117 final int modulusResult = INSTANCE.calculateModulus(code, false);
118 return toCheckDigit(modulusResult);
119 }
120
121 /**
122 * {@inheritDoc}
123 */
124 @Override
125 public boolean isValid(final String code) {
126 if (GenericValidator.isBlankOrNull(code)) {
127 return false;
128 }
129 final Object cde = REGEX_VALIDATOR.validate(code);
130 if (!(cde instanceof String)) {
131 return false;
132 }
133 try {
134 final int modulusResult = INSTANCE.calculateModulus((String) cde, true);
135 return modulusResult == Character.getNumericValue(code.charAt(code.length() - 1));
136 } catch (final CheckDigitException ex) {
137 return false;
138 }
139 }
140
141 }