Home
last modified time | relevance | path

Searched full:interval (Results 1 – 25 of 3917) sorted by relevance

12345678910>>...157

/external/deqp/framework/common/
DtcuInterval.hpp23 * \brief Interval arithmetic and floating point precisions.
58 class Interval class
61 // Empty interval.
62 Interval (void) in Interval() function in tcu::Interval
69 // Intentionally not explicit. Conversion from double to Interval is common
71 Interval (double val) in Interval() function in tcu::Interval
79 Interval(bool hasNaN_, double lo_, double hi_) in Interval() function in tcu::Interval
82 Interval(bool hasNaN_, double lo_, double hi_, double wlo_, double whi_) in Interval() function in tcu::Interval
85 Interval (const Interval& a, const Interval& b) in Interval() function in tcu::Interval
98 Interval nan (void) const { return m_hasNaN ? TCU_NAN : Interval(); } in nan()
[all …]
DtcuInterval.cpp21 * \brief Interval arithmetic.
35 Interval applyMonotone (DoubleFunc1& func, const Interval& arg0) in applyMonotone()
37 Interval ret; in applyMonotone()
43 Interval applyMonotone (DoubleIntervalFunc1& func, const Interval& arg0) in applyMonotone()
45 return Interval(func(arg0.lo()), func(arg0.hi())); in applyMonotone()
48 Interval applyMonotone (DoubleFunc2& func, const Interval& arg0, const Interval& arg1) in applyMonotone()
50 Interval ret; in applyMonotone()
58 Interval applyMonotone (DoubleIntervalFunc2& func, const Interval& arg0, const Interval& arg1) in applyMonotone()
61 return Interval(Interval(func(lo0, lo1), func(lo0, hi1)), in applyMonotone()
62 Interval(func(hi0, lo1), func(hi0, hi1))); in applyMonotone()
[all …]
/external/tcpdump/tests/
Dbabel_rfc6126bis.out2 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 …]
Dbfd-multihop-v.out6 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 …]
Dbfd-raw-auth-md5-v.out6 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 …]
Dbfd-raw-auth-sha1-v.out6 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 …]
Dbfd-raw-auth-simple-v.out6 Desired min Tx Interval: 1000 ms
7 Required min Rx Interval: 1000 ms
8 Required min Echo Interval: 0 ms
16 Desired min Tx Interval: 1000 ms
17 Required min Rx Interval: 1000 ms
18 Required min Echo Interval: 0 ms
26 Desired min Tx Interval: 1000 ms
27 Required min Rx Interval: 1000 ms
28 Required min Echo Interval: 0 ms
36 Desired min Tx Interval: 1000 ms
[all …]
/external/bcc/tools/
Dbiolatency_example.txt326interval-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`…
333interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
334interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
335interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
336interval-start': 0, 'interval-end': 1, 'count': 0}, {'interval-start': 2, 'interval-end': 3, 'coun…
342interval-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/rust/crates/tokio/src/time/
Dinterval.rs10 /// Creates new [`Interval`] that yields with interval of `period`. The first
13 /// by calling [`set_missed_tick_behavior`](Interval::set_missed_tick_behavior).
15 /// An interval will tick indefinitely. At any time, the [`Interval`] value can
16 /// be dropped. This cancels the interval.
32 /// let mut interval = time::interval(Duration::from_millis(10));
34 /// interval.tick().await; // ticks immediately
35 /// interval.tick().await; // ticks after 10ms
36 /// interval.tick().await; // ticks after 10ms
42 /// A simple example using `interval` to execute a task every two seconds.
44 /// The difference between `interval` and [`sleep`] is that an [`Interval`]
[all …]
/external/cronet/net/base/
Dinterval.h5 // 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/net/third_party/quiche/src/quiche/quic/core/
Dquic_interval_set.h10 // interval set preserve these properties, altering the set as needed. For
12 // set containing the single interval [1, 3).
14 // Supported operations include testing whether an Interval is contained in the
20 // due to an Add operation), other interval entries may be coalesced, removed,
27 // interval which (if the interval is not empty) contains min but does not
28 // contain max. An interval is considered empty if min >= max.
40 // intervals.Add(Interval<int>(10, 20));
41 // intervals.Add(Interval<int>(30, 40));
43 // intervals.Add(Interval<int>(15, 35));
46 // EXPECT_TRUE(intervals.Contains(Interval<int>(10, 40)));
[all …]
/external/llvm/include/llvm/Analysis/
DInterval.h1 //===- 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 …]
DIntervalPartition.h1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-looping
41 typedef std::map<BasicBlock*, Interval*> IntervalMapTy;
[all …]
DIntervalIterator.h1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
50 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); } in getNodeHeader()
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) { in getSourceGraphNode()
64 // with the task of adding a node to the new interval, depending on the
66 // case), the BasicBlock itself is added to the interval.
68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { in addNodeToInterval()
73 // with the task of adding a node to the new interval, depending on the
75 // case), the BasicBlock itself is added to the interval. In the case of
76 // an IntervalPartition source graph (Interval case), all of the member
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DInterval.h1 //===- 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 …]
DIntervalPartition.h1 //===- 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 …]
DIntervalIterator.h1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
14 // 2. An IntervalPartition& object, composed of Interval nodes.
36 #include "llvm/Analysis/Interval.h"
56 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); } in getNodeHeader()
64 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) { in getSourceGraphNode()
69 // with the task of adding a node to the new interval, depending on the
71 // case), the BasicBlock itself is added to the interval.
72 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { in addNodeToInterval()
77 // with the task of adding a node to the new interval, depending on the
79 // case), the BasicBlock itself is added to the interval. In the case of
[all …]
/external/icu/icu4c/source/i18n/unicode/
Ddtitvfmt.h23 * \brief C++ API: Format and parse date interval in a language-independent manner.
43 * An immutable class containing the result of a date interval formatting operation.
120 * Date interval means from one date to another date,
129 * For example, the date interval format from "Jan 11, 2008" to "Jan 18,. 2008"
142 * We introduce class DateIntervalInfo to save date interval
146 * Logically, the interval patterns are mappings
175 * The calendar fields we support for interval formatting are:
190 * For other calendar fields, the compact interval formatting is not
191 * supported. And the interval format will be fall back to fall-back
196 * There are pre-defined interval patterns for those pre-defined skeletons
[all …]
Ddtitvinf.h23 * \brief C++ API: Date/Time interval patterns for formatting date/time interval
37 * date time interval patterns. It is used by DateIntervalFormat.
42 * DateIntervalFormat will take care of it when creating a date interval
46 * For power users, who want to create their own date interval patterns,
47 * or want to re-set date interval patterns, they could do so by
51 * Logically, the interval patterns are mappings
77 * The calendar fields we support for interval formatting are:
90 * There are pre-defined interval patterns for those pre-defined skeletons
94 * is &quot;year&quot;, the date interval pattern is &quot;MMM d, yyyy - MMM d, yyyy&quot;,
97 * the date interval pattern is &quot;MMM d - MMM d, yyyy&quot;,
[all …]
/external/cronet/third_party/icu/source/i18n/unicode/
Ddtitvfmt.h23 * \brief C++ API: Format and parse date interval in a language-independent manner.
43 * An immutable class containing the result of a date interval formatting operation.
120 * Date interval means from one date to another date,
129 * For example, the date interval format from "Jan 11, 2008" to "Jan 18,. 2008"
142 * We introduce class DateIntervalInfo to save date interval
146 * Logically, the interval patterns are mappings
175 * The calendar fields we support for interval formatting are:
190 * For other calendar fields, the compact interval formatting is not
191 * supported. And the interval format will be fall back to fall-back
196 * There are pre-defined interval patterns for those pre-defined skeletons
[all …]
Ddtitvinf.h23 * \brief C++ API: Date/Time interval patterns for formatting date/time interval
37 * date time interval patterns. It is used by DateIntervalFormat.
42 * DateIntervalFormat will take care of it when creating a date interval
46 * For power users, who want to create their own date interval patterns,
47 * or want to re-set date interval patterns, they could do so by
51 * Logically, the interval patterns are mappings
77 * The calendar fields we support for interval formatting are:
90 * There are pre-defined interval patterns for those pre-defined skeletons
94 * is &quot;year&quot;, the date interval pattern is &quot;MMM d, yyyy - MMM d, yyyy&quot;,
97 * the date interval pattern is &quot;MMM d - MMM d, yyyy&quot;,
[all …]
/external/icu/libicu/cts_headers/unicode/
Ddtitvfmt.h23 * \brief C++ API: Format and parse date interval in a language-independent manner.
43 * An immutable class containing the result of a date interval formatting operation.
120 * Date interval means from one date to another date,
129 * For example, the date interval format from "Jan 11, 2008" to "Jan 18,. 2008"
142 * We introduce class DateIntervalInfo to save date interval
146 * Logically, the interval patterns are mappings
175 * The calendar fields we support for interval formatting are:
190 * For other calendar fields, the compact interval formatting is not
191 * supported. And the interval format will be fall back to fall-back
196 * There are pre-defined interval patterns for those pre-defined skeletons
[all …]
Ddtitvinf.h23 * \brief C++ API: Date/Time interval patterns for formatting date/time interval
37 * date time interval patterns. It is used by DateIntervalFormat.
42 * DateIntervalFormat will take care of it when creating a date interval
46 * For power users, who want to create their own date interval patterns,
47 * or want to re-set date interval patterns, they could do so by
51 * Logically, the interval patterns are mappings
77 * The calendar fields we support for interval formatting are:
90 * There are pre-defined interval patterns for those pre-defined skeletons
94 * is &quot;year&quot;, the date interval pattern is &quot;MMM d, yyyy - MMM d, yyyy&quot;,
97 * the date interval pattern is &quot;MMM d - MMM d, yyyy&quot;,
[all …]
/external/antlr/tool/src/main/java/org/antlr/misc/
DInterval.java30 /** An immutable inclusive interval a..b */
31 public class Interval { class
34 static Interval[] cache = new Interval[INTERVAL_POOL_MAX_VALUE+1];
44 public Interval(int a, int b) { this.a=a; this.b=b; } in Interval() method in Interval
46 /** Interval objects are used readonly so share all with the
49 * Interval object with a..a in it. On Java.g, 218623 IntervalSets
52 public static Interval create(int a, int b) { in create()
53 //return new Interval(a,b); in create()
56 return new Interval(a,b); in create()
59 cache[a] = new Interval(a,a); in create()
[all …]
DIntervalSet.java56 protected List<Interval> intervals;
60 intervals = new ArrayList<Interval>(2); // most sets are 1 or 2 elements in IntervalSet()
63 public IntervalSet(List<Interval> intervals) { in IntervalSet()
89 /** Add interval; i.e., add all integers from a to b to set.
97 add(Interval.create(a,b)); in add()
101 protected void add(Interval addition) { in add()
108 for (ListIterator<Interval> iter = intervals.listIterator(); iter.hasNext();) { in add()
109 Interval r = iter.next(); in add()
114 // next to each other, make a single larger interval in add()
115 Interval bigger = addition.union(r); in add()
[all …]

12345678910>>...157