strspn函数

/*
strspn（返回字符串中第一个不在指定字符串中出现的字符下标）
表头文件 #include<string.h>
定义函数 size_t strspn (const char *s,const char * accept);
函数说明 strspn()从参数s 字符串的开头计算连续的字符，而这些字符都完全是accept 所指字符串中的字符。
简单的说，若strspn()返回的数值为n，则代表字符串s 开头连续有n 个字符都是属于字符串accept内的字符。
返回值 返回字符串s开头连续包含字符串accept内的字符数目。

strspn    返回s1中第一个不在s2中出现的字符下标
strcspn   得到s1中第一个且是s2中字符的字符位置。

*/

 

#include <stdio.h>

size_t strspn(const char *s1, const char *s2)
{
	const char *p;    //设立两个同类型的指针
	const char *r;

	size_t count = 0;  //返回值

	for (p = s1; *p!= '\0'; p++)
	{
		for (r = s2; *r != '\0'; r++)
		{
			if (*r == *p)
			{
				break;
			}
		
		}
		if (*r == '\0')
		{
			return count;
		}
		++count;
	}

	return count;
}



int main ()
{
    char *str="Linux was first developed for 386/486-based pcs.";  
    printf("%d\n",strspn(str,"iLnux"));  
    printf("%d\n",strspn(str,"inuL"));  
    printf("%d\n",strspn(str,"nuxL"));  
    printf("%d\n",strspn(str,"inu"));  
    printf("%d\n",strspn(str,"nuxil"));  
    printf("%d\n",strspn(str,"1234567890"));  
	return 0;
}

//linux源码

#ifndef __HAVE_ARCH_STRSPN   
/** 
 * strspn - Calculate the length of the initial substring of @s which only contain letters in @accept 
 * @s: The string to be searched 
 * @accept: The string to search for 
 */  
size_t strspn(const char *s, const char *accept)  
{  
    const char *p;  
    const char *a;  
    size_t count = 0;  
  
    for (p = s; *p != '\0'; ++p) {  
        for (a = accept; *a != '\0'; ++a) {  
            if (*p == *a)  
                break;  
        }  
        if (*a == '\0')  
            return count;  
        ++count;  
    }  
    return count;  
}  
  
EXPORT_SYMBOL(strspn);  
#endif 

 

size_t
strspn (const char *s, const char *acc)
{
  const char *r, *str = s;
  char c;
  while ((c = *s++) != '\0')
    {
      for (r = acc; *r != '\0'; ++r)
		  if (*r == c)
			  break;
      if (*r == '\0')
    return s - str - 1;
    }
  return s - str - 1;
}

 

size_t
strspn (const char *s, const char *acc)

{
  size_t ns = strlen (s), nacc = strlen (acc);
  size_t i, j;
  for (i = 0; i < ns; ++i)
    {
      for (j = 0; j < nacc; ++j)
    if (s[i] == acc[j])
      break;
      if (j == nacc)
    return i;
    }
  return i;
}

 

 

/**
FUNCTION
	<<strspn>>---find initial match

INDEX
	strspn

ANSI_SYNOPSIS
	#include <string.h>
	size_t strspn(const char *<[s1]>, const char *<[s2]>);

TRAD_SYNOPSIS
	#include <string.h>
	size_t strspn(<[s1]>, <[s2]>)
	char *<[s1]>;
	char *<[s2]>;

DESCRIPTION
	This function computes the length of the initial segment of
	the string pointed to by <[s1]> which consists entirely of
	characters from the string pointed to by <[s2]> (excluding the
	terminating null character).

RETURNS
	<<strspn>> returns the length of the segment found.

PORTABILITY
<<strspn>> is ANSI C.

<<strspn>> requires no supporting OS subroutines.

QUICKREF
	strspn ansi pure
*/

#include <string.h>

size_t
_DEFUN (strspn, (s1, s2),
	_CONST char *s1 _AND
	_CONST char *s2)
{
  _CONST char *s = s1;
  _CONST char *c;

  while (*s1)
    {
      for (c = s2; *c; c++)
	{
	  if (*s1 == *c)
	    break;
	}
      if (*c == '\0')
	break;
      s1++;
    }

  return s1 - s;
}

 

 

//C标准库源码
size_t strspn(const char *s1, const char *s2)
{
	const unsigned char *str = s1;
    const unsigned char *ctrl = s2;

        unsigned char map[32];
        int count;

        /* Clear out bit map */
        for (count=0; count<32; count++)
                map[count] = 0;

        /* Set bits in control map */
        while (*ctrl)
        {
                map[*ctrl >> 3] |= (1 << (*ctrl & 7));
                ctrl++;
        }

        /* 1st char NOT in control map stops search */
        if (*str)
        {
                count=0;
                while (map[*str >> 3] & (1 << (*str & 7)))
                {
                        count++;
                        str++;
                }
                return(count);
        }
        return(0);
}