Lines Matching refs:span
306 // The following condition indicates that the span would become empty
377 if (replacedLength > 0) { // no need for span fixup on pure insertion
393 if (replacedLength > 0) { // no need for span fixup on pure insertion
421 // Add span only if this object is not yet used as a span in this string
484 // Invariants must be restored before sending span removed notifications.
574 Object span = spans[i];
575 int flags = spanned.getSpanFlags(span);
603 // No change if span start was already at replace interval boundaries before replace
622 // No change if span start was already at replace interval boundaries before replace
654 * The flags determine how the span will behave when text is
655 * inserted at the start or end of the span's range.
662 // invariants. If send is false and the span already exists, then this method
673 throw new RuntimeException("PARAGRAPH span must start at paragraph boundary");
683 throw new RuntimeException("PARAGRAPH span must end at paragraph boundary");
925 * equal to <code>limit</code> where a span of the specified type
1068 // called, so that the order of the span does not affect this broadcast.
1308 * span enclosing the cursor in the direction of movement.
1371 // Check span data
1403 Object span = mSpans[i];
1404 if (span != this) {
1405 hash = hash * 31 + span.hashCode();
1407 hash = hash * 31 + getSpanStart(span);
1408 hash = hash * 31 + getSpanEnd(span);
1409 hash = hash * 31 + getSpanFlags(span);
1414 // Primitives for treating span list as binary tree
1452 // The span arrays are also augmented by an mSpanMax[] array that represents an interval tree
1458 // descendants of index < n. In these cases, it simply represents the maximum span end of its
1476 // restores binary interval tree invariants after any mutation of span structure
1480 // invariant 1: span starts are nondecreasing
1485 Object span = mSpans[i];
1497 mSpans[j] = span;
1505 // invariant 2: max is max span end for each node and its descendants