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 | 1x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1304x 1x 1x 1x 3978x 3978x 1x 1304x 1304x 3978x 1303x 3x 1300x 1300x 1300x 1300x 1293x 1300x 7x 7x 7x 1293x 1293x 1x 51x 51x 1x 51x 1x 1300x 1300x 1300x 51x 51x 1x 7x 7x 7x 1x 102x 1x 118x 27x 1293x 1293x 1293x 118x 93x 1x 3926x 1x 1x 51x 51x 51x 51x 51x 51x 51x 51x 51x 51x 1x 2567x 167x 167x 1164x 1164x 552x 2567x 1x 52x 1x 51x 1x 1359x 2398x 2398x 1252x 626x 626x 1359x 2752x 2752x 1247x 622x 625x 1359x 1359x | /*!
* VisualEditor DataModel TransactionProcessor class.
*
* @copyright See AUTHORS.txt
*/
/**
* DataModel transaction processor.
*
* This class reads operations from a transaction and applies them one by one. It's not intended
* to be used directly; use {ve.dm.Document#commit} instead.
*
* NOTE: Instances of this class are not recyclable: you can only call .process() on them once.
*
* @class
* @param {ve.dm.Document} doc
* @param {ve.dm.Transaction} transaction
* @param {boolean} isStaging Transaction is being applied in staging mode
* @constructor
*/
ve.dm.TransactionProcessor = function VeDmTransactionProcessor( doc, transaction, isStaging ) {
// Properties
this.document = doc;
this.transaction = transaction;
this.operations = transaction.getOperations();
this.isStaging = isStaging;
this.modificationQueue = [];
this.rollbackQueue = [];
this.eventQueue = [];
// Linear model offset that we're currently at. Operations in the transaction are ordered, so
// the cursor only ever moves forward.
this.cursor = 0;
// Adjustment that needs to be added to linear model offsets in the original linear model
// to get offsets in the half-updated linear model. Arguments to queued modifications all use
// unadjusted offsets; this is needed to adjust those offsets after other modifications have been
// made to the linear model that have caused offsets to shift.
this.adjustment = 0;
// State tracking for unbalanced replace operations
this.replaceRemoveLevel = 0;
this.replaceInsertLevel = 0;
this.replaceMinInsertLevel = 0;
this.retainDepth = 0;
this.balanced = true;
};
/* Static members */
/* See ve.dm.TransactionProcessor.modifiers */
ve.dm.TransactionProcessor.modifiers = {};
/* See ve.dm.TransactionProcessor.processors */
ve.dm.TransactionProcessor.processors = {};
/* Methods */
/**
* Execute an operation.
*
* @private
* @param {Object} op Operation object to execute
* @throws {Error} Operation type is not supported
*/
ve.dm.TransactionProcessor.prototype.executeOperation = function ( op ) {
if ( Object.prototype.hasOwnProperty.call( ve.dm.TransactionProcessor.processors, op.type ) ) {
ve.dm.TransactionProcessor.processors[ op.type ].call( this, op );
} else E{
throw new Error( 'Invalid operation error. Operation type is not supported: ' + op.type );
}
};
/**
* Process all operations.
*
* When all operations are done being processed, the document will be synchronized.
*
* @private
*/
ve.dm.TransactionProcessor.prototype.process = function () {
// Warning: some of this is vestigial. Before TreeModifier, things worked as follows:
// 1) executeOperation ran on each operation. This built a list of modifications,
// .modificationQueue, consisting of linear splices and attribute/annotation changes.
// 2) applyModifications processed .modificationQueue. In particular it executed the
// linear splices (invalidating the DM tree).
// 3) rebuildTree rebuilt the part of the DM tree invalidated by the linear splices.
//
// Since then, we removed annotation changes completely. And TreeModifier handles
// replacements. So for replacements:
// 1) executeOperation does very little (just a balancedness check)
// 2) applyModifications queues linear splices for rollback on error
// 3) rebuildTree is only called in the rollback case
// Ensure the pre-modification document tree has been generated
this.document.getDocumentNode();
// First process each operation to gather modifications in the modification queue.
// If an exception occurs during this stage, we don't need to do anything to recover,
// because no modifications were made yet.
for ( let i = 0; i < this.operations.length; i++ ) {
this.executeOperation( this.operations[ i ] );
}
if ( !this.balanced ) {
throw new Error( 'Unbalanced set of replace operations found' );
}
let completed;
// Apply the queued modifications
try {
completed = false;
this.applyModifications();
ve.dm.treeModifier.process( this.document, this.transaction );
completed = true;
} finally {
// Don't catch and re-throw errors so that they are reported properly
if ( !completed ) {
// Restore the linear model to its original state
Iif ( this.treeModifier ) {
this.treeModifier.undoLinearSplices();
}
this.rollbackModifications();
// The tree may have been left in some sort of half-baked state, so rebuild it
// from scratch
this.document.rebuildTree();
}
}
// Mark the transaction as committed
this.transaction.markAsApplied();
// Emit events in the queue
this.emitQueuedEvents();
};
/**
* Queue a modification.
*
* @private
* @param {Object} modification Object describing the modification
* @param {string} modification.type Name of a method in ve.dm.TransactionProcessor.modifiers
* @param {Array} [modification.args] Arguments to pass to this method
* @throws {Error} Unrecognized modification type
*/
ve.dm.TransactionProcessor.prototype.queueModification = function ( modification ) {
Iif ( typeof ve.dm.TransactionProcessor.modifiers[ modification.type ] !== 'function' ) {
throw new Error( 'Unrecognized modification type ' + modification.type );
}
this.modificationQueue.push( modification );
};
/**
* Queue an undo function. If an exception is thrown while modifying, #rollbackModifications will
* invoke these functions in reverse order.
*
* @param {Function} func Undo function to add to the queue
*/
ve.dm.TransactionProcessor.prototype.queueUndoFunction = function ( func ) {
this.rollbackQueue.push( func );
};
/**
* Apply all modifications queued through #queueModification, and add their rollback functions
* to this.rollbackQueue.
*
* @private
*/
ve.dm.TransactionProcessor.prototype.applyModifications = function () {
const modifications = this.modificationQueue;
this.modificationQueue = [];
for ( let i = 0, len = modifications.length; i < len; i++ ) {
const modifier = ve.dm.TransactionProcessor.modifiers[ modifications[ i ].type ];
modifier.apply( this, modifications[ i ].args || [] );
}
};
/**
* Roll back all modifications that have been applied so far. This invokes the callbacks returned
* by the modifier functions.
*
* @private
*/
ve.dm.TransactionProcessor.prototype.rollbackModifications = function () {
const rollbacks = this.rollbackQueue;
this.rollbackQueue = [];
for ( let i = rollbacks.length - 1; i >= 0; i-- ) {
rollbacks[ i ]();
}
};
/**
* Queue an event to be emitted on a node.
*
* Duplicate events will be ignored only if all arguments match exactly (i.e. are reference-equal).
*
* @private
* @param {ve.dm.Node} node
* @param {string} name Event name
* @param {...any} [args] Additional arguments to be passed to the event when fired
*/
ve.dm.TransactionProcessor.prototype.queueEvent = function ( node, name, ...args ) {
this.eventQueue.push( {
node,
name,
args: args.concat( this.transaction )
} );
};
/**
* Emit all events queued through #queueEvent.
*
* @private
*/
ve.dm.TransactionProcessor.prototype.emitQueuedEvents = function () {
function isDuplicate( event, otherEvent ) {
return otherEvent.node === event.node &&
otherEvent.name === event.name &&
otherEvent.args.every( ( arg, index ) => arg === event.args[ index ] );
}
const queue = this.eventQueue;
this.eventQueue = [];
queue.forEach( ( event, i ) => {
// Check if this event is a duplicate of something we've already emitted
if ( !queue.slice( 0, i ).some( ( e ) => isDuplicate( event, e ) ) ) {
event.node.emit( event.name, ...event.args );
}
} );
};
/**
* Advance the main data cursor.
*
* @private
* @param {number} increment Number of positions to increment the cursor by
*/
ve.dm.TransactionProcessor.prototype.advanceCursor = function ( increment ) {
this.cursor += increment;
};
/**
* Modifier methods.
*
* Each method executes a specific type of linear model modification, updates the model tree, and
* returns a function that undoes the linear model modification, in case we need to recover the
* previous linear model state. (The returned undo function does not undo the model tree update.)
* Methods are called in the context of a transaction processor, so they work similar to normal
* methods on the object.
*
* @class ve.dm.TransactionProcessor.modifiers
* @singleton
*/
/**
* Splice data into / out of the data array, and synchronize the tree.
*
* For efficiency, this function modifies the splice operation objects (i.e. the elements
* of the splices array). It also relies on these objects not being modified by others later.
*
* @param {Object[]} splices Array of splice operations to execute. Properties:
* {number} splices[].offset Offset to remove/insert at (unadjusted)
* {number} splices[].removeLength Number of elements to remove
* {Array} splices[].insert Data to insert; for efficiency, objects are inserted without cloning
*/
ve.dm.TransactionProcessor.modifiers.splice = function ( splices ) {
const data = this.document.data;
let lengthDiff = 0;
let i;
// We're about to do lots of things that can go wrong, so queue an undo function now
// that undoes all splices that we got to
this.queueUndoFunction( () => {
for ( let i2 = splices.length - 1; i2 >= 0; i2-- ) {
const s2 = splices[ i ];
if ( s2.removedData !== undefined ) {
data.batchSplice( s2.offset, s2.insert.length, s2.removedData );
}
}
} );
// Apply splices to the linmod and record how to undo them
for ( i = 0; i < splices.length; i++ ) {
const s = splices[ i ];
// Adjust s.offset for previous modifications that have already been synced to the tree;
// this value is used by the tree sync code later.
s.treeOffset = s.offset + this.adjustment;
// Also adjust s.offset for previous iterations of this loop (i.e. unsynced modifications);
// this is the value we need for the actual array splice.
s.offset = s.treeOffset + lengthDiff;
// Perform the splice and put the removed data in s, for the undo function
s.removedData = data.batchSplice( s.offset, s.removeLength, s.insert );
lengthDiff += s.insert.length - s.removeLength;
}
this.adjustment += lengthDiff;
};
/**
* Set an attribute at a given offset.
*
* @param {number} offset Offset in data array (unadjusted)
* @param {string} key Attribute name
* @param {any} value New attribute value
*/
ve.dm.TransactionProcessor.modifiers.setAttribute = function ( offset, key, value ) {
const data = this.document.data;
offset += this.adjustment;
const oldItem = data.getData( offset );
const oldValue = oldItem.attributes && oldItem.attributes[ key ];
data.setAttributeAtOffset( offset, key, value );
this.queueUndoFunction( () => {
data.setAttributeAtOffset( offset, key, oldValue );
} );
const node = this.document.getDocumentNode().getNodeFromOffset( offset + 1 );
// Update node element pointer
node.element = data.getData( offset );
this.queueEvent( node, 'attributeChange', key, oldValue, value );
this.queueEvent( node, 'update', this.isStaging );
};
/**
* Processing methods.
*
* Each method is specific to a type of action. Methods are called in the context of a transaction
* processor, so they work similar to normal methods on the object.
*
* @class ve.dm.TransactionProcessor.processors
* @singleton
*/
/**
* Execute a retain operation.
*
* Called within the context of a transaction processor instance; moves the cursor by op.length
*
* @param {Object} op Operation object:
* @param {number} op.length Number of elements to retain
*/
ve.dm.TransactionProcessor.processors.retain = function ( op ) {
if ( !this.balanced ) {
// Track the depth of retained data when in the middle of an unbalanced replace
const retainedData = this.document.getData( new ve.Range( this.cursor, this.cursor + op.length ) );
for ( let i = 0; i < retainedData.length; i++ ) {
const type = retainedData[ i ].type;
if ( type !== undefined ) {
this.retainDepth += type.charAt( 0 ) === '/' ? -1 : 1;
}
}
}
this.advanceCursor( op.length );
};
/**
* Execute an attribute operation.
*
* This method is called within the context of a transaction processor instance.
*
* This sets the attribute named `op.key` on the element at `this.cursor` to `op.to`, or unsets it if
* `op.to === undefined`. `op.from` is not checked against the old value, but is used instead of `op.to`
* in reverse mode. So if `op.from` is incorrect, the transaction will commit fine, but won't roll
* back correctly.
*
* @param {Object} op Operation object
* @param {string} op.key Attribute name
* @param {any} op.from Old attribute value, or undefined if not previously set
* @param {any} op.to New attribute value, or undefined to unset
*/
ve.dm.TransactionProcessor.processors.attribute = function ( op ) {
if ( !this.document.data.isElementData( this.cursor ) ) {
throw new Error( 'Invalid element error, cannot set attributes on non-element data' );
}
this.queueModification( {
type: 'setAttribute',
args: [ this.cursor, op.key, op.to ]
} );
};
/**
* Verify a replace operation (the actual processing is now done in ve.dm.TreeModifier)
*
* @param {Object} op Operation object
* @param {Array} op.remove Linear model data to remove
* @param {Array} op.insert Linear model data to insert
*/
ve.dm.TransactionProcessor.processors.replace = function ( op ) {
// Track balancedness for verification purposes only
// Walk through the remove and insert data
// and keep track of the element depth change (level)
// for each of these two separately. The model is
// only consistent if both levels are zero.
let i, type;
for ( i = 0; i < op.remove.length; i++ ) {
type = op.remove[ i ].type;
if ( type !== undefined ) {
if ( type.charAt( 0 ) === '/' ) {
// Closing element
this.replaceRemoveLevel--;
} else {
// Opening element
this.replaceRemoveLevel++;
}
}
}
for ( i = 0; i < op.insert.length; i++ ) {
type = op.insert[ i ].type;
if ( type !== undefined ) {
if ( type.charAt( 0 ) === '/' ) {
// Closing element
this.replaceInsertLevel--;
} else {
// Opening element
this.replaceInsertLevel++;
}
}
}
this.advanceCursor( op.remove.length );
this.balanced =
this.replaceRemoveLevel === 0 &&
this.replaceInsertLevel === 0 &&
this.retainDepth === 0;
};
|