Home
last modified time | relevance | path

Searched refs:upper_bound (Results 1 – 5 of 5) sorted by relevance

/glibc-2.36/support/
Dtst-timespec.c42 double upper_bound; member
187 .upper_bound = 1, .lower_bound = 1, .result = 1,
192 .upper_bound = 1, .lower_bound = 1, .result = 0,
197 .upper_bound = 2, .lower_bound = 1, .result = 1,
202 .upper_bound = 1, .lower_bound = 0, .result = 1,
207 .upper_bound = 1, .lower_bound = 1, .result = 0,
212 .upper_bound = 1.3, .lower_bound = 1, .result = 1,
217 .upper_bound = 1, .lower_bound = .001, .result = 1,
222 .upper_bound = 1, .lower_bound = 1, .result = 1,
227 .upper_bound = -1, .lower_bound = -1, .result = 0,
[all …]
Dtimespec.c108 double lower_bound, double upper_bound) in support_timespec_check_in_range() argument
110 assert (upper_bound >= lower_bound); in support_timespec_check_in_range()
117 return (lower_bound <= ratio && ratio <= upper_bound); in support_timespec_check_in_range()
Dtimespec.h58 double lower_bound, double upper_bound);
83 double upper_bound),
/glibc-2.36/iconvdata/
Dutf-7.c58 uint32_t const lower_bound, uint32_t const upper_bound) in between() argument
60 return (ch >= lower_bound && ch <= upper_bound); in between()
/glibc-2.36/manual/
Dmath.texi2019 @deftypefun uint32_t arc4random_uniform (uint32_t @var{upper_bound})
2023 less than the @var{upper_bound}. It avoids the @w{modulo bias} when the