<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="6f.html">org.eclipse.wst.sse.core.internal.util</A>]</TD></TR></TABLE><H2>COVERAGE SUMMARY FOR SOURCE FILE [<SPAN CLASS="in">Sorter.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>Sorter.java</TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/3)</TD><TD CLASS="h">0%   (0/100)</TD><TD CLASS="h">0%   (0/26)</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">Sorter</A></TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/3)</TD><TD CLASS="h">0%   (0/100)</TD><TD CLASS="h">0%   (0/26)</TD></TR><TR><TD CLASS="f"><A HREF="#0">Sorter (): void</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="#2">quickSort (Object [], int, int): Object []</A></TD><TD> </TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/72)</TD><TD CLASS="h">0%   (0/19)</TD></TR><TR><TD CLASS="f"><A HREF="#3">sort (Object []): Object []</A></TD><TD> </TD><TD CLASS="h">0%   (0/1)</TD><TD CLASS="h">0%   (0/25)</TD><TD CLASS="h">0%   (0/6)</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, 2005 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.sse.core.internal.util;</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>/**</TD></TR><TR><TD CLASS="l"><A NAME="0">18</A></TD><TD> * The SortOperation takes a collection of objects and returns a sorted</TD></TR><TR><TD CLASS="l">19</TD><TD> * collection of these objects. Concrete instances of this class provide the</TD></TR><TR><TD CLASS="l">20</TD><TD> * criteria for the sorting of the objects based on the type of the objects.</TD></TR><TR><TD CLASS="l">21</TD><TD> */</TD></TR><TR CLASS="z"><TD CLASS="l">22</TD><TD>public abstract class Sorter {</TD></TR><TR><TD CLASS="l">23</TD><TD> </TD></TR><TR><TD CLASS="l">24</TD><TD>        /**</TD></TR><TR><TD CLASS="l">25</TD><TD>         * Returns true if elementTwo is 'greater than' elementOne This is the</TD></TR><TR><TD CLASS="l">26</TD><TD>         * 'ordering' method of the sort operation. Each subclass overides this</TD></TR><TR><TD CLASS="l">27</TD><TD>         * method with the particular implementation of the 'greater than' concept</TD></TR><TR><TD CLASS="l">28</TD><TD>         * for the objects being sorted.</TD></TR><TR><TD CLASS="l">29</TD><TD>         */</TD></TR><TR><TD CLASS="l">30</TD><TD>        public abstract boolean compare(Object elementOne, Object elementTwo);</TD></TR><TR><TD CLASS="l">31</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="2">32</A></TD><TD>        /**</TD></TR><TR><TD CLASS="l">33</TD><TD>         * Sort the objects in sorted collection and return that collection.</TD></TR><TR><TD CLASS="l">34</TD><TD>         */</TD></TR><TR><TD CLASS="l">35</TD><TD>        private Object[] quickSort(Object[] sortedCollection, int left, int right) {</TD></TR><TR CLASS="z"><TD CLASS="l">36</TD><TD>                int originalLeft = left;</TD></TR><TR CLASS="z"><TD CLASS="l">37</TD><TD>                int originalRight = right;</TD></TR><TR CLASS="z"><TD CLASS="l">38</TD><TD>                Object mid = sortedCollection[(left + right) / 2];</TD></TR><TR><TD CLASS="l">39</TD><TD> </TD></TR><TR><TD CLASS="l">40</TD><TD>                do {</TD></TR><TR CLASS="z"><TD CLASS="l">41</TD><TD>                        while (compare(sortedCollection[left], mid))</TD></TR><TR CLASS="z"><TD CLASS="l">42</TD><TD>                                left++;</TD></TR><TR CLASS="z"><TD CLASS="l">43</TD><TD>                        while (compare(mid, sortedCollection[right]))</TD></TR><TR CLASS="z"><TD CLASS="l">44</TD><TD>                                right--;</TD></TR><TR CLASS="z"><TD CLASS="l">45</TD><TD>                        if (left &lt;= right) {</TD></TR><TR CLASS="z"><TD CLASS="l">46</TD><TD>                                Object tmp = sortedCollection[left];</TD></TR><TR CLASS="z"><TD CLASS="l">47</TD><TD>                                sortedCollection[left] = sortedCollection[right];</TD></TR><TR CLASS="z"><TD CLASS="l">48</TD><TD>                                sortedCollection[right] = tmp;</TD></TR><TR CLASS="z"><TD CLASS="l">49</TD><TD>                                left++;</TD></TR><TR CLASS="z"><TD CLASS="l">50</TD><TD>                                right--;</TD></TR><TR><TD CLASS="l">51</TD><TD>                        }</TD></TR><TR CLASS="z"><TD CLASS="l">52</TD><TD>                } while (left &lt;= right);</TD></TR><TR><TD CLASS="l">53</TD><TD> </TD></TR><TR CLASS="z"><TD CLASS="l">54</TD><TD>                if (originalLeft &lt; right)</TD></TR><TR CLASS="z"><TD CLASS="l">55</TD><TD>                        sortedCollection = quickSort(sortedCollection, originalLeft, right);</TD></TR><TR CLASS="z"><TD CLASS="l">56</TD><TD>                if (left &lt; originalRight)</TD></TR><TR CLASS="z"><TD CLASS="l">57</TD><TD>                        sortedCollection = quickSort(sortedCollection, left, originalRight);</TD></TR><TR><TD CLASS="l">58</TD><TD> </TD></TR><TR CLASS="z"><TD CLASS="l">59</TD><TD>                return sortedCollection;</TD></TR><TR><TD CLASS="l">60</TD><TD>        }</TD></TR><TR><TD CLASS="l">61</TD><TD> </TD></TR><TR><TD CLASS="l">62</TD><TD>        /**</TD></TR><TR><TD CLASS="l"><A NAME="3">63</A></TD><TD>         * Return a new sorted collection from this unsorted collection. Sort</TD></TR><TR><TD CLASS="l">64</TD><TD>         * using quick sort.</TD></TR><TR><TD CLASS="l">65</TD><TD>         */</TD></TR><TR><TD CLASS="l">66</TD><TD>        public Object[] sort(Object[] unSortedCollection) {</TD></TR><TR CLASS="z"><TD CLASS="l">67</TD><TD>                int size = unSortedCollection.length;</TD></TR><TR CLASS="z"><TD CLASS="l">68</TD><TD>                Object[] sortedCollection = new Object[size];</TD></TR><TR><TD CLASS="l">69</TD><TD> </TD></TR><TR><TD CLASS="l">70</TD><TD>                //copy the array so can return a new sorted collection</TD></TR><TR CLASS="z"><TD CLASS="l">71</TD><TD>                System.arraycopy(unSortedCollection, 0, sortedCollection, 0, size);</TD></TR><TR CLASS="z"><TD CLASS="l">72</TD><TD>                if (size &gt; 1)</TD></TR><TR CLASS="z"><TD CLASS="l">73</TD><TD>                        quickSort(sortedCollection, 0, size - 1);</TD></TR><TR><TD CLASS="l">74</TD><TD> </TD></TR><TR CLASS="z"><TD CLASS="l">75</TD><TD>                return sortedCollection;</TD></TR><TR><TD CLASS="l">76</TD><TD>        }</TD></TR><TR><TD CLASS="l">77</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="6f.html">org.eclipse.wst.sse.core.internal.util</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>