| /external/valgrind/main/coregrind/ |
| m_xarray.c | 49 Bool sorted; /* is it sorted? */ member in struct:_XArray
77 xa->sorted = False;
134 xa->sorted = False;
194 xa->sorted = False;
215 xa->sorted = False;
225 xa->sorted = True;
273 vg_assert(xa->sorted);
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ui/ |
| CorporaAdapter.java | 72 ArrayList<Corpus> sorted = new ArrayList<Corpus>(enabledCorpora.size()); local
75 sorted.add(corpus);
78 Collections.sort(sorted, new CorpusComparator());
79 mSortedCorpora = sorted;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| LayoutContentAssist.java | 209 List<IType> sorted = new ArrayList<IType>(elements); local
210 Collections.sort(sorted, new Comparator<IType>() {
223 addMatchingProposals(proposals, sorted.toArray(), offset, node, wordPrefix,
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/ |
| UiResourceAttributeNode.java | 274 String[] sorted = matches.toArray(new String[matches.size()]); local
275 Arrays.sort(sorted);
276 return sorted;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/values/ |
| ValuesContentAssist.java | 124 List<AttributeDescriptor> sorted = local
126 sorted.addAll(matches.values());
127 Collections.sort(sorted);
129 addMatchingProposals(proposals, sorted.toArray(), offset, node, wordPrefix,
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/configuration/ |
| ThemeMenuAction.java | 199 List<String> sorted = new ArrayList<String>(allThemes); local
200 Collections.sort(sorted);
202 for (String theme : sorted) {
|
| /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/dhcpcd/ |
| ipv6rs.c | 235 struct ra *rap, *sorted, *ran, *rat; local
241 sorted = ifp->ras;
243 sorted->next = NULL;
246 if (timercmp(&rap->received, &sorted->received, <)) {
247 rap->next = sorted;
248 sorted = rap;
252 for (rat = sorted; rat->next; rat = rat->next) {
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TreeMultimapNaturalTest.java | 251 SortedSetMultimap<Double, Double> sorted = Multimaps.unmodifiableSortedSetMultimap(tree); local
252 TreeMultimap<Double, Double> copyFromSorted = TreeMultimap.create(sorted);
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JIT.cpp | 124 unsigned long sorted : 1; member in struct:__anon11523::LibgccObject::__anon11524::__anon11525
|
| /external/skia/legacy/src/core/ |
| SkConcaveToTriangles.cpp | 120 // The ActiveTrapezoids are a sorted list containing the currently active
132 // left and right edges, and insert it into the sorted list.
146 // Insert the specified Trapezoid into the sorted list.
149 // The sorted list of active trapezoids. This is O(n), and would benefit
217 // Classify the vertex, and return its sorted edges.
322 if (vt->fTrap1 < vt->fTrap0) { // Keep trapezoids sorted.
345 // SHOULD VERIFY THAT ALL TRAPEZOIDS ARE PROPERLY SORTED
375 // return false; // Outside all trapezoids, since they are sorted.
638 bool sorted; local
641 sorted = true
[all...] |
| /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) {
|
| /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/chrome/common/extensions/docs/examples/apps/hello-python/httplib2/ |
| __init__.py | 94 def sorted(seq): function in function:has_timeout
[all...] |
| /external/freetype/src/pshinter/ |
| pshalgo.c | 120 PSH_Hint* sorted = table->sort_global; local
126 for ( ; count > 0; count--, sorted++ )
128 hint2 = sorted[0];
141 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
318 /* will be already sorted -- and the sort will be linear */
[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...] |
| /frameworks/base/services/java/com/android/server/content/ |
| ContentService.java | 96 ArrayList<Integer> sorted = new ArrayList<Integer>(); local
98 sorted.add(pidCounts.keyAt(i));
100 Collections.sort(sorted, new Comparator<Integer>() {
114 for (int i=0; i<sorted.size(); i++) {
115 int pid = sorted.get(i);
[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 | 655 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); local
664 sorted.put(name, pkg);
668 for (String s : sorted.keySet()) {
669 PackageInfo pkg = sorted.get(s);
810 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); local
815 sorted.put(cl.qualifiedName(), cl);
823 sorted.put(name, pkg);
827 for (String s : sorted.keySet()) {
831 Object o = sorted.get(s);
1006 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>() local
1132 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/webkit/Source/WebCore/inspector/front-end/ |
| DetailedHeapshotGridNodes.js | 55 function sorted(ignored)
59 this._provider.sortAndRewind(this.comparator(), sorted.bind(this));
127 function afterSort(sorted)
129 if (!sorted)
|
| /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/ |
| ShortcutRepositoryTest.java | 961 ArrayList<Map.Entry<A,B>> sorted = new ArrayList<Map.Entry<A,B>>(map.size()); local
[all...] |
| /dalvik/tools/dmtracedump/ |
| TraceDump.c | 1372 TimedMethod *pTimed, *sorted; local
1420 TimedMethod *sorted = sortTimedMethodList(list, &num); local
[all...] |
