1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/content/base/test/test_NodeIterator_mutations_3.html Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,160 @@
1.4 +<!DOCTYPE HTML>
1.5 +<html>
1.6 +<head>
1.7 + <title>DOM Traversal: NodeIterator: Mutations (3/x)</title>
1.8 + <script type="text/javascript" src="/tests/SimpleTest/SimpleTest.js"></script>
1.9 + <link rel="stylesheet" type="text/css" href="/tests/SimpleTest/test.css">
1.10 +</head>
1.11 +<p id="display"></p>
1.12 +<div id="content" style="display: none">
1.13 + <span id=root><span id=B></span><span id=C></span><span id=D></span><span id=E><span id=E1><span id=E11></span></span></span></span>
1.14 +</div>
1.15 +<pre id="test">
1.16 +<script class="testbody" type="text/javascript">
1.17 + function removeNode(n) {
1.18 + n.parentNode.removeChild(n);
1.19 + }
1.20 + var initInner = $('content').innerHTML;
1.21 + var content = $('content');
1.22 +
1.23 +
1.24 + function resetContent() {
1.25 + content.innerHTML = initInner;
1.26 + var checkIt = document.createNodeIterator(content, NodeFilter.SHOW_ELEMENT,
1.27 + testNodeFilter);
1.28 + var node;
1.29 + while ((node = checkIt.nextNode()) != null) {
1.30 + if (node.id) {
1.31 + window[node.id] = node;
1.32 + }
1.33 + }
1.34 + }
1.35 +
1.36 + function makeSpan(id) {
1.37 + var e = document.createElement('span');
1.38 + e.id = id;
1.39 + return e;
1.40 + }
1.41 +
1.42 + function testNodeFilter(n) {
1.43 + if (n.tagName == 'SPAN')
1.44 + return NodeFilter.FILTER_ACCEPT;
1.45 + return NodeFilter.FILTER_SKIP;
1.46 + }
1.47 +
1.48 + function checkseq(it, root, expect) {
1.49 + var checkIt = document.createNodeIterator(root, NodeFilter.SHOW_ELEMENT,
1.50 + testNodeFilter);
1.51 + var printedPointer = (it.referenceNode == undefined);
1.52 + var string = '';
1.53 + var node;
1.54 + while ((node = checkIt.nextNode()) != null) {
1.55 + if (!printedPointer && it.referenceNode == node) {
1.56 + printedPointer = true;
1.57 + var s = '[' + node.id + '] ';
1.58 + if (it.pointerBeforeReferenceNode)
1.59 + string += "* " + s;
1.60 + else
1.61 + string += s + "* ";
1.62 + } else {
1.63 + string += node.id + " ";
1.64 + }
1.65 + }
1.66 + is(string.slice(0, -1), expect, "sequence check");
1.67 + }
1.68 +
1.69 + resetContent();
1.70 + var it = document.createNodeIterator(E, NodeFilter.SHOW_ELEMENT,
1.71 + testNodeFilter);
1.72 + checkseq(it, root, "root B C D * [E] E1 E11");
1.73 +
1.74 + removeNode(C);
1.75 + checkseq(it, root, "root B D * [E] E1 E11");
1.76 +
1.77 + it.nextNode();
1.78 + removeNode(D);
1.79 + checkseq(it, root, "root B [E] * E1 E11");
1.80 +
1.81 + it.nextNode();
1.82 + removeNode(B);
1.83 + checkseq(it, root, "root E [E1] * E11");
1.84 +
1.85 + it.nextNode();
1.86 + checkseq(it, root, "root E E1 [E11] *");
1.87 +
1.88 + it.nextNode();
1.89 + checkseq(it, root, "root E E1 [E11] *");
1.90 +
1.91 + it.previousNode();
1.92 + it.previousNode();
1.93 + it.previousNode();
1.94 + it.previousNode();
1.95 + it.previousNode();
1.96 + checkseq(it, root, "root * [E] E1 E11");
1.97 +
1.98 + resetContent();
1.99 + it = document.createNodeIterator(E, NodeFilter.SHOW_ELEMENT,
1.100 + testNodeFilter);
1.101 + checkseq(it, root, "root B C D * [E] E1 E11");
1.102 +
1.103 + it.nextNode();
1.104 + it.nextNode();
1.105 + checkseq(it, root, "root B C D E [E1] * E11");
1.106 +
1.107 + it.previousNode();
1.108 + it.previousNode();
1.109 + checkseq(it, root, "root B C D * [E] E1 E11");
1.110 +
1.111 + removeNode(D);
1.112 + removeNode(B);
1.113 + checkseq(it, root, "root C * [E] E1 E11");
1.114 +
1.115 + n = makeSpan('n');
1.116 + root.insertBefore(n, E);
1.117 + checkseq(it, root, "root C n * [E] E1 E11");
1.118 +
1.119 + n2 = makeSpan('n2');
1.120 + root.insertBefore(n2, C);
1.121 + checkseq(it, root, "root n2 C n * [E] E1 E11");
1.122 +
1.123 + resetContent();
1.124 + it = document.createNodeIterator(E, NodeFilter.SHOW_ELEMENT,
1.125 + testNodeFilter);
1.126 + checkseq(it, root, "root B C D * [E] E1 E11");
1.127 +
1.128 + removeNode(root);
1.129 + checkseq(it, root, "root B C D * [E] E1 E11");
1.130 +
1.131 + removeNode(B);
1.132 + checkseq(it, root, "root C D * [E] E1 E11");
1.133 +
1.134 + removeNode(D);
1.135 + checkseq(it, root, "root C * [E] E1 E11");
1.136 +
1.137 + it.nextNode();
1.138 + it.nextNode();
1.139 + it.nextNode();
1.140 + checkseq(it, root, "root C E E1 [E11] *");
1.141 +
1.142 + removeNode(E1);
1.143 + checkseq(it, root, "root C [E] *");
1.144 +
1.145 + n = makeSpan('n');
1.146 + root.insertBefore(n, E);
1.147 + checkseq(it, root, "root C n [E] *");
1.148 +
1.149 + n2 = makeSpan('n2');
1.150 + E.appendChild(n2);
1.151 + checkseq(it, root, "root C n [E] * n2");
1.152 +
1.153 + it.nextNode();
1.154 + checkseq(it, root, "root C n E [n2] *");
1.155 +
1.156 + removeNode(E);
1.157 + checkseq(it, root, "root C n");
1.158 +
1.159 +
1.160 +</script>
1.161 +</pre>
1.162 +</body>
1.163 +</html>
