| /external/jline/src/src/test/java/jline/ |
| D | TestEditLine.java | 107 b = b.left().right().back(); in testRight()
109 b = b.left().left().left().right().left().back(); in testRight()
118 assertBuffer("This is a est", b = b.back()); in testLeft()
119 assertBuffer("This is aest", b = b.back()); in testLeft()
120 assertBuffer("This is est", b = b.back()); in testLeft()
121 assertBuffer("This isest", b = b.back()); in testLeft()
122 assertBuffer("This iest", b = b.back()); in testLeft()
123 assertBuffer("This est", b = b.back()); in testLeft()
124 assertBuffer("Thisest", b = b.back()); in testLeft()
125 assertBuffer("Thiest", b = b.back()); in testLeft()
[all …]
|
| /external/skia/gm/ |
| D | convexpaths.cpp | 54 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, in makePaths()
56 fPaths.back().lineTo(0, 0); in makePaths()
59 fPaths.back().quadTo(50 * SK_Scalar1, 0, in makePaths()
61 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, in makePaths()
104 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0); in makePaths()
107 fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide); in makePaths()
110 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength); in makePaths()
113 fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide); in makePaths()
118 fPaths.back().lineTo(98 * SK_Scalar1, 100 * SK_Scalar1); in makePaths()
119 fPaths.back().lineTo(3 * SK_Scalar1, 96 * SK_Scalar1); in makePaths()
[all …]
|
| D | pathmaskcache.cpp | 74 paths.back().moveTo(0.f, 0.f); in onDraw()
75 paths.back().lineTo(98.f, 100.f); in onDraw()
76 paths.back().lineTo(100.f, 100.f); in onDraw()
77 paths.back().conicTo(150.f, 50.f, 100.f, 0.f, 0.6f); in onDraw()
78 paths.back().conicTo(148.f, 50.f, 100.f, 100.f, 0.6f); in onDraw()
79 paths.back().conicTo(50.f, 30.f, 0.f, 100.f, 0.9f); in onDraw()
82 paths.back().addCircle(30.f, 30.f, 30.f); in onDraw()
83 paths.back().addRect(SkRect::MakeXYWH(45.f, 45.f, 50.f, 60.f)); in onDraw()
84 paths.back().setFillType(SkPath::kEvenOdd_FillType); in onDraw()
|
| /external/clang/lib/Format/ |
| D | ContinuationIndenter.cpp | 103 !(State.Stack.back().BreakBeforeClosingBrace && in canBreak()
122 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder) in canBreak()
139 return !State.Stack.back().NoLineBreak; in canBreak()
147 if (State.Stack.back().BreakBeforeClosingBrace && in mustBreak()
164 State.Stack.back().BreakBeforeParameter && !Current.isTrailingComment() && in mustBreak()
177 State.Stack.back().BreakBeforeParameter) && in mustBreak()
181 if (Current.is(TT_SelectorName) && State.Stack.back().ObjCSelectorNameFound && in mustBreak()
182 State.Stack.back().BreakBeforeParameter) in mustBreak()
224 State.Stack.back().BreakBeforeParameter) in mustBreak()
227 State.Stack.back().BreakBeforeParameter) { in mustBreak()
[all …]
|
| /external/icu/icu4c/source/layoutex/ |
| D | LXUtilities.cpp | 79 le_int32 front, back; in reverse() local
81 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) { in reverse()
84 array[front] = array[back]; in reverse()
85 array[back] = swap; in reverse()
91 le_int32 front, back; in reverse() local
93 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) { in reverse()
96 array[front] = array[back]; in reverse()
97 array[back] = swap; in reverse()
|
| /external/libcxxabi/src/ |
| D | cxa_demangle.cpp | 566 if (!db.template_param.back().empty()) in parse_template_param()
568 for (auto& t : db.template_param.back().front()) in parse_template_param()
591 if (sub < db.template_param.back().size()) in parse_template_param()
593 for (auto& temp : db.template_param.back()[sub]) in parse_template_param()
625 auto expr = db.names.back().move_full(); in parse_const_cast_expr()
629 db.names.back() = "const_cast<" + db.names.back().move_full() + ">(" + expr + ")"; in parse_const_cast_expr()
653 auto expr = db.names.back().move_full(); in parse_dynamic_cast_expr()
657 db.names.back() = "dynamic_cast<" + db.names.back().move_full() + ">(" + expr + ")"; in parse_dynamic_cast_expr()
681 auto expr = db.names.back().move_full(); in parse_reinterpret_cast_expr()
685 … db.names.back() = "reinterpret_cast<" + db.names.back().move_full() + ">(" + expr + ")"; in parse_reinterpret_cast_expr()
[all …]
|
| /external/eigen/test/ |
| D | stddeque.cpp | 25 w.front() = w.back(); in check_stddeque_matrix()
26 VERIFY_IS_APPROX(w.front(), w.back()); in check_stddeque_matrix()
39 v.back() = x; in check_stddeque_matrix()
40 VERIFY_IS_APPROX(v.back(), x); in check_stddeque_matrix()
42 VERIFY_IS_APPROX(v.back(), y); in check_stddeque_matrix()
44 VERIFY_IS_APPROX(v.back(), x); in check_stddeque_matrix()
54 w.front() = w.back(); in check_stddeque_transform()
55 VERIFY_IS_APPROX(w.front(), w.back()); in check_stddeque_transform()
68 v.back() = x; in check_stddeque_transform()
69 VERIFY_IS_APPROX(v.back(), x); in check_stddeque_transform()
[all …]
|
| D | stdlist.cpp | 25 w.front() = w.back(); in check_stdlist_matrix()
26 VERIFY_IS_APPROX(w.front(), w.back()); in check_stdlist_matrix()
39 v.back() = x; in check_stdlist_matrix()
40 VERIFY_IS_APPROX(v.back(), x); in check_stdlist_matrix()
42 VERIFY_IS_APPROX(v.back(), y); in check_stdlist_matrix()
44 VERIFY_IS_APPROX(v.back(), x); in check_stdlist_matrix()
54 w.front() = w.back(); in check_stdlist_transform()
55 VERIFY_IS_APPROX(w.front(), w.back()); in check_stdlist_transform()
68 v.back() = x; in check_stdlist_transform()
69 VERIFY_IS_APPROX(v.back(), x); in check_stdlist_transform()
[all …]
|
| /external/libtextclassifier/tests/ |
| D | tokenizer_test.cc | 43 config = &configs.back(); in TEST()
49 config = &configs.back(); in TEST()
55 config = &configs.back(); in TEST()
98 config = &configs.back(); in TEST()
133 config = &configs.back(); in TEST()
138 config = &configs.back(); in TEST()
143 config = &configs.back(); in TEST()
177 config = &configs.back(); in TEST()
182 config = &configs.back(); in TEST()
187 config = &configs.back(); in TEST()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrBufferAllocPool.cpp | 59 GrBuffer* buffer = fBlocks.back().fBuffer; in deleteBlocks()
61 UNMAP_BUFFER(fBlocks.back()); in deleteBlocks()
89 BufferBlock& block = fBlocks.back(); in unmap()
94 this->flushCpuData(fBlocks.back(), flushSize); in unmap()
106 if (fBlocks.back().fBuffer->isMapped()) { in validate()
107 GrBuffer* buf = fBlocks.back().fBuffer; in validate()
113 SkASSERT(fBlocks.empty() || !fBlocks.back().fBuffer->isMapped()); in validate()
151 BufferBlock& back = fBlocks.back(); in makeSpace() local
152 size_t usedBytes = back.fBuffer->gpuMemorySize() - back.fBytesFree; in makeSpace()
154 if ((size + pad) <= back.fBytesFree) { in makeSpace()
[all …]
|
| /external/eigen/unsupported/Eigen/CXX11/src/ThreadPool/ |
| D | RunQueue.h | 87 unsigned back = back_.load(std::memory_order_relaxed); in PushBack() local
88 Elem* e = &array_[(back - 1) & kMask]; in PushBack()
93 back = ((back - 1) & kMask2) | (back & ~kMask2); in PushBack()
94 back_.store(back, std::memory_order_relaxed); in PushBack()
106 unsigned back = back_.load(std::memory_order_relaxed); in PopBack() local
107 Elem* e = &array_[back & kMask]; in PopBack()
114 back_.store(back + 1 + (kSize << 1), std::memory_order_relaxed); in PopBack()
124 unsigned back = back_.load(std::memory_order_relaxed); in PopBackHalf() local
126 unsigned mid = back; in PopBackHalf()
127 if (size > 1) mid = back + (size - 1) / 2; in PopBackHalf()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | SCCIterator.h | 82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in DFSVisitChildren()
84 NodeType *childN = *VisitStack.back().second++; in DFSVisitChildren()
92 if (MinVisitNumStack.back() > childNum) in DFSVisitChildren()
93 MinVisitNumStack.back() = childNum; in DFSVisitChildren()
103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first)); in GetNextSCC()
104 NodeType *visitingN = VisitStack.back().first; in GetNextSCC()
105 unsigned minVisitNum = MinVisitNumStack.back(); in GetNextSCC()
108 if (!MinVisitNumStack.empty() && MinVisitNumStack.back() > minVisitNum) in GetNextSCC()
109 MinVisitNumStack.back() = minVisitNum; in GetNextSCC()
123 CurrentSCC.push_back(SCCNodeStack.back()); in GetNextSCC()
[all …]
|
| /external/clang/lib/Lex/ |
| D | PPConditionalDirectiveRecord.cpp | 55 if (SourceMgr.isBeforeInTranslationUnit(CondDirectiveLocs.back().getLoc(), in findConditionalDirectiveRegionLoc()
57 return CondDirectiveStack.back(); in findConditionalDirectiveRegionLoc()
73 SourceMgr.isBeforeInTranslationUnit(CondDirectiveLocs.back().getLoc(), in addCondDirectiveLoc()
81 addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back())); in If()
88 addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back())); in Ifdef()
95 addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back())); in Ifndef()
103 addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back())); in Elif()
104 CondDirectiveStack.back() = Loc; in Elif()
109 addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back())); in Else()
110 CondDirectiveStack.back() = Loc; in Else()
[all …]
|
| /external/zopfli/src/zopflipng/lodepng/ |
| D | lodepng_util.cpp | 45 end = &png.back() + 1; in getChunkInfo()
67 end = &png.back() + 1; in getChunks()
109 end = &png.back() + 1; in insertChunks()
168 end = &png.back() + 1; in getFilterTypesInterlaced()
373 zlibinfo->back().btype = BTYPE; in inflate()
378 zlibinfo->back().compressedbits = bp - bpstart; in inflate()
379 zlibinfo->back().uncompressedbytes = uncomprblocksize; in inflate()
417 zlibinfo->back().hlit = HLIT - 257; in getTreeInflateDynamic()
418 zlibinfo->back().hdist = HDIST - 1; in getTreeInflateDynamic()
419 zlibinfo->back().hclen = HCLEN - 4; in getTreeInflateDynamic()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | emplace_back.pass.cpp | 64 assert(&r1 == &c.back()); in main()
70 assert(&r2 == &c.back()); in main()
82 assert(c.back().geti() == 3); in main()
83 assert(c.back().getd() == 4.5); in main()
91 assert(&r1 == &c.back()); in main()
97 assert(&r2 == &c.back()); in main()
109 assert(c.back().geti() == 3); in main()
110 assert(c.back().getd() == 4.5); in main()
118 assert(&r1 == &c.back()); in main()
124 assert(&r2 == &c.back()); in main()
[all …]
|
| D | emplace.pass.cpp | 71 assert(c.back().geti() == 3); in main()
72 assert(c.back().getd() == 4.5); in main()
81 assert(c.back().geti() == 3); in main()
82 assert(c.back().getd() == 4.5); in main()
98 assert(c.back().geti() == 3); in main()
99 assert(c.back().getd() == 4.5); in main()
108 assert(c.back().geti() == 3); in main()
109 assert(c.back().getd() == 4.5); in main()
124 assert(c.back().geti() == 3); in main()
125 assert(c.back().getd() == 4.5); in main()
[all …]
|
| /external/libvncserver/libvncserver/ |
| D | rfbregion.c | 25 sraSpan back; member
103 while (curr != &(l->back)) { in sraSpanListPrint()
120 item->front._next = &(item->back); in sraSpanListCreate()
122 item->back._prev = &(item->front); in sraSpanListCreate()
123 item->back._next = NULL; in sraSpanListCreate()
135 while (curr != &(src->back)) { in sraSpanListDup()
137 sraSpanInsertBefore(newspan, &(newlist->back)); in sraSpanListDup()
147 while (list->front._next != &(list->back)) { in sraSpanListDestroy()
160 while (list->front._next != &(list->back)) { in sraSpanListMakeEmpty()
167 list->front._next = &(list->back); in sraSpanListMakeEmpty()
[all …]
|
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| D | ilistTest.cpp | 29 EXPECT_EQ(1, List.back().Value); in TEST()
30 EXPECT_EQ(0, List.back().getPrevNode()); in TEST()
31 EXPECT_EQ(0, List.back().getNextNode()); in TEST()
34 EXPECT_EQ(2, List.back().Value); in TEST()
36 EXPECT_EQ(1, List.back().getPrevNode()->Value); in TEST()
39 EXPECT_EQ(2, ConstList.back().Value); in TEST()
41 EXPECT_EQ(1, ConstList.back().getPrevNode()->Value); in TEST()
|
| /external/llvm/include/llvm/ADT/ |
| D | SCCIterator.h | 156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
158 NodeType *childN = *VisitStack.back().NextChild++; in DFSVisitChildren()
168 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
169 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 NodeType *visitingN = VisitStack.back().Node; in GetNextSCC()
180 unsigned minVisitNum = VisitStack.back().MinVisited; in GetNextSCC()
181 assert(VisitStack.back().NextChild == GT::child_end(visitingN)); in GetNextSCC()
185 if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum) in GetNextSCC()
186 VisitStack.back().MinVisited = minVisitNum; in GetNextSCC()
202 CurrentSCC.push_back(SCCNodeStack.back()); in GetNextSCC()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | ilistTest.cpp | 32 EXPECT_EQ(1, List.back().Value); in TEST()
33 EXPECT_EQ(nullptr, List.getPrevNode(List.back())); in TEST()
34 EXPECT_EQ(nullptr, List.getNextNode(List.back())); in TEST()
37 EXPECT_EQ(2, List.back().Value); in TEST()
39 EXPECT_EQ(1, List.getPrevNode(List.back())->Value); in TEST()
42 EXPECT_EQ(2, ConstList.back().Value); in TEST()
44 EXPECT_EQ(1, ConstList.getPrevNode(ConstList.back())->Value); in TEST()
64 EXPECT_EQ(3, List.back().Value); in TEST()
96 EXPECT_EQ(6, List.back().Value); in TEST()
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| D | emplace_back.pass.cpp | 38 assert(c.back() == true); in main()
40 assert(c.back() == false); in main()
49 assert(c.back() == true); in main()
55 assert(c.back() == true); in main()
72 assert(c.back() == true); in main()
74 assert(c.back() == false); in main()
83 assert(c.back() == true); in main()
89 assert(c.back() == true); in main()
|
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| D | emplace_back.pass.cpp | 45 assert(&r1 == &c.back()); in main()
50 assert(&r2 == &c.back()); in main()
61 assert(c.back().geti() == 3); in main()
62 assert(c.back().getd() == 4.5); in main()
69 assert(&r1 == &c.back()); in main()
74 assert(&r2 == &c.back()); in main()
85 assert(c.back().geti() == 3); in main()
86 assert(c.back().getd() == 4.5); in main()
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| D | gen6_depthstencil.c | 49 int back = ctx->Stencil._BackFace; in gen6_upload_depth_stencil_state() local
66 intel_translate_compare_func(ctx->Stencil.Function[back]); in gen6_upload_depth_stencil_state()
68 intel_translate_stencil_op(ctx->Stencil.FailFunc[back]); in gen6_upload_depth_stencil_state()
70 intel_translate_stencil_op(ctx->Stencil.ZFailFunc[back]); in gen6_upload_depth_stencil_state()
72 intel_translate_stencil_op(ctx->Stencil.ZPassFunc[back]); in gen6_upload_depth_stencil_state()
73 ds->ds1.bf_stencil_write_mask = ctx->Stencil.WriteMask[back]; in gen6_upload_depth_stencil_state()
74 ds->ds1.bf_stencil_test_mask = ctx->Stencil.ValueMask[back]; in gen6_upload_depth_stencil_state()
80 (ctx->Stencil._TestTwoSide && ctx->Stencil.WriteMask[back])) in gen6_upload_depth_stencil_state()
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
| D | Optimum.java | 42 void set1(int newPrice, int optCur, int back) { in set1() argument
45 backPrev = back; in set1()
52 void set2(int newPrice, int optCur, int back) { in set2() argument
55 backPrev = back; in set2()
64 void set3(int newPrice, int optCur, int back2, int len2, int back) { in set3() argument
67 backPrev = back; in set3()
|
| /external/libpng/contrib/libtests/ |
| D | pngstest.c | 1204 gpc_noop(Pixel *out, const Pixel *in, const Background *back) in gpc_noop() argument
1206 (void)back; in gpc_noop()
1215 gpc_nop8(Pixel *out, const Pixel *in, const Background *back) in gpc_nop8() argument
1217 (void)back; in gpc_nop8()
1234 gpc_nop6(Pixel *out, const Pixel *in, const Background *back) in gpc_nop6() argument
1236 (void)back; in gpc_nop6()
1254 gpc_bckg(Pixel *out, const Pixel *in, const Background *back) in gpc_bckg() argument
1257 out->r = out->g = out->b = back->ig; in gpc_bckg()
1266 out->r = out->g = out->b = sRGB(sRGB_to_d[in->g] * a + back->dg * (1-a)); in gpc_bckg()
1274 gpc_bckc(Pixel *out, const Pixel *in, const Background *back) in gpc_bckc() argument
[all …]
|