/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
H A D | equal_range_comp.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value, Compare comp); 27 test(Iter first, Iter last, const T& value) argument 29 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>()); 32 for (Iter j = i.first; j != last; ++j) 36 for (Iter j = i.second; j != last; ++j)
|
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
H A D | lower_bound_comp.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value) argument 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); 31 for (Iter j = i; j != last; ++j)
|
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
H A D | upper_bound_comp.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value, Compare comp); 26 test(Iter first, Iter last, const T& value) argument 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); 31 for (Iter j = i; j != last; ++j)
|
/external/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
H A D | minmax_element_comp.pass.cpp | 15 // minmax_element(Iter first, Iter last, Compare comp); 25 test(Iter first, Iter last) argument 29 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp); 30 if (first != last) 32 for (Iter j = first; j != last; ++j) 40 assert(p.first == last); 41 assert(p.second == last);
|
/external/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | construct_iter_iter_alloc.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last, 24 test(Iterator first, Iterator last, const A& a) argument 26 C c(first, last, a); 28 assert(c.size() == std::distance(first, last));
|
/external/libcxx/test/numerics/numeric.ops/accumulate/ |
H A D | accumulate.pass.cpp | 16 // accumulate(Iter first, Iter last, T init); 25 test(Iter first, Iter last, T init, T x) argument 27 assert(std::accumulate(first, last, init) == x);
|
H A D | accumulate_op.pass.cpp | 17 // accumulate(Iter first, Iter last, T init, BinaryOperation binary_op); 27 test(Iter first, Iter last, T init, T x) argument 29 assert(std::accumulate(first, last, init, std::multiplies<T>()) == x);
|
/external/libcxx/test/strings/basic.string/string.modifiers/string_erase/ |
H A D | iter_iter.pass.cpp | 12 // iterator erase(const_iterator first, const_iterator last); 24 typename S::const_iterator last = s.cbegin() + pos + n; local 25 typename S::iterator i = s.erase(first, last);
|
/external/mesa3d/src/glsl/ |
H A D | ir_function_can_inline.cpp | 30 * other than as the last instruction. We could potentially work 68 /* If the function is empty (no last instruction) or does not end with a 71 ir_instruction *last = (ir_instruction *)callee->body.get_tail(); local 72 if (last == NULL || !last->as_return())
|
/external/chromium_org/chrome/browser/extensions/activity_log/ |
H A D | activity_log_browsertest.cc | 48 scoped_refptr<Action> last = i->front(); local 50 ASSERT_EQ(extension_id, last->extension_id()); 51 ASSERT_EQ(Action::ACTION_CONTENT_SCRIPT, last->action_type()); 53 ActivityLogPolicy::Util::Serialize(last->args())); 56 last->SerializePageUrl()); 59 last->page_title()); 61 ActivityLogPolicy::Util::Serialize(last->other())); 62 ASSERT_EQ("", last->api_name()); 63 ASSERT_EQ("", last->SerializeArgUrl());
|
/external/chromium_org/chrome/browser/extensions/ |
H A D | blob_reader.cc | 62 int64 first = 0, last = 0, length = 0; local 64 source->GetResponseHeaders()->GetContentRange(&first, &last, &length);
|
/external/chromium_org/ppapi/tests/ |
H A D | test_trace_event.cc | 56 int64_t last = interface_->Now(); local 60 ASSERT_LE(last, next); 61 last = next;
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
H A D | string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable 9 last = (last * A + C) % M; 10 return max * last / M; 37 var last = null; 39 if (last) table[c] += table[last]; 40 last = c;
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
H A D | string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable 9 last = (last * A + C) % M; 10 return max * last / M; 37 var last = null; 39 if (last) table[c] += table[last]; 40 last = c;
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
H A D | string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable 9 last = (last * A + C) % M; 10 return max * last / M; 37 var last = null; 39 if (last) table[c] += table[last]; 40 last = c;
|
/external/chromium_org/third_party/WebKit/Source/core/css/ |
H A D | CSSSelectorList.h | 75 // End of a multipart selector is indicated by m_isLastInTagHistory bit in the last item. 76 // End of the array is indicated by m_isLastInSelectorList bit in the last item. 83 const CSSSelector* last = ¤t; local 84 while (!last->isLastInTagHistory()) 85 last++; 86 return last->isLastInSelectorList() ? 0 : last + 1;
|
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
H A D | ContentDistribution.h | 46 PassRefPtrWillBeRawPtr<Node> last() const { return m_nodes.last(); } function in class:blink::FINAL
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/clover/core/ |
H A D | queue.cpp | 52 auto last = std::find_if(queued_events.begin(), queued_events.end(), local 57 std::for_each(first, last, [&](event_ptr &ev) { ev->fence(fence); }); 59 queued_events.erase(first, last);
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | ir_basic_block.cpp | 54 ir_instruction *last, 59 ir_instruction *last = NULL; local 101 last = ir; 104 callback(leader, last, data); 52 call_for_basic_blocks(exec_list *instructions, void (*callback)(ir_instruction *first, ir_instruction *last, void *data), void *data) argument
|
H A D | opt_redundant_jumps.cpp | 61 /* If the last instruction in both branches is a 'break' or a 'continue', 102 /* If the last instruction of a loop body is a 'continue', remove it. 104 ir_instruction *const last = local 107 if (last && (last->ir_type == ir_type_loop_jump) 108 && (((ir_loop_jump *) last)->mode == ir_loop_jump::jump_continue)) { 109 last->remove();
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | EdgeWalker_Test.h | 39 bool last; member in struct:State4
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractLinkedIteratorTest.java | 104 private static Iterator<Integer> newDoubler(int first, final int last) { argument 108 return (previous == last) ? null : previous * 2;
|
/external/harfbuzz_ng/test/api/ |
H A D | test-set.c | 164 hb_codepoint_t next, first, last; local 191 first = last = HB_SET_VALUE_INVALID; 192 g_assert (hb_set_next_range (s, &first, &last)); 194 g_assert_cmpint (last, ==, 6); 195 g_assert (hb_set_next_range (s, &first, &last)); 197 g_assert_cmpint (last, ==, 15); 198 g_assert (hb_set_next_range (s, &first, &last)); 200 g_assert_cmpint (last, ==, 20005); 201 g_assert (!hb_set_next_range (s, &first, &last)); 203 g_assert_cmpint (last, [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
H A D | binary_search.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value, bool x) argument 28 assert(std::binary_search(first, last, value) == x);
|
H A D | binary_search_comp.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value, Compare comp); 27 test(Iter first, Iter last, const T& value, bool x) argument 29 assert(std::binary_search(first, last, value, std::greater<int>()) == x);
|