dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html@a63d609f5ebe (annotated)
dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html
Thu, 15 Jan 2015 15:55:04 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Thu, 15 Jan 2015 15:55:04 +0100
- branch
- TOR_BUG_9701
- changeset 9
- a63d609f5ebe
- permissions
- -rw-r--r--
Back out 97036ab72558 which inappropriately compared turds to third parties.
| michael@0 | 1 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN""http://www.w3.org/TR/html4/strict.dtd"> |
| michael@0 | 2 | <html> |
| michael@0 | 3 | <head> |
| michael@0 | 4 | <META http-equiv="Content-Type" content="text/html; charset=UTF-8"> |
| michael@0 | 5 | <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> |
| michael@0 | 6 | <title>http://www.w3.org/2001/DOM-Test-Suite/level1/core/nodeinsertbeforenewchildexists</title> |
| michael@0 | 7 | <link href="activity-home.css" rel="stylesheet" type="text/css"> |
| michael@0 | 8 | <link rel="stylesheet" type="text/css" href="/tests/SimpleTest/test.css"> |
| michael@0 | 9 | <script type="text/javascript" src="/tests/SimpleTest/SimpleTest.js"></script> |
| michael@0 | 10 | <script type="text/javascript" src="DOMTestCase.js"></script> |
| michael@0 | 11 | <script type="text/javascript" src="exclusions.js"></script> |
| michael@0 | 12 | <script type="text/javascript"> |
| michael@0 | 13 | // expose test function names |
| michael@0 | 14 | function exposeTestFunctionNames() |
| michael@0 | 15 | { |
| michael@0 | 16 | return ['nodeinsertbeforenewchildexists']; |
| michael@0 | 17 | } |
| michael@0 | 18 | |
| michael@0 | 19 | var docsLoaded = -1000000; |
| michael@0 | 20 | var builder = null; |
| michael@0 | 21 | |
| michael@0 | 22 | // |
| michael@0 | 23 | // This function is called by the testing framework before |
| michael@0 | 24 | // running the test suite. |
| michael@0 | 25 | // |
| michael@0 | 26 | // If there are no configuration exceptions, asynchronous |
| michael@0 | 27 | // document loading is started. Otherwise, the status |
| michael@0 | 28 | // is set to complete and the exception is immediately |
| michael@0 | 29 | // raised when entering the body of the test. |
| michael@0 | 30 | // |
| michael@0 | 31 | function setUpPage() { |
| michael@0 | 32 | setUpPageStatus = 'running'; |
| michael@0 | 33 | try { |
| michael@0 | 34 | // |
| michael@0 | 35 | // creates test document builder, may throw exception |
| michael@0 | 36 | // |
| michael@0 | 37 | builder = createConfiguredBuilder(); |
| michael@0 | 38 | |
| michael@0 | 39 | docsLoaded = 0; |
| michael@0 | 40 | |
| michael@0 | 41 | var docRef = null; |
| michael@0 | 42 | if (typeof(this.doc) != 'undefined') { |
| michael@0 | 43 | docRef = this.doc; |
| michael@0 | 44 | } |
| michael@0 | 45 | docsLoaded += preload(docRef, "doc", "staff"); |
| michael@0 | 46 | |
| michael@0 | 47 | if (docsLoaded == 1) { |
| michael@0 | 48 | setUpPage = 'complete'; |
| michael@0 | 49 | } |
| michael@0 | 50 | } catch(ex) { |
| michael@0 | 51 | catchInitializationError(builder, ex); |
| michael@0 | 52 | setUpPage = 'complete'; |
| michael@0 | 53 | } |
| michael@0 | 54 | } |
| michael@0 | 55 | |
| michael@0 | 56 | // |
| michael@0 | 57 | // This method is called on the completion of |
| michael@0 | 58 | // each asychronous load started in setUpTests. |
| michael@0 | 59 | // |
| michael@0 | 60 | // When every synchronous loaded document has completed, |
| michael@0 | 61 | // the page status is changed which allows the |
| michael@0 | 62 | // body of the test to be executed. |
| michael@0 | 63 | function loadComplete() { |
| michael@0 | 64 | if (++docsLoaded == 1) { |
| michael@0 | 65 | setUpPageStatus = 'complete'; |
| michael@0 | 66 | runJSUnitTests(); |
| michael@0 | 67 | markTodos(); |
| michael@0 | 68 | SimpleTest.finish(); |
| michael@0 | 69 | } |
| michael@0 | 70 | } |
| michael@0 | 71 | |
| michael@0 | 72 | var docName = 'nodeinsertbeforenewchildexists'; |
| michael@0 | 73 | |
| michael@0 | 74 | |
| michael@0 | 75 | |
| michael@0 | 76 | window.doc = window; |
| michael@0 | 77 | SimpleTest.waitForExplicitFinish(); |
| michael@0 | 78 | addLoadEvent(setUpPage); |
| michael@0 | 79 | |
| michael@0 | 80 | |
| michael@0 | 81 | /** |
| michael@0 | 82 | * |
| michael@0 | 83 | If the "newChild" is already in the tree, the |
| michael@0 | 84 | "insertBefore(newChild,refChild)" method must first |
| michael@0 | 85 | remove it before the insertion takes place. |
| michael@0 | 86 | |
| michael@0 | 87 | Insert a node Element ("employeeId") that is already |
| michael@0 | 88 | present in the tree. The existing node should be |
| michael@0 | 89 | removed first and the new one inserted. The node is |
| michael@0 | 90 | inserted at a different position in the tree to assure |
| michael@0 | 91 | that it was indeed inserted. |
| michael@0 | 92 | |
| michael@0 | 93 | * @author NIST |
| michael@0 | 94 | * @author Mary Brady |
| michael@0 | 95 | * @see http://www.w3.org/TR/1998/REC-DOM-Level-1-19981001/level-one-core#ID-952280727 |
| michael@0 | 96 | */ |
| michael@0 | 97 | function nodeinsertbeforenewchildexists() { |
| michael@0 | 98 | var success; |
| michael@0 | 99 | if(checkInitialization(builder, "nodeinsertbeforenewchildexists") != null) return; |
| michael@0 | 100 | var doc; |
| michael@0 | 101 | var elementList; |
| michael@0 | 102 | var employeeNode; |
| michael@0 | 103 | var childList; |
| michael@0 | 104 | var refChild; |
| michael@0 | 105 | var newChild; |
| michael@0 | 106 | var child; |
| michael@0 | 107 | var length; |
| michael@0 | 108 | var childName; |
| michael@0 | 109 | var insertedNode; |
| michael@0 | 110 | expectedWhitespace = new Array(); |
| michael@0 | 111 | expectedWhitespace[0] = "#text"; |
| michael@0 | 112 | expectedWhitespace[1] = "#text"; |
| michael@0 | 113 | expectedWhitespace[2] = "name"; |
| michael@0 | 114 | expectedWhitespace[3] = "#text"; |
| michael@0 | 115 | expectedWhitespace[4] = "position"; |
| michael@0 | 116 | expectedWhitespace[5] = "#text"; |
| michael@0 | 117 | expectedWhitespace[6] = "salary"; |
| michael@0 | 118 | expectedWhitespace[7] = "#text"; |
| michael@0 | 119 | expectedWhitespace[8] = "gender"; |
| michael@0 | 120 | expectedWhitespace[9] = "#text"; |
| michael@0 | 121 | expectedWhitespace[10] = "employeeId"; |
| michael@0 | 122 | expectedWhitespace[11] = "address"; |
| michael@0 | 123 | expectedWhitespace[12] = "#text"; |
| michael@0 | 124 | |
| michael@0 | 125 | expectedNoWhitespace = new Array(); |
| michael@0 | 126 | expectedNoWhitespace[0] = "name"; |
| michael@0 | 127 | expectedNoWhitespace[1] = "position"; |
| michael@0 | 128 | expectedNoWhitespace[2] = "salary"; |
| michael@0 | 129 | expectedNoWhitespace[3] = "gender"; |
| michael@0 | 130 | expectedNoWhitespace[4] = "employeeId"; |
| michael@0 | 131 | expectedNoWhitespace[5] = "address"; |
| michael@0 | 132 | |
| michael@0 | 133 | var expected = new Array(); |
| michael@0 | 134 | |
| michael@0 | 135 | var result = new Array(); |
| michael@0 | 136 | |
| michael@0 | 137 | |
| michael@0 | 138 | var docRef = null; |
| michael@0 | 139 | if (typeof(this.doc) != 'undefined') { |
| michael@0 | 140 | docRef = this.doc; |
| michael@0 | 141 | } |
| michael@0 | 142 | doc = load(docRef, "doc", "staff"); |
| michael@0 | 143 | elementList = doc.getElementsByTagName("employee"); |
| michael@0 | 144 | employeeNode = elementList.item(1); |
| michael@0 | 145 | childList = employeeNode.childNodes; |
| michael@0 | 146 | |
| michael@0 | 147 | length = childList.length; |
| michael@0 | 148 | |
| michael@0 | 149 | |
| michael@0 | 150 | if( |
| michael@0 | 151 | (6 == length) |
| michael@0 | 152 | ) { |
| michael@0 | 153 | expected = expectedNoWhitespace; |
| michael@0 | 154 | refChild = childList.item(5); |
| michael@0 | 155 | newChild = childList.item(0); |
| michael@0 | 156 | |
| michael@0 | 157 | } |
| michael@0 | 158 | |
| michael@0 | 159 | else { |
| michael@0 | 160 | expected = expectedWhitespace; |
| michael@0 | 161 | refChild = childList.item(11); |
| michael@0 | 162 | newChild = childList.item(1); |
| michael@0 | 163 | |
| michael@0 | 164 | } |
| michael@0 | 165 | insertedNode = employeeNode.insertBefore(newChild,refChild); |
| michael@0 | 166 | for(var indexN65757 = 0;indexN65757 < childList.length; indexN65757++) { |
| michael@0 | 167 | child = childList.item(indexN65757); |
| michael@0 | 168 | childName = child.nodeName; |
| michael@0 | 169 | |
| michael@0 | 170 | result[result.length] = childName; |
| michael@0 | 171 | |
| michael@0 | 172 | } |
| michael@0 | 173 | assertEqualsList("childNames",expected,result); |
| michael@0 | 174 | |
| michael@0 | 175 | } |
| michael@0 | 176 | |
| michael@0 | 177 | </script> |
| michael@0 | 178 | </head> |
| michael@0 | 179 | <body> |
| michael@0 | 180 | <h2>Test http://www.w3.org/2001/DOM-Test-Suite/level1/core/nodeinsertbeforenewchildexists</h2> |
| michael@0 | 181 | <p></p> |
| michael@0 | 182 | <p> |
| michael@0 | 183 | Copyright (c) 2001-2004 World Wide Web Consortium, |
| michael@0 | 184 | (Massachusetts Institute of Technology, European Research Consortium |
| michael@0 | 185 | for Informatics and Mathematics, Keio University). All |
| michael@0 | 186 | Rights Reserved. This work is distributed under the <a href="http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231">W3C(r) Software License</a> in the |
| michael@0 | 187 | hope that it will be useful, but WITHOUT ANY WARRANTY; without even |
| michael@0 | 188 | the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. |
| michael@0 | 189 | </p> |
| michael@0 | 190 | </body> |
| michael@0 | 191 | </html> |
