commit c198d0599b7be72a1b88c7573897d7535cd89678
author Antoine Pitrou <solipsis@pitrou.net> Thu Oct 13 18:07:37 2011 +0200
committer Antoine Pitrou <solipsis@pitrou.net> Thu Oct 13 18:07:37 2011 +0200
tree 8019bb4359bce0b4861dacc387df9e371bfd1ab1
parent dda339e6d22778f5c4bdeb6f588d341ce131acbb

Add a comment explaining this heuristic.

Objects/stringlib/fastsearch.h

diff --git a/Objects/stringlib/fastsearch.h b/Objects/stringlib/fastsearch.h
index 0f7aea7..eb3d694 100644
--- a/Objects/stringlib/fastsearch.h
+++ b/Objects/stringlib/fastsearch.h
@@ -115,6 +115,9 @@
             unsigned char needle;
             needle = p[0] & 0xff;
 #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)
 #endif
                 return STRINGLIB(fastsearch_memchr_1char)