/external/chromium_org/third_party/sqlite/src/src/ |
H A D | hash.h | 31 ** Hash.first points to the head of this list. 46 HashElem *first; /* The first element of the array */ member in struct:Hash 49 HashElem *chain; /* Pointer to first entry with this hash */ 85 #define sqliteHashFirst(H) ((H)->first)
|
/external/chromium_org/v8/src/ |
H A D | heap-snapshot-generator-inl.h | 25 return static_cast<int>(this - &snapshot_->entries().first()); 42 return &snapshot_->children().first() + children_index_;
|
/external/clang/include/clang/Serialization/ |
H A D | ContinuousRangeMap.h | 30 /// the first range is from I0 to I1, the second from I1 to I2, the third from 50 return L.first < R; 53 return L < R.first; 59 return L.first < R.first; 68 assert((Rep.empty() || Rep.back().first < Val.first) && 75 if (I != Rep.end() && I->first == Val.first) { 93 // I points to the first entr [all...] |
/external/compiler-rt/test/asan/TestCases/Linux/ |
H A D | unpoison_tls.cc | 16 void *first(void *arg) { function 30 assert(0 == pthread_create(&p, 0, first, 0));
|
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | UniformListItem.java | 33 * output list size (which is four bytes) and before the first item.</p> 98 OffsettedItem first = items.get(0); 99 return (items.size() * first.writeSize()) + getAlignment(items); 131 boolean first = true; 136 if (first) { 137 first = false; 162 boolean first = true; 168 if (first) { 171 first = false;
|
/external/libcxx/test/containers/associative/map/map.modifiers/ |
H A D | insert_iter_cv.pass.cpp | 30 assert(r->first == 2); 36 assert(r->first == 1); 42 assert(r->first == 3); 48 assert(r->first == 3); 59 assert(r->first == 2); 65 assert(r->first == 1); 71 assert(r->first == 3); 77 assert(r->first == 3);
|
H A D | insert_iter_rv.pass.cpp | 34 assert(r->first == 2); 40 assert(r->first == 1); 46 assert(r->first == 3); 52 assert(r->first == 3); 64 assert(r->first == 2); 70 assert(r->first == 1); 76 assert(r->first == 3); 82 assert(r->first == 3);
|
/external/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
H A D | insert_cv.pass.cpp | 30 assert(r->first == 2); 36 assert(r->first == 1); 42 assert(r->first == 3); 48 assert(r->first == 3); 59 assert(r->first == 2); 65 assert(r->first == 1); 71 assert(r->first == 3); 77 assert(r->first == 3);
|
H A D | insert_iter_cv.pass.cpp | 30 assert(r->first == 2); 36 assert(r->first == 1); 42 assert(r->first == 3); 48 assert(r->first == 3); 59 assert(r->first == 2); 65 assert(r->first == 1); 71 assert(r->first == 3); 77 assert(r->first == 3);
|
H A D | insert_iter_rv.pass.cpp | 34 assert(r->first == 2); 40 assert(r->first == 1); 46 assert(r->first == 3); 52 assert(r->first == 3); 64 assert(r->first == 2); 70 assert(r->first == 1); 76 assert(r->first == 3); 82 assert(r->first == 3);
|
H A D | insert_rv.pass.cpp | 33 assert(r->first == 2); 39 assert(r->first == 1); 45 assert(r->first == 3); 51 assert(r->first == 3); 62 assert(r->first == 2); 68 assert(r->first == 1); 74 assert(r->first == 3); 80 assert(r->first == 3);
|
/external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
H A D | insert_hint_const_lvalue.pass.cpp | 37 assert(r->first == 3.5); 42 assert(r->first == 3.5); 47 assert(r->first == 4.5); 52 assert(r->first == 5.5); 65 assert(r->first == 3.5); 70 assert(r->first == 3.5); 75 assert(r->first == 4.5); 80 assert(r->first == 5.5);
|
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
H A D | copy.pass.cpp | 56 assert(i->first == 1); 59 assert(i->first == 1); 62 assert(i->first == 2); 65 assert(i->first == 2); 68 assert(i->first == 3); 71 assert(i->first == 4); 110 assert(i->first == 1); 113 assert(i->first == 1); 116 assert(i->first == 2); 119 assert(i->first [all...] |
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | insert_hint_const_lvalue.pass.cpp | 37 assert(r->first == 3.5); 42 assert(r->first == 3.5); 47 assert(r->first == 4.5); 52 assert(r->first == 5.5); 65 assert(r->first == 3.5); 70 assert(r->first == 3.5); 75 assert(r->first == 4.5); 80 assert(r->first == 5.5);
|
/external/libcxx/test/iterators/iterator.primitives/iterator.operations/ |
H A D | distance.pass.cpp | 14 // distance(Iter first, Iter last); 18 // distance(Iter first, Iter last); 27 test(It first, It last, typename std::iterator_traits<It>::difference_type x) argument 29 assert(std::distance(first, last) == x);
|
/external/libcxx/test/re/re.submatch/re.submatch.members/ |
H A D | length.pass.cpp | 27 sm.first = s; 38 sm.first = s;
|
/external/llvm/include/llvm/ExecutionEngine/ |
H A D | GenericValue.h | 28 unsigned int first; member in struct:llvm::GenericValue::IntPair 45 GenericValue() : IntVal(1,0) {UIntPairVal.first = 0; UIntPairVal.second = 0;}
|
/external/llvm/lib/CodeGen/ |
H A D | MachineModuleInfoImpls.cpp | 29 const MCSymbol *LHSS = ((const PairTy *)LHS)->first; 30 const MCSymbol *RHSS = ((const PairTy *)RHS)->first;
|
/external/mesa3d/src/mesa/x86/ |
H A D | 3dnow.c | 60 _mesa_3dnow_project_vertices( GLfloat *first, 66 _mesa_3dnow_project_clipped_vertices( GLfloat *first,
|
/external/opencv/cvaux/src/ |
H A D | cvcorrespond.cpp | 50 icvDynamicCorrespond( int *first, /* first sequence of runs */ argument 81 if( (first == 0) || 115 prev = first[0]; 121 l_end = first[curr]; 158 l_beg = first[first_curr]; 160 l_color = first[first_curr]; 162 l_end = first[first_curr]; 258 second_corr[second_curr] = first[first_curr]; 259 second_corr[second_curr + 1] = first[first_cur 324 icvDynamicCorrespondMulti( int lines, int *first, int *first_runs, int *second, int *second_runs, int *first_corr, int *second_corr ) argument 387 cvDynamicCorrespondMulti( int lines, int *first, int *first_runs, int *second, int *second_runs, int *first_corr, int *second_corr ) argument [all...] |
/external/skia/experimental/PdfViewer/ |
H A D | SkPdfUtils.cpp | 10 bool operator !=(const SkString& first, const char* second) { argument 11 return !first.equals(second);
|
/external/libcxx/test/re/re.alg/re.alg.match/ |
H A D | basic.pass.cpp | 14 // regex_match(BidirectionalIterator first, BidirectionalIterator last, 39 assert(m.prefix().first == s); 40 assert(m.prefix().second == m[0].first); 42 assert(m.suffix().first == m[0].second); 54 assert(m.prefix().first == s); 55 assert(m.prefix().second == m[0].first); 57 assert(m.suffix().first == m[0].second); 95 assert(m.prefix().first == s); 96 assert(m.prefix().second == m[0].first); 98 assert(m.suffix().first [all...] |
H A D | ecma.pass.cpp | 14 // regex_match(BidirectionalIterator first, BidirectionalIterator last, 33 assert(m.prefix().first == s); 34 assert(m.prefix().second == m[0].first); 36 assert(m.suffix().first == m[0].second); 48 assert(m.prefix().first == s); 49 assert(m.prefix().second == m[0].first); 51 assert(m.suffix().first == m[0].second); 89 assert(m.prefix().first == s); 90 assert(m.prefix().second == m[0].first); 92 assert(m.suffix().first [all...] |
/external/opencv/cv/src/ |
H A D | _cvkdtree.hpp | 84 int dimension_of_highest_variance(__instype * first, __instype * last, argument 86 assert(last - first > 0); 92 for (__instype * k = first; k < last; ++k) 94 mean /= last - first; 96 for (__instype * k = first; k < last; ++k) { 100 var /= last - first; 113 // given point indices and dimension, find index of median; (almost) modifies [first,last) 114 // such that points_in[first,median]<=point[median], points_in(median,last)>point[median]. 117 __instype * median_partition(__instype * first, __instype * last, argument 119 assert(last - first > 140 median_partition(__instype * first, __instype * last, __instype * k, int dim, __valuector ctor) argument 158 insert(__instype * first, __instype * last, __valuector ctor) argument 241 CvKDTree(__valuetype * first, __valuetype * last, int _point_dim, __deref _deref = __deref()) argument 248 CvKDTree(__instype * first, __instype * last, int _point_dim, __valuector ctor, __deref _deref = __deref()) argument 258 set_data(__valuetype * first, __valuetype * last, int _point_dim) argument 262 set_data(__instype * first, __instype * last, int _point_dim, __valuector ctor) argument [all...] |
/external/smack/src/org/xbill/DNS/ |
H A D | RRset.java | 74 Record first = first(); 75 if (!r.sameRRset(first)) 79 if (r.getTTL() != first.getTTL()) { 80 if (r.getTTL() > first.getTTL()) { 82 r.setTTL(first.getTTL()); 186 return first().getName(); 195 return first().getRRsetType(); 204 return first().getDClass(); 210 return first() 218 first() { method in class:RRset [all...] |