Home
last modified time | relevance | path

Searched refs:ig (Results 1 – 25 of 282) sorted by relevance

12345678910>>...12

/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
Drotate.pass.cpp155 int ig[] = {0, 1, 2, 3, 4, 5}; in test() local
156 const int sg = static_cast<int>(sizeof(ig)/sizeof(ig[0])); in test()
157 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg)); in test()
158 assert(base(r) == ig+sg); in test()
159 assert(ig[0] == 0); in test()
160 assert(ig[1] == 1); in test()
161 assert(ig[2] == 2); in test()
162 assert(ig[3] == 3); in test()
163 assert(ig[4] == 4); in test()
164 assert(ig[5] == 5); in test()
[all …]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
Dunique.pass.cpp64 int ig[] = {0, 0, 1, 1}; in test() local
65 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test()
66 r = std::unique(Iter(ig), Iter(ig+sg)); in test()
67 assert(base(r) == ig + 2); in test()
68 assert(ig[0] == 0); in test()
69 assert(ig[1] == 1); in test()
139 Ptr ig[4]; in test1() local
140 ig[2].reset(&one); in test1()
141 ig[3].reset(&one); in test1()
142 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test1()
[all …]
Dunique_pred.pass.cpp84 int ig[] = {0, 0, 1, 1}; in test() local
85 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test()
87 r = std::unique(Iter(ig), Iter(ig+sg), count_equal()); in test()
88 assert(base(r) == ig + 2); in test()
89 assert(ig[0] == 0); in test()
90 assert(ig[1] == 1); in test()
175 Ptr ig[4]; in test1() local
176 ig[2].reset(&one); in test1()
177 ig[3].reset(&one); in test1()
178 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test1()
[all …]
Dunique_copy.pass.cpp68 const int ig[] = {0, 0, 1, 1}; in test() local
69 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test()
71 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg)); in test()
Dunique_copy_pred.pass.cpp89 const int ig[] = {0, 0, 1, 1}; in test() local
90 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test()
93 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg), count_equal()); in test()
/external/curl/lib/
Dsigpipe.h42 struct sigpipe_ignore *ig) in sigpipe_ignore() argument
46 ig->no_signal = data->set.no_signal; in sigpipe_ignore()
50 memset(&ig->old_pipe_act, 0, sizeof(struct sigaction)); in sigpipe_ignore()
51 sigaction(SIGPIPE, NULL, &ig->old_pipe_act); in sigpipe_ignore()
52 action = ig->old_pipe_act; in sigpipe_ignore()
64 static void sigpipe_restore(struct sigpipe_ignore *ig) in sigpipe_restore() argument
66 if(!ig->no_signal) in sigpipe_restore()
68 sigaction(SIGPIPE, &ig->old_pipe_act, NULL); in sigpipe_restore()
/external/python/cpython2/Modules/
Doperator.c466 itemgetterobject *ig; in itemgetter_new() local
481 ig = PyObject_GC_New(itemgetterobject, &itemgetter_type); in itemgetter_new()
482 if (ig == NULL) in itemgetter_new()
486 ig->item = item; in itemgetter_new()
487 ig->nitems = nitems; in itemgetter_new()
489 PyObject_GC_Track(ig); in itemgetter_new()
490 return (PyObject *)ig; in itemgetter_new()
494 itemgetter_dealloc(itemgetterobject *ig) in itemgetter_dealloc() argument
496 PyObject_GC_UnTrack(ig); in itemgetter_dealloc()
497 Py_XDECREF(ig->item); in itemgetter_dealloc()
[all …]
/external/llvm/test/Transforms/LoopVectorize/AArch64/
Dinterleaved_cost.ll42 %ig.factor.8 = type { double*, double, double, double, double, double, double, double }
43 define double @wide_interleaved_group(%ig.factor.8* %s, double %a, double %b, i32 %n) {
59 %0 = getelementptr inbounds %ig.factor.8, %ig.factor.8* %s, i64 %i, i32 2
63 %4 = getelementptr inbounds %ig.factor.8, %ig.factor.8* %s, i64 %i, i32 6
69 %10 = getelementptr inbounds %ig.factor.8, %ig.factor.8* %s, i64 %i, i32 3
/external/python/cpython2/Tools/pynche/
DListViewer.py165 ig, ig, ig, y1 = canvas.coords(colortag)
166 ig, ig, ig, y2 = canvas.coords(self.__bboxes[-1])
/external/emma/core/java12/com/vladium/emma/report/
DIItemAttribute.java110 final IItem ig = (IItem) g; in compare() local
112 return il.getName ().compareTo (ig.getName ()); in compare()
178 final IItem ig = (IItem) g; in compare() local
183 final double nig = ig.getAggregate (m_numeratorAggregateID); in compare()
184 final double dig = ig.getAggregate (m_denominatorAggregateID); in compare()
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/
Dhash.pred.pass.cpp91 int ig[] = {1, 2, 3, 4}; in test() local
92 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
125 char ig[] = {1, 2, 3, 4}; in test2() local
126 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
Ddefault.pass.cpp73 int ig[] = {1, 2, 3, 4}; in test() local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
112 char ig[] = {1, 2, 3, 4}; in test2() local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test2()
Dpred.pass.cpp85 int ig[] = {1, 2, 3, 4}; in test() local
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
119 char ig[] = {1, 2, 3, 4}; in test2() local
120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
Dhash.pass.cpp78 int ig[] = {1, 2, 3, 4}; in test() local
79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
112 char ig[] = {1, 2, 3, 4}; in test2() local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
Dpred.pass.cpp88 int ig[] = {1, 2, 3, 4}; in test() local
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
122 char ig[] = {1, 2, 3, 4}; in test2() local
123 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
Ddefault.pass.cpp73 int ig[] = {1, 2, 3, 4}; in test() local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
112 char ig[] = {1, 2, 3, 4}; in test2() local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test2()
Dhash.pred.pass.cpp94 int ig[] = {1, 2, 3, 4}; in test() local
95 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
131 char ig[] = {1, 2, 3, 4}; in test2() local
132 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
Dhash.pass.cpp79 int ig[] = {1, 2, 3, 4}; in test() local
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
113 char ig[] = {1, 2, 3, 4}; in test2() local
114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
/external/skia/tests/
DImageGeneratorTest.cpp47 MyImageGenerator ig; in DEF_TEST() local
59 ig.queryYUV8(&sizeInfo, nullptr); in DEF_TEST()
60 ig.queryYUV8(&sizeInfo, &colorSpace); in DEF_TEST()
66 ig.getYUV8Planes(sizeInfo, planes); in DEF_TEST()
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/
Dmake_default_searcher.pass.cpp58 int ig[] = {1, 2, 3, 4}; in test() local
59 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
Dmake_default_searcher.pred.pass.cpp70 int ig[] = {1, 2, 3, 4}; in test() local
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
Ddefault.pass.cpp73 int ig[] = {1, 2, 3, 4}; in test() local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
Ddefault.pred.pass.cpp85 int ig[] = {1, 2, 3, 4}; in test() local
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
/external/icu/icu4c/source/data/lang/
Dig.txt3 ig{
22 ig{"Igbo"}
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
Dsearch.pass.cpp48 int ig[] = {1, 2, 3, 4}; in test() local
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8)); in test()

12345678910>>...12