| /external/llvm/include/llvm/ADT/ |
| D | PriorityQueue.h | 26 class Sequence = std::vector<T>,
27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
31 const Sequence &sequence = Sequence())
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
38 const Sequence &sequence = Sequence())
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
49 typename Sequence::size_type i = in erase_one()
54 typename Sequence::size_type parent = (i - 1) / 2; in erase_one()
|
| /external/llvm/lib/DebugInfo/ |
| D | DWARFDebugLine.cpp | 160 DWARFDebugLine::Sequence::Sequence() { in Sequence() function in DWARFDebugLine::Sequence
164 void DWARFDebugLine::Sequence::reset() { in reset()
203 Sequence.reset(); in resetRowAndSequence()
207 if (Sequence.Empty) { in appendRowToMatrix()
209 Sequence.Empty = false; in appendRowToMatrix()
210 Sequence.LowPC = Row.Address; in appendRowToMatrix()
211 Sequence.FirstRowIndex = RowNumber; in appendRowToMatrix()
217 Sequence.HighPC = Row.Address; in appendRowToMatrix()
218 Sequence.LastRowIndex = RowNumber; in appendRowToMatrix()
219 if (Sequence.isValid()) in appendRowToMatrix()
[all …]
|
| D | DWARFDebugLine.h | 140 struct Sequence { struct
149 Sequence(); argument
152 static bool orderByLowPC(const Sequence& LHS, const Sequence& RHS) { in orderByLowPC() argument
169 void appendSequence(const DWARFDebugLine::Sequence &S) { in appendSequence() argument
196 typedef std::vector<Sequence> SequenceVector;
219 struct Sequence Sequence; member
|
| /external/llvm/lib/CodeGen/ |
| D | PostRASchedulerList.cpp | 125 std::vector<SUnit*> Sequence; member in __anon21e36c810111::SchedulePostRATDList
223 Sequence.clear(); in enterRegion()
239 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in dumpSchedule()
240 if (SUnit *SU = Sequence[i]) in dumpSchedule()
470 Sequence.push_back(SU); in ScheduleNodeTopDown()
484 Sequence.push_back(nullptr); // NULL here means noop in emitNoop()
518 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
627 for (unsigned i = 0, e = Sequence.size(); i != e; ++i) in ListScheduleTopDown()
628 if (!Sequence[i]) in ListScheduleTopDown()
630 assert(Sequence.size() - Noops == ScheduledNodes && in ListScheduleTopDown()
[all …]
|
| /external/chromium_org/third_party/icu/source/data/coll/ |
| D | es.txt | 16 Sequence{
133 Sequence{"&N<ñ<<<Ñ"}
137 Sequence{
|
| D | fi.txt | 17 Sequence{
29 Sequence{
151 Sequence{
|
| D | root.txt | 18 Sequence{
558 Sequence{
674 Sequence{""}
|
| D | sv.txt | 17 Sequence{
27 Sequence{
149 Sequence{
|
| D | ko.txt | 16 Sequence{
408 Sequence{
511 Sequence{
994 Sequence{
|
| D | gl.txt | 13 Sequence{"[import es-u-co-search]"}
17 Sequence{"[import es]"}
|
| D | sr_Latn.txt | 16 Sequence{"[import hr-u-co-search]"}
20 Sequence{"[import hr]"}
|
| D | bs.txt | 16 Sequence{"[import hr-u-co-search]"}
20 Sequence{"[import hr]"}
|
| D | de.txt | 16 Sequence{
24 Sequence{
|
| D | he.txt | 16 Sequence{
134 Sequence{
|
| /external/icu/icu4c/source/data/coll/ |
| D | es.txt | 16 Sequence{
133 Sequence{"&N<ñ<<<Ñ"}
137 Sequence{
|
| D | fi.txt | 17 Sequence{
29 Sequence{
151 Sequence{
|
| D | sv.txt | 17 Sequence{
27 Sequence{
149 Sequence{
|
| D | root.txt | 18 Sequence{
558 Sequence{
674 Sequence{""}
|
| D | gl.txt | 13 Sequence{"[import es-u-co-search]"}
17 Sequence{"[import es]"}
|
| D | bs.txt | 16 Sequence{"[import hr-u-co-search]"}
20 Sequence{"[import hr]"}
|
| D | sr_Latn.txt | 16 Sequence{"[import hr-u-co-search]"}
20 Sequence{"[import hr]"}
|
| D | ko.txt | 16 Sequence{
408 Sequence{
502 Sequence{
985 Sequence{
|
| D | de.txt | 16 Sequence{
24 Sequence{
|
| D | he.txt | 16 Sequence{
134 Sequence{
|
| /external/clang/lib/Sema/ |
| D | SemaInit.cpp | 3062 InitializationSequence &Sequence, in MaybeProduceObjCObject() argument
3074 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject()
3084 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject()
3092 InitializationSequence &Sequence);
3102 InitializationSequence &Sequence) { in TryInitializerListConstruction() argument
3108 Sequence.setIncompleteTypeFailure(E); in TryInitializerListConstruction()
3121 TryListInitialization(S, HiddenArray, Kind, List, Sequence); in TryInitializerListConstruction()
3122 if (Sequence) in TryInitializerListConstruction()
3123 Sequence.AddStdInitializerListConstructionStep(DestType); in TryInitializerListConstruction()
3208 InitializationSequence &Sequence, in TryConstructorInitialization() argument
[all …]
|