| /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{}
56 // Spans returns all the spans used by the tree
57 func (t *Tree) Spans() SpanList { func
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]
[all …]
|
| D | optimization.go | 23 // Optimize optimizes the Tree by de-duplicating common spans into a tree of
56 if len(tc.Spans) >= minSpansInGroup {
57 key := spansetKey(tc.Spans.String())
59 spansetMap[key] = tc.Spans
79 grp: SpanGroup{Spans: set},
83 // Sort by number of spans in each sets starting with the largest.
108 a.grp.Spans = a.set.removeAll(b.set)
129 key := spansetKey(tc.Spans.String())
131 tc.Spans = nil
138 // the same spans. This span is promoted up to the parent, and the children
[all …]
|
| D | coverage_test.go | 59 checkSpans(t, tree.Spans(), span0, span1)
74 checkSpans(t, tree.Spans(), span0, span1)
89 checkSpans(t, tree.Spans(), span0, span1, span2)
104 checkSpans(t, tree.Spans(), span0, span1, span2, span3)
119 checkSpans(t, tree.Spans(), span0, span1, span2, span3)
133 checkSpans(t, tree.Spans(), span0, span1, span2, span3)
147 checkSpans(t, tree.Spans(), span0, span1, span2, span3)
161 checkSpans(t, tree.Spans(), span0, span1, span2, span3)
177 checkSpans(t, tree.Spans(), span0, span1, span2, span3)
193 checkSpans(t, tree.Spans(), span0, span1, span2, span3)
[all …]
|
| D | serialization.go | 54 for span, id := range t.spans {
77 // write the 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 {
205 for i, spanID := range group.Spans.List() {
255 if len(c.Spans) > 0 {
257 for i, spanID := range c.Spans.List() {
[all …]
|
| D | import.go | 30 // File describes the coverage spans in a single source file.
33 Covered SpanList // Spans with coverage
34 Uncovered SpanList // Compiled spans without coverage
37 // Coverage describes the coverage spans for all the source files for a single
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 | span.go | 82 // SpanList is a sorted list of spans. Use SpanList.Add() to insert new spans.
85 // Add adds the Span to the SpanList, merging and expanding overlapping spans.
116 // spans.
165 // NumLines returns the total number of lines covered by all spans in the list.
|
| /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 | navigationBarFunctionPrototypeNested.ts | 18 "spans": [
28 "spans": [
42 "spans": [
52 "spans": [
66 "spans": [
76 "spans": [
89 "spans": [
103 "spans": [
121 "spans": [
135 "spans": [
[all …]
|
| D | navigationBarFunctionPrototypeInterlaced.ts | 18 "spans": [
28 "spans": [
46 "spans": [
56 "spans": [
70 "spans": [
84 "spans": [
98 "spans": [
114 "spans": [
128 "spans": [
|
| D | navigationBarFunctionPrototypeBroken.ts | 14 "spans": [
24 "spans": [
38 "spans": [
52 "spans": [
70 "spans": [
84 "spans": [
94 "spans": [
108 "spans": [
|
| /third_party/rust/crates/syn/src/ |
| D | gen_helper.rs | 37 pub fn tokens_helper<F: Fold + ?Sized, S: Spans>(folder: &mut F, spans: &S) -> S { in tokens_helper()
38 spans.fold(folder) in tokens_helper()
41 pub trait Spans { trait
45 impl Spans for Span {
51 impl Spans for [Span; 1] { impl
57 impl Spans for [Span; 2] { impl
63 impl Spans for [Span; 3] { impl
79 pub fn tokens_helper<'ast, V: Visit<'ast> + ?Sized, S: Spans>(visitor: &mut V, spans: &S) { in tokens_helper()
80 spans.visit(visitor); in tokens_helper()
83 pub trait Spans { trait
[all …]
|
| D | span.rs | 45 fn from_spans(spans: &[Span]) -> Self; in from_spans()
50 fn from_spans(spans: &[Span]) -> Self { in from_spans()
51 [spans[0]] in from_spans()
57 fn from_spans(spans: &[Span]) -> Self { in from_spans()
58 [spans[0], spans[1]] in from_spans()
64 fn from_spans(spans: &[Span]) -> Self { in from_spans()
65 [spans[0], spans[1], spans[2]] in from_spans()
|
| D | custom_punctuation.rs | 23 /// - Field access to its spans — `let spans = lrarrow.spans`
81 pub spans: $crate::custom_punctuation_repr!($($tt)+),
87 spans: __S,
91 spans: $crate::__private::IntoSpans::into_spans(spans)
126 let spans: $crate::custom_punctuation_repr!($($tt)+) = localVariable
128 Ok($ident(spans))
150 … $crate::token::printing::punct($crate::stringify_punct!($($tt)+), &self.spans, tokens)
|
| D | token.rs | 142 /// Support writing `token.span` rather than `token.spans[0]` on tokens that
374 pub spans: [Span; $len],
379 pub fn $name<S: IntoSpans<[Span; $len]>>(spans: S) -> $name {
381 spans: spans.into_spans(),
388 spans: [Span::call_site(); $len],
447 printing::punct($token, &self.spans, tokens);
456 spans: parsing::punct(input, $token)?,
916 let mut spans = [input.span(); 3]; in punct() localVariable
917 punct_helper(input, token, &mut spans)?; in punct()
918 Ok(S::from_spans(&spans)) in punct()
[all …]
|
| /third_party/rust/crates/regex/regex-syntax/src/ |
| D | error.rs | 106 let spans = Spans::from_formatter(self); in fmt() localVariable
112 let notated = spans.notate(); in fmt()
115 // If we have error spans that cover multiple lines, then we just in fmt()
117 if !spans.multi_line.is_empty() { in fmt()
119 for span in &spans.multi_line { in fmt()
133 let notated = Spans::from_formatter(self).notate(); in fmt()
141 /// This type represents an arbitrary number of error spans in a way that makes
145 /// Technically, we can only ever have two spans given our current error
147 /// two spans, it became obvious that an algorithm to handle an arbitrary
148 /// number of spans was actually much simpler.
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | UnicodeSetSpanner.java | 19 * its inverse. That is, the code spans, then spans for the inverse, then spans, and so on.
91 …* Collapse spans. That is, modify/count the entire matching span as a single item, instead of sepa…
113 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
124 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
137 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
175 * Delete all the matching spans in sequence, using SpanCondition.SIMPLE
176 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
178 * charsequence to replace matching spans in.
186 * Delete all matching spans in sequence, according to the spanCondition.
187 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
[all …]
|
| /third_party/rust/crates/proc-macro-error/test-crate/ |
| D | lib.rs | 55 let mut spans = input.into_iter().step_by(2).map(|t| t.span()); in emit() localVariable
57 spans.next().unwrap(), in emit()
61 spans.next().unwrap(), in emit()
65 emit_error!(spans.next().unwrap(), "emit!(span, single_expr) test"); in emit()
67 spans.next().unwrap().into(), in emit()
76 emit_warning!(spans.next().unwrap(), "emit_warning! test"); in emit()
87 let mut spans = input.into_iter().map(|s| s.span()); in abort_notes() localVariable
88 let span = spans.next().unwrap(); in abort_notes()
89 let span2 = spans.next().unwrap(); in abort_notes()
117 let mut spans = input.into_iter().step_by(2).map(|s| s.span()); in emit_notes() localVariable
[all …]
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | UnicodeSetSpanner.java | 18 * its inverse. That is, the code spans, then spans for the inverse, then spans, and so on.
102 …* Collapse spans. That is, modify/count the entire matching span as a single item, instead of sepa…
128 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
141 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
156 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
196 * Delete all the matching spans in sequence, using SpanCondition.SIMPLE
197 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
199 * charsequence to replace matching spans in.
209 * Delete all matching spans in sequence, according to the spanCondition.
210 …* The code alternates spans; see the class doc for {@link UnicodeSetSpanner} for a note about boun…
[all …]
|
| /third_party/rust/crates/syn/src/gen/ |
| D | visit.rs | 797 tokens_helper(v, &it.spans); in visit_angle_bracketed_generic_arguments()
799 tokens_helper(v, &node.lt_token.spans); in visit_angle_bracketed_generic_arguments()
804 tokens_helper(v, &p.spans); in visit_angle_bracketed_generic_arguments()
807 tokens_helper(v, &node.gt_token.spans); in visit_angle_bracketed_generic_arguments()
822 tokens_helper(v, &node.fat_arrow_token.spans); in visit_arm()
825 tokens_helper(v, &it.spans); in visit_arm()
836 tokens_helper(v, &_binding_0.spans); in visit_attr_style()
845 tokens_helper(v, &node.pound_token.spans); in visit_attribute()
861 tokens_helper(v, &(it).1.spans); in visit_bare_fn_arg()
872 tokens_helper(v, &_binding_0.spans); in visit_bin_op()
[all …]
|
| D | visit_mut.rs | 798 tokens_helper(v, &mut it.spans); in visit_angle_bracketed_generic_arguments_mut()
800 tokens_helper(v, &mut node.lt_token.spans); in visit_angle_bracketed_generic_arguments_mut()
805 tokens_helper(v, &mut p.spans); in visit_angle_bracketed_generic_arguments_mut()
808 tokens_helper(v, &mut node.gt_token.spans); in visit_angle_bracketed_generic_arguments_mut()
823 tokens_helper(v, &mut node.fat_arrow_token.spans); in visit_arm_mut()
826 tokens_helper(v, &mut it.spans); in visit_arm_mut()
837 tokens_helper(v, &mut _binding_0.spans); in visit_attr_style_mut()
846 tokens_helper(v, &mut node.pound_token.spans); in visit_attribute_mut()
862 tokens_helper(v, &mut (it).1.spans); in visit_bare_fn_arg_mut()
873 tokens_helper(v, &mut _binding_0.spans); in visit_bin_op_mut()
[all …]
|
| D | fold.rs | 802 .map(|it| Token)), in fold_angle_bracketed_generic_arguments()
803 lt_token: Token), in fold_angle_bracketed_generic_arguments()
805 gt_token: Token), in fold_angle_bracketed_generic_arguments()
821 fat_arrow_token: Token), in fold_arm()
823 comma: (node.comma).map(|it| Token)), in fold_arm()
834 AttrStyle::Inner(Token)) in fold_attr_style()
844 pound_token: Token), in fold_attribute()
861 Token.1.spans)), in fold_bare_fn_arg()
873 BinOp::Add(Token)) in fold_bin_op()
876 BinOp::Sub(Token)) in fold_bin_op()
[all …]
|
| /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()
338 /* This function averages inflated spans in direct rendering mode */
342 const FT_Span* spans, in ft_smooth_overlap_spans() argument
350 /* When accumulating the oversampled spans we need to assure that */ in ft_smooth_overlap_spans()
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()
[all …]
|
| /third_party/skia/third_party/externals/freetype/docs/ |
| D | raster.txt | 18 2. Profiles and Spans
24 f. Sweeping and Sorting the Spans
164 2. Profiles and Spans
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
565 f. Sweeping and Sorting the Spans
568 build (and fill) the spans.
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/docs/ |
| D | Regres.md | 259 ##### Spans l4subsection
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/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/ |
| D | Trie.java | 15 * Trie constructed by adding "spans" of data representing prefix
30 * where the {@code process} method may create more sub-spans, and eventually
34 * <p>Since spans share a common buffer for prefix data, it is important
35 * that extended spans are consumed before the parent span is used again.
|