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

Result: Discarded

The test labeled "strncmp()" was the faster by 0.059 seconds, (5.502% faster)

strncmp() 100%

strpos() 94.498%

The strncmp() test took 1.0126 seconds.
The strpos() test took 1.0715 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 237,940 loops for a total of 4,758,800 runs.

Line execution difference (0.000012) milliseconds.
Avg difference (2.948) milliseconds per 237,940 loops.
Total difference 58.95 milliseconds for 4,758,800 loops

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