/PHP-7.3/ext/mbstring/tests/ |
H A D | mb_ereg_replace_named_subpatterns.phpt | 11 // \k<word> syntax 12 echo mb_ereg_replace('(?<a>\s*)(?<b>\w+)(?<c>\s*)', '\k<a>_\k<b>_\k<c>', 'a b c d e' ), "\n"; 13 // \k'word' syntax 15 // numbered captures with \k<n> syntax 16 …echo mb_ereg_replace('(1)(2)(3)(4)(5)(6)(7)(8)(9)(a)(\10)', '\k<0>-\k<10>-', '123456789aa'), PHP_E… 17 // numbered captures with \k'n' syntax 18 …echo mb_ereg_replace('(1)(2)(3)(4)(5)(6)(7)(8)(9)(a)(\10)', "\k'0'-\k'10'-", '123456789aa'), PHP_E… 20 echo mb_ereg_replace('a', "\k'0'_\k<01>", 'a'), PHP_EOL; 33 a_\k<01> 35 -\k<>- [all …]
|
/PHP-7.3/tests/lang/ |
H A D | foreachLoop.013.phpt | 20 foreach ($a as $k=>&$v) { 21 echo " iteration $counter: \$k=$k; \$v=$v\n"; 50 $transform = 'unset($a[$k]);'; 80 iteration 0: $k=0; $v=v.0 94 iteration 0: $k=0; $v=v.0 112 iteration 0: $k=0; $v=v.0 113 iteration 1: $k=1; $v=v.1 133 iteration 0: $k=0; $v=v.0 134 iteration 1: $k=1; $v=v.1 153 iteration 0: $k=0; $v=v.0 [all …]
|
H A D | foreachLoop.015.phpt | 22 foreach ($a as $k=>&$v) { 23 echo " iteration $counter: \$k=$k; \$v=$v\n"; 52 $transform = 'unset($a[$k]);'; 82 iteration 0: $k=0; $v=v.0 96 iteration 0: $k=0; $v=v.0 114 iteration 0: $k=0; $v=v.0 115 iteration 1: $k=1; $v=v.1 135 iteration 0: $k=0; $v=v.0 136 iteration 1: $k=1; $v=v.1 155 iteration 0: $k=0; $v=v.0 [all …]
|
H A D | foreachLoop.012.phpt | 20 foreach ($a as $k=>$v) { 21 echo " iteration $counter: \$k=$k; \$v=$v\n"; 50 $transform = 'unset($a[$k]);'; 80 iteration 0: $k=0; $v=v.0 94 iteration 0: $k=0; $v=v.0 95 iteration 1: $k=1; $v=v.1 111 iteration 0: $k=0; $v=v.0 112 iteration 1: $k=1; $v=v.1 113 iteration 2: $k=2; $v=v.2 131 iteration 0: $k=0; $v=v.0 [all …]
|
H A D | foreachLoop.014.phpt | 22 foreach ($a as $k=>$v) { 23 echo " iteration $counter: \$k=$k; \$v=$v\n"; 52 $transform = 'unset($a[$k]);'; 82 iteration 0: $k=0; $v=v.0 96 iteration 0: $k=0; $v=v.0 97 iteration 1: $k=1; $v=v.1 113 iteration 0: $k=0; $v=v.0 114 iteration 1: $k=1; $v=v.1 115 iteration 2: $k=2; $v=v.2 133 iteration 0: $k=0; $v=v.0 [all …]
|
/PHP-7.3/ext/mbstring/libmbfl/filters/ |
H A D | mbfilter_sjis_2004.c | 138 int k; in mbfl_filt_conv_jis2004_wchar() local 334 for (k = 0; k < jisx0213_p2_ofst_len; k++) { in mbfl_filt_conv_jis2004_wchar() 339 k = k - (jisx0213_p2_ofst[k]-1); in mbfl_filt_conv_jis2004_wchar() 488 int k; in mbfl_filt_conv_wchar_jis2004() local 500 for (k=0;k<jisx0213_u2_tbl_len;k++) { in mbfl_filt_conv_wchar_jis2004() 519 k++; in mbfl_filt_conv_wchar_jis2004() 554 for (k=0; k < uni2jis_tbl_len ;k++) { in mbfl_filt_conv_wchar_jis2004() 556 s1 = uni2jis_tbl[k][c-uni2jis_tbl_range[k][0]]; in mbfl_filt_conv_wchar_jis2004() 565 if (k >= 0) { in mbfl_filt_conv_wchar_jis2004() 573 if (k >= 0) { in mbfl_filt_conv_wchar_jis2004() [all …]
|
H A D | mbfilter_big5.c | 162 int k; in mbfl_filt_conv_big5_wchar() local 206 for (k = 0; k < sizeof(cp950_pua_tbl)/(sizeof(unsigned short)*4); k++) { in mbfl_filt_conv_big5_wchar() 207 if (c2 >= cp950_pua_tbl[k][2] && c2 <= cp950_pua_tbl[k][3]) { in mbfl_filt_conv_big5_wchar() 214 + cp950_pua_tbl[k][0]; in mbfl_filt_conv_big5_wchar() 216 w = c2 - cp950_pua_tbl[k][2] + cp950_pua_tbl[k][0]; in mbfl_filt_conv_big5_wchar() 251 int k; in mbfl_filt_conv_wchar_big5() local 273 for (k = 0; k < sizeof(cp950_pua_tbl)/(sizeof(unsigned short)*4); k++) { in mbfl_filt_conv_wchar_big5() 274 if (c <= cp950_pua_tbl[k][1]) { in mbfl_filt_conv_wchar_big5() 278 c1 = c - cp950_pua_tbl[k][0]; in mbfl_filt_conv_wchar_big5() 280 c2 = cp950_pua_tbl[k][2] >> 8; in mbfl_filt_conv_wchar_big5() [all …]
|
H A D | mbfilter_gb18030.c | 91 k2 = k; in mbfl_bisec_srch() 93 k1 = k + 1; in mbfl_bisec_srch() 113 k2 = k; in mbfl_bisec_srch2() 115 k1 = k; in mbfl_bisec_srch2() 117 return k; in mbfl_bisec_srch2() 129 int k; in mbfl_filt_conv_gb18030_wchar() local 179 for (k = 0; k < mbfl_gb18030_pua_tbl_max; k++) { in mbfl_filt_conv_gb18030_wchar() 249 if (k<0) { in mbfl_filt_conv_gb18030_wchar() 289 int k, k1, k2; in mbfl_filt_conv_wchar_gb18030() local 363 k2 = k; in mbfl_filt_conv_wchar_gb18030() [all …]
|
H A D | mbfilter_cp936.c | 107 int k; in mbfl_filt_conv_cp936_wchar() local 145 for (k = 0; k < mbfl_cp936_pua_tbl_max; k++) { in mbfl_filt_conv_cp936_wchar() 147 c2 <= mbfl_cp936_pua_tbl[k][2] + in mbfl_filt_conv_cp936_wchar() 148 mbfl_cp936_pua_tbl[k][1] - mbfl_cp936_pua_tbl[k][0]) { in mbfl_filt_conv_cp936_wchar() 149 w = c2 - mbfl_cp936_pua_tbl[k][2] + mbfl_cp936_pua_tbl[k][0]; in mbfl_filt_conv_cp936_wchar() 195 int k, k1, k2; in mbfl_filt_conv_wchar_cp936() local 233 k = (k1 + k2) >> 1; in mbfl_filt_conv_wchar_cp936() 234 if (c < mbfl_cp936_pua_tbl[k][0]) { in mbfl_filt_conv_wchar_cp936() 235 k2 = k; in mbfl_filt_conv_wchar_cp936() 237 k1 = k + 1; in mbfl_filt_conv_wchar_cp936() [all …]
|
/PHP-7.3/ext/mysqli/tests/ |
H A D | mysqli_stmt_get_result_metadata.phpt | 98 …$k, gettype($info->name), $info->name, gettype($fields['meta'][$k]->name), $fields['meta'][$k]->na… 102 …$k, gettype($info->orgname), $info->orgname, gettype($fields['meta'][$k]->orgname), $fields['meta'… 106 …$k, gettype($info->table), $info->table, gettype($fields['meta'][$k]->table), $fields['meta'][$k]-… 110 …$k, gettype($info->orgtable), $info->orgtable, gettype($fields['meta'][$k]->orgtable), $fields['me… 114 … $k, gettype($info->def), $info->def, gettype($fields['meta'][$k]->def), $fields['meta'][$k]->def); 122 …$k, gettype($info->length), $info->length, gettype($fields['meta'][$k]->length), $fields['meta'][$… 126 …$k, gettype($info->charsetnr), $info->charsetnr, gettype($fields['meta'][$k]->charsetnr), $fields[… 130 …$k, gettype($info->flags), $info->flags, gettype($fields['meta'][$k]->flags), $fields['meta'][$k]-… 134 …$k, gettype($info->type), $info->type, gettype($fields['meta'][$k]->type), $fields['meta'][$k]->ty… 142 $fields['all_res'][$k]->max_length = $fields['all_meta'][$k]->max_length; [all …]
|
/PHP-7.3/Zend/tests/ |
H A D | list_keyed_evaluation_order_nested.phpt | 30 // 1. Evaluate $k 32 // 3. Evaluate $k[$a] 33 // 4. Assign $b from $k[$a] 35 // 6. Evaluate $k[$c] 36 // 7. Evaluate $k[$c][0] 37 // 8. Assign $d from $k[$c][0] 38 // 9. Evaluate $k[$c][1] 41 // 12. Evaluate $k[$f] 43 // 14. Evaluate $k[$f][$g] 46 // 17. Evaluate $k[$f][$i] [all …]
|
H A D | bug64555.phpt | 13 foreach ($a as $k => $v) { 14 if ($k == 'unsetme') { 15 echo "Unsetting: $k\n"; 16 unset($a[$k]); 17 } else if ($k == 'keepme') { 18 echo "Changing: $k\n"; 19 $a[$k] = 42;
|
H A D | bug37046.phpt | 10 foreach (s() as $k => $function) { 11 echo "op1 $k\n"; 12 if ($k == 0) { 13 foreach (s() as $k => $function) { 14 echo "op2 $k\n";
|
H A D | bug39449.phpt | 10 public function __set($k, $v) { 11 $this->keys[$k] = $v; 21 foreach ($a->arr as $k => $v) { 22 echo "$k => $v\n"; 27 foreach ($a->arr as $k => $v) { 28 echo "$k => $v\n";
|
/PHP-7.3/ext/dba/ |
H A D | dba_lmdb.c | 122 MDB_val k, v; in DBA_FETCH_FUNC() local 136 k.mv_data = key; in DBA_FETCH_FUNC() 164 MDB_val k, v; in DBA_UPDATE_FUNC() local 199 MDB_val k, v; in DBA_EXISTS_FUNC() local 235 MDB_val k; in DBA_DELETE_FUNC() local 265 MDB_val k, v; in DBA_FIRSTKEY_FUNC() local 292 if(k.mv_data) { in DBA_FIRSTKEY_FUNC() 294 ret = estrndup(k.mv_data, k.mv_size); in DBA_FIRSTKEY_FUNC() 305 MDB_val k, v; in DBA_NEXTKEY_FUNC() local 325 if(k.mv_data) { in DBA_NEXTKEY_FUNC() [all …]
|
/PHP-7.3/ext/spl/tests/ |
H A D | recursive_tree_iterator_001.phpt | 29 foreach(new RecursiveTreeIterator($it) as $k => $v) { 30 echo "[$k] => $v\n"; 33 foreach(new RecursiveTreeIterator($it, RecursiveTreeIterator::BYPASS_CURRENT) as $k => $v) { 34 echo "[$k] => $v\n"; 37 …erator($it, RecursiveTreeIterator::BYPASS_CURRENT|RecursiveTreeIterator::BYPASS_KEY) as $k => $v) { 38 echo "[$k] => $v\n"; 41 foreach(new RecursiveTreeIterator($it, 0) as $k => $v) { 42 echo "[$k] => $v\n"; 45 foreach(new RecursiveTreeIterator($it, 0, CachingIterator::CATCH_GET_CHILD) as $k => $v) { 46 echo "[$k] => $v\n";
|
H A D | recursive_tree_iterator_006.phpt | 39 foreach(new RecursiveTreeIterator($it) as $k => $v) { 40 echo "[$k] => $v\n"; 43 foreach(new RecursiveTreeIterator($it, RecursiveTreeIterator::BYPASS_CURRENT) as $k => $v) { 44 echo "[$k] => $v\n"; 47 …erator($it, RecursiveTreeIterator::BYPASS_CURRENT|RecursiveTreeIterator::BYPASS_KEY) as $k => $v) { 48 echo "[$k] => $v\n"; 51 foreach(new RecursiveTreeIterator($it, 0) as $k => $v) { 52 echo "[$k] => $v\n"; 55 foreach(new RecursiveTreeIterator($it, 0, CachingIterator::CATCH_GET_CHILD) as $k => $v) { 56 echo "[$k] => $v\n";
|
H A D | dllist_003.phpt | 12 foreach ($dll as $k => $v) { 13 echo "$k=>$v\n"; 17 foreach ($dll as $k => $v) { 18 echo "$k=>$v\n"; 23 foreach ($dll as $k => $v) { 24 echo "$k=>$v\n";
|
H A D | dllist_002.phpt | 13 foreach($dll as $k=>$v) { 14 echo "$k=>$v\n"; 23 foreach($dll as $k=>$v) { 24 echo "$k=>$v\n"; 30 foreach($dll2 as $k=>$v) { 31 echo "$k=>$v\n";
|
/PHP-7.3/ext/standard/html_tables/ |
H A D | html_table_gen.php | 259 foreach ($a as $k => $v) { 345 foreach ($mappy as $k => $v) { 469 foreach ($multicp_rows as $k => $v) { 535 for ($k = 0; $k < 64; $k++) { variable 539 if (isset($mstable[$i][$k][$l])) { 605 for ($k = 0; $k < 64; $k++) { variable 606 if (isset($mstable[$i][$k])) 612 for ($k = 0; $k < 64; $k++) { variable 613 if ($k == 0) echo "\t"; 614 elseif ($k % 4 == 0) echo "\n\t"; [all …]
|
/PHP-7.3/Zend/tests/list/ |
H A D | list_reference_007.phpt | 9 function offsetSet ($k, $v) { $this->s[$k] = $v; } 10 function &offsetGet ($k) { return $this->s[$k]; } 11 function offsetExists ($k) { return isset($this->s[$k]); } 12 function offsetUnset ($k) { unset($this->s[$k]); }
|
H A D | list_reference_006.phpt | 8 function offsetSet ($k, $v) { $this->s[$k] = $v; } 9 function offsetGet ($k) { return $this->s[$k]; } 10 function offsetExists ($k) { return isset($this->s[$k]); } 11 function offsetUnset ($k) { unset($this->s[$k]); }
|
/PHP-7.3/ext/mbstring/libmbfl/tests/conv_encoding.tests/ |
H A D | gen_exp.c | 119 if (k < 0x80) { in utf32_utf8() 120 buf[0] = k; in utf32_utf8() 122 } else if (k < 0x800) { in utf32_utf8() 123 buf[0] = 0xc0 | (k >> 6); in utf32_utf8() 126 } else if (k < 0x10000) { in utf32_utf8() 127 buf[0] = 0xe0 | (k >> 12); in utf32_utf8() 131 } else if (k < 0x200000) { in utf32_utf8() 132 buf[0] = 0xf0 | (k >> 18); in utf32_utf8() 137 } else if (k < 0x4000000) { in utf32_utf8() 138 buf[0] = 0xf8 | (k >> 24); in utf32_utf8() [all …]
|
/PHP-7.3/Zend/ |
H A D | zend_strtod.c | 581 (k) int k; in Balloc() argument 619 rv->k = k; 873 k = a->k; 962 (b, k) Bigint *b; int k; in pow5mult() argument 1019 (b, k) Bigint *b; int k; in lshift() argument 1283 d1 = z << k | y >> (32 - k); 1301 d0 = Exp_1 | y << k + 16 | z << k | w >> 16 - k; 1303 d1 = w << k + 16 | y << k; 1475 k = -k; 1484 k = -k; [all …]
|
/PHP-7.3/ext/standard/ |
H A D | quot_print.c | 205 size_t i = 0, j = 0, k; in PHP_FUNCTION() local 229 k = 1; in PHP_FUNCTION() 230 while (str_in[i + k] && ((str_in[i + k] == 32) || (str_in[i + k] == 9))) { in PHP_FUNCTION() 232 k++; in PHP_FUNCTION() 234 if (!str_in[i + k]) { in PHP_FUNCTION() 236 i += k; in PHP_FUNCTION() 238 else if ((str_in[i + k] == 13) && (str_in[i + k + 1] == 10)) { in PHP_FUNCTION() 240 i += k + 2; in PHP_FUNCTION() 242 else if ((str_in[i + k] == 13) || (str_in[i + k] == 10)) { in PHP_FUNCTION() 244 i += k + 1; in PHP_FUNCTION()
|