ckeditor-rails 0.0.2 → 0.0.3

data/vendor/assets/ckeditor/ckeditor/_source/core/dom/rangelist.js

@@ -1,213 +1,213 @@
-/*
-Copyright (c) 2003-2011, CKSource - Frederico Knabben. All rights reserved.
-For licensing, see LICENSE.html or http://ckeditor.com/license
-*/
-
-(function()
-{
-	/**
-	 * Represents a list os CKEDITOR.dom.range objects, which can be easily
-	 * iterated sequentially.
-	 * @constructor
-	 * @param {CKEDITOR.dom.range|Array} [ranges] The ranges contained on this list.
-	 *		Note that, if an array of ranges is specified, the range sequence
-	 *		should match its DOM order. This class will not help to sort them.
-	 */
-	CKEDITOR.dom.rangeList = function( ranges )
-	{
-		if ( ranges instanceof CKEDITOR.dom.rangeList )
-			return ranges;
-
-		if ( !ranges )
-			ranges = [];
-		else if ( ranges instanceof CKEDITOR.dom.range )
-			ranges = [ ranges ];
-
-		return CKEDITOR.tools.extend( ranges, mixins );
-	};
-
-	var mixins =
-	/** @lends CKEDITOR.dom.rangeList.prototype */
-	{
-			/**
-			 * Creates an instance of the rangeList iterator, it should be used
-			 * only when the ranges processing could be DOM intrusive, which
-			 * means it may pollute and break other ranges in this list.
-			 * Otherwise, it's enough to just iterate over this array in a for loop.
-			 * @returns {CKEDITOR.dom.rangeListIterator}
-			 */
-			createIterator : function()
-			{
-				var rangeList = this,
-					bookmark = CKEDITOR.dom.walker.bookmark(),
-					guard = function( node ) { return ! ( node.is && node.is( 'tr' ) ); },
-						bookmarks = [],
-					current;
-
-				/**
-				 * @lends CKEDITOR.dom.rangeListIterator.prototype
-				 */
-				return {
-
-					/**
-					 * Retrieves the next range in the list.
-					 * @param {Boolean} mergeConsequent Whether join two adjacent ranges into single, e.g. consequent table cells.
-					 */
-					getNextRange : function( mergeConsequent )
-					{
-						current = current == undefined ? 0 : current + 1;
-
-						var range = rangeList[ current ];
-
-						// Multiple ranges might be mangled by each other.
-						if ( range && rangeList.length > 1 )
-						{
-							// Bookmarking all other ranges on the first iteration,
-							// the range correctness after it doesn't matter since we'll
-							// restore them before the next iteration.
-							if ( !current )
-							{
-								// Make sure bookmark correctness by reverse processing.
-								for ( var i = rangeList.length - 1; i >= 0; i-- )
-									bookmarks.unshift( rangeList[ i ].createBookmark( true ) );
-							}
-
-							if ( mergeConsequent )
-							{
-								// Figure out how many ranges should be merged.
-								var mergeCount = 0;
-								while ( rangeList[ current + mergeCount + 1 ] )
-								{
-									var doc = range.document,
-										found = 0,
-										left =  doc.getById( bookmarks[ mergeCount ].endNode ),
-										right = doc.getById( bookmarks[ mergeCount + 1 ].startNode ),
-										next;
-
-									// Check subsequent range.
-									while ( 1 )
-									{
-										next = left.getNextSourceNode( false );
-										if ( !right.equals( next ) )
-										{
-											// This could be yet another bookmark or
-											// walking across block boundaries.
-											if ( bookmark( next ) || ( next.type == CKEDITOR.NODE_ELEMENT && next.isBlockBoundary() ) )
-											{
-												left = next;
-												continue;
-											}
-										}
-										else
-											found = 1;
-
-										break;
-									}
-
-									if ( !found )
-										break;
-
-									mergeCount++;
-								}
-							}
-
-							range.moveToBookmark( bookmarks.shift() );
-
-							// Merge ranges finally after moving to bookmarks.
-							while( mergeCount-- )
-							{
-								next = rangeList[ ++current ];
-								next.moveToBookmark( bookmarks.shift() );
-								range.setEnd( next.endContainer, next.endOffset );
-							}
-						}
-
-						return range;
-					}
-				};
-			},
-
-			createBookmarks : function( serializable )
-			{
-				var retval = [], bookmark;
-				for ( var i = 0; i < this.length ; i++ )
-				{
-					retval.push( bookmark = this[ i ].createBookmark( serializable, true) );
-
-					// Updating the container & offset values for ranges
-					// that have been touched.
-					for ( var j = i + 1; j < this.length; j++ )
-					{
-						this[ j ] = updateDirtyRange( bookmark, this[ j ] );
-						this[ j ] = updateDirtyRange( bookmark, this[ j ], true );
-					}
-				}
-				return retval;
-			},
-
-			createBookmarks2 : function( normalized )
-			{
-				var bookmarks = [];
-
-				for ( var i = 0 ; i < this.length ; i++ )
-					bookmarks.push( this[ i ].createBookmark2( normalized ) );
-
-				return bookmarks;
-			},
-
-			/**
-			 * Move each range in the list to the position specified by a list of bookmarks.
-			 * @param {Array} bookmarks The list of bookmarks, each one matching a range in the list.
-			 */
-			moveToBookmarks :  function( bookmarks )
-			{
-				for ( var i = 0 ; i < this.length ; i++ )
-					this[ i ].moveToBookmark( bookmarks[ i ] );
-			}
-	};
-
-	// Update the specified range which has been mangled by previous insertion of
-	// range bookmark nodes.(#3256)
-	function updateDirtyRange( bookmark, dirtyRange, checkEnd )
-	{
-		var serializable = bookmark.serializable,
-			container = dirtyRange[ checkEnd ? 'endContainer' : 'startContainer' ],
-			offset = checkEnd ? 'endOffset' : 'startOffset';
-
-		var bookmarkStart = serializable ?
-				dirtyRange.document.getById( bookmark.startNode )
-				: bookmark.startNode;
-
-		var bookmarkEnd = serializable ?
-				dirtyRange.document.getById( bookmark.endNode )
-				: bookmark.endNode;
-
-		if ( container.equals( bookmarkStart.getPrevious() ) )
-		{
-			dirtyRange.startOffset = dirtyRange.startOffset
-					- container.getLength()
-					- bookmarkEnd.getPrevious().getLength();
-			container = bookmarkEnd.getNext();
-		}
-		else if ( container.equals( bookmarkEnd.getPrevious() ) )
-		{
-			dirtyRange.startOffset = dirtyRange.startOffset - container.getLength();
-			container = bookmarkEnd.getNext();
-		}
-
-		container.equals( bookmarkStart.getParent() ) && dirtyRange[ offset ]++;
-		container.equals( bookmarkEnd.getParent() ) && dirtyRange[ offset ]++;
-
-		// Update and return this range.
-		dirtyRange[ checkEnd ? 'endContainer' : 'startContainer' ] = container;
-		return dirtyRange;
-	}
-})();
-
-/**
- * (Virtual Class) Do not call this constructor. This class is not really part
- *	of the API. It just describes the return type of {@link CKEDITOR.dom.rangeList#createIterator}.
- * @name CKEDITOR.dom.rangeListIterator
- * @constructor
- * @example
- */
+/*
+Copyright (c) 2003-2011, CKSource - Frederico Knabben. All rights reserved.
+For licensing, see LICENSE.html or http://ckeditor.com/license
+*/
+
+(function()
+{
+	/**
+	 * Represents a list os CKEDITOR.dom.range objects, which can be easily
+	 * iterated sequentially.
+	 * @constructor
+	 * @param {CKEDITOR.dom.range|Array} [ranges] The ranges contained on this list.
+	 *		Note that, if an array of ranges is specified, the range sequence
+	 *		should match its DOM order. This class will not help to sort them.
+	 */
+	CKEDITOR.dom.rangeList = function( ranges )
+	{
+		if ( ranges instanceof CKEDITOR.dom.rangeList )
+			return ranges;
+
+		if ( !ranges )
+			ranges = [];
+		else if ( ranges instanceof CKEDITOR.dom.range )
+			ranges = [ ranges ];
+
+		return CKEDITOR.tools.extend( ranges, mixins );
+	};
+
+	var mixins =
+	/** @lends CKEDITOR.dom.rangeList.prototype */
+	{
+			/**
+			 * Creates an instance of the rangeList iterator, it should be used
+			 * only when the ranges processing could be DOM intrusive, which
+			 * means it may pollute and break other ranges in this list.
+			 * Otherwise, it's enough to just iterate over this array in a for loop.
+			 * @returns {CKEDITOR.dom.rangeListIterator}
+			 */
+			createIterator : function()
+			{
+				var rangeList = this,
+					bookmark = CKEDITOR.dom.walker.bookmark(),
+					guard = function( node ) { return ! ( node.is && node.is( 'tr' ) ); },
+						bookmarks = [],
+					current;
+
+				/**
+				 * @lends CKEDITOR.dom.rangeListIterator.prototype
+				 */
+				return {
+
+					/**
+					 * Retrieves the next range in the list.
+					 * @param {Boolean} mergeConsequent Whether join two adjacent ranges into single, e.g. consequent table cells.
+					 */
+					getNextRange : function( mergeConsequent )
+					{
+						current = current == undefined ? 0 : current + 1;
+
+						var range = rangeList[ current ];
+
+						// Multiple ranges might be mangled by each other.
+						if ( range && rangeList.length > 1 )
+						{
+							// Bookmarking all other ranges on the first iteration,
+							// the range correctness after it doesn't matter since we'll
+							// restore them before the next iteration.
+							if ( !current )
+							{
+								// Make sure bookmark correctness by reverse processing.
+								for ( var i = rangeList.length - 1; i >= 0; i-- )
+									bookmarks.unshift( rangeList[ i ].createBookmark( true ) );
+							}
+
+							if ( mergeConsequent )
+							{
+								// Figure out how many ranges should be merged.
+								var mergeCount = 0;
+								while ( rangeList[ current + mergeCount + 1 ] )
+								{
+									var doc = range.document,
+										found = 0,
+										left =  doc.getById( bookmarks[ mergeCount ].endNode ),
+										right = doc.getById( bookmarks[ mergeCount + 1 ].startNode ),
+										next;
+
+									// Check subsequent range.
+									while ( 1 )
+									{
+										next = left.getNextSourceNode( false );
+										if ( !right.equals( next ) )
+										{
+											// This could be yet another bookmark or
+											// walking across block boundaries.
+											if ( bookmark( next ) || ( next.type == CKEDITOR.NODE_ELEMENT && next.isBlockBoundary() ) )
+											{
+												left = next;
+												continue;
+											}
+										}
+										else
+											found = 1;
+
+										break;
+									}
+
+									if ( !found )
+										break;
+
+									mergeCount++;
+								}
+							}
+
+							range.moveToBookmark( bookmarks.shift() );
+
+							// Merge ranges finally after moving to bookmarks.
+							while( mergeCount-- )
+							{
+								next = rangeList[ ++current ];
+								next.moveToBookmark( bookmarks.shift() );
+								range.setEnd( next.endContainer, next.endOffset );
+							}
+						}
+
+						return range;
+					}
+				};
+			},
+
+			createBookmarks : function( serializable )
+			{
+				var retval = [], bookmark;
+				for ( var i = 0; i < this.length ; i++ )
+				{
+					retval.push( bookmark = this[ i ].createBookmark( serializable, true) );
+
+					// Updating the container & offset values for ranges
+					// that have been touched.
+					for ( var j = i + 1; j < this.length; j++ )
+					{
+						this[ j ] = updateDirtyRange( bookmark, this[ j ] );
+						this[ j ] = updateDirtyRange( bookmark, this[ j ], true );
+					}
+				}
+				return retval;
+			},
+
+			createBookmarks2 : function( normalized )
+			{
+				var bookmarks = [];
+
+				for ( var i = 0 ; i < this.length ; i++ )
+					bookmarks.push( this[ i ].createBookmark2( normalized ) );
+
+				return bookmarks;
+			},
+
+			/**
+			 * Move each range in the list to the position specified by a list of bookmarks.
+			 * @param {Array} bookmarks The list of bookmarks, each one matching a range in the list.
+			 */
+			moveToBookmarks :  function( bookmarks )
+			{
+				for ( var i = 0 ; i < this.length ; i++ )
+					this[ i ].moveToBookmark( bookmarks[ i ] );
+			}
+	};
+
+	// Update the specified range which has been mangled by previous insertion of
+	// range bookmark nodes.(#3256)
+	function updateDirtyRange( bookmark, dirtyRange, checkEnd )
+	{
+		var serializable = bookmark.serializable,
+			container = dirtyRange[ checkEnd ? 'endContainer' : 'startContainer' ],
+			offset = checkEnd ? 'endOffset' : 'startOffset';
+
+		var bookmarkStart = serializable ?
+				dirtyRange.document.getById( bookmark.startNode )
+				: bookmark.startNode;
+
+		var bookmarkEnd = serializable ?
+				dirtyRange.document.getById( bookmark.endNode )
+				: bookmark.endNode;
+
+		if ( container.equals( bookmarkStart.getPrevious() ) )
+		{
+			dirtyRange.startOffset = dirtyRange.startOffset
+					- container.getLength()
+					- bookmarkEnd.getPrevious().getLength();
+			container = bookmarkEnd.getNext();
+		}
+		else if ( container.equals( bookmarkEnd.getPrevious() ) )
+		{
+			dirtyRange.startOffset = dirtyRange.startOffset - container.getLength();
+			container = bookmarkEnd.getNext();
+		}
+
+		container.equals( bookmarkStart.getParent() ) && dirtyRange[ offset ]++;
+		container.equals( bookmarkEnd.getParent() ) && dirtyRange[ offset ]++;
+
+		// Update and return this range.
+		dirtyRange[ checkEnd ? 'endContainer' : 'startContainer' ] = container;
+		return dirtyRange;
+	}
+})();
+
+/**
+ * (Virtual Class) Do not call this constructor. This class is not really part
+ *	of the API. It just describes the return type of {@link CKEDITOR.dom.rangeList#createIterator}.
+ * @name CKEDITOR.dom.rangeListIterator
+ * @constructor
+ * @example
+ */

data/vendor/assets/ckeditor/ckeditor/_source/core/dom/text.js

@@ -1,128 +1,128 @@
-/*
-Copyright (c) 2003-2011, CKSource - Frederico Knabben. All rights reserved.
-For licensing, see LICENSE.html or http://ckeditor.com/license
-*/
-
-/**
- * @fileOverview Defines the {@link CKEDITOR.dom.text} class, which represents
- *		a DOM text node.
- */
-
-/**
- * Represents a DOM text node.
- * @constructor
- * @augments CKEDITOR.dom.node
- * @param {Object|String} text A native DOM text node or a string containing
- *		the text to use to create a new text node.
- * @param {CKEDITOR.dom.document} [ownerDocument] The document that will contain
- *		the node in case of new node creation. Defaults to the current document.
- * @example
- * var nativeNode = document.createTextNode( 'Example' );
- * var text = CKEDITOR.dom.text( nativeNode );
- * @example
- * var text = CKEDITOR.dom.text( 'Example' );
- */
-CKEDITOR.dom.text = function( text, ownerDocument )
-{
-	if ( typeof text == 'string' )
-		text = ( ownerDocument ? ownerDocument.$ : document ).createTextNode( text );
-
-	// Theoretically, we should call the base constructor here
-	// (not CKEDITOR.dom.node though). But, IE doesn't support expando
-	// properties on text node, so the features provided by domObject will not
-	// work for text nodes (which is not a big issue for us).
-	//
-	// CKEDITOR.dom.domObject.call( this, element );
-
-	/**
-	 * The native DOM text node represented by this class instance.
-	 * @type Object
-	 * @example
-	 * var element = new CKEDITOR.dom.text( 'Example' );
-	 * alert( element.$.nodeType );  // "3"
-	 */
-	this.$ = text;
-};
-
-CKEDITOR.dom.text.prototype = new CKEDITOR.dom.node();
-
-CKEDITOR.tools.extend( CKEDITOR.dom.text.prototype,
-	/** @lends CKEDITOR.dom.text.prototype */
-	{
-		/**
-		 * The node type. This is a constant value set to
-		 * {@link CKEDITOR.NODE_TEXT}.
-		 * @type Number
-		 * @example
-		 */
-		type : CKEDITOR.NODE_TEXT,
-
-		getLength : function()
-		{
-			return this.$.nodeValue.length;
-		},
-
-		getText : function()
-		{
-			return this.$.nodeValue;
-		},
-
-		setText : function( text )
-		{
-			this.$.nodeValue = text;
-		},
-
-		/**
-		 * Breaks this text node into two nodes at the specified offset,
-		 * keeping both in the tree as siblings. This node then only contains
-		 * all the content up to the offset point. A new text node, which is
-		 * inserted as the next sibling of this node, contains all the content
-		 * at and after the offset point. When the offset is equal to the
-		 * length of this node, the new node has no data.
-		 * @param {Number} The position at which to split, starting from zero.
-		 * @returns {CKEDITOR.dom.text} The new text node.
-		 */
-		split : function( offset )
-		{
-			// If the offset is after the last char, IE creates the text node
-			// on split, but don't include it into the DOM. So, we have to do
-			// that manually here.
-			if ( CKEDITOR.env.ie && offset == this.getLength() )
-			{
-				var next = this.getDocument().createText( '' );
-				next.insertAfter( this );
-				return next;
-			}
-
-			var doc = this.getDocument();
-			var retval = new CKEDITOR.dom.text( this.$.splitText( offset ), doc );
-
-			// IE BUG: IE8 does not update the childNodes array in DOM after splitText(),
-			// we need to make some DOM changes to make it update. (#3436)
-			if ( CKEDITOR.env.ie8 )
-			{
-				var workaround = new CKEDITOR.dom.text( '', doc );
-				workaround.insertAfter( retval );
-				workaround.remove();
-			}
-
-			return retval;
-		},
-
-		/**
-		 * Extracts characters from indexA up to but not including indexB.
-		 * @param {Number} indexA An integer between 0 and one less than the
-		 *		length of the text.
-		 * @param {Number} [indexB] An integer between 0 and the length of the
-		 *		string. If omitted, extracts characters to the end of the text.
-		 */
-		substring : function( indexA, indexB )
-		{
-			// We need the following check due to a Firefox bug
-			// https://bugzilla.mozilla.org/show_bug.cgi?id=458886
-			if ( typeof indexB != 'number' )
-				return this.$.nodeValue.substr( indexA );
-			else
-				return this.$.nodeValue.substring( indexA, indexB );
-		}
-	});
+/*
+Copyright (c) 2003-2011, CKSource - Frederico Knabben. All rights reserved.
+For licensing, see LICENSE.html or http://ckeditor.com/license
+*/
+
+/**
+ * @fileOverview Defines the {@link CKEDITOR.dom.text} class, which represents
+ *		a DOM text node.
+ */
+
+/**
+ * Represents a DOM text node.
+ * @constructor
+ * @augments CKEDITOR.dom.node
+ * @param {Object|String} text A native DOM text node or a string containing
+ *		the text to use to create a new text node.
+ * @param {CKEDITOR.dom.document} [ownerDocument] The document that will contain
+ *		the node in case of new node creation. Defaults to the current document.
+ * @example
+ * var nativeNode = document.createTextNode( 'Example' );
+ * var text = CKEDITOR.dom.text( nativeNode );
+ * @example
+ * var text = CKEDITOR.dom.text( 'Example' );
+ */
+CKEDITOR.dom.text = function( text, ownerDocument )
+{
+	if ( typeof text == 'string' )
+		text = ( ownerDocument ? ownerDocument.$ : document ).createTextNode( text );
+
+	// Theoretically, we should call the base constructor here
+	// (not CKEDITOR.dom.node though). But, IE doesn't support expando
+	// properties on text node, so the features provided by domObject will not
+	// work for text nodes (which is not a big issue for us).
+	//
+	// CKEDITOR.dom.domObject.call( this, element );
+
+	/**
+	 * The native DOM text node represented by this class instance.
+	 * @type Object
+	 * @example
+	 * var element = new CKEDITOR.dom.text( 'Example' );
+	 * alert( element.$.nodeType );  // "3"
+	 */
+	this.$ = text;
+};
+
+CKEDITOR.dom.text.prototype = new CKEDITOR.dom.node();
+
+CKEDITOR.tools.extend( CKEDITOR.dom.text.prototype,
+	/** @lends CKEDITOR.dom.text.prototype */
+	{
+		/**
+		 * The node type. This is a constant value set to
+		 * {@link CKEDITOR.NODE_TEXT}.
+		 * @type Number
+		 * @example
+		 */
+		type : CKEDITOR.NODE_TEXT,
+
+		getLength : function()
+		{
+			return this.$.nodeValue.length;
+		},
+
+		getText : function()
+		{
+			return this.$.nodeValue;
+		},
+
+		setText : function( text )
+		{
+			this.$.nodeValue = text;
+		},
+
+		/**
+		 * Breaks this text node into two nodes at the specified offset,
+		 * keeping both in the tree as siblings. This node then only contains
+		 * all the content up to the offset point. A new text node, which is
+		 * inserted as the next sibling of this node, contains all the content
+		 * at and after the offset point. When the offset is equal to the
+		 * length of this node, the new node has no data.
+		 * @param {Number} The position at which to split, starting from zero.
+		 * @returns {CKEDITOR.dom.text} The new text node.
+		 */
+		split : function( offset )
+		{
+			// If the offset is after the last char, IE creates the text node
+			// on split, but don't include it into the DOM. So, we have to do
+			// that manually here.
+			if ( CKEDITOR.env.ie && offset == this.getLength() )
+			{
+				var next = this.getDocument().createText( '' );
+				next.insertAfter( this );
+				return next;
+			}
+
+			var doc = this.getDocument();
+			var retval = new CKEDITOR.dom.text( this.$.splitText( offset ), doc );
+
+			// IE BUG: IE8 does not update the childNodes array in DOM after splitText(),
+			// we need to make some DOM changes to make it update. (#3436)
+			if ( CKEDITOR.env.ie8 )
+			{
+				var workaround = new CKEDITOR.dom.text( '', doc );
+				workaround.insertAfter( retval );
+				workaround.remove();
+			}
+
+			return retval;
+		},
+
+		/**
+		 * Extracts characters from indexA up to but not including indexB.
+		 * @param {Number} indexA An integer between 0 and one less than the
+		 *		length of the text.
+		 * @param {Number} [indexB] An integer between 0 and the length of the
+		 *		string. If omitted, extracts characters to the end of the text.
+		 */
+		substring : function( indexA, indexB )
+		{
+			// We need the following check due to a Firefox bug
+			// https://bugzilla.mozilla.org/show_bug.cgi?id=458886
+			if ( typeof indexB != 'number' )
+				return this.$.nodeValue.substr( indexA );
+			else
+				return this.$.nodeValue.substring( indexA, indexB );
+		}
+	});