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

1 2 3 4 5 6 7 8 91011>>

  /external/eigen/unsupported/test/
cxx11_tensor_shuffling.cpp 29 no_shuffle = tensor.shuffle(shuffles);
50 Tensor<float, 4, DataLayout> shuffle; local
51 shuffle = tensor.shuffle(shuffles);
53 VERIFY_IS_EQUAL(shuffle.dimension(0), 5);
54 VERIFY_IS_EQUAL(shuffle.dimension(1), 7);
55 VERIFY_IS_EQUAL(shuffle.dimension(2), 3);
56 VERIFY_IS_EQUAL(shuffle.dimension(3), 2);
62 VERIFY_IS_EQUAL(tensor(i,j,k,l), shuffle(k,l,j,i));
82 expected = tensor.shuffle(shuffles)
198 Tensor<float, 4, DataLayout> shuffle; local
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/
random_shuffle_urng.pass.cpp 13 // void shuffle(RandomAccessIterator first, RandomAccessIterator last,
27 std::shuffle(ia, ia+sa, g);
29 std::shuffle(ia, ia+sa, g);
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/
random_shuffle_urng.pass.cpp 13 // void shuffle(RandomAccessIterator first, RandomAccessIterator last,
27 std::shuffle(ia, ia+sa, g);
29 std::shuffle(ia, ia+sa, g);
  /external/webp/src/dsp/
lossless_enc_neon.c 40 const uint8x16_t shuffle) {
41 return vcombine_u8(vtbl1q_u8(argb, vget_low_u8(shuffle)),
42 vtbl1q_u8(argb, vget_high_u8(shuffle)));
49 const uint8x8_t shuffle) {
50 return vcombine_u8(vtbl1_u8(vget_low_u8(argb), shuffle),
51 vtbl1_u8(vget_high_u8(argb), shuffle));
58 const uint8x16_t shuffle = vld1q_u8(kGreenShuffle); local
60 const uint8x8_t shuffle = vld1_u8(kGreenShuffle); local
64 const uint8x16_t greens = DoGreenShuffle(argb, shuffle);
95 const uint8x16_t shuffle = vld1q_u8(kg0g0) local
98 const uint8x8_t shuffle = vld1_u8(k0g0g); local
    [all...]
  /platform_testing/libraries/longevity/src/android/platform/longevity/scheduler/
Shuffle.java 29 public class Shuffle implements Scheduler {
30 static final String SHUFFLE_OPTION_NAME = "shuffle";
36 boolean shuffle = Boolean.parseBoolean(
41 if (shuffle) {
42 Collections.shuffle(input, new Random(seed));
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/
random_shuffle_urng.pass.cpp 13 // void shuffle(RandomAccessIterator first, RandomAccessIterator last,
29 std::shuffle(ia, ia+sa, g);
32 std::shuffle(ia, ia+sa, std::move(g));
  /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/
push_heap.pass.cpp 29 std::shuffle(ia, ia+N, randomness);
push_heap_comp.pass.cpp 41 std::shuffle(ia, ia+N, randomness);
60 std::shuffle(ia, ia+N, randomness);
  /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/
make_heap.pass.cpp 28 std::shuffle(ia, ia+N, randomness);
make_heap_comp.pass.cpp 41 std::shuffle(ia, ia+N, randomness);
69 std::shuffle(ia, ia+N, randomness);
95 std::shuffle(ia, ia+N, randomness);
  /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
pop_heap.pass.cpp 28 std::shuffle(ia, ia+N, randomness);
pop_heap_comp.pass.cpp 41 std::shuffle(ia, ia+N, randomness);
62 std::shuffle(ia, ia+N, randomness);
  /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/
sort_heap.pass.cpp 28 std::shuffle(ia, ia+N, randomness);
sort_heap_comp.pass.cpp 40 std::shuffle(ia, ia+N, randomness);
62 std::shuffle(ia, ia+N, randomness);
  /external/r8/src/test/java/com/android/tools/r8/internal/
R8GMSCoreDeterministicTest.java 31 public List<DexEncodedMethod> shuffle(List<DexEncodedMethod> methods) { method in class:R8GMSCoreDeterministicTest
32 Collections.shuffle(methods);
42 // For this test just do random shuffle.
43 options.testing.irOrdering = this::shuffle;
  /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
minmax_element.pass.cpp 52 std::shuffle(a, a+N, randomness);
72 std::shuffle(a, a+N, randomness);
minmax_element_comp.pass.cpp 56 std::shuffle(a, a+N, randomness);
76 std::shuffle(a, a+N, randomness);
  /libcore/benchmarks/src/benchmarks/regression/
PriorityQueueBenchmark.java 48 // shuffle these elements so that we get a reasonable distribution of missed elements
49 Collections.shuffle(allElements, random);
64 // shuffle again so that elements are accessed in a different pattern than they were
66 Collections.shuffle(seekElements, random);
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/sparc/
splet.s 69 ! test SHUFFLE
71 shuffle %l0, 0x1, %l1
72 shuffle %l0, 0x2, %l1
73 shuffle %l0, 0x4, %l1
74 shuffle %l0, 0x8, %l1
75 shuffle %l0, 0x10, %l1
76 shuffle %l0, 0x18, %l1
  /frameworks/base/services/tests/notification/src/com/android/server/notification/
GlobalSortKeyComparatorTest.java 78 Collections.shuffle(actual);
108 Collections.shuffle(actual);
138 Collections.shuffle(actual);
  /external/protobuf/ruby/lib/google/protobuf/
repeated_field.rb 77 :rindex, :rotate, :sample, :shuffle, :shelljoin, :slice,
159 rotate! select! shuffle! sort! sort_by! uniq!).each do |method_name|
  /external/python/cpython2/Lib/test/
test_ordered_dict.py 3 from random import shuffle
82 shuffle(pairs)
106 shuffle(pairs)
120 shuffle(pairs)
130 shuffle(pairs)
132 shuffle(pairs)
154 shuffle(pairs)
225 shuffle(pairs)
  /toolchain/binutils/binutils-2.25/bfd/
ecofflink.c 327 struct shuffle
330 struct shuffle *next;
358 /* Linked lists describing how to shuffle the input debug
361 struct shuffle *line;
362 struct shuffle *line_end;
363 struct shuffle *pdr;
364 struct shuffle *pdr_end;
365 struct shuffle *sym;
366 struct shuffle *sym_end;
367 struct shuffle *opt
325 struct shuffle struct
    [all...]
  /external/autotest/client/site_tests/firmware_TouchMTB/tests/
geometry_unittest.py 104 # Shuffle the two clusters, and then test the get_two_farthest_clusters
111 random.shuffle(points, lambda: 0.1234)
  /external/caliper/examples/src/main/java/examples/
ContainsBenchmark.java 50 Collections.shuffle(queries, new Random(0));

Completed in 3780 milliseconds

1 2 3 4 5 6 7 8 91011>>