/****************************************************************************/
/*	Copyright (c) 2009, Bendor Research Pty. Ltd. All rights reserved.		*/
/*	This software is released under the GNU General Public License, version	*/
/*	3, with the exemptions that 1) the header files installed by this 	 	*/
/*	package can be included in closed-source code and 2) the libraries		*/
/*	built by this package can be statically linked into a closed-source 	*/
/*	binary. See the file LICENSE for the details.							*/
/*	This software is provided "AS IS", without any warranty or guarantee.	*/
/*	By using this software you acknowledge that neither Bendor Research nor	*/
/*	any of its personnel or affiliates can be held liable for any damages,	*/
/*	including, but not limited to, loss of business, loss of money, loss of */
/*	life, loss of reputation, arising out of this software being faulty or	*/
/*	not performing as advertised, even if Bendor Research was aware of such	*/
/*	faults in the software. You use this software at your own risk, any and */
/*	all liabilities that arise out of your using this software are strictly	*/
/*	yours.																	*/
/****************************************************************************/

#include <string.h>

/** @addtogroup string */
/** @{ */

/**
*	Locate the first occurance of a charater from a set in a string.
*
*	The function returns a pointer to the first occurance of a character
*	from the set \p set in the string \p str. If the string does not contain
*	any of the characters of \p set, then NULL is returned.
*
*	@param	str		Pointer to the string
*	@param	set		Pointer to the set of characters to look for
*	@return			Pointer to the first occurance of a set member in the
*					string or NULL if the string does not contain any members.
*/

char	*strpbrk( const char *str, const char *set )
{
int				map[ 8 ];
unsigned char	chr;

	map[ 0 ] = map[ 1 ] = map[ 2 ] = map[ 3 ] = 0;
	map[ 4 ] = map[ 5 ] = map[ 6 ] = map[ 7 ] = 0;

	while ( ( chr = *set++ ) )

		map[ chr >> 5 ] |= 1 << ( chr & 31 );

	for ( ;; ) {

		chr = *str++;

		if ( ! chr )

			return( NULL );

		if ( map[ chr >> 5 ] & ( 1 << ( chr & 31 ) ) )

			return( (char *) str - 1 );
	}
}

/** @} */

