| /external/clang/lib/Analysis/ |
| PostOrderCFGView.cpp | 45 unsigned b1V = (b1It == POV.BlockOrder.end()) ? 0 : b1It->second;
46 unsigned b2V = (b2It == POV.BlockOrder.end()) ? 0 : b2It->second;
|
| /external/clang/lib/Tooling/ |
| CommonOptionsParser.cpp | 73 if (I->second->Category != &Category && I->first() != "help" &&
75 I->second->setHiddenFlag(cl::ReallyHidden);
|
| /external/deqp/executor/ |
| xeBatchResult.cpp | 93 return getTestCaseResult(pos->second);
100 return getTestCaseResult(pos->second);
|
| /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 33 for (Iter j = first; j != i.second; ++j)
35 for (Iter j = i.second; j != last; ++j)
|
| /external/libcxx/test/containers/associative/map/map.access/ |
| iterator.pass.cpp | 75 assert(i->second == 1);
76 i->second = 2.5;
77 assert(i->second == 2.5);
119 assert(i->second == 1);
162 assert(i->second == 1);
163 i->second = 2.5;
164 assert(i->second == 2.5);
206 assert(i->second == 1);
|
| /external/libcxx/test/containers/associative/multimap/ |
| iterator.pass.cpp | 76 assert(i->second == d);
77 i->second = 2.5;
78 assert(i->second == 2.5);
121 assert(i->second == d);
165 assert(i->second == d);
166 i->second = 2.5;
167 assert(i->second == 2.5);
210 assert(i->second == d);
|
| /external/libcxx/test/containers/unord/unord.map/ |
| find_const.pass.cpp | 43 assert(i->second == "thirty");
66 assert(i->second == "thirty");
|
| find_non_const.pass.cpp | 43 assert(i->second == "thirty");
66 assert(i->second == "thirty");
|
| /external/libcxx/test/containers/unord/unord.multimap/ |
| find_const.pass.cpp | 43 assert(i->second == "thirty");
66 assert(i->second == "thirty");
|
| find_non_const.pass.cpp | 43 assert(i->second == "thirty");
66 assert(i->second == "thirty");
|
| iterators.fail.cpp | 47 i->second = "ONE";
48 assert(i->second == "ONE");
|
| /external/lldb/source/Symbol/ |
| TypeList.cpp | 70 for (pos = m_types.find(type_uid); pos != end && pos->second->GetID() == type_uid; ++pos)
72 if (pos->second.get() == type_sp.get())
88 // return pos->second;
103 // if (pos->second->GetName() == name)
104 // types.Insert (pos->second);
132 return pos->second;
143 if (!callback(pos->second))
153 if (!callback(pos->second))
178 pos->second->Dump(s, show_context);
256 Type* the_type = pos->second.get()
[all...] |
| /external/llvm/lib/CodeGen/ |
| JumpInstrTables.cpp | 179 it->second.Count++;
182 NewName += (Twine(it->second.TableNum) + "_" + Twine(it->second.Count)).str();
186 JumpFun->setSection((jump_section_prefix + Twine(it->second.TableNum)).str());
273 KV.second = insertEntry(M, F);
288 Aliases[&GA] = it->second;
295 replaceValueWithFunction(KV.first, KV.second);
298 replaceValueWithFunction(KV.first, KV.second);
|
| LiveStackAnalysis.cpp | 71 return I->second;
79 I->second.print(OS);
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineFunctionInfo.h | 66 (PacketInfo.find(MI)->second & Hexagon::StartPacket));
70 (PacketInfo.find(MI)->second & Hexagon::EndPacket));
|
| /external/llvm/test/MC/ARM/ |
| eh-directive-cantunwind.s | 7 @ in corresponding .ARM.exidx, and its second word should be EXIDX_CANTUNWIND.
42 @ The second word should be EXIDX_CANTUNWIND (01000000).
|
| /external/llvm/tools/llvm-diff/ |
| DiffLog.cpp | 48 return (Diff[I].first ? (Diff[I].second ? DC_match : DC_left)
52 Instruction *DiffLogBuilder::getRight(unsigned I) const { return Diff[I].second; }
|
| /external/opencv/cvaux/src/ |
| cvmorphing.cpp | 53 int *second, /* second sequence of runs */
172 begLineIndex = second[0];
177 /* --------------Create second line------------- */
186 endLineIndex = second[curr];
269 } /* for each runs in second line */
282 uchar * second_pix, /* raster epilines from the second image */
283 int *second_num, /* numbers of pixel in second line */
290 int *second, /* second sequence of runs *
[all...] |
| /external/oprofile/libabi/ |
| abi.cpp | 41 return slots.find(key)->second;
59 o << i->first << " " << i->second << endl;
|
| /external/oprofile/libutil++/ |
| unique_storage.h | 84 if (inserted.second)
87 return inserted.first->second;
|
| /external/protobuf/src/google/protobuf/compiler/ |
| code_generator.cc | 64 value.second = "";
67 value.second = parts[i].substr(equals_pos + 1);
|
| /external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
| PairTest.java | 19 assertThat(pair.second, equalTo(1));
26 assertThat(p.second, equalTo("Bar"));
|
| /external/valgrind/main/drd/tests/ |
| tc15_laog_lockdel.stderr.exp | 5 so a second locking sequence 2 -> 1 should now be OK.
|
| /external/valgrind/main/memcheck/tests/linux/ |
| timerfd-syscall.stderr.exp | 15 sleeping one second ...
18 sleeping 1 second ...
38 sleeping one second ...
41 sleeping 1 second ...
|
| /frameworks/base/core/tests/coretests/src/android/view/accessibility/ |
| RecycleAccessibilityEventTest.java | 77 AccessibilityEvent second = AccessibilityEvent.obtain(); local
78 assertEquals(first, second);
|
