HomeSort by relevance Sort by last modified time
    Searched full:unsorted (Results 1 - 25 of 284) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/e2fsprogs/tests/f_unsorted_EAs/
name 0 unsorted EAs in inode should not be deleted
  /prebuilts/go/darwin-x86/src/sort/
example_test.go 14 s := []int{5, 2, 6, 3, 1, 4} // unsorted
27 s = []int{3, 2, 4, 1, 5} // unsorted
36 s := []float64{5.2, -1.3, 0.7, -3.8, 2.6} // unsorted
40 s = []float64{math.Inf(1), math.NaN(), math.Inf(-1), 0.0} // unsorted
55 s = []float64{5.2, 1.3, 0.7, 3.8, 2.6} // unsorted
64 s := []int{5, 2, 6, 3, 1, 4} // unsorted
sort_test.go 164 unsorted := make([]string, 1<<10)
165 for i := range unsorted {
166 unsorted[i] = strconv.Itoa(i ^ 0x2cc)
168 data := make([]string, len(unsorted))
171 copy(data, unsorted)
180 unsorted := make([]string, 1<<10)
181 for i := range unsorted {
182 unsorted[i] = strconv.Itoa(i ^ 0x2cc)
184 data := make([]string, len(unsorted))
187 copy(data, unsorted)
    [all...]
  /prebuilts/go/linux-x86/src/sort/
example_test.go 14 s := []int{5, 2, 6, 3, 1, 4} // unsorted
27 s = []int{3, 2, 4, 1, 5} // unsorted
36 s := []float64{5.2, -1.3, 0.7, -3.8, 2.6} // unsorted
40 s = []float64{math.Inf(1), math.NaN(), math.Inf(-1), 0.0} // unsorted
55 s = []float64{5.2, 1.3, 0.7, 3.8, 2.6} // unsorted
64 s := []int{5, 2, 6, 3, 1, 4} // unsorted
sort_test.go 164 unsorted := make([]string, 1<<10)
165 for i := range unsorted {
166 unsorted[i] = strconv.Itoa(i ^ 0x2cc)
168 data := make([]string, len(unsorted))
171 copy(data, unsorted)
180 unsorted := make([]string, 1<<10)
181 for i := range unsorted {
182 unsorted[i] = strconv.Itoa(i ^ 0x2cc)
184 data := make([]string, len(unsorted))
187 copy(data, unsorted)
    [all...]
  /external/autotest/client/deps/glbench-images/
README 3 glbench_sample_testoutput ... unsorted output from sample test runs (human consumption only)
  /external/tensorflow/tensorflow/core/api_def/base_api/
api_def_UnsortedSegmentProd.pbtxt 22 This operator is similar to the unsorted segment sum operator found
api_def_UnsortedSegmentMax.pbtxt 22 This operator is similar to the unsorted segment sum operator found
api_def_UnsortedSegmentMin.pbtxt 22 This operator is similar to the unsorted segment sum operator found
  /prebuilts/go/darwin-x86/src/index/suffixarray/
qsufsort.go 12 // unsorted groups. For a given pass of the sorter, all suffixes are ordered
16 // unsorted group. In each pass of the algorithm, unsorted groups are sorted
21 // An unsorted group sa[i:k] is given the group number of the index of its
50 } else { // if pi starts unsorted group
55 pk := inv[s] + 1 // pk-1 is last position of unsorted group
  /prebuilts/go/linux-x86/src/index/suffixarray/
qsufsort.go 12 // unsorted groups. For a given pass of the sorter, all suffixes are ordered
16 // unsorted group. In each pass of the algorithm, unsorted groups are sorted
21 // An unsorted group sa[i:k] is given the group number of the index of its
50 } else { // if pi starts unsorted group
55 pk := inv[s] + 1 // pk-1 is last position of unsorted group
  /external/skia/docs/
SkIRect_Reference.bmh 241 SkIRect unsorted = { 15, 5, 10, 25 };
242 SkDebugf("unsorted.fLeft: %d unsorted.left(): %d\n", unsorted.fLeft, unsorted.left());
243 SkIRect sorted = unsorted.makeSorted();
246 unsorted.fLeft: 15 unsorted.left(): 15
267 SkIRect unsorted = { 15, 25, 10, 5 };
268 SkDebugf("unsorted.fTop: %d unsorted.top(): %d\n", unsorted.fTop, unsorted.top())
    [all...]
SkRect_Reference.bmh 306 #Param irect integer unsorted bounds ##
435 SkRect unsorted = { 15, 5, 10, 25 };
436 SkDebugf("unsorted.fLeft: %g unsorted.x(): %g\n", unsorted.fLeft, unsorted.x());
437 SkRect sorted = unsorted.makeSorted();
440 unsorted.fLeft: 15 unsorted.x(): 15
461 SkRect unsorted = { 15, 25, 10, 5 }
    [all...]
  /external/skqp/docs/
SkIRect_Reference.bmh 247 SkIRect unsorted = { 15, 5, 10, 25 };
248 SkDebugf("unsorted.fLeft: %d unsorted.left(): %d\n", unsorted.fLeft, unsorted.left());
249 SkIRect sorted = unsorted.makeSorted();
252 unsorted.fLeft: 15 unsorted.left(): 15
272 SkIRect unsorted = { 15, 25, 10, 5 };
273 SkDebugf("unsorted.fTop: %d unsorted.top(): %d\n", unsorted.fTop, unsorted.top())
    [all...]
SkRect_Reference.bmh 339 #Param irect integer unsorted bounds ##
486 SkRect unsorted = { 15, 5, 10, 25 };
487 SkDebugf("unsorted.fLeft: %g unsorted.x(): %g\n", unsorted.fLeft, unsorted.x());
488 SkRect sorted = unsorted.makeSorted();
491 unsorted.fLeft: 15 unsorted.x(): 15
512 SkRect unsorted = { 15, 25, 10, 5 }
    [all...]
  /external/sfntly/cpp/src/test/
chrome_subsetter.cc 28 // The array is unsorted to verify that the subsetter gets the glyph id
  /external/skia/gm/
convexpolyeffect.cpp 28 static SkRect outset(const SkRect& unsorted) {
29 SkRect r = unsorted;
35 static SkRect sorted_rect(const SkRect& unsorted) {
36 SkRect r = unsorted;
  /external/skqp/gm/
convexpolyeffect.cpp 28 static SkRect outset(const SkRect& unsorted) {
29 SkRect r = unsorted;
35 static SkRect sorted_rect(const SkRect& unsorted) {
36 SkRect r = unsorted;
  /packages/apps/Music/tests/src/com/android/music/
MusicPlayerNames.java 37 //Unsorted input playlist name
  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/hppa/
README 32 unsorted -- this is where everything else goes. As groups of related tests
  /external/libopus/silk/
sort.c 41 opus_int32 *a, /* I/O Unsorted / Sorted vector */
89 opus_int16 *a, /* I/O Unsorted / Sorted vector */
136 opus_int16 *a, /* I/O Unsorted / Sorted vector */
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/
MappingNode.java 25 * A map is a collection of unsorted key-value pairs.
  /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/
CanonicalCharacterData.java 196 private static void sortEquivalents(String[] equivalents, Vector unsorted)
201 String v = (String) unsorted.elementAt(e);
ClassTable.java 50 public static void sort(ClassEntry[] table, Vector unsorted)
54 ClassEntry v = (ClassEntry) unsorted.elementAt(e);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/X11/extensions/
shapeproto.h 78 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */
222 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */

Completed in 1281 milliseconds

1 2 3 4 5 6 7 8 91011>>