Home
last modified time | relevance | path

Searched refs:run_index (Results 1 – 6 of 6) sorted by relevance

/external/rust/crates/unicode-bidi/src/
Dimplicit.rs45 for (run_index, level_run) in sequence.runs.iter().enumerate() { in resolve_weak()
125 .iter_forwards_from(i + ch.len_utf8(), run_index) in resolve_weak()
152 for idx in sequence.iter_backwards_from(i, run_index) { in resolve_weak()
159 for idx in sequence.iter_forwards_from(i + ch.len_utf8(), run_index) { in resolve_weak()
489 for (run_index, level_run) in run_sequence.runs.iter().enumerate() { in identify_bracket_pairs()
524 stack.push((matched.opening, actual_index, run_index)) in identify_bracket_pairs()
544 end_run: run_index, in identify_bracket_pairs()
/external/rust/crates/grpcio-sys/grpc/tools/run_tests/performance/
Dloadtest_config.py162 for run_index in gen_run_indices(runs_per_test):
164 [run_index] if run_index else uniquifier_elements)
/external/ComputeLibrary/arm_compute/graph/
DPassManager.h92 void run_index(Graph &g, size_t index);
/external/deqp/external/openglcts/modules/glesext/geometry_shader/
DesextcGeometryShaderLinking.cpp190 for (unsigned int run_index = 0; run_index < m_test_runs.size(); ++run_index) in iterate() local
192 const _run& current_run = m_test_runs[run_index]; in iterate()
461 for (unsigned int run_index = 0; run_index < m_test_runs.size(); ++run_index) in iterate() local
463 const _run& current_run = m_test_runs[run_index]; in iterate()
/external/ComputeLibrary/src/graph/
DPassManager.cpp85 void PassManager::run_index(Graph &g, size_t index) in run_index() function in arm_compute::graph::PassManager
/external/libgav1/src/dsp/
Dcdef_test.cc54 const int run_index = (num_runs == 1) ? 0 : 1; in GetDirectionDigest() local
55 return kDigest[bitdepth_index][run_index]; in GetDirectionDigest()