1 2 /* 3 Copyright 2001-2004 World Wide Web Consortium, 4 (Massachusetts Institute of Technology, European Research Consortium 5 for Informatics and Mathematics, Keio University). All 6 Rights Reserved. This work is distributed under the W3C Software License [1] in the 7 hope that it will be useful, but WITHOUT ANY WARRANTY; without even 8 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. 9 10 [1] http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231 11 */ 12 13 14 15 /** 16 * Gets URI that identifies the test. 17 * @return uri identifier of test 18 */ 19 function getTargetURI() { 20 return "http://www.w3.org/2001/DOM-Test-Suite/level1/core/hc_nodeinsertbeforenewchildexists"; 21 } 22 23 var docsLoaded = -1000000; 24 var builder = null; 25 26 // 27 // This function is called by the testing framework before 28 // running the test suite. 29 // 30 // If there are no configuration exceptions, asynchronous 31 // document loading is started. Otherwise, the status 32 // is set to complete and the exception is immediately 33 // raised when entering the body of the test. 34 // 35 function setUpPage() { 36 setUpPageStatus = 'running'; 37 try { 38 // 39 // creates test document builder, may throw exception 40 // 41 builder = createConfiguredBuilder(); 42 43 docsLoaded = 0; 44 45 var docRef = null; 46 if (typeof(this.doc) != 'undefined') { 47 docRef = this.doc; 48 } 49 docsLoaded += preload(docRef, "doc", "hc_staff"); 50 51 if (docsLoaded == 1) { 52 setUpPageStatus = 'complete'; 53 } 54 } catch(ex) { 55 catchInitializationError(builder, ex); 56 setUpPageStatus = 'complete'; 57 } 58 } 59 60 61 62 // 63 // This method is called on the completion of 64 // each asychronous load started in setUpTests. 65 // 66 // When every synchronous loaded document has completed, 67 // the page status is changed which allows the 68 // body of the test to be executed. 69 function loadComplete() { 70 if (++docsLoaded == 1) { 71 setUpPageStatus = 'complete'; 72 } 73 } 74 75 76 /** 77 * 78 If the "newChild" is already in the tree, the 79 "insertBefore(newChild,refChild)" method must first 80 remove it before the insertion takes place. 81 82 Insert a node Element ("em") that is already 83 present in the tree. The existing node should be 84 removed first and the new one inserted. The node is 85 inserted at a different position in the tree to assure 86 that it was indeed inserted. 87 88 * @author Curt Arnold 89 * @see http://www.w3.org/TR/1998/REC-DOM-Level-1-19981001/level-one-core#ID-952280727 90 * @see http://www.w3.org/Bugs/Public/show_bug.cgi?id=246 91 */ 92 function hc_nodeinsertbeforenewchildexists() { 93 var success; 94 if(checkInitialization(builder, "hc_nodeinsertbeforenewchildexists") != null) return; 95 var doc; 96 var elementList; 97 var employeeNode; 98 var childList; 99 var refChild; 100 var newChild; 101 var child; 102 var childName; 103 var insertedNode; 104 expected = new Array(); 105 expected[0] = "strong"; 106 expected[1] = "code"; 107 expected[2] = "sup"; 108 expected[3] = "var"; 109 expected[4] = "em"; 110 expected[5] = "acronym"; 111 112 var result = new Array(); 113 114 var nodeType; 115 116 var docRef = null; 117 if (typeof(this.doc) != 'undefined') { 118 docRef = this.doc; 119 } 120 doc = load(docRef, "doc", "hc_staff"); 121 elementList = doc.getElementsByTagName("p"); 122 employeeNode = elementList.item(1); 123 childList = employeeNode.getElementsByTagName("*"); 124 refChild = childList.item(5); 125 newChild = childList.item(0); 126 insertedNode = employeeNode.insertBefore(newChild,refChild); 127 for(var indexN1008C = 0;indexN1008C < childList.length; indexN1008C++) { 128 child = childList.item(indexN1008C); 129 nodeType = child.nodeType; 130 131 132 if( 133 (1 == nodeType) 134 ) { 135 childName = child.nodeName; 136 137 result[result.length] = childName; 138 139 } 140 141 } 142 assertEqualsListAutoCase("element", "childNames",expected,result); 143 144 } 145 146 147 148 149 function runTest() { 150 hc_nodeinsertbeforenewchildexists(); 151 } 152