| /toolchain/binutils/binutils-2.25/gprof/ |
| cg_print.c | 314 Arc *arc, *detached, sorted, *prev;
317 sorted's parents.
319 *detached the rest of the arcs to be sorted.
320 sorted arc list onto which you insertion sort.
322 sorted.next_parent = 0;
328 /* Consider *arc as disconnected; insert it into sorted. */
329 for (prev = &sorted; prev->next_parent; prev = prev->next_parent)
339 /* Reattach sorted arcs to child. */
340 child->cg.parents = sorted.next_parent;
401 Arc *arc, *detached, sorted, *prev
313 Arc *arc, *detached, sorted, *prev; local
400 Arc *arc, *detached, sorted, *prev; local
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 395 * to be sorted will be numeric indexes into some other structure such as an ANTLR3_VECTOR.
398 * array of the sorted noded indexes, in case you are not sorting ANTLR3_VECTORS but
417 * A vector used to build up the sorted output order. Note that
421 pANTLR3_UINT32 sorted; member in struct:ANTLR3_TOPO_struct
452 * One more than the largest node index that is contained in edges/sorted.
479 * A method that returns a pointer to an array of sorted node indexes.
480 * The array is sorted in topological sorted order. Note that the array
483 * was 16, then the returned array will be the sorted order of the first 16
487 * NB: If the structure that contains the array is freed, then the sorted
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
| ICUPropertyFactory.java | 461 TreeMap<String,String> sorted = new TreeMap<String,String>(); local
464 sorted.put(UScript.getShortName(scriptCode), UScript.getName(scriptCode));
466 return CollectionUtilities.join(sorted.values(), " ");
|
| /external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/util/ |
| ICUPropertyFactory.java | 460 TreeMap<String,String> sorted = new TreeMap<String,String>(); local
463 sorted.put(UScript.getShortName(scriptCode), UScript.getName(scriptCode));
465 return CollectionUtilities.join(sorted.values(), " ");
|
| /external/pdfium/third_party/agg23/ |
| agg_rasterizer_scanline_aa.h | 110 bool sorted() const function in class:agg::outline_aa
246 if(m_outline.sorted()) {
|
| /packages/apps/Calendar/tests/src/com/android/calendar/ |
| AsyncQueryServiceTest.java | 262 OperationInfo[] sorted = generateSortedWork(work, work.length); local
264 TestAsyncQueryService aqs = new TestAsyncQueryService(buildTestContext(sorted), sorted);
390 OperationInfo[] sorted = new OperationInfo[length]; local
391 System.arraycopy(work, 0, sorted, 0, length);
393 // Set the scheduled time so they get sorted properly
394 for (OperationInfo w : sorted) {
401 Arrays.sort(sorted);
409 Log.d(TAG, "Sorted work: " + sorted.length)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/adt/internal/refactorings/core/ |
| RefactoringTestBase.java | 207 List<Change> sorted = Arrays.asList(children); local
209 Collections.sort(sorted, new Comparator<Change>() {
239 for (Change child : sorted) {
|
| /system/core/logd/ |
| LogBuffer.cpp | 233 // Insert elements in time sorted order if possible
553 { // begin scope for UID sorted list
554 std::unique_ptr<const UidEntry *[]> sorted = stats.sort( local
557 if (sorted.get() && sorted[0] && sorted[1]) {
558 worst_sizes = sorted[0]->getSizes();
564 && (worst_sizes > (10 * sorted[0]->getDropped()))) {
565 worst = sorted[0]->getKey();
566 second_worst_sizes = sorted[1]->getSizes()
576 std::unique_ptr<const PidEntry *[]> sorted = stats.sort( local
[all...] |
| /toolchain/binutils/binutils-2.25/ld/ |
| ld.h | 96 sort_type sorted; member in struct:wildcard_spec
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DecisionProbe.java | 257 /** Return the sorted list of alts that conflict within a single state.
265 List sorted = new LinkedList(); local
266 sorted.addAll(nondetAlts);
267 Collections.sort(sorted); // make sure it's 1, 2, ...
268 return sorted;
[all...] |
| /external/chromium-trace/catapult/third_party/Paste/paste/ |
| fixture.py | 52 def sorted(l): function
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/httplib2/python2/httplib2/ |
| __init__.py | 121 def sorted(seq): function in function:has_timeout
[all...] |
| /external/freetype/src/pshinter/ |
| pshalgo.c | 117 PSH_Hint* sorted = table->sort_global; local
123 for ( ; count > 0; count--, sorted++ )
125 hint2 = sorted[0];
138 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
315 /* will be already sorted -- and the sort will be linear */
[all...] |
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/cldr/ |
| CheckSystemFonts.java | 191 Set<String> sorted = new TreeSet<String>(English); local
192 sorted.addAll(missingMap.values());
193 for (String value : sorted) {
|
| /external/libdrm/ |
| xf86drmMode.c | 1200 /* keep it sorted by object_id and property_id */
1260 /* keep it sorted by object_id and property_id */
1582 drmModeAtomicReqPtr sorted; local
[all...] |
| /external/opencv/ml/src/ |
| mlboost.cpp | 211 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi); local
220 int idx = sorted[i].i;
228 int idx = sorted[i].i;
235 dir[sorted[i].i] = (char)0;
247 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
262 int idx = sorted[i].i;
277 int idx = sorted[i].i;
287 if( sorted[i].val + epsilon < sorted[i+1].val )
302 int idx = sorted[i].i
443 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
574 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
[all...] |
| /external/pdfium/third_party/freetype/src/pshinter/ |
| pshalgo.c | 117 PSH_Hint* sorted = table->sort_global; local
123 for ( ; count > 0; count--, sorted++ )
125 hint2 = sorted[0];
138 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
315 /* will be already sorted -- and the sort will be linear */
[all...] |
| /prebuilts/devtools/adt/lib/ |
| sdktestutils.jar | |
| /sdk/attribute_stats/src/ |
| Analyzer.java | 595 List<String> sorted = new ArrayList<String>(keys); local
596 Collections.sort(sorted);
599 for (String attribute : sorted) {
|
| /external/doclava/src/com/google/doclava/ |
| Doclava.java | 762 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); local
771 sorted.put(name, pkg);
775 for (Map.Entry<String, PackageInfo> entry : sorted.entrySet()) {
927 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); local
932 sorted.put(cl.qualifiedName(), cl);
940 sorted.put(name, pkg);
954 for (String s : sorted.keySet()) {
958 Object o = sorted.get(s);
1150 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); local
1282 Sorter[] sorted = new Sorter[classes.length]; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/ |
| Tool.java | 579 List<Object> sorted = g.sort(); local
580 //System.out.println("sorted="+sorted);
582 for (int i = 0; i < sorted.size(); i++) {
583 String f = (String)sorted.get(i);
[all...] |
| /external/jcommander/src/main/java/com/beust/jcommander/ |
| JCommander.java | 1071 List<ParameterDescription> sorted = Lists.newArrayList(); local
[all...] |
| /external/selinux/checkpolicy/ |
| policy_define.c | 1745 struct av_ioctl_range_list *r, *r2, *sorted, *sortedhead = NULL; local
[all...] |
| /external/skia/tests/ |
| PathOpsSkpClipTest.cpp | 624 SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) {
650 if (!sorted) {
656 *sorted[dirNo - firstDirNo].append() = (SortByName*) &testSet[index];
658 if (sorted[dirNo - firstDirNo].count()) {
659 SkTQSort<SortByName>(sorted[dirNo - firstDirNo].begin(),
660 sorted[dirNo - firstDirNo].end() - 1);
707 SkTDArray<SortByName*> sorted[1]; local
708 if (!buildTestDir(dirNo, dirNo, tests, sorted)) {
724 int count = sorted[0].count();
725 int idx = SkTSearch<SortByName, Less>(sorted[0].begin(), count, &name, sizeof(&name))
[all...] |
| /frameworks/base/services/core/java/com/android/server/content/ |
| ContentService.java | 187 ArrayList<Integer> sorted = new ArrayList<Integer>(); local
189 sorted.add(pidCounts.keyAt(i));
191 Collections.sort(sorted, new Comparator<Integer>() {
205 for (int i=0; i<sorted.size(); i++) {
206 int pid = sorted.get(i);
[all...] |
