/external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
H A D | U_V.pass.cpp | 26 assert(*p.first == 3);
|
H A D | assign_const_pair_U_V.pass.cpp | 27 assert(p2.first == 3);
|
H A D | assign_rv_pair.pass.cpp | 28 assert(*p2.first == 3);
|
H A D | const_first_const_second.pass.cpp | 44 assert(p.first == 3.5f); 50 assert(p.first == A(1)); 58 static_assert(p.first == 3.5f, ""); 64 static_assert(p.first == AC(1), "");
|
/external/libunwind/src/mi/ |
H A D | dyn-cancel.c | 38 _U_dyn_info_list.first = di->next;
|
/external/linux-tools-perf/src/tools/perf/util/include/linux/ |
H A D | types.h | 22 struct hlist_node *first; member in struct:hlist_head
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfStringPool.cpp | 20 if (!Entry.first) { 22 Entry.first = Asm.createTempSymbol(Prefix); 28 return getEntry(Asm, Pool, Prefix, Str).first; 53 Asm.OutStreamer.EmitLabel(Entry->getValue().first);
|
/external/llvm/test/MC/AsmParser/ |
H A D | macros-argument-parsing-diagnostics.s | 3 .macro double first = -1, second = -1 5 .long \first
|
H A D | macros-argument-parsing.s | 11 .macro double first = -1, second = -1 13 .long \first 38 double first = 7 46 double second = 9, first = 10
|
/external/mesa3d/src/mesa/math/ |
H A D | m_trans_tmp.h | 37 const GLubyte *first = f; local 40 (void) first; 63 const GLubyte *first = f; local 66 (void) first; 88 const GLubyte *first = f; local 90 (void) first; 110 const GLubyte *first = f; local 112 (void) first; 130 const GLubyte *first = f; local 133 (void) first; 154 const GLubyte *first = f; local 178 const GLubyte *first = f; local 199 const GLubyte *first = f; local [all...] |
/external/v8/src/ |
H A D | string-iterator.js | 60 var first = %_StringCharCodeAt(s, position); 61 var resultString = %_StringCharFromCode(first); 64 if (first >= 0xD800 && first <= 0xDBFF && position < length) {
|
/external/v8/test/mjsunit/regress/ |
H A D | regress-1146.js | 33 a.first = function() { return 11; } 42 var b = "first";
|
/external/llvm/lib/IR/ |
H A D | SymbolTableListTraitsImpl.h | 88 ilist_iterator<ValueSubClass> first, 99 for (; first != last; ++first) { 100 ValueSubClass &V = *first; 111 for (; first != last; ++first) 112 first->setParent(NewIP); 87 transferNodesFromList(ilist_traits<ValueSubClass> &L2, ilist_iterator<ValueSubClass> first, ilist_iterator<ValueSubClass> last) argument
|
/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/clang/test/Index/ |
H A D | complete-method-decls.m | 46 - (int)first:(int)x second:(float)y third:(double)z; 47 - (id)first:(int)xx second2:(float)y2 third:(double)z; 48 - (void*)first:(int)xxx second3:(float)y3 third:(double)z; 52 - (int)first:(int)x second2:(float)y third:(double)z; 56 - (int)first:(int)x second2:(float)y third:(double)z { } 128 // CHECK-CC8: ObjCInstanceMethodDecl:{ResultType id}{Informative first:}{TypedText second2:}{Text (float)y2}{HorizontalSpace }{TypedText third:}{Text (double)z} (35) 129 // CHECK-CC8: ObjCInstanceMethodDecl:{ResultType void *}{Informative first:}{TypedText second3:}{Text (float)y3}{HorizontalSpace }{TypedText third:}{Text (double)z} (35) 130 // CHECK-CC8: ObjCInstanceMethodDecl:{ResultType int}{Informative first:}{TypedText second:}{Text (float)y}{HorizontalSpace }{TypedText third:}{Text (double)z} (8) 138 // CHECK-CCB: ObjCInstanceMethodDecl:{LeftParen (}{Text int}{RightParen )}{TypedText first}{TypedText :}{LeftParen (}{Text int}{RightParen )}{Text x}{HorizontalSpace }{TypedText second2:}{LeftParen (}{Text float}{RightParen )}{Text y}{HorizontalSpace }{TypedText third:}{LeftParen (}{Text double}{RightParen )}{Text z} (40) 140 // CHECK-CCC: ObjCInstanceMethodDecl:{TypedText first}{TypedTex [all...] |
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | emplace_hint.pass.cpp | 40 assert(r->first == 3); 45 assert(r->first == 3); 52 assert(r->first == 3); 56 assert(r->first == 3); 59 assert(r->first == 3); 72 assert(r->first == 3); 77 assert(r->first == 3); 84 assert(r->first == 3); 88 assert(r->first == 3); 91 assert(r->first [all...] |
/external/v8/src/compiler/ |
H A D | generic-algorithm.h | 27 CONTINUE = 0x0, // Continue depth-first normally 67 if (top.first == top.second) { 79 post_order_node = Traits::from(stack.top().first); 82 visitor->PreEdge(Traits::from(top.first), top.first.edge().index(), 83 Traits::to(top.first)); 84 current = Traits::to(top.first); 88 visitor->PostEdge(Traits::from(top.first), top.first.edge().index(), 89 Traits::to(top.first)); [all...] |
/external/libcxx/test/std/re/re.alg/re.alg.search/ |
H A D | awk.pass.cpp | 16 // regex_search(BidirectionalIterator first, BidirectionalIterator last, 38 assert(m.prefix().first == s); 39 assert(m.prefix().second == m[0].first); 41 assert(m.suffix().first == m[0].second); 53 assert(m.prefix().first == s); 54 assert(m.prefix().second == m[0].first); 56 assert(m.suffix().first == m[0].second); 75 assert(m.prefix().first == s); 76 assert(m.prefix().second == m[0].first); 78 assert(m.suffix().first [all...] |
H A D | extended.pass.cpp | 16 // regex_search(BidirectionalIterator first, BidirectionalIterator last, 38 assert(m.prefix().first == s); 39 assert(m.prefix().second == m[0].first); 41 assert(m.suffix().first == m[0].second); 53 assert(m.prefix().first == s); 54 assert(m.prefix().second == m[0].first); 56 assert(m.suffix().first == m[0].second); 75 assert(m.prefix().first == s); 76 assert(m.prefix().second == m[0].first); 78 assert(m.suffix().first [all...] |
H A D | basic.pass.cpp | 16 // regex_search(BidirectionalIterator first, BidirectionalIterator last, 44 assert(m.prefix().first == s); 45 assert(m.prefix().second == m[0].first); 47 assert(m.suffix().first == m[0].second); 59 assert(m.prefix().first == s); 60 assert(m.prefix().second == m[0].first); 62 assert(m.suffix().first == m[0].second); 81 assert(m.prefix().first == s); 82 assert(m.prefix().second == m[0].first); 84 assert(m.suffix().first [all...] |
/external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
H A D | construct_iter_iter.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last); 24 test(Iterator first, Iterator last) argument 26 C c(first, last); 28 assert(c.size() == std::distance(first, last)); 30 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 31 assert(*i == *first);
|
H A D | construct_iter_iter_alloc.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last, 25 test(Iterator first, Iterator last, const A& a) argument 27 C c(first, last, a); 29 assert(c.size() == std::distance(first, last)); 31 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 32 assert(*i == *first);
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
H A D | construct_iter_iter_alloc.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last, 24 test(Iterator first, Iterator last, const typename C::allocator_type& a) argument 26 C c(first, last, a); 28 assert(c.size() == std::distance(first, last)); 29 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 30 assert(*i == *first);
|
/external/lldb/test/functionalities/data-formatter/rdar-10449092/ |
H A D | Test-rdar-10449092.py | 61 'first = 0x001122AA', 'second = 0x1122BB44']) 67 'first = 0x001122aa', 'second = 0x1122bb44']) 71 self.runCmd("type summary add -s \"${var.first%X} and ${var.second%x}\" foo") 76 self.runCmd("type summary add -s \"${var.first%X} and ${var.second%X}\" foo") 81 self.runCmd("type summary add -s \"${var.first%x} and ${var.second%X}\" foo") 85 self.runCmd("type summary add -s \"${var.first%x} and ${var.second%x}\" foo") 88 self.runCmd("type summary add -s \"${var.first%X} and ${var.second%X}\" foo")
|
/external/iptables/libiptc/ |
H A D | linux_list.h | 286 struct list_head *first = list->next; local 290 first->prev = head; 291 head->next = first; 300 * @head: the place to add it in the first list. 311 * @head: the place to add it in the first list. 510 struct hlist_node *first; member in struct:hlist_head 517 #define HLIST_HEAD_INIT { .first = NULL } 518 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL } 519 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL) 529 return !h->first; 585 struct hlist_node *first = h->first; local 616 struct hlist_node *first = h->first; local [all...] |