<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="7f.html">org.eclipse.wst.xml.xpath2.processor.types</A>]</TD></TR></TABLE><H2>COVERAGE SUMMARY FOR SOURCE FILE [<SPAN CLASS="in">NodeType.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>NodeType.java</TD><TD>100% (1/1)</TD><TD CLASS="h">46%  (6/13)</TD><TD CLASS="h">57%  (127/222)</TD><TD CLASS="h">59%  (28.8/49)</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">NodeType</A></TD><TD>100% (1/1)</TD><TD CLASS="h">46%  (6/13)</TD><TD CLASS="h">57%  (127/222)</TD><TD CLASS="h">59%  (28.8/49)</TD></TR><TR><TD CLASS="f"><A HREF="#1">after (NodeType): boolean</A></TD><TD> </TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/4)</TD><TD CLASS="h">0%   (0/1)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2">after (NodeType, NodeType): boolean</A></TD><TD> </TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/14)</TD><TD CLASS="h">0%   (0/3)</TD></TR><TR><TD CLASS="f"><A HREF="#3">before (NodeType): boolean</A></TD><TD> </TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/4)</TD><TD CLASS="h">0%   (0/1)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#4">before (NodeType, NodeType): boolean</A></TD><TD> </TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/9)</TD><TD CLASS="h">0%   (0/1)</TD></TR><TR><TD CLASS="f"><A HREF="#5">document_order (): 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="#6">nilled (): ResultSequence</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="#7">same (NodeType, NodeType): boolean</A></TD><TD> </TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/9)</TD><TD CLASS="h">0%   (0/1)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#8">dom_to_xpath (Node, int): NodeType</A></TD><TD> </TD><TD>100% (1/1)</TD><TD CLASS="h">45%  (24/53)</TD><TD CLASS="h">44%  (4/9)</TD></TR><TR><TD CLASS="f"><A HREF="#9">sort_document_order (ResultSequence): ResultSequence</A></TD><TD> </TD><TD>100% (1/1)</TD><TD CLASS="h">75%  (50/67)</TD><TD CLASS="h">70%  (11.9/17)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#0">&lt;static initializer&gt;</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>88%  (7/8)</TD><TD>87%  (0.9/1)</TD></TR><TR><TD CLASS="f"><A HREF="#b">eliminate_dups (ResultSequence): ResultSequence</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>92%  (34/37)</TD><TD>88%  (7/8)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#c">NodeType (Node, int): void</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (9/9)</TD><TD>100% (4/4)</TD></TR><TR><TD CLASS="f"><A HREF="#d">node_value (): Node</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (3/3)</TD><TD>100% (1/1)</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) 2005, 2009 Andrea Bittau, University College London, 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> *     Andrea Bittau - initial API and implementation from the PsychoPath XPath 2.0 </TD></TR><TR><TD CLASS="l">10</TD><TD> *******************************************************************************/</TD></TR><TR><TD CLASS="l">11</TD><TD> </TD></TR><TR><TD CLASS="l">12</TD><TD>package org.eclipse.wst.xml.xpath2.processor.types;</TD></TR><TR><TD CLASS="l">13</TD><TD> </TD></TR><TR><TD CLASS="l">14</TD><TD>import org.w3c.dom.*;</TD></TR><TR><TD CLASS="l">15</TD><TD>import org.eclipse.wst.xml.xpath2.processor.*;</TD></TR><TR><TD CLASS="l">16</TD><TD> </TD></TR><TR><TD CLASS="l">17</TD><TD>import java.util.*;</TD></TR><TR><TD CLASS="l"><A NAME="0">18</A></TD><TD> </TD></TR><TR><TD CLASS="l">19</TD><TD>/**</TD></TR><TR><TD CLASS="l">20</TD><TD> * A representation of a Node datatype</TD></TR><TR><TD CLASS="l">21</TD><TD> */</TD></TR><TR CLASS="p"><TD CLASS="l" TITLE="88% line coverage (7 out of 8 instructions)">22</TD><TD TITLE="88% line coverage (7 out of 8 instructions)">public abstract class NodeType extends AnyType {</TD></TR><TR><TD CLASS="l">23</TD><TD>        private Node _node;</TD></TR><TR><TD CLASS="l">24</TD><TD>        private int _document_order;</TD></TR><TR><TD CLASS="l">25</TD><TD> </TD></TR><TR><TD CLASS="l">26</TD><TD>        /**</TD></TR><TR><TD CLASS="l">27</TD><TD>         * Initialises according to the supplied parameters</TD></TR><TR><TD CLASS="l">28</TD><TD>         * </TD></TR><TR><TD CLASS="l">29</TD><TD>         * @param node</TD></TR><TR><TD CLASS="l"><A NAME="c">30</A></TD><TD>         *            The Node being represented</TD></TR><TR><TD CLASS="l">31</TD><TD>         * @param document_order</TD></TR><TR><TD CLASS="l">32</TD><TD>         *            The document order</TD></TR><TR><TD CLASS="l">33</TD><TD>         */</TD></TR><TR CLASS="c"><TD CLASS="l">34</TD><TD>        public NodeType(Node node, int document_order) {</TD></TR><TR CLASS="c"><TD CLASS="l">35</TD><TD>                _node = node;</TD></TR><TR CLASS="c"><TD CLASS="l">36</TD><TD>                _document_order = document_order;</TD></TR><TR CLASS="c"><TD CLASS="l">37</TD><TD>        }</TD></TR><TR><TD CLASS="l">38</TD><TD> </TD></TR><TR><TD CLASS="l">39</TD><TD>        /**</TD></TR><TR><TD CLASS="l">40</TD><TD>         * Retrieves the actual node being represented</TD></TR><TR><TD CLASS="l"><A NAME="d">41</A></TD><TD>         * </TD></TR><TR><TD CLASS="l">42</TD><TD>         * @return Actual node being represented</TD></TR><TR><TD CLASS="l">43</TD><TD>         */</TD></TR><TR><TD CLASS="l">44</TD><TD>        public Node node_value() {</TD></TR><TR CLASS="c"><TD CLASS="l">45</TD><TD>                return _node;</TD></TR><TR><TD CLASS="l">46</TD><TD>        }</TD></TR><TR><TD CLASS="l">47</TD><TD> </TD></TR><TR><TD CLASS="l">48</TD><TD>        /**</TD></TR><TR><TD CLASS="l">49</TD><TD>         * Retrieves the document order as an integer</TD></TR><TR><TD CLASS="l"><A NAME="5">50</A></TD><TD>         * </TD></TR><TR><TD CLASS="l">51</TD><TD>         * @return Document order as an integer</TD></TR><TR><TD CLASS="l">52</TD><TD>         */</TD></TR><TR><TD CLASS="l">53</TD><TD>        public int document_order() {</TD></TR><TR CLASS="z"><TD CLASS="l">54</TD><TD>                return _document_order;</TD></TR><TR><TD CLASS="l">55</TD><TD>        }</TD></TR><TR><TD CLASS="l">56</TD><TD> </TD></TR><TR><TD CLASS="l">57</TD><TD>        // Accessors defined in XPath Data model</TD></TR><TR><TD CLASS="l">58</TD><TD>        // http://www.w3.org/TR/xpath-datamodel/</TD></TR><TR><TD CLASS="l">59</TD><TD>        /**</TD></TR><TR><TD CLASS="l">60</TD><TD>         * Retrieves the actual node being represented</TD></TR><TR><TD CLASS="l">61</TD><TD>         * </TD></TR><TR><TD CLASS="l">62</TD><TD>         * @return Actual node being represented</TD></TR><TR><TD CLASS="l">63</TD><TD>         */</TD></TR><TR><TD CLASS="l">64</TD><TD>        public abstract ResultSequence typed_value();</TD></TR><TR><TD CLASS="l">65</TD><TD> </TD></TR><TR><TD CLASS="l">66</TD><TD>        /**</TD></TR><TR><TD CLASS="l">67</TD><TD>         * Retrieves the name of the node</TD></TR><TR><TD CLASS="l">68</TD><TD>         * </TD></TR><TR><TD CLASS="l">69</TD><TD>         * @return QName representation of the name of the node</TD></TR><TR><TD CLASS="l">70</TD><TD>         */</TD></TR><TR><TD CLASS="l"><A NAME="6">71</A></TD><TD>        public abstract QName node_name(); // may return null [&#34;empty sequence&#34;]</TD></TR><TR><TD CLASS="l">72</TD><TD> </TD></TR><TR><TD CLASS="l">73</TD><TD>        // XXX element should override</TD></TR><TR><TD CLASS="l">74</TD><TD>        public ResultSequence nilled() {</TD></TR><TR CLASS="z"><TD CLASS="l">75</TD><TD>                return ResultSequenceFactory.create_new();</TD></TR><TR><TD CLASS="l"><A NAME="8">76</A></TD><TD>        }</TD></TR><TR><TD CLASS="l">77</TD><TD> </TD></TR><TR><TD CLASS="l">78</TD><TD>        // a little factory for converting from DOM to our representation</TD></TR><TR><TD CLASS="l">79</TD><TD>        public static NodeType dom_to_xpath(Node node, int doc_pos) {</TD></TR><TR CLASS="c"><TD CLASS="l">80</TD><TD>                switch (node.getNodeType()) {</TD></TR><TR><TD CLASS="l">81</TD><TD>                case Node.ELEMENT_NODE:</TD></TR><TR CLASS="c"><TD CLASS="l">82</TD><TD>                        return new ElementType((Element) node, doc_pos);</TD></TR><TR><TD CLASS="l">83</TD><TD> </TD></TR><TR><TD CLASS="l">84</TD><TD>                case Node.COMMENT_NODE:</TD></TR><TR CLASS="z"><TD CLASS="l">85</TD><TD>                        return new CommentType((Comment) node, doc_pos);</TD></TR><TR><TD CLASS="l">86</TD><TD> </TD></TR><TR><TD CLASS="l">87</TD><TD>                case Node.ATTRIBUTE_NODE:</TD></TR><TR CLASS="z"><TD CLASS="l">88</TD><TD>                        return new AttrType((Attr) node, doc_pos);</TD></TR><TR><TD CLASS="l">89</TD><TD> </TD></TR><TR><TD CLASS="l">90</TD><TD>                case Node.TEXT_NODE:</TD></TR><TR CLASS="c"><TD CLASS="l">91</TD><TD>                        return new TextType((Text) node, doc_pos);</TD></TR><TR><TD CLASS="l">92</TD><TD> </TD></TR><TR><TD CLASS="l">93</TD><TD>                case Node.DOCUMENT_NODE:</TD></TR><TR CLASS="c"><TD CLASS="l">94</TD><TD>                        return new DocType((Document) node, doc_pos);</TD></TR><TR><TD CLASS="l">95</TD><TD> </TD></TR><TR><TD CLASS="l">96</TD><TD>                case Node.PROCESSING_INSTRUCTION_NODE:</TD></TR><TR CLASS="z"><TD CLASS="l">97</TD><TD>                        return new PIType((ProcessingInstruction) node, doc_pos);</TD></TR><TR><TD CLASS="l">98</TD><TD> </TD></TR><TR><TD CLASS="l">99</TD><TD>                        // XXX</TD></TR><TR><TD CLASS="l">100</TD><TD>                default:</TD></TR><TR CLASS="z"><TD CLASS="l">101</TD><TD>                        assert false;</TD></TR><TR><TD CLASS="l">102</TD><TD> </TD></TR><TR><TD CLASS="l">103</TD><TD>                }</TD></TR><TR><TD CLASS="l">104</TD><TD> </TD></TR><TR><TD CLASS="l">105</TD><TD>                // unreach... hopefully</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="b">106</A></TD><TD>                return null;</TD></TR><TR><TD CLASS="l">107</TD><TD>        }</TD></TR><TR><TD CLASS="l">108</TD><TD> </TD></TR><TR><TD CLASS="l">109</TD><TD>        public static ResultSequence eliminate_dups(ResultSequence rs) {</TD></TR><TR CLASS="c"><TD CLASS="l">110</TD><TD>                Hashtable added = new Hashtable(rs.size());</TD></TR><TR><TD CLASS="l">111</TD><TD> </TD></TR><TR CLASS="c"><TD CLASS="l">112</TD><TD>                for (Iterator i = rs.iterator(); i.hasNext();) {</TD></TR><TR CLASS="c"><TD CLASS="l">113</TD><TD>                        NodeType node = (NodeType) i.next();</TD></TR><TR CLASS="c"><TD CLASS="l">114</TD><TD>                        Node n = node.node_value();</TD></TR><TR><TD CLASS="l">115</TD><TD> </TD></TR><TR CLASS="c"><TD CLASS="l">116</TD><TD>                        if (added.containsKey(n))</TD></TR><TR CLASS="z"><TD CLASS="l">117</TD><TD>                                i.remove();</TD></TR><TR><TD CLASS="l">118</TD><TD>                        else</TD></TR><TR CLASS="c"><TD CLASS="l">119</TD><TD>                                added.put(n, new Boolean(true));</TD></TR><TR><TD CLASS="l">120</TD><TD>                }</TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="9">121</A></TD><TD>                return rs;</TD></TR><TR><TD CLASS="l">122</TD><TD>        }</TD></TR><TR><TD CLASS="l">123</TD><TD> </TD></TR><TR><TD CLASS="l">124</TD><TD>        public static ResultSequence sort_document_order(ResultSequence rs) {</TD></TR><TR CLASS="c"><TD CLASS="l">125</TD><TD>                ArrayList res = new ArrayList(rs.size());</TD></TR><TR><TD CLASS="l">126</TD><TD> </TD></TR><TR CLASS="c"><TD CLASS="l">127</TD><TD>                for (Iterator i = rs.iterator(); i.hasNext();) {</TD></TR><TR CLASS="c"><TD CLASS="l">128</TD><TD>                        NodeType node = (NodeType) i.next();</TD></TR><TR CLASS="c"><TD CLASS="l">129</TD><TD>                        boolean added = false;</TD></TR><TR><TD CLASS="l">130</TD><TD> </TD></TR><TR CLASS="p"><TD CLASS="l" TITLE="93% line coverage (13 out of 14 instructions)">131</TD><TD TITLE="93% line coverage (13 out of 14 instructions)">                        for (int j = 0; j &lt; res.size(); j++) {</TD></TR><TR CLASS="z"><TD CLASS="l">132</TD><TD>                                NodeType x = (NodeType) res.get(j);</TD></TR><TR><TD CLASS="l">133</TD><TD> </TD></TR><TR CLASS="z"><TD CLASS="l">134</TD><TD>                                if (before(node, x)) {</TD></TR><TR CLASS="z"><TD CLASS="l">135</TD><TD>                                        res.add(j, node);</TD></TR><TR CLASS="z"><TD CLASS="l">136</TD><TD>                                        added = true;</TD></TR><TR CLASS="z"><TD CLASS="l">137</TD><TD>                                        break;</TD></TR><TR><TD CLASS="l">138</TD><TD>                                }</TD></TR><TR><TD CLASS="l">139</TD><TD>                        }</TD></TR><TR CLASS="c"><TD CLASS="l">140</TD><TD>                        if (!added)</TD></TR><TR CLASS="c"><TD CLASS="l">141</TD><TD>                                res.add(node);</TD></TR><TR><TD CLASS="l">142</TD><TD>                }</TD></TR><TR><TD CLASS="l">143</TD><TD> </TD></TR><TR CLASS="c"><TD CLASS="l">144</TD><TD>                rs = ResultSequenceFactory.create_new();</TD></TR><TR CLASS="c"><TD CLASS="l">145</TD><TD>                for (Iterator i = res.iterator(); i.hasNext();) {</TD></TR><TR CLASS="c"><TD CLASS="l">146</TD><TD>                        NodeType node = (NodeType) i.next();</TD></TR><TR><TD CLASS="l">147</TD><TD> </TD></TR><TR CLASS="c"><TD CLASS="l">148</TD><TD>                        rs.add(node);</TD></TR><TR><TD CLASS="l">149</TD><TD>                }</TD></TR><TR><TD CLASS="l">150</TD><TD> </TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="7">151</A></TD><TD>                return rs;</TD></TR><TR><TD CLASS="l">152</TD><TD>        }</TD></TR><TR><TD CLASS="l">153</TD><TD> </TD></TR><TR><TD CLASS="l">154</TD><TD>        public static boolean same(NodeType a, NodeType b) {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="3">155</A></TD><TD>                return a.document_order() == b.document_order();</TD></TR><TR><TD CLASS="l">156</TD><TD>        }</TD></TR><TR><TD CLASS="l">157</TD><TD> </TD></TR><TR><TD CLASS="l">158</TD><TD>        public boolean before(NodeType two) {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="4">159</A></TD><TD>                return before(this, two);</TD></TR><TR><TD CLASS="l">160</TD><TD>        }</TD></TR><TR><TD CLASS="l">161</TD><TD> </TD></TR><TR><TD CLASS="l">162</TD><TD>        public static boolean before(NodeType a, NodeType b) {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="1">163</A></TD><TD>                return a.document_order() &lt; b.document_order();</TD></TR><TR><TD CLASS="l">164</TD><TD>        }</TD></TR><TR><TD CLASS="l">165</TD><TD> </TD></TR><TR><TD CLASS="l">166</TD><TD>        public boolean after(NodeType two) {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="2">167</A></TD><TD>                return after(this, two);</TD></TR><TR><TD CLASS="l">168</TD><TD>        }</TD></TR><TR><TD CLASS="l">169</TD><TD> </TD></TR><TR><TD CLASS="l">170</TD><TD>        public static boolean after(NodeType a, NodeType b) {</TD></TR><TR CLASS="z"><TD CLASS="l">171</TD><TD>                if (same(a, b))</TD></TR><TR CLASS="z"><TD CLASS="l">172</TD><TD>                        return false;</TD></TR><TR><TD CLASS="l">173</TD><TD> </TD></TR><TR CLASS="z"><TD CLASS="l">174</TD><TD>                return !before(a, b);</TD></TR><TR><TD CLASS="l">175</TD><TD>        }</TD></TR><TR><TD CLASS="l">176</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="7f.html">org.eclipse.wst.xml.xpath2.processor.types</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>