C / C++ / MFC

#include <string>
using namespace std;
<DIV>
... Later in the code...
<DIV>
// Let's assume charArray[40] is an array of 'char' characters.
<DIV>
// Create a string object
string myString;
<DIV>
// Use the member method
myString += &charArray[0];
<DIV>
// myString is now a copy of charArray[40]

char chr_array[] = "bob";<br />
string str = chr_array; // uses string constructor

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~<br />
Peter Weyzen<br />
Staff Engineer<br />
<A HREF="http://www.santacruznetworks.com">Santa Cruz Networks</A>

CString sString;
CFile file("c:\\pathtoyourfile.dat",CFile::modeRead);
file.Read(sString.GetBuffer(file.GetLength()),file.GetLength());
sString.ReleaseBuffer(file.GetLength());
sString.Find("Your pattern",0);

// Boyer-Moore text search
const char* TextSearch(const char* pSearchStr, const char* pStr, int textLen)
{
	if (!pSearchStr || !*pSearchStr)
		return pStr;

	if (!pStr || !*pStr)
		return NULL;

	if (textLen < 0)
		textLen = (int)strlen(pStr);

	int searchStrLen = (int)strlen(pSearchStr);

	// Setup m_skip table
	int pSkipTable[256];

	int i;
	for (i = 0; i < 256; i++)
		pSkipTable[i] = searchStrLen;

	for (i = 0; pSearchStr[i]; i++)
		pSkipTable[(BYTE)pSearchStr[i]] = searchStrLen - 1 - i;

	register int right = searchStrLen - 1;
	while (right < textLen)
	{
		int j;
		for (j = searchStrLen - 1, i = right; j >= 0 && pSearchStr[j] == pStr[i]; j--)
			i--;

		if (j == -1)
			return &pStr[i + 1];

		right = max(i + pSkipTable[(BYTE)pStr[i]], right + 1);
	}
	return NULL;
}

const char* TextSearchNoCase(const char* pSearchStr, const char* pStr, int textLen)
{
	if (!pSearchStr || !*pSearchStr)
		return pStr;

	if (!pStr || !*pStr)
		return NULL;

	if (textLen < 0)
		textLen = (int)strlen(pStr);

	int searchStrLen = (int)strlen(pSearchStr);

	// Setup m_skip table
	int pSkipTable[256];

	int i;
	for (i = 0; i < 256; i++)
		pSkipTable[i] = searchStrLen;

	char* pSearchStrUpper = (char*) _alloca(searchStrLen);
	memcpy(pSearchStrUpper, pSearchStr, searchStrLen);
	CharUpperBuffA(pSearchStrUpper, searchStrLen);

	char* pSearchStrLower = (char*) _alloca(searchStrLen);
	memcpy(pSearchStrLower, pSearchStr, searchStrLen);
	CharLowerBuffA(pSearchStrLower, searchStrLen);

	for (i = 0; i < searchStrLen; i++)
	{
		pSkipTable[(BYTE)pSearchStrUpper[i]] =
		pSkipTable[(BYTE)pSearchStrLower[i]] = searchStrLen - 1 - i;
	}

	register int right = searchStrLen - 1;
	while (right < textLen)
	{
		int j;
		for (j = searchStrLen - 1, i = right; j >= 0 && 
			(pSearchStrLower[j] == pStr[i] || pSearchStrUpper[j] == pStr[i]); j--)
			i--;

		if (j == -1)
			return &pStr[i + 1];

		for (j = searchStrLen - 1; j >= 0; j--)
		{
			if (pSearchStrLower[j] == pStr[i] || pSearchStrUpper[j] == pStr[i])
			{
				right = max(i + pSkipTable[(BYTE)pStr[i]], right + 1);
				break;
			}
		}
		if (j < 0)
			right = max(i + searchStrLen, right + 1);
	}
	return NULL;
}