| /external/deqp/framework/common/ |
| tcuInterval.hpp | 23 * \brief Interval arithmetic and floating point precisions.
57 class Interval
60 // Empty interval.
61 Interval (void)
66 // Intentionally not explicit. Conversion from double to Interval is common
68 Interval (double val)
73 Interval (const Interval& a, const Interval& b)
82 Interval nan (void) const { return m_hasNaN ? TCU_NAN : Interval();
[all...] |
| tcuInterval.cpp | 21 * \brief Interval arithmetic.
35 Interval applyMonotone (DoubleFunc1& func, const Interval& arg0)
37 Interval ret;
43 Interval applyMonotone (DoubleIntervalFunc1& func, const Interval& arg0)
45 return Interval(func(arg0.lo()), func(arg0.hi()));
48 Interval applyMonotone (DoubleFunc2& func, const Interval& arg0, const Interval& arg1
[all...] |
| tcuFloatFormat.hpp | 61 Interval roundOut (const Interval& x, bool roundUnderOverflow) const;
64 Interval convert (const Interval& x) const;
67 std::string intervalToHex (const Interval& interval) const;
74 Interval clampValue (double d) const;
|
| tcuFloatFormat.cpp | 38 Interval chooseInterval(YesNoMaybe choice, const Interval& no, const Interval& yes)
48 return Interval();
155 Interval FloatFormat::clampValue (double d) const
168 return Interval(d);
173 Interval FloatFormat::convert (const Interval& x) const
175 Interval ret;
176 Interval tmp = x
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Interval.java | 30 /** An immutable inclusive interval a..b */
31 public class Interval {
34 static Interval[] cache = new Interval[INTERVAL_POOL_MAX_VALUE+1];
44 public Interval(int a, int b) { this.a=a; this.b=b; }
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) {
53 //return new Interval(a,b);
56 return new Interval(a,b)
[all...] |
| IntervalSet.java | 56 protected List<Interval> intervals;
60 intervals = new ArrayList<Interval>(2); // most sets are 1 or 2 elements
63 public IntervalSet(List<Interval> intervals) {
88 /** Add interval; i.e., add all integers from a to b to set.
96 add(Interval.create(a,b));
100 protected void add(Interval addition) {
108 Interval r = (Interval) iter.next();
113 // next to each other, make a single larger interval
114 Interval bigger = addition.union(r)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| 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 th
[all...] |
| IntervalPartition.h | 1 //===- 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-loopin
[all...] |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
50 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
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) {
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 membe
[all...] |
| /external/chromium_org/cc/scheduler/ |
| delay_based_time_source_unittest.cc | 15 base::TimeDelta Interval() {
25 FakeDelayBasedTimeSource::Create(Interval(), task_runner.get());
43 FakeDelayBasedTimeSource::Create(Interval(), task_runner.get());
57 FakeDelayBasedTimeSource::Create(Interval(), task_runner.get());
71 FakeDelayBasedTimeSource::Create(Interval(), task_runner.get());
88 FakeDelayBasedTimeSource::Create(Interval(), task_runner.get());
96 timer->SetNow(timer->Now() + Interval());
109 FakeDelayBasedTimeSource::Create(Interval(), task_runner.get());
117 timer->SetNow(timer->Now() + Interval() +
124 // At 60Hz, when the tick returns at exactly 2*interval after the requested nex
514 base::TimeDelta interval = base::TimeDelta::FromInternalValue(4000); local
[all...] |
| /external/llvm/lib/Support/ |
| LockFileManager.cpp | 183 unsigned long Interval = 1;
185 struct timespec Interval;
186 Interval.tv_sec = 0;
187 Interval.tv_nsec = 1000000;
193 // Sleep for the designated interval, to allow the owning process time to
198 Sleep(Interval);
200 nanosleep(&Interval, nullptr);
228 Interval = 1;
230 Interval.tv_sec = 0;
231 Interval.tv_nsec = 1000000
[all...] |
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| unroll1.cpp | 18 class Interval;
68 struct DomainTraits<Interval>
72 typedef Interval Domain_t;
73 typedef Interval OneDomain_t;
101 class Interval : public Domain<DomainTraits<Interval> >
104 Interval(const Interval &a) : Domain<DomainTraits<Interval> >() {
105 for (int i=0; i < DomainTraits<Interval>::dimensions; ++i
[all...] |
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| unroll1.cpp | 18 class Interval;
68 struct DomainTraits<Interval>
72 typedef Interval Domain_t;
73 typedef Interval OneDomain_t;
101 class Interval : public Domain<DomainTraits<Interval> >
104 Interval(const Interval &a) : Domain<DomainTraits<Interval> >() {
105 for (int i=0; i < DomainTraits<Interval>::dimensions; ++i
[all...] |
| /external/chromium_org/media/filters/ |
| wsola_internals.h | 20 typedef std::pair<int, int> Interval;
54 Interval exclude_interval,
66 Interval exclude_interval,
74 // |exclude_interval| is an interval that is excluded from the search.
77 Interval exclude_interval);
|
| /external/llvm/lib/Analysis/ |
| Interval.cpp | 1 //===- Interval.cpp - Interval class code ---------------------------------===//
10 // This file contains the definition of the Interval class, which represents a
15 #include "llvm/Analysis/Interval.h"
24 // Interval Implementation
27 // isLoop - Find out if there is a back edge in this interval...
29 bool Interval::isLoop() const {
30 // There is a loop in this interval iff one of the predecessors of the header
31 // node lives in the interval.
40 void Interval::print(raw_ostream &OS) const
[all...] |
| IntervalPartition.cpp | 1 //===- IntervalPartition.cpp - Interval Partition module code -------------===//
11 // calculates and represent the interval partition of a function.
20 "Interval Partition Construction", true, true)
40 // addIntervalToPartition - Add an interval to the internal list of intervals,
41 // and then add mappings from all of the basic blocks in the interval to the
42 // interval itself (in the IntervalMap).
44 void IntervalPartition::addIntervalToPartition(Interval *I) {
48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
53 // updatePredecessors - Interval generation only sets the successor fields of
54 // the interval data structures. After interval generation is complete
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.cpp | 91 Interval::Interval(const Interval& that) : head(NULL), tail(NULL)
96 Interval::~Interval()
102 Interval::clear()
112 Interval::extend(int a, int b)
156 bool Interval::contains(int pos) const
164 bool Interval::overlaps(const Interval &that) cons
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.cpp | 91 Interval::Interval(const Interval& that) : head(NULL), tail(NULL)
96 Interval::~Interval()
102 Interval::clear()
112 Interval::extend(int a, int b)
156 bool Interval::contains(int pos) const
164 bool Interval::overlaps(const Interval &that) cons
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| winusbio.h | 61 UCHAR Interval;
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathFunctions.cpp | 52 class Interval {
56 Interval();
57 Interval(int value);
58 Interval(int min, int max);
70 Interval args;
265 inline Interval::Interval()
270 inline Interval::Interval(int value)
275 inline Interval::Interval(int min, int max
[all...] |
| /external/chromium_org/components/cloud_devices/common/ |
| printer_description.h | 313 struct Interval {
314 Interval();
315 Interval(int32 start, int32 end);
316 Interval(int32 start);
318 bool operator==(const Interval& other) const;
319 bool operator!=(const Interval& other) const { return !(*this == other); }
325 typedef std::vector<Interval> PageRange;
|
| /external/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | 83 using tcu::Interval;
188 * \brief Type traits for generalized interval types.
195 * We now need generalized operations for each type and its interval
198 * The type Traits<T>::IVal is the approximation of T: it is `Interval` for
236 //! Print out an interval with the precision of `fmt`.
267 //! The resulting interval might not be a singleton if rounding in both
286 typedef Interval IVal;
288 static Interval doMakeIVal (const T& value)
291 // hence Interval can represent their ranges without problems.
292 return Interval(double(value))
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIInsertWaits.cpp | 80 /// \brief Get register interval an operand affects.
230 RegInterval Interval = getRegInterval(Op);
231 for (unsigned j = Interval.first; j < Interval.second; ++j) {
328 RegInterval Interval = getRegInterval(Op);
329 for (unsigned j = Interval.first; j < Interval.second; ++j) {
|
| /frameworks/base/core/java/android/widget/ |
| GridLayout.java | 667 Interval span = spec.span;
717 lp.setRowSpecSpan(new Interval(row, row + rowSpan));
718 lp.setColumnSpecSpan(new Interval(col, col + colSpan));
722 private static int clip(Interval minorRange, boolean minorWasDefined, int count) {
745 final Interval majorRange = majorSpec.span;
753 final Interval minorRange = minorSpec.span;
829 Interval span = spec.span;
2463 Interval interval = (Interval) that; local
[all...] |
| /frameworks/support/v7/gridlayout/src/android/support/v7/widget/ |
| GridLayout.java | 652 Interval span = spec.span;
706 lp.setRowSpecSpan(new Interval(row, row + rowSpan));
707 lp.setColumnSpecSpan(new Interval(col, col + colSpan));
711 private static int clip(Interval minorRange, boolean minorWasDefined, int count) {
734 final Interval majorRange = majorSpec.span;
742 final Interval minorRange = minorSpec.span;
806 Interval span = spec.span;
2339 Interval interval = (Interval) that; local
[all...] |
