| /external/libcxx/test/std/containers/sequences/list/list.cons/ |
| deduct.pass.cpp | 39 std::list lst(std::begin(arr), std::end(arr));
41 static_assert(std::is_same_v<decltype(lst), std::list<int>>, "");
42 assert(std::equal(lst.begin(), lst.end(), std::begin(arr), std::end(arr)));
47 std::list lst(std::begin(arr), std::end(arr), std::allocator<long>());
48 static_assert(std::is_same_v<decltype(lst)::value_type, long>, "");
49 assert(lst.size() == 4);
50 auto it = lst.begin();
60 // std::list lst(std::allocator<int>()); // list (allocator &)
64 std::list lst(1, A{}); // list (size_type, T
[all...] |
| deduct.fail.cpp | 36 std::list lst((std::allocator<int>())); // expected-error {{no viable constructor or deduction guide for deduction of template arguments of 'list'}}
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/crashers/ |
| mutation_inside_cyclegc.py | 19 del lst[:]
25 lst = [str(i)]
30 while lst:
31 keepalive.append(lst[:])
|
| borrowed_ref_2.py | 32 lst = [None] * 1000000
variable
37 lst[i] = c.g # consume the free list of instancemethod objects
|
| /external/python/cpython2/Lib/test/crashers/ |
| mutation_inside_cyclegc.py | 19 del lst[:]
25 lst = [str(i)]
30 while lst:
31 keepalive.append(lst[:])
|
| borrowed_ref_2.py | 32 lst = [None] * 1000000 variable
37 lst[i] = c.g # consume the free list of instancemethod objects
|
| /external/python/cpython3/Lib/test/crashers/ |
| mutation_inside_cyclegc.py | 19 del lst[:]
25 lst = [str(i)]
30 while lst:
31 keepalive.append(lst[:])
|
| /external/grpc-grpc/tools/buildgen/plugins/ |
| expand_filegroups.py | 29 def uniquify(lst):
31 for el in lst:
61 for lst in FILEGROUP_LISTS:
62 fg[lst] = fg.get(lst, [])
63 fg['own_%s' % lst] = list(fg[lst])
95 for lst in FILEGROUP_LISTS:
96 vals = cur.get(lst, [])
97 vals.extend(filegroups[uses].get(lst, []))
[all...] |
| /external/u-boot/fs/ubifs/ |
| master.c | 181 if (c->lst.empty_lebs < 0 || c->lst.empty_lebs > c->main_lebs - 2) {
186 if (c->lst.idx_lebs < 0 || c->lst.idx_lebs > c->main_lebs - 1) {
191 if (c->lst.total_free < 0 || c->lst.total_free > main_sz ||
192 c->lst.total_free & 7) {
197 if (c->lst.total_dirty < 0 || (c->lst.total_dirty & 7)) {
202 if (c->lst.total_used < 0 || (c->lst.total_used & 7))
[all...] |
| lprops.c | 540 ubifs_assert(c->lst.empty_lebs >= 0 &&
541 c->lst.empty_lebs <= c->main_lebs);
544 ubifs_assert(c->lst.taken_empty_lebs >= 0);
545 ubifs_assert(c->lst.taken_empty_lebs <= c->lst.empty_lebs);
546 ubifs_assert(!(c->lst.total_free & 7) && !(c->lst.total_dirty & 7));
547 ubifs_assert(!(c->lst.total_dead & 7) && !(c->lst.total_dark & 7));
548 ubifs_assert(!(c->lst.total_used & 7))
1260 struct ubifs_lp_stats lst; local
[all...] |
| /external/fonttools/Lib/fontTools/varLib/ |
| merger.py | 61 def mergeObjects(self, out, lst, exclude=()):
63 assert all(keys == sorted(vars(v).keys()) for v in lst), \
64 (keys, [sorted(vars(v).keys()) for v in lst])
71 values = [getattr(table, key) for table in lst]
78 def mergeLists(self, out, lst):
79 assert allEqualTo(out, lst, len), (len(out), [len(v) for v in lst])
80 for i,(value,values) in enumerate(zip(out, zip(*lst))):
87 def mergeThings(self, out, lst):
89 assert allEqualTo(out, lst, type), (out, lst
[all...] |
| /external/fonttools/Lib/fontTools/ |
| merge.py | 45 def equal(lst):
46 lst = list(lst)
47 t = iter(lst)
49 assert all(item == first for item in t), "Expected all items to be equal: %s" % lst
52 def first(lst):
53 return next(iter(lst))
55 def recalculate(lst):
58 def current_time(lst):
61 def bitwise_and(lst)
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/json/tests/ |
| test_check_circular.py | 14 lst = []
15 lst.append(lst)
16 self.assertRaises(ValueError, self.dumps, lst)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/json/tests/ |
| test_check_circular.py | 14 lst = []
15 lst.append(lst)
16 self.assertRaises(ValueError, self.dumps, lst)
|
| /external/python/cpython2/Demo/turtle/ |
| tdemo_tree.py | 28 lst = []
34 lst.append(p)
35 lst.append(q)
36 for x in tree(lst, l*f, a, f):
|
| /external/python/cpython2/Lib/json/tests/ |
| test_check_circular.py | 14 lst = []
15 lst.append(lst)
16 self.assertRaises(ValueError, self.dumps, lst)
|
| /external/python/cpython3/Lib/turtledemo/ |
| tree.py | 28 lst = []
34 lst.append(p)
35 lst.append(q)
36 for x in tree(lst, l*f, a, f):
|
| /external/catch2/scripts/ |
| benchmarkCompile.py | 8 def median(lst):
9 lst = sorted(lst)
10 mid, odd = divmod(len(lst), 2)
12 return lst[mid]
14 return (lst[mid - 1] + lst[mid]) / 2.0
16 def mean(lst):
17 return float(sum(lst)) / max(len(lst), 1
[all...] |
| /external/python/cpython3/Modules/ |
| _queuemodule.c | 20 PyObject *lst; member in struct:__anon37266
36 Py_XDECREF(self->lst);
45 Py_VISIT(self->lst);
65 self->lst = PyList_New(0);
73 if (self->lst == NULL) {
101 if (PyList_Append(self->lst, item) < 0)
136 n = PyList_GET_SIZE(self->lst);
139 item = PyList_GET_ITEM(self->lst, self->lst_pos);
141 PyList_SET_ITEM(self->lst, self->lst_pos, Py_None);
146 if (PyList_SetSlice(self->lst, 0, self->lst_pos, NULL))
[all...] |
| /external/skia/tools/skqp/ |
| gn_to_bp.py | 140 def strip_slashes(lst):
141 return {str(p.lstrip('/')) for p in lst}
175 def bpfmt(indent, lst, sort=True):
177 lst = sorted(lst)
178 return ('\n' + ' '*indent).join('"%s",' % v for v in lst)
|
| /external/skqp/tools/skqp/ |
| gn_to_bp.py | 142 def strip_slashes(lst):
143 return {str(p.lstrip('/')) for p in lst}
177 def bpfmt(indent, lst, sort=True):
179 lst = sorted(lst)
180 return ('\n' + ' '*indent).join('"%s",' % v for v in lst)
|
| /external/scapy/scapy/modules/ |
| voip.py | 48 def voip_play(s1, lst=None, **kargs):
56 :param lst: (optional) A list of packets to load
58 :type lst: list
65 >>> voip_play("64.2.142.189", lst)
87 if lst is None:
90 for p in lst:
96 def voip_play1(s1, lst=None, **kargs):
99 return voip_play(s1, lst, **kargs)
133 def voip_play3(lst=None,**kargs):
146 if lst is None
[all...] |
| /external/python/cpython3/Lib/test/ |
| test_index.py | 169 lst = list('ab!cdefghi!j')
170 del lst[self.o]
171 del lst[self.n]
172 lst[self.o] = 'X'
173 lst[self.n] = 'Y'
174 self.assertEqual(lst, list('abYdefghXj'))
176 lst = [5, 6, 7, 8, 9, 10, 11]
177 lst.__setitem__(self.n, "here")
178 self.assertEqual(lst, [5, 6, "here", 8, 9, 10, 11])
179 lst.__delitem__(self.n
[all...] |
| /external/deqp/modules/gles3/scripts/ |
| genutil.py | 105 def shuffled(lst):
106 tmp = lst[:]
110 def repeatToLength(lst, toLength):
111 return (toLength / len(lst)) * lst + lst[: toLength % len(lst)]
115 def toFloat(lst): return [Scalar(float(v.x)) for v in lst]
116 def toInt(lst): return [Scalar(int(v.x)) for v in lst
[all...] |
| /external/deqp/modules/gles31/scripts/ |
| genutil.py | 105 def shuffled(lst):
106 tmp = lst[:]
110 def repeatToLength(lst, toLength):
111 return (toLength / len(lst)) * lst + lst[: toLength % len(lst)]
115 def toFloat(lst): return [Scalar(float(v.x)) for v in lst]
116 def toInt(lst): return [Scalar(int(v.x)) for v in lst
[all...] |
