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 (4) Run this test again Return to test menu

Result: Saved

The test labeled "strncmp()" was the faster by 0.0417 seconds, (4.806% faster)

strncmp() 100%

strpos() 95.194%

The strncmp() test took 0.8262 seconds.
The strpos() test took 0.8679 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 153,034 loops for a total of 3,060,680 runs.

Line execution difference (0.000014) milliseconds.
Avg difference (2.086) milliseconds per 153,034 loops.
Total difference 41.71 milliseconds for 3,060,680 loops

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