/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
H A D | minmax_element_comp.pass.cpp | 15 // minmax_element(Iter first, Iter last, Compare comp); 28 Compare comp; local 29 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp); 34 assert(!comp(*j, *p.first)); 35 assert(!comp(*p.second, *j)); 74 Compare comp; local 75 std::pair<Iter, Iter> p = std::minmax_element(Iter(a), Iter(a+N), comp);
|
/external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons.alloc/ |
H A D | ctor_alloc.pass.cpp | 29 test(const value_compare& comp, const test_allocator<int>& a) argument 30 : base(comp, c, a) {} 31 test(const value_compare& comp, const container_type& c, argument 32 const test_allocator<int>& a) : base(comp, c, a) {} 34 test(const value_compare& comp, container_type&& c, argument 35 const test_allocator<int>& a) : base(comp, std::move(c), a) {}
|
H A D | ctor_comp_alloc.pass.cpp | 13 // priority_queue(const Compare& comp, const Alloc& a); 29 test(const value_compare& comp, const test_allocator<int>& a) argument 30 : base(comp, a) {} 31 test(const value_compare& comp, const container_type& c, argument 32 const test_allocator<int>& a) : base(comp, c, a) {} 34 test(const value_compare& comp, container_type&& c, argument 35 const test_allocator<int>& a) : base(comp, std::move(c), a) {}
|
H A D | ctor_comp_cont_alloc.pass.cpp | 13 // priority_queue(const Compare& comp, const container_type& c, 40 test(const value_compare& comp, const test_allocator<int>& a) argument 41 : base(comp, a) {} 42 test(const value_compare& comp, const container_type& c, argument 43 const test_allocator<int>& a) : base(comp, c, a) {} 45 test(const value_compare& comp, container_type&& c, argument 46 const test_allocator<int>& a) : base(comp, std::move(c), a) {}
|
H A D | ctor_comp_rcont_alloc.pass.cpp | 13 // priority_queue(const Compare& comp, container_type&& c, 40 test(const value_compare& comp, const test_allocator<int>& a) argument 41 : base(comp, a) {} 42 test(const value_compare& comp, const container_type& c, argument 43 const test_allocator<int>& a) : base(comp, c, a) {} 45 test(const value_compare& comp, container_type&& c, argument 46 const test_allocator<int>& a) : base(comp, std::move(c), a) {}
|
H A D | ctor_copy_alloc.pass.cpp | 39 test(const value_compare& comp, const test_allocator<int>& a) argument 40 : base(comp, c, a) {} 41 test(const value_compare& comp, const container_type& c, argument 42 const test_allocator<int>& a) : base(comp, c, a) {}
|
H A D | ctor_move_alloc.pass.cpp | 43 test(const value_compare& comp, const test_allocator<int>& a) argument 44 : base(comp, c, a) {} 45 test(const value_compare& comp, const container_type& c, argument 46 const test_allocator<int>& a) : base(comp, c, a) {} 47 test(const value_compare& comp, container_type&& c, argument 48 const test_allocator<int>& a) : base(comp, std::move(c), a) {}
|
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/ |
H A D | AbstractInputEditor.java | 46 protected JComponent comp; field in class:AbstractInputEditor 47 public JComponent getControl() { return comp; }
|
/external/boringssl/include/openssl/ |
H A D | stack.h | 102 * order, based on |comp|. */ 107 /* comp is an optional comparison function. */ 108 stack_cmp_func comp; member in struct:stack_st 208 OPENSSL_EXPORT _STACK *sk_new(stack_cmp_func comp); 287 OPENSSL_EXPORT stack_cmp_func sk_set_cmp_func(_STACK *sk, stack_cmp_func comp);
|
H A D | lhash.h | 141 lhash_cmp_func comp; member in struct:lhash_st 145 /* lh_new returns a new, empty hash table or NULL on error. If |comp| is NULL, 148 OPENSSL_EXPORT _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp);
|
/external/boringssl/src/include/openssl/ |
H A D | stack.h | 102 * order, based on |comp|. */ 107 /* comp is an optional comparison function. */ 108 stack_cmp_func comp; member in struct:stack_st 208 OPENSSL_EXPORT _STACK *sk_new(stack_cmp_func comp); 287 OPENSSL_EXPORT stack_cmp_func sk_set_cmp_func(_STACK *sk, stack_cmp_func comp);
|
H A D | lhash.h | 141 lhash_cmp_func comp; member in struct:lhash_st 145 /* lh_new returns a new, empty hash table or NULL on error. If |comp| is NULL, 148 OPENSSL_EXPORT _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp);
|
/external/icu/icu4c/source/layout/ |
H A D | LigatureSubstSubtables.cpp | 35 le_uint16 comp; local 37 for (comp = 0; comp < compCount; comp += 1) { 42 if (LE_GET_GLYPH(glyphIterator->getCurrGlyphID()) != SWAPW(ligTable->componentArray[comp])) { 47 if (comp == compCount && (filter == NULL || filter->accept(LE_SET_GLYPH(glyph, ligGlyph)))) { 51 while (comp > 0) { 55 comp -= 1;
|
/external/libavc/test/encoder/ |
H A D | psnr.c | 98 WORD32 comp; local 106 for(comp = 0; comp < 3; comp++) 108 df_psnr[comp] = 0; 109 pu1_buf1 = (UWORD8 *)ps_buf1->apv_bufs[comp]; 110 pu1_buf2 = (UWORD8 *)ps_buf2->apv_bufs[comp]; 111 wd = ps_buf1->au4_wd[comp]; 112 ht = ps_buf1->au4_ht[comp]; 113 strd1 = ps_buf1->au4_strd[comp]; [all...] |
H A D | recon.c | 59 WORD32 comp; local 66 for(comp = 0; comp < num_comp; comp++) 68 wd = ps_raw_buf->au4_wd[comp]; 69 ht = ps_raw_buf->au4_ht[comp]; 70 pu1_buf = ps_raw_buf->apv_bufs[comp];
|
H A D | input.c | 125 WORD32 comp; local 152 for(comp = 0; comp < num_comp; comp++) 154 wd = ps_raw_buf->au4_wd[comp]; 155 ht = ps_raw_buf->au4_ht[comp]; 156 strd = ps_raw_buf->au4_strd[comp]; 157 pu1_buf = ps_raw_buf->apv_bufs[comp]; 180 WORD32 comp; local 207 for(comp [all...] |
/external/drm_hwcomposer/ |
H A D | drmcomposition.cpp | 110 DrmDisplayComposition *comp = GetDisplayComposition(display); local 111 ret = comp->Plan(compositor_map[display].squash_state(), &primary_planes_, 126 DrmDisplayComposition *comp = GetDisplayComposition(display); local 133 if (comp->type() == DRM_COMPOSITION_TYPE_EMPTY || 134 comp->type() == DRM_COMPOSITION_TYPE_MODESET) 146 comp->AddPlaneDisable(*iter); 154 comp->AddPlaneDisable(*iter);
|
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
H A D | TestComparator.java | 16 public void test(Comparator comp, int count) { argument 20 int compab = comp.compare(a,b); 29 compab = comp.compare(a,b); 30 int compba = comp.compare(b,a); 31 int compac = comp.compare(a,c);
|
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
H A D | SortUtil.java | 76 public static void gsort(Object[] a, Comparator comp) { argument 82 if ( comp.compare(a[pos], a[pos-1]) >= 0 ){ 108 // if (p == 0 || comp.compare(a[p], a[pm1]) >= 0) { 175 public static void qsort(Object[] a, Comparator comp) { argument 176 qsort(a, 0, a.length - 1, comp); 186 public static void qsort(Object[] a, int lo0, int hi0, Comparator comp) { argument 196 if (comp.compare(a[hi0], a[lo0]) < 0) { 214 while (comp.compare(a[++lo], mid) < 0); 218 while (comp.compare(mid, a[--hi]) < 0); 233 qsort(a, lo0, lo - 1, comp); 243 qsort(int[] a, int lo0, int hi0, Comparator comp) argument 303 msort(Object[] src, Object[] dest, Comparator comp) argument 316 msort(Object[] src, Object[] dest, int low, int high, Comparator comp) argument 326 merge(Object[] src, Object[] dest, int low, int middle, int high, Comparator comp) argument [all...] |
/external/jmonkeyengine/engine/src/desktop/com/jme3/input/awt/ |
H A D | AwtKeyInput.java | 68 public void setInputSource(Component comp){ argument 74 component = comp;
|
/external/libxml2/ |
H A D | testXPath.c | 95 xmlXPathCompExprPtr comp; local 97 comp = xmlXPathCompile(BAD_CAST str); 98 if (comp != NULL) { 100 xmlXPathDebugDumpCompExpr(stdout, comp, 0); 102 res = xmlXPathCompiledEval(comp, ctxt); 103 xmlXPathFreeCompExpr(comp);
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_code.c | 147 unsigned comp; local 148 for(comp = 0; comp < c->Constants[index].Size; ++comp) { 149 if (c->Constants[index].u.Immediate[comp] == data) { 150 *swizzle = RC_MAKE_SWIZZLE_SMEAR(comp); 161 unsigned comp = c->Constants[free_index].Size++; local 162 c->Constants[free_index].u.Immediate[comp] = data; 163 *swizzle = RC_MAKE_SWIZZLE_SMEAR(comp);
|
/external/v8/test/webkit/fast/js/kde/ |
H A D | Array.js | 134 function comp(a, b) { function 144 shouldBe("var a = ['aa', 'b', 'cccc', 'ddd']; String(a.sort(comp))", "'b,aa,ddd,cccc'");
|
/external/boringssl/src/crypto/lhash/ |
H A D | lhash.c | 72 _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) { argument 89 ret->comp = comp; 90 if (ret->comp == NULL) { 91 ret->comp = (lhash_cmp_func) strcmp; 140 if (lh->comp(cur->data, data) == 0) {
|
/external/boringssl/src/crypto/stack/ |
H A D | stack.c | 67 _STACK *sk_new(stack_cmp_func comp) { argument 83 ret->comp = comp; 236 if (sk->comp == NULL) { 255 /* sk->comp is a function that takes pointers to pointers to elements, but 260 comp_func=(int (*)(const void *,const void *))(sk->comp); 267 while (i > 0 && sk->comp((const void**) &p, (const void**) &sk->data[i-1]) == 0) { 306 ret = sk_new(sk->comp); 321 ret->comp = sk->comp; 349 sk_set_cmp_func(_STACK *sk, stack_cmp_func comp) argument [all...] |