/external/chromium_org/courgette/testdata/ |
elf-32-2 | |
/packages/apps/Gallery/src/com/android/camera/ |
ImageManager.java | 101 return String.format("ImageListParam{loc=%s,inc=%d,sort=%d," + 129 // Sort 284 int sort = param.mSort; local 305 l.add(new ImageList(cr, STORAGE_URI, sort, bucketId)); 308 l.add(new VideoList(cr, VIDEO_STORAGE_URI, sort, bucketId)); 314 Images.Media.INTERNAL_CONTENT_URI, sort, bucketId)); 335 l.toArray(new IImageList[l.size()]), sort); 341 int sort) { 346 sort, null); 351 return makeImageList(cr, DataLocation.ALL, INCLUDE_IMAGES, sort, [all...] |
/external/chromium/net/base/ |
directory_lister.cc | 55 SORT_TYPE sort, 60 sort_(sort), 132 // Sort the results. See the TODO above (this sort should be removed and we 135 std::sort(e->data.begin(), e->data.end(), CompareDate); 137 std::sort(e->data.begin(), e->data.end(), CompareFullPath); 139 std::sort(e->data.begin(), e->data.end(), CompareAlphaDirsFirst);
|
/external/webrtc/src/system_wrappers/source/spreadsortlib/ |
spreadsort.hpp | 191 //don't sort unless there are at least two items to compare
194 //using std::sort if its worst-case is better
196 std::sort(lastPos, bin_cache[u]);
281 std::sort(lastPos, bin_cache[u], comp);
329 std::sort(lastPos, bin_cache[u]);
368 //Don't sort if it's too small to optimize
370 std::sort(first, last);
380 std::sort(first, last, comp);
390 std::sort(first, last);
522 std::sort(lastPos, bin_cache[u]); [all...] |
/external/linux-tools-perf/ |
builtin-kmem.c | 440 struct sort_dimension *sort; local 449 list_for_each_entry(sort, sort_list, list) { 450 cmp = sort->cmp(data, this); 621 struct sort_dimension *sort; local 626 sort = malloc(sizeof(*sort)); 627 if (!sort) 629 memcpy(sort, avail_sorts[i], sizeof(*sort)); 630 list_add_tail(&sort->list, list) [all...] |
/external/llvm/tools/llvm-nm/ |
llvm-nm.cpp | 94 cl::opt<bool> NumericSort("numeric-sort", 95 cl::desc("Sort symbols by address")); 96 cl::alias NumericSortn("n", cl::desc("Alias for --numeric-sort"), 98 cl::alias NumericSortv("v", cl::desc("Alias for --numeric-sort"), 101 cl::opt<bool> NoSort("no-sort", 103 cl::alias NoSortp("p", cl::desc("Alias for --no-sort"), 111 cl::opt<bool> SizeSort("size-sort", cl::desc("Sort symbols by size")); 193 std::sort(SymbolList.begin(), SymbolList.end(), CompareSymbolAddress); 195 std::sort(SymbolList.begin(), SymbolList.end(), CompareSymbolSize) [all...] |
/external/chromium_org/third_party/sqlite/src/test/ |
boundary3.tcl | 71 # A simple selection sort. Not trying to be efficient. 73 proc sort {inlist} { procedure 197 puts "\175 {[sort $aset]}" 205 puts "\175 {[reverse [sort $aset]]}" 211 foreach rx [sort $rset] { 224 foreach rx [reverse [sort $rset]] { 241 foreach x [sort $xset] { 262 foreach rx [sort $rset] { 275 foreach rx [reverse [sort $rset]] {
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
filecmp.py | 128 self.left_list.sort() 129 self.right_list.sort() 196 self.left_only.sort() 199 self.right_only.sort() 202 self.same_files.sort() 205 self.diff_files.sort() 208 self.funny_files.sort() 211 self.common_dirs.sort() 214 self.common_funny.sort()
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
filecmp.py | 128 self.left_list.sort() 129 self.right_list.sort() 196 self.left_only.sort() 199 self.right_only.sort() 202 self.same_files.sort() 205 self.diff_files.sort() 208 self.funny_files.sort() 211 self.common_dirs.sort() 214 self.common_funny.sort()
|
/development/samples/VoicemailProviderDemo/src/com/example/android/voicemail/common/core/ |
VoicemailProviderHelper.java | 40 /** Sort order to return results by. */ 44 /** Default sort order returned by DB. (Typically Ascending, but no guarantees made). */ 134 * @param sortColumn The column to sort by. Must be one of the values defined in 136 * @param sortOrder Order to sort by 137 * @return the list of voicemails, sorted by the requested DB column in specified sort order.
|
/external/chromium_org/chrome/browser/download/ |
download_query.h | 19 // Filter and sort a vector of DownloadItem*s. 110 // filtering DownloadItem*s, Search() will sort the results primarily by the 111 // sorter from the first call to Sort(), secondarily by the sorter from the 112 // second call to Sort(), and so on. For example, if the InputIterator passed 115 // start_time:1}, and Sort is called twice, once with (SORT_ERROR, ASCENDING)
|
/external/chromium_org/chrome/browser/safe_browsing/ |
safe_browsing_store.cc | 136 // Sort the inputs by the SBAddPrefix bits. 137 std::sort(add_prefixes->begin(), add_prefixes->end(), 139 std::sort(sub_prefixes->begin(), sub_prefixes->end(), 141 std::sort(add_full_hashes->begin(), add_full_hashes->end(), 143 std::sort(sub_full_hashes->begin(), sub_full_hashes->end(),
|
/external/chromium_org/v8/tools/ |
profile_view.js | 118 * Sorts the profile view using the specified sort function. 122 * functions. Must comply with Array.sort sorting function requirements. 124 ProfileView.prototype.sort = function(sortFunc) { 214 * functions. Must comply with Array.sort sorting function requirements. 218 this.children.sort(sortFunc);
|
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/ |
Property.java | 194 * Gets the custom sort priority of this property 196 * @return the sort priority 203 * Sets the custom sort priority of this property 211 /** Sort {@link Property} instances alphabetically by property name */ 219 /** Sort {@link Property} instances by priority */
|
/external/linux-tools-perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/ |
Core.pm | 39 foreach my $idx (sort {$a <=> $b} keys %trace_flags) { 69 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event_name}{$field_name}{"values"}}) { 109 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event}{$field}{"values"}}) { 121 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event_name}{$field_name}{"values"}}) { 155 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event}{$field}{"values"}}) {
|
/external/llvm/docs/CommandGuide/ |
llvm-nm.rst | 137 .. option:: --no-sort, -p 142 .. option:: --numeric-sort, -n, -v 144 Sort symbols by address. 157 .. option:: --size-sort 159 Sort symbols by size.
|
/external/lzma/CPP/Common/ |
MyVector.h | 150 void Sort(int (*compare)(const T*, const T*, void *), void *param)
258 void Sort(int (*compare)(void *const *, void *const *, void *), void *param)
259 { CPointerVector::Sort(compare, param); }
263 void Sort() { CPointerVector::Sort(CompareObjectItems, 0); }
|
/external/v8/tools/ |
profile_view.js | 118 * Sorts the profile view using the specified sort function. 122 * functions. Must comply with Array.sort sorting function requirements. 124 ProfileView.prototype.sort = function(sortFunc) { 214 * functions. Must comply with Array.sort sorting function requirements. 218 this.children.sort(sortFunc);
|
/packages/apps/UnifiedEmail/src/org/apache/commons/io/comparator/ |
ExtensionFileComparator.java | 30 * This comparator can be used to sort lists or arrays of files
36 * Example of a <i>case-sensitive</i> file extension sort using the
40 * Collections.sort(list, ExtensionFileComparator.EXTENSION_COMPARATOR);
43 * Example of a <i>reverse case-insensitive</i> file extension sort using the
47 * Arrays.sort(array, ExtensionFileComparator.EXTENSION_INSENSITIVE_REVERSE);
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/Finder/ |
Finder_Basics.py | 38 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.) 46 _subcode = 'SORT'
|
/external/chromium_org/ui/views/controls/table/ |
table_view.cc | 72 // Used as the comparator to sort the contents of the table. 83 // Used as the comparator to sort the contents of the table when a TableGrouper 84 // is present. When groups are present we sort the groups based on the first row 93 // The two rows are in the same group, sort so that items in the same 227 SortDescriptors sort(sort_descriptors_); 228 if (!sort.empty() && sort[0].column_id == column_id) { 229 sort[0].ascending = !sort[0].ascending; 232 sort.insert(sort.begin(), descriptor) [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
NodeSorter.java | 35 * This class can sort vectors of DOM nodes according to a select pattern. 65 * Given a vector of nodes, sort each node according to 73 public void sort(DTMIterator v, Vector keys, XPathContext support) method in class:NodeSorter 119 * @param kIndex Index of NodeSortKey to use for sort 283 * sort for our purpose than the Quicksort because it 285 * the order isn't changed by the sort. 366 * This is a generic version of C.A.R Hoare's Quick Sort 424 // must now sort the left partition. 431 // must now sort the right partition. 458 * node against the sort key(s). [all...] |
/external/chromium_org/third_party/WebKit/Tools/Scripts/ |
do-file-rename | 80 for my $file (sort @paths) { 86 for my $file (sort @paths) { 96 for my $file (sort @paths) {
|
/external/chromium_org/third_party/icu/source/i18n/ |
uspoof_conf.h | 48 // This is sort of like a sorted set of strings, except that ICU's anemic 67 // Sort the contents; affects the ordering of getByIndex(). 68 void sort(UErrorCode &status);
|
/external/icu4c/i18n/ |
uspoof_conf.h | 48 // This is sort of like a sorted set of strings, except that ICU's anemic 67 // Sort the contents; affects the ordering of getByIndex(). 68 void sort(UErrorCode &status);
|