/external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
H A D | compare.pass.cpp | 26 const char ib[] = "123"; local 28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); 29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); 30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); 31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); 32 assert(f.compare(ia, ia+sa, ib 39 const wchar_t ib[] = L"123"; local [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
H A D | rotate_copy.pass.cpp | 25 // int ib[std::size(ia)] = {0}; 29 // auto it = std::rotate_copy(std::begin(ia), middle, std::end(ia), std::begin(ib)); 31 // return std::distance(std::begin(ib), it) == std::size(ia) 32 // && std::equal (std::begin(ia), middle, std::begin(ib) + std::size(ia) - N) 33 // && std::equal (middle, std::end(ia), std::begin(ib)) 44 int ib[sa] = {0}; local 46 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib)); 47 assert(base(r) == ib); 49 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib)); 50 assert(base(r) == ib [all...] |
/external/mesa3d/src/amd/common/ |
H A D | ac_debug.c | 131 static void ac_parse_set_reg_packet(FILE *f, uint32_t *ib, unsigned count, argument 134 unsigned reg = (ib[1] << 2) + reg_offset; 138 ac_dump_reg(f, reg + i*4, ib[2+i], ~0); 141 static uint32_t *ac_parse_packet3(FILE *f, uint32_t *ib, int *num_dw, argument 146 unsigned count = PKT_COUNT_G(ib[0]); 147 unsigned op = PKT3_IT_OPCODE_G(ib[0]); 148 const char *predicate = PKT3_PREDICATE(ib[0]) ? "(predicate)" : ""; 175 ac_parse_set_reg_packet(f, ib, count, SI_CONTEXT_REG_OFFSET); 178 ac_parse_set_reg_packet(f, ib, count, SI_CONFIG_REG_OFFSET); 181 ac_parse_set_reg_packet(f, ib, coun 340 ac_parse_ib(FILE *f, uint32_t *ib, int num_dw, int trace_id, const char *name, enum chip_class chip_class, ac_debug_addr_callback addr_callback, void *addr_callback_data) argument [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
H A D | is_permutation_pred.pass.cpp | 34 int ib[] = {1, 1, 0}; local 38 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib) , c) 39 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), c) 40 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic) , c) 41 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), c) 51 const int ib[] = {0}; local 55 forward_iterator<const int*>(ib), 76 const int ib[] = {1}; local 93 const int ib[] = {0, 0}; local 114 const int ib[] = {0, 1}; local 130 const int ib[] = {1, 0}; local 146 const int ib[] = {1, 1}; local 162 const int ib[] = {0, 0}; local 178 const int ib[] = {0, 1}; local 199 const int ib[] = {1, 0}; local 220 const int ib[] = {1, 1}; local 236 const int ib[] = {0, 0}; local 252 const int ib[] = {0, 1}; local 273 const int ib[] = {1, 0}; local 294 const int ib[] = {1, 1}; local 310 const int ib[] = {0, 0}; local 326 const int ib[] = {0, 1}; local 342 const int ib[] = {1, 0}; local 358 const int ib[] = {1, 1}; local 380 const int ib[] = {1, 0, 0}; local 396 const int ib[] = {1, 0, 1}; local 412 const int ib[] = {1, 0, 2}; local 428 const int ib[] = {1, 1, 0}; local 444 const int ib[] = {1, 1, 1}; local 460 const int ib[] = {1, 1, 2}; local 476 const int ib[] = {1, 2, 0}; local 492 const int ib[] = {1, 2, 1}; local 508 const int ib[] = {1, 2, 2}; local 524 const int ib[] = {1, 0, 0}; local 545 const int ib[] = {1, 0, 1}; local 561 const int ib[] = {1, 0, 2}; local 582 const int ib[] = {1, 2, 0}; local 603 const int ib[] = {2, 1, 0}; local 624 const int ib[] = {2, 0, 1}; local 645 const int ib[] = {1, 0, 1}; local 661 const int ib[] = {1, 0, 0}; local 687 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local 727 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local [all...] |
H A D | is_permutation.pass.cpp | 27 int ib[] = {1, 1, 0}; local 30 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib)) 31 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) 32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) 33 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) 43 const int ib[] = {0}; local 47 forward_iterator<const int*>(ib)) 70 const int ib[] = {1}; local 85 const int ib[] = {0, 0}; local 103 const int ib[] = {0, 1}; local 117 const int ib[] = {1, 0}; local 131 const int ib[] = {1, 1}; local 145 const int ib[] = {0, 0}; local 159 const int ib[] = {0, 1}; local 177 const int ib[] = {1, 0}; local 191 const int ib[] = {1, 1}; local 205 const int ib[] = {0, 0}; local 219 const int ib[] = {0, 1}; local 233 const int ib[] = {1, 0}; local 247 const int ib[] = {1, 1}; local 261 const int ib[] = {0, 0}; local 275 const int ib[] = {0, 1}; local 289 const int ib[] = {1, 0}; local 303 const int ib[] = {1, 1}; local 318 const int ib[] = {1, 0, 0}; local 332 const int ib[] = {1, 0, 1}; local 346 const int ib[] = {1, 0, 2}; local 360 const int ib[] = {1, 1, 0}; local 374 const int ib[] = {1, 1, 1}; local 388 const int ib[] = {1, 1, 2}; local 402 const int ib[] = {1, 2, 0}; local 416 const int ib[] = {1, 2, 1}; local 430 const int ib[] = {1, 2, 2}; local 444 const int ib[] = {1, 0, 0}; local 462 const int ib[] = {1, 0, 1}; local 476 const int ib[] = {1, 0, 2}; local 494 const int ib[] = {1, 2, 0}; local 512 const int ib[] = {2, 1, 0}; local 530 const int ib[] = {2, 0, 1}; local 548 const int ib[] = {1, 0, 1}; local 562 const int ib[] = {1, 0, 0}; local 584 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local 606 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
H A D | search_n.pass.cpp | 53 int ib[] = {0, 0, 1, 1, 2, 2}; local 54 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 55 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); 56 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); 57 assert(std::search_n(Iter(ib), Ite [all...] |
H A D | search_n_pred.pass.cpp | 91 int ib[] = {0, 0, 1, 1, 2, 2}; local 92 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 93 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); 96 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); 99 assert(std::search_n(Iter(ib), Ite [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
H A D | mismatch.pass.cpp | 30 int ib[] = {1, 3}; local 43 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); 44 if (p3.first != ib+2 || p3.second != ic+2) 47 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); 48 if (p4.first != ib+2 || p4.second != ic+2) 51 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); 52 if (p5.first != II(ib 66 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local [all...] |
H A D | mismatch_pred.pass.cpp | 35 int ib[] = {1, 3}; local 48 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); 49 if (p3.first != ib+2 || p3.second != ic+2) 52 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); 53 if (p4.first != ib+2 || p4.second != ic+2) 56 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); 57 if (p5.first != II(ib 76 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
H A D | remove_copy.pass.cpp | 26 int ib[std::size(ia)] = {0}; local 28 auto it = std::remove_copy(std::begin(ia), std::end(ia), std::begin(ib), 5); 30 return std::distance(std::begin(ib), it) == (std::size(ia) - 2) // we removed two elements 31 && std::none_of(std::begin(ib), it, [](int a) {return a == 5;}) 32 && std::all_of (it, std::end(ib), [](int a) {return a == 0;}) 43 int ib[sa]; 44 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2); 45 assert(base(r) == ib + sa-3); 46 assert(ib[0] == 0); 47 assert(ib[ [all...] |
H A D | remove_copy_if.pass.cpp | 30 int ib[std::size(ia)] = {0}; local 32 auto it = std::remove_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo); 34 return std::distance(std::begin(ib), it) == (std::size(ia) - 1) // we removed one element 35 && std::none_of(std::begin(ib), it, equalToTwo) 36 && std::all_of (it, std::end(ib), [](int a) {return a == 0;}) 47 int ib[sa]; 49 OutIter(ib), equalToTwo); 50 assert(base(r) == ib + sa-3); 51 assert(ib[0] == 0); 52 assert(ib[ [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
H A D | lexicographical_compare.pass.cpp | 27 int ib[] = {1, 3, 5, 2, 4, 6}; local 29 return std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) 30 && !std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia)) 41 int ib[] = {1, 2, 3}; local 42 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); 43 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib [all...] |
H A D | lexicographical_compare_comp.pass.cpp | 29 int ib[] = {1, 3, 5, 2, 4, 6}; local 32 return !std::lexicographical_compare(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), pred) 33 && std::lexicographical_compare(std::begin(ib), std::end(ib), std::begin(ia), std::end(ia), pred) 44 int ib[] = {1, 2, 3}; local 47 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); 48 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib [all...] |
/external/sqlite/android/ |
H A D | OldPhoneNumberUtils.cpp | 170 int ia, ib; local 180 ib = strlen(b); 181 if (ia == 0 || ib == 0) { 187 ib--; 191 while (ia >= 0 && ib >=0) { 203 cb = b[ib]; 206 ib--; 215 ia--; ib--; matched++; 233 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) { 246 if (matchIntlPrefix(a, ia + 1) && matchIntlPrefix(b, ib [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
H A D | replace_copy.pass.cpp | 30 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger local 33 auto it = std::replace_copy(std::begin(ia), std::end(ia), std::begin(ib), 2, 5); 35 return it == (std::begin(ib) + std::size(ia)) 37 && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected)) 48 int ib[sa] = {0}; local 49 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5); 50 assert(base(r) == ib + sa); 51 assert(ib[0] == 0); 52 assert(ib[1] == 1); 53 assert(ib[ [all...] |
H A D | replace_copy_if.pass.cpp | 33 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger local 36 auto it = std::replace_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo, 5); 38 return it == (std::begin(ib) + std::size(ia)) 40 && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected)) 51 int ib[sa] = {0}; local 53 OutIter(ib), equalToTwo, 5); 54 assert(base(r) == ib + sa); 55 assert(ib[0] == 0); 56 assert(ib[1] == 1); 57 assert(ib[ [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
H A D | unary_transform.pass.cpp | 31 int ib[] = {0, 0, 0, 0, 0}; // one bigger local 34 auto it = std::transform(std::begin(ia), std::end(ia), std::begin(ib), plusOne); 36 return it == (std::begin(ib) + std::size(ia)) 38 && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected)) 50 int ib[sa] = {0}; local 52 OutIter(ib), plusOne); 53 assert(base(r) == ib + sa); 54 assert(ib[0] == 1); 55 assert(ib[1] == 2); 56 assert(ib[ [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_index_modify.c | 30 struct pipe_index_buffer *ib, 42 if (ib->user_buffer) { 43 in_map = ib->user_buffer; 45 in_map = pipe_buffer_map(context, ib->buffer, 65 struct pipe_index_buffer *ib, 76 if (ib->user_buffer) { 77 in_map = ib->user_buffer; 79 in_map = pipe_buffer_map(context, ib->buffer, 99 struct pipe_index_buffer *ib, 110 if (ib 29 util_shorten_ubyte_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, unsigned add_transfer_flags, int index_bias, unsigned start, unsigned count, void *out) argument 64 util_rebuild_ushort_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, unsigned add_transfer_flags, int index_bias, unsigned start, unsigned count, void *out) argument 98 util_rebuild_uint_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, unsigned add_transfer_flags, int index_bias, unsigned start, unsigned count, void *out) argument [all...] |
H A D | u_index_modify.h | 31 struct pipe_index_buffer *ib, 39 struct pipe_index_buffer *ib, 46 struct pipe_index_buffer *ib,
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
H A D | equal.pass.cpp | 31 int ib[] = {1, 3}; local 38 && std::equal(std::begin(ib), std::end(ib), std::begin(ic)) 39 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) 41 && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))) 42 && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))) 52 int ib[ local [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
H A D | includes.pass.cpp | 27 int ib[] = {2, 4}; local 30 return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) 42 int ib[] = {2, 4}; local 43 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 49 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib))); 50 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib [all...] |
H A D | includes_comp.pass.cpp | 28 int ib[] = {2, 4}; local 32 return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), comp) 45 int ib[] = {2, 4}; local 46 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 52 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>())); 53 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib [all...] |
/external/mesa3d/src/mesa/vbo/ |
H A D | vbo_rebase.c | 113 * - if ib != NULL and min_index != 0, otherwise vertices lower than 116 * - if ib == NULL and min_index != 0, just for convenience so this doesn't 128 const struct _mesa_index_buffer *ib, 151 if (0 && ib && ctx->Extensions.ARB_draw_elements_base_vertex) { 168 } else if (ib) { 171 GLboolean map_ib = ib->obj->Name && 172 !ib->obj->Mappings[MAP_INTERNAL].Pointer; 176 ctx->Driver.MapBufferRange(ctx, 0, ib->obj->Size, GL_MAP_READ_BIT, 177 ib->obj, MAP_INTERNAL); 180 ptr = ADD_POINTERS(ib 124 vbo_rebase_prims( struct gl_context *ctx, const struct gl_vertex_array *arrays[], const struct _mesa_prim *prim, GLuint nr_prims, const struct _mesa_index_buffer *ib, GLuint min_index, GLuint max_index, vbo_draw_func draw ) argument [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
H A D | reverse.pass.cpp | 33 int ib[] = {0, 1}; local 34 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 35 std::reverse(Iter(ib), Iter(ib+sb)); 36 assert(ib[0] == 1); 37 assert(ib[1] == 0);
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/ |
H A D | count.pass.cpp | 26 int ib[] = {1, 2, 3, 4, 5, 6}; local 28 && (std::count(std::begin(ib), std::end(ib), 9) == 0)
|