| <HTML><HEAD><META CONTENT="text/html; charset=UTF-8" HTTP-EQUIV="Content-Type"/><TITLE>EMMA Coverage Report</TITLE><STYLE TYPE="text/css"> TABLE,TD,TH {border-style:solid; border-color:black;} TD,TH {background:white;margin:0;line-height:100%;padding-left:0.5em;padding-right:0.5em;} TD {border-width:0 1px 0 0;} TH {border-width:1px 1px 1px 0;} TR TD.h {color:red;} TABLE {border-spacing:0; border-collapse:collapse;border-width:0 0 1px 1px;} P,H1,H2,H3,TH {font-family:verdana,arial,sans-serif;font-size:10pt;} TD {font-family:courier,monospace;font-size:10pt;} TABLE.hdft {border-spacing:0;border-collapse:collapse;border-style:none;} TABLE.hdft TH,TABLE.hdft TD {border-style:none;line-height:normal;} TABLE.hdft TH.tl,TABLE.hdft TD.tl {background:#6699CC;color:white;} TABLE.hdft TD.nv {background:#6633DD;color:white;} .nv A:link {color:white;} .nv A:visited {color:white;} .nv A:active {color:yellow;} TABLE.hdft A:link {color:white;} TABLE.hdft A:visited {color:white;} TABLE.hdft A:active {color:yellow;} .in {color:#356085;} TABLE.s TD {padding-left:0.25em;padding-right:0.25em;} TABLE.s TD.l {padding-left:0.25em;padding-right:0.25em;text-align:right;background:#F0F0F0;} TABLE.s TR.z TD {background:#FF9999;} TABLE.s TR.p TD {background:#FFFF88;} TABLE.s TR.c TD {background:#CCFFCC;} A:link {color:#0000EE;text-decoration:none;} A:visited {color:#0000EE;text-decoration:none;} A:hover {color:#0000EE;text-decoration:underline;} TABLE.cn {border-width:0 0 1px 0;} TABLE.s {border-width:1px 0 1px 1px;} TD.h {color:red;border-width:0 1px 0 0;} TD.f {border-width:0 1px 0 1px;} TD.hf {color:red;border-width:0 1px 0 1px;} TH.f {border-width:1px 1px 1px 1px;} TR.cis TD {background:#F0F0F0;} TR.cis TD {border-width:1px 1px 1px 0;} TR.cis TD.h {color:red;border-width:1px 1px 1px 0;} TR.cis TD.f {border-width:1px 1px 1px 1px;} TR.cis TD.hf {color:red;border-width:1px 1px 1px 1px;} TD.b {border-style:none;background:transparent;line-height:50%;} TD.bt {border-width:1px 0 0 0;background:transparent;line-height:50%;} TR.o TD {background:#F0F0F0;}TABLE.it {border-style:none;}TABLE.it TD,TABLE.it TH {border-style:none;}</STYLE></HEAD><BODY><TABLE CLASS="hdft" CELLSPACING="0" WIDTH="100%"><TR><TH CLASS="tl"><A HREF="http://www.eclemma.org/">EMMA</A> Coverage Report (generated Fri Feb 20 18:44:54 GMT 2009)</TH></TR><TR><TD CLASS="nv">[<A HREF="../xslUnitTestCoverage.html">all classes</A>][<A HREF="85.html">org.eclipse.wst.xml.core.internal.document</A>]</TD></TR></TABLE><H2>COVERAGE SUMMARY FOR SOURCE FILE [<SPAN CLASS="in">NodeIteratorImpl.java</SPAN>]</H2><TABLE CELLSPACING="0" WIDTH="100%"><TR><TH>name</TH><TH>class, %</TH><TH>method, %</TH><TH>block, %</TH><TH>line, %</TH></TR><TR><TD>NodeIteratorImpl.java</TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/11)</TD><TD CLASS="h">0% (0/267)</TD><TD CLASS="h">0% (0/88)</TD></TR></TABLE><H3>COVERAGE BREAKDOWN BY CLASS AND METHOD</H3><TABLE CLASS="cn" CELLSPACING="0" WIDTH="100%"><TR><TH CLASS="f">name</TH><TH>class, %</TH><TH>method, %</TH><TH>block, %</TH><TH>line, %</TH></TR><TR><TD CLASS="b"> </TD><TD CLASS="b"> </TD><TD CLASS="b"> </TD><TD CLASS="b"> </TD><TD CLASS="b"> </TD></TR><TR CLASS="cis"><TD CLASS="f">class <A HREF="#0">NodeIteratorImpl</A></TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/11)</TD><TD CLASS="h">0% (0/267)</TD><TD CLASS="h">0% (0/88)</TD></TR><TR><TD CLASS="f"><A HREF="#0">NodeIteratorImpl (Node, int, NodeFilter): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/27)</TD><TD CLASS="h">0% (0/10)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2">acceptNode (Node): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/91)</TD><TD CLASS="h">0% (0/33)</TD></TR><TR><TD CLASS="f"><A HREF="#3">detach (): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/10)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#4">getExpandEntityReferences (): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/2)</TD><TD CLASS="h">0% (0/1)</TD></TR><TR><TD CLASS="f"><A HREF="#5">getFilter (): NodeFilter</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/3)</TD><TD CLASS="h">0% (0/1)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#6">getNextNode (): Node</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/47)</TD><TD CLASS="h">0% (0/14)</TD></TR><TR><TD CLASS="f"><A HREF="#7">getPreviousNode (): Node</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/47)</TD><TD CLASS="h">0% (0/15)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#8">getRoot (): Node</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/3)</TD><TD CLASS="h">0% (0/1)</TD></TR><TR><TD CLASS="f"><A HREF="#9">getWhatToShow (): int</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/3)</TD><TD CLASS="h">0% (0/1)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#a">nextNode (): Node</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/17)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR><TD CLASS="f"><A HREF="#b">previousNode (): Node</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/17)</TD><TD CLASS="h">0% (0/4)</TD></TR></TABLE><P></P><TABLE CLASS="s" CELLSPACING="0" WIDTH="100%"><TR><TD CLASS="l">1</TD><TD>/*******************************************************************************</TD></TR><TR><TD CLASS="l">2</TD><TD> * Copyright (c) 2001, 2004 IBM Corporation and others.</TD></TR><TR><TD CLASS="l">3</TD><TD> * All rights reserved. This program and the accompanying materials</TD></TR><TR><TD CLASS="l">4</TD><TD> * are made available under the terms of the Eclipse Public License v1.0</TD></TR><TR><TD CLASS="l">5</TD><TD> * which accompanies this distribution, and is available at</TD></TR><TR><TD CLASS="l">6</TD><TD> * http://www.eclipse.org/legal/epl-v10.html</TD></TR><TR><TD CLASS="l">7</TD><TD> * </TD></TR><TR><TD CLASS="l">8</TD><TD> * Contributors:</TD></TR><TR><TD CLASS="l">9</TD><TD> * IBM Corporation - initial API and implementation</TD></TR><TR><TD CLASS="l">10</TD><TD> * Jens Lukowski/Innoopract - initial renaming/restructuring</TD></TR><TR><TD CLASS="l">11</TD><TD> * </TD></TR><TR><TD CLASS="l">12</TD><TD> *******************************************************************************/</TD></TR><TR><TD CLASS="l">13</TD><TD>package org.eclipse.wst.xml.core.internal.document;</TD></TR><TR><TD CLASS="l">14</TD><TD> </TD></TR><TR><TD CLASS="l">15</TD><TD> </TD></TR><TR><TD CLASS="l">16</TD><TD> </TD></TR><TR><TD CLASS="l">17</TD><TD>import org.w3c.dom.DOMException;</TD></TR><TR><TD CLASS="l">18</TD><TD>import org.w3c.dom.Node;</TD></TR><TR><TD CLASS="l">19</TD><TD>import org.w3c.dom.traversal.NodeFilter;</TD></TR><TR><TD CLASS="l">20</TD><TD>import org.w3c.dom.traversal.NodeIterator;</TD></TR><TR><TD CLASS="l">21</TD><TD> </TD></TR><TR><TD CLASS="l">22</TD><TD>/**</TD></TR><TR><TD CLASS="l">23</TD><TD> * NodeIteratorImpl class</TD></TR><TR><TD CLASS="l">24</TD><TD> */</TD></TR><TR><TD CLASS="l">25</TD><TD>public class NodeIteratorImpl implements NodeIterator {</TD></TR><TR CLASS="z"><TD CLASS="l">26</TD><TD> private NodeFilter filter = null;</TD></TR><TR CLASS="z"><TD CLASS="l">27</TD><TD> private Node nextNode = null;</TD></TR><TR><TD CLASS="l">28</TD><TD> </TD></TR><TR CLASS="z"><TD CLASS="l">29</TD><TD> private Node rootNode = null;</TD></TR><TR CLASS="z"><TD CLASS="l">30</TD><TD> private int whatToShow = NodeFilter.SHOW_ALL;</TD></TR><TR><TD CLASS="l">31</TD><TD> </TD></TR><TR><TD CLASS="l">32</TD><TD> /**</TD></TR><TR><TD CLASS="l">33</TD><TD> * NodeIteratorImpl constructor</TD></TR><TR><TD CLASS="l"><A NAME="0">34</A></TD><TD> * </TD></TR><TR><TD CLASS="l">35</TD><TD> * @param rootNode</TD></TR><TR><TD CLASS="l">36</TD><TD> * org.w3c.dom.Node</TD></TR><TR><TD CLASS="l">37</TD><TD> */</TD></TR><TR CLASS="z"><TD CLASS="l">38</TD><TD> NodeIteratorImpl(Node rootNode, int whatToShow, NodeFilter filter) {</TD></TR><TR CLASS="z"><TD CLASS="l">39</TD><TD> this.rootNode = rootNode;</TD></TR><TR CLASS="z"><TD CLASS="l">40</TD><TD> this.nextNode = rootNode;</TD></TR><TR CLASS="z"><TD CLASS="l">41</TD><TD> this.whatToShow = whatToShow;</TD></TR><TR CLASS="z"><TD CLASS="l">42</TD><TD> this.filter = filter;</TD></TR><TR CLASS="z"><TD CLASS="l">43</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="2">44</A></TD><TD> </TD></TR><TR><TD CLASS="l">45</TD><TD> /**</TD></TR><TR><TD CLASS="l">46</TD><TD> */</TD></TR><TR><TD CLASS="l">47</TD><TD> private final boolean acceptNode(Node node) {</TD></TR><TR CLASS="z"><TD CLASS="l">48</TD><TD> if (this.whatToShow != NodeFilter.SHOW_ALL) {</TD></TR><TR CLASS="z"><TD CLASS="l">49</TD><TD> if (node == null)</TD></TR><TR CLASS="z"><TD CLASS="l">50</TD><TD> return false;</TD></TR><TR CLASS="z"><TD CLASS="l">51</TD><TD> short nodeType = node.getNodeType();</TD></TR><TR CLASS="z"><TD CLASS="l">52</TD><TD> switch (this.whatToShow) {</TD></TR><TR><TD CLASS="l">53</TD><TD> case NodeFilter.SHOW_ELEMENT :</TD></TR><TR CLASS="z"><TD CLASS="l">54</TD><TD> if (nodeType != Node.ELEMENT_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">55</TD><TD> return false;</TD></TR><TR><TD CLASS="l">56</TD><TD> break;</TD></TR><TR><TD CLASS="l">57</TD><TD> case NodeFilter.SHOW_ATTRIBUTE :</TD></TR><TR CLASS="z"><TD CLASS="l">58</TD><TD> if (nodeType != Node.ATTRIBUTE_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">59</TD><TD> return false;</TD></TR><TR><TD CLASS="l">60</TD><TD> break;</TD></TR><TR><TD CLASS="l">61</TD><TD> case NodeFilter.SHOW_TEXT :</TD></TR><TR CLASS="z"><TD CLASS="l">62</TD><TD> if (nodeType != Node.TEXT_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">63</TD><TD> return false;</TD></TR><TR><TD CLASS="l">64</TD><TD> break;</TD></TR><TR><TD CLASS="l">65</TD><TD> case NodeFilter.SHOW_CDATA_SECTION :</TD></TR><TR CLASS="z"><TD CLASS="l">66</TD><TD> if (nodeType != Node.CDATA_SECTION_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">67</TD><TD> return false;</TD></TR><TR><TD CLASS="l">68</TD><TD> break;</TD></TR><TR><TD CLASS="l">69</TD><TD> case NodeFilter.SHOW_ENTITY_REFERENCE :</TD></TR><TR CLASS="z"><TD CLASS="l">70</TD><TD> if (nodeType != Node.ENTITY_REFERENCE_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">71</TD><TD> return false;</TD></TR><TR><TD CLASS="l">72</TD><TD> break;</TD></TR><TR><TD CLASS="l">73</TD><TD> case NodeFilter.SHOW_ENTITY :</TD></TR><TR CLASS="z"><TD CLASS="l">74</TD><TD> if (nodeType != Node.ENTITY_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">75</TD><TD> return false;</TD></TR><TR><TD CLASS="l">76</TD><TD> break;</TD></TR><TR><TD CLASS="l">77</TD><TD> case NodeFilter.SHOW_PROCESSING_INSTRUCTION :</TD></TR><TR CLASS="z"><TD CLASS="l">78</TD><TD> if (nodeType != Node.PROCESSING_INSTRUCTION_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">79</TD><TD> return false;</TD></TR><TR><TD CLASS="l">80</TD><TD> break;</TD></TR><TR><TD CLASS="l">81</TD><TD> case NodeFilter.SHOW_COMMENT :</TD></TR><TR CLASS="z"><TD CLASS="l">82</TD><TD> if (nodeType != Node.COMMENT_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">83</TD><TD> return false;</TD></TR><TR><TD CLASS="l">84</TD><TD> break;</TD></TR><TR><TD CLASS="l">85</TD><TD> case NodeFilter.SHOW_DOCUMENT :</TD></TR><TR CLASS="z"><TD CLASS="l">86</TD><TD> if (nodeType != Node.DOCUMENT_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">87</TD><TD> return false;</TD></TR><TR><TD CLASS="l">88</TD><TD> break;</TD></TR><TR><TD CLASS="l">89</TD><TD> case NodeFilter.SHOW_DOCUMENT_TYPE :</TD></TR><TR CLASS="z"><TD CLASS="l">90</TD><TD> if (nodeType != Node.DOCUMENT_TYPE_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">91</TD><TD> return false;</TD></TR><TR><TD CLASS="l">92</TD><TD> break;</TD></TR><TR><TD CLASS="l">93</TD><TD> case NodeFilter.SHOW_DOCUMENT_FRAGMENT :</TD></TR><TR CLASS="z"><TD CLASS="l">94</TD><TD> if (nodeType != Node.DOCUMENT_FRAGMENT_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">95</TD><TD> return false;</TD></TR><TR><TD CLASS="l">96</TD><TD> break;</TD></TR><TR><TD CLASS="l">97</TD><TD> case NodeFilter.SHOW_NOTATION :</TD></TR><TR CLASS="z"><TD CLASS="l">98</TD><TD> if (nodeType != Node.NOTATION_NODE)</TD></TR><TR CLASS="z"><TD CLASS="l">99</TD><TD> return false;</TD></TR><TR><TD CLASS="l">100</TD><TD> break;</TD></TR><TR><TD CLASS="l">101</TD><TD> default :</TD></TR><TR CLASS="z"><TD CLASS="l">102</TD><TD> return false;</TD></TR><TR><TD CLASS="l">103</TD><TD> }</TD></TR><TR><TD CLASS="l">104</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">105</TD><TD> if (this.filter != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">106</TD><TD> return (this.filter.acceptNode(node) == NodeFilter.FILTER_ACCEPT);</TD></TR><TR><TD CLASS="l">107</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">108</TD><TD> return true;</TD></TR><TR><TD CLASS="l">109</TD><TD> }</TD></TR><TR><TD CLASS="l">110</TD><TD> </TD></TR><TR><TD CLASS="l">111</TD><TD> /**</TD></TR><TR><TD CLASS="l">112</TD><TD> * Detaches the <code>NodeIterator</code> from the set which it iterated</TD></TR><TR><TD CLASS="l">113</TD><TD> * over, releasing any computational resources and placing the iterator in</TD></TR><TR><TD CLASS="l">114</TD><TD> * the INVALID state. After <code>detach</code> has been invoked, calls</TD></TR><TR><TD CLASS="l"><A NAME="3">115</A></TD><TD> * to <code>nextNode</code> or <code>previousNode</code> will raise</TD></TR><TR><TD CLASS="l">116</TD><TD> * the exception INVALID_STATE_ERR.</TD></TR><TR><TD CLASS="l">117</TD><TD> */</TD></TR><TR><TD CLASS="l">118</TD><TD> public void detach() {</TD></TR><TR CLASS="z"><TD CLASS="l">119</TD><TD> this.rootNode = null;</TD></TR><TR CLASS="z"><TD CLASS="l">120</TD><TD> this.nextNode = null;</TD></TR><TR CLASS="z"><TD CLASS="l">121</TD><TD> this.filter = null;</TD></TR><TR CLASS="z"><TD CLASS="l">122</TD><TD> }</TD></TR><TR><TD CLASS="l">123</TD><TD> </TD></TR><TR><TD CLASS="l">124</TD><TD> /**</TD></TR><TR><TD CLASS="l">125</TD><TD> * The value of this flag determines whether the children of entity</TD></TR><TR><TD CLASS="l">126</TD><TD> * reference nodes are visible to the iterator. If false, they and their</TD></TR><TR><TD CLASS="l">127</TD><TD> * descendants will be rejected. Note that this rejection takes precedence</TD></TR><TR><TD CLASS="l">128</TD><TD> * over <code>whatToShow</code> and the filter. Also note that this is</TD></TR><TR><TD CLASS="l">129</TD><TD> * currently the only situation where <code>NodeIterators</code> may</TD></TR><TR><TD CLASS="l">130</TD><TD> * reject a complete subtree rather than skipping individual nodes. <br></TD></TR><TR><TD CLASS="l">131</TD><TD> * <br></TD></TR><TR><TD CLASS="l">132</TD><TD> * To produce a view of the document that has entity references expanded</TD></TR><TR><TD CLASS="l">133</TD><TD> * and does not expose the entity reference node itself, use the</TD></TR><TR><TD CLASS="l">134</TD><TD> * <code>whatToShow</code> flags to hide the entity reference node and</TD></TR><TR><TD CLASS="l">135</TD><TD> * set <code>expandEntityReferences</code> to true when creating the</TD></TR><TR><TD CLASS="l">136</TD><TD> * iterator. To produce a view of the document that has entity reference</TD></TR><TR><TD CLASS="l">137</TD><TD> * nodes but no entity expansion, use the <code>whatToShow</code> flags</TD></TR><TR><TD CLASS="l">138</TD><TD> * to show the entity reference node and set</TD></TR><TR><TD CLASS="l"><A NAME="4">139</A></TD><TD> * <code>expandEntityReferences</code> to false.</TD></TR><TR><TD CLASS="l">140</TD><TD> */</TD></TR><TR><TD CLASS="l">141</TD><TD> public boolean getExpandEntityReferences() {</TD></TR><TR><TD CLASS="l">142</TD><TD> // not supported</TD></TR><TR CLASS="z"><TD CLASS="l">143</TD><TD> return false;</TD></TR><TR><TD CLASS="l">144</TD><TD> }</TD></TR><TR><TD CLASS="l">145</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="5">146</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">147</TD><TD> * The <code>NodeFilter</code> used to screen nodes.</TD></TR><TR><TD CLASS="l">148</TD><TD> */</TD></TR><TR><TD CLASS="l">149</TD><TD> public NodeFilter getFilter() {</TD></TR><TR CLASS="z"><TD CLASS="l">150</TD><TD> return this.filter;</TD></TR><TR><TD CLASS="l">151</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="6">152</A></TD><TD> </TD></TR><TR><TD CLASS="l">153</TD><TD> /**</TD></TR><TR><TD CLASS="l">154</TD><TD> */</TD></TR><TR><TD CLASS="l">155</TD><TD> private final Node getNextNode() {</TD></TR><TR CLASS="z"><TD CLASS="l">156</TD><TD> if (this.nextNode == null)</TD></TR><TR CLASS="z"><TD CLASS="l">157</TD><TD> return null;</TD></TR><TR CLASS="z"><TD CLASS="l">158</TD><TD> Node oldNext = this.nextNode;</TD></TR><TR CLASS="z"><TD CLASS="l">159</TD><TD> Node child = this.nextNode.getFirstChild();</TD></TR><TR CLASS="z"><TD CLASS="l">160</TD><TD> if (child != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">161</TD><TD> this.nextNode = child;</TD></TR><TR CLASS="z"><TD CLASS="l">162</TD><TD> return oldNext;</TD></TR><TR><TD CLASS="l">163</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">164</TD><TD> for (Node node = this.nextNode; node != null && node != this.rootNode; node = node.getParentNode()) {</TD></TR><TR CLASS="z"><TD CLASS="l">165</TD><TD> Node next = node.getNextSibling();</TD></TR><TR CLASS="z"><TD CLASS="l">166</TD><TD> if (next != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">167</TD><TD> this.nextNode = next;</TD></TR><TR CLASS="z"><TD CLASS="l">168</TD><TD> return oldNext;</TD></TR><TR><TD CLASS="l">169</TD><TD> }</TD></TR><TR><TD CLASS="l">170</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">171</TD><TD> this.nextNode = null;</TD></TR><TR CLASS="z"><TD CLASS="l">172</TD><TD> return oldNext;</TD></TR><TR><TD CLASS="l">173</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="7">174</A></TD><TD> </TD></TR><TR><TD CLASS="l">175</TD><TD> /**</TD></TR><TR><TD CLASS="l">176</TD><TD> */</TD></TR><TR><TD CLASS="l">177</TD><TD> private final Node getPreviousNode() {</TD></TR><TR CLASS="z"><TD CLASS="l">178</TD><TD> if (this.nextNode == this.rootNode)</TD></TR><TR CLASS="z"><TD CLASS="l">179</TD><TD> return null;</TD></TR><TR CLASS="z"><TD CLASS="l">180</TD><TD> Node prev = null;</TD></TR><TR CLASS="z"><TD CLASS="l">181</TD><TD> if (this.nextNode == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">182</TD><TD> prev = this.rootNode; // never null</TD></TR><TR><TD CLASS="l">183</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">184</TD><TD> prev = this.nextNode.getPreviousSibling();</TD></TR><TR CLASS="z"><TD CLASS="l">185</TD><TD> if (prev == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">186</TD><TD> this.nextNode = this.nextNode.getParentNode();</TD></TR><TR CLASS="z"><TD CLASS="l">187</TD><TD> return this.nextNode;</TD></TR><TR><TD CLASS="l">188</TD><TD> }</TD></TR><TR><TD CLASS="l">189</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">190</TD><TD> Node last = prev.getLastChild();</TD></TR><TR CLASS="z"><TD CLASS="l">191</TD><TD> while (last != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">192</TD><TD> prev = last;</TD></TR><TR CLASS="z"><TD CLASS="l">193</TD><TD> last = prev.getLastChild();</TD></TR><TR><TD CLASS="l">194</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">195</TD><TD> this.nextNode = prev;</TD></TR><TR CLASS="z"><TD CLASS="l">196</TD><TD> return this.nextNode;</TD></TR><TR><TD CLASS="l">197</TD><TD> }</TD></TR><TR><TD CLASS="l">198</TD><TD> </TD></TR><TR><TD CLASS="l">199</TD><TD> /**</TD></TR><TR><TD CLASS="l"><A NAME="8">200</A></TD><TD> * The root node of the <code>NodeIterator</code>, as specified when it</TD></TR><TR><TD CLASS="l">201</TD><TD> * was created.</TD></TR><TR><TD CLASS="l">202</TD><TD> */</TD></TR><TR><TD CLASS="l">203</TD><TD> public Node getRoot() {</TD></TR><TR CLASS="z"><TD CLASS="l">204</TD><TD> return this.rootNode;</TD></TR><TR><TD CLASS="l">205</TD><TD> }</TD></TR><TR><TD CLASS="l">206</TD><TD> </TD></TR><TR><TD CLASS="l">207</TD><TD> /**</TD></TR><TR><TD CLASS="l">208</TD><TD> * This attribute determines which node types are presented via the</TD></TR><TR><TD CLASS="l">209</TD><TD> * iterator. The available set of constants is defined in the</TD></TR><TR><TD CLASS="l">210</TD><TD> * <code>NodeFilter</code> interface. Nodes not accepted by</TD></TR><TR><TD CLASS="l">211</TD><TD> * <code>whatToShow</code> will be skipped, but their children may still</TD></TR><TR><TD CLASS="l"><A NAME="9">212</A></TD><TD> * be considered. Note that this skip takes precedence over the filter, if</TD></TR><TR><TD CLASS="l">213</TD><TD> * any.</TD></TR><TR><TD CLASS="l">214</TD><TD> */</TD></TR><TR><TD CLASS="l">215</TD><TD> public int getWhatToShow() {</TD></TR><TR CLASS="z"><TD CLASS="l">216</TD><TD> return this.whatToShow;</TD></TR><TR><TD CLASS="l">217</TD><TD> }</TD></TR><TR><TD CLASS="l">218</TD><TD> </TD></TR><TR><TD CLASS="l">219</TD><TD> /**</TD></TR><TR><TD CLASS="l">220</TD><TD> * Returns the next node in the set and advances the position of the</TD></TR><TR><TD CLASS="l">221</TD><TD> * iterator in the set. After a <code>NodeIterator</code> is created,</TD></TR><TR><TD CLASS="l">222</TD><TD> * the first call to <code>nextNode()</code> returns the first node in</TD></TR><TR><TD CLASS="l">223</TD><TD> * the set.</TD></TR><TR><TD CLASS="l">224</TD><TD> * </TD></TR><TR><TD CLASS="l">225</TD><TD> * @return The next <code>Node</code> in the set being iterated over, or</TD></TR><TR><TD CLASS="l">226</TD><TD> * <code>null</code> if there are no more members in that set.</TD></TR><TR><TD CLASS="l">227</TD><TD> * @exception DOMException</TD></TR><TR><TD CLASS="l"><A NAME="a">228</A></TD><TD> * INVALID_STATE_ERR: Raised if this method is called after</TD></TR><TR><TD CLASS="l">229</TD><TD> * the <code>detach</code> method was invoked.</TD></TR><TR><TD CLASS="l">230</TD><TD> */</TD></TR><TR><TD CLASS="l">231</TD><TD> public Node nextNode() throws DOMException {</TD></TR><TR CLASS="z"><TD CLASS="l">232</TD><TD> for (Node node = getNextNode(); node != null; node = getNextNode()) {</TD></TR><TR CLASS="z"><TD CLASS="l">233</TD><TD> if (acceptNode(node))</TD></TR><TR CLASS="z"><TD CLASS="l">234</TD><TD> return node;</TD></TR><TR><TD CLASS="l">235</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">236</TD><TD> return null;</TD></TR><TR><TD CLASS="l">237</TD><TD> }</TD></TR><TR><TD CLASS="l">238</TD><TD> </TD></TR><TR><TD CLASS="l">239</TD><TD> /**</TD></TR><TR><TD CLASS="l">240</TD><TD> * Returns the previous node in the set and moves the position of the</TD></TR><TR><TD CLASS="l">241</TD><TD> * <code>NodeIterator</code> backwards in the set.</TD></TR><TR><TD CLASS="l">242</TD><TD> * </TD></TR><TR><TD CLASS="l">243</TD><TD> * @return The previous <code>Node</code> in the set being iterated</TD></TR><TR><TD CLASS="l">244</TD><TD> * over, or <code>null</code> if there are no more members in</TD></TR><TR><TD CLASS="l">245</TD><TD> * that set.</TD></TR><TR><TD CLASS="l">246</TD><TD> * @exception DOMException</TD></TR><TR><TD CLASS="l"><A NAME="b">247</A></TD><TD> * INVALID_STATE_ERR: Raised if this method is called after</TD></TR><TR><TD CLASS="l">248</TD><TD> * the <code>detach</code> method was invoked.</TD></TR><TR><TD CLASS="l">249</TD><TD> */</TD></TR><TR><TD CLASS="l">250</TD><TD> public Node previousNode() throws DOMException {</TD></TR><TR CLASS="z"><TD CLASS="l">251</TD><TD> for (Node node = getPreviousNode(); node != null; node = getPreviousNode()) {</TD></TR><TR CLASS="z"><TD CLASS="l">252</TD><TD> if (acceptNode(node))</TD></TR><TR CLASS="z"><TD CLASS="l">253</TD><TD> return node;</TD></TR><TR><TD CLASS="l">254</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">255</TD><TD> return null;</TD></TR><TR><TD CLASS="l">256</TD><TD> }</TD></TR><TR><TD CLASS="l">257</TD><TD>}</TD></TR></TABLE><P></P><TABLE CLASS="hdft" CELLSPACING="0" WIDTH="100%"><TR><TD CLASS="nv">[<A HREF="../xslUnitTestCoverage.html">all classes</A>][<A HREF="85.html">org.eclipse.wst.xml.core.internal.document</A>]</TD></TR><TR><TD CLASS="tl"><A HREF="http://www.eclemma.org/support.html">EMMA 2.0.5312 EclEmma Fix 1</A> (C) Vladimir Roubtsov</TD></TR></TABLE></BODY></HTML> |