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 (3) saved test runs, The test labeled "strncmp()" was (on average) the faster by 0.0336 seconds, (3.080% faster)

strncmp() 100%

strpos() 96.92%

The strncmp() test took 1.056 seconds.
The strpos() test took 1.0896 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 289,325 loops for a total of 5,786,493 runs.

Line execution difference (0.000006) milliseconds.
Avg difference (0.000) milliseconds per 289,325 loops.
Total difference 33.55 milliseconds for 5,786,493 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