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  
23  /**
24   * @author ninan
25   * 
26   */
27  public class Strategy76 implements Strategy {
28  
29  	private static final int[] multiplicators = new int[] { 0, 7, 6, 5, 4, 3,
30  			2, 0, 0, 0 };
31  
32  	private static final int[] multiplicatorsShifted = new int[] { 0, 0, 0, 7,
33  			6, 5, 4, 3, 2, 0 };
34  
35  	/**
36  	 * @see net.sf.plausj.bank.german.strategy.Strategy#calculateCheckDigit(net.sf.plausj.bank.german.BankCode,
37  	 *      net.sf.plausj.bank.german.AccountCode)
38  	 */
39  	public CheckDigit calculateCheckDigit(final BankCode bankCode,
40  			final AccountCode accountCode) {
41  
42  		if (0 != accountCode.getDigitAtPos(9)
43  				&& 0 != accountCode.getDigitAtPos(8)
44  				&& 0 == accountCode.getDigitAtPos(0)
45  				&& 0 == accountCode.getDigitAtPos(1)) {
46  
47  			int mod = getMod(accountCode, multiplicatorsShifted);
48  			if (mod != 10) {
49  				CheckDigit cd = new CheckDigit(9, mod);
50  				if (accountCode.matchesCheckDigit(cd)) {
51  					return cd;
52  				}
53  			}
54  
55  		}
56  
57  		int mod = getMod(accountCode, multiplicators);
58  		if (mod == 10) {
59  			return CheckDigit.NO_CHECK;
60  		}
61  
62  		return new CheckDigit(7, mod);
63  
64  	}
65  
66  	private int getMod(AccountCode accountCode, int[] multiplicators) {
67  
68  		int sum = 0;
69  		for (int i = AccountCode.ACCOUNT_CODE_MAX_LENGTH - 1; i >= 0; --i) {
70  			sum += accountCode.getDigitAtPos(i) * multiplicators[i];
71  		}
72  
73  		return sum % 11;
74  
75  	}
76  
77  }