Source for org.jfree.formula.operators.AddOperator

   1: /**
   2:  * =========================================
   3:  * LibFormula : a free Java formula library
   4:  * =========================================
   5:  *
   6:  * Project Info:  http://reporting.pentaho.org/libformula/
   7:  *
   8:  * (C) Copyright 2006-2007, by Pentaho Corporation and Contributors.
   9:  *
  10:  * This library is free software; you can redistribute it and/or modify it under the terms
  11:  * of the GNU Lesser General Public License as published by the Free Software Foundation;
  12:  * either version 2.1 of the License, or (at your option) any later version.
  13:  *
  14:  * This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
  15:  * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  16:  * See the GNU Lesser General Public License for more details.
  17:  *
  18:  * You should have received a copy of the GNU Lesser General Public License along with this
  19:  * library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
  20:  * Boston, MA 02111-1307, USA.
  21:  *
  22:  * [Java is a trademark or registered trademark of Sun Microsystems, Inc.
  23:  * in the United States and other countries.]
  24:  *
  25:  *
  26:  * ------------
  27:  * $Id: AddOperator.java,v 1.10 2007/04/10 14:10:41 taqua Exp $
  28:  * ------------
  29:  * (C) Copyright 2006-2007, by Pentaho Corporation.
  30:  */
  31: package org.jfree.formula.operators;
  32: 
  33: import java.math.BigDecimal;
  34: 
  35: /**
  36:  * Null-Values are converted into ZERO
  37:  *
  38:  * @author Thomas Morgner
  39:  */
  40: public class AddOperator extends AbstractNumericOperator
  41: {
  42:   public AddOperator()
  43:   {
  44:   }
  45: 
  46:   public Number evaluate(final Number number1, final Number number2)
  47:   {
  48:     if ((number1 instanceof Integer || number1 instanceof Short) &&
  49:         (number2 instanceof Integer || number2 instanceof Short))
  50:     {
  51:       return new BigDecimal (number1.longValue() + number2.longValue());
  52:     }
  53: 
  54:     final BigDecimal bd1 = new BigDecimal(number1.toString());
  55:     final BigDecimal bd2 = new BigDecimal(number2.toString());
  56:     return bd1.add(bd2);
  57:   }
  58: 
  59:   public int getLevel()
  60:   {
  61:     return 200;
  62:   }
  63: 
  64: 
  65:   public String toString()
  66:   {
  67:     return "+";
  68:   }
  69: 
  70:   public boolean isLeftOperation()
  71:   {
  72:     return true;
  73:   }
  74: 
  75:   /**
  76:    * Defines, whether the operation is associative. For associative operations,
  77:    * the evaluation order does not matter, if the operation appears more than
  78:    * once in an expression, and therefore we can optimize them a lot better than
  79:    * non-associative operations (ie. merge constant parts and precompute them
  80:    * once).
  81:    *
  82:    * @return true, if the operation is associative, false otherwise
  83:    */
  84:   public boolean isAssociative()
  85:   {
  86:     return true;
  87:   }
  88: 
  89: }