/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
p2.cpp | 12 template<typename Head, typename ...Tail> 13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function template not viable: requires at least 1 argument, but 0 were provided}} 14 recurse_until_fail(tail...); // expected-error{{no matching function for call to 'recurse_until_fail'}} \
|
partial-ordering.cpp | 12 template<typename Head, typename ...Tail> 13 struct X1<tuple<Head, Tail...> > { 17 template<typename Head, typename ...Tail> 18 struct X1<tuple<Head, Tail&...> > { 22 template<typename Head, typename ...Tail> 23 struct X1<tuple<Head&, Tail&...> > {
|
example-tuple.cpp | 59 template<typename Head, typename... Tail> 60 class tuple<Head, Tail...> : private tuple<Tail...> { 61 typedef tuple<Tail...> inherited; 69 typename add_const_reference<Tail>::type... vtail) 74 : m_head(other.head()), inherited(other.tail()) { } 79 tail() = other.tail(); 85 inherited& tail() { return *this; } function in class:tuple 86 const inherited& tail() const { return *this; function in class:tuple [all...] |
example-bind.cpp | 59 template<typename Head, typename... Tail> 60 class tuple<Head, Tail...> : private tuple<Tail...> { 61 typedef tuple<Tail...> inherited; 69 typename add_const_reference<Tail>::type... vtail) 74 : m_head(other.head()), inherited(other.tail()) { } 79 tail() = other.tail(); 85 inherited& tail() { return *this; } function in class:tuple 86 const inherited& tail() const { return *this; function in class:tuple [all...] |
metafunctions.cpp | 20 template<typename Head, typename ...Tail> 22 static const unsigned value = 1 + count<Tail...>::value; 38 template<typename Head, typename ...Tail> 39 struct count<Head, Tail...> { 40 static const unsigned value = 1 + count<Tail...>::value;
|
/external/marisa-trie/lib/marisa/ |
tail.h | 9 class Tail { 11 Tail(); 54 void swap(Tail *rhs); 66 Tail(const Tail &); 67 Tail &operator=(const Tail &);
|
tail.cc | 5 #include "tail.h" 9 Tail::Tail() : buf_() {} 11 void Tail::build(const Vector<String> &keys, 30 void Tail::mmap(Mapper *mapper, const char *filename, 41 void Tail::map(const void *ptr, std::size_t size) { 46 void Tail::map(Mapper &mapper) { 47 Tail temp; 52 void Tail::load(const char *filename, long offset, int whence) { 58 void Tail::fread(::FILE *file) [all...] |
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
tail.h | 9 class Tail { 11 Tail(); 55 void swap(Tail *rhs); 67 Tail(const Tail &); 68 Tail &operator=(const Tail &);
|
tail.cc | 5 #include "tail.h" 9 Tail::Tail() : buf_() {} 11 void Tail::build(const Vector<String> &keys, 30 void Tail::mmap(Mapper *mapper, const char *filename, 41 void Tail::map(const void *ptr, std::size_t size) { 46 void Tail::map(Mapper &mapper) { 47 Tail temp; 52 void Tail::load(const char *filename, long offset, int whence) { 58 void Tail::fread(::FILE *file) [all...] |
/external/clang/test/SemaTemplate/ |
example-typelist.cpp | 7 template<typename Head, typename Tail = nil> 10 typedef Tail tail; typedef in struct:cons 27 template<typename Head, typename Tail> 28 struct length<cons<Head, Tail> > { 29 static const unsigned value = length<Tail>::value + 1; 50 typedef typename reverse<typename T::tail>::type reversed_tail; 52 typedef typename reverse<typename reversed_tail::tail>::type most_of_tail; 83 struct find : find<typename List::tail, T> { }; 85 template<typename Tail, typename T [all...] |
/external/mdnsresponder/mDNSShared/ |
GenLinkedList.c | 41 pList->Tail = NULL; 47 /* Add a linked list element to the tail of the list. */ 49 if ( pList->Tail) { 50 ASSIGNLINK( pList->Tail, elem, pList->LinkOffset); 55 pList->Tail = elem; 63 if ( pList->Tail == NULL) 64 pList->Tail = elem; 83 if ( pList->Tail == elem) 84 pList->Tail = lastElem ? lastElem : NULL; 116 if ( pList->Tail == elemInList [all...] |
GenLinkedList.h | 28 *Tail; 48 *Tail; 70 Tail;
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/ |
p9-0x.cpp | 7 template<unsigned N, typename Head, typename ...Tail> 8 struct get_nth_type<N, Head, Tail...> : get_nth_type<N-1, Tail...> { }; 10 template<typename Head, typename ...Tail> 11 struct get_nth_type<0, Head, Tail...> {
|
p3-0x.cpp | 7 template<typename Head, typename ...Tail> 8 struct count<Head, Tail...> { 9 static const unsigned value = 1 + count<Tail...>::value;
|
/external/llvm/lib/CodeGen/ |
EarlyIfConversion.cpp | 74 // Tail Tail 77 // Head block, and phis in the Tail block are converted to select instructions. 90 MachineBasicBlock *Tail; 99 /// equal to Tail. 100 bool isTriangle() const { return TBB == Tail || FBB == Tail; } 102 /// Returns the Tail predecessor for the True side. 103 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } 105 /// Returns the Tail predecessor for the False side [all...] |
/frameworks/native/services/sensorservice/ |
traits.h | 32 typedef U Tail; 50 template <typename T, typename Tail> 51 struct IndexOf<TypeList<T, Tail>, T> { 55 template <typename Head, typename Tail, typename T> 56 struct IndexOf<TypeList<Head, Tail>, T> { 58 enum { temp = IndexOf<Tail, T>::value };
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
p1-0x.cpp | 6 template<unsigned N, typename Head, typename ...Tail> 7 struct get_nth_type<N, Head, Tail...> : get_nth_type<N-1, Tail...> { }; 9 template<typename Head, typename ...Tail> 10 struct get_nth_type<0, Head, Tail...> {
|
/external/llvm/include/llvm/ADT/ |
ImmutableList.h | 29 const ImmutableListImpl* Tail; 31 ImmutableListImpl(const T& head, const ImmutableListImpl* tail = 0) 32 : Head(head), Tail(tail) {} 41 const ImmutableListImpl* getTail() const { return Tail; } 50 Profile(ID, Head, Tail); 128 /// getTail - Returns the tail of the list, which is another (possibly empty) 166 ImmutableList<T> concat(const T& Head, ImmutableList<T> Tail) { 171 const ListTy* TailImpl = Tail.getInternalPointer();
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.type/ |
p9-0x.cpp | 34 typename Tail> // expected-note{{non-deducible template parameter 'Tail'}} 35 struct UselessPartialSpec<Types..., Tail>; // expected-warning{{class template partial specialization contains template parameters that can not be deduced; this partial specialization will never be used}}
|
/external/llvm/include/llvm/Support/ |
Registry.h | 76 static node *Head, *Tail; 92 if (Tail) 93 Tail->Next = this; 96 Tail = this; 216 typename Registry<T,U>::node *Registry<T,U>::Tail;
|
/external/llvm/lib/Target/ARM/ |
Thumb2InstrInfo.h | 37 void ReplaceTailWithBranchTo(MachineBasicBlock::iterator Tail,
|
Thumb2InstrInfo.cpp | 50 Thumb2InstrInfo::ReplaceTailWithBranchTo(MachineBasicBlock::iterator Tail, 52 MachineBasicBlock *MBB = Tail->getParent(); 55 TargetInstrInfo::ReplaceTailWithBranchTo(Tail, NewDest); 59 // If the first instruction of Tail is predicated, we may have to update 62 ARMCC::CondCodes CC = getInstrPredicate(Tail, PredReg); 63 MachineBasicBlock::iterator MBBI = Tail; 68 // Actually replace the tail. 69 TargetInstrInfo::ReplaceTailWithBranchTo(Tail, NewDest);
|
/external/llvm/include/llvm/Analysis/ |
BlockFrequencyImpl.h | 201 void doLoop(BlockT *Head, BlockT *Tail) { 203 << getBlockName(Tail) << ")\n"); 207 for (rpot_iterator I = rpot_at(Head), E = rpot_at(Tail); ; ++I) {
|
/external/llvm/utils/TableGen/ |
DAGISelMatcherOpt.cpp | 82 Matcher *Tail = MFR->takeNext(); 87 EmitNode->setNext(Tail); 162 Matcher *Tail = CheckOpcode->takeNext(); 167 CheckType->setNext(Tail);
|
/external/chromium/testing/gtest/include/gtest/internal/ |
gtest-type-util.h | 110 // Head for the first type in the list, and Tail for the rest of the 121 typedef Types0 Tail; 126 typedef Types1<T2> Tail; 132 typedef Types2<T2, T3> Tail; 138 typedef Types3<T2, T3, T4> Tail; 144 typedef Types4<T2, T3, T4, T5> Tail; 151 typedef Types5<T2, T3, T4, T5, T6> Tail; 158 typedef Types6<T2, T3, T4, T5, T6, T7> Tail; 165 typedef Types7<T2, T3, T4, T5, T6, T7, T8> Tail; 172 typedef Types8<T2, T3, T4, T5, T6, T7, T8, T9> Tail; [all...] |