diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 19:33:14 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 19:33:14 +0000 |
commit | 36d22d82aa202bb199967e9512281e9a53db42c9 (patch) | |
tree | 105e8c98ddea1c1e4784a60a5a6410fa416be2de /dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html | |
parent | Initial commit. (diff) | |
download | firefox-esr-36d22d82aa202bb199967e9512281e9a53db42c9.tar.xz firefox-esr-36d22d82aa202bb199967e9512281e9a53db42c9.zip |
Adding upstream version 115.7.0esr.upstream/115.7.0esrupstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
-rw-r--r-- | dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html | 191 |
1 files changed, 191 insertions, 0 deletions
diff --git a/dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html b/dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html new file mode 100644 index 0000000000..c60cd8a9d7 --- /dev/null +++ b/dom/tests/mochitest/dom-level1-core/test_nodeinsertbeforenewchildexists.html @@ -0,0 +1,191 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN""http://www.w3.org/TR/html4/strict.dtd"> +<html> +<head> +<META http-equiv="Content-Type" content="text/html; charset=UTF-8"> +<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> +<title>http://www.w3.org/2001/DOM-Test-Suite/level1/core/nodeinsertbeforenewchildexists</title> +<link href="activity-home.css" rel="stylesheet" type="text/css"> +<link rel="stylesheet" type="text/css" href="/tests/SimpleTest/test.css"> +<script src="/tests/SimpleTest/SimpleTest.js"></script> +<script type="text/javascript" src="DOMTestCase.js"></script> +<script type="text/javascript" src="exclusions.js"></script> +<script type="text/javascript"> +// expose test function names +function exposeTestFunctionNames() +{ +return ['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", "staff"); + + if (docsLoaded == 1) { + setUpPage = 'complete'; + } + } catch(ex) { + catchInitializationError(builder, ex); + setUpPage = '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'; + runJSUnitTests(); + markTodos(); + SimpleTest.finish(); + } +} + +var docName = 'nodeinsertbeforenewchildexists'; + + + +window.doc = window; +SimpleTest.waitForExplicitFinish(); +addLoadEvent(setUpPage); + + +/** +* + 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 ("employeeId") 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 NIST +* @author Mary Brady +* @see http://www.w3.org/TR/1998/REC-DOM-Level-1-19981001/level-one-core#ID-952280727 +*/ +function nodeinsertbeforenewchildexists() { + var success; + if(checkInitialization(builder, "nodeinsertbeforenewchildexists") != null) return; + var doc; + var elementList; + var employeeNode; + var childList; + var refChild; + var newChild; + var child; + var length; + var childName; + var insertedNode; + expectedWhitespace = new Array(); + expectedWhitespace[0] = "#text"; + expectedWhitespace[1] = "#text"; + expectedWhitespace[2] = "name"; + expectedWhitespace[3] = "#text"; + expectedWhitespace[4] = "position"; + expectedWhitespace[5] = "#text"; + expectedWhitespace[6] = "salary"; + expectedWhitespace[7] = "#text"; + expectedWhitespace[8] = "gender"; + expectedWhitespace[9] = "#text"; + expectedWhitespace[10] = "employeeId"; + expectedWhitespace[11] = "address"; + expectedWhitespace[12] = "#text"; + + expectedNoWhitespace = new Array(); + expectedNoWhitespace[0] = "name"; + expectedNoWhitespace[1] = "position"; + expectedNoWhitespace[2] = "salary"; + expectedNoWhitespace[3] = "gender"; + expectedNoWhitespace[4] = "employeeId"; + expectedNoWhitespace[5] = "address"; + + var expected = new Array(); + + var result = new Array(); + + + var docRef = null; + if (typeof(this.doc) != 'undefined') { + docRef = this.doc; + } + doc = load(docRef, "doc", "staff"); + elementList = doc.getElementsByTagName("employee"); + employeeNode = elementList.item(1); + childList = employeeNode.childNodes; + + length = childList.length; + + + if( + (6 == length) + ) { + expected = expectedNoWhitespace; +refChild = childList.item(5); + newChild = childList.item(0); + + } + + else { + expected = expectedWhitespace; +refChild = childList.item(11); + newChild = childList.item(1); + + } + insertedNode = employeeNode.insertBefore(newChild,refChild); + for(var indexN65757 = 0;indexN65757 < childList.length; indexN65757++) { + child = childList.item(indexN65757); + childName = child.nodeName; + + result[result.length] = childName; + + } + assertEqualsList("childNames",expected,result); + +} + +</script> +</head> +<body> +<h2>Test http://www.w3.org/2001/DOM-Test-Suite/level1/core/nodeinsertbeforenewchildexists</h2> +<p></p> +<p> +Copyright (c) 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 <a href="http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231">W3C(r) Software License</a> 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. +</p> +</body> +</html> |