Index: /FCKeditor/trunk/editor/_source/internals/fckdomtools.js =================================================================== --- /FCKeditor/trunk/editor/_source/internals/fckdomtools.js (revision 976) +++ /FCKeditor/trunk/editor/_source/internals/fckdomtools.js (revision 977) @@ -416,5 +416,6 @@ } - // Now we're sure the padding node exists, and it is unchanged, and it isn't the only node in doc.body, remove it. + // Now we're sure the padding node exists, and it is unchanged, and it + // isn't the only node in doc.body, remove it. if ( !dontRemove ) { @@ -541,12 +542,15 @@ /** * Retrieves a uniquely identifiable tree address of a DOM tree node. - * The tree address returns is an array of integers, with each integer indicating a child index from a DOM tree node, - * starting from document.documentElement. + * The tree address returns is an array of integers, with each integer + * indicating a child index from a DOM tree node, starting from + * document.documentElement. * - * For example, assuming is the second child from ( being the first), and we'd like to address - * the third child under the fourth child of body, the tree address returned would be: + * For example, assuming is the second child from ( + * being the first), and we'd like to address the third child under the + * fourth child of body, the tree address returned would be: * [1, 3, 2] * - * The tree address cannot be used for finding back the DOM tree node once the DOM tree structure has been modified. + * The tree address cannot be used for finding back the DOM tree node once + * the DOM tree structure has been modified. */ GetNodeAddress : function( node, normalized ) @@ -576,6 +580,6 @@ /** - * The reverse transformation of FCKDomTools.GetNodeAddress(). This function returns the DOM node pointed to by its - * index address. + * The reverse transformation of FCKDomTools.GetNodeAddress(). This + * function returns the DOM node pointed to by its index address. */ GetNodeFromAddress : function( doc, addr, normalized ) @@ -657,7 +661,10 @@ }, - // Convert a DOM list tree into a data structure that is easier to manipulate. - // This operation should be non-intrusive in the sense that it does not change the DOM tree, - // with the exception that it may add some markers to the list item nodes when markerObj is specified. + /** + * Convert a DOM list tree into a data structure that is easier to + * manipulate. This operation should be non-intrusive in the sense that it + * does not change the DOM tree, with the exception that it may add some + * markers to the list item nodes when markerObj is specified. + */ ListToArray : function( listNode, markerObj, baseArray, baseIndentLevel, grandparentNode ) { @@ -691,6 +698,6 @@ var child = listItem.childNodes[j] ; if ( child.nodeName.IEquals( ['ul', 'ol'] ) ) - // Note the recursion here, it pushes inner list items with +1 indentation in the correct - // order. + // Note the recursion here, it pushes inner list items with + // +1 indentation in the correct order. this.ListToArray( child, markerObj, baseArray, baseIndentLevel + 1, itemObj.grandparent ) ; else