| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | rng_expander.cc | 30 static std::mt19937_64 rng{42}; in GlobalRandomValue() local
32 return rng(); in GlobalRandomValue()
42 StatusOr<HloInstruction*> ConvertSmallFpRngToF32Rng(HloInstruction* rng) { in ConvertSmallFpRngToF32Rng() argument
43 CHECK_EQ(rng->opcode(), HloOpcode::kRng); in ConvertSmallFpRngToF32Rng()
44 PrimitiveType primitive_type = rng->shape().element_type(); in ConvertSmallFpRngToF32Rng()
48 absl::c_transform(rng->operands(), std::back_inserter(new_operands), in ConvertSmallFpRngToF32Rng()
54 Shape shape = ShapeUtil::ChangeElementType(rng->shape(), F32); in ConvertSmallFpRngToF32Rng()
55 HloComputation* computation = rng->parent(); in ConvertSmallFpRngToF32Rng()
58 rng->CloneWithNewOperands(shape, new_operands, &context)); in ConvertSmallFpRngToF32Rng()
59 TF_RETURN_IF_ERROR(new_rng->CopyAllControlDepsFrom(rng)); in ConvertSmallFpRngToF32Rng()
[all …]
|
| /external/libxml2/test/relaxng/ |
| D | tutor1_4.rng | 1 <rng:element name="addressBook" xmlns:rng="http://relaxng.org/ns/structure/1.0">
2 <rng:zeroOrMore>
3 <rng:element name="card">
4 <rng:element name="name">
5 <rng:text/>
6 </rng:element>
7 <rng:element name="email">
8 <rng:text/>
9 </rng:element>
10 </rng:element>
[all …]
|
| /external/angle/src/tests/gl_tests/gles1/ |
| D | LightsTest.cpp | 214 angle::RNG rng(0); in TEST_P() local
229 const GLColor32F lightModelAmbient(rng.randomFloat(), rng.randomFloat(), rng.randomFloat(), in TEST_P()
230 rng.randomFloat()); in TEST_P()
231 const GLfloat lightModelTwoSide = rng.randomBool() ? 1.0f : 0.0f; in TEST_P()
248 const GLColor32F ambient(rng.randomFloat(), rng.randomFloat(), rng.randomFloat(), in TEST_P()
249 rng.randomFloat()); in TEST_P()
250 const GLColor32F diffuse(rng.randomFloat(), rng.randomFloat(), rng.randomFloat(), in TEST_P()
251 rng.randomFloat()); in TEST_P()
252 const GLColor32F specular(rng.randomFloat(), rng.randomFloat(), rng.randomFloat(), in TEST_P()
253 rng.randomFloat()); in TEST_P()
[all …]
|
| D | TextureEnvTest.cpp | 247 angle::RNG rng(0); in TEST_P() local
299 GLenum textureUnit = rng.randomSelect(validUnits); in TEST_P()
300 GLenum mode = rng.randomSelect(validEnvModes); in TEST_P()
301 GLenum combineRgb = rng.randomSelect(validCombineRgbs); in TEST_P()
302 GLenum combineAlpha = rng.randomSelect(validCombineAlphas); in TEST_P()
304 GLenum src0Rgb = rng.randomSelect(validSrcs); in TEST_P()
305 GLenum src0Alpha = rng.randomSelect(validSrcs); in TEST_P()
306 GLenum src1Rgb = rng.randomSelect(validSrcs); in TEST_P()
307 GLenum src1Alpha = rng.randomSelect(validSrcs); in TEST_P()
308 GLenum src2Rgb = rng.randomSelect(validSrcs); in TEST_P()
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| D | push_back.pass.cpp | 46 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; in test() local
47 const int N = sizeof(rng)/sizeof(rng[0]); in test()
50 C c = make<C>(size, rng[j]); in test()
60 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
61 const int N = sizeof(rng)/sizeof(rng[0]); in main()
63 test<std::deque<int> >(rng[j]); in main()
67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
68 const int N = sizeof(rng)/sizeof(rng[0]); in main()
70 test<std::deque<int, min_allocator<int>> >(rng[j]); in main()
|
| D | push_back_rvalue.pass.cpp | 50 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; in test() local
51 const int N = sizeof(rng)/sizeof(rng[0]); in test()
54 C c = make<C>(size, rng[j]); in test()
65 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
66 const int N = sizeof(rng)/sizeof(rng[0]); in main()
68 test<std::deque<MoveOnly> >(rng[j]); in main()
71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; in main() local
72 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 test<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[j]); in main()
|
| D | pop_front.pass.cpp | 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
71 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int> >(rng[i], rng[j]); in main()
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
79 const int N = sizeof(rng)/sizeof(rng[0]); in main()
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | pop_back.pass.cpp | 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
71 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int> >(rng[i], rng[j]); in main()
78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
79 const int N = sizeof(rng)/sizeof(rng[0]); in main()
82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | push_front.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
70 const int N = sizeof(rng)/sizeof(rng[0]); in main()
73 testN<std::deque<int> >(rng[i], rng[j]); in main()
77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
78 const int N = sizeof(rng)/sizeof(rng[0]); in main()
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| D | push_front_rvalue.pass.cpp | 74 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
75 const int N = sizeof(rng)/sizeof(rng[0]); in main()
78 testN<std::deque<MoveOnly> >(rng[i], rng[j]); in main()
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
82 const int N = sizeof(rng)/sizeof(rng[0]); in main()
85 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); in main()
|
| D | emplace_front.pass.cpp | 82 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
83 const int N = sizeof(rng)/sizeof(rng[0]); in main()
86 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
89 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
90 const int N = sizeof(rng)/sizeof(rng[0]); in main()
93 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| D | emplace_back.pass.cpp | 81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
82 const int N = sizeof(rng)/sizeof(rng[0]); in main()
85 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
88 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
89 const int N = sizeof(rng)/sizeof(rng[0]); in main()
92 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| D | emplace.pass.cpp | 93 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
94 const int N = sizeof(rng)/sizeof(rng[0]); in main()
97 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main()
100 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
101 const int N = sizeof(rng)/sizeof(rng[0]); in main()
104 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| /external/tensorflow/tensorflow/compiler/tests/ |
| D | matrix_triangular_solve_op_test.py | 78 rng = np.random.RandomState(0)
79 a = np.tril(rng.randn(5, 5))
80 b = rng.randn(5, 7)
85 rng = np.random.RandomState(0)
86 a = rng.randn(5, 5) # the `a` matrix is not lower-triangular
87 b = rng.randn(5, 7)
98 rng = np.random.RandomState(0)
99 a = np.tril(rng.randn(5, 5) + rng.randn(5, 5) * 1j)
100 b = rng.randn(5, 7) + rng.randn(5, 7) * 1j
105 rng = np.random.RandomState(0)
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| D | assign_size_value.pass.cpp | 67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
68 const int N = sizeof(rng)/sizeof(rng[0]); in main()
72 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
76 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
77 const int N = sizeof(rng)/sizeof(rng[0]); in main()
81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| /external/FP16/bench/ |
| D | from-ieee-array.cc | 33 auto rng = std::bind(std::uniform_real_distribution<float>(-1.0f, 1.0f), std::mt19937(seed)); in fp16_ieee_to_fp32_bits() local
38 [&rng]{ return fp16_ieee_from_fp32_value(rng()); }); in fp16_ieee_to_fp32_bits()
58 auto rng = std::bind(std::uniform_real_distribution<float>(-1.0f, 1.0f), std::mt19937(seed)); in fp16_ieee_to_fp32_value() local
63 [&rng]{ return fp16_ieee_from_fp32_value(rng()); }); in fp16_ieee_to_fp32_value()
84 auto rng = std::bind(std::uniform_real_distribution<float>(-1.0f, 1.0f), std::mt19937(seed)); in fp16_ieee_to_fp32_psimd() local
89 [&rng]{ return fp16_ieee_from_fp32_value(rng()); }); in fp16_ieee_to_fp32_psimd()
114 auto rng = std::bind(std::uniform_real_distribution<float>(-1.0f, 1.0f), std::mt19937(seed)); in fp16_ieee_to_fp32x2_psimd() local
119 [&rng]{ return fp16_ieee_from_fp32_value(rng()); }); in fp16_ieee_to_fp32x2_psimd()
145 auto rng = std::bind(std::uniform_real_distribution<float>(-1.0f, 1.0f), std::mt19937(seed)); in hardware_mm_cvtph_ps() local
150 [&rng]{ return fp16_ieee_from_fp32_value(rng()); }); in hardware_mm_cvtph_ps()
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| D | resize_size_value.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
77 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
82 const int N = sizeof(rng)/sizeof(rng[0]); in main()
86 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
|
| D | resize_size.pass.cpp | 72 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
73 const int N = sizeof(rng)/sizeof(rng[0]); in main()
77 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
82 const int N = sizeof(rng)/sizeof(rng[0]); in main()
86 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
|
| D | shrink_to_fit.pass.cpp | 62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
63 const int N = sizeof(rng)/sizeof(rng[0]); in main()
66 testN<std::deque<int> >(rng[i], rng[j]); in main()
70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
71 const int N = sizeof(rng)/sizeof(rng[0]); in main()
74 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| /external/libopus/celt/ |
| D | entenc.c | 103 while(_this->rng<=EC_CODE_BOT){ in ec_enc_normalize()
107 _this->rng<<=EC_SYM_BITS; in ec_enc_normalize()
120 _this->rng=EC_CODE_TOP; in ec_enc_init()
130 r=celt_udiv(_this->rng,_ft); in ec_encode()
132 _this->val+=_this->rng-IMUL32(r,(_ft-_fl)); in ec_encode()
133 _this->rng=IMUL32(r,(_fh-_fl)); in ec_encode()
135 else _this->rng-=IMUL32(r,(_ft-_fh)); in ec_encode()
141 r=_this->rng>>_bits; in ec_encode_bin()
143 _this->val+=_this->rng-IMUL32(r,((1U<<_bits)-_fl)); in ec_encode_bin()
144 _this->rng=IMUL32(r,(_fh-_fl)); in ec_encode_bin()
[all …]
|
| /external/angle/util/ |
| D | random_utils.h | 59 inline void FillVectorWithRandomUBytes(RNG *rng, std::vector<uint8_t> *data) in FillVectorWithRandomUBytes() argument
63 (*data)[i] = static_cast<uint8_t>(rng->randomIntBetween(0, 255)); in FillVectorWithRandomUBytes()
69 RNG rng; in FillVectorWithRandomUBytes() local
70 FillVectorWithRandomUBytes(&rng, data); in FillVectorWithRandomUBytes()
75 RNG rng(seed); in RandomVec4()
78 rng.randomFloatBetween(minValue, maxValue), rng.randomFloatBetween(minValue, maxValue), in RandomVec4()
79 rng.randomFloatBetween(minValue, maxValue), rng.randomFloatBetween(minValue, maxValue)); in RandomVec4()
|
| /external/tensorflow/tensorflow/python/kernel_tests/linalg/ |
| D | linear_operator_util_test.py | 30 rng = np.random.RandomState(0) variable
100 arr = rng.rand(2, 3, 4)
110 x = rng.rand(3, 1, 2, 1, 5)
111 y = rng.rand(4, 1, 3, 7)
128 x = rng.rand(1, 2, 1, 5)
129 y = rng.rand(1, 3, 2, 3, 7)
146 x = rng.rand(3, 1, 2, 1, 5).astype(np.float32)
147 y = rng.rand(4, 1, 3, 7).astype(np.float32)
165 x = rng.rand(1, 2, 1, 5).astype(np.float32)
166 y = rng.rand(3, 4, 1, 3, 7).astype(np.float32)
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.special/ |
| D | swap.pass.cpp | 57 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
58 const int N = sizeof(rng)/sizeof(rng[0]); in main()
62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; in main() local
91 const int N = sizeof(rng)/sizeof(rng[0]); in main()
95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| /external/guava/android/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 46 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
54 rng.nextInt(), createTree(leftChildSize, rng), createTree(rightChildSize, rng))); in createTree()
60 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
63 root = Optional.of(new BinaryNode(rng.nextInt(), root, Optional.<BinaryNode>absent())); in createTree()
70 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
73 root = Optional.of(new BinaryNode(rng.nextInt(), Optional.<BinaryNode>absent(), root)); in createTree()
84 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
87 keys[i] = rng.nextInt(); in createTree()
109 abstract Optional<BinaryNode> createTree(int size, Random rng); in createTree() argument
153 SpecialRandom rng; field in BinaryTreeTraverserBenchmark
[all …]
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 46 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
54 rng.nextInt(), createTree(leftChildSize, rng), createTree(rightChildSize, rng))); in createTree()
60 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
63 root = Optional.of(new BinaryNode(rng.nextInt(), root, Optional.<BinaryNode>absent())); in createTree()
70 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
73 root = Optional.of(new BinaryNode(rng.nextInt(), Optional.<BinaryNode>absent(), root)); in createTree()
84 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() argument
87 keys[i] = rng.nextInt(); in createTree()
109 abstract Optional<BinaryNode> createTree(int size, Random rng); in createTree() argument
153 SpecialRandom rng; field in BinaryTreeTraverserBenchmark
[all …]
|