| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_camera.cpp | 31 double iw,ih,av_size,field_fact; local
37 ih=(double)(im_height*field_fact);
38 av_size=(iw+ih)/2.0;
44 K[5]=ih/2.0/field_fact;
|
| /external/slf4j/slf4j-api/src/test/java/org/slf4j/helpers/ |
| SubstitutableLoggerTest.java | 51 LoggerInvocationHandler ih = new LoggerInvocationHandler(); local
52 Logger proxyLogger = (Logger) Proxy.newProxyInstance(getClass().getClassLoader(), new Class[] { Logger.class }, ih);
58 expectedMethodSignatures.removeAll(ih.getInvokedMethodSignatures());
|
| /external/glide/third_party/gif_decoder/src/main/java/com/bumptech/glide/gifdecoder/ |
| GifFrame.java | 7 int ix, iy, iw, ih; field in class:GifFrame
|
| /prebuilts/go/darwin-x86/test/ |
| notinheap3.go | 18 x *ih
19 s []ih
28 type ih struct { // In-heap type type
45 v2.s = []ih(nil) // ERROR "write barrier"
|
| /prebuilts/go/linux-x86/test/ |
| notinheap3.go | 18 x *ih
19 s []ih
28 type ih struct { // In-heap type type
45 v2.s = []ih(nil) // ERROR "write barrier"
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 93 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
94 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
96 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), count_equal()) == Iter1(ih+3));
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 107 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
108 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
110 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), count_equal()) == Iter1(ih+3));
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| default.pass.cpp | 75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 81 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
82 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| hash.pred.pass.cpp | 96 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
97 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
99 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
133 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
134 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
136 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| pred.pass.cpp | 90 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
91 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
93 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
124 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
125 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
127 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| default.pass.cpp | 75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 80 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
81 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
83 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| hash.pred.pass.cpp | 93 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
94 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
96 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
127 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
128 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
130 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| pred.pass.cpp | 87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
121 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
122 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
124 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pass.cpp | 75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| default.pred.pass.cpp | 87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pass.cpp | 60 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
61 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
63 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| make_default_searcher.pred.pass.cpp | 72 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
73 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
75 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| default.pass.cpp | 76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 82 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
83 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
85 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
116 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
117 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
119 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| hash.pred.pass.cpp | 97 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
98 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
100 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
134 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
135 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
137 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| pred.pass.cpp | 91 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
92 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
94 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
125 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
126 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
128 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| default.pass.cpp | 76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 81 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
82 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
