Test: strncmp vs. strpos (long)

2000 character string, check if a substring exists in a defined location, both pass and fail paths.

Historical Results

Based on (2) saved test runs, The test labeled "strpos()" was (on average) the faster by 0.0138 seconds, (1.256% faster)

strpos() 100%

strncmp() 98.744%

The strpos() test took 1.083 seconds.
The strncmp() test took 1.0968 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 252,448 loops for a total of 5,048,960 runs.

Line execution difference (0.000003) milliseconds.
Avg difference (0.000) milliseconds per 252,448 loops.
Total difference 13.77 milliseconds for 5,048,960 loops

The iteration variablity for Code 1 was (0.0000) milliseconds and Code 2 was (0.0000) milliseconds. The lower and the closer together there values are the more accurate the results are.

Code

The first test, "strncmp()", was:

for ($j = 0; $j < 40; $j++)
	$GLOBALS['dummy'] = strncmp($GLOBALS['dummy_match'], '01234', 5) === 0;
for ($j = 0; $j < 40; $j++)
	$GLOBALS['dummy'] = strncmp($GLOBALS['dummy_fail'], '01234', 5) === 0;

The second test, "strpos()", was:

for ($j = 0; $j < 40; $j++)
	$GLOBALS['dummy'] = strpos($GLOBALS['dummy_match'], '01234') === 0;
for ($j = 0; $j < 40; $j++)
	$GLOBALS['dummy'] = strpos($GLOBALS['dummy_fail'], '01234') === 0;

PHP Benchmarks