| /external/libcxx/test/libcxx/strings/basic.string/string.modifiers/ |
| erase_iter_db1.pass.cpp | 29 std::string l1("123");
30 std::string::const_iterator i = l1.end();
31 l1.erase(i);
37 S l1("123");
38 S::const_iterator i = l1.end();
39 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 29 std::string l1("123");
31 std::string::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
37 S l1("123");
39 S::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
| erase_iter_iter_db2.pass.cpp | 29 std::string l1("123");
31 std::string::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
37 S l1("123");
39 S::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
| /external/libffi/testsuite/libffi.call/ |
| return_sl.c | 9 static long return_sl(long l1, long l2)
11 return l1 - l2;
20 unsigned long l1, l2; local
24 values[0] = &l1;
30 l1 = 1073741823L;
34 printf("res: %ld, %ld\n", (long)res, l1 - l2);
|
| /external/python/cpython2/Modules/_ctypes/libffi/testsuite/libffi.call/ |
| return_sl.c | 9 static long return_sl(long l1, long l2)
11 return l1 - l2;
20 unsigned long l1, l2; local
24 values[0] = &l1;
30 l1 = 1073741823L;
34 printf("res: %ld, %ld\n", (long)res, l1 - l2);
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| tree_helper.h | 33 const float l1, const float l2,
36 // The formula for weight is -(g+l1*sgn(w))/(H+l2), for gain it is
37 // (g+l1*sgn(w))^2/(h+l2).
39 // 1/2(h+l2)*w^2+g*w+l1*abs(w)
41 // Apply L1 regularization.
42 // 1) Assume w>0 => w=-(g+l1)/(h+l2)=> g+l1 < 0 => g < -l1
43 // 2) Assume w<0 => w=-(g-l1)/(h+l2)=> g-l1 > 0 => g > l
[all...] |
| /external/libcxx/test/std/thread/thread.mutex/thread.lock.algorithm/ |
| lock.pass.cpp | 19 // template <class L1, class L2, class... L3>
20 // void lock(L1&, L2&, L3&...);
50 class L1
55 L1() : locked_(false) {}
100 L0 l1; local
101 std::lock(l0, l1);
103 assert(l1.locked());
107 L1 l1; local
108 std::lock(l0, l1);
114 L0 l1; local
122 L2 l1; local
136 L0 l1; local
150 L2 l1; local
164 L1 l1; local
178 L2 l1; local
194 L0 l1; local
204 L2 l1; local
221 L0 l1; local
230 L1 l1; local
239 L0 l1; local
249 L0 l1; local
265 L2 l1; local
281 L0 l1; local
297 L2 l1; local
313 L0 l1; local
329 L2 l1; local
345 L2 l1; local
361 L1 l1; local
377 L2 l1; local
394 L0 l1; local
405 L0 l1; local
416 L0 l1; local
427 L1 l1; local
438 L0 l1; local
450 L0 l1; local
468 L0 l1; local
486 L2 l1; local
504 L0 l1; local
[all...] |
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| erase_iter_iter_db4.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| erase_iter_db1.pass.cpp | 26 std::unordered_map<int, int> l1(a1, a1+3);
27 std::unordered_map<int, int>::const_iterator i = l1.end();
28 l1.erase(i);
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_iter_iter_db4.pass.cpp | 28 std::unordered_multimap<int, int> l1(a1, a1+3);
29 std::unordered_multimap<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| erase_iter_db1.pass.cpp | 26 std::unordered_multimap<int, int> l1(a1, a1+3);
27 std::unordered_multimap<int, int>::const_iterator i = l1.end();
28 l1.erase(i);
|
| /external/libcxx/test/libcxx/containers/sequences/list/list.cons/ |
| db_move.pass.cpp | 31 std::list<int> l1 = {1, 2, 3}; local
32 std::list<int>::iterator i = l1.begin();
33 std::list<int> l2 = std::move(l1);
|
| /external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/ |
| erase_iter_db1.pass.cpp | 27 std::list<int> l1(a1, a1+3);
28 std::list<int>::const_iterator i = l1.end();
29 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 27 std::list<int> l1(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 27 std::list<int> l1(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| erase_iter_db1.pass.cpp | 25 std::unordered_multiset<int> l1(a1, a1+3);
26 std::unordered_multiset<int>::const_iterator i = l1.end();
27 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| erase_iter_db1.pass.cpp | 25 std::unordered_set<int> l1(a1, a1+3);
26 std::unordered_set<int>::const_iterator i = l1.end();
27 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| /external/boringssl/src/decrepit/ |
| macros.h | 64 #define n2ln(c, l1, l2, n) \
67 l1 = l2 = 0; \
82 l1 = ((unsigned long)(*(--(c)))); \
85 l1 |= ((unsigned long)(*(--(c)))) << 8; \
88 l1 |= ((unsigned long)(*(--(c)))) << 16; \
91 l1 |= ((unsigned long)(*(--(c)))) << 24; \
96 #define l2nn(l1, l2, c, n) \
113 *(--(c)) = (unsigned char)(((l1)) & 0xff); \
116 *(--(c)) = (unsigned char)(((l1) >> 8) & 0xff); \
119 *(--(c)) = (unsigned char)(((l1) >> 16) & 0xff);
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| insert_iter_size_value.pass.cpp | 28 List l1(a1, a1+3);
29 typename List::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
30 assert(i == next(l1.begin()));
31 assert(l1 == List(a2, a2+8));
37 i = l1.insert(i, 5, 5);
44 assert(l1 == List(a2, a2+8));
|
| /external/llvm/test/MC/ELF/ |
| subsection.s | 20 l1: label
23 .subsection l2-l1
24 .byte l1-l0
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/MC/ELF/ |
| subsection.s | 20 l1: label
23 .subsection l2-l1
24 .byte l1-l0
|
