Test http://www.w3.org/2001/DOM-Test-Suite/level1/core/characterdatareplacedataexceedslengthofdata

<test name='characterdatareplacedataexceedslengthofdata' schemaLocation='http://www.w3.org/2001/DOM-Test-Suite/Level-1 dom1.xsd'>
     <metadata>
          <title>characterdataReplaceDataExceedsLengthOfData</title>
          <creator>NIST</creator>
          <description> If the sum of the offset and count exceeds the length then all the characters to the end of the data are replaced. Retrieve the character data from the last child of the first employee. The "replaceData(offset,count,arg)" method is then called with offset=0 and count=50 and arg="2600". The method should replace all the characters with "2600". This is because the sum of the offset and count exceeds the length of the character data. </description>
          <contributor>Mary Brady</contributor>
          <date qualifier='created'>2001-08-17</date>
          <subject resource='http://www.w3.org/TR/1998/REC-DOM-Level-1-19981001/level-one-core#ID-72AB8359'/>
          <subject resource='http://www.w3.org/TR/1998/REC-DOM-Level-1-19981001/level-one-core#ID-E5CBA7FB'/>
</metadata>
     <var name='doc' type='Document'/>
     <var name='elementList' type='NodeList'/>
     <var name='nameNode' type='Node'/>
     <var name='child' type='CharacterData'/>
     <var name='childData' type='DOMString'/>
     <load var='doc' href='staff' willBeModified='true'/>
     <getElementsByTagName interface='Document' obj='doc' tagname='"address"' var='elementList'/>
     <item interface='NodeList' obj='elementList' index='0' var='nameNode'/>
     <firstChild interface='Node' obj='nameNode' var='child'/>
     <replaceData obj='child' offset='0' count='50' arg='"2600"'/>
     <data interface='CharacterData' obj='child' var='childData'/>
     <assertEquals actual='childData' expected='"2600"' id='characterdataReplaceDataExceedsLengthOfDataAssert' ignoreCase='false'/>
</test>

Copyright (c) 2001-2004 World Wide Web Consortium, (Massachusetts Institute of Technology, Institut National de Recherche en Informatique et en Automatique, Keio University). All Rights Reserved. This program is distributed under the W3C's Software Intellectual Property License. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

See W3C License http://www.w3.org/Consortium/Legal/ for more details.