/external/libcxx/test/utilities/memory/temporary.buffer/ |
H A D | temporary_buffer.pass.cpp | 26 assert(ip.first); 28 std::return_temporary_buffer(ip.first);
|
/external/lldb/test/functionalities/data-formatter/rdar-10449092/ |
H A D | main.cpp | 14 int first; member in struct:foo 21 mine.first = 0xAABBCCDD; // Set break point at this line.
|
/external/mesa3d/src/glsl/ |
H A D | ir_basic_block.h | 25 void (*callback)(ir_instruction *first,
|
/external/compiler-rt/test/tsan/ |
H A D | user_fopen.cc | 10 static int first = 0; local 11 if (__sync_lock_test_and_set(&first, 1) == 0) 17 static int first = 0; local 18 if (__sync_lock_test_and_set(&first, 1) == 0)
|
/external/lldb/test/functionalities/data-formatter/rdar-9973992/ |
H A D | main.cpp | 13 int first; member in struct:Summarize 24 summarize_t first; member in struct:TwoSummarizes 36 printf ("Summarize: first: %d second: %d and address: 0x%p\n", mine.first, mine.second, mine_ptr); // Set break point at this line. 37 printf ("Global summarize: first: %d second: %d.\n", global_mine.first, global_mine.second);
|
/external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
H A D | insert_rvalue.pass.cpp | 36 assert(r.first->first == 3.5); 37 assert(r.first->second == 3); 42 assert(r.first->first == 3.5); 43 assert(r.first->second == 3); 48 assert(r.first->first == 4.5); 49 assert(r.first->second == 4); 54 assert(r.first [all...] |
H A D | emplace.pass.cpp | 36 assert(r.first->first == 3); 37 assert(r.first->second == Emplaceable()); 42 assert(r.first->first == 4); 43 assert(r.first->second == Emplaceable(5, 6)); 49 assert(r.first->first == 5); 50 assert(r.first->second == Emplaceable(6, 7)); 62 assert(r.first [all...] |
/external/libcxx/test/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.obs/ |
H A D | arrow.pass.cpp | 23 assert(p->first == 3); 25 p->first = 5; 27 assert(p->first == 5);
|
/external/lldb/test/functionalities/data-formatter/rdar-9973865/ |
H A D | main.cpp | 13 int first; member in struct:Summarize 27 printf ("Summarize: first: %d second: %d and address: 0x%p\n", mine.first, mine.second, mine_ptr); // Set break point at this line. 28 printf ("Global summarize: first: %d second: %d.\n", global_mine.first, global_mine.second);
|
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | insert_init.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2); 46 C::iterator k = eq.first; 47 assert(k->first == 1); 50 assert(k->first == 1); 53 assert(std::distance(eq.first, eq.second) == 2); 54 k = eq.first; 55 assert(k->first == 2); 58 assert(k->first == 2); 61 assert(std::distance(eq.first, eq.second) == 1); 62 k = eq.first; [all...] |
H A D | insert_range.pass.cpp | 17 // void insert(InputIterator first, InputIterator last); 45 assert(std::distance(eq.first, eq.second) == 2); 46 C::iterator k = eq.first; 47 assert(k->first == 1); 50 assert(k->first == 1); 53 assert(std::distance(eq.first, eq.second) == 2); 54 k = eq.first; 55 assert(k->first == 2); 58 assert(k->first == 2); 61 assert(std::distance(eq.first, e [all...] |
H A D | erase_const_iter.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2); 46 C::const_iterator k = eq.first; 47 assert(k->first == 1); 50 assert(k->first == 1); 53 assert(std::distance(eq.first, eq.second) == 1); 54 k = eq.first; 55 assert(k->first == 2); 58 assert(std::distance(eq.first, eq.second) == 1); 59 k = eq.first; 60 assert(k->first [all...] |
H A D | erase_range.pass.cpp | 16 // iterator erase(const_iterator first, const_iterator last) 46 assert(std::distance(eq.first, eq.second) == 2); 47 k = eq.first; 48 assert(k->first == 1); 51 assert(k->first == 1); 54 assert(std::distance(eq.first, eq.second) == 2); 55 k = eq.first; 56 assert(k->first == 2); 59 assert(k->first == 2); 62 assert(std::distance(eq.first, e [all...] |
/external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
H A D | SDL_qsort.c | 110 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon29425 111 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 112 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 113 #define doLeft {first=ffirst;llast=last;continue;} 114 #define doRight {ffirst=first;last=llast;continue;} 116 first=ffirst=stack[stacktop].first;\ 133 * 3. We choose a pivot by looking at the first, last 187 { size_t l=last-ffirst,r=llast-first; \ 282 pivot_big(char *first, char *mid, char *last, size_t size, int compare(const void *, const void *)) argument 325 char *first,*last; local 356 char *first,*last; local 387 char *first,*last; local [all...] |
/external/libcxx/test/containers/associative/map/map.modifiers/ |
H A D | erase_key.pass.cpp | 43 assert(m.begin()->first == 1); 45 assert(next(m.begin())->first == 2); 47 assert(next(m.begin(), 2)->first == 3); 49 assert(next(m.begin(), 3)->first == 4); 51 assert(next(m.begin(), 4)->first == 5); 53 assert(next(m.begin(), 5)->first == 6); 55 assert(next(m.begin(), 6)->first == 7); 57 assert(next(m.begin(), 7)->first == 8); 63 assert(m.begin()->first == 1); 65 assert(next(m.begin())->first [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-969.js | 40 function first(x, y) { return x; } function 48 function test0() { return first((y = 1, typeof x0), 2); } 57 function test1() { return first((y += 1, typeof x1), 2); } 64 function test2() { return first((++y, typeof x2), 2); } 70 function test3() { return first((y++, typeof x3), 2); } 79 function test4() { return first((o.x = 1, typeof x4), 2); } 85 function test5() { return first((o.x += 1, typeof x5), 2); } 91 function test6() { return first((++o.x, typeof x6), 2); } 97 function test7() { return first((o.x++, typeof x7), 2); } 106 function test8(index) { return first(( [all...] |
H A D | regress-931.js | 35 function first() { sequence += "1"; return o; } function 40 var result = (first()[second()](third(), fourth())) 46 var result = (first()[second_prime()](third(), fourth()))
|
/external/chromium-trace/trace-viewer/src/base/ |
H A D | sorted_array_utils.js | 14 * Finds the first index in the array whose value is >= loVal. 55 * the index of the first interval whose start is > loVal. 71 * @return {Number} An index in the array that intersects or is first-above 76 var first = findLowIndexInSortedArray(ary, mapLoFn, loVal); 77 if (first == 0) { 84 } else if (first < ary.length) { 85 if (loVal >= mapLoFn(ary[first]) && 86 loVal < mapLoFn(ary[first]) + mapWidthFn(ary[first], first)) { [all...] |
/external/libcxx/test/re/re.results/re.results.acc/ |
H A D | position.pass.cpp | 25 assert(m.position() == std::distance(s, m[0].first)); 26 assert(m.position(0) == std::distance(s, m[0].first)); 27 assert(m.position(1) == std::distance(s, m[1].first)); 28 assert(m.position(2) == std::distance(s, m[2].first)); 29 assert(m.position(3) == std::distance(s, m[3].first)); 30 assert(m.position(4) == std::distance(s, m[4].first));
|
/external/lldb/test/functionalities/data-formatter/data-formatter-named-summaries/ |
H A D | main.cpp | 48 First first(12,34); 52 first.dummy = 1; // Set break point at this line. 53 first.dummy = 2; 54 first.dummy = 3; 55 first.dummy = 4; 56 first.dummy = 5;
|
/external/chromium_org/chrome/renderer/safe_browsing/ |
H A D | test_utils.cc | 15 void ExpectFeatureMapsAreEqual(const FeatureMap& first, argument 17 std::map<std::string, double> sorted_first(first.features().begin(), 18 first.features().end());
|
H A D | test_utils.h | 14 void ExpectFeatureMapsAreEqual(const FeatureMap& first,
|
/external/chromium_org/third_party/WebKit/Source/core/css/ |
H A D | Pair.h | 39 static PassRefPtrWillBeRawPtr<Pair> create(PassRefPtrWillBeRawPtr<CSSPrimitiveValue> first, PassRefPtrWillBeRawPtr<CSSPrimitiveValue> second, argument 42 return adoptRefWillBeNoop(new Pair(first, second, identicalValuesPolicy)); 45 CSSPrimitiveValue* first() const { return m_first.get(); } function in class:blink::FINAL 49 void setFirst(PassRefPtrWillBeRawPtr<CSSPrimitiveValue> first) { m_first = first; } argument 55 return generateCSSString(first()->cssText(), second()->cssText(), m_identicalValuesPolicy); 73 Pair(PassRefPtrWillBeRawPtr<CSSPrimitiveValue> first, PassRefPtrWillBeRawPtr<CSSPrimitiveValue> second, IdenticalValuesPolicy identicalValuesPolicy) argument 74 : m_first(first) 78 static String generateCSSString(const String& first, const String& second, IdenticalValuesPolicy identicalValuesPolicy) argument 80 if (identicalValuesPolicy == DropIdenticalValues && first [all...] |
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | ColorDistance.cpp | 27 Color ColorDistance::addColors(const Color& first, const Color& second) argument 29 return Color(first.red() + second.red(), first.green() + second.green(), first.blue() + second.blue());
|
/external/chromium_org/v8/test/webkit/ |
H A D | eval-cache-crash.js | 30 var a = "first"; 31 var first = eval(str)(); variable 32 shouldBe("first", "'first'");
|