Searched defs:ih (Results 1 - 25 of 47) sorted by relevance

12

/external/glide/third_party/gif_decoder/src/main/java/com/bumptech/glide/gifdecoder/
H A DGifFrame.java7 int ix, iy, iw, ih; field in class:GifFrame
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp50 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
51 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
53 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3));
H A Dsearch_pred.pass.cpp93 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.modifying.operations/alg.unique/
H A Dunique.pass.cpp71 int ih[] = {0, 1, 1}; local
72 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
73 r = std::unique(Iter(ih), Iter(ih+sh));
74 assert(base(r) == ih + 2);
75 assert(ih[0] == 0);
76 assert(ih[1] == 1);
148 Ptr ih[3]; local
149 ih[
[all...]
H A Dunique_copy.pass.cpp76 const int ih[] = {0, 1, 1}; local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
79 r = std::unique_copy(InIter(ih), InIter(ih+sh), OutIter(jh));
H A Dunique_copy_pred.pass.cpp99 const int ih[] = {0, 1, 1}; local
100 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
103 r = std::unique_copy(InIter(ih), InIter(ih+sh), OutIter(jh), count_equal());
H A Dunique_pred.pass.cpp93 int ih[] = {0, 1, 1}; local
94 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
96 r = std::unique(Iter(ih), Iter(ih+sh), count_equal());
97 assert(base(r) == ih + 2);
98 assert(ih[0] == 0);
99 assert(ih[1] == 1);
186 Ptr ih[3]; local
187 ih[
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
H A Ddefault.pass.cpp75 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), Iter
[all...]
H A Dhash.pass.cpp81 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), Iter
[all...]
H A Dhash.pred.pass.cpp96 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), Iter
[all...]
H A Dpred.pass.cpp90 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), Iter
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/
H A Ddefault.pass.cpp75 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), Iter
[all...]
H A Dhash.pass.cpp80 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), Iter
[all...]
H A Dhash.pred.pass.cpp93 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), Iter
[all...]
H A Dpred.pass.cpp87 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), Iter
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
H A Ddefault.pass.cpp75 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));
H A Ddefault.pred.pass.cpp87 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/
H A Dmake_default_searcher.pass.cpp60 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));
H A Dmake_default_searcher.pred.pass.cpp72 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/fdlibm/
H A Dk_rem_pio2.c116 * ih integer. If >0 it indicates q[] is >= 0.5, hence
170 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
205 ih = 0;
209 ih = iq[jz-1]>>(23-q0);
211 else if(q0==0) ih = iq[jz-1]>>23;
212 else if(z>=0.5) ih=2;
214 if(ih>0) { /* q > 0.5 */
232 if(ih==2) {
286 y[0] = (ih==0)? fw: -fw;
292 y[0] = (ih
[all...]
/external/ltp/testcases/kernel/syscalls/utils/
H A Dinotify.h74 * h_list is protected by ih->mutex of the associated inotify_handle.
76 * ih, inode, and wd are never written to once the watch is created.
86 struct inotify_handle *ih; /* associated inotify handle */ member in struct:inotify_watch
176 static inline void inotify_destroy(struct inotify_handle *ih) argument
180 static inline __s32 inotify_find_watch(struct inotify_handle *ih, struct inode *inode, argument
186 static inline __s32 inotify_find_update_watch(struct inotify_handle *ih, argument
192 static inline __s32 inotify_add_watch(struct inotify_handle *ih, argument
199 static inline int inotify_rm_watch(struct inotify_handle *ih, argument
205 static inline int inotify_rm_wd(struct inotify_handle *ih, __u32 wd) argument
210 static inline void inotify_remove_watch_locked(struct inotify_handle *ih, argument
[all...]
/external/skia/src/gpu/effects/
H A DGrTextureDomain.cpp416 float ih = 1.f / texture->height(); local
418 iw, ih,
419 -dstdfp.fDeviceSpaceOffset.fX * iw, -dstdfp.fDeviceSpaceOffset.fY * ih
/external/webrtc/talk/session/media/
H A Dyuvscaler_unittest.cc98 bool TestScale(int iw, int ih, int ow, int oh, int offset, bool usefile, argument
102 size_t isize = I420_SIZE(iw, ih);
116 if (!LoadPlanarYuvTestImage("faces", iw, ih, ibuf) ||
149 EXPECT_EQ(0, libyuv::ScaleOffset(ibuf, iw, ih, obuf, ow, oh,
193 const int iw = 640, ih = 360; local
195 ALIGN16(uint8_t ibuf[I420_SIZE(iw, ih)]);
199 ASSERT_TRUE(LoadPlanarYuvTestImage("faces", iw, ih, ibuf));
201 libyuv::ScaleOffset(ibuf, iw, ih, obuf, ow, oh, 0, false);
209 const int iw = 640, ih = 360; local
212 scoped_ptr<uint8_t[]> ibuffer(new uint8_t[I420_SIZE(iw, ih)
[all...]
/external/libvpx/libvpx/examples/
H A Dvp8_multi_resolution_encoder.c450 unsigned int ih = cfg[i - 1].g_h * dsf[i - 1].den + dsf[i - 1].num - 1; local
452 cfg[i].g_h = ih / dsf[i - 1].num;
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dbcel.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/bcel/ org/apache/bcel/classfile/ ...

Completed in 371 milliseconds

12