/external/oprofile/libpp/ |
H A D | symbol_sort.cpp | 84 os << "compare_by(): unknown sort option: " 132 sort(symbol_collection & syms, bool reverse_sort, bool lf) const function in class:sort_options 149 sort(diff_collection & syms, bool reverse_sort, bool lf) const function in class:sort_options 181 os << "unknown sort option: " << name << endl;
|
/external/skia/src/core/ |
H A D | SkRect.cpp | 29 void SkIRect::sort() { function in class:SkIRect 40 void SkRect::sort() { function in class:SkRect
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
H A D | ASN1Set.java | 159 this.sort(); 177 this.sort(); 301 derSet.sort(); 402 protected void sort() method in class:ASN1Set
|
/external/chromium_org/net/base/ |
H A D | directory_lister.cc | 74 // Sort the results. See the TODO below (this sort should be removed and we 77 std::sort(data->begin(), data->end(), CompareDate); 79 std::sort(data->begin(), data->end(), CompareFullPath); 81 std::sort(data->begin(), data->end(), CompareAlphaDirsFirst); 98 SortType sort, 100 : core_(new Core(dir, recursive, sort, this)), 120 SortType sort, 124 sort_(sort), 96 DirectoryLister(const base::FilePath& dir, bool recursive, SortType sort, DirectoryListerDelegate* delegate) argument 118 Core(const base::FilePath& dir, bool recursive, SortType sort, DirectoryLister* lister) argument
|
/external/chromium_org/third_party/skia/third_party/lua/src/ |
H A D | ltablib.c | 187 /* sort elements a[l], a[(l+u)/2] and a[u] */ 213 /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */ 247 static int sort (lua_State *L) { function 269 {"sort", sort},
|
/external/clang/test/SemaTemplate/ |
H A D | instantiate-field.cpp | 76 typename Requires_< BidirectionalIterator<RanIter>::value >::type sort(RanIter,RanIter){} function in namespace:PR7123 81 sort(x,x);
|
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | MixedItemSection.java | 46 /** sort by type only */ 49 /** sort in class-major order, with instances sorted per-class */ 69 /** {@code non-null;} how to sort the items */ 70 private final SortType sort; field in class:MixedItemSection 86 * @param sort how the items should be sorted in the final output 89 SortType sort) { 94 this.sort = sort; 296 switch (sort) { 298 Collections.sort(item 88 MixedItemSection(String name, DexFile file, int alignment, SortType sort) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntList.java | 265 // sort status is unchanged 357 public void sort() { method in class:IntList 361 Arrays.sort(values, 0, size); 445 * @see #sort
|
/external/emma/ant/ant14/com/vladium/emma/report/ |
H A D | reportTask.java | 141 public void setSort (final String sort) argument 143 m_reportCfg.setSort (sort);
|
H A D | ReportCfg.java | 70 public void setSort (final String sort) argument 72 m_settings.setProperty (m_prefix.concat (SORT), sort); 365 public void setSort (final String sort) argument 367 m_settings.setProperty (PREFIX.concat (SORT), sort);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ForwardingSortedMapTest.java | 130 return sort(insertionOrder); 152 return sort(insertionOrder); 173 return sort(insertionOrder); 184 private static Iterable<Entry<String, String>> sort( method in class:ForwardingSortedMapTest
|
/external/icu/icu4c/source/layout/ |
H A D | OpenTypeUtilities.cpp | 174 // Straight insertion sort from Knuth vol. III, pg. 81 176 void OpenTypeUtilities::sort(le_uint16 *array, le_int32 count) function in class:OpenTypeUtilities
|
/external/junit/src/org/junit/internal/runners/ |
H A D | JUnit38ClassRunner.java | 144 public void sort(Sorter sorter) { method in class:JUnit38ClassRunner 147 adapter.sort(sorter);
|
H A D | JUnit4ClassRunner.java | 134 public void sort(final Sorter sorter) { method in class:JUnit4ClassRunner 135 Collections.sort(fTestMethods, new Comparator<Method>() {
|
/external/libvorbis/vq/ |
H A D | distribution.c | 96 long **sort=calloc(bins,sizeof(long *)); local 100 for(i=0;i<bins;i++)sort[i]=c->quantlist+i; 101 qsort(sort,bins,sizeof(long *),ascend); 143 int ptr=sort[i]-c->quantlist;
|
/external/oprofile/pp/ |
H A D | opreport_options.cpp | 59 vector<string> sort; member in namespace:__anon28476 75 popt::option(sort, "sort", 's', 76 "sort by", "sample,image,app-name,symbol,debug,vma"), 77 popt::option(options::reverse_sort, "reverse-sort", 'r', 78 "use reverse sort"), 117 if (options::xml && !sort.empty()) { 118 cerr << "warning: sort options ignored because they " 122 sort.clear(); 125 if (sort [all...] |
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | FixedSizeArray.java | 183 * Searches the array for the specified object. If the array has been sorted with sort(), 184 * and if no other order-changing events have occurred since the sort (e.g. add()), a 240 * setComparator(), it will be used for the sort; otherwise the object's natural ordering will 243 * objects in the array has not changed since the last sort. 245 public void sort(boolean forceResort) { method in class:FixedSizeArray 248 mSorter.sort(mContents, mCount, mComparator); 250 DebugLog.d("FixedSizeArray", "No comparator specified for this type, using Arrays.sort()."); 252 Arrays.sort(mContents, 0, mCount);
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | NodeVector.java | 640 public void sort(int a[], int lo0, int hi0) throws Exception method in class:NodeVector 655 * sort a two element list by swapping if necessary 726 sort(a, lo0, lo - 1); 727 sort(a, hi + 1, hi0); 735 public void sort() throws Exception method in class:NodeVector 737 sort(m_map, 0, m_firstFree - 1);
|
/external/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathNodeSet.cpp | 61 // Should not call this function with less that two nodes to sort. 125 // node-set. Sort it according to this subdivision, and recursively sort 156 void NodeSet::sort() const function in class:blink::XPath::NodeSet 271 sort();
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | uspoof_conf.cpp | 124 void SPUStringPool::sort(UErrorCode &status) { function in class:SPUStringPool 125 fVec->sort(SPUStringCompare, status); 324 stringPool->sort(status);
|
/external/clang/test/CodeGen/ |
H A D | 2009-01-21-InvalidIterator.c | 34 struct fde_vector *sort; member in union:object::__anon18565
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/db/ |
H A D | AbstractResults.java | 58 * Add a child to current results, using specific sort 61 void addChild(Comparable child, boolean sort) { argument 62 if (sort) {
|
/external/icu/icu4c/source/i18n/ |
H A D | uspoof_conf.cpp | 124 void SPUStringPool::sort(UErrorCode &status) { function in class:SPUStringPool 125 fVec->sort(SPUStringCompare, status); 324 stringPool->sort(status);
|
/external/junit/src/org/junit/runners/ |
H A D | ParentRunner.java | 45 * running each child. ParentRunner will filter and sort children, handle 142 * <li>Call {@link #runChild(Object, RunNotifier)} on each object returned by {@link #getChildren()} (subject to any imposed filter and sort).</li> 216 * filter and sort) 331 public void sort(Sorter sorter) { method in class:ParentRunner 335 Collections.sort(getFilteredChildren(), comparator());
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | callchain.h | 27 struct rb_node rb_node; /* to sort nodes in an rbtree */ 53 sort_chain_func_t sort; member in struct:callchain_param
|