Searched defs:sort (Results 1 - 25 of 218) sorted by relevance

123456789

/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/
H A Dtest_libc.py21 def sort(a, b): function in function:LibTest.test_qsort
25 lib.my_qsort(chars, len(chars)-1, sizeof(c_char), comparefunc(sort))
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/
H A Dtest_libc.py21 def sort(a, b): function in function:LibTest.test_qsort
25 lib.my_qsort(chars, len(chars)-1, sizeof(c_char), comparefunc(sort))
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/
H A Dfilelist.py58 def sort(self): member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/
H A Dfilelist.py58 def sort(self): member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
H A DUserList.py83 def sort(self, *args, **kwds): self.data.sort(*args, **kwds) member in class:UserList
H A Dheapq.py29 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
474 sort = [] variable
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/
H A DUserList.py83 def sort(self, *args, **kwds): self.data.sort(*args, **kwds) member in class:UserList
H A Dheapq.py29 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
474 sort = [] variable
[all...]
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
H A D_slist.h545 void sort() { function in class:slist
546 _M_non_dbg_impl.sort();
600 void sort(_StrictWeakOrdering __comp) function in class:slist
601 { _M_non_dbg_impl.sort(__comp); }
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
H A D_slist.h545 void sort() { function in class:slist
546 _M_non_dbg_impl.sort();
600 void sort(_StrictWeakOrdering __comp) function in class:slist
601 { _M_non_dbg_impl.sort(__comp); }
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
H A D_slist.h545 void sort() { function in class:slist
546 _M_non_dbg_impl.sort();
600 void sort(_StrictWeakOrdering __comp) function in class:slist
601 { _M_non_dbg_impl.sort(__comp); }
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
/prebuilts/ndk/9/sources/cxx-stl/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
/prebuilts/ndk/current/sources/cxx-stl/EH/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/debug/
H A D_list.h429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/Finder/
H A DFinder_Basics.py38 def sort(self, _object, _attributes={}, **_arguments): member in class:Finder_Basics_Events
39 """sort: (NOT AVAILABLE YET) Return the specified object(s) in a sorted list
40 Required argument: a list of finder objects to sort
41 Keyword argument by: the property to sort the items by (name, index, date, etc.)
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/pointers/
H A D_list.h306 void sort() { _M_impl.sort(); } function in class:list
321 void sort(_StrictWeakOrdering __comp) function in class:list
322 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
H A D_slist.h386 void sort() {_M_impl.sort(); } function in class:slist
402 void sort(_StrictWeakOrdering __comp) function in class:slist
403 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/pointers/
H A D_list.h306 void sort() { _M_impl.sort(); } function in class:list
321 void sort(_StrictWeakOrdering __comp) function in class:list
322 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
H A D_slist.h386 void sort() {_M_impl.sort(); } function in class:slist
402 void sort(_StrictWeakOrdering __comp) function in class:slist
403 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/pointers/
H A D_list.h306 void sort() { _M_impl.sort(); } function in class:list
321 void sort(_StrictWeakOrdering __comp) function in class:list
322 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }

Completed in 505 milliseconds

123456789