| /frameworks/base/graphics/java/android/graphics/ |
| RectF.java | 468 public void sort() { method in class:RectF
|
| /packages/apps/Contacts/src/com/android/contacts/ |
| SplitAggregateView.java | 186 Collections.sort(list);
|
| /packages/wallpapers/LivePicker/src/com/android/wallpaper/livepicker/ |
| LiveWallpaperListActivity.java | 97 Collections.sort(list, new Comparator<ResolveInfo>() {
|
| /sdk/sdkmanager/libs/sdkuilib/src/com/android/sdkuilib/internal/widgets/ |
| SdkTargetSelector.java | 149 Arrays.sort(mTargets, new Comparator<IAndroidTarget>() {
|
| /external/v8/src/ |
| array.js | 65 keys.sort(function(a, b) { return a - b; });
645 // For short (length <= 22) arrays, insertion sort is used for efficiency.
700 // Insertion sort is faster for short arrays.
864 // For compatibility with JSC, we also sort elements inherited from
887 // chain that has become exposed by sort moving a hole to its position.
[all...] |
| /external/webkit/JavaScriptCore/runtime/ |
| JSArray.cpp | 676 return sort(exec, compareFunction, callType, callData);
686 void JSArray::sort(ExecState* exec) function in class:JSC::JSArray
697 // Converting JavaScript values to strings can be expensive, so we do it once up front and sort based on that.
726 // FIXME: Since we sort by string value, a fast algorithm might be to use a radix sort. That would be O(N) rather
732 // FIXME: The qsort library function is likely to not be a stable sort.
733 // ECMAScript-262 does not specify a stable sort, but in practice, browsers perform a stable sort.
824 void JSArray::sort(ExecState* exec, JSValue compareFunction, CallType callType, const CallData& callData) function in class:JSC::JSArray
[all...] |
| /frameworks/base/location/java/android/location/ |
| LocationManager.java | 448 // First, sort by power requirement
449 Collections.sort(providers, new LpPowerComparator());
465 // Next, sort by accuracy
466 Collections.sort(tmp, new LpAccuracyComparator());
480 // Finally, sort by capability "score"
481 Collections.sort(tmp2, new LpCapabilityComparator());
[all...] |
| /packages/providers/DownloadProvider/src/com/android/providers/downloads/ |
| DownloadProvider.java | 381 final String sort) {
488 sb.append("sort is ");
489 sb.append(sort);
495 null, null, sort);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/resources/manager/ |
| ProjectResources.java | 277 // We need to sort it.
278 Collections.sort(list);
[all...] |
| /external/webkit/WebCore/bindings/scripts/ |
| CodeGeneratorObjC.pm | [all...] |
| /external/v8/tools/ |
| tickprocessor.js | 378 // Sort by total time, desc, then by name, desc.
379 producersView.sort(function(rec1, rec2) {
416 // Sort by self time, desc, then by name, desc.
417 flatView.sort(function(rec1, rec2) {
457 // Sort by total time, desc, then by name, desc.
458 heavyView.sort(function(rec1, rec2) {
|
| /external/webkit/WebCore/inspector/front-end/ |
| AuditRules.js | 274 hosts.sort(hostSorter);
[all...] |
| AbstractTimelinePanel.js | 396 sortedElements.sort(sortingFunction);
|
| /cts/tools/dx-tests/src/util/ |
| CollectAllTests.java | 184 Collections.sort(methods, new Comparator<String>() {
186 // TODO sort according: test ... N, B, E, VFE
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| LocalList.java | 917 * sort it to get a consistent order for everything: Local
936 Arrays.sort(resultArr);
|
| /dalvik/libcore/luni/src/main/java/java/net/ |
| InetAddress.java | 202 // and always put IPv4 addresses first. Arrays.sort() is stable, so the
205 Arrays.sort(rawAddresses, SHORTEST_FIRST);
[all...] |
| /dalvik/libcore/luni-kernel/src/main/java/java/lang/ |
| ClassCache.java | 591 Arrays.sort((Enum<?>[]) values, ENUM_COMPARATOR);
|
| /development/samples/GlobalTime/src/com/android/globaltime/ |
| GLView.java | 530 Collections.sort(l);
|
| /external/icu4c/common/ |
| uvector.cpp | 471 * Array sort comparator function.
472 * Used from UVector::sort()
498 * Array sort comparison function for use from UVector::sorti()
516 * Sort the vector, assuming it constains ints.
517 * (A more general sort would take a comparison function, but it's
530 * Sort with a user supplied comparator.
535 * the UVector sort function pointer via the context pointer to a
543 void UVector::sort(USortComparator *compare, UErrorCode &ec) { function in class:UVector
|
| /external/jdiff/src/jdiff/ |
| Comments.java | 103 Collections.sort(oldComments_.commentsList_);
|
| /external/skia/src/core/ |
| SkScan_Hairline.cpp | 74 ptsR.sort();
|
| /external/webkit/WebKit/mac/History/ |
| WebHistory.mm | 413 sort(daysAsTimeIntervals.begin(), daysAsTimeIntervals.end());
849 sort(m_dateKeys.begin(), m_dateKeys.end());
|
| /external/webkit/WebKitTools/Scripts/ |
| bisect-builds | 357 return sort $nightlycmp @files;
|
| /frameworks/base/core/java/android/app/ |
| LauncherActivity.java | 407 // Load all matching activities and sort correctly
409 Collections.sort(list, new ResolveInfo.DisplayNameComparator(mPackageManager));
|
| /frameworks/base/packages/SettingsProvider/src/com/android/providers/settings/ |
| SettingsBackupAgent.java | 90 // use very late unicode character to quasi-guarantee last sort position.
208 // Copy and sort the array
220 // Copy and sort the array
296 Arrays.sort(sortedKeys);
|
