/external/clang/test/CXX/drs/ |
H A D | dr15xx.cpp | 55 template < class _T1, class _T2 > struct pair { _T2 second; }; struct in namespace:std 78 void f2(std::pair<const char*, const char*>, int = 0); // Would makes selection of #3 ambiguous 79 void f2(std::pair<const char*, const char*>); // #3 96 void f2(std::pair<const char*, const char*>); // #3 TODO: expected- note {{candidate function}}
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | fixed-expansion.cpp | 3 template<typename T, typename U> struct pair { }; struct 19 typename V = pair<T, U>, 30 X0<int, int, pair<int, int>, pair<int, int>*>>::value, 45 typename V = pair<T, U>, 56 X0<char, int, pair<char, int>, pair<char, int>*>>::value,
|
H A D | metafunctions.cpp | 17 template<typename T, typename U> struct pair { }; struct 271 int check0[is_same<replace_with_int<pair<tuple<float, double, short>, 272 pair<char, unsigned char>>>::type, 273 pair<tuple<int, int, int>, pair<int, int>>>::value? 1 : -1];
|
H A D | multi-level-substitution.cpp | 5 template<typename T, typename U> struct pair { }; struct 38 struct Inner<tuple<pair<Types, YTypes>...> > { 43 int check0[X<short, int, long>::Inner<tuple<pair<short, unsigned short>, 44 pair<int, unsigned int>, 45 pair<long, unsigned long>> 48 int check1[X<short, int>::Inner<tuple<pair<short, unsigned short>, 49 pair<int, unsigned int>, 50 pair<long, unsigned long>> 61 struct Inner<tuple<pair<Types, YTypes>...>, 67 int check2[X1<short, int, long>::Inner<tuple<pair<shor [all...] |
/external/clang/test/SemaCXX/ |
H A D | cxx0x-defaulted-functions.cpp | 65 template<typename T> struct pair { struct in namespace:DefaultedFnExceptionSpec 66 pair(const pair&) noexcept(noexcept(T(declval<T>()))); 71 struct Y { pair<X> p; }; 75 pair<T> p;
|
H A D | invalid-member-expr.cpp | 25 template <class A, class B> struct pair {}; struct in namespace:test3 28 pair<int, int> z = minmax({}); // expected-error {{expected expression}}
|
/external/clang/test/SemaTemplate/ |
H A D | nested-name-spec-template.cpp | 58 template <class T> struct pair { struct in namespace:test1 62 static T pair<T>::* const mem_array[2]; 66 T pair<T>::* const pair<T>::mem_array[2] = { &pair<T>::x, &pair<T>::y };
|
H A D | typename-specifier.cpp | 27 // expected-note{{add a pair of parentheses}} expected-warning 2{{'typename' occurs outside of a template}} 122 template <class T1, class T2> struct pair {}; // expected-note 7 {{template parameter is declared here}} struct in namespace:missing_typename 145 pair<ExampleItemSet::iterator, int> i; 146 pair<this->ExampleItemSet::iterator, int> i; // expected-error-re {{template argument for template type parameter must be a type{{$}}}} 147 pair<ExampleItemSet::operator[], int> i; // expected-error-re {{template argument for template type parameter must be a type{{$}}}} 154 pair<ExampleItemSet::iterator, int> elt; 165 pair<ExampleItemMap::iterator, int> i; 172 pair<ExampleItemMap::iterator, int> entry; 173 pair<bar, int> foobar; // expected-error {{template argument for template type parameter must be a type}}
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
H A D | ant-trax.jar | ... private void createTransformer () throws java.lang.Exception String[] pair
int i
private void setTransformationParameters () String name
String value
java ... |
/external/jmonkeyengine/engine/src/bullet-native/ |
H A D | com_jme3_bullet_objects_PhysicsGhostObject.cpp | 182 virtual bool processOverlap(btBroadphasePair& pair) argument 184 btCollisionObject *co1 = (btCollisionObject *)pair.m_pProxy1->m_clientObject;
|
/external/jmonkeyengine/engine/src/core-plugins/com/jme3/export/binary/ |
H A D | BinaryExporter.java | 241 BinaryIdContentPair pair = contentTable.get(savable); 243 .get(savableName + getChunk(pair)); 244 int prevLoc = findPrevMatch(pair, bucket); 246 locationTable.put(pair.getId(), prevLoc); 250 locationTable.put(pair.getId(), location); 253 alreadySaved.put(savableName + getChunk(pair), bucket); 255 bucket.add(pair); 302 protected String getChunk(BinaryIdContentPair pair) { argument 303 return new String(pair.getContent().bytes, 0, Math.min(64, pair [all...] |
/external/lzma/CPP/7zip/UI/Common/ |
H A D | UpdatePair.cpp | 95 CUpdatePair pair;
local 103 pair.State = NUpdateArchive::NPairState::kOnlyOnDisk;
104 pair.DirIndex = dirIndex2;
109 pair.State = ai.Censored ?
112 pair.ArcIndex = arcIndex2;
119 pair.DirIndex = dirIndex2;
120 pair.ArcIndex = arcIndex2;
125 case -1: pair.State = NUpdateArchive::NPairState::kNewInArchive; break;
126 case 1: pair.State = NUpdateArchive::NPairState::kOldInArchive; break;
128 pair 140 CUpdatePair pair; local 148 CUpdatePair pair; local [all...] |
/external/openfst/src/lib/ |
H A D | flags.cc | 102 ShowUsageRestrict(const std::set< pair<string, string> > &usage_set, argument 107 for (std::set< pair<string, string> >::const_iterator it = 133 std::set< pair<string, string> > usage_set;
|
/external/openssh/ |
H A D | ssh-pkcs11-client.c | 158 int pair[2]; local 160 if (socketpair(AF_UNIX, SOCK_STREAM, 0, pair) == -1) { 168 if ((dup2(pair[1], STDIN_FILENO) == -1) || 169 (dup2(pair[1], STDOUT_FILENO) == -1)) { 173 close(pair[0]); 174 close(pair[1]); 181 close(pair[1]); 182 fd = pair[0];
|
/external/skia/include/core/ |
H A D | SkTDict.h | 39 Pair* pair = fArray.insert(~index); local 43 pair->fName = copy; 44 pair->fValue = value; 75 for (const Pair* pair = fArray.begin(); pair < end; pair++) { 76 if (pair->fValue != value) { 79 *name = pair->fName;
|
/external/ceres-solver/internal/ceres/ |
H A D | incomplete_lq_factorization.cc | 102 bool operator()(const pair<int, double>& lhs, argument 103 const pair<int, double>& rhs) const { 117 vector<pair<int, double> >* scratch, 136 pair<int, double>& entry = (*scratch)[scratch_count]; 153 const pair<int, double>& entry = (*scratch)[i]; 195 vector<pair<int, double> > scratch(num_cols);
|
/external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
H A D | p3-0x.cpp | 19 struct pair { struct in namespace:std 20 pair(const A&, const B&); 52 Map(std::initializer_list<std::pair<std::string,int>>) {}
|
/external/clang/test/CodeGenCXX/ |
H A D | constructor-init.cpp | 230 struct pair : X { // Make the copy constructor non-trivial, so we actually generate it. struct in namespace:PR10720 232 pair(const pair&) = default; 235 void foo(const pair &x, const pair2 &x2) { 236 pair y(x);
|
H A D | pointers-to-data-members.cpp | 136 struct pair { struct in namespace:PR7139 141 typedef int pair::*ptr_to_member_type;
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepot.cc | 145 IdDescPair pair = {s->id, s}; local 146 map_.push_back(pair); 155 IdDescPair pair = {id, 0}; 156 uptr idx = InternalBinarySearch(map_, 0, map_.size(), pair,
|
/external/fio/ |
H A D | json.c | 21 struct json_pair *pair = malloc(sizeof(struct json_pair)); local 22 if (pair) { 23 pair->name = strdup(name); 24 pair->value = value; 27 value->parent_pair = pair; 29 return pair; 122 static void json_free_pair(struct json_pair *pair); 145 static void json_free_pair(struct json_pair *pair) argument 147 json_free_value(pair->value); 148 free(pair 184 json_object_add_pair(struct json_object *obj, struct json_pair *pair) argument 201 struct json_pair *pair; local 275 json_pair_level(struct json_pair *pair) argument 317 json_print_pair(struct json_pair *pair) argument [all...] |
/external/fonttools/Lib/fontTools/ |
H A D | afmLib.py | 260 def has_kernpair(self, pair): 261 return pair in self._kerning 366 pair = ('A', 'V') variable 367 if afm.has_kernpair(pair): 368 print(afm[pair]) # print kerning value for pair
|
/external/fonttools/Tools/fontTools/ |
H A D | afmLib.py | 260 def has_kernpair(self, pair): 261 return pair in self._kerning 366 pair = ('A', 'V') variable 367 if afm.has_kernpair(pair): 368 print(afm[pair]) # print kerning value for pair
|
/external/icu/icu4c/source/i18n/ |
H A D | collationfastlatin.h | 101 * Use INDEX_MASK to find the pair of CEs after the fixed table. 229 static inline uint32_t getPrimaries(uint32_t variableTop, uint32_t pair) { argument 230 uint32_t ce = pair & 0xffff; 231 if(ce >= MIN_SHORT) { return pair & TWO_SHORT_PRIMARIES_MASK; } 232 if(ce > variableTop) { return pair & TWO_LONG_PRIMARIES_MASK; } 234 return pair; // special mini CE 244 static uint32_t getSecondaries(uint32_t variableTop, uint32_t pair); 245 static uint32_t getCases(uint32_t variableTop, UBool strengthIsPrimary, uint32_t pair); 246 static uint32_t getTertiaries(uint32_t variableTop, UBool withCaseBits, uint32_t pair); 247 static uint32_t getQuaternaries(uint32_t variableTop, uint32_t pair); [all...] |
H A D | collationsettings.cpp | 158 uint32_t pair = ranges[i]; local 159 int32_t limit1 = (int32_t)(pair >> 24); 161 table[b] = (uint8_t)(b + pair); 165 if((pair & 0xff0000) != 0) {
|