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 | 1x 27792x 27792x 27792x 27792x 1x 1x 1x 10345x 10345x 1x 19x 19x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 2257x 1x 1x 1x 1x 1x 1x 6507x 6507x 6507x 1x 7844x 7844x 1x 165012x 1x 78425x 1x 75535x 1x 35342x 1x 16362x 16362x 7329x 9033x 775x 775x 9033x 9033x 8258x 1x 50044x 1x 16332x 16332x 7329x 9003x 746x 746x 9003x 9003x 8257x 1x 24892x 24892x 24892x 24892x 1x 1404x 1404x 1404x 1404x 1404x 1x 879x 879x 2621x 700x 1921x 179x 1x 571x 1727x 1x 3x 3x 6x 3x 1x 3x 4x 1x 20700x 20700x 20700x 90140x 20674x 69466x 69466x 26x 69440x 69440x | /*!
* VisualEditor Node class.
*
* @copyright See AUTHORS.txt
*/
/**
* Generic node.
*
* @abstract
* @mixins OO.EventEmitter
*
* @constructor
*/
ve.Node = function VeNode() {
// Properties
this.type = this.constructor.static.name;
this.parent = null;
this.root = null;
this.doc = null;
};
/**
* @event attach
* @param {ve.Node} New parent
*/
/**
* @event detach
* @param {ve.Node} Old parent
*/
/**
* The node has a new root assigned.
*
* The root will be consistent with that set in descendants and ancestors, but other parts of the
* tree may be inconsistent.
*
* @event root
* @param {ve.Node} New root
*/
/**
* The node root has been set to null.
*
* The root will be consistent with that set in descendants and ancestors, but other parts of the
* tree may be inconsistent.
*
* @event unroot
* @param {ve.Node} Old root
*/
/* Abstract Methods */
/**
* Get allowed child node types.
*
* @abstract
* @return {string[]|null} List of node types allowed as children or null if any type is allowed
*/
ve.Node.prototype.getChildNodeTypes = null;
/**
* Get allowed parent node types.
*
* @abstract
* @return {string[]|null} List of node types allowed as parents or null if any type is allowed
*/
ve.Node.prototype.getParentNodeTypes = null;
/**
* Check if the specified type is an allowed child node type
*
* @param {string} type Node type
* @return {boolean} The type is allowed
*/
ve.Node.prototype.isAllowedChildNodeType = function ( type ) {
var childTypes = this.getChildNodeTypes();
return childTypes === null || childTypes.indexOf( type ) !== -1;
};
/**
* Check if the specified type is an allowed child node type
*
* @param {string} type Node type
* @return {boolean} The type is allowed
*/
ve.Node.prototype.isAllowedParentNodeType = function ( type ) {
var parentTypes = this.getParentNodeTypes();
return parentTypes === null || parentTypes.indexOf( type ) !== -1;
};
/**
* Get suggested parent node types.
*
* @abstract
* @return {string[]|null} List of node types suggested as parents or null if any type is suggested
*/
ve.Node.prototype.getSuggestedParentNodeTypes = null;
/**
* Check if the node can have children.
*
* @abstract
* @return {boolean} Node can have children
*/
ve.Node.prototype.canHaveChildren = null;
/**
* Check if the node can have children but not content nor be content.
*
* @abstract
* @return {boolean} Node can have children but not content nor be content
*/
ve.Node.prototype.canHaveChildrenNotContent = null;
/**
* Check if the node can contain content.
*
* @abstract
* @return {boolean} Node can contain content
*/
ve.Node.prototype.canContainContent = null;
/**
* Check if the node is content.
*
* @abstract
* @return {boolean} Node is content
*/
ve.Node.prototype.isContent = null;
/**
* Check if the node is an internal node
*
* @abstract
* @return {boolean} Node is an internal node
*/
ve.Node.prototype.isInternal = null;
/**
* Check if the node is a meta data node
*
* @abstract
* @return {boolean} Node is a meta data node
*/
ve.Node.prototype.isMetaData = null;
/**
* Check if the node has a wrapped element in the document data.
*
* @abstract
* @return {boolean} Node represents a wrapped element
*/
ve.Node.prototype.isWrapped = null;
/**
* Check if the node can be unwrapped.
*
* Can only be true of the node is wrapped.
*
* @abstract
* @return {boolean} Node represents a unwrappable element
*/
ve.Node.prototype.isUnwrappable = null;
/**
* Check if the node is focusable
*
* @abstract
* @return {boolean} Node is focusable
*/
ve.Node.prototype.isFocusable = null;
/**
* Check if the node is alignable
*
* @abstract
* @return {boolean} Node is alignable
*/
ve.Node.prototype.isAlignable = null;
/**
* Check if the node can behave as a table cell
*
* @abstract
* @return {boolean} Node can behave as a table cell
*/
ve.Node.prototype.isCellable = null;
/**
* Check the node, behaving as a table cell, can be edited in place
*
* @abstract
* @return {boolean} Node can be edited in place
*/
ve.Node.prototype.isCellEditable = null;
/**
* Check if the node behaves like a list for diffing
*
* @abstract
* @return {boolean} Node behaves like a list
*/
ve.Node.prototype.isDiffedAsList = null;
/**
* Check if the node behaves like a leaf for diffing
*
* @abstract
* @return {boolean} Node behaves like a leaf
*/
ve.Node.prototype.isDiffedAsLeaf = null;
/**
* Check if the node behaves like a document for diffing
*
* @abstract
* @return {boolean} Node behaves like a document
*/
ve.Node.prototype.isDiffedAsDocument = null;
/**
* Check if the node behaves like a tree branch for diffing
*
* This is the fallback behaviour if the node is not diffed as
* a list,leaf or document.
*
* @abstract
* @return {boolean} Node behaves like a tree branch
*/
ve.Node.prototype.isDiffedAsTree = function () {
return !this.isDiffedAsList() && !this.isDiffedAsLeaf() && !this.isDiffedAsDocument();
};
/**
* Check if the node has significant whitespace.
*
* Can only be true if canContainContent is also true.
*
* @abstract
* @return {boolean} Node has significant whitespace
*/
ve.Node.prototype.hasSignificantWhitespace = null;
/**
* Check if the node handles its own children
*
* @abstract
* @return {boolean} Node handles its own children
*/
ve.Node.prototype.handlesOwnChildren = null;
/**
* Check if the node's children should be ignored.
*
* @abstract
* @return {boolean} Node's children should be ignored
*/
ve.Node.prototype.shouldIgnoreChildren = null;
/**
* Get the length of the node.
*
* @abstract
* @return {number} Node length
*/
ve.Node.prototype.getLength = null;
/**
* Get the offset of the node within the document.
*
* If the node has no parent than the result will always be 0.
*
* @abstract
* @return {number} Offset of node
* @throws {Error} Node not found in parent's children array
*/
ve.Node.prototype.getOffset = null;
/**
* Get the range inside the node.
*
* @param {boolean} backwards Return a backwards range
* @return {ve.Range} Inner node range
*/
ve.Node.prototype.getRange = function ( backwards ) {
var offset = this.getOffset() + ( this.isWrapped() ? 1 : 0 ),
range = new ve.Range( offset, offset + this.getLength() );
return backwards ? range.flip() : range;
};
/**
* Get the outer range of the node, which includes wrappers if present.
*
* @param {boolean} backwards Return a backwards range
* @return {ve.Range} Node outer range
*/
ve.Node.prototype.getOuterRange = function ( backwards ) {
var range = new ve.Range( this.getOffset(), this.getOffset() + this.getOuterLength() );
return backwards ? range.flip() : range;
};
/**
* Get the outer length of the node, which includes wrappers if present.
*
* @return {number} Node outer length
*/
ve.Node.prototype.getOuterLength = function () {
return this.getLength() + ( this.isWrapped() ? 2 : 0 );
};
/* Methods */
/**
* Get the symbolic node type name.
*
* @return {string} Symbolic name of element type
*/
ve.Node.prototype.getType = function () {
return this.type;
};
/**
* Get a reference to the node's parent.
*
* @return {ve.Node|null} Reference to the node's parent, null if detached
*/
ve.Node.prototype.getParent = function () {
return this.parent;
};
/**
* Get the root node of the tree the node is currently attached to.
*
* @return {ve.Node|null} Root node, null if detached
*/
ve.Node.prototype.getRoot = function () {
return this.root;
};
/**
* Set the root node.
*
* This method is overridden by nodes with children.
*
* @param {ve.Node|null} root Node to use as root
* @fires root
* @fires unroot
*/
ve.Node.prototype.setRoot = function ( root ) {
var oldRoot = this.root;
if ( root === oldRoot ) {
return;
}
if ( oldRoot ) {
this.root = null;
this.emit( 'unroot', oldRoot );
}
this.root = root;
if ( root ) {
this.emit( 'root', root );
}
};
/**
* Get the document the node is a part of.
*
* @return {ve.Document|null} Document the node is a part of, null if detached
*/
ve.Node.prototype.getDocument = function () {
return this.doc;
};
/**
* Set the document the node is a part of.
*
* This method is overridden by nodes with children.
*
* @param {ve.Document|null} doc Document this node is a part of
*/
ve.Node.prototype.setDocument = function ( doc ) {
var oldDoc = this.doc;
if ( doc === oldDoc ) {
return;
}
if ( oldDoc ) {
this.doc = null;
oldDoc.nodeDetached( this );
}
this.doc = doc;
if ( doc ) {
doc.nodeAttached( this );
}
};
/**
* Attach the node to another as a child.
*
* @param {ve.Node} parent Node to attach to
* @fires attach
*/
ve.Node.prototype.attach = function ( parent ) {
this.parent = parent;
this.setDocument( parent.getDocument() );
this.setRoot( parent.getRoot() );
this.emit( 'attach', parent );
};
/**
* Detach the node from its parent.
*
* @fires detach
*/
ve.Node.prototype.detach = function () {
var parent = this.parent;
this.parent = null;
this.setRoot( null );
this.setDocument( null );
this.emit( 'detach', parent );
};
/**
* Traverse tree of nodes (model or view) upstream.
*
* For each traversed node, the callback function will be passed the traversed node as a parameter.
*
* @param {Function} callback Callback method to be called for every traversed node. Returning false stops the traversal.
* @return {ve.Node|null} Node which caused the traversal to stop, or null if it didn't
*/
ve.Node.prototype.traverseUpstream = function ( callback ) {
var node = this;
while ( node ) {
if ( callback( node ) === false ) {
return node;
}
node = node.getParent();
}
return null;
};
/**
* Traverse upstream until a parent of a specific type is found
*
* @param {Function} type Node type to find
* @return {ve.Node|null} Ancestor of this node matching the specified type
*/
ve.Node.prototype.findParent = function ( type ) {
return this.traverseUpstream( function ( node ) {
return !( node instanceof type );
} );
};
/**
* Traverse upstream and collect all nodes, including the node itself.
*
* @return {ve.Node[]} List of nodes which are upstream of the current node
*/
ve.Node.prototype.collectUpstream = function () {
var nodes = [];
this.traverseUpstream( function ( node ) {
nodes.push( node );
} );
return nodes;
};
/**
* Check if the current node is a descendant of (or equal to) a specific node.
*
* @param {ve.Node} upstreamNode Parent node to check for
* @return {boolean} Current node is a descendant
*/
ve.Node.prototype.isDownstreamOf = function ( upstreamNode ) {
return this.traverseUpstream( function ( node ) {
return node !== upstreamNode;
} ) !== null;
};
/**
* Get the offset path from the document node to this node.
*
* @return {number[]|null} The offset path, or null if not attached to a DocumentNode
*/
ve.Node.prototype.getOffsetPath = function () {
var node = this,
path = [];
while ( true ) {
if ( node.type === 'document' ) {
// We reached the ve.dm.DocumentNode/ve.ce.DocumentNode that this node is attached to
return path;
}
var parent = node.getParent();
if ( !parent ) {
return null;
}
path.unshift( parent.indexOf( node ) );
node = parent;
}
};
|