| /external/libese/libese/tests/ |
| bitspec_unittests.cpp | 32 } adjacent; member in struct:TestSpec
53 .adjacent = {
119 EXPECT_EQ(0, bs_get(kTestSpec.adjacent.high, byte));
120 EXPECT_EQ(0, bs_get(kTestSpec.adjacent.mid, byte));
121 EXPECT_EQ(0, bs_get(kTestSpec.adjacent.low, byte));
123 EXPECT_EQ(0x3, bs_get(kTestSpec.adjacent.high, byte));
124 EXPECT_EQ(0xf, bs_get(kTestSpec.adjacent.mid, byte));
125 EXPECT_EQ(0x3, bs_get(kTestSpec.adjacent.low, byte));
127 bs_assign(&byte, kTestSpec.adjacent.mid, i);
128 EXPECT_EQ(0x3, bs_get(kTestSpec.adjacent.high, byte))
[all...] |
| /external/chromium-libpac/test/js-unittest/ |
| passthrough.js | 24 // Take care not to place multiple adjacent dots,
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
| 24k-triple-stores-8.s | 1 # Range check after alignment between adjacent offsets >= 24 ??
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Interval.java | 100 /** Are two intervals adjacent such as 0..41 and 42..42? */
101 public boolean adjacent(Interval other) { method in class:Interval
|
| /prebuilts/tools/common/m2/repository/com/squareup/burst/burst/1.1.0/ |
| burst-1.1.0.jar | |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 117 // Adjacent intervals that map to the same value are coalesced.
120 // in an interval, and if two intervals are adjacent so they can be coalesced.
147 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
149 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
168 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
169 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
545 // The intervals are kept sorted and fully coalesced so there are no adjacent
554 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
635 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
638 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 120 // Adjacent intervals that map to the same value are coalesced.
123 // in an interval, and if two intervals are adjacent so they can be coalesced.
149 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
151 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
174 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
175 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
547 // The intervals are kept sorted and fully coalesced so there are no adjacent
556 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
637 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
640 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 120 // Adjacent intervals that map to the same value are coalesced.
123 // in an interval, and if two intervals are adjacent so they can be coalesced.
149 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
151 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
174 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
175 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
547 // The intervals are kept sorted and fully coalesced so there are no adjacent
556 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
637 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
640 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 121 // Adjacent intervals that map to the same value are coalesced.
124 // in an interval, and if two intervals are adjacent so they can be coalesced.
150 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
152 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
175 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
176 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo
548 // The intervals are kept sorted and fully coalesced so there are no adjacent
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i)))
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| IntervalMap.h | 116 // Adjacent intervals that map to the same value are coalesced.
119 // in an interval, and if two intervals are adjacent so they can be coalesced.
146 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
148 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
524 // The intervals are kept sorted and fully coalesced so there are no adjacent
533 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
614 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
617 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) {
639 if (value(i) == y && Traits::adjacent(b, start(i))) {
[all...] |
| /external/llvm/test/MC/X86/AlignedBundling/ |
| labeloffset.s | 40 # and for 2 adjacent labels that both point to the correct instruction
|
| /frameworks/base/core/java/android/widget/ |
| FastScroller.java | 631 * of an adjacent view. If no adjacent view is provided, lays out against
635 * @param adjacent (Optional) The adjacent view, may be null to align to the
640 private void measureViewToSide(View view, View adjacent, Rect margins, Rect out) {
657 if (adjacent == null) {
660 maxWidth = adjacent.getLeft();
662 maxWidth = containerWidth - adjacent.getRight();
677 right = (adjacent == null ? container.right : adjacent.getLeft()) - marginRight
[all...] |
| /prebuilts/go/darwin-x86/doc/play/ |
| life.go | 44 // Count the adjacent cells that are alive.
|
| /prebuilts/go/linux-x86/doc/play/ |
| life.go | 44 // Count the adjacent cells that are alive.
|
