2002-01-30 21:22:28 -05:00
/ * = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
* The Apache Software License , Version 1 . 1
*
* Copyright ( c ) 2002 The Apache Software Foundation . All rights
* reserved .
*
* Redistribution and use in source and binary forms , with or without
* modification , are permitted provided that the following conditions
* are met :
*
* 1 . Redistributions of source code must retain the above copyright
* notice , this list of conditions and the following disclaimer .
*
* 2 . Redistributions in binary form must reproduce the above copyright
* notice , this list of conditions and the following disclaimer in
* the documentation and / or other materials provided with the
* distribution .
*
* 3 . The end - user documentation included with the redistribution ,
* if any , must include the following acknowledgment :
* " This product includes software developed by the
* Apache Software Foundation ( http : //www.apache.org/)."
* Alternately , this acknowledgment may appear in the software itself ,
* if and wherever such third - party acknowledgments normally appear .
*
* 4 . The names " Apache " and " Apache Software Foundation " and
* " Apache POI " must not be used to endorse or promote products
* derived from this software without prior written permission . For
* written permission , please contact apache @apache.org.
*
* 5 . Products derived from this software may not be called " Apache " ,
* " Apache POI " , nor may " Apache " appear in their name , without
* prior written permission of the Apache Software Foundation .
*
* THIS SOFTWARE IS PROVIDED ` ` AS IS ' ' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES , INCLUDING , BUT NOT LIMITED TO , THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED . IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT , INDIRECT , INCIDENTAL ,
* SPECIAL , EXEMPLARY , OR CONSEQUENTIAL DAMAGES ( INCLUDING , BUT NOT
* LIMITED TO , PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES ; LOSS OF
* USE , DATA , OR PROFITS ; OR BUSINESS INTERRUPTION ) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY , WHETHER IN CONTRACT , STRICT LIABILITY ,
* OR TORT ( INCLUDING NEGLIGENCE OR OTHERWISE ) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE , EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE .
* = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation . For more
* information on the Apache Software Foundation , please see
* < http : //www.apache.org/>.
* /
/ *
* Ptg . java
*
* Created on October 28 , 2001 , 6 : 30 PM
* /
package org.apache.poi.hssf.record.formula ;
2002-04-18 08:00:53 -04:00
import java.util.List ;
import java.util.ArrayList ;
2002-01-30 21:22:28 -05:00
/ * *
*
* @author andy
* /
public abstract class Ptg
{
/** Creates new Ptg */
2002-04-18 08:00:53 -04:00
2002-01-30 21:22:28 -05:00
public Ptg ( )
{
}
2002-04-18 08:00:53 -04:00
2002-04-27 10:07:53 -04:00
/ * * convert infix order ptg list to rpn order ptg list
* @return List ptgs in RPN order
* @param infixPtgs List of ptgs in infix order
* /
public static List ptgsToRpn ( List infixPtgs ) {
java . util . Stack operands = new java . util . Stack ( ) ;
java . util . List retval = new java . util . Stack ( ) ;
java . util . ListIterator i = infixPtgs . listIterator ( ) ;
Object p ;
OperationPtg o ;
boolean weHaveABracket = false ;
while ( i . hasNext ( ) ) {
p = i . next ( ) ;
if ( p instanceof OperationPtg ) {
if ( p instanceof ParenthesisPtg ) {
if ( ! weHaveABracket ) {
operands . push ( p ) ;
weHaveABracket = true ;
} else {
o = ( OperationPtg ) operands . pop ( ) ;
while ( ! ( o instanceof ParenthesisPtg ) ) {
retval . add ( o ) ;
}
weHaveABracket = false ;
}
} else {
while ( ! operands . isEmpty ( ) & & ( ( OperationPtg ) operands . peek ( ) ) . getPrecedence ( ) > = ( ( OperationPtg ) p ) . getPrecedence ( ) ) { //TODO handle ^ since it is right associative
retval . add ( operands . pop ( ) ) ;
}
operands . push ( p ) ;
}
} else {
retval . add ( p ) ;
}
}
while ( ! operands . isEmpty ( ) ) {
if ( operands . peek ( ) instanceof ParenthesisPtg ) {
//throw some error
} else {
retval . add ( operands . pop ( ) ) ;
}
}
return retval ;
}
2002-04-18 08:00:53 -04:00
2002-04-20 19:42:10 -04:00
/ *
private static List ptgsToList ( Class [ ] ptgs )
2002-04-18 08:00:53 -04:00
{
List result = new ArrayList ( ) ;
Constructor constructor ;
2002-01-30 21:22:28 -05:00
2002-04-18 08:00:53 -04:00
for ( int i = 0 ; i < ptgs . length ; i + + )
{
Class ptg = null ;
ptg = ptgs [ i ] ;
try
{
constructor = ptg . getConstructor ( new Class [ ]
{
byte [ ] . class , int . class
} ) ;
}
catch ( Exception illegalArgumentException )
{
throw new RuntimeException (
" Now that didn't work nicely at all (couldn't do that there list of ptgs) " ) ;
}
result . add ( constructor ) ;
}
return result ;
} * /
2002-04-20 19:42:10 -04:00
public static Ptg createPtg ( byte [ ] data , int offset )
2002-01-30 21:22:28 -05:00
{
byte id = data [ offset + 0 ] ;
Ptg retval = null ;
2002-04-23 18:24:41 -04:00
2002-01-30 21:22:28 -05:00
switch ( id )
{
case AddPtg . sid :
retval = new AddPtg ( data , offset ) ;
break ;
case SubtractPtg . sid :
retval = new SubtractPtg ( data , offset ) ;
break ;
case IntPtg . sid :
retval = new IntPtg ( data , offset ) ;
break ;
case DividePtg . sid :
retval = new DividePtg ( data , offset ) ;
break ;
case MultiplyPtg . sid :
retval = new MultiplyPtg ( data , offset ) ;
break ;
case PowerPtg . sid :
retval = new PowerPtg ( data , offset ) ;
break ;
2002-04-28 12:33:57 -04:00
case ConcatPtg . sid :
retval = new ConcatPtg ( data , offset ) ;
break ;
2002-01-30 21:22:28 -05:00
case AreaPtg . sid :
retval = new AreaPtg ( data , offset ) ;
break ;
case MemErrPtg . sid :
retval = new MemErrPtg ( data , offset ) ;
break ;
case AttrPtg . sid :
retval = new AttrPtg ( data , offset ) ;
break ;
case ValueReferencePtg . sid :
retval = new ValueReferencePtg ( data , offset ) ;
break ;
2002-04-20 19:42:10 -04:00
// case ParenthesisPtg.sid :
// retval = new ParenthesisPtg(data, offset);
// break;
2002-01-30 21:22:28 -05:00
case ValueVariableFunctionPtg . sid :
retval = new ValueVariableFunctionPtg ( data , offset ) ;
break ;
case NamePtg . sid :
retval = new NamePtg ( data , offset ) ;
break ;
case ExpPtg . sid :
retval = new ExpPtg ( data , offset ) ;
break ;
2002-04-23 18:24:41 -04:00
case Area3DPtg . sid :
retval = new Area3DPtg ( data , offset ) ;
break ;
case Ref3DPtg . sid :
retval = new Ref3DPtg ( data , offset ) ;
break ;
2002-01-30 21:22:28 -05:00
default :
// retval = new UnknownPtg();
throw new RuntimeException ( " Unknown PTG = "
+ Integer . toHexString ( ( int ) id )
+ " ( " + ( int ) id + " ) " ) ;
}
return retval ;
2002-04-20 19:42:10 -04:00
}
2002-01-30 21:22:28 -05:00
public abstract int getSize ( ) ;
public final byte [ ] getBytes ( )
{
int size = getSize ( ) ;
byte [ ] bytes = new byte [ size ] ;
writeBytes ( bytes , 0 ) ;
return bytes ;
}
public abstract void writeBytes ( byte [ ] array , int offset ) ;
public abstract String toFormulaString ( ) ;
2002-04-18 08:00:53 -04:00
/ * *
* Ptg ' s should override this
* /
// public boolean isNextStringToken(String formula, int pos) {
// return false;
// }
public int getPrecedence ( ) {
return 100 ;
}
public int getStringLength ( ) {
return 0 ;
}
2002-01-30 21:22:28 -05:00
}