最近想到一種新的數據匹配算法

static char * _cdecl al_radar_find(const char * lpText, size_t uTextLen, const char * lpContent, size_t uContentLen)
{
    size_t uOdd = uContentLen % 2U;
    const size_t uZone = (uContentLen / 2U - 1U) + uOdd;
    const size_t uMove = (uZone + 2U) - uOdd;

    for (size_t i = uZone; i < uTextLen; i += uContentLen) {
        register size_t j = 0U;
        do {
            if (((char *)(lpText + i))[j] == lpContent[0]) {
                register size_t c = 1U;
                uOdd = i + j;
                do {
                    if (((char *)(lpText + uOdd))[c] != lpContent[c]) {
                        goto JMP_BYTE_NEXT;
                    }
                } while ((++c) < uContentLen);
                return (char *)(lpText + uOdd);
            }
            if (((char *)(lpText + i))[j] == lpContent[uZone]) {
                register size_t c = 0U;
                uOdd = (i + j) - uZone;
                do {
                    if (((char *)(lpText + uOdd))[c] != lpContent[c]) {
                        goto JMP_BYTE_NEXT;
                    }
                } while ((++c) < uContentLen);
                return (char *)(lpText + uOdd);
            }
        JMP_BYTE_NEXT:
            ++j;
        } while (j < uMove);
    }
    return NULL;
}