fivedev/harbour-core
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

2016-01-09 20:09 UTC+0100 Przemyslaw Czerpak (druzus/at/poczta.onet.pl)

Browse Source 
* contrib/hbfoxpro/hbfoxpro.hbp
  * contrib/hbfoxpro/hbfoxpro.hbx
  + contrib/hbfoxpro/relfunc.c
    + added FoxPro compatible functions:
         Between( <xValue>, <xMinVal>, <xMaxVal> ) -> <lBetween>
         InList( <xValue>, <xItem1> [, <xItemN,...>] ) -> <lExists>
This commit is contained in:
Przemysław Czerpak
2016-01-09 20:09:09 +01:00
parent 7abf3b836d
commit 6f3550d8ed
4 changed files with 98 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
ChangeLog.txt
View File

@@ -10,6 +10,14 @@
* Change, ! Fix, % Optimization, + Addition, - Removal, ; Comment
*/
2016-01-09 20:09 UTC+0100 Przemyslaw Czerpak (druzus/at/poczta.onet.pl)
* contrib/hbfoxpro/hbfoxpro.hbp
* contrib/hbfoxpro/hbfoxpro.hbx
+ contrib/hbfoxpro/relfunc.c
+ added FoxPro compatible functions:
Between( <xValue>, <xMinVal>, <xMaxVal> ) -> <lBetween>
InList( <xValue>, <xItem1> [, <xItemN,...>] ) -> <lExists>
2016-01-09 03:16 UTC+0100 Przemyslaw Czerpak (druzus/at/poczta.onet.pl)
* src/vm/hvm.c
+ allow to compare symbol items with == operator, i.e.:

1
contrib/hbfoxpro/hbfoxpro.hbp
View File

@@ -13,3 +13,4 @@ occurs.prg
dbfunc.c
miscfunc.c
relfunc.c

2
contrib/hbfoxpro/hbfoxpro.hbx
View File

@@ -22,11 +22,13 @@
#endif
DYNAMIC AElement
DYNAMIC Between
DYNAMIC Filter
DYNAMIC fox_At
DYNAMIC fox___DynCall
DYNAMIC FSize
DYNAMIC Id
DYNAMIC InList
DYNAMIC InsMode
DYNAMIC Key
DYNAMIC LineNo

87
contrib/hbfoxpro/relfunc.c Normal file
View File

@@ -0,0 +1,87 @@
/*
* Harbour Project source code:
* FoxPro compatible functions BETWEEN(), INLIST()
*
* Copyright 2016 Przemyslaw Czerpak <druzus / at / priv.onet.pl>
* www - http://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.txt. 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"
HB_FUNC( BETWEEN )
{
HB_BOOL fResult = HB_FALSE;
if( hb_pcount() == 3 )
{
PHB_ITEM pItem = hb_param( 1, HB_IT_ANY );
int iResult1, iResult2;
if( hb_itemCompare( pItem, hb_param( 1, HB_IT_ANY ), HB_FALSE, &iResult1 ) &&
hb_itemCompare( pItem, hb_param( 2, HB_IT_ANY ), HB_FALSE, &iResult2 ) )
fResult = iResult1 >= 0 && iResult2 <= 0;
}
hb_retl( fResult );
}
HB_FUNC( INLIST )
{
HB_BOOL fResult = HB_FALSE;
int iPCount = hb_pcount();
if( iPCount > 1 )
{
PHB_ITEM pValue = hb_param( 1, HB_IT_ANY );
int iParam;
for( iParam = 2; iParam < iPCount; ++iParam )
{
if( hb_itemEqual( pValue, hb_param( iParam, HB_IT_ANY ) ) )
{
fResult = HB_TRUE;
break;
}
}
}
hb_retl( fResult );
}