/external/linux-tools-perf/perf-3.12.0/tools/lib/traceevent/ |
Makefile | 243 all_objs := $(sort $(ALL_OBJS))
|
/external/lldb/include/lldb/Core/ |
UniqueCStringMap.h | 69 // this map, then later call UniqueCStringMap<T>::Sort() before doing 278 // call to UniqueCStringMap::Sort()) or to UniqueCStringMap::Insert(). 287 // Sort the unsorted contents in this map. A typical code flow would 296 // my_map.Sort(); 299 Sort () 301 std::sort (m_map.begin(), m_map.end());
|
/external/lldb/source/Interpreter/ |
OptionValueArray.cpp | 240 // Sort and then erase in reverse so indexes are always valid 243 std::sort(remove_indexes.begin(), remove_indexes.end());
|
/external/lldb/test/pexpect-2.4/examples/ |
rippy.py | 400 stats.sort() 446 idl.sort() 456 idl.sort() 491 idl.sort() [all...] |
/external/llvm/bindings/ocaml/ |
Makefile.ocaml | 115 OcamlSources1 := $(sort $(wildcard $(PROJ_SRC_DIR)/*.ml)) 119 OcamlHeaders1 := $(sort $(wildcard $(PROJ_SRC_DIR)/*.mli))
|
/external/llvm/docs/ |
Makefile | 123 $(OCAMLDOC) -d $(PROJ_OBJ_DIR)/ocamldoc/html -sort -colorize-code -html \
|
/external/llvm/lib/CodeGen/ |
SlotIndexes.cpp | 102 // Sort the Idx2MBBMap 103 std::sort(idx2MBBMap.begin(), idx2MBBMap.end(), Idx2MBBCompare());
|
/external/llvm/lib/Target/XCore/ |
XCoreLowerThreadLocal.cpp | 131 std::sort(WUsers.begin(), WUsers.end());
|
/external/llvm/lib/Transforms/Scalar/ |
LoadCombine.cpp | 118 std::sort(Loads.second.begin(), Loads.second.end(),
|
/external/llvm/utils/lit/lit/ |
util.py | 100 items.sort(key = lambda item: item[1])
|
/external/mesa3d/src/mapi/glapi/gen/ |
gl_XML.py | 917 keys.sort() 921 names.sort() 956 keys.sort() 976 keys.sort()
|
/external/mesa3d/src/mesa/main/ |
APIspecutil.py | 93 names.sort()
|
/external/mockito/src/org/mockito/internal/util/reflection/ |
FieldInitializer.java | 266 Collections.sort(constructors, byParameterNumber);
|
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/ |
SampleList.java | 103 Collections.sort(keys);
|
/external/openfst/ |
depcomp | 444 }' | $cygpath_u | sort -u | sed -n ' 652 sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile"
|
/external/openfst/src/include/fst/ |
arcsort.h | 19 // Functions and classes to sort arcs in an FST. 62 sort(arcs_.begin(), arcs_.end(), comp_); 87 // sort comparision function object. It must also have a member 90 // before the sort. 108 // comparision function object (e.g. as used for STL sort). It must
|
/external/openssl/crypto/objects/ |
objects.pl | 114 foreach (sort { $a <=> $b } keys %nidn) 193 foreach (sort { $a <=> $b } keys %ordern)
|
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
TransformerImpl.java | 2318 ElemSort sort = foreach.getSortElem(i); local [all...] |
/build/core/ |
config.mk | 582 # on each line for sort to process. 583 # sort -g is a numeric sort, so 1 2 3 10 instead of 1 10 2 3. 585 # Numerically sort a list of numbers 591 ( sgrax $(1) | sort -g ) )
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
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(); [all...] |
/external/elfutils/0.153/src/ |
nm.c | 100 { "numeric-sort", 'n', NULL, 0, N_("Sort symbols numerically by address"), 102 { "no-sort", 'p', NULL, 0, N_("Do not sort the symbols"), 0 }, 103 { "reverse-sort", 'r', NULL, 0, N_("Reverse the sense of the sort"), 0 }, 204 } sort; variable in typeref:enum:__anon863 315 sort = sort_numeric; 319 sort = sort_nosort; [all...] |
/external/llvm/utils/TableGen/ |
CodeGenSchedule.cpp | 121 // Find instruction itineraries for each processor. Sort and populate 141 std::sort(ProcRecords.begin(), ProcRecords.end(), LessRecordFieldName()); 206 // Collect and sort all SchedReadWrites reachable via tablegen records. 265 std::sort(AliasDefs.begin(), AliasDefs.end(), LessRecord()); 281 // Sort and add the SchedReadWrites directly referenced by instructions or 283 std::sort(SWDefs.begin(), SWDefs.end(), LessRecord()); 288 std::sort(SRDefs.begin(), SRDefs.end(), LessRecord()); 527 std::sort(InstRWDefs.begin(), InstRWDefs.end(), LessRecord()); 684 // Sort Instrs into sets. 830 std::sort(ItinRWDefs.begin(), ItinRWDefs.end(), LessRecord()) [all...] |
/external/chromium_org/v8/test/mjsunit/harmony/ |
proxies.js | [all...] |
/external/fonttools/Lib/fontTools/ttLib/tables/ |
_c_m_a_p.py | 57 self.tables.sort() # sort according to the spec; see CmapSubtable.__lt__() 161 # implemented so that list.sort() sorts according to the spec. 710 charCodes.sort() [all...] |
/external/libvorbis/lib/ |
psy.c | 937 float **sort = alloca(n*sizeof(*sort)); local 959 /* sort magnitudes for noise norm portion of partition */ 972 sort[count++]=q+j; /* q is fabs(r) for unflagged element */ 988 qsort(sort,count,sizeof(*sort),apsort); 990 int k=sort[j]-q; [all...] |