| /external/chromium-crossbench/tests/crossbench/runner/ |
| D | test_runner.py | 57 self.runs = (
67 self.runner.runs = self.runs
70 session_ids = {run.browser_session.index for run in self.runs}
71 self.assertEqual(len(session_ids), len(self.runs))
74 groups = ThreadMode.NONE.group(self.runs)
76 self.assertTupleEqual(groups[0].runs, self.runs)
80 groups = ThreadMode.PLATFORM.group(self.runs)
83 self.assertTupleEqual(group_a.runs, self.runs[:4])
84 self.assertTupleEqual(group_b.runs, self.runs[4:])
89 groups = ThreadMode.BROWSER.group(self.runs)
[all …]
|
| /external/icu/icu4j/main/core/src/main/java/com/ibm/icu/text/ |
| D | BidiLine.java | 41 * The implementation of the access to same-level-runs and of the reordering
47 * same-level-runs is created. Reordering then is done on this vector.
52 * This is inefficient if there are many very short runs. If the average run
134 lineBidi.runs = new BidiRun[0]; in setLine()
280 /* this is done based on runs rather than on levels since levels have in getLogicalRun()
287 iRun = bidi.runs[0]; in getLogicalRun()
290 iRun = bidi.runs[i]; in getLogicalRun()
306 int start = bidi.runs[runIndex].start; in getVisualRun()
308 byte level = bidi.runs[runIndex].level; in getVisualRun()
312 bidi.runs[runIndex].limit - in getVisualRun()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | BidiLine.java | 42 * The implementation of the access to same-level-runs and of the reordering
48 * same-level-runs is created. Reordering then is done on this vector.
53 * This is inefficient if there are many very short runs. If the average run
135 lineBidi.runs = new BidiRun[0]; in setLine()
281 /* this is done based on runs rather than on levels since levels have in getLogicalRun()
288 iRun = bidi.runs[0]; in getLogicalRun()
291 iRun = bidi.runs[i]; in getLogicalRun()
307 int start = bidi.runs[runIndex].start; in getVisualRun()
309 byte level = bidi.runs[runIndex].level; in getVisualRun()
313 bidi.runs[runIndex].limit - in getVisualRun()
[all …]
|
| /external/skia/src/core/ |
| D | SkAlphaRuns.h | 65 int16_t* runs = fRuns + offsetX; in add() local
71 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
81 runs += x + 1; in add()
88 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
90 runs += x; in add()
94 int n = runs[0]; in add()
97 runs += n; in add()
105 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
119 * Break the runs in the buffer at offsets x and x+count, properly
120 * updating the runs to the right and left.
[all …]
|
| D | SkRegionPriv.h | 48 static int compute_intervalcount(const SkRegionPriv::RunType runs[]) { in compute_intervalcount() argument
49 const SkRegionPriv::RunType* curr = runs; in compute_intervalcount()
55 return SkToInt((curr - runs) >> 1); in compute_intervalcount()
145 * Given a scanline (including its Bottom value at runs[0]), return the next
146 * scanline. Asserts that there is one (i.e. runs[0] < Sentinel)
148 static SkRegion::RunType* SkipEntireScanline(const SkRegion::RunType runs[]) { in SkipEntireScanline()
150 SkASSERT(runs[0] < SkRegion_kRunTypeSentinel); in SkipEntireScanline()
152 const int intervals = runs[1]; in SkipEntireScanline()
153 SkASSERT(runs[2 + intervals * 2] == SkRegion_kRunTypeSentinel); in SkipEntireScanline()
156 int n = compute_intervalcount(&runs[2]); in SkipEntireScanline()
[all …]
|
| D | SkAlphaRuns.cpp | 29 const int16_t* runs = fRuns; in assertValid() local
32 while (*runs) { in assertValid()
34 alpha += *runs; in assertValid()
35 runs += *runs; in assertValid()
40 const int16_t* runs = fRuns; in dump() local
43 SkDebugf("Runs"); in dump()
44 while (*runs) { in dump()
45 int n = *runs; in dump()
52 runs += n; in dump()
61 const int16_t* runs = fRuns; in validate() local
[all …]
|
| D | SkRegion.cpp | 86 static SkRegionPriv::RunType* skip_intervals(const SkRegionPriv::RunType runs[]) { in skip_intervals() argument
87 int intervals = runs[-1]; in skip_intervals()
90 SkASSERT(runs[0] < runs[1]); in skip_intervals()
91 SkASSERT(runs[1] < SkRegion_kRunTypeSentinel); in skip_intervals()
94 SkASSERT(SkRegion_kRunTypeSentinel == runs[0]); in skip_intervals()
97 runs += intervals * 2 + 1; in skip_intervals()
98 return const_cast<SkRegionPriv::RunType*>(runs); in skip_intervals()
101 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count, in RunsAreARect() argument
103 assert_sentinel(runs[0], false); // top in RunsAreARect()
107 assert_sentinel(runs[1], false); // bottom in RunsAreARect()
[all …]
|
| D | SkBlitter.h | 51 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
53 /// The runs[] and antialias[] work together to represent long runs of pixels with the same
54 /// alphas. The runs[] contains the number of pixels with the same alpha, and antialias[]
55 /// contain the coverage value for that number of pixels. The runs[] (and antialias[]) are
56 /// encoded in a clever way. The runs array is zero terminated, and has enough entries for
58 /// in the runs array contains the number of pixels (np) that have the same alpha value. The
59 /// next np value is found np entries away. For example, if runs[0] = 7, then the next valid
60 /// entry will by at runs[7]. The runs array and antialias[] are coupled by index. So, if the
61 /// np entry is at runs[45] = 12 then the alpha value can be found at antialias[45] = 0x88.
63 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) = 0;
[all …]
|
| /external/cronet/tot/third_party/icu/source/common/ |
| D | ubidiln.cpp | 48 * The implementation of the access to same-level-runs and of the reordering
54 * same-level-runs is created. Reordering then is done on this vector.
59 * This is inefficient if there are many very short runs. If the average run
155 pLineBiDi->runs=nullptr; in ubidi_setLine()
318 /* this is done based on runs rather than on levels since levels have in ubidi_getLogicalRun()
322 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
325 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
349 /* runs API functions ------------------------------------------------------- */
375 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
381 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | ubidiln.cpp | 48 * The implementation of the access to same-level-runs and of the reordering
54 * same-level-runs is created. Reordering then is done on this vector.
59 * This is inefficient if there are many very short runs. If the average run
155 pLineBiDi->runs=nullptr; in ubidi_setLine()
317 /* this is done based on runs rather than on levels since levels have in ubidi_getLogicalRun()
321 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
324 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
348 /* runs API functions ------------------------------------------------------- */
374 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
380 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
[all …]
|
| /external/cronet/stable/third_party/icu/source/common/ |
| D | ubidiln.cpp | 48 * The implementation of the access to same-level-runs and of the reordering
54 * same-level-runs is created. Reordering then is done on this vector.
59 * This is inefficient if there are many very short runs. If the average run
155 pLineBiDi->runs=nullptr; in ubidi_setLine()
318 /* this is done based on runs rather than on levels since levels have in ubidi_getLogicalRun()
322 iRun=pBiDi->runs[0]; in ubidi_getLogicalRun()
325 iRun = pBiDi->runs[i]; in ubidi_getLogicalRun()
349 /* runs API functions ------------------------------------------------------- */
375 start=pBiDi->runs[runIndex].logicalStart; in ubidi_getVisualRun()
381 *pLength=pBiDi->runs[runIndex].visualLimit- in ubidi_getVisualRun()
[all …]
|
| /external/grpc-grpc-java/core/src/test/java/io/grpc/internal/ |
| D | SerializingExecutorTest.java | 38 private List<Integer> runs = new ArrayList<>(); field in SerializingExecutorTest
49 runs.add(val); in run()
78 assertThat(runs).containsExactly(2); in resumable()
85 assertEquals(Collections.<Integer>emptyList(), runs); in serial() local
87 assertEquals(Arrays.asList(1), runs); in serial()
90 assertEquals(Arrays.asList(1), runs); in serial()
92 assertEquals(Arrays.asList(1, 2), runs); in serial()
100 assertEquals(Collections.<Integer>emptyList(), runs); in parallel() local
102 assertEquals(Arrays.asList(1, 2, 3), runs); in parallel()
111 runs.add(1); in reentrant()
[all …]
|
| /external/pytorch/.github/scripts/ |
| D | rockset_mocks.json.gz | |
| D | gql_mocks.json.gz | 1{
2 "query_sha=e3d02ae0630578ecbdc5a012ecae959d0387a6d0f642a72bc4fc46dc9ee99622 name=pytorch number=105312 owner=pytorch": {
3 "data" ... |
| /external/rust/android-crates-io/crates/unicode-bidi/src/ |
| D | prepare.rs | 29 pub runs: Vec<LevelRun>, field
36 /// An isolating run sequence is a maximal sequence of level runs such that for all level runs
47 let runs = level_runs(levels, original_classes); in isolating_run_sequences() localVariable
51 let mut sequences = Vec::with_capacity(runs.len()); in isolating_run_sequences()
57 for run in runs { in isolating_run_sequences()
103 runs: sequence, in isolating_run_sequences()
108 let start_of_seq = result.runs[0].start; in isolating_run_sequences()
109 let runs_len = result.runs.len(); in isolating_run_sequences()
110 let end_of_seq = result.runs[runs_len - 1].end; in isolating_run_sequences()
130 for run in result.runs.clone() { in isolating_run_sequences()
[all …]
|
| D | deprecated.rs | 16 /// Find the level runs within a line and return them in visual order.
34 let mut runs = Vec::new(); in visual_runs() localVariable
36 // Find consecutive level runs. in visual_runs()
45 runs.push(start..i); in visual_runs()
53 runs.push(start..line.end); in visual_runs()
55 let run_count = runs.len(); in visual_runs()
57 // Re-order the odd runs. in visual_runs()
64 // Look for the start of a sequence of consecutive runs of max_level or higher. in visual_runs()
67 if levels[runs[seq_start].start] < max_level { in visual_runs()
75 if levels[runs[seq_end].start] < max_level { in visual_runs()
[all …]
|
| /external/googleapis/google/cloud/aiplatform/v1/ |
| D | schedule.proto | 32 // An instance of a Schedule periodically schedules runs to make API calls based
54 // The Schedule is active. Runs are being scheduled on the user-specified
58 // The schedule is paused. No new runs will be created until the schedule
59 // is resumed. Already started runs will be allowed to complete.
62 // The Schedule is completed. No new runs will be scheduled. Already started
63 // runs will be allowed to complete. Schedules in completed state cannot be
69 // The time specification to launch scheduled runs.
72 // runs. To explicitly set a timezone to the cron tab, apply a prefix in the
81 // The API request template to launch the scheduled runs.
104 // Optional. Timestamp after which no new runs can be scheduled.
[all …]
|
| /external/google-cloud-java/java-aiplatform/proto-google-cloud-aiplatform-v1beta1/src/main/proto/google/cloud/aiplatform/v1beta1/ |
| D | schedule.proto | 32 // An instance of a Schedule periodically schedules runs to make API calls based
54 // The Schedule is active. Runs are being scheduled on the user-specified
58 // The schedule is paused. No new runs will be created until the schedule
59 // is resumed. Already started runs will be allowed to complete.
62 // The Schedule is completed. No new runs will be scheduled. Already started
63 // runs will be allowed to complete. Schedules in completed state cannot be
69 // The time specification to launch scheduled runs.
72 // runs. To explicitly set a timezone to the cron tab, apply a prefix in the
81 // The API request template to launch the scheduled runs.
104 // Optional. Timestamp after which no new runs can be scheduled.
[all …]
|
| /external/chromium-crossbench/crossbench/runner/groups/ |
| D | thread.py | 23 """The main interface to start Runs.
25 - If runs are executed in parallel, multiple RunThreadGroup are used
28 def __init__(self, runs: Iterable[Run], index=0, throw: bool = False) -> None:
32 self._runs = tuple(runs)
33 assert self._runs, "Got unexpected empty runs list"
35 self._total_run_count = len(self._runner.runs)
42 raise ValueError("No browser sessions / runs")
47 for session_run in browser_session.runs:
54 assert run.runner is self._runner, "All Runs must have the same Runner."
65 def runs(self) -> Tuple[Run, ...]: member in RunThreadGroup
[all …]
|
| /external/zstd/.github/workflows/ |
| D | dev-long-tests.yml | 16 runs-on: ubuntu-latest
24 runs-on: ubuntu-latest
35 runs-on: macos-latest
43 runs-on: ubuntu-latest
57 runs-on: ubuntu-latest
64 runs-on: ubuntu-latest
71 runs-on: ubuntu-latest
79 runs-on: ubuntu-latest
87 runs-on: ubuntu-latest
98 runs-on: ubuntu-latest
[all …]
|
| /external/googleapis/google/cloud/aiplatform/v1beta1/ |
| D | schedule.proto | 33 // An instance of a Schedule periodically schedules runs to make API calls based
55 // The Schedule is active. Runs are being scheduled on the user-specified
59 // The schedule is paused. No new runs will be created until the schedule
60 // is resumed. Already started runs will be allowed to complete.
63 // The Schedule is completed. No new runs will be scheduled. Already started
64 // runs will be allowed to complete. Schedules in completed state cannot be
70 // The time specification to launch scheduled runs.
73 // runs. To explicitly set a timezone to the cron tab, apply a prefix in the
82 // The API request template to launch the scheduled runs.
109 // Optional. Timestamp after which no new runs can be scheduled.
[all …]
|
| /external/fsverity-utils/.github/workflows/ |
| D | ci.yml | 14 runs-on: ubuntu-latest
21 runs-on: ubuntu-latest
28 runs-on: ubuntu-latest
35 runs-on: ubuntu-latest
42 runs-on: ubuntu-latest
49 runs-on: ubuntu-latest
56 runs-on: ubuntu-latest
63 runs-on: ubuntu-latest
74 runs-on: ubuntu-latest
86 runs-on: ubuntu-latest
[all …]
|
| /external/ltp/utils/benchmark/kernbench-0.42/ |
| D | README | 12 It runs a kernel at various numbers of concurrent jobs: 1/2 number of cpus,
15 for the average of each group of runs and logs them to kernbench.log
37 kernbench [-n runs] [-o jobs] [-s] [-H] [-O] [-M] [-h] [-v]
40 s : perform single threaded runs (default don't)
41 H : don't perform half load runs (default do)
42 O : don't perform optimal load runs (default do)
43 M : don't perform maximal load runs (default do)
55 v0.40 Made all runs use the oldconfig if it exists. Changed to only do one
61 preparation and drops number of runs to 3. Modified half loads to
65 v0.20 Change to average of runs, add options to choose which runs to perform
[all …]
|
| /external/llvm/unittests/Analysis/ |
| D | CGSCCPassManagerTest.cpp | 35 TestModuleAnalysis(int &Runs) : Runs(Runs) {} in TestModuleAnalysis() argument
38 ++Runs; in run()
45 int &Runs; member in __anon23281e4c0111::TestModuleAnalysis
60 TestSCCAnalysis(int &Runs) : Runs(Runs) {} in TestSCCAnalysis() argument
63 ++Runs; in run()
70 int &Runs; member in __anon23281e4c0111::TestSCCAnalysis
85 TestFunctionAnalysis(int &Runs) : Runs(Runs) {} in TestFunctionAnalysis() argument
88 ++Runs; in run()
100 int &Runs; member in __anon23281e4c0111::TestFunctionAnalysis
114 TestImmutableFunctionAnalysis(int &Runs) : Runs(Runs) {} in TestImmutableFunctionAnalysis() argument
[all …]
|
| /external/autotest/client/tests/compilebench/ |
| D | compilebench.py | 53 # intial create total runs 10 avg 149.82 MB/s (user 0.63s sys 0.85s)
54 # create total runs 5 avg 27.50 MB/s (user 0.62s sys 0.83s)
55 # patch total runs 4 avg 15.01 MB/s (user 0.33s sys 0.63s)
56 # compile total runs 7 avg 41.47 MB/s (user 0.14s sys 0.75s)
57 # clean total runs 4 avg 697.77 MB/s (user 0.02s sys 0.08s)
58 # read tree total runs 2 avg 23.68 MB/s (user 0.85s sys 1.59s)
59 # read compiled tree total runs 1 avg 25.27 MB/s (user 0.98s sys 2.84s)
60 # delete tree total runs 2 avg 1.48 seconds (user 0.35s sys 0.45s)
61 # no runs for delete compiled tree
62 # stat tree total runs 4 avg 1.46 seconds (user 0.35s sys 0.26s)
[all …]
|