2 Copyright (c) 2003-2010, CKSource - Frederico Knabben. All rights reserved.
\r
3 For licensing, see LICENSE.html or http://ckeditor.com/license
\r
7 * @fileOverview Defines the {@link CKEDITOR.dom.node} class, which is the base
\r
8 * class for classes that represent DOM nodes.
\r
12 * Base class for classes representing DOM nodes. This constructor may return
\r
13 * and instance of classes that inherits this class, like
\r
14 * {@link CKEDITOR.dom.element} or {@link CKEDITOR.dom.text}.
\r
15 * @augments CKEDITOR.dom.domObject
\r
16 * @param {Object} domNode A native DOM node.
\r
18 * @see CKEDITOR.dom.element
\r
19 * @see CKEDITOR.dom.text
\r
22 CKEDITOR.dom.node = function( domNode )
\r
26 switch ( domNode.nodeType )
\r
28 case CKEDITOR.NODE_ELEMENT :
\r
29 return new CKEDITOR.dom.element( domNode );
\r
31 case CKEDITOR.NODE_TEXT :
\r
32 return new CKEDITOR.dom.text( domNode );
\r
35 // Call the base constructor.
\r
36 CKEDITOR.dom.domObject.call( this, domNode );
\r
42 CKEDITOR.dom.node.prototype = new CKEDITOR.dom.domObject();
\r
45 * Element node type.
\r
49 CKEDITOR.NODE_ELEMENT = 1;
\r
56 CKEDITOR.NODE_TEXT = 3;
\r
59 * Comment node type.
\r
63 CKEDITOR.NODE_COMMENT = 8;
\r
65 CKEDITOR.NODE_DOCUMENT_FRAGMENT = 11;
\r
67 CKEDITOR.POSITION_IDENTICAL = 0;
\r
68 CKEDITOR.POSITION_DISCONNECTED = 1;
\r
69 CKEDITOR.POSITION_FOLLOWING = 2;
\r
70 CKEDITOR.POSITION_PRECEDING = 4;
\r
71 CKEDITOR.POSITION_IS_CONTAINED = 8;
\r
72 CKEDITOR.POSITION_CONTAINS = 16;
\r
74 CKEDITOR.tools.extend( CKEDITOR.dom.node.prototype,
\r
75 /** @lends CKEDITOR.dom.node.prototype */
\r
78 * Makes this node child of another element.
\r
79 * @param {CKEDITOR.dom.element} element The target element to which append
\r
81 * @returns {CKEDITOR.dom.element} The target element.
\r
83 * var p = new CKEDITOR.dom.element( 'p' );
\r
84 * var strong = new CKEDITOR.dom.element( 'strong' );
\r
85 * strong.appendTo( p );
\r
87 * // result: "<p><strong></strong></p>"
\r
89 appendTo : function( element, toStart )
\r
91 element.append( this, toStart );
\r
95 clone : function( includeChildren, cloneId )
\r
97 var $clone = this.$.cloneNode( includeChildren );
\r
101 var removeIds = function( node )
\r
103 if ( node.nodeType != CKEDITOR.NODE_ELEMENT )
\r
106 node.removeAttribute( 'id', false ) ;
\r
107 node.removeAttribute( '_cke_expando', false ) ;
\r
109 var childs = node.childNodes;
\r
110 for ( var i=0 ; i < childs.length ; i++ )
\r
111 removeIds( childs[ i ] );
\r
114 // The "id" attribute should never be cloned to avoid duplication.
\r
115 removeIds( $clone );
\r
118 return new CKEDITOR.dom.node( $clone );
\r
121 hasPrevious : function()
\r
123 return !!this.$.previousSibling;
\r
126 hasNext : function()
\r
128 return !!this.$.nextSibling;
\r
132 * Inserts this element after a node.
\r
133 * @param {CKEDITOR.dom.node} node The that will preceed this element.
\r
134 * @returns {CKEDITOR.dom.node} The node preceeding this one after
\r
137 * var em = new CKEDITOR.dom.element( 'em' );
\r
138 * var strong = new CKEDITOR.dom.element( 'strong' );
\r
139 * strong.insertAfter( em );
\r
141 * // result: "<em></em><strong></strong>"
\r
143 insertAfter : function( node )
\r
145 node.$.parentNode.insertBefore( this.$, node.$.nextSibling );
\r
150 * Inserts this element before a node.
\r
151 * @param {CKEDITOR.dom.node} node The that will be after this element.
\r
152 * @returns {CKEDITOR.dom.node} The node being inserted.
\r
154 * var em = new CKEDITOR.dom.element( 'em' );
\r
155 * var strong = new CKEDITOR.dom.element( 'strong' );
\r
156 * strong.insertBefore( em );
\r
158 * // result: "<strong></strong><em></em>"
\r
160 insertBefore : function( node )
\r
162 node.$.parentNode.insertBefore( this.$, node.$ );
\r
166 insertBeforeMe : function( node )
\r
168 this.$.parentNode.insertBefore( node.$, this.$ );
\r
173 * Retrieves a uniquely identifiable tree address for this node.
\r
174 * The tree address returns is an array of integers, with each integer
\r
175 * indicating a child index of a DOM node, starting from
\r
176 * document.documentElement.
\r
178 * For example, assuming <body> is the second child from <html> (<head>
\r
179 * being the first), and we'd like to address the third child under the
\r
180 * fourth child of body, the tree address returned would be:
\r
183 * The tree address cannot be used for finding back the DOM tree node once
\r
184 * the DOM tree structure has been modified.
\r
186 getAddress : function( normalized )
\r
189 var $documentElement = this.getDocument().$.documentElement;
\r
192 while ( node && node != $documentElement )
\r
194 var parentNode = node.parentNode;
\r
195 var currentIndex = -1;
\r
199 for ( var i = 0 ; i < parentNode.childNodes.length ; i++ )
\r
201 var candidate = parentNode.childNodes[i];
\r
204 candidate.nodeType == 3 &&
\r
205 candidate.previousSibling &&
\r
206 candidate.previousSibling.nodeType == 3 )
\r
213 if ( candidate == node )
\r
217 address.unshift( currentIndex );
\r
227 * Gets the document containing this element.
\r
228 * @returns {CKEDITOR.dom.document} The document.
\r
230 * var element = CKEDITOR.document.getById( 'example' );
\r
231 * alert( <b>element.getDocument().equals( CKEDITOR.document )</b> ); // "true"
\r
233 getDocument : function()
\r
235 var document = new CKEDITOR.dom.document( this.$.ownerDocument || this.$.parentNode.ownerDocument );
\r
238 this.getDocument = function()
\r
244 getIndex : function()
\r
248 var currentNode = $.parentNode && $.parentNode.firstChild;
\r
249 var currentIndex = -1;
\r
251 while ( currentNode )
\r
255 if ( currentNode == $ )
\r
256 return currentIndex;
\r
258 currentNode = currentNode.nextSibling;
\r
264 getNextSourceNode : function( startFromSibling, nodeType, guard )
\r
266 // If "guard" is a node, transform it in a function.
\r
267 if ( guard && !guard.call )
\r
269 var guardNode = guard;
\r
270 guard = function( node )
\r
272 return !node.equals( guardNode );
\r
276 var node = ( !startFromSibling && this.getFirst && this.getFirst() ),
\r
279 // Guarding when we're skipping the current element( no children or 'startFromSibling' ).
\r
280 // send the 'moving out' signal even we don't actually dive into.
\r
283 if ( this.type == CKEDITOR.NODE_ELEMENT && guard && guard( this, true ) === false )
\r
285 node = this.getNext();
\r
288 while ( !node && ( parent = ( parent || this ).getParent() ) )
\r
290 // The guard check sends the "true" paramenter to indicate that
\r
291 // we are moving "out" of the element.
\r
292 if ( guard && guard( parent, true ) === false )
\r
295 node = parent.getNext();
\r
301 if ( guard && guard( node ) === false )
\r
304 if ( nodeType && nodeType != node.type )
\r
305 return node.getNextSourceNode( false, nodeType, guard );
\r
310 getPreviousSourceNode : function( startFromSibling, nodeType, guard )
\r
312 if ( guard && !guard.call )
\r
314 var guardNode = guard;
\r
315 guard = function( node )
\r
317 return !node.equals( guardNode );
\r
321 var node = ( !startFromSibling && this.getLast && this.getLast() ),
\r
324 // Guarding when we're skipping the current element( no children or 'startFromSibling' ).
\r
325 // send the 'moving out' signal even we don't actually dive into.
\r
328 if ( this.type == CKEDITOR.NODE_ELEMENT && guard && guard( this, true ) === false )
\r
330 node = this.getPrevious();
\r
333 while ( !node && ( parent = ( parent || this ).getParent() ) )
\r
335 // The guard check sends the "true" paramenter to indicate that
\r
336 // we are moving "out" of the element.
\r
337 if ( guard && guard( parent, true ) === false )
\r
340 node = parent.getPrevious();
\r
346 if ( guard && guard( node ) === false )
\r
349 if ( nodeType && node.type != nodeType )
\r
350 return node.getPreviousSourceNode( false, nodeType, guard );
\r
355 getPrevious : function( evaluator )
\r
357 var previous = this.$, retval;
\r
360 previous = previous.previousSibling;
\r
361 retval = previous && new CKEDITOR.dom.node( previous );
\r
363 while ( retval && evaluator && !evaluator( retval ) )
\r
368 * Gets the node that follows this element in its parent's child list.
\r
369 * @param {Function} evaluator Filtering the result node.
\r
370 * @returns {CKEDITOR.dom.node} The next node or null if not available.
\r
372 * var element = CKEDITOR.dom.element.createFromHtml( '<div><b>Example</b> <i>next</i></div>' );
\r
373 * var first = <b>element.getFirst().getNext()</b>;
\r
374 * alert( first.getName() ); // "i"
\r
376 getNext : function( evaluator )
\r
378 var next = this.$, retval;
\r
381 next = next.nextSibling;
\r
382 retval = next && new CKEDITOR.dom.node( next );
\r
384 while ( retval && evaluator && !evaluator( retval ) )
\r
389 * Gets the parent element for this node.
\r
390 * @returns {CKEDITOR.dom.element} The parent element.
\r
392 * var node = editor.document.getBody().getFirst();
\r
393 * var parent = node.<b>getParent()</b>;
\r
394 * alert( node.getName() ); // "body"
\r
396 getParent : function()
\r
398 var parent = this.$.parentNode;
\r
399 return ( parent && parent.nodeType == 1 ) ? new CKEDITOR.dom.node( parent ) : null;
\r
402 getParents : function( closerFirst )
\r
409 parents[ closerFirst ? 'push' : 'unshift' ]( node );
\r
411 while ( ( node = node.getParent() ) )
\r
416 getCommonAncestor : function( node )
\r
418 if ( node.equals( this ) )
\r
421 if ( node.contains && node.contains( this ) )
\r
424 var start = this.contains ? this : this.getParent();
\r
428 if ( start.contains( node ) )
\r
431 while ( ( start = start.getParent() ) );
\r
436 getPosition : function( otherNode )
\r
439 var $other = otherNode.$;
\r
441 if ( $.compareDocumentPosition )
\r
442 return $.compareDocumentPosition( $other );
\r
444 // IE and Safari have no support for compareDocumentPosition.
\r
447 return CKEDITOR.POSITION_IDENTICAL;
\r
449 // Only element nodes support contains and sourceIndex.
\r
450 if ( this.type == CKEDITOR.NODE_ELEMENT && otherNode.type == CKEDITOR.NODE_ELEMENT )
\r
454 if ( $.contains( $other ) )
\r
455 return CKEDITOR.POSITION_CONTAINS + CKEDITOR.POSITION_PRECEDING;
\r
457 if ( $other.contains( $ ) )
\r
458 return CKEDITOR.POSITION_IS_CONTAINED + CKEDITOR.POSITION_FOLLOWING;
\r
461 if ( 'sourceIndex' in $ )
\r
463 return ( $.sourceIndex < 0 || $other.sourceIndex < 0 ) ? CKEDITOR.POSITION_DISCONNECTED :
\r
464 ( $.sourceIndex < $other.sourceIndex ) ? CKEDITOR.POSITION_PRECEDING :
\r
465 CKEDITOR.POSITION_FOLLOWING;
\r
469 // For nodes that don't support compareDocumentPosition, contains
\r
470 // or sourceIndex, their "address" is compared.
\r
472 var addressOfThis = this.getAddress(),
\r
473 addressOfOther = otherNode.getAddress(),
\r
474 minLevel = Math.min( addressOfThis.length, addressOfOther.length );
\r
476 // Determinate preceed/follow relationship.
\r
477 for ( var i = 0 ; i <= minLevel - 1 ; i++ )
\r
479 if ( addressOfThis[ i ] != addressOfOther[ i ] )
\r
481 if ( i < minLevel )
\r
483 return addressOfThis[ i ] < addressOfOther[ i ] ?
\r
484 CKEDITOR.POSITION_PRECEDING : CKEDITOR.POSITION_FOLLOWING;
\r
490 // Determinate contains/contained relationship.
\r
491 return ( addressOfThis.length < addressOfOther.length ) ?
\r
492 CKEDITOR.POSITION_CONTAINS + CKEDITOR.POSITION_PRECEDING :
\r
493 CKEDITOR.POSITION_IS_CONTAINED + CKEDITOR.POSITION_FOLLOWING;
\r
497 * Gets the closes ancestor node of a specified node name.
\r
498 * @param {String} name Node name of ancestor node.
\r
499 * @param {Boolean} includeSelf (Optional) Whether to include the current
\r
500 * node in the calculation or not.
\r
501 * @returns {CKEDITOR.dom.node} Ancestor node.
\r
503 getAscendant : function( name, includeSelf )
\r
507 if ( !includeSelf )
\r
512 if ( $.nodeName && $.nodeName.toLowerCase() == name )
\r
513 return new CKEDITOR.dom.node( $ );
\r
520 hasAscendant : function( name, includeSelf )
\r
524 if ( !includeSelf )
\r
529 if ( $.nodeName && $.nodeName.toLowerCase() == name )
\r
537 move : function( target, toStart )
\r
539 target.append( this.remove(), toStart );
\r
543 * Removes this node from the document DOM.
\r
544 * @param {Boolean} [preserveChildren] Indicates that the children
\r
545 * elements must remain in the document, removing only the outer
\r
548 * var element = CKEDITOR.dom.element.getById( 'MyElement' );
\r
549 * <b>element.remove()</b>;
\r
551 remove : function( preserveChildren )
\r
554 var parent = $.parentNode;
\r
558 if ( preserveChildren )
\r
560 // Move all children before the node.
\r
561 for ( var child ; ( child = $.firstChild ) ; )
\r
563 parent.insertBefore( $.removeChild( child ), $ );
\r
567 parent.removeChild( $ );
\r
573 replace : function( nodeToReplace )
\r
575 this.insertBefore( nodeToReplace );
\r
576 nodeToReplace.remove();
\r
588 while ( this.getFirst && ( child = this.getFirst() ) )
\r
590 if ( child.type == CKEDITOR.NODE_TEXT )
\r
592 var trimmed = CKEDITOR.tools.ltrim( child.getText() ),
\r
593 originalLength = child.getLength();
\r
600 else if ( trimmed.length < originalLength )
\r
602 child.split( originalLength - trimmed.length );
\r
604 // IE BUG: child.remove() may raise JavaScript errors here. (#81)
\r
605 this.$.removeChild( this.$.firstChild );
\r
615 while ( this.getLast && ( child = this.getLast() ) )
\r
617 if ( child.type == CKEDITOR.NODE_TEXT )
\r
619 var trimmed = CKEDITOR.tools.rtrim( child.getText() ),
\r
620 originalLength = child.getLength();
\r
627 else if ( trimmed.length < originalLength )
\r
629 child.split( trimmed.length );
\r
631 // IE BUG: child.getNext().remove() may raise JavaScript errors here.
\r
633 this.$.lastChild.parentNode.removeChild( this.$.lastChild );
\r
639 if ( !CKEDITOR.env.ie && !CKEDITOR.env.opera )
\r
641 child = this.$.lastChild;
\r
643 if ( child && child.type == 1 && child.nodeName.toLowerCase() == 'br' )
\r
645 // Use "eChildNode.parentNode" instead of "node" to avoid IE bug (#324).
\r
646 child.parentNode.removeChild( child ) ;
\r