kopie aus org.apache.commons.validator.routines.checkdigit

TODO Syntaxfehler Oberklasse

Author: homebeaver

src/main/java/org/apache/commons/validator/routines/checkdigit/TidDECheckDigit.java

@@ -0,0 +1,118 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+package org.apache.commons.validator.routines.checkdigit;
+
+import org.apache.commons.logging.Log;
+import org.apache.commons.logging.LogFactory;
+
+/**
+ * German Steuer-Identifikationsnummer (TIN – in short: IdNr.) is available since 2008,
+ * has a length of 11 digits and it applies to individual persons.
+ *
+ * <p>
+ * See <a href="https://download.elster.de/download/schnittstellen/Pruefung_der_Steuer_und_Steueridentifikatsnummer.pdf">Prüfung der Steuer- und Steueridentifikationsnummer (de)</a>
+ * for more details.
+ * </p>
+ *
+ * @since 1.10.0
+ */
+public final class TidDECheckDigit extends Modulus11TenCheckDigit {
+
+    private static final long serialVersionUID = 4222306963463322195L;
+    private static final Log LOG = LogFactory.getLog(TidDECheckDigit.class);
+
+    /** Singleton Check Digit instance */
+    private static final TidDECheckDigit INSTANCE = new TidDECheckDigit();
+
+    /**
+     * Gets the singleton instance of this validator.
+     * @return A singleton instance of the class.
+     */
+    public static CheckDigit getInstance() {
+        return INSTANCE;
+    }
+
+    private TidDECheckDigit() {
+        super();
+    }
+
+    /**
+     * {@inheritDoc} <p>
+     * Override to count ciphers to and check the criteria:
+     * </p>
+     * <ul>
+     * <li>The first 10 digits of the identification number must contain
+     * exactly one duplicate or triplicate digit.
+     * </li>
+     * <li>Are there three identical digits in positions 1 to 10,
+     * these identical digits must never be directly next to each other.
+     * </li>
+     * </ul>
+     */
+    @Override
+    protected int calculateModulus(final String code, final boolean includesCheckDigit) throws CheckDigitException {
+        int product = MODULUS_10;
+        int sum = 0;
+        final int[] anzahl = new int[10];  // CHECKSTYLE IGNORE MagicNumber
+        final int[] fstpos = new int[10];  // CHECKSTYLE IGNORE MagicNumber
+        for (int i = 0; i < code.length() - (includesCheckDigit ? 1 : 0); i++) {
+            final int leftPos = i + 1;
+            final int rightPos = -1; // rightPos param not used
+            final int cipher = toInt(code.charAt(i), leftPos, rightPos);
+            anzahl[cipher]++; // Ziffern zählen
+            if (fstpos[cipher] == 0) {
+                fstpos[cipher] = i;
+            }
+            sum = cipher + product;
+            sum = sum % MODULUS_10;
+            product = 2 * (sum == 0 ? MODULUS_10 : sum) % MODULUS_11;
+        }
+        LOG.debug(code + ": Zifferanzahl auswerten");
+        int doppelt = 0;
+        int dreifach = 0;
+        int dreifachz = -1;
+        for (int i = 0; i < anzahl.length; i++) {
+            if (anzahl[i] == 2) { // CHECKSTYLE IGNORE MagicNumber
+                doppelt++;
+            }
+            if (anzahl[i] == 3) { // CHECKSTYLE IGNORE MagicNumber
+                dreifach++;
+                dreifachz = i;
+            }
+        }
+        if (doppelt == 0 && dreifach == 0) {
+            LOG.warn(code + ": keine doppelt und keine dreifach");
+            throw new CheckDigitException("Invalid code, keine doppelt und keine dreifach");
+        } else if (doppelt > 1) {
+            LOG.warn(code + ": mehrere doppelt");
+            throw new CheckDigitException("Invalid code, mehrere doppelt");
+        } else if (dreifach > 1) {
+            LOG.warn(code + ": mehrere dreifach");
+            throw new CheckDigitException("Invalid code, mehrere dreifach");
+        } else if (dreifach == 1) {
+            final int i = code.indexOf("" + dreifachz);
+            if (dreifachz == toInt(code.charAt(i + 1), i + 1, -1)
+                && dreifachz == toInt(code.charAt(i + 2), i + 2, -1)) {
+                LOG.warn(code + ": dreifach direkt hintereinander Ziffer:" + dreifachz);
+                throw new CheckDigitException("Invalid code, dreifach direkt hintereinander");
+            }
+        }
+        final int pruefZiffer = MODULUS_11 - product;
+        return pruefZiffer == MODULUS_10 ? 0 : pruefZiffer;
+    }
+
+}