HomeSort by relevance Sort by last modified time
    Searched refs:ic (Results 76 - 100 of 445) sorted by null

1 2 34 5 6 7 8 91011>>

  /prebuilts/go/darwin-x86/test/ken/
mfunc.go 20 simple(ia,ib,ic int) (oa,ob int) {
21 return ia+5, ib+ic;
simpfun.go 20 fun(ia,ib,ic int)int {
23 o = ia+ib+ic;
  /prebuilts/go/linux-x86/test/ken/
mfunc.go 20 simple(ia,ib,ic int) (oa,ob int) {
21 return ia+5, ib+ic;
simpfun.go 20 fun(ia,ib,ic int)int {
23 o = ia+ib+ic;
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
rotate.pass.cpp 54 int ic[] = {0, 1, 2}; local
55 const int sc = static_cast<int>(sizeof(ic)/sizeof(ic[0]));
56 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc));
57 assert(base(r) == ic+sc);
58 assert(ic[0] == 0);
59 assert(ic[1] == 1);
60 assert(ic[2] == 2)
252 std::unique_ptr<int> ic[3]; local
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/
rotate.pass.cpp 55 int ic[] = {0, 1, 2}; local
56 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
57 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc));
58 assert(base(r) == ic+sc);
59 assert(ic[0] == 0);
60 assert(ic[1] == 1);
61 assert(ic[2] == 2)
253 std::unique_ptr<int> ic[3]; local
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.rotate/
rotate.pass.cpp 55 int ic[] = {0, 1, 2}; local
56 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
57 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc));
58 assert(base(r) == ic+sc);
59 assert(ic[0] == 0);
60 assert(ic[1] == 1);
61 assert(ic[2] == 2)
253 std::unique_ptr<int> ic[3]; local
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/
reverse_copy.pass.cpp 42 const int ic[] = {0, 1, 2}; local
43 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
search_n_pred.pass.cpp 126 int ic[] = {0, 0, 0}; local
127 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
128 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic));
131 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic));
134 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic))
    [all...]
  /frameworks/ml/nn/common/operations/internal/reference/
depthwiseconv_float.h 48 for (int ic = 0; ic < input_depth; ++ic) {
50 const int oc = m + ic * depth_multiplier;
63 input_data[Offset(input_dims, ic, in_x, in_y, b)];
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/
reverse_copy.pass.cpp 42 const int ic[] = {0, 1, 2}; local
43 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.reverse/
reverse_copy.pass.cpp 42 const int ic[] = {0, 1, 2}; local
43 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/
search_n_pred.pass.cpp 126 int ic[] = {0, 0, 0}; local
127 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
128 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic));
131 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic));
134 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic))
    [all...]
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
unique.pass.cpp 43 int ic[] = {0, 0}; local
44 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::unique(Iter(ic), Iter(ic+sc));
46 assert(base(r) == ic + 1);
47 assert(ic[0] == 0);
116 Ptr ic[2]; local
117 const unsigned sc = sizeof(ic)/sizeof(ic[0])
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/
unique.pass.cpp 43 int ic[] = {0, 0}; local
44 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::unique(Iter(ic), Iter(ic+sc));
46 assert(base(r) == ic + 1);
47 assert(ic[0] == 0);
116 Ptr ic[2]; local
117 const unsigned sc = sizeof(ic)/sizeof(ic[0])
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.unique/
unique.pass.cpp 43 int ic[] = {0, 0}; local
44 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::unique(Iter(ic), Iter(ic+sc));
46 assert(base(r) == ic + 1);
47 assert(ic[0] == 0);
116 Ptr ic[2]; local
117 const unsigned sc = sizeof(ic)/sizeof(ic[0])
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/
search_n_pred.pass.cpp 124 int ic[] = {0, 0, 0}; local
125 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
126 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic));
129 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic));
132 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic))
    [all...]
  /external/clang/test/SemaTemplate/
temp_func_order.cpp 61 void test_f4(int i, const int ic) {
63 float &fr1 = f4(ic);
72 void test_f5(int i, const int ic) {
82 void test_f6(int i, const int ic) {
84 float &fr = f6(ic, ic);
  /external/libcxx/test/std/numerics/complex.number/complex.member.ops/
divide_equal_complex.pass.cpp 35 std::complex<int> ic (1,1);
36 c3 /= ic;
minus_equal_complex.pass.cpp 35 std::complex<int> ic (1,1);
36 c3 -= ic;
plus_equal_complex.pass.cpp 35 std::complex<int> ic (1,1);
36 c3 += ic;
times_equal_complex.pass.cpp 35 std::complex<int> ic (1,1);
36 c3 *= ic;
  /external/llvm/test/Bindings/OCaml/
bitwriter.ml 18 let ic = open_in_bin name in
19 let len = in_channel_length ic in
22 test ((input ic buf 0 len) = len);
24 close_in ic;
  /external/swiftshader/third_party/LLVM/test/Bindings/Ocaml/
bitwriter.ml 15 let ic = open_in_bin name in
16 let len = in_channel_length ic in
19 test ((input ic buf 0 len) = len);
21 close_in ic;
  /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/
d8_31pf.cpp 174 Word16 ic; local
223 ic = LSBs - ((LSBs >> 2) << 2);
226 pos_indx[index1] = ib + (ic & 1);
242 pos_indx[index2] = ib + (ic >> 1);
247 ic =
253 ic =
255 ic,
262 ic,

Completed in 529 milliseconds

1 2 34 5 6 7 8 91011>>