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: GreaterOperator.java 2887 2007-06-06 17:07:52Z taqua $
028     * ------------
029     * (C) Copyright 2006-2007, by Pentaho Corporation.
030     */
031    package org.jfree.formula.operators;
032    
033    /**
034     * Creation-Date: 31.10.2006, 16:34:11
035     *
036     * @author Thomas Morgner
037     */
038    public class GreaterOperator extends AbstractCompareOperator
039    {
040      public GreaterOperator()
041      {
042      }
043    
044      protected boolean evaluate(final int compareResult)
045      {
046        return compareResult > 0;
047      }
048    
049      public int getLevel()
050      {
051        return 400;
052      }
053    
054      public String toString()
055      {
056        return ">";
057      }
058    
059      public boolean isLeftOperation()
060      {
061        return true;
062      }
063    
064      /**
065       * Defines, whether the operation is associative. For associative operations,
066       * the evaluation order does not matter, if the operation appears more than
067       * once in an expression, and therefore we can optimize them a lot better than
068       * non-associative operations (ie. merge constant parts and precompute them
069       * once).
070       *
071       * @return true, if the operation is associative, false otherwise
072       */
073      public boolean isAssociative()
074      {
075        return false;
076      }
077    
078    }