Home
last modified time | relevance | path

Searched refs:elem (Results 1 – 25 of 78) sorted by relevance

1234

/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/xml/etree/
DElementPath.py99 for elem in result:
100 for e in elem:
107 for elem in result:
108 for e in elem:
114 for elem in result:
115 yield elem
127 for elem in result:
128 for e in elem.iter(tag):
129 if e is not elem:
138 for elem in result:
[all …]
DElementInclude.py99 def include(elem, loader=None): argument
104 while i < len(elem):
105 e = elem[i]
119 elem[i] = node
127 node = elem[i-1]
130 elem.text = (elem.text or "") + text + (e.tail or "")
131 del elem[i]
DElementTree.py107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag:
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/xml/etree/
DElementPath.py99 for elem in result:
100 for e in elem:
107 for elem in result:
108 for e in elem:
114 for elem in result:
115 yield elem
127 for elem in result:
128 for e in elem.iter(tag):
129 if e is not elem:
138 for elem in result:
[all …]
DElementInclude.py98 def include(elem, loader=None): argument
103 while i < len(elem):
104 e = elem[i]
118 elem[i] = node
126 node = elem[i-1]
129 elem.text = (elem.text or "") + text + (e.tail or "")
130 del elem[i]
DElementTree.py107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag:
[all …]
/device/google/contexthub/firmware/os/algos/common/math/
Dmat.c48 memset(A->elem, 0.0f, sizeof(A->elem)); in initZeroMatrix()
58 A->elem[i][i] = x; in initDiagonalMatrix()
68 A->elem[0][0] = v1->x; in initMatrixColumns()
69 A->elem[0][1] = v2->x; in initMatrixColumns()
70 A->elem[0][2] = v3->x; in initMatrixColumns()
72 A->elem[1][0] = v1->y; in initMatrixColumns()
73 A->elem[1][1] = v2->y; in initMatrixColumns()
74 A->elem[1][2] = v3->y; in initMatrixColumns()
76 A->elem[2][0] = v1->z; in initMatrixColumns()
77 A->elem[2][1] = v2->z; in initMatrixColumns()
[all …]
Dquat.c22 float Hx = R->elem[0][0]; in initQuat()
23 float My = R->elem[1][1]; in initQuat()
24 float Az = R->elem[2][2]; in initQuat()
30 q->x = copysignf(q->x, R->elem[1][2] - R->elem[2][1]); in initQuat()
31 q->y = copysignf(q->y, R->elem[2][0] - R->elem[0][2]); in initQuat()
32 q->z = copysignf(q->z, R->elem[0][1] - R->elem[1][0]); in initQuat()
50 R->elem[0][0] = 1.0f - sq_q2 - sq_q3; in quatToMatrix()
51 R->elem[1][0] = q1_q2 - q3_q0; in quatToMatrix()
52 R->elem[2][0] = q1_q3 + q2_q0; in quatToMatrix()
53 R->elem[0][1] = q1_q2 + q3_q0; in quatToMatrix()
[all …]
Dkasa.c73 A.elem[0][0] = kasa->acc_xx; in kasaFit()
74 A.elem[0][1] = kasa->acc_xy; in kasaFit()
75 A.elem[0][2] = kasa->acc_xz; in kasaFit()
76 A.elem[0][3] = kasa->acc_x; in kasaFit()
77 A.elem[1][0] = kasa->acc_xy; in kasaFit()
78 A.elem[1][1] = kasa->acc_yy; in kasaFit()
79 A.elem[1][2] = kasa->acc_yz; in kasaFit()
80 A.elem[1][3] = kasa->acc_y; in kasaFit()
81 A.elem[2][0] = kasa->acc_xz; in kasaFit()
82 A.elem[2][1] = kasa->acc_yz; in kasaFit()
[all …]
Dmat.h45 float elem[3][3]; member
49 uint32_t elem[3]; member
53 float elem[4][4]; member
57 uint32_t elem[4]; member
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
Dtest_peepholer.py27 for elem in ('UNARY_NOT', 'POP_JUMP_IF_FALSE'):
28 self.assertNotIn(elem, asm)
32 for line, elem in (
39 self.assertIn(elem, asm)
47 for elem in ('LOAD_GLOBAL',):
48 self.assertNotIn(elem, asm)
49 for elem in ('LOAD_CONST', '(None)'):
50 self.assertIn(elem, asm)
64 for elem in ('LOAD_CONST', 'POP_JUMP_IF_FALSE'):
65 self.assertNotIn(elem, asm)
[all …]
Dtest_xml_etree.py69 def serialize(elem, to_string=True, **options): argument
72 tree = ET.ElementTree(elem)
80 def summarize(elem): argument
81 if elem.tag == ET.Comment:
83 return elem.tag
86 return [summarize(elem) for elem in seq]
89 for elem in tree.iter():
90 if elem.text:
91 elem.text = elem.text.replace("\r\n", "\n")
92 if elem.tail:
[all …]
Dtest_minidom.py70 elem = root.childNodes[0]
72 root.insertBefore(nelem, elem)
77 and root.childNodes[1] is elem
78 and root.childNodes.item(1) is elem
80 and root.lastChild is elem
87 and root.childNodes[1] is elem
88 and root.childNodes.item(1) is elem
92 and nelem.previousSibling is elem
167 elem = dom.createElement('element')
171 dom.appendChild(elem)
[all …]
Dtest_bisect.py113 for func, data, elem, expected in self.precomputedCases:
114 self.assertEqual(func(data, elem), expected)
115 self.assertEqual(func(UserList(data), elem), expected)
130 elem = randrange(-1, n+1)
131 ip = self.module.bisect_left(data, elem)
133 self.assertTrue(elem <= data[ip])
135 self.assertTrue(data[ip-1] < elem)
136 ip = self.module.bisect_right(data, elem)
138 self.assertTrue(elem < data[ip])
140 self.assertTrue(data[ip-1] <= elem)
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/unittest/
Dutil.py107 for i, elem in enumerate(s):
108 if elem is NULL:
112 if s[j] == elem:
116 if other_elem == elem:
120 diff = _Mismatch(cnt_s, cnt_t, elem)
123 for i, elem in enumerate(t):
124 if elem is NULL:
128 if t[j] == elem:
131 diff = _Mismatch(0, cnt_t, elem)
138 for elem in iterable:
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
Dcollections.py493 for elem, count in iterable.iteritems():
494 self[elem] = self_get(elem, 0) + count
499 for elem in iterable:
500 self[elem] = self_get(elem, 0) + 1
523 for elem, count in iterable.items():
524 self[elem] = self_get(elem, 0) - count
526 for elem in iterable:
527 self[elem] = self_get(elem, 0) - 1
538 def __delitem__(self, elem): argument
540 if elem in self:
[all …]
Dnntplib.py481 elem = line.split("\t")
483 xover_lines.append((elem[0],
484 elem[1],
485 elem[2],
486 elem[3],
487 elem[4],
488 elem[5].split(),
489 elem[6],
490 elem[7]))
539 elem = resp.split()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/
Dcollections.py548 for elem, count in iterable.iteritems():
549 self[elem] = self_get(elem, 0) + count
554 for elem in iterable:
555 self[elem] = self_get(elem, 0) + 1
586 for elem, count in iterable.items():
587 self[elem] = self_get(elem, 0) - count
589 for elem in iterable:
590 self[elem] = self_get(elem, 0) - 1
601 def __delitem__(self, elem): argument
603 if elem in self:
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/
D_heapqmodule.c293 PyObject *heap=NULL, *elem, *iterable, *sol, *it, *oldelem; in nlargest() local
309 elem = PyIter_Next(it); in nlargest()
310 if (elem == NULL) { in nlargest()
316 if (PyList_Append(heap, elem) == -1) { in nlargest()
317 Py_DECREF(elem); in nlargest()
320 Py_DECREF(elem); in nlargest()
331 elem = PyIter_Next(it); in nlargest()
332 if (elem == NULL) { in nlargest()
338 cmp = cmp_lt(sol, elem); in nlargest()
340 Py_DECREF(elem); in nlargest()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
D_heapqmodule.c294 PyObject *heap=NULL, *elem, *iterable, *sol, *it, *oldelem; in nlargest() local
310 elem = PyIter_Next(it); in nlargest()
311 if (elem == NULL) { in nlargest()
317 if (PyList_Append(heap, elem) == -1) { in nlargest()
318 Py_DECREF(elem); in nlargest()
321 Py_DECREF(elem); in nlargest()
332 elem = PyIter_Next(it); in nlargest()
333 if (elem == NULL) { in nlargest()
339 cmp = cmp_lt(sol, elem); in nlargest()
341 Py_DECREF(elem); in nlargest()
[all …]
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/lib/
Dsorlist.c64 e = (*cursor)->elem;
90 p->elem = e;
97 sentinel->elem = (char *)p; /* set tail pointer */
101 tail = (SList *) (*list)->elem; /* get tail pointer */
103 (*list)->elem = (char *) p; /* reset tail */
/device/google/contexthub/firmware/os/algos/
Dfusion.c234 out->elem[0][0] = diag; in matrixCross()
235 out->elem[1][1] = diag; in matrixCross()
236 out->elem[2][2] = diag; in matrixCross()
237 out->elem[1][0] = p->z; in matrixCross()
238 out->elem[0][1] = -p->z; in matrixCross()
239 out->elem[2][0] = -p->y; in matrixCross()
240 out->elem[0][2] = p->y; in matrixCross()
241 out->elem[2][1] = p->x; in matrixCross()
242 out->elem[1][2] = -p->x; in matrixCross()
309 O.elem[i][j] = O33.elem[i][j]; in fusionPredict()
[all …]
/device/linaro/bootloader/edk2/StdLib/Include/sys/
Dcallout.h78 struct callout *elem; member
83 struct callout *elem; member
87 #define cq_next_e cq_next.elem
88 #define cq_prev_e cq_prev.elem
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
Dbits.c260 if ( islower( *((char *)e->elem) ) ) /* is it a rule ref? (alias FIRST request) */
262 a = Efirst((char *)e->elem, p);
268 else if ( *((char *)e->elem)=='"' )
271 q = (TermEntry *) hash_get(Texpr, (char *) e->elem);
275 q = (TermEntry *) hash_get(Tname, *((char **)&(e->elem))=StripQuotes((char *)e->elem));
282 q = (TermEntry *) hash_get(Tname, (char *)e->elem);
285 if ( strcmp((char *)e->elem, TokenString(p->tok))==0 )
288 (char *)e->elem));
309 (char *)e->elem, TokenString(p->tok)));
350 p = (TCnode *) t->elem; in ComputeTokSets()
[all …]
/device/linaro/bootloader/edk2/BaseTools/Source/Python/TargetTool/
DTargetTool.py87 … print "%-30s = %s" % (Key, ''.join(elem + ' ' for elem in self.TargetTxtDictionary[Key]))
163 Line = "%-30s = %s\n" % (Key, ''.join(elem + ' ' for elem in self.Opt.TARGET))
165 Line = "%-30s = %s\n" % (Key, ''.join(elem + ' ' for elem in self.Opt.TARGET_ARCH))
238 for elem in opt.TARGET:
239 if elem == '0':
243 for elem in opt.TARGET_ARCH:
244 if elem == '0':

1234