| /external/dhcpcd-6.8.2/ |
| if.c | 698 struct if_head sorted; local
706 TAILQ_INIT(&sorted);
708 TAILQ_INSERT_HEAD(&sorted, ifp, next);
711 TAILQ_FOREACH(ift, &sorted, next) {
718 TAILQ_INSERT_TAIL(&sorted, ifp, next);
720 TAILQ_CONCAT(ctx->ifaces, &sorted, next);
|
| /external/e2fsprogs/lib/ext2fs/ |
| ext2fsP.h | 42 int sorted; member in struct:ext2_struct_dblist
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultimapNaturalTest.java | 174 SortedSetMultimap<Double, Double> sorted = Multimaps.unmodifiableSortedSetMultimap(tree); local
175 TreeMultimap<Double, Double> copyFromSorted = TreeMultimap.create(sorted);
|
| /external/snakeyaml/src/test/java/examples/collections/ |
| TypeSafeSetImplementationsTest.java | 104 // the order is not from YAML (must be sorted)
112 private SortedSet<String> sorted; field in class:TypeSafeSetImplementationsTest.SetBean
121 return sorted;
124 public void setSorted(SortedSet<String> sorted) {
125 this.sorted = sorted;
|
| /external/squashfs-tools/kernel-2.4/fs/squashfs/ |
| squashfs2_0.c | 643 int sorted = sblk->s_major == 2 && sblk->s_minor >= 1; local
705 if (sorted && name[0] < dire->name[0])
|
| /external/valgrind/coregrind/ |
| m_xarray.c | 49 Bool sorted; /* is it sorted? */ member in struct:_XArray
76 xa->sorted = False;
125 xa->sorted = False;
202 xa->sorted = False;
222 xa->sorted = False;
231 xa->sorted = True;
277 vg_assert(xa->sorted);
348 xa->sorted = False;
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| DoubleStream.java | 182 * Returns a stream consisting of the elements of this stream in sorted
191 DoubleStream sorted(); method in interface:DoubleStream
489 * @apiNote Elements sorted by increasing absolute magnitude tend
572 * @apiNote Elements sorted by increasing absolute magnitude tend
[all...] |
| IntStream.java | 178 * Returns a stream consisting of the elements of this stream in sorted
186 IntStream sorted(); method in interface:IntStream
[all...] |
| LongStream.java | 182 * Returns a stream consisting of the elements of this stream in sorted
190 LongStream sorted(); method in interface:LongStream
[all...] |
| Stream.java | 359 * Returns a stream consisting of the elements of this stream, sorted
372 Stream<T> sorted(); method in interface:Stream
375 * Returns a stream consisting of the elements of this stream, sorted
389 Stream<T> sorted(Comparator<? super T> comparator); method in interface:Stream
[all...] |
| /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,
|
| /system/core/logd/ |
| LogStatistics.cpp | 325 std::unique_ptr<const PidEntry* []> sorted = local
328 if (!sorted.get()) {
335 const PidEntry* entry = sorted[index];
|
| /external/deqp/external/vulkancts/modules/vulkan/tessellation/ |
| vktTessellationUtil.hpp | 322 static std::vector<T> sorted (const std::vector<T>& unsorted) function in namespace:vkt::tessellation
330 static std::vector<T> sorted (const std::vector<T>& unsorted, P pred) function in namespace:vkt::tessellation
|
| /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 | 259 SkSTArray<1, SkOpRayHit*> sorted; local
262 sorted.push_back(hit);
265 int count = sorted.count();
266 SkTQSort(sorted.begin(), sorted.end() - 1, xy_index(dir)
275 hit = sorted[index];
293 hit = sorted[index];
311 const SkPoint& next = sorted[index + 1]->fPt;
|
| /packages/apps/DocumentsUI/src/com/android/documentsui/ |
| RecentsLoader.java | 199 final Cursor sorted = mState.sortModel.sortCursor(merged); local
205 sorted.setExtras(extras);
207 result.cursor = 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.25/gold/ |
| merge.h | 139 // Whether the ENTRIES field is sorted by input_offset.
140 bool sorted; member in struct:gold::Object_merge_map::Input_merge_map
143 : merge_map(NULL), entries(), sorted(true)
|
| /toolchain/binutils/binutils-2.25/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/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/swiftshader/third_party/LLVM/lib/ExecutionEngine/JIT/ |
| JIT.cpp | 123 unsigned long sorted : 1; member in struct:__anon31231::LibgccObject::__anon31232::__anon31233
|
| /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...] |
