View Javadoc
1   /*
2    * Copyright (c) 2002-2015, Mairie de Paris
3    * All rights reserved.
4    *
5    * Redistribution and use in source and binary forms, with or without
6    * modification, are permitted provided that the following conditions
7    * are met:
8    *
9    *  1. Redistributions of source code must retain the above copyright notice
10   *     and the following disclaimer.
11   *
12   *  2. Redistributions in binary form must reproduce the above copyright notice
13   *     and the following disclaimer in the documentation and/or other materials
14   *     provided with the distribution.
15   *
16   *  3. Neither the name of 'Mairie de Paris' nor 'Lutece' nor the names of its
17   *     contributors may be used to endorse or promote products derived from
18   *     this software without specific prior written permission.
19   *
20   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21   * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22   * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23   * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
24   * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25   * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26   * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27   * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28   * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30   * POSSIBILITY OF SUCH DAMAGE.
31   *
32   * License 1.0
33   */
34  
35  package fr.paris.lutece.plugins.quotientfamille.business;
36  
37  import fr.paris.lutece.plugins.quotientfamille.service.TranchesService;
38  
39  /**
40   * QuotientFamilial
41   */
42  public class QuotientFamilial
43  {
44      private static int[] _tranches = { 500, 700, 900, 1100, 1300 ,1600, 2000, 2500 };
45      
46      // Variables declarations 
47      private int _nRevenuFiscalReference;
48      private double _dNombreParts;
49      
50      
51         /**
52          * Returns the RevenuFiscalReference
53          * @return The RevenuFiscalReference
54          */ 
55      public int getRevenuFiscalReference()
56      {
57          return _nRevenuFiscalReference;
58      }
59      
60         /**
61          * Sets the RevenuFiscalReference
62          * @param nRevenuFiscalReference The RevenuFiscalReference
63          */ 
64      public void setRevenuFiscalReference( int nRevenuFiscalReference )
65      {
66          _nRevenuFiscalReference = nRevenuFiscalReference;
67      }
68      
69         /**
70          * Returns the NombreParts
71          * @return The NombreParts
72          */ 
73      public double getNombreParts()
74      {
75          return _dNombreParts;
76      }
77      
78         /**
79          * Sets the NombreParts
80          * @param nNombreParts The NombreParts
81          */ 
82      public void setNombreParts( double nNombreParts )
83      {
84          _dNombreParts = nNombreParts;
85      }    
86      
87      
88      public int getQuotient()
89      {
90          return _nRevenuFiscalReference / (int) ( 12.0 * _dNombreParts );
91      }
92  /*    
93      public int getTranche()
94      {
95          return TranchesService.getTranche( getQuotient() );
96      }
97    */  
98      public int getTranche()
99      {
100         int nQuotient = getQuotient();
101         int nFloor = 0;
102         int nCeiling = _tranches[0];
103         int nTranche = 1;
104         
105         for( int i = 0 ; i < _tranches.length - 1 ; i++ )
106         {
107             nTranche = i + 1;
108             if( nQuotient >= nFloor && nQuotient < nCeiling )
109             {
110                 return nTranche;
111             }
112             nFloor = _tranches[i];
113             nCeiling = _tranches[i+1]; 
114         }
115         return nTranche;
116     }        
117 
118     
119 }