HomeSort by relevance Sort by last modified time
    Searched refs:ib (Results 26 - 50 of 463) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
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), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0))
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
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->user_buffer)
    [all...]
u_index_modify.h 31 struct pipe_index_buffer *ib,
39 struct pipe_index_buffer *ib,
46 struct pipe_index_buffer *ib,
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/
search_n_pred.pass.cpp 78 int ib[] = {0, 0, 1, 1, 2, 2}; local
79 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
80 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib));
83 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0));
86 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0))
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.remove/
remove_copy.pass.cpp 28 int ib[sa]; local
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
30 assert(base(r) == ib + sa-3);
31 assert(ib[0] == 0);
32 assert(ib[1] == 1);
33 assert(ib[2] == 3);
34 assert(ib[3] == 4);
35 assert(ib[4] == 3);
36 assert(ib[5] == 4);
remove_copy_if.pass.cpp 32 int ib[sa]; local
34 OutIter(ib), equalToTwo);
35 assert(base(r) == ib + sa-3);
36 assert(ib[0] == 0);
37 assert(ib[1] == 1);
38 assert(ib[2] == 3);
39 assert(ib[3] == 4);
40 assert(ib[4] == 3);
41 assert(ib[5] == 4);
  /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/
d8_31pf.cpp 173 Word16 ib; local
202 ib =
210 ib,
214 ib = ia - (Word16)(tempWord32 >> 1);
216 ib =
218 ib,
226 pos_indx[index1] = ib + (ic & 1);
229 ib =
235 ib =
237 ib,
351 Word16 ib; local
    [all...]
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/
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[s] = {0, 1, 2, 5, 4, 5} local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.replace/
replace_copy.pass.cpp 31 int ib[sa] = {0}; local
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 5);
37 assert(ib[3] == 3);
38 assert(ib[4] == 4);
replace_copy_if.pass.cpp 34 int ib[sa] = {0}; local
36 OutIter(ib), equalToTwo, 5);
37 assert(base(r) == ib + sa);
38 assert(ib[0] == 0);
39 assert(ib[1] == 1);
40 assert(ib[2] == 5);
41 assert(ib[3] == 3);
42 assert(ib[4] == 4);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.transform/
unary_transform.pass.cpp 32 int ib[sa] = {0}; local
34 OutIter(ib), plusOne);
35 assert(base(r) == ib + sa);
36 assert(ib[0] == 1);
37 assert(ib[1] == 2);
38 assert(ib[2] == 3);
39 assert(ib[3] == 4);
40 assert(ib[4] == 5);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
find_first_of.pass.cpp 26 int ib[] = {1, 3, 5, 7}; local
27 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
30 forward_iterator<const int*>(ib),
31 forward_iterator<const int*>(ib + sb)) ==
find_first_of_pred.pass.cpp 28 int ib[] = {1, 3, 5, 7}; local
29 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
32 forward_iterator<const int*>(ib),
33 forward_iterator<const int*>(ib + sb),
  /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
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+1)))
    [all...]
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+1), std::less<int>()))
    [all...]
  /external/mesa3d/src/mesa/vbo/
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->obj->Mappings[MAP_INTERNAL].Pointer, ib->ptr)
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/
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);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.reverse/
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/
count.pass.cpp 26 int ib[] = {1, 2, 3, 4, 5, 6}; local
28 && (std::count(std::begin(ib), std::end(ib), 9) == 0)
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
find_first_of.pass.cpp 26 int ib[] = {7, 8, 9}; local
33 && (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == FI(std::end(ic)))
35 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == BI(std::end(ic)))
37 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == RI(std::end(ic)))
46 int ib[] = {1, 3, 5, 7}; local
47 const unsigned sb = sizeof(ib)/sizeof(ib[0])
    [all...]
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_primitive_restart.c 45 const struct _mesa_index_buffer *ib)
55 switch (ib->type) {
80 const struct _mesa_index_buffer *ib)
88 if (!can_cut_index_handle_restart_index(ctx, ib)) {
132 const struct _mesa_index_buffer *ib,
138 if (ib == NULL) {
161 if (can_cut_index_handle_prims(ctx, prims, nr_prims, ib)) {
165 brw_draw_prims(ctx, prims, nr_prims, ib, GL_FALSE, -1, -1, NULL, 0,
172 vbo_sw_primitive_restart(ctx, prims, nr_prims, ib, indirect);
195 if (brw->ib.ib)
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
c8_31pf.cpp 444 Word16 ib; local
453 ib = pos_indxB >> 1;
455 tempWord32 = ((Word32) ib * 5) << 1;
459 ib = (Word16) tempWord32;
469 ib += ic;
471 ib += ia;
473 indx = ib << 3;
477 ib = ((Word16)(pos_indxB & 1)) << 1;
481 ib += ic;
483 ib += ia
573 Word16 ib; local
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/
copy_backward.pass.cpp 45 int ib[N] = {0}; local
47 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
48 assert(base(r) == ib);
50 assert(ia[i] == ib[i]);
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/
adjacent_find.pass.cpp 26 int ib[] = {0, 1, 2, 7, 0, 1, 2, 3}; local
29 && (std::adjacent_find(std::begin(ib), std::end(ib)) == std::end(ib))
adjacent_find_pred.pass.cpp 30 int ib[] = {0, 1, 2, 7, 0, 1, 2, 3}; local
33 && (std::adjacent_find(std::begin(ib), std::end(ib), eq) == std::end(ib))

Completed in 485 milliseconds

12 3 4 5 6 7 8 91011>>