| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/distutils/ |
| H A D | filelist.py | 58 def sort(self):
member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| H A D | heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
204 result.sort(reverse=True)
288 # The total compares needed by list.sort() on the same lists were 8627,
290 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
436 sort variable
[all...] |
| H A D | UserList.py | 83 def sort(self, *args, **kwds): self.data.sort(*args, **kwds)
member in class:UserList
|
| H A D | imaplib.py | 688 def sort(self, sort_criteria, charset, *search_criteria):
member in class:IMAP4
691 (typ, [data]) = <instance>.sort(sort_criteria, charset, search_criteria, ...)
|
| /device/sample/apps/LeanbackCustomizer/src/com/google/android/leanbacklauncher/partnercustomizer/ |
| H A D | PartnerReceiver.java | 82 int sort;
90 sort = 1;
97 sort = 2;
107 postNotification(sort, resId, backupResId, titleId, backupTitleId, pkgName);
110 private void postNotification(int sort, int resId, int backupResId, argument
131 .setSortKey(sort+"")
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
| H A D | ltablib.c | 187 /* sort elements a[l], a[(l+u)/2] and a[u] */
213 /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */
247 static int sort (lua_State *L) {
function
269 {"sort", sort},
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| H A D | heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() i
479 sort = [] variable
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/classes/ |
| H A D | bitvec.py | 153 def sort(self):
member in class:BitVec
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Enquire/ |
| H A D | Enquire.c | 723 Void f_define ARGS((char *desc, char *extra, char *sort, char *name,
725 Void i_define ARGS((char *desc, char *extra, char *sort, char *name,
727 Void u_define ARGS((char *desc, char *extra, char *sort, char *name,
1247 char *sort,
1258 printf("#define %s%s %ld%s\n", sort, name, val, mark);
1264 sort, name, -lim, mark, val+lim, mark);
1266 printf("#define %s%s (%ld%s)\n", sort, name, val, mark);
1284 char *sort,
1293 printf("#define %s%s %lu%s%s\n", sort, name, val, U, mark);
1305 char *sort,
1244 i_define( char *desc, char *extra, char *sort, char *name, long val, long lim, long req, char *mark ) argument
1281 u_define( char *desc, char *extra, char *sort, char *name, ulong val, ulong req, char *mark ) argument
1302 f_define( char *desc, char *extra, char *sort, char *name, int precision, Long_double val, char *mark ) argument
[all...] |