HomeSort by relevance Sort by last modified time
    Searched refs:sort (Results 426 - 450 of 2471) sorted by null

<<11121314151617181920>>

  /ndk/build/tools/
dev-platform-expand.sh 45 RET=$((cd "$1/platforms" && ls -d android-*) | sed -e "s!android-!!" | sort -g)
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/
equal_range_comp.pass.cpp 54 std::sort(v.begin(), v.end(), std::greater<int>());
  /packages/apps/Calendar/src/com/android/calendar/
QuickResponseSettings.java 52 Arrays.sort(mResponses);
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
fork_wait.py 56 a.sort()
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
fork_wait.py 56 a.sort()
  /dalvik/dexgen/src/com/android/dexgen/dex/file/
AnnotationsDirectoryItem.java 308 Collections.sort(fieldAnnotations);
318 Collections.sort(methodAnnotations);
328 Collections.sort(parameterAnnotations);
  /dalvik/dx/src/com/android/dx/dex/file/
AnnotationsDirectoryItem.java 307 Collections.sort(fieldAnnotations);
317 Collections.sort(methodAnnotations);
327 Collections.sort(parameterAnnotations);
  /development/tools/findunused/
find_unused_resources.rb 182 unusedResources.unusedLayoutIds.sort { |id, file| id[1] <=> file[1] }.each {|f|
188 unusedResources.unusedStringIds.sort { |id, file| id[1] <=> file[1] }.each {|f|
199 unusedResourceIds.sort { |id, file| id[1] <=> file[1] }.each {|f|
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
PriorityQueueTest.java 53 Arrays.sort(array);
54 Arrays.sort(resultArray);
131 Arrays.sort(newArray);
272 Arrays.sort(array);
361 Arrays.sort(array);
471 Arrays.sort(array);
497 Arrays.sort(array);
534 Arrays.sort(array);
588 Arrays.sort(newArray);
680 Arrays.sort(array)
    [all...]
  /external/ceres-solver/internal/ceres/
graph_algorithms_test.cc 61 sort(ordering.begin(), ordering.begin() + 3);
62 sort(ordering.begin() + 3, ordering.end());
97 sort(ordering.begin(), ordering.begin() + 4);
  /external/chromium_org/third_party/WebKit/Source/core/page/
Performance.cpp 111 std::sort(entries.begin(), entries.end(), PerformanceEntry::startTimeCompareLessThan);
130 std::sort(entries.begin(), entries.end(), PerformanceEntry::startTimeCompareLessThan);
150 std::sort(entries.begin(), entries.end(), PerformanceEntry::startTimeCompareLessThan);
  /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/views/
buildbot_results.py 129 tests.sort()
140 tests.sort()
158 tests.sort()
  /external/chromium_org/third_party/smhasher/src/
SpeedTest.cpp 8 #include <algorithm> // for sort
97 std::sort(v.begin(),v.end());
119 std::sort(v.begin(),v.end());
199 std::sort(times.begin(),times.end());
  /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/dexmaker/src/dx/java/com/android/dx/dex/file/
AnnotationsDirectoryItem.java 308 Collections.sort(fieldAnnotations);
318 Collections.sort(methodAnnotations);
328 Collections.sort(parameterAnnotations);
  /external/harfbuzz_ng/src/
gen-indic-table.py 105 vv.sort ()
146 uu.sort ()
199 vv.sort ()
  /external/icu4c/layout/
LookupProcessor.cpp 232 // If we added lookups from the required feature, sort them
234 OpenTypeUtilities::sort(lookupOrderArray, order);
254 OpenTypeUtilities::sort(&lookupOrderArray[order], count);
282 OpenTypeUtilities::sort(lookupOrderArray, order);
  /external/valgrind/main/cachegrind/
cg_annotate.in 66 # - --sort=D,C
74 # but we have to use @sort_order and @show_order below to handle the --sort and
118 # Thresholds, one for each sort event (or default to 1 if no sort events
151 --sort=A,B,C sort columns by events A,B,C [event column order]
153 the counts of the primary sort event [$default_threshold]
195 # --sort=A,B,C
197 # --sort=A:99,B:95,C:90. These will override any --threshold
199 } elsif ($arg =~ /^--sort=(.*)$/)
    [all...]
  /frameworks/base/core/java/android/widget/
ArrayAdapter.java 267 * @param comparator The comparator used to sort the objects contained
270 public void sort(Comparator<? super T> comparator) { method in class:ArrayAdapter
273 Collections.sort(mOriginalValues, comparator);
275 Collections.sort(mObjects, comparator);
  /packages/apps/Settings/src/com/android/settings/
UsageStats.java 140 // Sort list
206 Collections.sort(mUsageStats, mUsageTimeComparator);
209 Collections.sort(mUsageStats, mLaunchCountComparator);
212 Collections.sort(mUsageStats, mAppLabelComparator);
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/
AutoComplete.py 191 bigl.sort()
200 bigl.sort()
214 bigl.sort()
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/
AutoComplete.py 191 bigl.sort()
200 bigl.sort()
214 bigl.sort()
  /external/chromium_org/third_party/freetype/src/pshinter/
pshalgo.c 73 FT_FREE( table->sort );
189 if ( FT_NEW_ARRAY( table->sort, 2 * count ) ||
195 table->sort_global = table->sort + count;
278 PSH_Hint* sort = table->sort;
282 for ( count2 = count; count2 > 0; count2--, sort++ )
284 hint2 = sort[0];
297 table->sort[count++] = hint;
309 /* now, sort the hints; they are guaranteed to not overlap */
314 PSH_Hint* sort = table->sort local
1523 PSH_Hint* sort = table->sort; local
    [all...]
  /external/freetype/src/pshinter/
pshalgo.c 72 FT_FREE( table->sort );
188 if ( FT_NEW_ARRAY( table->sort, 2 * count ) ||
194 table->sort_global = table->sort + count;
277 PSH_Hint* sort = table->sort;
281 for ( count2 = count; count2 > 0; count2--, sort++ )
283 hint2 = sort[0];
296 table->sort[count++] = hint;
308 /* now, sort the hints; they are guaranteed to not overlap */
313 PSH_Hint* sort = table->sort local
1522 PSH_Hint* sort = table->sort; local
    [all...]
  /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...]

Completed in 1148 milliseconds

<<11121314151617181920>>