9d263b1141
* harbour/include/hbcompdf.h
+ added comment
* harbour/include/hbexpra.c
* change expression type for <exp> = <exp> from HB_EO_EQUAL
to HB_EO_ASSIGN in hb_compExprGenStatement() function so
later we can safely make all optimization in hb_compExprUseEqual()
during reduce process - optimization only when PCODE is generated
is too late and causes that expressions like:
iif( 1 = 1, <exp>, <exp> )
are not reduces (Clipper reduce them)
* do not execute hb_compFunCallCheck() in hb_compExprNewFunCall()
to avoid repeating the same error message in hb_compExprUseFunCall()
* harbour/include/hbexprb.c
* enabled reduction for hb_compExprUseEqual() and generate errors
when it's used as statement
* harbour/source/common/expropt2.c
* added some missing reductions for expressions like: NIL == NIL
* harbour/source/common/reserved.c
% very basic optimization: use binary search instead of linear
scanning for reserved words and shortcuts - it gives noticeable
speed improvement in macro compiler
* harbour/source/compiler/complex.c
* changed the order of special keywords to keep alphabetic sorting
* harbour/source/compiler/harbour.c
% some minor optimizations in aliased expressions
! added protection in hb_compIsJump() to avoid possible problems
when this function is executed after replacing some code with
jumps by series of NOOPs in optimizations process
* harbour/source/compiler/hbfix.c
* better optimization of PCODE generated for logical expressions
* harbour/source/compiler/hbfunchk.c
% use binary search instead of linear scan
* harbour/source/rtl/minmax.c
! fixed GPF when MIN() or MAX() function is called with less then
two parameters
* harbour/source/vm/itemapi.c
* minor optimization and formatting
162 lines
5.0 KiB
C
162 lines
5.0 KiB
C
/*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* Harbour Project source code:
|
|
* MIN(), MAX() functions
|
|
*
|
|
* Copyright 1999 Matthew Hamilton <mhamilton@bunge.com.au>
|
|
* www - http://www.harbour-project.org
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2, or (at your option)
|
|
* any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this software; see the file COPYING. If not, write to
|
|
* the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
|
|
* Boston, MA 02111-1307 USA (or visit the web site http://www.gnu.org/).
|
|
*
|
|
* As a special exception, the Harbour Project gives permission for
|
|
* additional uses of the text contained in its release of Harbour.
|
|
*
|
|
* The exception is that, if you link the Harbour libraries with other
|
|
* files to produce an executable, this does not by itself cause the
|
|
* resulting executable to be covered by the GNU General Public License.
|
|
* Your use of that executable is in no way restricted on account of
|
|
* linking the Harbour library code into it.
|
|
*
|
|
* This exception does not however invalidate any other reasons why
|
|
* the executable file might be covered by the GNU General Public License.
|
|
*
|
|
* This exception applies only to the code released by the Harbour
|
|
* Project under the name Harbour. If you copy code from other
|
|
* Harbour Project or Free Software Foundation releases into a copy of
|
|
* Harbour, as the General Public License permits, the exception does
|
|
* not apply to the code that you add in this way. To avoid misleading
|
|
* anyone as to the status of such modified files, you must delete
|
|
* this exception notice from them.
|
|
*
|
|
* If you write modifications of your own for Harbour, it is your choice
|
|
* whether to permit this exception to apply to your modifications.
|
|
* If you do not wish that, delete this exception notice.
|
|
*
|
|
*/
|
|
|
|
#include "hbapi.h"
|
|
#include "hbapiitm.h"
|
|
#include "hbapierr.h"
|
|
|
|
/* returns the maximum of two date or numerics */
|
|
HB_FUNC( MAX )
|
|
{
|
|
PHB_ITEM p1 = hb_param( 1, HB_IT_ANY );
|
|
PHB_ITEM p2 = hb_param( 2, HB_IT_ANY );
|
|
|
|
if( p1 && p2 )
|
|
{
|
|
if( HB_IS_NUMINT( p1 ) && HB_IS_NUMINT( p2 ) )
|
|
{
|
|
HB_LONG l1 = hb_itemGetNInt( p1 );
|
|
HB_LONG l2 = hb_itemGetNInt( p2 );
|
|
|
|
hb_retnint( l1 >= l2 ? l1 : l2 );
|
|
return;
|
|
}
|
|
else if( HB_IS_NUMERIC( p1 ) && HB_IS_NUMERIC( p2 ) )
|
|
{
|
|
double d1 = hb_itemGetND( p1 );
|
|
double d2 = hb_itemGetND( p2 );
|
|
|
|
int iDec1;
|
|
int iDec2;
|
|
|
|
hb_itemGetNLen( p1, NULL, &iDec1 );
|
|
hb_itemGetNLen( p2, NULL, &iDec2 );
|
|
|
|
if( d1 >= d2 )
|
|
hb_retndlen( d1, 0, iDec1 );
|
|
else
|
|
hb_retndlen( d2, 0, iDec2 );
|
|
return;
|
|
}
|
|
else if( HB_IS_LOGICAL( p1 ) && HB_IS_LOGICAL( p2 ) )
|
|
{
|
|
BOOL b1 = hb_itemGetL( p1 );
|
|
BOOL b2 = hb_itemGetL( p2 );
|
|
|
|
hb_retl( b1 >= b2 ? b1 : b2 );
|
|
return;
|
|
}
|
|
else if( HB_IS_DATE( p1 ) && HB_IS_DATE( p2 ) )
|
|
{
|
|
char szDate[ 9 ];
|
|
|
|
hb_retds( hb_itemGetDL( p1 ) >= hb_itemGetDL( p2 ) ? hb_pardsbuff( szDate, 1 ) : hb_pardsbuff( szDate, 2 ) );
|
|
return;
|
|
}
|
|
}
|
|
hb_errRT_BASE_SubstR( EG_ARG, 1093, NULL, "MAX", 2, hb_paramError( 1 ), hb_paramError( 2 ) );
|
|
}
|
|
|
|
/* returns the minimum of two date or numerics */
|
|
HB_FUNC( MIN )
|
|
{
|
|
PHB_ITEM p1 = hb_param( 1, HB_IT_ANY );
|
|
PHB_ITEM p2 = hb_param( 2, HB_IT_ANY );
|
|
|
|
if( p1 && p2 )
|
|
{
|
|
if( HB_IS_NUMINT( p1 ) && HB_IS_NUMINT( p2 ) )
|
|
{
|
|
HB_LONG l1 = hb_itemGetNInt( p1 );
|
|
HB_LONG l2 = hb_itemGetNInt( p2 );
|
|
|
|
hb_retnint( l1 <= l2 ? l1 : l2 );
|
|
return;
|
|
}
|
|
else if( HB_IS_NUMERIC( p1 ) && HB_IS_NUMERIC( p2 ) )
|
|
{
|
|
double d1 = hb_itemGetND( p1 );
|
|
double d2 = hb_itemGetND( p2 );
|
|
|
|
int iDec1;
|
|
int iDec2;
|
|
|
|
hb_itemGetNLen( p1, NULL, &iDec1 );
|
|
hb_itemGetNLen( p2, NULL, &iDec2 );
|
|
|
|
if( d1 <= d2 )
|
|
hb_retndlen( d1, 0, iDec1 );
|
|
else
|
|
hb_retndlen( d2, 0, iDec2 );
|
|
return;
|
|
}
|
|
else if( HB_IS_LOGICAL( p1 ) && HB_IS_LOGICAL( p2 ) )
|
|
{
|
|
BOOL b1 = hb_itemGetL( p1 );
|
|
BOOL b2 = hb_itemGetL( p2 );
|
|
|
|
hb_retl( b1 <= b2 ? b1 : b2 );
|
|
return;
|
|
}
|
|
else if( HB_IS_DATE( p1 ) && HB_IS_DATE( p2 ) )
|
|
{
|
|
char szDate[ 9 ];
|
|
|
|
hb_retds( hb_itemGetDL( p1 ) <= hb_itemGetDL( p2 ) ? hb_pardsbuff( szDate, 1 ) : hb_pardsbuff( szDate, 2 ) );
|
|
return;
|
|
}
|
|
}
|
|
|
|
hb_errRT_BASE_SubstR( EG_ARG, 1092, NULL, "MIN", 2, hb_paramError( 1 ), hb_paramError( 2 ) );
|
|
}
|
|
|