| /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,
|
| /toolchain/binutils/binutils-2.27/gold/ |
| merge.h | 129 // Whether the ENTRIES field is sorted by input_offset.
130 bool sorted; member in struct:gold::Object_merge_map::Input_merge_map
133 : output_data(NULL), entries(), sorted(true)
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TreeMultimapNaturalTest.java | 389 SortedSetMultimap<Double, Double> sorted = Multimaps.unmodifiableSortedSetMultimap(tree); local
390 TreeMultimap<Double, Double> copyFromSorted = TreeMultimap.create(sorted);
|
| /external/skia/src/pathops/ |
| SkPathOpsWinding.cpp | 258 SkSTArray<1, SkOpRayHit*> sorted; local
261 sorted.push_back(hit);
264 int count = sorted.count();
265 SkTQSort(sorted.begin(), sorted.end() - 1, xy_index(dir)
274 hit = sorted[index];
292 hit = sorted[index];
310 const SkPoint& next = sorted[index + 1]->fPt;
|
| /external/skqp/src/pathops/ |
| SkPathOpsWinding.cpp | 258 SkSTArray<1, SkOpRayHit*> sorted; local
261 sorted.push_back(hit);
264 int count = sorted.count();
265 SkTQSort(sorted.begin(), sorted.end() - 1, xy_index(dir)
274 hit = sorted[index];
292 hit = sorted[index];
310 const SkPoint& next = sorted[index + 1]->fPt;
|
| /external/tensorflow/tensorflow/compiler/xla/tests/ |
| tuple_test.cc | 299 auto sorted = b.Select(b.Lt(x, x2), x_smaller_tuple, x2_smaller_tuple); local
300 auto smaller = b.GetTupleElement(sorted, 0);
301 auto greater = b.GetTupleElement(sorted, 1);
|
| /external/tensorflow/tensorflow/tools/proto_text/ |
| gen_proto_text_functions_lib.cc | 135 // Appends the given headers as sorted #include lines.
698 std::vector<string> sorted = headers; local
699 std::sort(sorted.begin(), sorted.end());
700 for (const auto& h : sorted) {
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/configuration/ |
| ThemeMenuAction.java | 208 List<String> sorted = new ArrayList<String>(allThemes); local
209 Collections.sort(sorted);
211 for (String theme : sorted) {
|
| /toolchain/binutils/binutils-2.27/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/deqp/external/vulkancts/modules/vulkan/tessellation/ |
| vktTessellationUtil.hpp | 387 static std::vector<T> sorted (const std::vector<T>& unsorted) function in namespace:vkt::tessellation
395 static std::vector<T> sorted (const std::vector<T>& unsorted, P pred) function in namespace:vkt::tessellation
|
| /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()) {
|
| /external/python/cpython3/Lib/unittest/test/testmock/ |
| testhelpers.py | 466 sorted = sorted variable in class:SpecSignatureTest.test_builtin_functions_types.BuiltinSubclass
479 mock.sorted([1, 2])
480 mock.sorted.assert_called_with([1, 2])
481 self.assertRaises(AttributeError, getattr, mock.sorted, 'foo')
|
| /external/swiftshader/third_party/LLVM/lib/ExecutionEngine/JIT/ |
| JIT.cpp | 123 unsigned long sorted : 1; member in struct:__anon36042::LibgccObject::__anon36043::__anon36044
|
| /frameworks/base/cmds/am/src/com/android/commands/am/ |
| Instrument.java | 125 private static Collection<String> sorted(Collection<String> list) { method in class:Instrument
160 for (String key : sorted(results.keySet())) {
181 for (String key : sorted(results.keySet())) {
283 for (final String key: sorted(bundle.keySet())) {
|
| /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...] |
| /packages/apps/DocumentsUI/src/com/android/documentsui/ |
| RecentsLoader.java | 209 final Cursor sorted = mState.sortModel.sortCursor(notMovableMasked, mFileTypeMap); local
215 sorted.setExtras(extras);
217 result.cursor = sorted;
|
| /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/ |
| LogStatistics.cpp | 404 std::unique_ptr<const PidEntry* []> sorted = local
407 if (!sorted.get()) {
414 const PidEntry* entry = sorted[index];
|
| /toolchain/binutils/binutils-2.27/ld/ |
| ld.h | 99 sort_type sorted; member in struct:wildcard_spec
|
| /tools/apkzlib/src/main/java/com/android/tools/build/apkzlib/zip/ |
| CentralDirectory.java | 421 List<StoredEntry> sorted = Lists.newArrayList(entries.values()); local
422 sorted.sort(StoredEntry.COMPARE_BY_NAME);
437 for (StoredEntry entry : 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/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/libdrm/ |
| xf86drmMode.c | 1232 /* keep it sorted by object_id and property_id */
1292 /* keep it sorted by object_id and property_id */
1614 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...] |
