Searched refs:s_i (Results 1 – 11 of 11) sorted by relevance
| /external/libchrome/base/strings/ |
| D | string_piece.cc | 265 for (size_t s_i = 0; s_i < s.size(); ++s_i) { in find_first_not_of() local
266 if (self[self_i] == s[s_i]) { in find_first_not_of()
333 for (size_t s_i = 0; s_i < s.size(); s_i++) { in find_last_of() local
334 if (self.data()[self_i] == s[s_i]) in find_last_of()
378 for (size_t s_i = 0; s_i < s.size(); s_i++) { in find_last_not_of() local
379 if (self.data()[self_i] == s[s_i]) { in find_last_not_of()
|
| /external/python/cpython3/Lib/test/ |
| D | test_defaultdict.py | 195 s_i = s | i
196 self.assertIs(s_i.default_factory, str)
197 self.assertDictEqual(s_i, {0: "zero", 1: 1, 2: 2})
198 self.assertEqual(list(s_i), [0, 1, 2])
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/tasks/ |
| D | conv_constants.cc | 211 std::string s_i = std::to_string(i); in GenerateConvolutionConstantCode() local
213 c += " FLT4 res = TO_FLT4(r" + s_i + ") + args.biases.Read(" + s_i + in GenerateConvolutionConstantCode()
215 c += " args.dst_tensor.Write(res, X, Y, " + s_i + ");\n"; in GenerateConvolutionConstantCode()
|
| D | conv_metal.cc | 241 const std::string s_i = in GenerateConvolution() local
244 " ACCUM_FLT4 r" + s_i + " = ACCUM_FLT4(0.0f, 0.0f, 0.0f, 0.0f);\n"; in GenerateConvolution()
|
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | DFAState.java | 341 IntSet s_i = rl.getSet(); in addReachableLabel() local
342 IntSet intersection = s_i.and(t); in addReachableLabel()
346 IntSet existingMinusNewElements = s_i.subtract(t); in addReachableLabel()
361 remainder = t.subtract(s_i); in addReachableLabel()
|
| /external/libsrtp2/fuzzer/corpus/ |
| D | f06191d918adb094a1463bc1d3203cec72aaa384 | 1 iminimize_crash_inte���s��Q����{{{{�������{����{{������s.......�.{{{{{s!���s�{s�{s_i{{�__.n�…
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| D | Grammar.java | 1301 IntervalSet s_i = disjointSets.get(i); in makeEdgeSetsDisjoint() local
1303 if ( t.and(s_i).isNil() ) { // nothing in common in makeEdgeSetsDisjoint()
1313 IntervalSet intersection = s_i.and(t); in makeEdgeSetsDisjoint()
1317 IntervalSet existingMinusNewElements = s_i.subtract(t); in makeEdgeSetsDisjoint()
1326 remainder = t.subtract(s_i); in makeEdgeSetsDisjoint()
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | op_level_cost_estimator.cc | 1295 s_i = smaller_rank_shape->dim_size() - bigger_rank_shape->dim_size(); in CountBatchMatMulOperations() local
1296 b_i < bigger_rank_shape->dim_size() - matrix_rank; ++b_i, ++s_i) { in CountBatchMatMulOperations()
1299 if (s_i >= 0) { in CountBatchMatMulOperations()
1300 s_dim = smaller_rank_shape->dim(s_i).size(); in CountBatchMatMulOperations()
|
| /external/compiler-rt/lib/msan/tests/ |
| D | msan_test.cc | 1209 struct shm_info s_i; in TEST() local
1210 res = shmctl(id, SHM_INFO, (struct shmid_ds *)&s_i); in TEST()
1212 EXPECT_NOT_POISONED(s_i); in TEST()
|
| /external/llvm-project/compiler-rt/lib/msan/tests/ |
| D | msan_test.cpp | 1303 struct shm_info s_i; in TEST() local
1304 res = shmctl(id, SHM_INFO, (struct shmid_ds *)&s_i); in TEST()
1306 EXPECT_NOT_POISONED(s_i); in TEST()
|
| /external/llvm-project/mlir/include/mlir/Dialect/Vector/ |
| D | VectorOps.td | 297 we have s_i = t_i for all 1 < i <= k
|