Home
last modified time | relevance | path

Searched refs:min_pos (Results 1 – 10 of 10) sorted by relevance

/external/freetype/src/autofit/
Daflatin.c1598 FT_Pos min_pos = 32000; in af_latin_hints_compute_segments() local
1611 FT_Pos prev_min_pos = min_pos; in af_latin_hints_compute_segments()
1652 if ( u < min_pos ) in af_latin_hints_compute_segments()
1653 min_pos = u; in af_latin_hints_compute_segments()
1692 segment->pos = (FT_Short)( ( min_pos + max_pos ) >> 1 ); in af_latin_hints_compute_segments()
1693 segment->delta = (FT_Short)( ( max_pos - min_pos ) >> 1 ); in af_latin_hints_compute_segments()
1707 prev_min_pos = min_pos; in af_latin_hints_compute_segments()
1731 if ( prev_min_pos < min_pos ) in af_latin_hints_compute_segments()
1732 min_pos = prev_min_pos; in af_latin_hints_compute_segments()
1753 prev_segment->pos = (FT_Short)( ( min_pos + in af_latin_hints_compute_segments()
[all …]
/external/libbrillo/brillo/streams/
Dfile_stream.cc394 const off64_t min_pos = 0; in GetPosition() local
395 return std::max(min_pos, pos); in GetPosition()
/external/webp/src/enc/
Dbackward_references_enc.c345 const int min_pos = in VP8LHashChainFill() local
372 if (best_length == MAX_LENGTH) pos = min_pos - 1; in VP8LHashChainFill()
376 for (; pos >= min_pos && --iter; pos = chain[pos]) { in VP8LHashChainFill()
/external/python/cpython3/Tools/clinic/
Dclinic.py647 pos_only = min_pos = max_pos = min_kw_only = 0
658 min_pos = i
859 """ % (nargs, min_pos, max_pos), indent=4)]
898 has_optional_kw = (max(pos_only, min_pos) + min_kw_only < len(converters))
909 …ize_t noptargs = nargs + (kwnames ? PyTuple_GET_SIZE(kwnames) : 0) - %d;" % (min_pos + min_kw_only)
915 """ % (min_pos, max_pos, min_kw_only), indent=4)]
929 …_ssize_t noptargs = nargs + (kwargs ? PyDict_GET_SIZE(kwargs) : 0) - %d;" % (min_pos + min_kw_only)
935 """ % (min_pos, max_pos, min_kw_only), indent=4)]
968 first_opt = max(min_pos, pos_only)
/external/rust/crates/parking_lot_core/src/
Dparking_lot.rs1353 let min_pos = input in normalize_cycle() localVariable
1362 .skip(min_pos) in normalize_cycle()
/external/rust/crates/half/src/
Dbinary16.rs991 let min_pos = f16::from_f32(2f32.powi(f16::MIN_EXP - 1)); in test_f16_consts() localVariable
994 assert_eq!(f16::MIN_POSITIVE, min_pos); in test_f16_consts()
/external/scapy/scapy/layers/
Dinet6.py1135 min_pos = 0
1140 min_pos = 0
1142 res.append(l[min_pos])
1143 del(l[min_pos])
/external/python/cpython2/Lib/test/
Dtest_io.py2402 def test_seek_and_tell_with_data(data, min_pos=0): argument
2413 for i in range(min_pos, len(decoded) + 1): # seek positions
2437 min_pos = offset*2
2438 test_seek_and_tell_with_data(prefix + input, min_pos)
/external/python/cpython3/Lib/test/
Dtest_io.py3005 def test_seek_and_tell_with_data(data, min_pos=0): argument
3016 for i in range(min_pos, len(decoded) + 1): # seek positions
3040 min_pos = offset*2
3041 test_seek_and_tell_with_data(prefix + input, min_pos)
/external/freetype/
DChangeLog.272028 `max_pos' is always larger than `min_pos' so `FT_ABS' is not needed.