Test: strncmp vs. strpos (long)
2000 character string, check if a substring exists in a defined location, both pass and fail paths.
Run this test again Return to test menuHistorical Results
Based on (2) saved test runs, The test labeled "strncmp()" was (on average) the faster by 0.0059 seconds, (0.780% faster)
The strncmp() test took 0.7528 seconds.
The strpos() test took 0.7587 seconds.
Nitty-Gritty
Each test case ran 20 random code order iterations consisting of 209,471 loops for a total of 4,189,410 runs.
- Line execution difference (0.000001) milliseconds.
- Avg difference (0.000) milliseconds per 209,471 loops.
- Total difference 5.92 milliseconds for 4,189,410 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;