Gecko [ www.foryou-vip.com ]

Linux vps-61133.fhnet.fr 4.9.0-19-amd64 #1 SMP Debian 4.9.320-2 (2022-06-30) x86_64
Apache/2.4.25 (Debian)
Server IP : 93.113.207.21 & Your IP : 216.73.216.112
Domains : Cant Read [ /etc/named.conf ]
User : www-data

Name	Size	Permission	Date
clinic	[ DIR ]	drwxr-xr-x	2024-03-19 22:46
README.txt	1.16 KB	-rw-r--r--	2024-03-19 22:46
asciilib.h	1.11 KB	-rw-r--r--	2024-03-19 22:46
codecs.h	27.39 KB	-rw-r--r--	2024-03-19 22:46
count.h	666 B	-rw-r--r--	2024-03-19 22:46
ctype.h	3.04 KB	-rw-r--r--	2024-03-19 22:46
eq.h	848 B	-rw-r--r--	2024-03-19 22:46
fastsearch.h	24.3 KB	-rw-r--r--	2024-03-19 22:46
find.h	3.19 KB	-rw-r--r--	2024-03-19 22:46
find_max_char.h	3.64 KB	-rw-r--r--	2024-03-19 22:46
join.h	4.62 KB	-rw-r--r--	2024-03-19 22:46
localeutil.h	2.5 KB	-rw-r--r--	2024-03-19 22:46
partition.h	3.22 KB	-rw-r--r--	2024-03-19 22:46
replace.h	1.81 KB	-rw-r--r--	2024-03-19 22:46
split.h	11.05 KB	-rw-r--r--	2024-03-19 22:46
stringdefs.h	1.13 KB	-rw-r--r--	2024-03-19 22:46
stringlib_find_two_way_notes.txt	16.37 KB	-rw-r--r--	2024-03-19 22:46
transmogrify.h	19.4 KB	-rw-r--r--	2024-03-19 22:46
ucs1lib.h	1.08 KB	-rw-r--r--	2024-03-19 22:46
ucs2lib.h	1.08 KB	-rw-r--r--	2024-03-19 22:46
ucs4lib.h	1.09 KB	-rw-r--r--	2024-03-19 22:46
undef.h	212 B	-rw-r--r--	2024-03-19 22:46
unicode_format.h	40.36 KB	-rw-r--r--	2024-03-19 22:46
unicodedefs.h	1.19 KB	-rw-r--r--	2024-03-19 22:46

Rename

/* stringlib: replace implementation */

#ifndef STRINGLIB_FASTSEARCH_H
#error must include "stringlib/fastsearch.h" before including this module
#endif

Py_LOCAL_INLINE(void)
STRINGLIB(replace_1char_inplace)(STRINGLIB_CHAR* s, STRINGLIB_CHAR* end,
                                 Py_UCS4 u1, Py_UCS4 u2, Py_ssize_t maxcount)
{
    *s = u2;
    while (--maxcount && ++s != end) {
        /* Find the next character to be replaced.

If it occurs often, it is faster to scan for it using an inline
           loop.  If it occurs seldom, it is faster to scan for it using a
           function call; the overhead of the function call is amortized
           across the many characters that call covers.  We start with an
           inline loop and use a heuristic to determine whether to fall back
           to a function call. */
        if (*s != u1) {
            int attempts = 10;
            /* search u1 in a dummy loop */
            while (1) {
                if (++s == end)
                    return;
                if (*s == u1)
                    break;
                if (!--attempts) {
                    /* if u1 was not found for attempts iterations,
                       use FASTSEARCH() or memchr() */
#if STRINGLIB_SIZEOF_CHAR == 1
                    s++;
                    s = memchr(s, u1, end - s);
                    if (s == NULL)
                        return;
#else
                    Py_ssize_t i;
                    STRINGLIB_CHAR ch1 = (STRINGLIB_CHAR) u1;
                    s++;
                    i = FASTSEARCH(s, end - s, &ch1, 1, 0, FAST_SEARCH);
                    if (i < 0)
                        return;
                    s += i;
#endif
                    /* restart the dummy loop */
                    break;
                }
            }
        }
        *s = u2;
    }
}