Searched refs:min_len (Results 1 - 9 of 9) sorted by relevance
/macosx-10.10/libstdcxx-104.1/src/ |
H A D | ext-inst.cc | 41 const int min_len = __detail::_S_max_rope_depth + 1; member in namespace:__anon9793 46 rope<char, std::allocator<char> >::_S_min_len[min_len]; 58 rope<wchar_t, std::allocator<wchar_t> >::_S_min_len[min_len];
|
/macosx-10.10/ntfs-84/kext/ |
H A D | ntfs_collate.c | 137 int min_len, i, rc; local 144 min_len = data1_len; 145 if (min_len > data2_len) 146 min_len = data2_len; 147 min_len >>= 2; 148 for (i = 0; i < min_len; i++) {
|
H A D | ntfs_unistr.c | 126 u32 cnt, min_len; local 129 min_len = name1_len; 131 min_len = name2_len; 132 for (cnt = 0; cnt < min_len; ++cnt) {
|
/macosx-10.10/dcerpc-61/dcerpc/rpcd/ |
H A D | rpcd.c | 156 long min_len 305 * string matches the key where at least min_len characters 309 INTERNAL boolean32 match_command(key,str,min_len) 312 long min_len; 323 if (*str == '\0' && i >= min_len)
|
/macosx-10.10/patch_cmds-17/patch/ |
H A D | pch.c | 1473 size_t min_components, min_baselen, min_len, tmp; local 1484 min_components = min_baselen = min_len = SIZE_MAX; 1495 if ((tmp = strlen(names[i].path)) > min_len) 1497 min_len = tmp; 1505 min_components = min_baselen = min_len = SIZE_MAX; 1516 if ((tmp = strlen(names[i].path)) > min_len) 1518 min_len = tmp;
|
/macosx-10.10/bc-21/bc/lib/ |
H A D | number.c | 435 int min_scale, min_len; local 442 min_len = MIN (n1->n_len, n2->n_len); 488 for (count = 0; count < min_len + min_scale; count++) 502 if (diff_len != min_len) 504 for (count = diff_len - min_len; count > 0; count--)
|
/macosx-10.10/ruby-106/ruby/ |
H A D | regparse.h | 201 OnigDistance min_len; /* min length (byte) */ member in struct:__anon12504
|
H A D | regcomp.c | 2175 *min = en->min_len; 2238 *min = en->min_len; 2242 en->min_len = *min; 5219 if (IS_ENCLOSE_MIN_FIXED(en)) min = en->min_len;
|
/macosx-10.10/vim-55/src/ |
H A D | edit.c | 2226 int min_len; local 2269 min_len = actual_len < actual_compl_length 2287 for (i = 0; i < min_len; ++i) 2315 for (i = 0; i < min_len; ++i) 2336 for (i = 0; i < min_len; ++i)
|
Completed in 156 milliseconds