Searched defs:il (Results 1 - 25 of 62) sorted by path

123

/external/clang/test/Analysis/engine/
H A Dreplay-without-inlining.c51 int bitmapImageRepFromIFF(IB st, const unsigned char *ib, int il) { argument
55 st.end = il;
/external/clang/test/CodeGenCXX/
H A Dcxx0x-initializer-stdinitializerlist.cpp220 std::initializer_list<int> il; member in struct:haslist1
230 : il{i, 2, 3}
236 std::initializer_list<destroyme1> il; member in struct:haslist2
242 : il{destroyme1(), destroyme1()}
366 std::initializer_list<std::initializer_list<int>> &&il = { { 1, 2, 3 }, { 4, k }, { 5, 6, 7, 8 } }; member in namespace:partly_constant
396 // 'il' reference.
/external/clang/test/PCH/
H A Dimplicitly-deleted.cpp5 move_only il; member in struct:sb
/external/clang/test/SemaCXX/
H A Dcxx0x-initializer-stdinitializerlist.cpp58 std::initializer_list<int> il = { 1, 2, 3 }; local
135 std::initializer_list<int> il = {1, 2, 3}; // expected-warning{{at the end of the constructor}} member in struct:haslist1
141 : il{1, 2, 3} // expected-warning{{at the end of the constructor}}
152 std::initializer_list<int> il = {1, 2}; local
153 g({il, {2, 3}});
167 std::initializer_list<const char *> *il = &x; local
H A Dscope-check.cpp344 std::initializer_list<A> il = { a }; // expected-note {{jump exits scope of lifetime-extended temporary with non-trivial destructor}} local
359 std::initializer_list<B> il = { local
369 std::initializer_list<B> il = { local
/external/dexmaker/lib/
H A Ddalvik-dx-1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/dx/ com/android/dx/cf/ ...
/external/eigen/Eigen/src/Eigenvalues/
H A DComplexSchur.h394 // Rows 0,...,il-1 are decoupled from the rest because m_matT(il,il-1) is zero.
395 // Rows il,...,iu is the part we are working on (the active submatrix).
398 Index il; local
420 // find il, the top row of the active submatrix
421 il = iu-1;
422 while(il > 0 && !subdiagonalEntryIsNeglegible(il-1))
424 --il;
[all...]
H A DRealSchur.h242 void initFrancisQRStep(Index il, Index iu, const Vector3s& shiftInfo, Index& im, Vector3s& firstHouseholderVector);
243 void performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace);
297 // Rows 0,...,il-1 are decoupled from the rest because m_matT(il,il-1) is zero.
298 // Rows il,...,iu is the part we are working on (the active window).
310 Index il = findSmallSubdiagEntry(iu); local
313 if (il == iu) // One root found
321 else if (il == iu-1) // Two roots found
336 initFrancisQRStep(il, i
460 initFrancisQRStep(Index il, Index iu, const Vector3s& shiftInfo, Index& im, Vector3s& firstHouseholderVector) argument
485 performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace) argument
[all...]
/external/eigen/unsupported/test/
H A Dcxx11_meta.cpp162 typedef numeric_list<int, 0, 1, 2, 3, 4, 5> il; typedef
172 VERIFY((is_same<typename take<0, il>::type, numeric_list<int>>::value));
173 VERIFY((is_same<typename take<1, il>::type, numeric_list<int, 0>>::value));
174 VERIFY((is_same<typename take<2, il>::type, numeric_list<int, 0, 1>>::value));
175 VERIFY((is_same<typename take<3, il>::type, numeric_list<int, 0, 1, 2>>::value));
176 VERIFY((is_same<typename take<4, il>::type, numeric_list<int, 0, 1, 2, 3>>::value));
177 VERIFY((is_same<typename take<5, il>::type, numeric_list<int, 0, 1, 2, 3, 4>>::value));
178 VERIFY((is_same<typename take<6, il>::type, numeric_list<int, 0, 1, 2, 3, 4, 5>>::value));
188 VERIFY((is_same<typename skip<0, il>::type, numeric_list<int, 0, 1, 2, 3, 4, 5>>::value));
189 VERIFY((is_same<typename skip<1, il>
205 typedef numeric_list<int, 4, 8, 15, 16, 23, 42> il; typedef
[all...]
/external/emma/lib/
H A Demma.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/vladium/ com/vladium/app/ com/vladium/app/IAppVersion ...
/external/fio/
H A Doptions.c1326 static int str_buffer_compress_cb(void *data, unsigned long long *il) argument
1331 td->o.compress_percentage = *il;
1335 static int str_dedupe_cb(void *data, unsigned long long *il) argument
1340 td->o.dedupe_percentage = *il;
1368 static int str_gtod_reduce_cb(void *data, int *il) argument
1371 int val = *il;
H A Dparse.c475 int il=0, *ilp; local
808 ret = check_int(ptr, &il);
812 il = 1;
814 dprint(FD_PARSE, " ret=%d, out=%d\n", ret, il);
819 if (o->maxval && il > (int) o->maxval) {
821 il, o->maxval);
824 if (o->minval && il < o->minval) {
826 il, o->minval);
831 il = !il;
[all...]
/external/google-benchmark/test/
H A Doutput_test_helper.cc343 int AddCases(TestCaseID ID, std::initializer_list<TestCase> il) { argument
345 L.insert(L.end(), il);
350 std::initializer_list<std::pair<std::string, std::string>> il) {
352 for (auto KV : il) {
349 SetSubstitutions( std::initializer_list<std::pair<std::string, std::string>> il) argument
/external/icu/icu4c/source/test/cintltst/
H A Dutf8tst.c1051 int32_t i, j, k, iu, is, il, length; local
1066 il=j;
1082 if(is!=iu || il!=iu) {
1103 il=j;
1119 if(is!=iu || il !=iu) {
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dmax_element.pass.cpp64 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
70 constexpr auto p = std::max_element(il,il+8);
H A Dmax_element_comp.pass.cpp83 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
90 constexpr auto p = std::max_element(il, il+8, less());
H A Dmin_element.pass.cpp64 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
70 constexpr auto p = std::min_element(il, il+8);
H A Dmin_element_comp.pass.cpp83 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
90 constexpr auto p = std::min_element(il, il+8, less());
H A Dminmax_element.pass.cpp81 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
87 constexpr auto p = std::minmax_element(il, il+8);
H A Dminmax_element_comp.pass.cpp87 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
94 constexpr auto p = std::minmax_element(il, il+8, less());
H A Dminmax_init_list_comp.pass.cpp29 void test_all_equal(std::initializer_list<int> il) argument
32 std::pair<int, int> p = std::minmax(il, std::ref(pred));
33 const int *ptr = il.end();
34 assert(p.first == *il.begin());
36 assert(pred.count() <= ((3 * il.size()) / 2));
/external/libcxx/test/std/containers/
H A Dmap_allocator_requirement_test_templates.h109 std::initializer_list<ValueTp> il = { ValueTp(1, 1), ValueTp(2, 1) }; local
111 c.insert(il);
115 c.insert(il);
670 std::initializer_list<ValueTp> il = { ValueTp(1, 1), ValueTp(2, 1) }; local
672 c.insert(il);
H A Dset_allocator_requirement_test_templates.h94 std::initializer_list<ValueTp> il = { ValueTp(1), ValueTp(2) }; local
96 c.insert(il);
100 c.insert(il);
322 std::initializer_list<ValueTp> il = { ValueTp(1), ValueTp(2) }; local
324 c.insert(il);
/external/libcxx/test/std/experimental/optional/optional.object/optional.object.assign/
H A Demplace_initializer_list.pass.cpp14 // void optional<T>::emplace(initializer_list<U> il, Args&&... args);
33 constexpr X(std::initializer_list<int> il) : i_(il.begin()[0]), j_(il.begin()[1]) {} argument
49 constexpr Y(std::initializer_list<int> il) : i_(il.begin()[0]), j_(il.begin()[1]) {} argument
63 Z(std::initializer_list<int> il) : i_(il.begin()[0]), j_(il argument
[all...]
/external/libcxx/test/std/experimental/optional/optional.object/optional.object.ctor/
H A Dinitializer_list.pass.cpp15 // explicit optional(in_place_t, initializer_list<U> il, Args&&... args);
50 constexpr Y(std::initializer_list<int> il) : i_(il.begin()[0]), j_(il.begin()[1]) {} argument
63 Z(std::initializer_list<int> il) : i_(il.begin()[0]), j_(il.begin()[1]) argument

Completed in 1584 milliseconds

123