View Javadoc

1   /*
2    * Copyright 2006 Christian Kalkhoff <me@ninan.info>
3    *
4    * Licensed under the Apache License, Version 2.0 (the "License");
5    * you may not use this file except in compliance with the License.
6    * You may obtain a copy of the License at
7    *
8    *         http://www.apache.org/licenses/LICENSE-2.0
9    *
10   * Unless required by applicable law or agreed to in writing, software
11   * distributed under the License is distributed on an "AS IS" BASIS,
12   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13   * See the License for the specific language governing permissions and
14   * limitations under the License.
15   */
16  
17  package net.sf.plausj.bank.german.strategy;
18  
19  import net.sf.plausj.bank.german.AccountCode;
20  import net.sf.plausj.bank.german.BankCode;
21  import net.sf.plausj.bank.german.CheckDigit;
22  import net.sf.plausj.bank.german.util.MathHelper;
23  
24  /**
25   * @author ninan
26   * 
27   */
28  public class Strategy61 implements Strategy {
29  
30  	private static final int[] multiplicatorsPartly = new int[] { 2, 1, 2, 1,
31  			2, 1, 2, 0, 0, 0 };
32  
33  	private static final int[] multiplicatorsFull = new int[] { 2, 1, 2, 1, 2,
34  			1, 2, 0, 1, 2 };
35  
36  	/**
37  	 * @see net.sf.plausj.bank.german.strategy.Strategy#calculateCheckDigit(net.sf.plausj.bank.german.BankCode,
38  	 *      net.sf.plausj.bank.german.AccountCode)
39  	 */
40  	public CheckDigit calculateCheckDigit(final BankCode bankCode,
41  			final AccountCode accountCode) {
42  		int[] multiplicators = null;
43  
44  		if (8 == accountCode.getDigitAtPos(8)) {
45  			multiplicators = multiplicatorsFull;
46  		} else {
47  			multiplicators = multiplicatorsPartly;
48  		}
49  
50  		int sum = 0;
51  		for (int i = 0; i < AccountCode.ACCOUNT_CODE_MAX_LENGTH; ++i) {
52  			int d = accountCode.getDigitAtPos(i);
53  			int m = multiplicators[i];
54  			sum += MathHelper.calcCrossTotal(d * m);
55  		}
56  
57  		int cd = 10 - MathHelper.getLastDigits(sum, 1);
58  
59  		return new CheckDigit(7, cd);
60  	}
61  
62  }