85 lines
1.9 KiB
C
85 lines
1.9 KiB
C
/*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* GT CLIPPER STANDARD HEADER
|
|
*
|
|
* File......: strcount.c
|
|
* Author....: Andy M Leighton
|
|
* BBS.......: The Dark Knight Returns
|
|
* Net/Node..: 050/069
|
|
* User Name.: Andy Leighton
|
|
* Date......: 23/05/93
|
|
* Revision..: 1.00
|
|
*
|
|
* This is an original work by Andy Leighton and is placed in the
|
|
* public domain.
|
|
*/
|
|
|
|
/*
|
|
* $DOC$
|
|
* $FUNCNAME$
|
|
* GT_STRCOUNT()
|
|
* $CATEGORY$
|
|
* String
|
|
* $ONELINER$
|
|
* Count the number of times a substring appears in a string
|
|
* $SYNTAX$
|
|
* GT_StrCount(<cChrs>, <cStr>) --> nFreq
|
|
* $ARGUMENTS$
|
|
* <cChrs> - The substring to find the frequence of
|
|
* <cStr> - The string in which to find the character
|
|
* $RETURNS$
|
|
* nFreq - The number of times <cChrs> occurs in <cStr>
|
|
* $DESCRIPTION$
|
|
* GT_StrCount() counts how many times a specified substring
|
|
* appears in a string.
|
|
* If the substring does NOT appear in <cStr> this function
|
|
* will return 0.
|
|
* If the substring is a single character use GT_ChrCount() as
|
|
* it will be faster.
|
|
*
|
|
* NOTE:
|
|
* invalid parameters will return -1
|
|
* $EXAMPLES$
|
|
*
|
|
* ? GT_StrCount("the", "the cat sat on the mat") // prints 2
|
|
*
|
|
* $END$
|
|
*/
|
|
|
|
#include <extend.h>
|
|
|
|
HARBOUR HB_GT_STRCOUNT( void )
|
|
{
|
|
char *s1, *s2;
|
|
int count, p1, p2, l1, l2;
|
|
int match = 1;
|
|
|
|
if (ISCHAR(1) && ISCHAR(2)) {
|
|
s1 = hb_parc(1);
|
|
s2 = hb_parc(2);
|
|
l1 = hb_parclen(1);
|
|
l2 = hb_parclen(2);
|
|
|
|
/* loop through s2 matching passed character (s1) with
|
|
each character of s1 */
|
|
|
|
for (count = 0, p2 = 0; p2 <= (l2 - l1); p2++) {
|
|
match = 1;
|
|
|
|
for (p1 = 0; p1 < l1; p1++) {
|
|
if (s1[p1] != s2[p2 + p1])
|
|
match = 0;
|
|
}
|
|
if (match)
|
|
count++;
|
|
}
|
|
|
|
hb_retni(count); /* return result */
|
|
} else {
|
|
hb_retni(-1); /* parameter mismatch - error -1 */
|
|
}
|
|
}
|