001    /**
002     * =========================================
003     * LibFormula : a free Java formula library
004     * =========================================
005     *
006     * Project Info:  http://reporting.pentaho.org/libformula/
007     *
008     * (C) Copyright 2006-2007, by Pentaho Corporation and Contributors.
009     *
010     * This library is free software; you can redistribute it and/or modify it under the terms
011     * of the GNU Lesser General Public License as published by the Free Software Foundation;
012     * either version 2.1 of the License, or (at your option) any later version.
013     *
014     * This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
015     * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
016     * See the GNU Lesser General Public License for more details.
017     *
018     * You should have received a copy of the GNU Lesser General Public License along with this
019     * library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
020     * Boston, MA 02111-1307, USA.
021     *
022     * [Java is a trademark or registered trademark of Sun Microsystems, Inc.
023     * in the United States and other countries.]
024     *
025     *
026     * ------------
027     * $Id: AddOperator.java 2752 2007-04-10 14:10:41Z taqua $
028     * ------------
029     * (C) Copyright 2006-2007, by Pentaho Corporation.
030     */
031    package org.jfree.formula.operators;
032    
033    import java.math.BigDecimal;
034    
035    /**
036     * Null-Values are converted into ZERO
037     *
038     * @author Thomas Morgner
039     */
040    public class AddOperator extends AbstractNumericOperator
041    {
042      public AddOperator()
043      {
044      }
045    
046      public Number evaluate(final Number number1, final Number number2)
047      {
048        if ((number1 instanceof Integer || number1 instanceof Short) &&
049            (number2 instanceof Integer || number2 instanceof Short))
050        {
051          return new BigDecimal (number1.longValue() + number2.longValue());
052        }
053    
054        final BigDecimal bd1 = new BigDecimal(number1.toString());
055        final BigDecimal bd2 = new BigDecimal(number2.toString());
056        return bd1.add(bd2);
057      }
058    
059      public int getLevel()
060      {
061        return 200;
062      }
063    
064    
065      public String toString()
066      {
067        return "+";
068      }
069    
070      public boolean isLeftOperation()
071      {
072        return true;
073      }
074    
075      /**
076       * Defines, whether the operation is associative. For associative operations,
077       * the evaluation order does not matter, if the operation appears more than
078       * once in an expression, and therefore we can optimize them a lot better than
079       * non-associative operations (ie. merge constant parts and precompute them
080       * once).
081       *
082       * @return true, if the operation is associative, false otherwise
083       */
084      public boolean isAssociative()
085      {
086        return true;
087      }
088    
089    }