| /third_party/typescript/tests/cases/fourslash/ |
| D | navigationBarInitializerSpans.ts | 20 ] = test.spans();
27 spans: [sGlobal],
32 spans: [s1],
38 spans: [s1Child],
46 spans: [s0],
52 spans: [s0Child],
60 spans: [s2],
66 spans: [s2Child],
72 spans: [s2GrandChildName],
86 spans: [sGlobal],
[all …]
|
| D | fourslash.ts | 183 spans(): Array<{ start: number, length: number }>;
326 …outliningSpansInCurrentFile(spans: Range[], kind?: "comment" | "region" | "code" | "imports"): voi…
327 outliningHintSpansInCurrentFile(spans: Range[]): void;
|
| /third_party/skia/third_party/externals/swiftshader/tests/regres/cov/ |
| D | tree.go | 41 spans map[Span]SpanID member
49 t.spans = map[Span]SpanID{}
58 out := make(SpanList, len(t.spans))
59 for span, id := range t.spans {
91 func (t *Tree) addSpans(spans SpanList) SpanSet {
92 out := make(SpanSet, len(spans))
93 for _, s := range spans {
94 id, ok := t.spans[s]
96 id = SpanID(len(t.spans))
97 t.spans[s] = id
[all …]
|
| D | import.go | 144 func appendSpan(spans []Span, span Span) []Span {
145 if c := len(spans); c > 0 && spans[c-1].End == span.Start {
146 spans[c-1].End = span.End
148 spans = append(spans, span)
150 return spans
|
| D | serialization.go | 54 for span, id := range t.spans {
114 spans := make([]spanAndID, 0, len(t.spans))
115 for span, id := range t.spans {
116 spans = append(spans, spanAndID{span, id})
118 sort.Slice(spans, func(i, j int) bool { return spans[i].id < spans[j].id })
121 for i, s := range spans {
321 for span, id := range tree.spans {
354 p.tree.spans[p.parseSpan()] = SpanID(idx)
|
| D | coverage_test.go | 226 0: cov.SpanGroup{Spans: spans(0, 1)},
227 1: cov.SpanGroup{Spans: spans(0, 3)},
228 2: cov.SpanGroup{Spans: spans(1, 2)},
264 0: cov.SpanGroup{Spans: spans(0, 1)},
333 func coverage(file string, spans ...cov.Span) *cov.Coverage {
338 Covered: spans,
344 func spans(ids ...cov.SpanID) cov.SpanSet { func
|
| /third_party/freetype/src/smooth/ |
| D | ftsmooth.c | 113 const FT_Span* spans, in ft_smooth_lcd_spans() argument
121 for ( ; count--; spans++ ) in ft_smooth_lcd_spans()
122 for ( dst = dst_line + spans->x * 3, w = spans->len; w--; dst += 3 ) in ft_smooth_lcd_spans()
123 *dst = spans->coverage; in ft_smooth_lcd_spans()
342 const FT_Span* spans, in ft_smooth_overlap_spans() argument
355 for ( ; count--; spans++ ) in ft_smooth_overlap_spans()
357 cover = ( spans->coverage + SCALE * SCALE / 2 ) / ( SCALE * SCALE ); in ft_smooth_overlap_spans()
358 for ( x = 0; x < spans->len; x++ ) in ft_smooth_overlap_spans()
360 sum = dst[( spans->x + x ) / SCALE] + cover; in ft_smooth_overlap_spans()
361 dst[( spans->x + x ) / SCALE] = (unsigned char)( sum - ( sum >> 8 ) ); in ft_smooth_overlap_spans()
|
| /third_party/skia/third_party/externals/freetype/src/smooth/ |
| D | ftsmooth.c | 113 const FT_Span* spans, in ft_smooth_lcd_spans() argument
121 for ( ; count--; spans++ ) in ft_smooth_lcd_spans()
122 for ( dst = dst_line + spans->x * 3, w = spans->len; w--; dst += 3 ) in ft_smooth_lcd_spans()
123 *dst = spans->coverage; in ft_smooth_lcd_spans()
342 const FT_Span* spans, in ft_smooth_overlap_spans() argument
355 for ( ; count--; spans++ ) in ft_smooth_overlap_spans()
357 cover = ( spans->coverage + SCALE * SCALE / 2 ) / ( SCALE * SCALE ); in ft_smooth_overlap_spans()
358 for ( x = 0; x < spans->len; x++ ) in ft_smooth_overlap_spans()
360 sum = dst[( spans->x + x ) / SCALE] + cover; in ft_smooth_overlap_spans()
361 dst[( spans->x + x ) / SCALE] = (unsigned char)( sum - ( sum >> 8 ) ); in ft_smooth_overlap_spans()
|
| /third_party/typescript/src/services/ |
| D | classifier.ts | 48 const spans: number[] = []; constant
78 … pushEncodedClassification(scanner.getTokenPos(), end, offset, classFromKind(token), spans);
172 return { endOfLineState, spans };
258 const dense = classifications.spans;
484 const spans: number[] = []; constant
505 return { spans, endOfLineState: EndOfLineState.None };
510 spans.push(start);
511 spans.push(length);
512 spans.push(type);
584 Debug.assert(classifications.spans.length % 3 === 0);
[all …]
|
| D | patternMatcher.ts | 145 let spans = stringToWordSpans.get(word);
146 if (!spans) {
147 stringToWordSpans.set(word, spans = breakIntoWordSpans(word));
149 return spans;
|
| D | classifier2020.ts | 21 Debug.assert(classifications.spans.length % 3 === 0);
22 const dense = classifications.spans;
36 spans: getSemanticTokens(program, sourceFile, span, cancellationToken),
|
| D | navigationBar.ts | 812 spans: getSpans(n),
823 spans: getSpans(n),
835 spans: getSpans(n),
845 const spans = [getNodeSpan(n.node)]; constant
848 spans.push(getNodeSpan(node));
851 return spans;
|
| /third_party/mesa3d/.gitlab/issue_templates/ |
| D | Bug Report.md | 5 …races, etc - use [code blocks](https://docs.gitlab.com/ee/user/markdown.html#code-spans-and-blocks)
15 …with triple backticks](https://docs.gitlab.com/ee/user/markdown.html#code-spans-and-blocks)) OR fi…
|
| D | Bug Report - AMD Radeon Vulkan.md | 5 …races, etc - use [code blocks](https://docs.gitlab.com/ee/user/markdown.html#code-spans-and-blocks)
43 …with triple backticks](https://docs.gitlab.com/ee/user/markdown.html#code-spans-and-blocks)) OR fi…
|
| /third_party/PyYAML/tests/data/ |
| D | spec-02-18.data | 3 spans many lines.
|
| /third_party/skia/third_party/externals/swiftshader/docs/ |
| D | Regres.md | 261 Code coverage information is described in spans.
302 coverage spans.
341 coverage spans with every leaf node (test) in this tree.
344 now do a few tricks to dramatically reduce number of spans needed to describe
349 The first compression scheme is to promote common spans up the tree when they
350 are common for all children. This will reduce the number of spans needed to be
416 With real world data, we encounter groups of spans that are commonly found
419 The XOR'ing of spans as described above is performed as if the spans were not
424 All spans, span-groups and strings are stored in de-duplicated tables, and are
|
| /third_party/skia/third_party/externals/freetype/docs/ |
| D | raster.txt | 180 bitmap. These segments are called `spans'.
191 _----------_ with spans.
214 /---/ |---| several spans per scanline.
225 /---/ |---| And then turn on the spans a-b
240 o The number of spans on the current scanline, given by the
568 build (and fill) the spans.
582 Creating spans is thus straightforward:
600 There are then two spans, joining
616 Once the spans have been `created', we can simply draw them in
|
| /third_party/flutter/skia/third_party/externals/freetype/docs/ |
| D | raster.txt | 180 bitmap. These segments are called `spans'.
191 _----------_ with spans.
214 /---/ |---| several spans per scanline.
225 /---/ |---| And then turn on the spans a-b
240 o The number of spans on the current scanline, given by the
568 build (and fill) the spans.
582 Creating spans is thus straightforward:
600 There are then two spans, joining
616 Once the spans have been `created', we can simply draw them in
|
| /third_party/freetype/docs/ |
| D | raster.txt | 180 bitmap. These segments are called `spans'.
191 _----------_ with spans.
214 /---/ |---| several spans per scanline.
225 /---/ |---| And then turn on the spans a-b
240 o The number of spans on the current scanline, given by the
568 build (and fill) the spans.
582 Creating spans is thus straightforward:
600 There are then two spans, joining
616 Once the spans have been `created', we can simply draw them in
|
| /third_party/typescript/src/testRunner/unittests/services/ |
| D | patternMatcher.ts | 333 function spanListToSubstrings(identifier: string, spans: ts.TextSpan[]) {
334 return spans.map(s => identifier.substr(s.start, s.length));
|
| /third_party/typescript/src/services/refactors/ |
| D | convertStringOrTemplateLiteral.ts | 196 const spans = map(currentNode.templateSpans, (span, index) => { constant
202 templateSpans.push(...spans);
|
| /third_party/pixman/ |
| D | CODING_STYLE | 67 * If a substatement spans multiple lines, then there must be braces
70 * If the condition of an if/while/for spans multiple lines, then
|
| /third_party/typescript/src/harness/ |
| D | fourslashImpl.ts | 2712 const spans = this.languageService.getOutliningSpans(this.activeFile.fileName); constant
2713 Harness.IO.log(`Outlining spans (${spans.length} items)\nResults:`);
2714 Harness.IO.log(stringify(spans));
2715 this.printOutliningSpansInline(spans);
2718 private printOutliningSpansInline(spans: ts.OutliningSpan[]) {
2721 ts.forEach(spans, span => {
2733 … public verifyOutliningSpans(spans: Range[], kind?: "comment" | "region" | "code" | "imports") {
2737 if (filterActual.length !== spans.length) {
2738 …this.raiseError(`verifyOutliningSpans failed - expected total spans to be ${spans.length}, but was…
2741 ts.zipWith(spans, filterActual, (expectedSpan, actualSpan, i) => {
[all …]
|
| D | fourslashInterfaceImpl.ts | 26 public spans(): ts.TextSpan[] { method in FourSlashInterface.Test
415 …public outliningSpansInCurrentFile(spans: FourSlash.Range[], kind?: "comment" | "region" | "code" …
416 this.state.verifyOutliningSpans(spans, kind);
419 public outliningHintSpansInCurrentFile(spans: FourSlash.Range[]) {
420 this.state.verifyOutliningHintSpans(spans);
|
| /third_party/protobuf/objectivec/Tests/ |
| D | unittest_cycle.proto | 37 // You can't make a object graph that spans files, so this can only be done
|