Home
last modified time | relevance | path

Searched refs:s_i (Results 1 – 14 of 14) sorted by relevance

/external/libchrome/base/strings/
Dstring_piece.cc265 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/antlr/tool/src/main/java/org/antlr/analysis/
DDFAState.java341 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/v8/src/wasm/
Dwasm-opcodes.h285 V(I32x4Splat, 0xfd1b, s_i) \
311 V(I16x8Splat, 0xfd38, s_i) \
341 V(I8x16Splat, 0xfd57, s_i) \
406 V(S128LoadMem, 0xfd80, s_i) \
543 V(s_i, kWasmS128, kWasmI32) \
/external/tensorflow/tensorflow/contrib/linear_optimizer/kernels/g3doc/
Dreadme.md55 $$\frac{s_i}{S}$$ where $$s_i$$ is the weight of the i-th example and $$S=\sum
56 s_i$$. For our problem, this will only change $$A$$ to $$\sigma
57 X_i^2s_i/(\lambda S) $$.
/external/antlr/tool/src/main/java/org/antlr/tool/
DGrammar.java1301 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/
Dop_level_cost_estimator.cc812 s_i = smaller_rank_shape->dim_size() - bigger_rank_shape->dim_size(); in CountBatchMatMulOperations() local
813 b_i < bigger_rank_shape->dim_size() - matrix_rank; ++b_i, ++s_i) { in CountBatchMatMulOperations()
816 if (s_i >= 0) { in CountBatchMatMulOperations()
817 s_dim = smaller_rank_shape->dim(s_i).size(); in CountBatchMatMulOperations()
/external/tensorflow/tensorflow/contrib/model_pruning/
DREADME.md72 t$$). $$s_f$$ is the target_sparsity, $$s_i$$ is the initial_sparsity, $$t_0$$
/external/compiler-rt/lib/msan/tests/
Dmsan_test.cc1209 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/honggfuzz/examples/apache-httpd/corpus_http2/
Dc9969c7f0aa638c92da58f6a9c86f8c9.00008a32.honggfuzz.cov60 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��
D475971a4187a33c44ae9b99cad350767.0000c484.honggfuzz.cov94 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��
D938db24dde426d21080274713126a023.0000c484.honggfuzz.cov94 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��
Db94a68a6c63f8b03015517d514dec5a9.0001fec7.honggfuzz.cov246 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��
482 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��
/external/honggfuzz/examples/apache-httpd/corpus_http1/
Dc9969c7f0aa638c92da58f6a9c86f8c9.00008a32.honggfuzz.cov60 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��
Db94a68a6c63f8b03015517d514dec5a9.0001fec7.honggfuzz.cov246 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��
482 ����y~I�`����CX�aOs����c�U�z!Nѯ��<�v��V��-\��˰%;5˝�s_i��86�+YmG[���t+A�����D���|&���h�%��