| /aosp_15_r20/frameworks/minikin/tests/unittest/ |
| H A D | FontCollectionItemizeTest.cpp | 88 std::vector<Run> runs; in itemize() local
90 runs.push_back( in itemize()
93 return runs; in itemize()
132 auto runs = itemize(collection, "'a' 'b' 'c' 'd' 'e'", kRegularStyle); in TEST() local
133 ASSERT_EQ(1U, runs.size()); in TEST()
134 EXPECT_EQ(0, runs[0].start); in TEST()
135 EXPECT_EQ(5, runs[0].end); in TEST()
136 EXPECT_EQ(kLatinFont, getFontName(runs[0])); in TEST()
137 EXPECT_FALSE(runs[0].fakedFont.fakery.isFakeBold()); in TEST()
138 EXPECT_FALSE(runs[0].fakedFont.fakery.isFakeItalic()); in TEST()
[all …]
|
| /aosp_15_r20/external/pytorch/.github/scripts/ |
| HD | rockset_mocks.json.gz | |
| HD | gql_mocks.json.gz | 1{
2 "query_sha=e3d02ae0630578ecbdc5a012ecae959d0387a6d0f642a72bc4fc46dc9ee99622 name=pytorch number=105312 owner=pytorch": {
3 "data" ... |
| /aosp_15_r20/external/icu/icu4j/main/core/src/main/java/com/ibm/icu/text/ |
| H A 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 …]
|
| /aosp_15_r20/external/icu/android_icu4j/src/main/java/android/icu/text/ |
| H A 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 …]
|
| /aosp_15_r20/external/cronet/third_party/icu/source/common/ |
| H A 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 …]
|
| /aosp_15_r20/external/icu/icu4c/source/common/ |
| H A 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 …]
|
| /aosp_15_r20/external/skia/src/core/ |
| H A 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 …]
|
| H A 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 …]
|
| H A 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 …]
|
| H A D | SkBlitter.h | 45 /// Blit a horizontal run of antialiased pixels; runs[] is a *sparse*
47 /// The runs[] and antialias[] work together to represent long runs of pixels with the same
48 /// alphas. The runs[] contains the number of pixels with the same alpha, and antialias[]
49 /// contain the coverage value for that number of pixels. The runs[] (and antialias[]) are
50 /// encoded in a clever way. The runs array is zero terminated, and has enough entries for
52 /// in the runs array contains the number of pixels (np) that have the same alpha value. The
53 /// next np value is found np entries away. For example, if runs[0] = 7, then the next valid
54 /// entry will by at runs[7]. The runs array and antialias[] are coupled by index. So, if the
55 /// np entry is at runs[45] = 12 then the alpha value can be found at antialias[45] = 0x88.
57 virtual void blitAntiH(int x, int y, const SkAlpha antialias[], const int16_t runs[]) = 0;
[all …]
|
| H A D | SkBlitter.cpp | 57 const int16_t runs[]) {
82 int runSize = bounds.width() + 1; // +1 so we can set runs[bounds.width()] = 0 in blitFatAntiRect()
84 int16_t* runs = reinterpret_cast<int16_t*>(storage); in blitFatAntiRect() local
85 SkAlpha* alphas = reinterpret_cast<SkAlpha*>(runs + runSize); in blitFatAntiRect()
87 runs[0] = 1; in blitFatAntiRect()
88 runs[1] = bounds.width() - 2; in blitFatAntiRect()
89 runs[bounds.width() - 1] = 1; in blitFatAntiRect()
90 runs[bounds.width()] = 0; in blitFatAntiRect()
104 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
115 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
[all …]
|
| /aosp_15_r20/device/google/cuttlefish/shared/config/ |
| D | media_codecs_performance.xml | 49 <!-- 3 runs, min 849 max 1008 gmean 943 -->
53 <!-- 3 runs, min 849 max 1008 gmean 943 -->
57 <!-- 3 runs, min 496 max 629 gmean 565 -->
59 <!-- 2 runs, min 197 max 203 gmean 201 -->
61 <!-- 2 runs, min 93 max 97 gmean 95 -->
63 <!-- 2 runs, min 45 max 47 gmean 46 -->
67 <!-- 3 runs, min 496 max 629 gmean 565 -->
69 <!-- 2 runs, min 197 max 203 gmean 201 -->
71 <!-- 2 runs, min 93 max 97 gmean 95 -->
73 <!-- 2 runs, min 45 max 47 gmean 46 -->
[all …]
|
| /aosp_15_r20/cts/tests/tests/text/src/android/text/style/cts/ |
| H A D | LineBreakConfigSpanTest.kt | 108 val runs = buildMeasuredText(paint, null, text) in testLineBreakConfigSpan() constant
109 assertEquals(runs.size, 1) in testLineBreakConfigSpan()
110 assertEquals(TEST_STRING.length, runs[0].length) in testLineBreakConfigSpan()
111 assertEquals(config, runs[0].lineBreakConfig) in testLineBreakConfigSpan()
136 // runs[0] = overridden in testLineBreakConfigSpan_override()
164 val runs = buildMeasuredText(paint, null, text) in testLineBreakConfigSpan_override() constant
165 assertEquals(runs.size, 1) in testLineBreakConfigSpan_override()
166 assertEquals(TEST_STRING.length, runs[0].length) in testLineBreakConfigSpan_override()
167 assertEquals(overridden, runs[0].lineBreakConfig) in testLineBreakConfigSpan_override()
180 // runs[0] = overridden run[1] = config in testLineBreakConfigSpan_partialOverride()
[all …]
|
| /aosp_15_r20/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 …]
|
| /aosp_15_r20/external/grpc-grpc-java/core/src/test/java/io/grpc/internal/ |
| H A 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 …]
|
| /aosp_15_r20/device/generic/goldfish/camera/media/ |
| D | codecs_performance.xml | 29 <!-- 3 runs, min 849 max 1008 gmean 943 -->
33 <!-- 3 runs, min 496 max 629 gmean 565 -->
35 <!-- 2 runs, min 197 max 203 gmean 201 -->
37 <!-- 2 runs, min 93 max 97 gmean 95 -->
39 <!-- 2 runs, min 45 max 47 gmean 46 -->
43 <!-- 3 runs, min 881 max 1142 gmean 994 -->
47 <!-- 3 runs, min 249 max 285 gmean 264 -->
49 <!-- 3 runs, min 104 max 115 gmean 109 -->
51 <!-- 3 runs, min 34 max 35 gmean 34 -->
53 <!-- 3 runs, min 26 max 29 gmean 27 -->
[all …]
|
| /aosp_15_r20/external/google-cloud-java/java-bigquerydatatransfer/proto-google-cloud-bigquerydatatransfer-v1/src/main/java/com/google/cloud/bigquery/datatransfer/v1/ |
| H A D | StartManualTransferRunsResponse.java | 25 * A response to start manual transfer runs.
80 * The transfer runs that were created.
83 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
93 * The transfer runs that were created.
96 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
107 * The transfer runs that were created.
110 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
120 * The transfer runs that were created.
123 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
133 * The transfer runs that were created.
[all …]
|
| H A D | ScheduleTransferRunsResponse.java | 25 * A response to schedule transfer runs for a time range.
78 * The transfer runs that were scheduled.
81 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
91 * The transfer runs that were scheduled.
94 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
105 * The transfer runs that were scheduled.
108 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
118 * The transfer runs that were scheduled.
121 * <code>repeated .google.cloud.bigquery.datatransfer.v1.TransferRun runs = 1;</code>
131 * The transfer runs that were scheduled.
[all …]
|
| /aosp_15_r20/external/python/google-api-python-client/docs/dyn/ |
| D | bigquerydatatransfer_v1.projects.locations.transferConfigs.html | 78 …<code><a href="bigquerydatatransfer_v1.projects.locations.transferConfigs.runs.html">runs()</a></c…
80 <p class="firstline">Returns the runs Resource.</p>
90 <p class="firstline">Deletes a data transfer configuration, including any associated transfer runs …
105 …runs for a time range [start_time, end_time]. For each date - or whatever granularity the data sou…
108 …="firstline">Start manual transfer runs to be executed now with schedule_time equal to current tim…
129 …"disabled": True or False, # Is this config disabled. When set to true, no runs are sche…
136 …ng", # Pub/Sub topic where notifications will be sent after transfer runs associated with thi…
145 …# If true, automatic scheduling of data transfer runs for this configuration will be disabled. The…
146 …"endTime": "A String", # Defines time to stop scheduling transfer runs. A tran…
147 …"startTime": "A String", # Specifies time to start scheduling transfer runs. T…
[all …]
|
| D | bigquerydatatransfer_v1.projects.transferConfigs.html | 78 <code><a href="bigquerydatatransfer_v1.projects.transferConfigs.runs.html">runs()</a></code>
80 <p class="firstline">Returns the runs Resource.</p>
90 <p class="firstline">Deletes a data transfer configuration, including any associated transfer runs …
105 …runs for a time range [start_time, end_time]. For each date - or whatever granularity the data sou…
108 …="firstline">Start manual transfer runs to be executed now with schedule_time equal to current tim…
129 …"disabled": True or False, # Is this config disabled. When set to true, no runs are sche…
136 …ng", # Pub/Sub topic where notifications will be sent after transfer runs associated with thi…
145 …# If true, automatic scheduling of data transfer runs for this configuration will be disabled. The…
146 …"endTime": "A String", # Defines time to stop scheduling transfer runs. A tran…
147 …"startTime": "A String", # Specifies time to start scheduling transfer runs. T…
[all …]
|
| /aosp_15_r20/external/python/google-api-python-client/googleapiclient/discovery_cache/documents/ |
| D | bigquerydatatransfer.v1.json | 494 …iption": "Deletes a data transfer configuration, including any associated transfer runs and logs.",
640 …runs for a time range [start_time, end_time]. For each date - or whatever granularity the data sou…
669 …scription": "Start manual transfer runs to be executed now with schedule_time equal to current tim…
699 "runs": { object
703 …1/projects/{projectsId}/locations/{locationsId}/transferConfigs/{transferConfigsId}/runs/{runsId}",
705 "id": "bigquerydatatransfer.projects.locations.transferConfigs.runs.delete",
711 …transferConfigs/{config_id}/runs/{run_id}` or `projects/{project_id}/locations/{location_id}/trans…
713 … "pattern": "^projects/[^/]+/locations/[^/]+/transferConfigs/[^/]+/runs/[^/]+$",
729 …1/projects/{projectsId}/locations/{locationsId}/transferConfigs/{transferConfigsId}/runs/{runsId}",
731 "id": "bigquerydatatransfer.projects.locations.transferConfigs.runs.get",
[all …]
|
| /aosp_15_r20/external/google-cloud-java/java-bigquerydatatransfer/proto-google-cloud-bigquerydatatransfer-v1/src/main/proto/google/cloud/bigquery/datatransfer/v1/ |
| H A D | datatransfer.proto | 93 // runs and logs.
123 // Creates transfer runs for a time range [start_time, end_time].
126 // Note that runs are created per UTC time in the time range.
142 // Start manual transfer runs to be executed now with schedule_time equal to
143 // current time. The transfer runs can be created for a time range where the
161 get: "/v1/{name=projects/*/locations/*/transferConfigs/*/runs/*}"
163 get: "/v1/{name=projects/*/transferConfigs/*/runs/*}"
173 delete: "/v1/{name=projects/*/locations/*/transferConfigs/*/runs/*}"
175 delete: "/v1/{name=projects/*/transferConfigs/*/runs/*}"
181 // Returns information about running and completed transfer runs.
[all …]
|
| /aosp_15_r20/external/zstd/.github/workflows/ |
| H A 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
56 runs-on: ubuntu-latest
63 runs-on: ubuntu-20.04
70 runs-on: ubuntu-20.04
78 runs-on: ubuntu-20.04
86 runs-on: ubuntu-latest
97 runs-on: ubuntu-20.04
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/rayon/src/slice/ |
| D | mergesort.rs | 111 /// Merges non-decreasing runs `v[..mid]` and `v[mid..]` using `buf` as temporary storage, and
235 /// Examines the stack of runs and identifies the next pair of runs to merge. More specifically,
236 /// if `Some(r)` is returned, that means `runs[r]` and `runs[r + 1]` must be merged next. If the
242 /// The gist of the story is: we must enforce the invariants on the top four runs on the stack.
244 /// hold for *all* runs in the stack.
246 /// This function correctly checks invariants for the top four runs. Additionally, if the top
250 fn collapse(runs: &[Run]) -> Option<usize> { in collapse()
251 let n = runs.len(); in collapse()
254 && (runs[n - 1].start == 0 in collapse()
255 || runs[n - 2].len <= runs[n - 1].len in collapse()
[all …]
|