Searched full:spans (Results 1 – 25 of 270) sorted by relevance
1234567891011
54 Object[] spans = spanStr.getSpans(0, TEST_STRING.length(), Object.class); in testRemoveSpan() local55 assertThat(spans, notNullValue()); in testRemoveSpan()56 assertThat(spans.length, equalTo(1)); in testRemoveSpan()57 assertThat((UnderlineSpan) spans[0], sameInstance(s2)); in testRemoveSpan()67 Object[] spans = spanStr.getSpans(0, TEST_STRING.length(), Object.class); in testGetSpans() local68 assertThat(spans, notNullValue()); in testGetSpans()69 assertThat(spans.length, equalTo(2)); in testGetSpans()72 spans = spanStr.getSpans(0, TEST_STRING.length(), URLSpan.class); in testGetSpans()73 assertThat(spans, notNullValue()); in testGetSpans()74 assertThat(spans.length, equalTo(1)); in testGetSpans()[all …]
67 it1->second->spans != it2->second->spans) { in Equals()116 new_row->second->spans = row->second->spans; in AddRect()126 new_row->second->spans = row->second->spans; in AddRect()158 // set of spans then they can be merged. in MergeWithPrecedingRow()160 previous_row->second->spans == row->second->spans) { in MergeWithPrecedingRow()207 IntersectRows(it1->second->spans, it2->second->spans, in Intersect()208 &new_row->second->spans); in Intersect()209 if (new_row->second->spans.empty()) { in Intersect()236 // Arrange for |it1| to always be the left-most of the spans. in IntersectRows()304 // subtract spans from. in Subtract()[all …]
56 RowSpanSet spans; member81 // |row_span_| matches spans on consecutive rows then they are also merged140 // Adds a new span to the row, coalescing spans if necessary.146 // Calculates the intersection of two sets of spans.155 // Merges |row| with the row above it if they contain the same spans. Doesn't
557 } spans[3]; in TEST() member583 int span_set_end = span_set.spans[span_set.count - 1].end; in TEST()594 std::fill_n(x + expected_map + span_set.spans[span].start, in TEST()595 span_set.spans[span].end - span_set.spans[span].start, in TEST()597 region2.AddRect(DesktopRect::MakeLTRB(x + span_set.spans[span].start, 0, in TEST()598 x + span_set.spans[span].end, 1)); in TEST()628 } spans[3]; in TEST() member654 int span_set_end = span_set.spans[span_set.count - 1].end; in TEST()665 std::fill_n(y + expected_map + span_set.spans[span].start, in TEST()666 span_set.spans[span].end - span_set.spans[span].start, in TEST()[all …]
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.SIMPLE176 …* 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 …]
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.SIMPLE197 …* 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 …]
16 private HashMap<Object, SpanHolder> spans = new HashMap<Object, SpanHolder>(); field in ShadowSpannableString29 spans.put(what, new SpanHolder(start, end, flags) ); in setSpan()34 spans.remove(what); in removeSpan()41 for (Object s : spans.keySet()) { in getSpans()43 SpanHolder h = spans.get(s); in getSpans()57 SpanHolder spanHolder = spans.get(what); in getSpanStart()67 SpanHolder spanHolder = spans.get(what); in getSpanEnd()
35 * Spans all integer and fraction digits81 * this interval spans. If count is negative, it means span all digits88 * this interval spans. If count is negative, it means span all digits111 * Returns INT32_MAX if this interval spans all digits to left of135 * Returns the total number of digits that this interval spans.136 * Caution: If this interval spans all digits to the left or right of146 * digit. Returns INT32_MIN if this interval spans all digits to right of
42 var spans = currentLineElement.childNodes;43 for (var j = 0; j < spans.length; ++j) {44 var currentSpan = spans[j];148 var spans = currentLineElement.childNodes;149 for (let j = 0; j < spans.length; ++j) {150 var currentSpan = spans[j];
17 // which takes 4 points. If the sample spans an edge, then break it into a bilerpEdge. Bilerp46 // The Span class enables efficient processing horizontal spans of pixels.51 // space. After the matrix operation, the tilers may break the spans up into smaller spans.52 // The tilers can produce spans that seem nonsensical.53 // * The clamp tiler can create spans with length of 0. This indicates to copy an edge pixel out55 // * The mirror tiler can produce spans with negative length. This indicates that the source208 // used to take advantage of memory coherence for horizontal spans.
664 var spans = cont.getElementsByTagName("span");667 for (i=0; i<spans.length; i++) {668 if (spans[i].className == "footnote") {670 var note = spans[i].getAttribute("data-note");674 note = spans[i].innerHTML.match(/\s*\[([\s\S]*)]\s*/)[1];675 spans[i].innerHTML =678 spans[i].setAttribute("data-note", note);684 var id =spans[i].getAttribute("id");692 for (i=0; i<spans.length; i++) {693 if (spans[i].className == "footnoteref") {[all …]
... search/ org/apache/lucene/search/spans/ org/apache/lucene/store/ org ...
82 printf("code points:%ld len16:%ld len8:%ld spans:%ld " in UnicodeSetPerformanceTest()94 // Count spans of characters that are in the set,95 // and spans of characters that are not in the set.297 * Get the same spans as with span() where we always start with a not-contained span. in call()393 * Get the same spans as with span() where we always start with a not-contained span. in call()
519 Opposite values result from combining coincident spans.530 // spans with the same T value (but not 'other' spans) in findNextOp()635 // spans with the same T value (but not 'other' spans) in findNextWinding()731 // spans with the same T value (but not 'other' spans) in findNextXor()1223 do { // iterate through all spans associated with start in moveMultiples()1235 // find range of spans to consider merging in moveMultiples()1273 // it contains spans of segments in test's loop but not including 'this' in moveMultiples()1306 // adjacent spans may have points close by1311 // if the first pt pair from adjacent spans are far apart, assume that all are far enough apart in spansNearby()1380 // release undeleted spans pointing to this seg that are linked to the primary span in moveNearby()[all …]