/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicParameterization_Test.cpp | 31 Cubic whole, first, second, mid; local 33 quad_to_cubic(split.first(), first); 36 if (!implicit_matches(whole, first)) { 42 if (!implicit_matches(mid, first)) { 48 if (!implicit_matches(first, second)) {
|
/external/chromium_org/third_party/skia/include/effects/ |
H A D | SkMergeImageFilter.h | 19 static SkMergeImageFilter* Create(SkImageFilter* first, SkImageFilter* second, argument 23 SkImageFilter* inputs[2] = { first, second };
|
/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...] |
/external/clang/test/CXX/special/class.copy/ |
H A D | p15-0x.cpp | 6 const int first; member in struct:PR10622::foo
|
/external/droiddriver/src/com/google/android/droiddriver/finders/ |
H A D | ChainFinder.java | 24 * first Finder as context for the second Finder. It is conceptually similar to 27 * second(first(context)). 29 * Note typically first Finder finds the ancestor, then second Finder finds the 34 private final Finder first; field in class:ChainFinder 37 protected ChainFinder(Finder first, Finder second) { argument 38 this.first = Preconditions.checkNotNull(first); 44 return String.format("Chain{%s, %s}", first, second); 49 return second.find(first.find(context));
|
/external/e2fsprogs/lib/e2p/ |
H A D | pf.c | 59 int first = 1; local 64 if (first) 65 first = 0; 76 if (long_opt && first)
|
/external/easymock/src/org/easymock/internal/matchers/ |
H A D | Not.java | 26 private final IArgumentMatcher first;
field in class:Not 28 public Not(IArgumentMatcher first) {
argument 29 this.first = first;
33 return !first.matches(actual);
38 first.appendTo(buffer);
|
/external/elfutils/0.153/libelf/ |
H A D | elf32_updatenull.c | 193 bool first = true; local 217 for (size_t cnt = first == true; cnt < list->cnt; ++cnt) 401 first = false; 409 e_shnum (or sh_size of the dummy, first section header)
|
/external/guava/guava-testlib/src/com/google/common/testing/ |
H A D | EquivalenceTester.java | 95 public EquivalenceTester<T> addEquivalenceGroup(T first, T... rest) { argument 96 addEquivalenceGroup(Lists.asList(first, rest));
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractLinkedIteratorTest.java | 91 // We can't retrieve even the known first element: 104 private static Iterator<Integer> newDoubler(int first, final int last) { argument 105 return new AbstractLinkedIterator<Integer>(first) {
|
/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)); 193 g_assert_cmpint (first, ==, 6); 195 g_assert (hb_set_next_range (s, &first, &last)); 196 g_assert_cmpint (first, ==, 10); 198 g_assert (hb_set_next_range (s, &first, &last)); 199 g_assert_cmpint (first, ==, 20005); 201 g_assert (!hb_set_next_range (s, &first, &last)); 202 g_assert_cmpint (first, [all...] |
/external/icu/icu4c/source/layout/ |
H A D | ExtensionSubtables.cpp | 20 le_uint16* first = ((le_uint16*)&code); local 22 return (le_uint32)((SWAPW(*first) << 16) + SWAPW(*second));
|
/external/jemalloc/include/jemalloc/internal/ |
H A D | quarantine.h | 22 size_t first; member in struct:quarantine_s
|
/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);
|
/external/libcxx/test/containers/sequences/list/ |
H A D | iterators.pass.cpp | 27 int first; member in struct:A 133 i->first = 3; 135 assert(j->first == 3);
|
/external/libcxx/test/containers/sequences/vector/ |
H A D | iterators.pass.cpp | 27 int first; member in struct:A 133 i->first = 3; 135 assert(j->first == 3);
|
/external/libcxx/test/re/re.regex/re.regex.construct/ |
H A D | iter_iter_flg.pass.cpp | 15 // basic_regex(ForwardIterator first, ForwardIterator last, 25 test(Iter first, Iter last, std::regex_constants::syntax_option_type f, unsigned mc) argument 27 std::basic_regex<typename std::iterator_traits<Iter>::value_type> r(first, last, f);
|
/external/libcxx/test/strings/basic.string/string.cons/ |
H A D | iter_alloc.pass.cpp | 26 test(It first, It last) argument 32 S s2(first, last); 34 assert(s2.size() == std::distance(first, last)); 36 for (It it = first; it != last; ++it, ++i) 44 test(It first, It last, const A& a) argument 49 S s2(first, last, a); 51 assert(s2.size() == std::distance(first, last)); 53 for (It it = first; it != last; ++it, ++i)
|
/external/libcxx/test/strings/basic.string/string.modifiers/string_insert/ |
H A D | iter_iter_iter.pass.cpp | 13 // iterator insert(const_iterator p, InputIterator first, InputIterator last); 27 test(S s, typename S::difference_type pos, It first, It last, S expected) argument 30 typename S::iterator i = s.insert(p, first, last);
|
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
H A D | iter_iter_pointer.pass.cpp | 28 typename S::const_iterator first = s.begin() + pos1; local 30 typename S::size_type xlen = last - first; 31 s.replace(first, last, str);
|
H A D | iter_iter_string.pass.cpp | 28 typename S::const_iterator first = s.begin() + pos1; local 30 typename S::size_type xlen = last - first; 31 s.replace(first, last, str);
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
H A D | types.h | 22 struct hlist_node *first; member in struct:hlist_head
|
/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/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_split_tmp.h | 30 unsigned first, incr; local 44 draw_pt_split_prim(prim, &first, &incr); 46 count = draw_pt_trim_count(count, first, incr); 47 if (count < first) 55 assert(max_count_simple >= first + incr && 56 max_count_loop >= first + incr && 57 max_count_fan >= first + incr); 64 const unsigned rollback = first - incr; 74 * remaining = count - seg_start = first + N'' * incr. 91 draw_pt_trim_count(MIN2(max_count_simple, count), first, inc [all...] |