HomeSort by relevance Sort by last modified time
    Searched refs:newitem (Results 1 - 16 of 16) sorted by null

  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
_heapqmodule.c 38 PyObject *newitem, *parent; local
48 newitem = PyList_GET_ITEM(heap, pos);
49 Py_INCREF(newitem);
51 a place newitem fits. */
55 cmp = cmp_lt(newitem, parent);
57 Py_DECREF(newitem);
68 PyList_SET_ITEM(heap, pos, newitem);
77 PyObject *newitem, *tmp; local
86 newitem = PyList_GET_ITEM(heap, pos);
87 Py_INCREF(newitem);
377 PyObject *newitem, *parent; local
416 PyObject *newitem, *tmp; local
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/
_heapqmodule.c 38 PyObject *newitem, *parent; local
50 a place newitem fits. */
51 newitem = PyList_GET_ITEM(heap, pos);
55 cmp = cmp_lt(newitem, parent);
66 newitem = PyList_GET_ITEM(heap, pos);
67 PyList_SET_ITEM(heap, parentpos, newitem);
376 PyObject *newitem, *parent; local
386 newitem = PyList_GET_ITEM(heap, pos);
387 Py_INCREF(newitem);
389 a place newitem fits. */
415 PyObject *newitem, *tmp; local
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/
heapq.py 243 newitem = heap[pos]
245 # newitem fits.
249 if cmp_lt(newitem, parent):
254 heap[pos] = newitem
261 # We *could* break out of the loop as soon as we find a pos where newitem <=
298 newitem = heap[pos]
310 # The leaf at pos is empty now. Put newitem there, and bubble it up
312 heap[pos] = newitem
317 newitem = heap[pos]
319 # newitem fits.
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/
heapq.py 243 newitem = heap[pos]
245 # newitem fits.
249 if cmp_lt(newitem, parent):
254 heap[pos] = newitem
261 # We *could* break out of the loop as soon as we find a pos where newitem <=
298 newitem = heap[pos]
310 # The leaf at pos is empty now. Put newitem there, and bubble it up
312 heap[pos] = newitem
317 newitem = heap[pos]
319 # newitem fits
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/
heapq.py 243 newitem = heap[pos]
245 # newitem fits.
249 if cmp_lt(newitem, parent):
254 heap[pos] = newitem
261 # We *could* break out of the loop as soon as we find a pos where newitem <=
298 newitem = heap[pos]
310 # The leaf at pos is empty now. Put newitem there, and bubble it up
312 heap[pos] = newitem
317 newitem = heap[pos]
319 # newitem fits
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
heapq.py 243 newitem = heap[pos]
245 # newitem fits.
249 if cmp_lt(newitem, parent):
254 heap[pos] = newitem
261 # We *could* break out of the loop as soon as we find a pos where newitem <=
298 newitem = heap[pos]
310 # The leaf at pos is empty now. Put newitem there, and bubble it up
312 heap[pos] = newitem
317 newitem = heap[pos]
319 # newitem fits
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
heapq.py 243 newitem = heap[pos]
245 # newitem fits.
249 if cmp_lt(newitem, parent):
254 heap[pos] = newitem
261 # We *could* break out of the loop as soon as we find a pos where newitem <=
298 newitem = heap[pos]
310 # The leaf at pos is empty now. Put newitem there, and bubble it up
312 heap[pos] = newitem
317 newitem = heap[pos]
319 # newitem fits
    [all...]
  /external/vulkan-validation-layers/loader/
cJSON.c 1119 void cJSON_InsertItemInArray(cJSON *array, int which, cJSON *newitem) {
1124 cJSON_AddItemToArray(array, newitem);
1127 newitem->next = c;
1128 newitem->prev = c->prev;
1129 c->prev = newitem;
1131 array->child = newitem;
1133 newitem->prev->next = newitem;
1135 void cJSON_ReplaceItemInArray(cJSON *array, int which, cJSON *newitem) {
1141 newitem->next = c->next
1275 cJSON *newitem, *cptr, *nptr = 0, *newchild; local
    [all...]
cJSON.h 144 cJSON *newitem); /* Shifts pre-existing items to the right. */
145 extern void cJSON_ReplaceItemInArray(cJSON *array, int which, cJSON *newitem);
147 cJSON *newitem);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
heapq.py 241 newitem = heap[pos]
243 # newitem fits.
247 if cmp_lt(newitem, parent):
252 heap[pos] = newitem
259 # We *could* break out of the loop as soon as we find a pos where newitem <=
296 newitem = heap[pos]
308 # The leaf at pos is empty now. Put newitem there, and bubble it up
310 heap[pos] = newitem
  /external/fonttools/Lib/fontTools/misc/
psLib.py 308 newitem = {}
310 newitem[key] = unpack_item(value)
312 newitem = [None] * len(item.value)
314 newitem[i] = unpack_item(item.value[i])
316 newitem = tuple(newitem)
318 newitem = item.value
319 return newitem
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/
tupleobject.c 136 PyTuple_SetItem(register PyObject *op, register Py_ssize_t i, PyObject *newitem)
141 Py_XDECREF(newitem);
146 Py_XDECREF(newitem);
153 *p = newitem;
listobject.c 200 register PyObject *newitem)
205 Py_XDECREF(newitem);
210 Py_XDECREF(newitem);
217 *p = newitem;
256 PyList_Insert(PyObject *op, Py_ssize_t where, PyObject *newitem)
262 return ins1((PyListObject *)op, where, newitem);
286 PyList_Append(PyObject *op, PyObject *newitem)
288 if (PyList_Check(op) && (newitem != NULL))
289 return app1((PyListObject *)op, newitem);
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/
tupleobject.c 136 PyTuple_SetItem(register PyObject *op, register Py_ssize_t i, PyObject *newitem)
141 Py_XDECREF(newitem);
146 Py_XDECREF(newitem);
153 *p = newitem;
listobject.c 200 register PyObject *newitem)
205 Py_XDECREF(newitem);
210 Py_XDECREF(newitem);
217 *p = newitem;
256 PyList_Insert(PyObject *op, Py_ssize_t where, PyObject *newitem)
262 return ins1((PyListObject *)op, where, newitem);
286 PyList_Append(PyObject *op, PyObject *newitem)
288 if (PyList_Check(op) && (newitem != NULL))
289 return app1((PyListObject *)op, newitem);
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/bgen/bgen/
scantools.py 712 newitem = [item[0], item[1], item[2]]
715 newitem[i] = old[k][i]
718 newitem[i] = old[index][i]
719 new.append(tuple(newitem))

Completed in 1379 milliseconds