| /external/deqp/framework/common/ |
| D | tcuInterval.hpp | 23 * \brief Interval arithmetic and floating point precisions.
65 class Interval class
68 // Empty interval.
69 Interval(void) in Interval() function in tcu::Interval
78 // Intentionally not explicit. Conversion from double to Interval is common
80 Interval(double val) in Interval() function in tcu::Interval
89 Interval(bool hasNaN_, double lo_, double hi_) in Interval() function in tcu::Interval
98 Interval(bool hasNaN_, double lo_, double hi_, double wlo_, double whi_) in Interval() function in tcu::Interval
107 Interval(const Interval &a, const Interval &b) in Interval() function in tcu::Interval
140 Interval nan(void) const in nan()
[all …]
|
| D | tcuInterval.cpp | 21 * \brief Interval arithmetic.
35 Interval applyMonotone(DoubleFunc1 &func, const Interval &arg0) in applyMonotone()
37 Interval ret; in applyMonotone()
42 Interval applyMonotone(DoubleIntervalFunc1 &func, const Interval &arg0) in applyMonotone()
44 return Interval(func(arg0.lo()), func(arg0.hi())); in applyMonotone()
47 Interval applyMonotone(DoubleFunc2 &func, const Interval &arg0, const Interval &arg1) in applyMonotone()
49 Interval ret; in applyMonotone()
56 Interval applyMonotone(DoubleIntervalFunc2 &func, const Interval &arg0, const Interval &arg1) in applyMonotone()
59 …return Interval(Interval(func(lo0, lo1), func(lo0, hi1)), Interval(func(hi0, lo1), func(hi0, hi1))… in applyMonotone()
62 Interval operator+(const Interval &x, const Interval &y) in operator +()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/numeric/interval/include/boost/numeric/interval/ |
| D | utility_fwd.hpp | 1 /* Boost interval/utility.hpp template interface file
14 #include <boost/numeric/interval/detail/interval_prototype.hpp>
28 const T& lower(const interval<T,Policies>& x);
31 const T& upper(const interval<T,Policies>& x);
34 T checked_lower(const interval<T,Policies>& x);
37 T width(const interval<T,Policies>& x);
40 T median(const interval<T,Policies>& x);
43 interval<T,Policies> widen(const interval<T,Policies>& x, const T& v);
50 bool empty(const interval<T,Policies>& x);
53 bool zero_in(const interval<T,Policies>& x);
[all …]
|
| D | interval.hpp | 1 /* Boost interval/interval.hpp header file
15 #include <boost/numeric/interval/detail/interval_prototype.hpp>
27 : std::runtime_error("boost::interval: uncertain comparison") in comparison_error()
34 * interval class
38 class interval class
50 interval();
51 interval(T const &v);
52 template<class T1> interval(T1 const &v);
53 interval(T const &l, T const &u);
54 template<class T1, class T2> interval(T1 const &l, T2 const &u);
[all …]
|
| D | arith.hpp | 1 /* Boost interval/arith.hpp template implementation file
15 #include <boost/numeric/interval/interval.hpp>
16 #include <boost/numeric/interval/detail/bugs.hpp>
17 #include <boost/numeric/interval/detail/test_input.hpp>
18 #include <boost/numeric/interval/detail/division.hpp>
29 const interval<T, Policies>& operator+(const interval<T, Policies>& x) in operator +()
35 interval<T, Policies> operator-(const interval<T, Policies>& x) in operator -()
38 return interval<T, Policies>::empty(); in operator -()
39 return interval<T, Policies>(-x.upper(), -x.lower(), true); in operator -()
43 interval<T, Policies>& interval<T, Policies>::operator+=(const interval<T, Policies>& r) in operator +=()
[all …]
|
| D | utility.hpp | 1 /* Boost interval/utility.hpp template implementation file
14 #include <boost/numeric/interval/utility_fwd.hpp>
15 #include <boost/numeric/interval/detail/test_input.hpp>
16 #include <boost/numeric/interval/detail/bugs.hpp>
32 const T& lower(const interval<T, Policies>& x) in lower()
38 const T& upper(const interval<T, Policies>& x) in upper()
44 T checked_lower(const interval<T, Policies>& x) in checked_lower()
54 T checked_upper(const interval<T, Policies>& x) in checked_upper()
64 T width(const interval<T, Policies>& x) in width()
72 T median(const interval<T, Policies>& x) in median()
[all …]
|
| /external/tcpdump/tests/ |
| D | babel_rfc6126bis.out | 2 Hello seqno 56843 interval 4.00s
7 Hello seqno 3348 interval 4.00s
8 IHU fe80::8d84:d538:a212:c6dd rxcost 96 interval 12.00s
10 Hello seqno 56844 interval 4.00s
11 IHU fe80::e091:f5ff:fecc:7abd rxcost 65535 interval 12.00s
16 Hello seqno 3349 interval 4.00s
17 IHU fe80::8d84:d538:a212:c6dd rxcost 96 interval 12.00s
19 Update/prefix fd77:e11e:3d73::151/128 metric 65535 seqno 12716 interval 16.00s
20 Update/prefix fd77:e11e:3d73:0:dee3:dca3:2244:7264/128 metric 65535 seqno 12716 interval 16.00s
22 Update/prefix fd13:442a:5766::1/128 metric 341 seqno 31397 interval 16.00s
[all …]
|
| D | bfd-multihop-v.out | 6 Desired min Tx Interval: 300 ms
7 Required min Rx Interval: 300 ms
8 Required min Echo Interval: 300 ms
14 Desired min Tx Interval: 400 ms
15 Required min Rx Interval: 400 ms
16 Required min Echo Interval: 400 ms
22 Desired min Tx Interval: 300 ms
23 Required min Rx Interval: 300 ms
24 Required min Echo Interval: 300 ms
30 Desired min Tx Interval: 300 ms
[all …]
|
| D | bfd-raw-auth-md5-v.out | 6 Desired min Tx Interval: 1000 ms
7 Required min Rx Interval: 1000 ms
8 Required min Echo Interval: 0 ms
17 Desired min Tx Interval: 1000 ms
18 Required min Rx Interval: 1000 ms
19 Required min Echo Interval: 0 ms
28 Desired min Tx Interval: 1000 ms
29 Required min Rx Interval: 1000 ms
30 Required min Echo Interval: 0 ms
39 Desired min Tx Interval: 1000 ms
[all …]
|
| D | bfd-raw-auth-sha1-v.out | 6 Desired min Tx Interval: 1000 ms
7 Required min Rx Interval: 1000 ms
8 Required min Echo Interval: 0 ms
17 Desired min Tx Interval: 1000 ms
18 Required min Rx Interval: 1000 ms
19 Required min Echo Interval: 0 ms
28 Desired min Tx Interval: 1000 ms
29 Required min Rx Interval: 1000 ms
30 Required min Echo Interval: 0 ms
39 Desired min Tx Interval: 1000 ms
[all …]
|
| /external/sdv/vsomeip/third_party/boost/numeric/interval/doc/ |
| D | interval.htm | 10 <title>Boost Interval Arithmetic Library</title>
15 "middle"> Interval Arithmetic Library</h1>
24 <a href="#interval">Template class <code>interval</code></a><br>
26 <a href="#interval_lib">Interval support library</a><br>
38 <a href="guide.htm">Choosing your own interval type</a><br>
51 "../../../../boost/numeric/interval.hpp">boost/numeric/interval.hpp</a>>
52 and principally a type which can be used as <code>interval<T></code>.
53 In fact, this interval template is declared as
54 <code>interval<T,Policies></code> where <code>Policies</code> is a
55 policy class that controls the various behaviours of the interval class;
[all …]
|
| /external/bcc/tools/ |
| D | biolatency_example.txt | 326 …interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
328 the key `data` is the list of the log2 histogram intervals. The `interval-start` and `interval-end`…
333 …interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
334 …interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
335 …interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
336 …interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
342 …interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
348 …, 'val_type': 'msecs', 'data': [{'interval-start': 0, 'interval-end': 1, 'count': 11}, {'interval-…
356 [interval] [count]
361 interval output interval, in seconds
|
| /external/sdv/vsomeip/third_party/boost/numeric/ublas/test/ |
| D | test72.cpp | 81 std::cout << "boost::numeric::interval<float>, bounded_array" << std::endl; in test_matrix_vector()
82 …_matrix_vector<ublas::vector<boost::numeric::interval<float>, ublas::bounded_array<boost::numeric:… in test_matrix_vector()
83 …ublas::matrix<boost::numeric::interval<float>, ublas::row_major, ublas::bounded_array<boost::numer… in test_matrix_vector()
87 std::cout << "boost::numeric::interval<double>, bounded_array" << std::endl; in test_matrix_vector()
88 …_matrix_vector<ublas::vector<boost::numeric::interval<double>, ublas::bounded_array<boost::numeric… in test_matrix_vector()
89 …ublas::matrix<boost::numeric::interval<double>, ublas::row_major, ublas::bounded_array<boost::nume… in test_matrix_vector()
95 std::cout << "boost::numeric::interval<float>, unbounded_array" << std::endl; in test_matrix_vector()
96 …matrix_vector<ublas::vector<boost::numeric::interval<float>, ublas::unbounded_array<boost::numeric… in test_matrix_vector()
97 …ublas::matrix<boost::numeric::interval<float>, ublas::row_major, ublas::unbounded_array<boost::num… in test_matrix_vector()
101 std::cout << "boost::numeric::interval<double>, unbounded_array" << std::endl; in test_matrix_vector()
[all …]
|
| /external/mesa3d/src/freedreno/ir3/ |
| D | ir3_shared_ra.c | 28 struct ir3_reg_interval interval; member
33 /* If this interval was spilled, the original physreg_start before spilling.
79 ir3_reg_interval_to_ra_interval(struct ir3_reg_interval *interval) in ir3_reg_interval_to_ra_interval() argument
81 return rb_node_data(struct ra_interval, interval, interval); in ir3_reg_interval_to_ra_interval()
97 ra_interval_next(struct ra_interval *interval) in ra_interval_next() argument
99 struct rb_node *next = rb_node_next(&interval->physreg_node); in ra_interval_next()
104 ra_interval_next_or_null(struct ra_interval *interval) in ra_interval_next_or_null() argument
106 return interval ? ra_interval_next(interval) : NULL; in ra_interval_next_or_null()
121 const struct ra_interval *interval = rb_node_to_interval_const(node); in ra_interval_cmp() local
122 if (interval->physreg_start > reg) in ra_interval_cmp()
[all …]
|
| D | ir3_ra.c | 14 * that multiple values may share the same register interval. From the
19 * instruction, are "locked" to their parent interval. The details of this are
37 const struct ir3_reg_interval *interval = in ir3_reg_interval_cmp() local
39 if (interval->reg->interval_start > reg) in ir3_reg_interval_cmp()
41 else if (interval->reg->interval_end <= reg) in ir3_reg_interval_cmp()
62 /* Get the interval covering the reg, or the closest to the right if it
68 struct ir3_reg_interval *interval = in ir3_reg_interval_search_right() local
70 if (!interval) { in ir3_reg_interval_search_right()
72 } else if (interval->reg->interval_end > offset) { in ir3_reg_interval_search_right()
73 return interval; in ir3_reg_interval_search_right()
[all …]
|
| D | ir3_spill.c | 32 struct ir3_reg_interval interval; member
53 * insert the reload code for them last. Keep track of whether this interval
58 /* Keep track of whether this interval currently can't be spilled because:
65 /* Whether this interval can be rematerialized. */
149 /* We don't create an interval, etc. for the base reg, so just lower the in add_base_reg()
356 ra_spill_interval_init(struct ra_spill_interval *interval, in ra_spill_interval_init() argument
359 ir3_reg_interval_init(&interval->interval, reg); in ra_spill_interval_init()
360 interval->dst.flags = reg->flags; in ra_spill_interval_init()
361 interval->dst.def = reg; in ra_spill_interval_init()
362 interval->already_spilled = false; in ra_spill_interval_init()
[all …]
|
| /external/rust/android-crates-io/crates/tokio/src/time/ |
| D | interval.rs | 9 /// Creates new [`Interval`] that yields with interval of `period`. The first
12 /// by calling [`set_missed_tick_behavior`](Interval::set_missed_tick_behavior).
14 /// An interval will tick indefinitely. At any time, the [`Interval`] value can
15 /// be dropped. This cancels the interval.
31 /// let mut interval = time::interval(Duration::from_millis(10));
33 /// interval.tick().await; // ticks immediately
34 /// interval.tick().await; // ticks after 10ms
35 /// interval.tick().await; // ticks after 10ms
41 /// A simple example using `interval` to execute a task every two seconds.
43 /// The difference between `interval` and [`sleep`] is that an [`Interval`]
[all …]
|
| /external/sdv/vsomeip/third_party/boost/numeric/interval/include/boost/numeric/interval/compare/ |
| D | explicit.hpp | 1 /* Boost interval/compare/explicit.hpp template implementation file
14 #include <boost/numeric/interval/detail/interval_prototype.hpp>
25 bool cerlt(const interval<T, Policies1>& x, const interval<T, Policies2>& y) in cerlt()
31 bool cerlt(const interval<T, Policies>& x, const T& y) in cerlt()
37 bool cerlt(const T& x, const interval<T, Policies>& y) in cerlt()
43 bool cerle(const interval<T, Policies1>& x, const interval<T, Policies2>& y) in cerle()
49 bool cerle(const interval<T, Policies>& x, const T& y) in cerle()
55 bool cerle(const T& x, const interval<T, Policies>& y) in cerle()
61 bool cergt(const interval<T, Policies1>& x, const interval<T, Policies2>& y) in cergt()
67 bool cergt(const interval<T, Policies>& x, const T& y) in cergt()
[all …]
|
| /external/cronet/stable/net/base/ |
| D | interval.h | 5 // An Interval<T> is a data structure used to represent a contiguous, mutable
7 // see whether it is included in the interval, comparing two intervals, and
14 // An Interval<T> is represented using the usual C++ STL convention, namely as
15 // the half-open interval [min, max). A point p is considered to be contained in
16 // the interval iff p >= min && p < max. One consequence of this definition is
17 // that for any non-empty interval, min is contained in the interval but max is
18 // not. There is no canonical representation for the empty interval; rather, any
19 // interval where max <= min is regarded as empty. As a consequence, two empty
27 // >). A difference operator (operator-()) is required if Interval<T>::Length
30 // For equality comparisons, Interval<T> supports an Equals() method and an
[all …]
|
| /external/cronet/tot/net/base/ |
| D | interval.h | 5 // An Interval<T> is a data structure used to represent a contiguous, mutable
7 // see whether it is included in the interval, comparing two intervals, and
14 // An Interval<T> is represented using the usual C++ STL convention, namely as
15 // the half-open interval [min, max). A point p is considered to be contained in
16 // the interval iff p >= min && p < max. One consequence of this definition is
17 // that for any non-empty interval, min is contained in the interval but max is
18 // not. There is no canonical representation for the empty interval; rather, any
19 // interval where max <= min is regarded as empty. As a consequence, two empty
27 // >). A difference operator (operator-()) is required if Interval<T>::Length
30 // For equality comparisons, Interval<T> supports an Equals() method and an
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 1 //===- llvm/Analysis/Interval.h - Interval Class Declaration ----*- C++ -*-===//
10 // This file contains the declaration of the Interval class, which
11 // represents a set of CFG nodes and is a portion of an interval partition.
15 // 1. The header node of an interval dominates all of the elements of the
16 // interval
33 /// Interval Class - An Interval is a set of nodes defined such that every node
34 /// in the interval has all of its predecessors in the interval (except for the
37 class Interval {
39 /// interval. Also, any loops in this interval must go through the HeaderNode.
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) { in Interval() function
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | Interval.h | 1 //===- llvm/Analysis/Interval.h - Interval Class Declaration ----*- C++ -*-===//
9 // This file contains the declaration of the Interval class, which
10 // represents a set of CFG nodes and is a portion of an interval partition.
14 // 1. The header node of an interval dominates all of the elements of the
15 // interval
32 /// Interval Class - An Interval is a set of nodes defined such that every node
33 /// in the interval has all of its predecessors in the interval (except for the
36 class Interval {
38 /// interval. Also, any loops in this interval must go through the HeaderNode.
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) { in Interval() function
[all …]
|
| D | IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
10 // calculates and represents the interval partition of a function, or a
11 // preexisting interval partition.
13 // In this way, the interval partition may be used to reduce a flow graph down
14 // to its degenerate single node interval partition (unless it is irreducible).
17 // whether it should add the "tails" of an interval to an interval itself or if
32 class Interval; variable
36 // IntervalPartition - This class builds and holds an "interval partition" for
39 // interval is a (possibly nonexistent) loop with a "tail" of non-looping
43 using IntervalMapTy = std::map<BasicBlock *, Interval *>;
[all …]
|
| /external/openthread/tests/unit/ |
| D | test_trickle_timer.cpp | 111 uint32_t interval; in TestTrickleTimerPlainMode() local
118 // Validate that timer picks a random interval between min and max in TestTrickleTimerPlainMode()
128 interval = timer.GetInterval(); in TestTrickleTimerPlainMode()
129 VerifyOrQuit((interval >= kMinInterval) && (interval <= kMaxInterval)); in TestTrickleTimerPlainMode()
133 AdvanceTime(interval); in TestTrickleTimerPlainMode()
138 // interval between min and max. in TestTrickleTimerPlainMode()
141 interval = timer.GetInterval(); in TestTrickleTimerPlainMode()
142 VerifyOrQuit((interval >= kMinInterval) && (interval <= kMaxInterval)); in TestTrickleTimerPlainMode()
157 uint32_t interval; in TestTrickleTimerTrickleMode() local
169 // Validate that trickle timer starts with random interval between in TestTrickleTimerTrickleMode()
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/Analysis/ |
| D | IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
10 // calculates and represents the interval partition of a function, or a
11 // preexisting interval partition.
13 // In this way, the interval partition may be used to reduce a flow graph down
14 // to its degenerate single node interval partition (unless it is irreducible).
17 // whether it should add the "tails" of an interval to an interval itself or if
32 class Interval; variable
36 // IntervalPartition - This class builds and holds an "interval partition" for
39 // interval is a (possibly nonexistent) loop with a "tail" of non-looping
43 using IntervalMapTy = std::map<BasicBlock *, Interval *>;
[all …]
|