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 StrategyA0 implements Strategy {
28  
29  	private static final int[] multiplicators = new int[] { 0, 0, 0, 0, 10, 5,
30  			8, 4, 2 };
31  
32  	/**
33  	 * @see net.sf.plausj.bank.german.strategy.Strategy#calculateCheckDigit(net.sf.plausj.bank.german.BankCode,
34  	 *      net.sf.plausj.bank.german.AccountCode)
35  	 */
36  	public CheckDigit calculateCheckDigit(final BankCode bankCode,
37  			final AccountCode accountCode) {
38  
39  		if (accountCode.getRealLength() <= 3) {
40  			return new CheckDigit(CheckDigit.ALWAYS_VALID, 0);
41  		}
42  
43  		int sum = 0;
44  		for (int i = AccountCode.ACCOUNT_CODE_MAX_LENGTH - 2; i >= 0; --i) {
45  			sum += accountCode.getDigitAtPos(i) * multiplicators[i];
46  		}
47  		int mod = sum % 11;
48  		int cd = (mod == 0 || mod == 1) ? 0 : 11 - mod;
49  
50  		return new CheckDigit(9, cd);
51  
52  	}
53  
54  }