/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1073 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1685 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1700 if (Traits::startLess(b, this->stop()) || in setStop() 1814 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2119 return Traits::startLess(ak, bk) ? bk : ak; in start() 2126 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2144 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 145 static inline bool startLess(const T &x, const T &a) { in startLess() function 171 static inline bool startLess(const T &x, const T &a) { in startLess() function 615 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1074 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1691 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1706 if (Traits::startLess(b, this->stop()) || in setStop() 1820 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2125 return Traits::startLess(ak, bk) ? bk : ak; in start() 2132 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2150 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1073 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1685 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1700 if (Traits::startLess(b, this->stop()) || in setStop() 1814 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2119 return Traits::startLess(ak, bk) ? bk : ak; in start() 2126 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2144 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1073 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1685 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1700 if (Traits::startLess(b, this->stop()) || in setStop() 1814 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2119 return Traits::startLess(ak, bk) ? bk : ak; in start() 2126 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2144 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/ |
H A D | IntervalMap.h | 145 static inline bool startLess(const T &x, const T &a) { in startLess() function 171 static inline bool startLess(const T &x, const T &a) { in startLess() function 615 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1074 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1691 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1706 if (Traits::startLess(b, this->stop()) || in setStop() 1820 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2125 return Traits::startLess(ak, bk) ? bk : ak; in start() 2132 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2150 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1069 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1681 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1696 if (Traits::startLess(b, this->stop()) || in setStop() 1810 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2115 return Traits::startLess(ak, bk) ? bk : ak; in start() 2122 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2140 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1073 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1685 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1700 if (Traits::startLess(b, this->stop()) || in setStop() 1814 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2119 return Traits::startLess(ak, bk) ? bk : ak; in start() 2126 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2144 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1073 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1685 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1700 if (Traits::startLess(b, this->stop()) || in setStop() 1814 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2119 return Traits::startLess(ak, bk) ? bk : ak; in start() 2126 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2144 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 145 static inline bool startLess(const T &x, const T &a) { in startLess() function 171 static inline bool startLess(const T &x, const T &a) { in startLess() function 615 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1077 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1694 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1709 if (Traits::startLess(b, this->stop()) || in setStop() 1823 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2128 return Traits::startLess(ak, bk) ? bk : ak; in start() 2135 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2153 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 145 static inline bool startLess(const T &x, const T &a) { in startLess() function 171 static inline bool startLess(const T &x, const T &a) { in startLess() function 615 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1074 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1691 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1706 if (Traits::startLess(b, this->stop()) || in setStop() 1820 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2125 return Traits::startLess(ak, bk) ? bk : ak; in start() 2132 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2150 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 145 static inline bool startLess(const T &x, const T &a) { in startLess() function 171 static inline bool startLess(const T &x, const T &a) { in startLess() function 615 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1074 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1691 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1706 if (Traits::startLess(b, this->stop()) || in setStop() 1820 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2125 return Traits::startLess(ak, bk) ? bk : ak; in start() 2132 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2150 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1069 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1681 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1696 if (Traits::startLess(b, this->stop()) || in setStop() 1810 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2115 return Traits::startLess(ak, bk) ? bk : ak; in start() 2122 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2140 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1073 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1685 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1700 if (Traits::startLess(b, this->stop()) || in setStop() 1814 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2119 return Traits::startLess(ak, bk) ? bk : ak; in start() 2126 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2144 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 145 static inline bool startLess(const T &x, const T &a) { in startLess() function 171 static inline bool startLess(const T &x, const T &a) { in startLess() function 615 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1074 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1691 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1706 if (Traits::startLess(b, this->stop()) || in setStop() 1820 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2125 return Traits::startLess(ak, bk) ? bk : ak; in start() 2132 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2150 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1073 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1685 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1700 if (Traits::startLess(b, this->stop()) || in setStop() 1814 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2119 return Traits::startLess(ak, bk) ? bk : ak; in start() 2126 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2144 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/ |
H A D | IntervalMap.h | 141 static inline bool startLess(const T &x, const T &a) { in startLess() function 167 static inline bool startLess(const T &x, const T &a) { in startLess() function 611 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1074 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1686 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1701 if (Traits::startLess(b, this->stop()) || in setStop() 1815 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2120 return Traits::startLess(ak, bk) ? bk : ak; in start() 2127 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2145 if (Traits::startLess(posB.stop(), posA.stop()))
|
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/ |
H A D | IntervalMap.h | 140 static inline bool startLess(const T &x, const T &a) { in startLess() function 166 static inline bool startLess(const T &x, const T &a) { in startLess() function 610 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup() 1077 if (empty() || Traits::startLess(x, start()) || Traits::stopLess(stop(), x)) 1676 if (!Traits::startLess(a, CurStart) || !canCoalesceLeft(a, this->value())) { in setStart() 1691 if (Traits::startLess(b, this->stop()) || in setStop() 1805 if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) { in treeInsert() 2110 return Traits::startLess(ak, bk) ? bk : ak; in start() 2117 return Traits::startLess(ak, bk) ? ak : bk; in stop() 2135 if (Traits::startLess(posB.stop(), posA.stop()))
|