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 * @file Insert and remove numbered and bulleted lists.
\r
12 var listNodeNames = { ol : 1, ul : 1 },
\r
13 emptyTextRegex = /^[\n\r\t ]*$/;
\r
15 CKEDITOR.plugins.list = {
\r
17 * Convert a DOM list tree into a data structure that is easier to
\r
18 * manipulate. This operation should be non-intrusive in the sense that it
\r
19 * does not change the DOM tree, with the exception that it may add some
\r
20 * markers to the list item nodes when database is specified.
\r
22 listToArray : function( listNode, database, baseArray, baseIndentLevel, grandparentNode )
\r
24 if ( !listNodeNames[ listNode.getName() ] )
\r
27 if ( !baseIndentLevel )
\r
28 baseIndentLevel = 0;
\r
32 // Iterate over all list items to and look for inner lists.
\r
33 for ( var i = 0, count = listNode.getChildCount() ; i < count ; i++ )
\r
35 var listItem = listNode.getChild( i );
\r
37 // It may be a text node or some funny stuff.
\r
38 if ( listItem.$.nodeName.toLowerCase() != 'li' )
\r
41 var itemObj = { 'parent' : listNode, indent : baseIndentLevel, element : listItem, contents : [] };
\r
42 if ( !grandparentNode )
\r
44 itemObj.grandparent = listNode.getParent();
\r
45 if ( itemObj.grandparent && itemObj.grandparent.$.nodeName.toLowerCase() == 'li' )
\r
46 itemObj.grandparent = itemObj.grandparent.getParent();
\r
49 itemObj.grandparent = grandparentNode;
\r
52 CKEDITOR.dom.element.setMarker( database, listItem, 'listarray_index', baseArray.length );
\r
53 baseArray.push( itemObj );
\r
55 for ( var j = 0, itemChildCount = listItem.getChildCount(), child; j < itemChildCount ; j++ )
\r
57 child = listItem.getChild( j );
\r
58 if ( child.type == CKEDITOR.NODE_ELEMENT && listNodeNames[ child.getName() ] )
\r
59 // Note the recursion here, it pushes inner list items with
\r
60 // +1 indentation in the correct order.
\r
61 CKEDITOR.plugins.list.listToArray( child, database, baseArray, baseIndentLevel + 1, itemObj.grandparent );
\r
63 itemObj.contents.push( child );
\r
69 // Convert our internal representation of a list back to a DOM forest.
\r
70 arrayToList : function( listArray, database, baseIndex, paragraphMode, dir )
\r
74 if ( !listArray || listArray.length < baseIndex + 1 )
\r
76 var doc = listArray[ baseIndex ].parent.getDocument(),
\r
77 retval = new CKEDITOR.dom.documentFragment( doc ),
\r
79 currentIndex = baseIndex,
\r
80 indentLevel = Math.max( listArray[ baseIndex ].indent, 0 ),
\r
81 currentListItem = null,
\r
82 paragraphName = ( paragraphMode == CKEDITOR.ENTER_P ? 'p' : 'div' );
\r
85 var item = listArray[ currentIndex ];
\r
86 if ( item.indent == indentLevel )
\r
88 if ( !rootNode || listArray[ currentIndex ].parent.getName() != rootNode.getName() )
\r
90 rootNode = listArray[ currentIndex ].parent.clone( false, true );
\r
91 retval.append( rootNode );
\r
93 currentListItem = rootNode.append( item.element.clone( false, true ) );
\r
94 for ( var i = 0 ; i < item.contents.length ; i++ )
\r
95 currentListItem.append( item.contents[i].clone( true, true ) );
\r
98 else if ( item.indent == Math.max( indentLevel, 0 ) + 1 )
\r
100 var listData = CKEDITOR.plugins.list.arrayToList( listArray, null, currentIndex, paragraphMode );
\r
101 currentListItem.append( listData.listNode );
\r
102 currentIndex = listData.nextIndex;
\r
104 else if ( item.indent == -1 && !baseIndex && item.grandparent )
\r
107 if ( listNodeNames[ item.grandparent.getName() ] )
\r
108 currentListItem = item.element.clone( false, true );
\r
111 // Create completely new blocks here, attributes are dropped.
\r
112 if ( dir || ( paragraphMode != CKEDITOR.ENTER_BR && item.grandparent.getName() != 'td' ) )
\r
114 currentListItem = doc.createElement( paragraphName );
\r
116 currentListItem.setAttribute( 'dir', dir );
\r
119 currentListItem = new CKEDITOR.dom.documentFragment( doc );
\r
122 for ( i = 0 ; i < item.contents.length ; i++ )
\r
123 currentListItem.append( item.contents[i].clone( true, true ) );
\r
125 if ( currentListItem.type == CKEDITOR.NODE_DOCUMENT_FRAGMENT
\r
126 && currentIndex != listArray.length - 1 )
\r
128 if ( currentListItem.getLast()
\r
129 && currentListItem.getLast().type == CKEDITOR.NODE_ELEMENT
\r
130 && currentListItem.getLast().getAttribute( 'type' ) == '_moz' )
\r
131 currentListItem.getLast().remove();
\r
132 currentListItem.appendBogus();
\r
135 if ( currentListItem.type == CKEDITOR.NODE_ELEMENT &&
\r
136 currentListItem.getName() == paragraphName &&
\r
137 currentListItem.$.firstChild )
\r
139 currentListItem.trim();
\r
140 var firstChild = currentListItem.getFirst();
\r
141 if ( firstChild.type == CKEDITOR.NODE_ELEMENT && firstChild.isBlockBoundary() )
\r
143 var tmp = new CKEDITOR.dom.documentFragment( doc );
\r
144 currentListItem.moveChildren( tmp );
\r
145 currentListItem = tmp;
\r
149 var currentListItemName = currentListItem.$.nodeName.toLowerCase();
\r
150 if ( !CKEDITOR.env.ie && ( currentListItemName == 'div' || currentListItemName == 'p' ) )
\r
151 currentListItem.appendBogus();
\r
152 retval.append( currentListItem );
\r
159 if ( listArray.length <= currentIndex || Math.max( listArray[ currentIndex ].indent, 0 ) < indentLevel )
\r
163 // Clear marker attributes for the new list tree made of cloned nodes, if any.
\r
166 var currentNode = retval.getFirst();
\r
167 while ( currentNode )
\r
169 if ( currentNode.type == CKEDITOR.NODE_ELEMENT )
\r
170 CKEDITOR.dom.element.clearMarkers( database, currentNode );
\r
171 currentNode = currentNode.getNextSourceNode();
\r
175 return { listNode : retval, nextIndex : currentIndex };
\r
179 function setState( editor, state )
\r
181 editor.getCommand( this.name ).setState( state );
\r
184 function onSelectionChange( evt )
\r
186 var path = evt.data.path,
\r
187 blockLimit = path.blockLimit,
\r
188 elements = path.elements,
\r
191 // Grouping should only happen under blockLimit.(#3940).
\r
192 for ( var i = 0 ; i < elements.length && ( element = elements[ i ] )
\r
193 && !element.equals( blockLimit ); i++ )
\r
195 if ( listNodeNames[ elements[i].getName() ] )
\r
197 return setState.call( this, evt.editor,
\r
198 this.type == elements[i].getName() ? CKEDITOR.TRISTATE_ON : CKEDITOR.TRISTATE_OFF );
\r
202 return setState.call( this, evt.editor, CKEDITOR.TRISTATE_OFF );
\r
205 function changeListType( editor, groupObj, database, listsCreated )
\r
207 // This case is easy...
\r
208 // 1. Convert the whole list into a one-dimensional array.
\r
209 // 2. Change the list type by modifying the array.
\r
210 // 3. Recreate the whole list by converting the array to a list.
\r
211 // 4. Replace the original list with the recreated list.
\r
212 var listArray = CKEDITOR.plugins.list.listToArray( groupObj.root, database ),
\r
213 selectedListItems = [];
\r
215 for ( var i = 0 ; i < groupObj.contents.length ; i++ )
\r
217 var itemNode = groupObj.contents[i];
\r
218 itemNode = itemNode.getAscendant( 'li', true );
\r
219 if ( !itemNode || itemNode.getCustomData( 'list_item_processed' ) )
\r
221 selectedListItems.push( itemNode );
\r
222 CKEDITOR.dom.element.setMarker( database, itemNode, 'list_item_processed', true );
\r
225 var root = groupObj.root,
\r
226 fakeParent = root.getDocument().createElement( this.type );
\r
227 // Copy all attributes, except from 'start' and 'type'.
\r
228 root.copyAttributes( fakeParent, { start : 1, type : 1 } );
\r
229 // The list-style-type property should be ignored.
\r
230 fakeParent.removeStyle( 'list-style-type' );
\r
232 for ( i = 0 ; i < selectedListItems.length ; i++ )
\r
234 var listIndex = selectedListItems[i].getCustomData( 'listarray_index' );
\r
235 listArray[listIndex].parent = fakeParent;
\r
237 var newList = CKEDITOR.plugins.list.arrayToList( listArray, database, null, editor.config.enterMode );
\r
238 var child, length = newList.listNode.getChildCount();
\r
239 for ( i = 0 ; i < length && ( child = newList.listNode.getChild( i ) ) ; i++ )
\r
241 if ( child.getName() == this.type )
\r
242 listsCreated.push( child );
\r
244 newList.listNode.replace( groupObj.root );
\r
247 var headerTagRegex = /^h[1-6]$/;
\r
249 function createList( editor, groupObj, listsCreated )
\r
251 var contents = groupObj.contents,
\r
252 doc = groupObj.root.getDocument(),
\r
255 // It is possible to have the contents returned by DomRangeIterator to be the same as the root.
\r
256 // e.g. when we're running into table cells.
\r
257 // In such a case, enclose the childNodes of contents[0] into a <div>.
\r
258 if ( contents.length == 1 && contents[0].equals( groupObj.root ) )
\r
260 var divBlock = doc.createElement( 'div' );
\r
261 contents[0].moveChildren && contents[0].moveChildren( divBlock );
\r
262 contents[0].append( divBlock );
\r
263 contents[0] = divBlock;
\r
266 // Calculate the common parent node of all content blocks.
\r
267 var commonParent = groupObj.contents[0].getParent();
\r
268 for ( var i = 0 ; i < contents.length ; i++ )
\r
269 commonParent = commonParent.getCommonAncestor( contents[i].getParent() );
\r
271 // We want to insert things that are in the same tree level only, so calculate the contents again
\r
272 // by expanding the selected blocks to the same tree level.
\r
273 for ( i = 0 ; i < contents.length ; i++ )
\r
275 var contentNode = contents[i],
\r
277 while ( ( parentNode = contentNode.getParent() ) )
\r
279 if ( parentNode.equals( commonParent ) )
\r
281 listContents.push( contentNode );
\r
284 contentNode = parentNode;
\r
288 if ( listContents.length < 1 )
\r
291 // Insert the list to the DOM tree.
\r
292 var insertAnchor = listContents[ listContents.length - 1 ].getNext(),
\r
293 listNode = doc.createElement( this.type ),
\r
296 listsCreated.push( listNode );
\r
297 while ( listContents.length )
\r
299 var contentBlock = listContents.shift(),
\r
300 listItem = doc.createElement( 'li' );
\r
302 // Preserve heading structure when converting to list item. (#5271)
\r
303 if ( headerTagRegex.test( contentBlock.getName() ) )
\r
304 contentBlock.appendTo( listItem );
\r
307 if ( contentBlock.hasAttribute( 'dir' ) )
\r
309 dir = dir || contentBlock.getAttribute( 'dir' );
\r
310 contentBlock.removeAttribute( 'dir' );
\r
312 contentBlock.copyAttributes( listItem );
\r
313 contentBlock.moveChildren( listItem );
\r
314 contentBlock.remove();
\r
317 listItem.appendTo( listNode );
\r
319 // Append a bogus BR to force the LI to render at full height
\r
320 if ( !CKEDITOR.env.ie )
\r
321 listItem.appendBogus();
\r
325 listNode.setAttribute( 'dir', dir );
\r
327 if ( insertAnchor )
\r
328 listNode.insertBefore( insertAnchor );
\r
330 listNode.appendTo( commonParent );
\r
333 function removeList( editor, groupObj, database )
\r
335 // This is very much like the change list type operation.
\r
336 // Except that we're changing the selected items' indent to -1 in the list array.
\r
337 var listArray = CKEDITOR.plugins.list.listToArray( groupObj.root, database ),
\r
338 selectedListItems = [];
\r
340 for ( var i = 0 ; i < groupObj.contents.length ; i++ )
\r
342 var itemNode = groupObj.contents[i];
\r
343 itemNode = itemNode.getAscendant( 'li', true );
\r
344 if ( !itemNode || itemNode.getCustomData( 'list_item_processed' ) )
\r
346 selectedListItems.push( itemNode );
\r
347 CKEDITOR.dom.element.setMarker( database, itemNode, 'list_item_processed', true );
\r
350 var lastListIndex = null;
\r
351 for ( i = 0 ; i < selectedListItems.length ; i++ )
\r
353 var listIndex = selectedListItems[i].getCustomData( 'listarray_index' );
\r
354 listArray[listIndex].indent = -1;
\r
355 lastListIndex = listIndex;
\r
358 // After cutting parts of the list out with indent=-1, we still have to maintain the array list
\r
359 // model's nextItem.indent <= currentItem.indent + 1 invariant. Otherwise the array model of the
\r
360 // list cannot be converted back to a real DOM list.
\r
361 for ( i = lastListIndex + 1 ; i < listArray.length ; i++ )
\r
363 if ( listArray[i].indent > listArray[i-1].indent + 1 )
\r
365 var indentOffset = listArray[i-1].indent + 1 - listArray[i].indent;
\r
366 var oldIndent = listArray[i].indent;
\r
367 while ( listArray[i] && listArray[i].indent >= oldIndent )
\r
369 listArray[i].indent += indentOffset;
\r
376 var newList = CKEDITOR.plugins.list.arrayToList( listArray, database, null, editor.config.enterMode,
\r
377 groupObj.root.getAttribute( 'dir' ) );
\r
379 // Compensate <br> before/after the list node if the surrounds are non-blocks.(#3836)
\r
380 var docFragment = newList.listNode, boundaryNode, siblingNode;
\r
381 function compensateBrs( isStart )
\r
383 if ( ( boundaryNode = docFragment[ isStart ? 'getFirst' : 'getLast' ]() )
\r
384 && !( boundaryNode.is && boundaryNode.isBlockBoundary() )
\r
385 && ( siblingNode = groupObj.root[ isStart ? 'getPrevious' : 'getNext' ]
\r
386 ( CKEDITOR.dom.walker.whitespaces( true ) ) )
\r
387 && !( siblingNode.is && siblingNode.isBlockBoundary( { br : 1 } ) ) )
\r
388 editor.document.createElement( 'br' )[ isStart ? 'insertBefore' : 'insertAfter' ]( boundaryNode );
\r
390 compensateBrs( true );
\r
393 docFragment.replace( groupObj.root );
\r
396 function listCommand( name, type )
\r
402 listCommand.prototype = {
\r
403 exec : function( editor )
\r
407 var doc = editor.document,
\r
408 selection = editor.getSelection(),
\r
409 ranges = selection && selection.getRanges( true );
\r
411 // There should be at least one selected range.
\r
412 if ( !ranges || ranges.length < 1 )
\r
415 // Midas lists rule #1 says we can create a list even in an empty document.
\r
416 // But DOM iterator wouldn't run if the document is really empty.
\r
417 // So create a paragraph if the document is empty and we're going to create a list.
\r
418 if ( this.state == CKEDITOR.TRISTATE_OFF )
\r
420 var body = doc.getBody();
\r
422 if ( !body.getFirst() )
\r
424 var paragraph = doc.createElement( editor.config.enterMode == CKEDITOR.ENTER_P ? 'p' :
\r
425 ( editor.config.enterMode == CKEDITOR.ENTER_DIV ? 'div' : 'br' ) );
\r
426 paragraph.appendTo( body );
\r
427 ranges = [ new CKEDITOR.dom.range( doc ) ];
\r
428 // IE exception on inserting anything when anchor inside <br>.
\r
429 if ( paragraph.is( 'br' ) )
\r
431 ranges[ 0 ].setStartBefore( paragraph );
\r
432 ranges[ 0 ].setEndAfter( paragraph );
\r
435 ranges[ 0 ].selectNodeContents( paragraph );
\r
436 selection.selectRanges( ranges );
\r
438 // Maybe a single range there enclosing the whole list,
\r
439 // turn on the list state manually(#4129).
\r
442 var range = ranges.length == 1 && ranges[ 0 ],
\r
443 enclosedNode = range && range.getEnclosedNode();
\r
444 if ( enclosedNode && enclosedNode.is
\r
445 && this.type == enclosedNode.getName() )
\r
447 setState.call( this, editor, CKEDITOR.TRISTATE_ON );
\r
452 var bookmarks = selection.createBookmarks( true );
\r
454 // Group the blocks up because there are many cases where multiple lists have to be created,
\r
455 // or multiple lists have to be cancelled.
\r
456 var listGroups = [],
\r
458 rangeIterator = ranges.createIterator(),
\r
461 while ( ( range = rangeIterator.getNextRange() ) && ++index )
\r
463 var boundaryNodes = range.getBoundaryNodes(),
\r
464 startNode = boundaryNodes.startNode,
\r
465 endNode = boundaryNodes.endNode;
\r
467 if ( startNode.type == CKEDITOR.NODE_ELEMENT && startNode.getName() == 'td' )
\r
468 range.setStartAt( boundaryNodes.startNode, CKEDITOR.POSITION_AFTER_START );
\r
470 if ( endNode.type == CKEDITOR.NODE_ELEMENT && endNode.getName() == 'td' )
\r
471 range.setEndAt( boundaryNodes.endNode, CKEDITOR.POSITION_BEFORE_END );
\r
473 var iterator = range.createIterator(),
\r
476 iterator.forceBrBreak = ( this.state == CKEDITOR.TRISTATE_OFF );
\r
478 while ( ( block = iterator.getNextParagraph() ) )
\r
480 // Avoid duplicate blocks get processed across ranges.
\r
481 if( block.getCustomData( 'list_block' ) )
\r
484 CKEDITOR.dom.element.setMarker( database, block, 'list_block', 1 );
\r
486 var path = new CKEDITOR.dom.elementPath( block ),
\r
487 pathElements = path.elements,
\r
488 pathElementsCount = pathElements.length,
\r
490 processedFlag = false,
\r
491 blockLimit = path.blockLimit,
\r
494 // First, try to group by a list ancestor.
\r
495 for ( var i = pathElementsCount - 1; i >= 0 && ( element = pathElements[ i ] ); i-- )
\r
497 if ( listNodeNames[ element.getName() ]
\r
498 && blockLimit.contains( element ) ) // Don't leak outside block limit (#3940).
\r
500 // If we've encountered a list inside a block limit
\r
501 // The last group object of the block limit element should
\r
502 // no longer be valid. Since paragraphs after the list
\r
503 // should belong to a different group of paragraphs before
\r
504 // the list. (Bug #1309)
\r
505 blockLimit.removeCustomData( 'list_group_object_' + index );
\r
507 var groupObj = element.getCustomData( 'list_group_object' );
\r
509 groupObj.contents.push( block );
\r
512 groupObj = { root : element, contents : [ block ] };
\r
513 listGroups.push( groupObj );
\r
514 CKEDITOR.dom.element.setMarker( database, element, 'list_group_object', groupObj );
\r
516 processedFlag = true;
\r
521 if ( processedFlag )
\r
524 // No list ancestor? Group by block limit, but don't mix contents from different ranges.
\r
525 var root = blockLimit;
\r
526 if ( root.getCustomData( 'list_group_object_' + index ) )
\r
527 root.getCustomData( 'list_group_object_' + index ).contents.push( block );
\r
530 groupObj = { root : root, contents : [ block ] };
\r
531 CKEDITOR.dom.element.setMarker( database, root, 'list_group_object_' + index, groupObj );
\r
532 listGroups.push( groupObj );
\r
537 // Now we have two kinds of list groups, groups rooted at a list, and groups rooted at a block limit element.
\r
538 // We either have to build lists or remove lists, for removing a list does not makes sense when we are looking
\r
539 // at the group that's not rooted at lists. So we have three cases to handle.
\r
540 var listsCreated = [];
\r
541 while ( listGroups.length > 0 )
\r
543 groupObj = listGroups.shift();
\r
544 if ( this.state == CKEDITOR.TRISTATE_OFF )
\r
546 if ( listNodeNames[ groupObj.root.getName() ] )
\r
547 changeListType.call( this, editor, groupObj, database, listsCreated );
\r
549 createList.call( this, editor, groupObj, listsCreated );
\r
551 else if ( this.state == CKEDITOR.TRISTATE_ON && listNodeNames[ groupObj.root.getName() ] )
\r
552 removeList.call( this, editor, groupObj, database );
\r
555 // For all new lists created, merge adjacent, same type lists.
\r
556 for ( i = 0 ; i < listsCreated.length ; i++ )
\r
558 listNode = listsCreated[i];
\r
559 var mergeSibling, listCommand = this;
\r
560 ( mergeSibling = function( rtl ){
\r
562 var sibling = listNode[ rtl ?
\r
563 'getPrevious' : 'getNext' ]( CKEDITOR.dom.walker.whitespaces( true ) );
\r
564 if ( sibling && sibling.getName &&
\r
565 sibling.getName() == listCommand.type )
\r
568 // Move children order by merge direction.(#3820)
\r
569 sibling.moveChildren( listNode, rtl ? true : false );
\r
572 mergeSibling( true );
\r
575 // Clean up, restore selection and update toolbar button states.
\r
576 CKEDITOR.dom.element.clearAllMarkers( database );
\r
577 selection.selectBookmarks( bookmarks );
\r
582 var dtd = CKEDITOR.dtd;
\r
583 var tailNbspRegex = /[\t\r\n ]*(?: |\xa0)$/;
\r
585 function indexOfFirstChildElement( element, tagNameList )
\r
588 children = element.children,
\r
589 length = children.length;
\r
591 for ( var i = 0 ; i < length ; i++ )
\r
593 child = children[ i ];
\r
594 if ( child.name && ( child.name in tagNameList ) )
\r
601 function getExtendNestedListFilter( isHtmlFilter )
\r
603 // An element filter function that corrects nested list start in an empty
\r
604 // list item for better displaying/outputting. (#3165)
\r
605 return function( listItem )
\r
607 var children = listItem.children,
\r
608 firstNestedListIndex = indexOfFirstChildElement( listItem, dtd.$list ),
\r
609 firstNestedList = children[ firstNestedListIndex ],
\r
610 nodeBefore = firstNestedList && firstNestedList.previous,
\r
614 && ( nodeBefore.name && nodeBefore.name == 'br'
\r
615 || nodeBefore.value && ( tailNbspmatch = nodeBefore.value.match( tailNbspRegex ) ) ) )
\r
617 var fillerNode = nodeBefore;
\r
619 // Always use 'nbsp' as filler node if we found a nested list appear
\r
620 // in front of a list item.
\r
621 if ( !( tailNbspmatch && tailNbspmatch.index ) && fillerNode == children[ 0 ] )
\r
622 children[ 0 ] = ( isHtmlFilter || CKEDITOR.env.ie ) ?
\r
623 new CKEDITOR.htmlParser.text( '\xa0' ) :
\r
624 new CKEDITOR.htmlParser.element( 'br', {} );
\r
626 // Otherwise the filler is not needed anymore.
\r
627 else if ( fillerNode.name == 'br' )
\r
628 children.splice( firstNestedListIndex - 1, 1 );
\r
630 fillerNode.value = fillerNode.value.replace( tailNbspRegex, '' );
\r
636 var defaultListDataFilterRules = { elements : {} };
\r
637 for ( var i in dtd.$listItem )
\r
638 defaultListDataFilterRules.elements[ i ] = getExtendNestedListFilter();
\r
640 var defaultListHtmlFilterRules = { elements : {} };
\r
641 for ( i in dtd.$listItem )
\r
642 defaultListHtmlFilterRules.elements[ i ] = getExtendNestedListFilter( true );
\r
644 CKEDITOR.plugins.add( 'list',
\r
646 init : function( editor )
\r
648 // Register commands.
\r
649 var numberedListCommand = new listCommand( 'numberedlist', 'ol' ),
\r
650 bulletedListCommand = new listCommand( 'bulletedlist', 'ul' );
\r
651 editor.addCommand( 'numberedlist', numberedListCommand );
\r
652 editor.addCommand( 'bulletedlist', bulletedListCommand );
\r
654 // Register the toolbar button.
\r
655 editor.ui.addButton( 'NumberedList',
\r
657 label : editor.lang.numberedlist,
\r
658 command : 'numberedlist'
\r
660 editor.ui.addButton( 'BulletedList',
\r
662 label : editor.lang.bulletedlist,
\r
663 command : 'bulletedlist'
\r
666 // Register the state changing handlers.
\r
667 editor.on( 'selectionChange', CKEDITOR.tools.bind( onSelectionChange, numberedListCommand ) );
\r
668 editor.on( 'selectionChange', CKEDITOR.tools.bind( onSelectionChange, bulletedListCommand ) );
\r
671 afterInit : function ( editor )
\r
673 var dataProcessor = editor.dataProcessor;
\r
674 if ( dataProcessor )
\r
676 dataProcessor.dataFilter.addRules( defaultListDataFilterRules );
\r
677 dataProcessor.htmlFilter.addRules( defaultListHtmlFilterRules );
\r
681 requires : [ 'domiterator' ]
\r