Home
last modified time | relevance | path

Searched refs:pairs (Results 1 – 19 of 19) sorted by relevance

/PHP-8.3/ext/standard/tests/strings/
H A Dbug69144.phpt2 Bug #69144 (strtr not replacing with partly matching replace pairs)
H A Dbug49785.phpt45 echo "UTF-8: alternative (invalid) UTF-8 sequence / surrogate pairs\n";
175 UTF-8: alternative (invalid) UTF-8 sequence / surrogate pairs
/PHP-8.3/ext/intl/tests/
H A Dcollator_compare.phpt11 * Compare various string pairs using various locales.
34 * Compare string pairs in the given array
H A Dcollator_compare_variant2.phpt11 * Compare various string pairs using various locales.
34 * Compare string pairs in the given array
/PHP-8.3/tests/lang/string/
H A Dunicode_escape_surrogates.phpt6 // Surrogate pairs are non-well-formed UTF-8 - however, it is sometimes useful
/PHP-8.3/ext/opcache/jit/dynasm/
H A Ddasm_mips.lua26 local type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs
150 for name, n in pairs(map_global) do t[n] = name end
161 for name, n in pairs(map_global) do t[n] = name end
172 for name, n in pairs(map_global) do t[n] = name end
438 for k,v in pairs({
594 for k,v in pairs({
1123 for name in pairs(map_type) do t[#t+1] = name end
H A Ddynasm.lua46 local type, pairs, ipairs = type, pairs, ipairs
241 for name in pairs(map_def) do
556 for name,buf in pairs(cap_buffers) do
577 for name in pairs(cap_buffers) do
651 for name in pairs(map_coreop) do t[#t+1] = name end
652 for name in pairs(map_op) do t[#t+1] = name end
H A Ddasm_arm.lua23 local type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs
151 for name, n in pairs(map_global) do t[n] = name end
162 for name, n in pairs(map_global) do t[n] = name end
173 for name, n in pairs(map_global) do t[n] = name end
523 for k,v in pairs(map_op) do
529 for k,v in pairs(t) do
1055 for name in pairs(map_type) do t[#t+1] = name end
H A Ddasm_x86.lua25 local type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs
218 for name, n in pairs(map_global) do t[n] = name end
229 for name, n in pairs(map_global) do t[n] = name end
240 for name, n in pairs(map_global) do t[n] = name end
264 for name, n in pairs(map_extern) do t[-n] = name end
275 for name, n in pairs(map_extern) do t[-n] = name end
1804 for name,n in pairs{ rol = 0, ror = 1, rcl = 2, rcr = 3,
1810 for cc,n in pairs(map_cc) do
1841 for name,n in pairs{ sqrt = 1, add = 8, mul = 9,
1856 for name,n in pairs{
[all …]
H A Ddasm_arm64.lua23 local type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs
153 for name, n in pairs(map_global) do t[n] = name end
164 for name, n in pairs(map_global) do t[n] = name end
175 for name, n in pairs(map_global) do t[n] = name end
894 for cond,c in pairs(map_cond) do
1161 for name in pairs(map_type) do t[#t+1] = name end
H A Ddasm_ppc.lua25 local type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs
149 for name, n in pairs(map_global) do t[n] = name end
160 for name, n in pairs(map_global) do t[n] = name end
171 for name, n in pairs(map_global) do t[n] = name end
1419 for k,v in pairs(map_op) do
1425 for k,v in pairs(t) do
1431 for cond,c in pairs(map_cond) do
1861 for name in pairs(map_type) do t[#t+1] = name end
/PHP-8.3/ext/mbstring/tests/
H A Dsjis2004_encoding.phpt60 // Some pairs of Unicode codepoints are represented by a single character in SJIS-2004
61 // Test the case where the first codepoint looks like it might be one of these pairs...
H A Dmb_str_split_utf8_utf16.phpt2 mb_str_split() tests UTF-8 illegal chars & UTF-16 surrogate pairs
H A Dutf8_mobile_encodings.phpt21 // Reserved range for UTF-16 surrogate pairs
H A Dutf_encodings.phpt768 // Reserved range for UTF-16 surrogate pairs
/PHP-8.3/ext/pcre/pcre2lib/
H A Dpcre2_substitute.c306 int pairs = (code->top_bracket + 1 < match_data->oveccount)? in pcre2_substitute() local
312 + 2*pairs*sizeof(PCRE2_SIZE)); in pcre2_substitute()
/PHP-8.3/sapi/fpm/tests/
H A Dfcgi.inc605 * Read a set of FastCGI Name value pairs
/PHP-8.3/ext/fileinfo/tests/
H A Dmagic17063 # number of system dependent strings pairs
H A Dmagic私はガラスを食べられます17063 # number of system dependent strings pairs

Completed in 298 milliseconds