HomeSort by relevance Sort by last modified time
    Searched refs:sorted (Results 1 - 25 of 1447) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/walt/ios/WALT/
NSArray+Extensions.m 21 NSArray<NSNumber *> *sorted = [self sortedArrayUsingSelector:@selector(compare:)];
22 const NSUInteger count = sorted.count;
28 return [sorted objectAtIndex:count / 2];
30 return [NSNumber numberWithDouble:0.5 * ([sorted objectAtIndex:count / 2].doubleValue +
31 [sorted objectAtIndex:count / 2 - 1].doubleValue)];
  /external/grpc-grpc/src/benchmark/
gen_build_yaml.py 32 'src': sorted(glob.glob('third_party/benchmark/src/*.cc')),
33 'headers': sorted(
  /external/mesa3d/src/egl/
egl-entrypoint-check 10 sorted=$(sort <<< "$entrypoints")
11 test "$entrypoints" = "$sorted"
  /external/swiftshader/third_party/llvm-7.0/llvm/utils/lit/tests/Inputs/shtest-env/
print_environment.py 5 sorted_environment = sorted(os.environ.items())
  /external/clang/test/CodeGenCXX/
2007-04-05-PackedBitFieldsOverlap-2.cpp 10 unsigned long sorted : 1; member in struct:M_Packed
  /external/mesa3d/src/glx/tests/
dispatch-index-check 22 # same for commented functions, we want to keep them sorted too
28 sorted=$(LC_ALL=C sort <<< "$dispatch_list")
30 test "$dispatch_list" = "$sorted"
  /external/grpc-grpc/test/core/bad_ssl/
gen_build_yaml.py 70 for t in sorted(BAD_CLIENT_TESTS.keys())] + [
86 for t in sorted(BAD_CLIENT_TESTS.keys())]}
  /external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/
DeltaFriendlyOldBlobSizeLimiter.java 42 * be the same as the input order (i.e., it has been sorted in order of decreasing compressed
70 List<QualifiedRecommendation> sorted = sortRecommendations(originalRecommendations); local
72 List<QualifiedRecommendation> result = new ArrayList<>(sorted.size());
74 for (QualifiedRecommendation originalRecommendation : sorted) {
102 List<QualifiedRecommendation> sorted = local
104 Collections.sort(sorted, COMPARATOR);
105 Collections.reverse(sorted);
106 return sorted;
TotalRecompressionLimiter.java 46 * be the same as the input order (i.e., it has been sorted in order of decreasing compressed
87 List<QualifiedRecommendation> sorted = local
89 Collections.sort(sorted, COMPARATOR);
90 Collections.reverse(sorted);
92 List<QualifiedRecommendation> result = new ArrayList<>(sorted.size());
94 for (QualifiedRecommendation originalRecommendation : sorted) {
  /external/skia/tools/
Stats.h 48 SkAutoTMalloc<double> sorted(n);
49 memcpy(sorted.get(), samples.begin(), n * sizeof(double));
50 SkTQSort(sorted.get(), sorted.get() + n - 1);
51 median = sorted[n/2];
  /external/skqp/tools/
Stats.h 48 SkAutoTMalloc<double> sorted(n);
49 memcpy(sorted.get(), samples.begin(), n * sizeof(double));
50 SkTQSort(sorted.get(), sorted.get() + n - 1);
51 median = sorted[n/2];
  /dalvik/dexgen/src/com/android/dexgen/util/
IntList.java 34 /** whether the values are currently sorted */
35 private boolean sorted; field in class:IntList
94 sorted = true;
122 if (sorted != otherList.sorted) {
199 sorted = false;
221 if (sorted && (size > 1)) {
222 sorted = (value >= values[size - 2]);
246 sorted = sorted
    [all...]
  /dalvik/dx/src/com/android/dx/util/
IntList.java 34 /** whether the values are currently sorted */
35 private boolean sorted; field in class:IntList
94 sorted = true;
122 if (sorted != otherList.sorted) {
199 sorted = false;
221 if (sorted && (size > 1)) {
222 sorted = (value >= values[size - 2]);
246 sorted = sorted
    [all...]
  /external/antlr/tool/src/main/java/org/antlr/misc/
Graph.java 84 ArrayList<T> sorted = new ArrayList<T>(); local
92 DFS(n, visited, sorted);
94 return sorted;
97 public void DFS(Node<T> n, Set<Node<T>> visited, ArrayList<T> sorted) {
102 DFS(target, visited, sorted);
105 sorted.add(n.payload);
  /external/skia/bin/
list-skia-bots 11 for j in sorted(json.load(open(path, 'r'))['jobs'].keys()):
  /external/skqp/bin/
list-skia-bots 11 for j in sorted(json.load(open(path, 'r'))['jobs'].keys()):
  /external/autotest/client/site_tests/policy_ManagedBookmarks/
policy_ManagedBookmarks.py 90 if sorted(managed) != sorted(policy_value):
93 % (sorted(managed), sorted(policy_value)))
  /external/python/cpython3/Doc/includes/
mp_newtype.py 61 assert sorted(f1._exposed_) == sorted(['f', 'g'])
69 assert sorted(f2._exposed_) == sorted(['g', '_h'])
  /external/skia/gn/
highest_version_dir.py 15 print sorted(filter(regex.match, os.listdir(dirpath)))[-1]
  /external/skqp/gn/
highest_version_dir.py 15 print sorted(filter(regex.match, os.listdir(dirpath)))[-1]
  /external/v8/tools/testrunner/local/
variants.py 46 ALL_VARIANTS = sorted(ALL_VARIANT_FLAGS.keys(),
  /cts/tests/camera/src/android/hardware/camera2/cts/rs/
raw_converter.rs 96 float3 sorted = clamp(rgb, 0.f, 1.f);
101 if (sorted.z < sorted.y) {
102 tmp = sorted.z;
103 sorted.z = sorted.y;
104 sorted.y = tmp;
107 if (sorted.y < sorted.x) {
108 tmp = sorted.y
    [all...]
  /external/catch2/include/internal/
catch_test_case_registry_impl.cpp 23 std::vector<TestCase> sorted = unsortedTestCases; local
27 std::sort( sorted.begin(), sorted.end() );
31 std::shuffle( sorted.begin(), sorted.end(), rng() );
37 return sorted;
  /external/grpc-grpc/src/boringssl/
gen_build_yaml.py 64 'src': sorted(
68 'headers': sorted(
86 for f in sorted(files['test_support'])
104 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
123 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
139 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
  /external/tensorflow/tensorflow/contrib/session_bundle/
gc.py 31 Note that functions should always return a sorted list.
96 return sorted(keepers)
127 return sorted(keeper_map.values())
148 return sorted(keepers)
167 return sorted(list(l|r))
185 return sorted(list(l-r))
216 return sorted(paths)

Completed in 1392 milliseconds

1 2 3 4 5 6 7 8 91011>>