///////////////////////////////////////////////////////////////////////////////
// Finds first occurence of str2 in str1.  Returns the position of str2 if
// found in str1, otherwise returns 0.
///////////////////////////////////////////////////////////////////////////////
strstr(str1[], str2[])
{
	new i = 0;
	new j = 0;
	new len1;
	new len2;

	len1 = strlen(str1);	// Length of source string
	len2 = strlen(str2);	// Length of string we're searching for

	// Step through str1
	for (j=0; j<len1; j++)
	{
		// If the current letter of str2 is the same as the current letter of str1
		while (str1[j+i] == str2[i])
		{
			i++;
			// If we are at the end of str2, then success!
			if (i == len2)
				return j+1;
			// If we get to the end of str1, but not end of str2, then fail.
			else if (len1 == j+i)
				return 0;
		}

		// Re-initialize i to zero for next time around
		i = 0;
	}
	// If we don't find anything, and we get to the end, then return 0
	return 0;
}