mirror of
https://github.com/python/cpython.git
synced 2025-10-10 00:43:41 +00:00
Add a comment explaining this heuristic.
This commit is contained in:
parent
dda339e6d2
commit
c198d0599b
1 changed files with 3 additions and 0 deletions
|
@ -115,6 +115,9 @@ FASTSEARCH(const STRINGLIB_CHAR* s, Py_ssize_t n,
|
||||||
unsigned char needle;
|
unsigned char needle;
|
||||||
needle = p[0] & 0xff;
|
needle = p[0] & 0xff;
|
||||||
#if STRINGLIB_SIZEOF_CHAR > 1
|
#if STRINGLIB_SIZEOF_CHAR > 1
|
||||||
|
/* If looking for a multiple of 256, we'd have two
|
||||||
|
many false positives looking for the '\0' byte in UCS2
|
||||||
|
and UCS4 representations. */
|
||||||
if (needle != 0)
|
if (needle != 0)
|
||||||
#endif
|
#endif
|
||||||
return STRINGLIB(fastsearch_memchr_1char)
|
return STRINGLIB(fastsearch_memchr_1char)
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue