9687850865
* (all files)
* stripped svn header
* minor cleanups
; use following command to find out the history of files:
git log
git log --follow
git blame
git annotate
246 lines
8.7 KiB
C
246 lines
8.7 KiB
C
/*
|
|
* Harbour Project source code:
|
|
* CharRelA() and CharRelRep() CT3 string functions
|
|
*
|
|
* Copyright 2001 IntTec GmbH, Neunlindenstr 32, 79106 Freiburg, Germany
|
|
* Author: Martin Vogel <vogel@inttec.de>
|
|
*
|
|
* 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 "ct.h"
|
|
|
|
HB_FUNC( CHARRELA )
|
|
{
|
|
if( HB_ISCHAR( 1 ) && HB_ISCHAR( 2 ) && HB_ISCHAR( 3 ) && HB_ISCHAR( 4 ) )
|
|
{
|
|
const char * pcStringToMatch1 = hb_parc( 1 );
|
|
HB_SIZE sStrToMatchLen1 = hb_parclen( 1 );
|
|
const char * pcString1 = hb_parc( 2 );
|
|
HB_SIZE sStrLen1 = hb_parclen( 2 );
|
|
const char * pcStringToMatch2 = hb_parc( 3 );
|
|
HB_SIZE sStrToMatchLen2 = hb_parclen( 3 );
|
|
const char * pcString2 = hb_parc( 4 );
|
|
HB_SIZE sStrLen2 = hb_parclen( 4 );
|
|
|
|
const char * pc1, * pc2;
|
|
HB_SIZE sOffset1, sOffset2;
|
|
HB_SIZE sMatchStrLen;
|
|
|
|
/* check for empty strings */
|
|
if( ( sStrToMatchLen1 == 0 ) || ( sStrToMatchLen2 == 0 ) )
|
|
{
|
|
hb_retns( 0 );
|
|
return;
|
|
}
|
|
|
|
sOffset1 = 0;
|
|
sOffset2 = 0;
|
|
|
|
/* NOTE: this algorithm is not the best since the search that gave
|
|
the larger relative position in the step before is repeated;
|
|
try a search algorithm alternating between both strings */
|
|
while( sOffset1 < sStrLen1 && sOffset2 < sStrLen2 )
|
|
{
|
|
pc1 = ct_at_exact_forward( pcStringToMatch1, sStrToMatchLen1,
|
|
pcString1 + sOffset1, sStrLen1 - sOffset1, &sMatchStrLen );
|
|
pc2 = ct_at_exact_forward( pcStringToMatch2, sStrToMatchLen2,
|
|
pcString2 + sOffset2, sStrLen2 - sOffset2, &sMatchStrLen );
|
|
if( pc1 != NULL && pc2 != NULL )
|
|
{
|
|
if( pc1 - pcString1 == pc2 - pcString2 )
|
|
{
|
|
/* correlation found */
|
|
hb_retns( ( pc1 - pcString1 ) + 1 );
|
|
return;
|
|
}
|
|
else
|
|
{
|
|
if( pc1 - pcString1 > pc2 - pcString2 )
|
|
sOffset1 = sOffset2 = pc1 - pcString1;
|
|
else
|
|
sOffset1 = sOffset2 = pc2 - pcString2;
|
|
}
|
|
}
|
|
else
|
|
sOffset1 = sOffset2 = sStrLen1 < sStrLen2 ? sStrLen1 : sStrLen2;
|
|
}
|
|
|
|
hb_retns( 0 );
|
|
}
|
|
else
|
|
{
|
|
PHB_ITEM pSubst = NULL;
|
|
int iArgErrorMode = ct_getargerrormode();
|
|
|
|
if( iArgErrorMode != CT_ARGERR_IGNORE )
|
|
pSubst = ct_error_subst( ( HB_USHORT ) iArgErrorMode, EG_ARG,
|
|
CT_ERROR_CHARRELA, NULL, HB_ERR_FUNCNAME, 0,
|
|
EF_CANSUBSTITUTE, HB_ERR_ARGS_BASEPARAMS );
|
|
|
|
if( pSubst != NULL )
|
|
hb_itemReturnRelease( pSubst );
|
|
else
|
|
hb_retns( 0 );
|
|
}
|
|
}
|
|
|
|
HB_FUNC( CHARRELREP )
|
|
{
|
|
int iNoRet = ct_getref() && HB_ISBYREF( 4 );
|
|
|
|
if( HB_ISCHAR( 1 ) && HB_ISCHAR( 2 ) && HB_ISCHAR( 3 ) &&
|
|
HB_ISCHAR( 4 ) && HB_ISCHAR( 5 ) )
|
|
{
|
|
const char * pcStringToMatch1 = hb_parc( 1 );
|
|
HB_SIZE sStrToMatchLen1 = hb_parclen( 1 );
|
|
const char * pcString1 = hb_parc( 2 );
|
|
HB_SIZE sStrLen1 = hb_parclen( 2 );
|
|
const char * pcStringToMatch2 = hb_parc( 3 );
|
|
HB_SIZE sStrToMatchLen2 = hb_parclen( 3 );
|
|
const char * pcString2 = hb_parc( 4 );
|
|
HB_SIZE sStrLen2 = hb_parclen( 4 );
|
|
const char * pcReplace = hb_parc( 5 );
|
|
HB_SIZE sReplaceLen = hb_parclen( 5 );
|
|
char * pcRet;
|
|
const char * pc1, * pc2;
|
|
HB_SIZE sOffset1, sOffset2;
|
|
HB_SIZE sMatchStrLen;
|
|
|
|
/* check for empty strings */
|
|
if( sStrToMatchLen1 == 0 ||
|
|
sStrToMatchLen2 == 0 || sReplaceLen == 0 || sStrLen2 == 0 )
|
|
{
|
|
if( iNoRet )
|
|
hb_ret();
|
|
else
|
|
hb_retclen( pcString2, sStrLen2 );
|
|
return;
|
|
}
|
|
|
|
pcRet = ( char * ) hb_xgrab( sStrLen2 + 1 );
|
|
hb_xmemcpy( pcRet, pcString2, sStrLen2 );
|
|
|
|
sOffset1 = 0;
|
|
sOffset2 = 0;
|
|
|
|
/* NOTE: this algorithm is not the best since the search that gave
|
|
the larger relative position in the step before is repeated;
|
|
try a search algorithm alternating between both strings */
|
|
while( ( sOffset1 < sStrLen1 ) && ( sOffset2 < sStrLen2 ) )
|
|
{
|
|
pc1 = ct_at_exact_forward( pcStringToMatch1, sStrToMatchLen1,
|
|
pcString1 + sOffset1, sStrLen1 - sOffset1,
|
|
&sMatchStrLen );
|
|
pc2 = ct_at_exact_forward( pcStringToMatch2, sStrToMatchLen2,
|
|
pcString2 + sOffset2, sStrLen2 - sOffset2,
|
|
&sMatchStrLen );
|
|
if( pc1 != NULL && pc2 != NULL )
|
|
{
|
|
if( pc1 - pcString1 == pc2 - pcString2 )
|
|
{
|
|
/* correlation found -> start replacement */
|
|
HB_SIZE sCurr;
|
|
|
|
for( sCurr = 1; sCurr <= sStrToMatchLen1; sCurr++ )
|
|
{
|
|
/* check if pcString2 is long enough */
|
|
if( ( pc2 - pcString2 ) + sCurr >= sStrLen2 )
|
|
{
|
|
HB_SIZE sStr2Offset, sReplOffset;
|
|
|
|
sStr2Offset = sStrToMatchLen2 < sCurr ? sStrToMatchLen2 : sCurr;
|
|
sReplOffset = sReplaceLen < sCurr ? sReplaceLen : sCurr;
|
|
|
|
/* do the characters in pcString2 and pcStrToMatch2 match ? */
|
|
if( *( pc2 + sCurr - 1 ) ==
|
|
*( pcStringToMatch2 + sStr2Offset - 1 ) )
|
|
{
|
|
*( pcRet + ( pc2 - pcString2 ) + sCurr - 1 ) =
|
|
*( pcReplace + sReplOffset - 1 );
|
|
}
|
|
}
|
|
}
|
|
sOffset1 = sOffset2 = ( pc1 - pcString1 ) + 1;
|
|
}
|
|
else
|
|
{
|
|
if( pc1 - pcString1 > pc2 - pcString2 )
|
|
sOffset1 = sOffset2 = pc1 - pcString1;
|
|
else
|
|
sOffset1 = sOffset2 = pc2 - pcString2;
|
|
}
|
|
}
|
|
else
|
|
sOffset1 = sOffset2 = sStrLen1 < sStrLen2 ? sStrLen1 : sStrLen2;
|
|
}
|
|
|
|
hb_storclen( pcRet, sStrLen2, 4 );
|
|
|
|
if( iNoRet )
|
|
{
|
|
hb_xfree( pcRet );
|
|
hb_ret();
|
|
}
|
|
else
|
|
hb_retclen_buffer( pcRet, sStrLen2 );
|
|
}
|
|
else
|
|
{
|
|
PHB_ITEM pSubst = NULL;
|
|
int iArgErrorMode = ct_getargerrormode();
|
|
|
|
if( iArgErrorMode != CT_ARGERR_IGNORE )
|
|
pSubst = ct_error_subst( ( HB_USHORT ) iArgErrorMode, EG_ARG,
|
|
CT_ERROR_CHARRELREP, NULL, HB_ERR_FUNCNAME, 0,
|
|
EF_CANSUBSTITUTE, HB_ERR_ARGS_BASEPARAMS );
|
|
|
|
if( pSubst != NULL )
|
|
hb_itemReturnRelease( pSubst );
|
|
else if( iNoRet )
|
|
hb_ret();
|
|
else
|
|
hb_retc_null();
|
|
}
|
|
}
|