Home
last modified time | relevance | path

Searched refs:elements (Results 1 – 25 of 42) sorted by relevance

12

/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/dlg/
Ddlg.r11 { /* array dialogs: 1 elements */
16 { /* array itemArray: 18 elements */
32 { /* array OrArray: 1 elements */
74 { /* array TypesArray: 1 elements */
82 { /* array OrArray: 1 elements */
102 { /* array OrArray: 2 elements */
172 { /* array radioArray: 3 elements */
250 { /* array AndArray: 2 elements */
Doutput.c369 char *minsize(int elements) in minsize() argument
371 char *minsize(elements) in minsize()
372 int elements; in minsize()
377 while ((unsigned long) elements > typesize[i]) /* MR20 */
Ddlg_p.g51 set normal_chars; /* mask to get rid elements that aren't used
458 static int nfa_size=0; /* elements nfa_array[] can hold */
536 /* print out all the elements in the set */
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
Dantlr.r11 { /* array dialogs: 5 elements */
16 { /* array itemArray: 12 elements */
51 { /* array MultiTypesArray: 1 elements */
171 { /* array itemArray: 15 elements */
388 { /* array itemArray: 12 elements */
394 { /* array radioArray: 3 elements */
424 { /* array radioArray: 3 elements */
551 { /* array itemArray: 7 elements */
639 { /* array OrArray: 1 elements */
659 { /* array itemArray: 9 elements */
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Include/
Dasdl.h22 void *elements[1]; member
27 int elements[1]; member
33 #define asdl_seq_GET(S, I) (S)->elements[(I)]
39 (S)->elements[_asdl_i] = (V); \
42 #define asdl_seq_SET(S, I, V) (S)->elements[I] = (V)
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Include/
Dasdl.h22 void *elements[1]; member
27 int elements[1]; member
33 #define asdl_seq_GET(S, I) (S)->elements[(I)]
39 (S)->elements[_asdl_i] = (V); \
42 #define asdl_seq_SET(S, I, V) (S)->elements[I] = (V)
/device/linaro/bootloader/edk2/QuarkPlatformPkg/Acpi/AcpiTables/Dsdt/
DPciIrq.asi63 // Define references to buffer elements
129 // Define references to buffer elements
195 // Define references to buffer elements
259 // Define references to buffer elements
325 // Define references to buffer elements
391 // Define references to buffer elements
457 // Define references to buffer elements
521 // Define references to buffer elements
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/
Dlistsort.txt63 %sort: ascending, then randomly replace 1% of elements w/ random values
160 ~sort: samplesort's special cases for large masses of equal elements are
200 selection of elements to replace is expected to produce an out-of-order
205 true if the new random elements were prefixed to the sorted list instead,
215 count_run() returns the # of elements in the next run. A run is either
229 run. Reversal is done via the obvious fast "swap elements starting at each
231 the slice contains any equal elements. Using a strict definition of
232 descending ensures that a descending run contains distinct elements.
235 run contains less than minrun elements (see next section), the main loop
236 artificially boosts it to minrun elements, via a stable binary insertion sort
[all …]
Dmemoryobject.c177 Py_ssize_t elements; in _indirect_copy_nd() local
195 elements = 1; in _indirect_copy_nd()
197 elements *= view->shape[k]; in _indirect_copy_nd()
205 while (elements--) { in _indirect_copy_nd()
Dabstract.c487 Py_ssize_t *indices, elements; in PyBuffer_ToContiguous() local
522 elements = len / view->itemsize; in PyBuffer_ToContiguous()
523 while (elements--) { in PyBuffer_ToContiguous()
538 Py_ssize_t *indices, elements; in PyBuffer_FromContiguous() local
573 elements = len / view->itemsize; in PyBuffer_FromContiguous()
574 while (elements--) { in PyBuffer_FromContiguous()
589 Py_ssize_t *indices, elements; in PyObject_CopyData() local
638 elements = 1; in PyObject_CopyData()
641 elements *= view_src.shape[k]; in PyObject_CopyData()
643 while (elements--) { in PyObject_CopyData()
Ddictnotes.txt9 Typically, one read and one write for 1 to 3 elements.
13 Dictionaries vary in size with 8 to 16 elements being common.
19 Dictionaries vary in size. 4 to 10 elements are common.
36 * Counting elements in a sequence.
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/
Dxmllib.py93 elements = {} # default, to be overridden variable in XMLParser
119 self.elements = {}
132 start, end = self.elements.get(tag, (None, None))
134 self.elements[tag] = getattr(self, key), end
137 start, end = self.elements.get(tag, (None, None))
139 self.elements[tag] = start, getattr(self, key)
155 if self.elements is XMLParser.elements:
180 del self.elements
666 method = self.elements.get(nstag, (None, None))[0]
729 method = self.elements.get(nstag, (None, None))[1]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
Dxmllib.py93 elements = {} # default, to be overridden variable in XMLParser
119 self.elements = {}
132 start, end = self.elements.get(tag, (None, None))
134 self.elements[tag] = getattr(self, key), end
137 start, end = self.elements.get(tag, (None, None))
139 self.elements[tag] = start, getattr(self, key)
155 if self.elements is XMLParser.elements:
180 del self.elements
666 method = self.elements.get(nstag, (None, None))[0]
729 method = self.elements.get(nstag, (None, None))[1]
Dsets.py96 elements = self._data.keys()
98 elements.sort()
99 return '%s(%r)' % (self.__class__.__name__, elements)
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
Dtest_collections.py631 self.assertEqual(''.join(sorted(c.elements())), 'aaabbc')
640 self.assertEqual(''.join(sorted(c.elements())), 'aaaaffff')
704 self.assertEqual(sorted(Counter(s).elements()), sorted(s))
720 elements = 'abcd'
723 p = Counter(dict((elem, randrange(-2,4)) for elem in elements))
725 q = Counter(dict((elem, randrange(-2,4)) for elem in elements))
734 for x in elements:
740 elements = 'abcdef'
743 p = Counter(dict((elem, randrange(0, 2)) for elem in elements))
744 q = Counter(dict((elem, randrange(0, 2)) for elem in elements))
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/
Dlistsort.txt157 ~sort: samplesort's special cases for large masses of equal elements are
197 selection of elements to replace is expected to produce an out-of-order
202 true if the new random elements were prefixed to the sorted list instead,
212 count_run() returns the # of elements in the next run. A run is either
226 run. Reversal is done via the obvious fast "swap elements starting at each
228 the slice contains any equal elements. Using a strict definition of
229 descending ensures that a descending run contains distinct elements.
232 run contains less than minrun elements (see next section), the main loop
233 artificially boosts it to minrun elements, via a stable binary insertion sort
234 applied to the right number of array elements following the short natural
[all …]
Dmemoryobject.c177 Py_ssize_t elements; in _indirect_copy_nd() local
195 elements = 1; in _indirect_copy_nd()
197 elements *= view->shape[k]; in _indirect_copy_nd()
205 while (elements--) { in _indirect_copy_nd()
Dabstract.c487 Py_ssize_t *indices, elements; in PyBuffer_ToContiguous() local
522 elements = len / view->itemsize; in PyBuffer_ToContiguous()
523 while (elements--) { in PyBuffer_ToContiguous()
538 Py_ssize_t *indices, elements; in PyBuffer_FromContiguous() local
573 elements = len / view->itemsize; in PyBuffer_FromContiguous()
574 while (elements--) { in PyBuffer_FromContiguous()
589 Py_ssize_t *indices, elements; in PyObject_CopyData() local
638 elements = 1; in PyObject_CopyData()
641 elements *= view_src.shape[k]; in PyObject_CopyData()
643 while (elements--) { in PyObject_CopyData()
Ddictnotes.txt9 Typically, one read and one write for 1 to 3 elements.
13 Dictionaries vary in size with 8 to 16 elements being common.
19 Dictionaries vary in size. 4 to 10 elements are common.
36 * Counting elements in a sequence.
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/compiler/
Dmisc.py20 def elements(self): member in Set
/device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/
DBaseOrderedCollectionRedBlackTreeLib.uni9 // Max(), Insert(), and Delete(), where "n" is the number of elements in the
DBaseOrderedCollectionRedBlackTreeLib.inf8 # Max(), Insert(), and Delete(), where "n" is the number of elements in the
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/
DREADME86 If you wish to create a library from elements of pccts/h:
94 For C++ users place the following elements in the library:
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/
DREADME74 If you wish to create a library from elements of pccts/h:
82 For C++ users place the following elements in the library:
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/unittest/
Dcase.py668 elements = (seq_type_name.capitalize(), seq1_repr, seq2_repr)
669 differing = '%ss differ: %s != %s\n' % elements

12