Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 | 1x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 586x 1x 1x 1x 87x 1x 454x 454x 454x 880x 2552x 2552x 29x 2523x 1584x 2523x 940x 940x 454x 1x 38x 38x 38x 38x 38x 38x 38x 38x 38x 38x 42x 74x 74x 74x 74x 74x 42x 42x 38x 1x 65x 1x 1x 1x 4x 1x 1x 1x 28x 1x 3x 1x 39x 39x 39x 58x 39x 1x 4x 1x 1x 4x 4x 4x 13x 4x 1x 412x 1x 48x 1x 10960x 1x 200x 200x 200x 1x 133x 133x 133x 1x 19x 1x 6x 6x 1x 5x 5x 19x 19x 2x 17x 17x 17x 5x 1x 539x 1x 31x 2x 31x 2x 31x 61x 61x 61x 61x 131x 70x 70x 10x 4x 4x 4x 6x 60x 10x 2x 2x 2x 8x 61x 61x 13x 104x 104x 10x 94x 94x 61x 31x 31x 20x 31x 10x 31x 31x 20x 31x 11x 31x 2x 29x 1x 31x 31x 31x 1x 3x 1x 539x 1x 7x 1x 6x 1x 2x 2x 1x 2x 2x 1x | /*!
* VisualEditor Table Selection class.
*
* @copyright See AUTHORS.txt
*/
/**
* @class
* @extends ve.dm.Selection
* @constructor
* @param {ve.Range} tableRange Table range
* @param {number} fromCol Starting column
* @param {number} fromRow Starting row
* @param {number} [toCol] End column
* @param {number} [toRow] End row
*/
ve.dm.TableSelection = function VeDmTableSelection( tableRange, fromCol, fromRow, toCol, toRow ) {
Iif ( ve.dm.Document && arguments[ 0 ] instanceof ve.dm.Document ) {
throw new Error( 'Got obsolete ve.dm.Document argument' );
}
Iif ( arguments.length > 5 ) {
throw new Error( 'Got obsolete argument (probably `expand`)' );
}
// Parent constructor
ve.dm.TableSelection.super.call( this );
this.tableRange = tableRange;
toCol = toCol === undefined ? fromCol : toCol;
toRow = toRow === undefined ? fromRow : toRow;
this.fromCol = fromCol;
this.fromRow = fromRow;
this.toCol = toCol;
this.toRow = toRow;
this.startCol = fromCol < toCol ? fromCol : toCol;
this.startRow = fromRow < toRow ? fromRow : toRow;
this.endCol = fromCol < toCol ? toCol : fromCol;
this.endRow = fromRow < toRow ? toRow : fromRow;
this.intendedFromCol = this.fromCol;
this.intendedFromRow = this.fromRow;
this.intendedToCol = this.toCol;
this.intendedToRow = this.toRow;
};
/* Inheritance */
OO.inheritClass( ve.dm.TableSelection, ve.dm.Selection );
/* Static Properties */
ve.dm.TableSelection.static.name = 'table';
/* Static Methods */
/**
* @inheritdoc
*/
ve.dm.TableSelection.static.newFromHash = function ( hash ) {
return new ve.dm.TableSelection(
ve.Range.static.newFromHash( hash.tableRange ),
hash.fromCol,
hash.fromRow,
hash.toCol,
hash.toRow
);
};
/**
* Retrieves all cells within a given selection.
*
* @static
* @param {ve.dm.TableMatrix} matrix The table matrix
* @param {Object} selectionOffsets Selection col/row offsets (startRow/endRow/startCol/endCol)
* @param {boolean} [includePlaceholders=false] Include placeholders in result
* @return {ve.dm.TableMatrixCell[]} List of table cells
*/
ve.dm.TableSelection.static.getTableMatrixCells = function ( matrix, selectionOffsets, includePlaceholders ) {
const cells = [],
visited = {};
for ( let row = selectionOffsets.startRow; row <= selectionOffsets.endRow; row++ ) {
for ( let col = selectionOffsets.startCol; col <= selectionOffsets.endCol; col++ ) {
let cell = matrix.getCell( row, col );
if ( !cell ) {
continue;
}
if ( !includePlaceholders && cell.isPlaceholder() ) {
cell = cell.owner;
}
if ( !visited[ cell.key ] ) {
cells.push( cell );
visited[ cell.key ] = true;
}
}
}
return cells;
};
/* Methods */
/**
* Expand the selection to cover all merged cells
*
* @private
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {ve.dm.TableSelection} Expanded table selection
*/
ve.dm.TableSelection.prototype.expand = function ( doc ) {
const matrix = this.getTableNode( doc ).getMatrix(),
colBackwards = this.fromCol > this.toCol,
rowBackwards = this.fromRow > this.toRow;
let lastCellCount = 0,
startCol = Infinity,
startRow = Infinity,
endCol = -Infinity,
endRow = -Infinity,
cells = this.getMatrixCells( doc );
while ( cells.length > lastCellCount ) {
for ( let i = 0; i < cells.length; i++ ) {
const cell = cells[ i ];
startCol = Math.min( startCol, cell.col );
startRow = Math.min( startRow, cell.row );
endCol = Math.max( endCol, cell.col + cell.node.getColspan() - 1 );
endRow = Math.max( endRow, cell.row + cell.node.getRowspan() - 1 );
}
lastCellCount = cells.length;
cells = this.constructor.static.getTableMatrixCells( matrix, {
startCol: startCol,
startRow: startRow,
endCol: endCol,
endRow: endRow
} );
}
return new this.constructor(
this.tableRange,
colBackwards ? endCol : startCol,
rowBackwards ? endRow : startRow,
colBackwards ? startCol : endCol,
rowBackwards ? startRow : endRow
);
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.toJSON = function () {
return {
type: this.constructor.static.name,
tableRange: this.tableRange,
fromCol: this.fromCol,
fromRow: this.fromRow,
toCol: this.toCol,
toRow: this.toRow
};
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.getDescription = function () {
return (
'Table: ' +
this.tableRange.from + ' - ' + this.tableRange.to +
', ' +
'c' + this.fromCol + ' r' + this.fromRow +
' - ' +
'c' + this.toCol + ' r' + this.toRow
);
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.collapseToStart = function () {
return new this.constructor( this.tableRange, this.startCol, this.startRow, this.startCol, this.startRow );
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.collapseToEnd = function () {
return new this.constructor( this.tableRange, this.endCol, this.endRow, this.endCol, this.endRow );
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.collapseToFrom = function () {
return new this.constructor( this.tableRange, this.fromCol, this.fromRow, this.fromCol, this.fromRow );
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.collapseToTo = function () {
return new this.constructor( this.tableRange, this.toCol, this.toRow, this.toCol, this.toRow );
};
/**
* @inheritdoc
* @param {ve.dm.Document} doc The document to which this selection applies
*/
ve.dm.TableSelection.prototype.getRanges = function ( doc ) {
const ranges = [],
cells = this.getMatrixCells( doc );
for ( let i = 0, l = cells.length; i < l; i++ ) {
ranges.push( cells[ i ].node.getRange() );
}
return ranges;
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.getCoveringRange = function () {
// Note that this returns the table range, and not the minimal range covering
// all cells, as that would be far more expensive to compute.
return this.tableRange;
};
/**
* Get all the ranges required to build a table slice from the selection
*
* In addition to the outer ranges of the cells, this also includes the start and
* end tags of table rows, sections and the table itself.
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {ve.Range[]} Ranges
*/
ve.dm.TableSelection.prototype.getTableSliceRanges = function ( doc ) {
const ranges = [],
matrix = this.getTableNode( doc ).getMatrix();
// Arrays are non-overlapping so avoid duplication
// by indexing by range.start
function pushNode( n ) {
const range = n.getOuterRange();
ranges[ range.start ] = new ve.Range( range.start, range.start + 1 );
ranges[ range.end - 1 ] = new ve.Range( range.end - 1, range.end );
}
// Get the start and end tags of every parent of the cell
// up to and including the TableNode
for ( let i = this.startRow; i <= this.endRow; i++ ) {
let node = matrix.getRowNode( i );
if ( !node ) {
continue;
}
pushNode( node );
while ( ( node = node.getParent() ) && node ) {
pushNode( node );
if ( node instanceof ve.dm.TableNode ) {
break;
}
}
}
return ranges
// Condense sparse array
.filter( ( r ) => r )
// Add cell ranges
.concat( this.getOuterRanges( doc ) )
// Sort
.sort( ( a, b ) => a.start - b.start );
};
/**
* Get outer ranges of the selected cells
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {ve.Range[]} Outer ranges
*/
ve.dm.TableSelection.prototype.getOuterRanges = function ( doc ) {
const ranges = [],
cells = this.getMatrixCells( doc );
for ( let i = 0, l = cells.length; i < l; i++ ) {
ranges.push( cells[ i ].node.getOuterRange() );
}
return ranges;
};
/**
* Retrieves all cells within a given selection.
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @param {boolean} [includePlaceholders=false] Include placeholders in result
* @return {ve.dm.TableMatrixCell[]} List of table cells
*/
ve.dm.TableSelection.prototype.getMatrixCells = function ( doc, includePlaceholders ) {
return this.constructor.static.getTableMatrixCells(
this.getTableNode( doc ).getMatrix(),
{
startCol: this.startCol,
startRow: this.startRow,
endCol: this.endCol,
endRow: this.endRow
},
includePlaceholders
);
};
/**
* Check the selected cells are all editable
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {boolean} Cells are all editable
*/
ve.dm.TableSelection.prototype.isEditable = function ( doc ) {
return this.getMatrixCells( doc ).every( ( cell ) => cell.node.isCellEditable() );
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.isCollapsed = function () {
return false;
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.translateByTransaction = function ( tx ) {
const newRange = tx.translateRange(
this.tableRange,
// Table selections should always exclude insertions
true
);
Iif ( newRange.isCollapsed() ) {
return new ve.dm.NullSelection();
}
return new this.constructor( newRange, this.fromCol, this.fromRow, this.toCol, this.toRow );
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.translateByTransactionWithAuthor = function ( tx, authorId ) {
const newRange = tx.translateRangeWithAuthor( this.tableRange, authorId );
Iif ( newRange.isCollapsed() ) {
return new ve.dm.NullSelection();
}
return new this.constructor( newRange, this.fromCol, this.fromRow, this.toCol, this.toRow );
};
/**
* Check if the selection spans a single cell
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {boolean} The selection spans a single cell
*/
ve.dm.TableSelection.prototype.isSingleCell = function ( doc ) {
// Quick check for single non-merged cell
return ( this.fromRow === this.toRow && this.fromCol === this.toCol ) ||
// Check for a merged single cell by ignoring placeholders
this.getMatrixCells( doc ).length === 1;
};
/**
* Check if the selection is mergeable or unmergeable
*
* The selection must span more than one matrix cell, but only
* one table section.
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {boolean} The selection is mergeable or unmergeable
*/
ve.dm.TableSelection.prototype.isMergeable = function ( doc ) {
Iif ( !this.isEditable( doc ) ) {
return false;
}
if ( this.getMatrixCells( doc, true ).length <= 1 ) {
return false;
}
const matrix = this.getTableNode( doc ).getMatrix();
let lastSectionNode;
// Check all sections are the same
for ( let r = this.endRow; r >= this.startRow; r-- ) {
const rowNode = matrix.getRowNode( r );
if ( !rowNode ) {
continue;
}
const sectionNode = rowNode.findParent( ve.dm.TableSectionNode );
Iif ( lastSectionNode && sectionNode !== lastSectionNode ) {
// Can't merge across sections
return false;
}
lastSectionNode = sectionNode;
}
return true;
};
/**
* Get the selection's table node
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {ve.dm.TableNode} Table node
*/
ve.dm.TableSelection.prototype.getTableNode = function ( doc ) {
return doc.getBranchNodeFromOffset( this.tableRange.start + 1 );
};
/**
* Get a new selection with adjusted row and column positions
*
* Placeholder cells are skipped over so this method can be used for cursoring.
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @param {number} fromColOffset Starting column offset
* @param {number} fromRowOffset Starting row offset
* @param {number} [toColOffset] End column offset
* @param {number} [toRowOffset] End row offset
* @param {boolean} [wrap=false] Wrap to the next/previous row if column limits are exceeded
* @return {ve.dm.TableSelection} Adjusted selection
*/
ve.dm.TableSelection.prototype.newFromAdjustment = function ( doc, fromColOffset, fromRowOffset, toColOffset, toRowOffset, wrap ) {
if ( toColOffset === undefined ) {
toColOffset = fromColOffset;
}
if ( toRowOffset === undefined ) {
toRowOffset = fromRowOffset;
}
const matrix = this.getTableNode( doc ).getMatrix();
let wrapDir;
function adjust( mode, cell, offset ) {
const dir = offset > 0 ? 1 : -1;
let nextCell,
col = cell.col,
row = cell.row;
while ( offset !== 0 ) {
if ( mode === 'col' ) {
col += dir;
// Out of bounds
if ( col >= matrix.getColCount( row ) ) {
if ( wrap && row < matrix.getRowCount() - 1 ) {
// Subtract columns in current row
col -= matrix.getColCount( row );
row++;
wrapDir = 1;
} else {
break;
}
} else if ( col < 0 ) {
if ( wrap && row > 0 ) {
row--;
// Add columns in previous row
col += matrix.getColCount( row );
wrapDir = -1;
} else {
break;
}
}
} else {
row += dir;
if ( row >= matrix.getRowCount() || row < 0 ) {
// Out of bounds
break;
}
}
nextCell = matrix.getCell( row, col );
// Skip if same as current cell (i.e. merged cells), or null
if ( !nextCell || nextCell.equals( cell ) ) {
continue;
}
offset -= dir;
cell = nextCell;
}
return cell;
}
let fromCell = matrix.getCell( this.intendedFromRow, this.intendedFromCol );
if ( fromColOffset ) {
fromCell = adjust( 'col', fromCell, fromColOffset );
}
if ( fromRowOffset ) {
fromCell = adjust( 'row', fromCell, fromRowOffset );
}
let toCell = matrix.getCell( this.intendedToRow, this.intendedToCol );
if ( toColOffset ) {
toCell = adjust( 'col', toCell, toColOffset );
}
if ( toRowOffset ) {
toCell = adjust( 'row', toCell, toRowOffset );
}
// Collapse to end/start if wrapping forwards/backwards
if ( wrapDir > 0 ) {
fromCell = toCell;
} else if ( wrapDir < 0 ) {
toCell = fromCell;
}
let selection = new this.constructor(
this.tableRange,
fromCell.col,
fromCell.row,
toCell.col,
toCell.row
);
selection = selection.expand( doc );
return selection;
};
/**
* Check if a given cell is within this selection
*
* @param {ve.dm.TableMatrixCell} cell Table matrix cell
* @return {boolean} Cell is within this selection
*/
ve.dm.TableSelection.prototype.containsCell = function ( cell ) {
return cell.node.findParent( ve.dm.TableNode ).getOuterRange().equals( this.tableRange ) &&
cell.col >= this.startCol && cell.col <= this.endCol &&
cell.row >= this.startRow && cell.row <= this.endRow;
};
/**
* @inheritdoc
*/
ve.dm.TableSelection.prototype.equals = function ( other ) {
return this === other || (
!!other &&
other.constructor === this.constructor &&
this.tableRange.equals( other.tableRange ) &&
this.fromCol === other.fromCol &&
this.fromRow === other.fromRow &&
this.toCol === other.toCol &&
this.toRow === other.toRow
);
};
/**
* Get the number of rows covered by the selection
*
* @return {number} Number of rows covered
*/
ve.dm.TableSelection.prototype.getRowCount = function () {
return this.endRow - this.startRow + 1;
};
/**
* Get the number of columns covered by the selection
*
* @return {number} Number of columns covered
*/
ve.dm.TableSelection.prototype.getColCount = function () {
return this.endCol - this.startCol + 1;
};
/**
* Check if the table selection covers one or more full rows
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {boolean} The table selection covers one or more full rows
*/
ve.dm.TableSelection.prototype.isFullRow = function ( doc ) {
const matrix = this.getTableNode( doc ).getMatrix();
return this.getColCount() === matrix.getMaxColCount();
};
/**
* Check if the table selection covers one or more full columns
*
* @param {ve.dm.Document} doc The document to which this selection applies
* @return {boolean} The table selection covers one or more full columns
*/
ve.dm.TableSelection.prototype.isFullCol = function ( doc ) {
const matrix = this.getTableNode( doc ).getMatrix();
return this.getRowCount() === matrix.getRowCount();
};
/* Registration */
ve.dm.selectionFactory.register( ve.dm.TableSelection );
|