/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | Type.java | 45 * The sort of the <tt>void</tt> type. See {@link #getSort getSort}.
50 * The sort of the <tt>boolean</tt> type. See {@link #getSort getSort}.
55 * The sort of the <tt>char</tt> type. See {@link #getSort getSort}.
60 * The sort of the <tt>byte</tt> type. See {@link #getSort getSort}.
65 * The sort of the <tt>short</tt> type. See {@link #getSort getSort}.
70 * The sort of the <tt>int</tt> type. See {@link #getSort getSort}.
75 * The sort of the <tt>float</tt> type. See {@link #getSort getSort}.
80 * The sort of the <tt>long</tt> type. See {@link #getSort getSort}.
85 * The sort of the <tt>double</tt> type. See {@link #getSort getSort}.
90 * The sort o 151 private final int sort; field in class:Type 180 Type(final int sort) argument 192 Type(final int sort, final char[] buf, final int off, final int len) argument [all...] |
/external/stlport/stlport/stl/debug/ |
H A D | _list.h | 429 void sort() { function in class:list 430 _M_non_dbg_impl.sort(); 480 void sort(_StrictWeakOrdering __comp) { function in class:list 481 _M_non_dbg_impl.sort(__comp);
|
H A D | _slist.h | 545 void sort() { function in class:slist 546 _M_non_dbg_impl.sort(); 600 void sort(_StrictWeakOrdering __comp) function in class:slist 601 { _M_non_dbg_impl.sort(__comp); }
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/heap_snapshot_worker/ |
H A D | HeapSnapshot.js | 1455 aggregates[clss].idxs.sort( 2033 this.sort(this._currentComparator, this._sortedPrefixLength, this._iterationOrder.length - 1 - this._sortedSuffixLength, begin, end - 1); 2082 sort: function(comparator, leftBound, rightBound, windowLeft, windowRight) 2253 sort: function(comparator, leftBound, rightBound, windowLeft, windowRight)
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
H A D | CPUProfileDataGrid.js | 163 sort: function(comparator, force) 174 // If the grid node is collapsed, then don't sort children (save operation for later). 188 children.sort(comparator); 361 container.sort(currentComparator, true); 410 sort: WebInspector.ProfileDataGridNode.prototype.sort,
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uvector.cpp | 485 * Array sort comparator function. 486 * Used from UVector::sort() 506 * Array sort comparison function for use from UVector::sorti() 520 * (A more general sort would take a comparison function, but it's 538 * the UVector sort function pointer via the context pointer to a 546 void UVector::sort(UElementComparator *compare, UErrorCode &ec) { function in class:UVector 555 * Stable sort with a user supplied comparator of type UComparator.
|
/external/chromium_org/third_party/protobuf/python/google/protobuf/internal/ |
H A D | cpp_message.py | 161 def sort(self, *args, **kwargs): member in class:RepeatedScalarContainer 249 def sort(self, cmp=None, key=None, reverse=False, **kwargs): member in class:RepeatedCompositeContainer 263 indexes.sort(cmp=cmp, key=index_key, reverse=reverse) 606 all_fields.sort(key=lambda item: item[0].number)
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | array-sort.js | 30 // Test array sort. 36 // Default sort converts each element to string and orders 38 a.sort(); 41 a.sort(function(x, y) { return x - y; }); 44 // Default sort on negative numbers. 46 a.sort(); 49 // Default sort on negative and non-negative numbers. 51 a.sort(); 55 a = [9, 1000000000].sort(); 57 a = [1000000000, 1].sort(); [all...] |
/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 | PerformanceResults.java | 195 * @param sort Indicates whether the list must be sorted or not. 199 public String[] getConfigBoxes(boolean sort) { argument 200 return sort ? this.sortedConfigDescriptions : this.configDescriptions; 207 * @param sort Indicates whether the list must be sorted or not 210 public String[] getConfigNames(boolean sort) { argument 211 return sort ?this.sortedConfigNames : this.configNames; 333 Arrays.sort(this.sortedConfigNames); 498 Arrays.sort(builds, Util.BUILD_DATE_COMPARATOR); 625 Collections.sort(componentsSet); 701 Arrays.sort(thi [all...] |
/external/emma/ant/ant14/com/vladium/emma/ |
H A D | emmajavaTask.java | 508 public final void setSort (final String sort) argument 510 m_reportCfg.setSort (sort);
|
/external/icu/icu4c/source/common/ |
H A D | uvector.cpp | 485 * Array sort comparator function. 486 * Used from UVector::sort() 506 * Array sort comparison function for use from UVector::sorti() 520 * (A more general sort would take a comparison function, but it's 538 * the UVector sort function pointer via the context pointer to a 546 void UVector::sort(UElementComparator *compare, UErrorCode &ec) { function in class:UVector 555 * Stable sort with a user supplied comparator of type UComparator.
|
/external/stlport/stlport/stl/pointers/ |
H A D | _list.h | 306 void sort() { _M_impl.sort(); } function in class:list 321 void sort(_StrictWeakOrdering __comp) function in class:list 322 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
|
H A D | _slist.h | 386 void sort() {_M_impl.sort(); } function in class:slist 402 void sort(_StrictWeakOrdering __comp) function in class:slist 403 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
|
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/ |
H A D | XMPMeta.java | 1155 void sort(); method in interface:XMPMeta
|
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
H A D | XMPNode.java | 645 public void sort() method in class:XMPNode 647 // sort qualifier 659 quals[sortFrom].sort(); 663 Arrays.sort(quals, sortFrom, quals.length); 669 quals[j].sort(); 673 // sort children 678 Collections.sort(children); 682 ((XMPNode) it.next()).sort(); 774 Arrays.sort(quals, i, quals.length); 789 Arrays.sort(childre [all...] |
H A D | XMPMetaImpl.java | 1253 * @see XMPMeta#sort() 1255 public void sort() method in class:XMPMetaImpl 1257 this.tree.sort();
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | SkAntiEdge.cpp | 402 void SkAntiEdgeBuilder::sort(SkTDArray<SkAntiEdge*>& listOfEdges) { function in class:SkAntiEdgeBuilder 417 void SkAntiEdgeBuilder::sort() { function in class:SkAntiEdgeBuilder 418 sort(fList); 604 sort(list); 719 sort();
|
/external/skia/experimental/Intersection/ |
H A D | SkAntiEdge.cpp | 402 void SkAntiEdgeBuilder::sort(SkTDArray<SkAntiEdge*>& listOfEdges) { function in class:SkAntiEdgeBuilder 417 void SkAntiEdgeBuilder::sort() { function in class:SkAntiEdgeBuilder 418 sort(fList); 604 sort(list); 719 sort();
|
/external/chromium_org/third_party/freetype/src/pshinter/ |
H A D | 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 local 1522 PSH_Hint* sort = table->sort; local [all...] |
H A D | pshalgo.h | 84 PSH_Hint* sort; member in struct:PSH_Hint_TableRec_
|
/external/chromium_org/third_party/libxslt/libxslt/ |
H A D | xsltutils.c | 931 /* TODO: sort is really not optimized, does it needs to ? */ 947 * @sort: node list 955 xsltComputeSortResult(xsltTransformContextPtr ctxt, xmlNodePtr sort) { argument 972 comp = sort->psvi; 975 "xsl:sort : compilation failed\n"); 988 /* TODO: xsl:sort lang attribute */ 989 /* TODO: xsl:sort case-order attribute */ 1006 ctxt->inst = sort; 1075 * @sorts: array of sort nodes 1172 /* Shell's sort o [all...] |
/external/freetype/src/pshinter/ |
H A D | 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 local 1521 PSH_Hint* sort = table->sort; local [all...] |
H A D | pshalgo.h | 84 PSH_Hint* sort; member in struct:PSH_Hint_TableRec_
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/ |
H A D | builtin-kmem.c | 429 struct sort_dimension *sort; local 438 list_for_each_entry(sort, sort_list, list) { 439 cmp = sort->cmp(data, this); 618 struct sort_dimension *sort; local 623 sort = memdup(avail_sorts[i], sizeof(*avail_sorts[i])); 624 if (!sort) { 628 list_add_tail(&sort->list, list); 651 error("Unknown --sort key: '%s'", tok); 747 OPT_CALLBACK('s', "sort", NULL, "key[,key2...]", 748 "sort b [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ilist.h | 634 template<class Pr3> void sort(Pr3 pred); 635 void sort() { sort(op_less); } function in class:llvm::iplist
|