/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());
|
/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'");
|
/external/elfutils/0.153/libelf/ |
H A D | elf_newscn.c | 69 bool first = false; local 97 first = true; 128 /* Remember the index for the first section in this block. */ 162 if (unlikely (first)) 164 /* For the first section we mark the data as already available. */ 166 first = false;
|
/external/chromium_org/third_party/WebKit/Source/core/animation/animatable/ |
H A D | AnimatableColorTest.cpp | 75 RefPtrWillBeRawPtr<AnimatableColor> first = AnimatableColor::create(AnimatableColorImpl(Color(0xFF53647C)), AnimatableColorImpl(Color(0xFF000000))); local 77 EXPECT_NEAR(13.0 / 255, AnimatableValue::distance(first.get(), second.get()), 0.00000001);
|
H A D | AnimatableDoubleTest.cpp | 74 RefPtrWillBeRawPtr<AnimatableDouble> first = AnimatableDouble::create(-1.5); local 78 EXPECT_DOUBLE_EQ(3.75, AnimatableValue::distance(first.get(), second.get())); 80 EXPECT_DOUBLE_EQ(4.5, AnimatableValue::distance(third.get(), first.get()));
|
/external/clang/test/Index/ |
H A D | recursive-member-access.c | 2 struct rdar8650865 *first; member in struct:rdar8650865 7 return ((((((s->first)->first) 8 ->first) 9 ->first) 10 ->first) 11 ->first) 12 ->first 13 ->first 14 ->first [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
H A D | equal_range.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value) argument 28 std::pair<Iter, Iter> i = std::equal_range(first, last, value); 29 for (Iter j = first; j != i.first; ++j) 31 for (Iter j = i.first; j != last; ++j) 33 for (Iter j = first; j != i.second; ++j)
|
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
H A D | lower_bound.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) argument 27 Iter i = std::lower_bound(first, last, value); 28 for (Iter j = first; j != i; ++j)
|
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
H A D | upper_bound.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) argument 27 Iter i = std::upper_bound(first, last, value); 28 for (Iter j = first; j != i; ++j)
|
/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/chromium_org/chrome/browser/spellchecker/ |
H A D | word_trimmer.cc | 24 size_t first = std::string::npos; local 31 if (first == std::string::npos) 32 first = word_offset[0]; 35 if (first == std::string::npos) { 46 if (first == std::string::npos) 48 *start -= first; 49 return text.substr(first, last - first);
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
H A D | draw_pt_util.c | 38 void draw_pt_split_prim(unsigned prim, unsigned *first, unsigned *incr) argument 42 *first = 1; 46 *first = 2; 51 *first = 2; 55 *first = 4; 59 *first = 4; 63 *first = 3; 67 *first = 6; 73 *first = 3; 77 *first 96 draw_pt_trim_count(unsigned count, unsigned first, unsigned incr) argument [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-1146.js | 33 a.first = function() { return 11; } 42 var b = "first";
|
/external/clang/test/CodeGen/ |
H A D | tbaa-thread-sanitizer.cpp | 8 iterator first; member in struct:pair 9 pair(const iterator &a) : first(a) {}
|
/external/clang/test/Parser/ |
H A D | bad-control.c | 11 int pr8880_9 (int first) { argument 12 switch(({ if (first) { first = 0; break; } 1; })) { // expected-error {{'break' statement not in loop or switch statement}}
|
/external/compiler-rt/test/tsan/ |
H A D | user_malloc.cc | 9 static int first = 0; local 10 if (__sync_lock_test_and_set(&first, 1) == 0)
|
/external/elfutils/0.153/libebl/ |
H A D | eblmachineflagname.c | 74 int first = 1; local 80 if (! first) 104 first = 0;
|
/external/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
H A D | max_element.pass.cpp | 15 // max_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 Iter i = std::max_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j)
|
H A D | max_element_comp.pass.cpp | 15 // max_element(Iter first, Iter last, Compare comp); 25 test(Iter first, Iter last) argument 27 Iter i = std::max_element(first, last, std::greater<int>()); 28 if (first != last) 30 for (Iter j = first; j != last; ++j)
|
H A D | min_element.pass.cpp | 15 // min_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 Iter i = std::min_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j)
|
H A D | min_element_comp.pass.cpp | 15 // min_element(Iter first, Iter last, Compare comp); 25 test(Iter first, Iter last) argument 27 Iter i = std::min_element(first, last, std::greater<int>()); 28 if (first != last) 30 for (Iter j = first; j != last; ++j)
|
H A D | minmax_element.pass.cpp | 15 // minmax_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 std::pair<Iter, Iter> p = std::minmax_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j) 31 assert(!(*j < *p.first)); 37 assert(p.first == last); 71 assert(base(p.first) == a);
|
/external/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | construct_iter_iter.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last); 23 test(Iterator first, Iterator last) argument 25 C c(first, last); 27 assert(c.size() == std::distance(first, last)); 28 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 29 assert(*i == *first);
|
/external/libcxx/test/containers/sequences/vector.bool/ |
H A D | construct_iter_iter.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last); 23 test(Iterator first, Iterator last) argument 25 C c(first, last); 27 assert(c.size() == std::distance(first, last)); 28 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 29 assert(*i == *first);
|
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);
|