/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/list_update_map_/ |
erase_fn_imps.hpp | 79 template<typename Pred> 82 erase_if(Pred pred) 86 while (m_p_l != 0 && pred(m_p_l->m_value)) 100 if (pred(p_l->m_p_next->m_value))
|
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/thin_heap_/ |
split_join_fn_imps.hpp | 42 template<typename Pred> 45 split(Pred pred, PB_DS_CLASS_C_DEC& other) 59 node_pointer p_out = base_type::prune(pred);
|
/external/llvm/lib/Target/WebAssembly/ |
WebAssemblyCFGStackify.cpp | 86 for (MachineBasicBlock *Pred : MBB->predecessors()) { 87 if (InSet.count(Pred)) 231 for (auto Pred : MBB.predecessors()) 233 (Pred->getNumber() < MBB.getNumber() || Loop->contains(Pred)) && 238 for (auto Pred : MBB.predecessors()) 239 assert(Pred->getNumber() < MBB.getNumber() && 254 /// Test whether Pred has any terminators explicitly branching to MBB, as 259 static bool ExplicitlyBranchesTo(MachineBasicBlock *Pred, MachineBasicBlock *MBB) { 260 for (MachineInstr &MI : Pred->terminators() [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/ |
erase_fn_imps.hpp | 98 template<typename Pred> 101 erase_if(Pred pred) 105 typedef typename entry_pred<value_type, Pred, _Alloc, simple_value>::type 108 const size_type left = partition(pred_t(pred)); 182 template<typename Pred> 185 partition(Pred pred) 194 if (!pred(m_a_entries[left])) 196 else if (pred(m_a_entries[right]) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/ |
erase_fn_imps.hpp | 98 template<typename Pred> 101 erase_if(Pred pred) 105 typedef typename entry_pred<value_type, Pred, _Alloc, simple_value>::type 108 const size_type left = partition(pred_t(pred)); 182 template<typename Pred> 185 partition(Pred pred) 194 if (!pred(m_a_entries[left])) 196 else if (pred(m_a_entries[right]) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binary_heap_/ |
erase_fn_imps.hpp | 98 template<typename Pred> 101 erase_if(Pred pred) 105 typedef typename entry_pred<value_type, Pred, _Alloc, simple_value>::type 108 const size_type left = partition(pred_t(pred)); 182 template<typename Pred> 185 partition(Pred pred) 194 if (!pred(m_a_entries[left])) 196 else if (pred(m_a_entries[right]) [all...] |
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binary_heap_/ |
erase_fn_imps.hpp | 98 template<typename Pred> 101 erase_if(Pred pred) 105 typedef typename entry_pred<value_type, Pred, _Alloc, simple_value>::type 108 const size_type left = partition(pred_t(pred)); 182 template<typename Pred> 185 partition(Pred pred) 194 if (!pred(m_a_entries[left])) 196 else if (pred(m_a_entries[right]) [all...] |
/external/google-breakpad/src/testing/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/llvm/lib/Transforms/Utils/ |
FlattenCFG.cpp | 138 BasicBlock *Pred = *PI; 139 BranchInst *PBI = dyn_cast<BranchInst>(Pred->getTerminator()); 145 BasicBlock *PP = Pred->getSinglePredecessor(); 148 // Case 1: Pred (BB3) is an unconditional block, it should 154 Pred->hasAddressTaken()) 157 UnCondBlock = Pred; 173 if (Pred->hasAddressTaken()) 178 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator(); 189 FirstCondBlock = Pred; 208 LastCondBlock = Pred; [all...] |
/external/llvm/utils/unittest/googletest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/mesa3d/src/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/protobuf/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 108 #define GTEST_PRED1_(pred, v1, on_failure)\ 109 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 111 pred, \ [all...] |
/external/vulkan-validation-layers/tests/gtest-1.7.0/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/ndk/sources/third_party/googletest/googletest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/llvm/lib/CodeGen/ |
MachineBlockPlacement.cpp | 440 for (MachineBasicBlock *Pred : Succ->predecessors()) { 442 if (Pred == Succ || (BlockFilter && !BlockFilter->count(Pred)) || 443 BlockToChain[Pred] == &Chain) 446 if (Pred->pred_size() > 1 || *Pred->pred_begin() != BB) 449 if (Pred->size() < OutlineOptionalThreshold) 474 for (MachineBasicBlock *Pred : Succ->predecessors()) { 475 if (Pred == Succ || (BlockFilter && !BlockFilter->count(Pred)) || [all...] |
/external/llvm/lib/Analysis/ |
InstructionSimplify.cpp | 89 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"? 90 static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, 97 if (CPred == Pred && CLHS == LHS && CRHS == RHS) 99 return CPred == CmpInst::getSwappedPredicate(Pred) && CLHS == RHS && 369 static Value *ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, 379 Pred = CmpInst::getSwappedPredicate(Pred); 389 Value *TCmp = SimplifyCmpInst(Pred, TV, RHS, Q, MaxRecurse); 397 if (!isSameCompare(Cond, Pred, TV, RHS)) 403 Value *FCmp = SimplifyCmpInst(Pred, FV, RHS, Q, MaxRecurse) [all...] |
/art/runtime/base/ |
allocator.h | 170 class Pred = std::equal_to<Key>> 172 Key, T, Hash, Pred, TrackingAllocator<std::pair<const Key, T>, kTag>>; 179 class Pred = std::equal_to<Key>> 181 Key, T, EmptyFn, Hash, Pred, TrackingAllocator<std::pair<Key, T>, kTag>>;
|
/external/llvm/lib/Target/ARM/ |
ThumbRegisterInfo.h | 43 ARMCC::CondCodes Pred = ARMCC::AL, unsigned PredReg = 0,
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
binomial_heap_base_.hpp | 126 template<typename Pred> 128 erase_if(Pred); 130 template<typename Pred> 132 split(Pred, PB_DS_CLASS_C_DEC&);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
binomial_heap_base_.hpp | 126 template<typename Pred> 128 erase_if(Pred); 130 template<typename Pred> 132 split(Pred, PB_DS_CLASS_C_DEC&);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binomial_heap_base_/ |
binomial_heap_base_.hpp | 126 template<typename Pred> 128 erase_if(Pred); 130 template<typename Pred> 132 split(Pred, PB_DS_CLASS_C_DEC&);
|
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binomial_heap_base_/ |
binomial_heap_base_.hpp | 126 template<typename Pred> 128 erase_if(Pred); 130 template<typename Pred> 132 split(Pred, PB_DS_CLASS_C_DEC&);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
max_element_comp.pass.cpp | 61 template <class Iter, class Pred> 62 void test_eq0(Iter first, Iter last, Pred p)
|
min_element_comp.pass.cpp | 61 template <class Iter, class Pred> 62 void test_eq0(Iter first, Iter last, Pred p)
|