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.strategy.util.Strategy06AlikeHelper;
23  
24  /**
25   * @author ninan
26   * 
27   */
28  public class Strategy84 implements Strategy {
29  
30  	private static final int[] multiplicators = new int[] { 0, 0, 0, 0, 6, 5,
31  			4, 3, 2, 0 };
32  
33  	/**
34  	 * @see net.sf.plausj.bank.german.strategy.Strategy#calculateCheckDigit(net.sf.plausj.bank.german.BankCode,
35  	 *      net.sf.plausj.bank.german.AccountCode)
36  	 */
37  	public CheckDigit calculateCheckDigit(final BankCode bankCode,
38  			final AccountCode accountCode) {
39  
40  		if (9 == accountCode.getDigitAtPos(2)) {
41  			Strategy s = new Strategy51();
42  			return s.calculateCheckDigit(bankCode, accountCode);
43  		} else {
44  			return calculateMethods(accountCode);
45  		}
46  
47  	}
48  
49  	private CheckDigit calculateMethods(final AccountCode accountCode) {
50  
51  		int sum = Strategy06AlikeHelper.calculateSum(accountCode,
52  				multiplicators);
53  		int cd = Strategy06AlikeHelper.getCheckDigitFromSum(sum);
54  
55  		CheckDigit cdObj = new CheckDigit(9, cd);
56  		if (!accountCode.matchesCheckDigit(cdObj)) {
57  			int mod = sum % 7;
58  			cd = mod == 0 ? 0 : 7 - mod;
59  		}
60  		cdObj = new CheckDigit(9, cd);
61  
62  		return cdObj;
63  
64  	}
65  }