/* Copyright © 2001-2004 World Wide Web Consortium, (Massachusetts Institute of Technology, European Research Consortium for Informatics and Mathematics, Keio University). All Rights Reserved. This work is distributed under the W3C® Software License [1] 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. [1] http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231 */ /** * Gets URI that identifies the test. * @return uri identifier of test */ function getTargetURI() { return "http://www.w3.org/2001/DOM-Test-Suite/level1/core/hc_nodeinsertbeforenewchildexists"; } var docsLoaded = -1000000; var builder = null; // // This function is called by the testing framework before // running the test suite. // // If there are no configuration exceptions, asynchronous // document loading is started. Otherwise, the status // is set to complete and the exception is immediately // raised when entering the body of the test. // function setUpPage() { setUpPageStatus = 'running'; try { // // creates test document builder, may throw exception // builder = createConfiguredBuilder(); docsLoaded = 0; var docRef = null; if (typeof(this.doc) != 'undefined') { docRef = this.doc; } docsLoaded += preload(docRef, "doc", "hc_staff"); if (docsLoaded == 1) { setUpPageStatus = 'complete'; } } catch(ex) { catchInitializationError(builder, ex); setUpPageStatus = 'complete'; } } // // This method is called on the completion of // each asychronous load started in setUpTests. // // When every synchronous loaded document has completed, // the page status is changed which allows the // body of the test to be executed. function loadComplete() { if (++docsLoaded == 1) { setUpPageStatus = 'complete'; } } /** * If the "newChild" is already in the tree, the "insertBefore(newChild,refChild)" method must first remove it before the insertion takes place. Insert a node Element ("em") that is already present in the tree. The existing node should be removed first and the new one inserted. The node is inserted at a different position in the tree to assure that it was indeed inserted. * @author Curt Arnold * @see http://www.w3.org/TR/1998/REC-DOM-Level-1-19981001/level-one-core#ID-952280727 * @see http://www.w3.org/Bugs/Public/show_bug.cgi?id=246 */ function hc_nodeinsertbeforenewchildexists() { var success; if(checkInitialization(builder, "hc_nodeinsertbeforenewchildexists") != null) return; var doc; var elementList; var employeeNode; var childList; var refChild; var newChild; var child; var childName; var insertedNode; expected = new Array(); expected[0] = "strong"; expected[1] = "code"; expected[2] = "sup"; expected[3] = "var"; expected[4] = "em"; expected[5] = "acronym"; var result = new Array(); var nodeType; var docRef = null; if (typeof(this.doc) != 'undefined') { docRef = this.doc; } doc = load(docRef, "doc", "hc_staff"); elementList = doc.getElementsByTagName("p"); employeeNode = elementList.item(1); childList = employeeNode.getElementsByTagName("*"); refChild = childList.item(5); newChild = childList.item(0); insertedNode = employeeNode.insertBefore(newChild,refChild); for(var indexN1008C = 0;indexN1008C < childList.length; indexN1008C++) { child = childList.item(indexN1008C); nodeType = child.nodeType; if( (1 == nodeType) ) { childName = child.nodeName; result[result.length] = childName; } } assertEqualsListAutoCase("element", "childNames",expected,result); } function runTest() { hc_nodeinsertbeforenewchildexists(); }