Test: strncmp vs. strpos (long)

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

View test history (6) Run this test again Return to test menu

Result: Discarded

The test labeled "strpos()" was the faster by 0.012 seconds, (2.239% faster)

strpos() 100%

strncmp() 97.761%

The strpos() test took 0.5259 seconds.
The strncmp() test took 0.5379 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 143,776 loops for a total of 2,875,520 runs.

Line execution difference (0.000004) milliseconds.
Avg difference (0.602) milliseconds per 143,776 loops.
Total difference 12.04 milliseconds for 2,875,520 loops

The iteration variablity for Code 1 was (1.5324) milliseconds and Code 2 was (1.1068) 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