All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.databene.benerator.util.LuhnUtil Maven / Gradle / Ivy

Go to download

benerator is a framework for creating realistic and valid high-volume test data, used for testing (unit/integration/load) and showcase setup. Metadata constraints are imported from systems and/or configuration files. Data can imported from and exported to files and systems, anonymized or generated from scratch. Domain packages provide reusable generators for creating domain-specific data as names and addresses internationalizable in language and region. It is strongly customizable with plugins and configuration options.

The newest version!
/*
 * (c) Copyright 2009 by Volker Bergmann. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, is permitted under the terms of the
 * GNU General Public License (GPL).
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * WITHOUT A WARRANTY OF ANY KIND. ALL EXPRESS OR IMPLIED CONDITIONS,
 * REPRESENTATIONS AND WARRANTIES, INCLUDING ANY IMPLIED WARRANTY OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE
 * HEREBY EXCLUDED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

package org.databene.benerator.util;

/**
 * Provides utility methods for Luhn check digit calculation.

* Created: 18.10.2009 10:06:01 * @since 0.6.0 * @author Volker Bergmann */ public class LuhnUtil { private LuhnUtil() { } /** * Calculates the last digit expected for a number that passes the Luhn test, * ignoring the last digit. This is useful for creating Luhn numbers. * The actual evaluation if a number passes the test is done by * {@link #luhnValid(CharSequence)}. * @see "http://en.wikipedia.org/wiki/Luhn_algorithm" */ public static char requiredCheckDigit(CharSequence number) { int sum = 0; int multiplier = 2; for (int i = number.length() - 2; i >= 0; i--) { int digit = number.charAt(i) - '0'; int partialSum = digit * multiplier; sum += (partialSum > 9 ? 1 + (partialSum % 10) : partialSum); multiplier = 1 + (multiplier % 2); } return (char) ('0' + (10 - sum % 10) % 10); } /** * Tests a number against the Luhn algorithm * @see #requiredCheckDigit(CharSequence) * @see "http://en.wikipedia.org/wiki/Luhn_algorithm" */ public static boolean luhnValid(CharSequence number) { return (requiredCheckDigit(number) == number.charAt(number.length() - 1)); } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy