| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| find_const.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| find_non_const.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| insert_init.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| insert_range.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| iterators.fail.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| max_load_factor.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| rehash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| reserve.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| size.fail.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| db_swap_1.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| /packages/apps/CellBroadcastReceiver/res/values-sk/ |
| strings.xml | 34 <string name="etws_earthquake_warning" msgid="6428741104423152511">"Výstraha pred zemetrasením"</string>
35 <string name="etws_tsunami_warning" msgid="6173964105145900312">"Výstraha pred cunami"</string>
36 <string name="etws_earthquake_and_tsunami_warning" msgid="662449983177407681">"Výstraha pred zemetrasením a cunami"</string>
56 <string name="enable_etws_test_alerts_summary" msgid="7988690174166347072">"Zobrazi? testovacie vysielanie Systému varovania pred zemetrasením a cunami (ETWS)"</string>
|
| /external/llvm/lib/Analysis/ |
| ValueTracking.cpp | 517 m_c_ICmp(ICmpInst::Predicate &Pred, const LHS &L, const RHS &R) {
518 return m_CombineOr(m_ICmp(Pred, L, R), m_ICmp(Pred, R, L));
771 CmpInst::Predicate Pred;
774 if (match(Arg, m_c_ICmp(Pred, m_V, m_Value(A))) &&
775 Pred == ICmpInst::ICMP_EQ && isValidAssumeForContext(I, Q)) {
782 m_c_ICmp(Pred, m_c_And(m_V, m_Value(B)), m_Value(A))) &&
783 Pred == ICmpInst::ICMP_EQ && isValidAssumeForContext(I, Q)) {
[all...] |
| /external/libcxx/include/ |
| unordered_map | 23 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
32 typedef Pred key_equal;
190 template <class Key, class T, class Hash, class Pred, class Alloc>
191 void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
192 unordered_map<Key, T, Hash, Pred, Alloc>& y)
195 template <class Key, class T, class Hash, class Pred, class Alloc>
197 operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
198 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
200 template <class Key, class T, class Hash, class Pred, class Alloc>
202 operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 287 Node pred = node.prev; local
288 while (pred.waitStatus > 0)
289 node.prev = pred = pred.prev;
294 Node predNext = pred.next;
302 if (node == tail && compareAndSetTail(node, pred)) {
303 pred.compareAndSetNext(predNext, null);
305 // If successor needs signal, try to set pred's next-link
308 if (pred != head &&
309 ((ws = pred.waitStatus) == Node.SIGNAL |
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| unordered_map | 23 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
32 typedef Pred key_equal;
172 template <class Key, class T, class Hash, class Pred, class Alloc>
173 void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
174 unordered_map<Key, T, Hash, Pred, Alloc>& y)
177 template <class Key, class T, class Hash, class Pred, class Alloc>
179 operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
180 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
182 template <class Key, class T, class Hash, class Pred, class Alloc>
184 operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| unordered_map | 23 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
32 typedef Pred key_equal;
172 template <class Key, class T, class Hash, class Pred, class Alloc>
173 void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
174 unordered_map<Key, T, Hash, Pred, Alloc>& y)
177 template <class Key, class T, class Hash, class Pred, class Alloc>
179 operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
180 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
182 template <class Key, class T, class Hash, class Pred, class Alloc>
184 operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| PlaceSafepoints.cpp | 213 /// to the loop header via an edge from Pred. Returns a conservative correct
216 BasicBlock *Pred,
219 // there's a call safepoint along every edge between Header and Pred.
222 // loop latch (Pred) block. Somewhat surprisingly, walking the entire chain
224 // checking the Pred and Header blocks themselves. This may be due to the
228 assert(DT.dominates(Header, Pred) && "loop latch not dominated by header?");
230 BasicBlock *Current = Pred;
257 BasicBlock *Pred) {
268 if (L->isLoopExiting(Pred)) {
271 const SCEV *MaxExec = SE->getExitCount(L, Pred);
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| ObjC.stg | 262 <synpreds:{pred | SEL <pred>Selector;}; separator="\n">
343 <synpreds:{pred | <lexerSynpred(name=pred)>};separator="\n">
583 <synpreds:{pred | SEL <pred>Selector;}; separator="\n">
696 <synpreds:{pred | <synpred(pred)>}>
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| LiteralOpUpgrader.java | 160 int pred = insn.getBlock().getPredecessors().nextSetBit(0); local
162 ssaMeth.getBlocks().get(pred).getInsns();
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LL1DFA.java | 115 // add a transition to pred target from d
167 System.out.println("syn pred for alt "+walkAlt+" "+
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| Dbg.stg | 241 evalPredicate(pred,description) ::= <<
242 evalPredicate(ctx, <pred>, (const char *)"<description>")
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| ST.stg | 117 <if(it.pred)>
118 if (<it.pred>) {
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| ST.stg | 94 <if(it.pred)>
95 if (<it.pred>)
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| ST.stg | 108 <if(alt.pred)>
109 if (<alt.pred>) {
|
