/external/rust/crates/num-traits/src/ |
D | bounds.rs | 9 pub trait Bounded { trait 19 impl Bounded for $t { impl 49 impl<T: Bounded> Bounded for Wrapping<T> { 77 impl<$($name: Bounded,)*> Bounded for ($($name,)*) { impl 98 assert_eq!(<Wrapping<$t> as Bounded>::min_value().0, <$t>::min_value()); in wrapping_bounded() 99 assert_eq!(<Wrapping<$t> as Bounded>::max_value().0, <$t>::max_value()); in wrapping_bounded() 113 assert_eq!(<Wrapping<$t> as Bounded>::min_value().0, <$t>::min_value()); in wrapping_bounded_i128() 114 assert_eq!(<Wrapping<$t> as Bounded>::max_value().0, <$t>::max_value()); in wrapping_bounded_i128() 124 fn require_bounded<T: Bounded>(_: &T) {} in wrapping_is_bounded()
|
D | int.rs | 3 use bounds::Bounded; 39 + Bounded
|
D | lib.rs | 32 pub use bounds::Bounded;
|
/external/rust/crates/num-traits/tests/ |
D | cast.rs | 12 use num_traits::Bounded; 341 assert_eq!(T::$from(Bounded::min_value()).map(New), in newtype_from_primitive() 342 New::<T>::$from(Bounded::min_value())); in newtype_from_primitive() 343 assert_eq!(T::$from(Bounded::max_value()).map(New), in newtype_from_primitive() 344 New::<T>::$from(Bounded::max_value())); in newtype_from_primitive() 379 assert_eq!(T::$to(&Bounded::min_value()), in newtype_to_primitive() 380 New::<T>::$to(&New(Bounded::min_value()))); in newtype_to_primitive() 381 assert_eq!(T::$to(&Bounded::max_value()), in newtype_to_primitive() 382 New::<T>::$to(&New(Bounded::max_value()))); in newtype_to_primitive() 386 fn check<T: PartialEq + Debug + Bounded + ToPrimitive>() { in newtype_to_primitive()
|
/external/rust/crates/regex/src/ |
D | backtrack.rs | 44 pub struct Bounded<'a, 'm, 'r, 's, I> { struct 79 impl<'a, 'm, 'r, 's, I: Input> Bounded<'a, 'm, 'r, 's, I> { implementation 96 let mut b = Bounded { in exec()
|
D | exec.rs | 1124 backtrack::Bounded::exec( in exec_backtrack() 1134 backtrack::Bounded::exec( in exec_backtrack()
|
D | compile.rs | 562 Range(hir::RepetitionRange::Bounded(min, max)) => { in c_repeat()
|
/external/rust/crates/num-integer/benches/ |
D | gcd.rs | 10 use num_traits::{AsPrimitive, Bounded, Signed}; 127 fn run_bench<T: Integer + Bounded + Copy + 'static>(b: &mut Bencher, gcd: fn(&T, &T) -> T) in run_bench()
|
/external/openscreen/third_party/abseil/src/absl/time/ |
D | clock_test.cc | 105 TEST(SleepFor, Bounded) { in TEST() argument
|
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/time/ |
D | clock_test.cc | 105 TEST(SleepFor, Bounded) { in TEST() argument
|
/external/webrtc/third_party/abseil-cpp/absl/time/ |
D | clock_test.cc | 105 TEST(SleepFor, Bounded) { in TEST() argument
|
/external/libtextclassifier/abseil-cpp/absl/time/ |
D | clock_test.cc | 105 TEST(SleepFor, Bounded) { in TEST() argument
|
/external/abseil-cpp/absl/time/ |
D | clock_test.cc | 105 TEST(SleepFor, Bounded) { in TEST() argument
|
/external/rust/crates/parking_lot/src/ |
D | condvar.rs | 710 Bounded(Duration), enumerator 743 Timeout::Bounded(bound) => { in wait() 927 timeout: Timeout::Bounded(Duration::from_secs(1)),
|
/external/rust/crates/regex-syntax/src/hir/ |
D | print.rs | 191 hir::RepetitionRange::Bounded(m, n) => { in visit_post()
|
D | translate.rs | 802 ast::RepetitionKind::Range(ast::RepetitionRange::Bounded( in hir_repetition() 806 hir::RepetitionKind::Range(hir::RepetitionRange::Bounded(m, n)) in hir_repetition() 1752 hir_range(true, hir::RepetitionRange::Bounded(1, 2), hir_lit("a"),) in repetition() 1766 hir::RepetitionRange::Bounded(1, 2), in repetition() 2894 hir::RepetitionRange::Bounded(5, 10), in ignore_whitespace()
|
D | mod.rs | 1399 RepetitionKind::Range(RepetitionRange::Bounded(m, _)) => m == 0, in is_match_empty() 1425 Bounded(u32, u32), enumerator
|
/external/rust/crates/crossbeam-channel/ |
D | README.md | 77 [Bounded MPMC queue](http://www.1024cores.net/home/lock-free-algorithms/queues/bounded-mpmc-queue)
|
/external/rust/crates/regex-syntax/src/ast/ |
D | mod.rs | 1161 Bounded(u32, u32), enumerator 1171 RepetitionRange::Bounded(s, e) if s > e => false, in is_valid()
|
D | print.rs | 207 Bounded(x, y) => write!(self.wtr, "{{{},{}}}", x, y), in fmt_repetition_range()
|
D | parse.rs | 1143 range = ast::RepetitionRange::Bounded(count_start, count_end); in parse_counted_repetition() 3204 ast::RepetitionRange::Bounded(5, 9) in parse_counted_repetition() 3288 ast::RepetitionRange::Bounded(5, 9) in parse_counted_repetition() 3302 ast::RepetitionRange::Bounded(5, 9) in parse_counted_repetition()
|
/external/python/cpython3/Doc/library/ |
D | asyncio-sync.rst | 339 Bounded Semaphore is a version of :class:`Semaphore` that raises
|
/external/rust/crates/regex-syntax/src/hir/literal/ |
D | mod.rs | 620 hir::RepetitionRange::Bounded(m, n) => (m, Some(n)), in prefixes() 696 hir::RepetitionRange::Bounded(m, n) => (m, Some(n)), in suffixes()
|
/external/rust/crates/regex-automata/src/nfa/ |
D | compiler.rs | 492 hir::RepetitionRange::Bounded(min, max) => { in c_repetition()
|
/external/python/cpython2/Doc/library/ |
D | collections.rst | 244 corresponding number of items are discarded from the opposite end. Bounded 400 Bounded length deques provide functionality similar to the ``tail`` filter
|