diff options
Diffstat (limited to 'tests/org.eclipse.wst.xml.xpath2.processor.tests/coverageReport/_files/d9a.html')
| -rw-r--r-- | tests/org.eclipse.wst.xml.xpath2.processor.tests/coverageReport/_files/d9a.html | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/tests/org.eclipse.wst.xml.xpath2.processor.tests/coverageReport/_files/d9a.html b/tests/org.eclipse.wst.xml.xpath2.processor.tests/coverageReport/_files/d9a.html deleted file mode 100644 index 7ca0e6a2..00000000 --- a/tests/org.eclipse.wst.xml.xpath2.processor.tests/coverageReport/_files/d9a.html +++ /dev/null @@ -1 +0,0 @@ -<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 Tue Jun 09 19:59:05 GMT 2009)</TH></TR><TR><TD CLASS="nv">[<A HREF="../xslUnitTestCoverage.html">all classes</A>][<A HREF="13a.html">org.eclipse.wst.jsdt.internal.corext.refactoring</A>]</TD></TR></TABLE><H2>COVERAGE SUMMARY FOR SOURCE FILE [<SPAN CLASS="in">RefactoringSearchEngine2.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>RefactoringSearchEngine2.java</TD><TD CLASS="h">0% (0/5)</TD><TD CLASS="h">0% (0/45)</TD><TD CLASS="h">0% (0/1163)</TD><TD CLASS="h">0% (0/282)</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">RefactoringSearchEngine2</A></TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/29)</TD><TD CLASS="h">0% (0/895)</TD><TD CLASS="h">0% (0/225)</TD></TR><TR><TD CLASS="f"><A HREF="#0">RefactoringSearchEngine2 (): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/45)</TD><TD CLASS="h">0% (0/14)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2">RefactoringSearchEngine2 (SearchPattern): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/50)</TD><TD CLASS="h">0% (0/16)</TD></TR><TR><TD CLASS="f"><A HREF="#3">clearResults (): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/9)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#4">getAffectedCompilationUnits (): IJavaScriptUnit []</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/54)</TD><TD CLASS="h">0% (0/12)</TD></TR><TR><TD CLASS="f"><A HREF="#5">getAffectedProjects (): Map</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/102)</TD><TD CLASS="h">0% (0/28)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#6">getCollector (): RefactoringSearchEngine2$RefactoringSearchCollector</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/33)</TD><TD CLASS="h">0% (0/7)</TD></TR><TR><TD CLASS="f"><A HREF="#7">getGroupedMatches (): SearchResultGroup []</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/111)</TD><TD CLASS="h">0% (0/24)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#8">getPattern (): SearchPattern</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">getResults (): Object []</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/16)</TD><TD CLASS="h">0% (0/5)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#a">getSearchMatches (): Collection</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/42)</TD><TD CLASS="h">0% (0/11)</TD></TR><TR><TD CLASS="f"><A HREF="#b">getStatus (): RefactoringStatus</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="#c">getUngroupedMatches (): SearchMatch []</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/49)</TD><TD CLASS="h">0% (0/13)</TD></TR><TR><TD CLASS="f"><A HREF="#d">searchPattern (IProgressMonitor): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/60)</TD><TD CLASS="h">0% (0/14)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#e">searchReferencedFields (IJavaScriptElement, IProgressMonitor): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/55)</TD><TD CLASS="h">0% (0/14)</TD></TR><TR><TD CLASS="f"><A HREF="#f">searchReferencedMethods (IJavaScriptElement, IProgressMonitor): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/55)</TD><TD CLASS="h">0% (0/14)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#10">searchReferencedTypes (IJavaScriptElement, IProgressMonitor): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/55)</TD><TD CLASS="h">0% (0/14)</TD></TR><TR><TD CLASS="f"><A HREF="#11">setAndPattern (SearchPattern, SearchPattern): 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="#12">setFiltering (boolean, boolean): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/7)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR><TD CLASS="f"><A HREF="#13">setGranularity (int): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/15)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#14">setGrouping (boolean): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/4)</TD><TD CLASS="h">0% (0/2)</TD></TR><TR><TD CLASS="f"><A HREF="#15">setOrPattern (SearchPattern, SearchPattern): 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="#16">setOwner (WorkingCopyOwner): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/4)</TD><TD CLASS="h">0% (0/2)</TD></TR><TR><TD CLASS="f"><A HREF="#17">setPattern (IJavaScriptElement [], int): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/42)</TD><TD CLASS="h">0% (0/9)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#18">setPattern (SearchPattern): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/6)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR><TD CLASS="f"><A HREF="#19">setRequestor (IRefactoringSearchRequestor): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/6)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#1a">setScope (IJavaScriptSearchScope): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/6)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR><TD CLASS="f"><A HREF="#1b">setSeverity (int): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/21)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#1c">setStatus (RefactoringStatus): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/6)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR><TD CLASS="f"><A HREF="#1d">setWorkingCopies (IJavaScriptUnit []): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/16)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD></TR><TR CLASS="cis"><TD CLASS="f">class <A HREF="#1e">RefactoringSearchEngine2$DefaultSearchRequestor</A></TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/2)</TD><TD CLASS="h">0% (0/5)</TD><TD CLASS="h">0% (0/2)</TD></TR><TR><TD CLASS="f"><A HREF="#1e">RefactoringSearchEngine2$DefaultSearchRequestor (): 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="#20">acceptSearchMatch (SearchMatch): SearchMatch</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="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD></TR><TR CLASS="cis"><TD CLASS="f">class <A HREF="#21">RefactoringSearchEngine2$RefactoringCompilationUnitCollector</A></TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/6)</TD><TD CLASS="h">0% (0/96)</TD><TD CLASS="h">0% (0/21)</TD></TR><TR><TD CLASS="f"><A HREF="#21">RefactoringSearchEngine2$RefactoringCompilationUnitCollector (RefactoringSear...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/18)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#23">acceptSearchMatch (SearchMatch): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/61)</TD><TD CLASS="h">0% (0/11)</TD></TR><TR><TD CLASS="f"><A HREF="#24">clearResults (): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/9)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#25">getBinaryResources (): Collection</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="#26">getCollectedMatches (): Collection</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="#27">getInaccurateMatches (): Collection</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="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD></TR><TR CLASS="cis"><TD CLASS="f">class <A HREF="#28">RefactoringSearchEngine2$RefactoringSearchCollector</A></TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/2)</TD><TD CLASS="h">0% (0/13)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR><TD CLASS="f"><A HREF="#28">RefactoringSearchEngine2$RefactoringSearchCollector (RefactoringSearchEngine2...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/9)</TD><TD CLASS="h">0% (0/2)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2a">clearResults (): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/4)</TD><TD CLASS="h">0% (0/2)</TD></TR><TR><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD><TD CLASS="bt"> </TD></TR><TR CLASS="cis"><TD CLASS="f">class <A HREF="#2b">RefactoringSearchEngine2$RefactoringSearchMatchCollector</A></TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/6)</TD><TD CLASS="h">0% (0/154)</TD><TD CLASS="h">0% (0/30)</TD></TR><TR><TD CLASS="f"><A HREF="#2b">RefactoringSearchEngine2$RefactoringSearchMatchCollector (RefactoringSearchEn...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/23)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2d">acceptSearchMatch (SearchMatch): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/110)</TD><TD CLASS="h">0% (0/18)</TD></TR><TR><TD CLASS="f"><A HREF="#2e">clearResults (): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/12)</TD><TD CLASS="h">0% (0/5)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2f">getBinaryResources (): Collection</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="#30">getCollectedMatches (): Collection</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="#31">getInaccurateMatches (): Collection</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></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) 2000, 2008 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> *******************************************************************************/</TD></TR><TR><TD CLASS="l">11</TD><TD>package org.eclipse.wst.jsdt.internal.corext.refactoring;</TD></TR><TR><TD CLASS="l">12</TD><TD> </TD></TR><TR><TD CLASS="l">13</TD><TD>import java.util.ArrayList;</TD></TR><TR><TD CLASS="l">14</TD><TD>import java.util.Collection;</TD></TR><TR><TD CLASS="l">15</TD><TD>import java.util.Collections;</TD></TR><TR><TD CLASS="l">16</TD><TD>import java.util.HashMap;</TD></TR><TR><TD CLASS="l">17</TD><TD>import java.util.HashSet;</TD></TR><TR><TD CLASS="l">18</TD><TD>import java.util.Iterator;</TD></TR><TR><TD CLASS="l">19</TD><TD>import java.util.LinkedList;</TD></TR><TR><TD CLASS="l">20</TD><TD>import java.util.List;</TD></TR><TR><TD CLASS="l">21</TD><TD>import java.util.Map;</TD></TR><TR><TD CLASS="l">22</TD><TD>import java.util.Set;</TD></TR><TR><TD CLASS="l">23</TD><TD> </TD></TR><TR><TD CLASS="l">24</TD><TD>import org.eclipse.core.resources.IProject;</TD></TR><TR><TD CLASS="l">25</TD><TD>import org.eclipse.core.resources.IResource;</TD></TR><TR><TD CLASS="l">26</TD><TD>import org.eclipse.core.runtime.Assert;</TD></TR><TR><TD CLASS="l">27</TD><TD>import org.eclipse.core.runtime.CoreException;</TD></TR><TR><TD CLASS="l">28</TD><TD>import org.eclipse.core.runtime.IProgressMonitor;</TD></TR><TR><TD CLASS="l">29</TD><TD>import org.eclipse.core.runtime.SubProgressMonitor;</TD></TR><TR><TD CLASS="l">30</TD><TD>import org.eclipse.ltk.core.refactoring.RefactoringStatus;</TD></TR><TR><TD CLASS="l">31</TD><TD>import org.eclipse.ltk.core.refactoring.RefactoringStatusEntry;</TD></TR><TR><TD CLASS="l">32</TD><TD>import org.eclipse.wst.jsdt.core.IJavaScriptUnit;</TD></TR><TR><TD CLASS="l">33</TD><TD>import org.eclipse.wst.jsdt.core.IJavaScriptElement;</TD></TR><TR><TD CLASS="l">34</TD><TD>import org.eclipse.wst.jsdt.core.IJavaScriptProject;</TD></TR><TR><TD CLASS="l">35</TD><TD>import org.eclipse.wst.jsdt.core.JavaScriptCore;</TD></TR><TR><TD CLASS="l">36</TD><TD>import org.eclipse.wst.jsdt.core.JavaScriptModelException;</TD></TR><TR><TD CLASS="l">37</TD><TD>import org.eclipse.wst.jsdt.core.WorkingCopyOwner;</TD></TR><TR><TD CLASS="l">38</TD><TD>import org.eclipse.wst.jsdt.core.search.IJavaScriptSearchScope;</TD></TR><TR><TD CLASS="l">39</TD><TD>import org.eclipse.wst.jsdt.core.search.SearchEngine;</TD></TR><TR><TD CLASS="l">40</TD><TD>import org.eclipse.wst.jsdt.core.search.SearchMatch;</TD></TR><TR><TD CLASS="l">41</TD><TD>import org.eclipse.wst.jsdt.core.search.SearchPattern;</TD></TR><TR><TD CLASS="l">42</TD><TD>import org.eclipse.wst.jsdt.core.search.SearchRequestor;</TD></TR><TR><TD CLASS="l">43</TD><TD>import org.eclipse.wst.jsdt.internal.corext.util.Messages;</TD></TR><TR><TD CLASS="l">44</TD><TD>import org.eclipse.wst.jsdt.internal.corext.util.SearchUtils;</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> * Helper class to use the search engine in refactorings.</TD></TR><TR><TD CLASS="l">48</TD><TD> * </TD></TR><TR><TD CLASS="l">49</TD><TD> * </TD></TR><TR><TD CLASS="l"><A NAME="1e">50</A></TD><TD> */</TD></TR><TR><TD CLASS="l">51</TD><TD>public final class RefactoringSearchEngine2 {</TD></TR><TR><TD CLASS="l">52</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="20">53</A></TD><TD> /** Default implementation of a search requestor */</TD></TR><TR CLASS="z"><TD CLASS="l">54</TD><TD> private static class DefaultSearchRequestor implements IRefactoringSearchRequestor {</TD></TR><TR><TD CLASS="l">55</TD><TD> </TD></TR><TR><TD CLASS="l">56</TD><TD> public final SearchMatch acceptSearchMatch(final SearchMatch match) {</TD></TR><TR CLASS="z"><TD CLASS="l">57</TD><TD> return match;</TD></TR><TR><TD CLASS="l"><A NAME="21">58</A></TD><TD> }</TD></TR><TR><TD CLASS="l">59</TD><TD> }</TD></TR><TR><TD CLASS="l">60</TD><TD> </TD></TR><TR><TD CLASS="l">61</TD><TD> /** Search requestor which only collects compilation units */</TD></TR><TR CLASS="z"><TD CLASS="l">62</TD><TD> private class RefactoringCompilationUnitCollector extends RefactoringSearchCollector {</TD></TR><TR><TD CLASS="l">63</TD><TD> </TD></TR><TR><TD CLASS="l">64</TD><TD> /** The collected compilation units */</TD></TR><TR CLASS="z"><TD CLASS="l">65</TD><TD> private final Set fCollectedUnits= new HashSet();</TD></TR><TR><TD CLASS="l">66</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="23">67</A></TD><TD> /** The inaccurate matches */</TD></TR><TR CLASS="z"><TD CLASS="l">68</TD><TD> private final Set fInaccurateMatches= new HashSet();</TD></TR><TR><TD CLASS="l">69</TD><TD> </TD></TR><TR><TD CLASS="l">70</TD><TD> public final void acceptSearchMatch(final SearchMatch match) throws CoreException {</TD></TR><TR CLASS="z"><TD CLASS="l">71</TD><TD> final SearchMatch accepted= fRequestor.acceptSearchMatch(match);</TD></TR><TR CLASS="z"><TD CLASS="l">72</TD><TD> if (accepted != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">73</TD><TD> final IResource resource= accepted.getResource();</TD></TR><TR CLASS="z"><TD CLASS="l">74</TD><TD> if (!resource.equals(fLastResource)) {</TD></TR><TR CLASS="z"><TD CLASS="l">75</TD><TD> final IJavaScriptElement element= JavaScriptCore.create(resource);</TD></TR><TR CLASS="z"><TD CLASS="l">76</TD><TD> if (element instanceof IJavaScriptUnit)</TD></TR><TR CLASS="z"><TD CLASS="l">77</TD><TD> fCollectedUnits.add(element);</TD></TR><TR><TD CLASS="l">78</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">79</TD><TD> if (fInaccurate && accepted.getAccuracy() == SearchMatch.A_INACCURATE && !fInaccurateMatches.contains(accepted)) {</TD></TR><TR CLASS="z"><TD CLASS="l">80</TD><TD> fStatus.addEntry(fSeverity, Messages.format(RefactoringCoreMessages.RefactoringSearchEngine_inaccurate_match, accepted.getResource().getName()), null, null, RefactoringStatusEntry.NO_CODE); </TD></TR><TR CLASS="z"><TD CLASS="l">81</TD><TD> fInaccurateMatches.add(accepted);</TD></TR><TR><TD CLASS="l">82</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="24">83</A></TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">84</TD><TD> }</TD></TR><TR><TD CLASS="l">85</TD><TD> </TD></TR><TR><TD CLASS="l">86</TD><TD> public final void clearResults() {</TD></TR><TR CLASS="z"><TD CLASS="l">87</TD><TD> super.clearResults();</TD></TR><TR CLASS="z"><TD CLASS="l">88</TD><TD> fCollectedUnits.clear();</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="25">89</A></TD><TD> fInaccurateMatches.clear();</TD></TR><TR CLASS="z"><TD CLASS="l">90</TD><TD> }</TD></TR><TR><TD CLASS="l">91</TD><TD> </TD></TR><TR><TD CLASS="l">92</TD><TD> public final Collection getBinaryResources() {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="26">93</A></TD><TD> return Collections.EMPTY_SET;</TD></TR><TR><TD CLASS="l">94</TD><TD> }</TD></TR><TR><TD CLASS="l">95</TD><TD> </TD></TR><TR><TD CLASS="l">96</TD><TD> public final Collection getCollectedMatches() {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="27">97</A></TD><TD> return fCollectedUnits;</TD></TR><TR><TD CLASS="l">98</TD><TD> }</TD></TR><TR><TD CLASS="l">99</TD><TD> </TD></TR><TR><TD CLASS="l">100</TD><TD> public final Collection getInaccurateMatches() {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="28">101</A></TD><TD> return fInaccurateMatches;</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 CLASS="z"><TD CLASS="l">105</TD><TD> private abstract class RefactoringSearchCollector extends SearchRequestor {</TD></TR><TR><TD CLASS="l"><A NAME="2a">106</A></TD><TD> </TD></TR><TR CLASS="z"><TD CLASS="l">107</TD><TD> protected IResource fLastResource= null;</TD></TR><TR><TD CLASS="l">108</TD><TD> </TD></TR><TR><TD CLASS="l">109</TD><TD> public void clearResults() {</TD></TR><TR CLASS="z"><TD CLASS="l">110</TD><TD> fLastResource= null;</TD></TR><TR CLASS="z"><TD CLASS="l">111</TD><TD> }</TD></TR><TR><TD CLASS="l">112</TD><TD> </TD></TR><TR><TD CLASS="l">113</TD><TD> public abstract Collection getBinaryResources();</TD></TR><TR><TD CLASS="l">114</TD><TD> </TD></TR><TR><TD CLASS="l">115</TD><TD> public abstract Collection getCollectedMatches();</TD></TR><TR><TD CLASS="l">116</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="2b">117</A></TD><TD> public abstract Collection getInaccurateMatches();</TD></TR><TR><TD CLASS="l">118</TD><TD> }</TD></TR><TR><TD CLASS="l">119</TD><TD> </TD></TR><TR><TD CLASS="l">120</TD><TD> /** Search requestor which collects every search match */</TD></TR><TR CLASS="z"><TD CLASS="l">121</TD><TD> private class RefactoringSearchMatchCollector extends RefactoringSearchCollector {</TD></TR><TR><TD CLASS="l">122</TD><TD> </TD></TR><TR><TD CLASS="l">123</TD><TD> /** The binary resources */</TD></TR><TR CLASS="z"><TD CLASS="l">124</TD><TD> private final Set fBinaryResources= new HashSet();</TD></TR><TR><TD CLASS="l">125</TD><TD> </TD></TR><TR><TD CLASS="l">126</TD><TD> /** The collected matches */</TD></TR><TR CLASS="z"><TD CLASS="l">127</TD><TD> private final List fCollectedMatches= new ArrayList();</TD></TR><TR><TD CLASS="l">128</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="2d">129</A></TD><TD> /** The inaccurate matches */</TD></TR><TR CLASS="z"><TD CLASS="l">130</TD><TD> private final Set fInaccurateMatches= new HashSet();</TD></TR><TR><TD CLASS="l">131</TD><TD> </TD></TR><TR><TD CLASS="l">132</TD><TD> public final void acceptSearchMatch(final SearchMatch match) throws CoreException {</TD></TR><TR CLASS="z"><TD CLASS="l">133</TD><TD> final SearchMatch accepted= fRequestor.acceptSearchMatch(match);</TD></TR><TR CLASS="z"><TD CLASS="l">134</TD><TD> if (accepted != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">135</TD><TD> fCollectedMatches.add(accepted);</TD></TR><TR CLASS="z"><TD CLASS="l">136</TD><TD> final IResource resource= accepted.getResource();</TD></TR><TR CLASS="z"><TD CLASS="l">137</TD><TD> if (!resource.equals(fLastResource)) {</TD></TR><TR CLASS="z"><TD CLASS="l">138</TD><TD> if (fBinary) {</TD></TR><TR CLASS="z"><TD CLASS="l">139</TD><TD> final IJavaScriptElement element= JavaScriptCore.create(resource);</TD></TR><TR CLASS="z"><TD CLASS="l">140</TD><TD> if (!(element instanceof IJavaScriptUnit)) {</TD></TR><TR CLASS="z"><TD CLASS="l">141</TD><TD> final IProject project= resource.getProject();</TD></TR><TR CLASS="z"><TD CLASS="l">142</TD><TD> if (!fGrouping)</TD></TR><TR CLASS="z"><TD CLASS="l">143</TD><TD> fStatus.addEntry(fSeverity, Messages.format(RefactoringCoreMessages.RefactoringSearchEngine_binary_match_ungrouped, project.getName()), null, null, RefactoringStatusEntry.NO_CODE); </TD></TR><TR CLASS="z"><TD CLASS="l">144</TD><TD> else if (!fBinaryResources.contains(resource))</TD></TR><TR CLASS="z"><TD CLASS="l">145</TD><TD> fStatus.addEntry(fSeverity, Messages.format(RefactoringCoreMessages.RefactoringSearchEngine_binary_match_grouped, project.getName()), null, null, RefactoringStatusEntry.NO_CODE); </TD></TR><TR CLASS="z"><TD CLASS="l">146</TD><TD> fBinaryResources.add(resource);</TD></TR><TR><TD CLASS="l">147</TD><TD> }</TD></TR><TR><TD CLASS="l">148</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">149</TD><TD> if (fInaccurate && accepted.getAccuracy() == SearchMatch.A_INACCURATE && !fInaccurateMatches.contains(accepted)) {</TD></TR><TR CLASS="z"><TD CLASS="l">150</TD><TD> fStatus.addEntry(fSeverity, Messages.format(RefactoringCoreMessages.RefactoringSearchEngine_inaccurate_match, resource.getName()), null, null, RefactoringStatusEntry.NO_CODE); </TD></TR><TR CLASS="z"><TD CLASS="l">151</TD><TD> fInaccurateMatches.add(accepted);</TD></TR><TR><TD CLASS="l">152</TD><TD> }</TD></TR><TR><TD CLASS="l">153</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="2e">154</A></TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">155</TD><TD> }</TD></TR><TR><TD CLASS="l">156</TD><TD> </TD></TR><TR><TD CLASS="l">157</TD><TD> public final void clearResults() {</TD></TR><TR CLASS="z"><TD CLASS="l">158</TD><TD> super.clearResults();</TD></TR><TR CLASS="z"><TD CLASS="l">159</TD><TD> fCollectedMatches.clear();</TD></TR><TR CLASS="z"><TD CLASS="l">160</TD><TD> fInaccurateMatches.clear();</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="2f">161</A></TD><TD> fBinaryResources.clear();</TD></TR><TR CLASS="z"><TD CLASS="l">162</TD><TD> }</TD></TR><TR><TD CLASS="l">163</TD><TD> </TD></TR><TR><TD CLASS="l">164</TD><TD> public final Collection getBinaryResources() {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="30">165</A></TD><TD> return fBinaryResources;</TD></TR><TR><TD CLASS="l">166</TD><TD> }</TD></TR><TR><TD CLASS="l">167</TD><TD> </TD></TR><TR><TD CLASS="l">168</TD><TD> public final Collection getCollectedMatches() {</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="31">169</A></TD><TD> return fCollectedMatches;</TD></TR><TR><TD CLASS="l">170</TD><TD> }</TD></TR><TR><TD CLASS="l">171</TD><TD> </TD></TR><TR><TD CLASS="l">172</TD><TD> public final Collection getInaccurateMatches() {</TD></TR><TR CLASS="z"><TD CLASS="l">173</TD><TD> return fInaccurateMatches;</TD></TR><TR><TD CLASS="l">174</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> /** The compilation unit granularity */</TD></TR><TR><TD CLASS="l">178</TD><TD> public static final int GRANULARITY_COMPILATION_UNIT= 2;</TD></TR><TR><TD CLASS="l">179</TD><TD> </TD></TR><TR><TD CLASS="l">180</TD><TD> /** The search match granularity */</TD></TR><TR><TD CLASS="l">181</TD><TD> public static final int GRANULARITY_SEARCH_MATCH= 1;</TD></TR><TR><TD CLASS="l">182</TD><TD> </TD></TR><TR><TD CLASS="l">183</TD><TD> /** Should binary matches be filtered? */</TD></TR><TR CLASS="z"><TD CLASS="l">184</TD><TD> private boolean fBinary= false;</TD></TR><TR><TD CLASS="l">185</TD><TD> </TD></TR><TR><TD CLASS="l">186</TD><TD> /** The refactoring search collector */</TD></TR><TR CLASS="z"><TD CLASS="l">187</TD><TD> private RefactoringSearchCollector fCollector= null;</TD></TR><TR><TD CLASS="l">188</TD><TD> </TD></TR><TR><TD CLASS="l">189</TD><TD> /** The search granularity */</TD></TR><TR CLASS="z"><TD CLASS="l">190</TD><TD> private int fGranularity= GRANULARITY_SEARCH_MATCH;</TD></TR><TR><TD CLASS="l">191</TD><TD> </TD></TR><TR><TD CLASS="l">192</TD><TD> /** Should the matches be grouped by resource? */</TD></TR><TR CLASS="z"><TD CLASS="l">193</TD><TD> private boolean fGrouping= true;</TD></TR><TR><TD CLASS="l">194</TD><TD> </TD></TR><TR><TD CLASS="l">195</TD><TD> /** Should inaccurate matches be filtered? */</TD></TR><TR CLASS="z"><TD CLASS="l">196</TD><TD> private boolean fInaccurate= true;</TD></TR><TR><TD CLASS="l">197</TD><TD> </TD></TR><TR><TD CLASS="l">198</TD><TD> /** The working copy owner, or <code>null</code> */</TD></TR><TR CLASS="z"><TD CLASS="l">199</TD><TD> private WorkingCopyOwner fOwner= null;</TD></TR><TR><TD CLASS="l">200</TD><TD> </TD></TR><TR><TD CLASS="l">201</TD><TD> /** The search pattern, or <code>null</code> */</TD></TR><TR CLASS="z"><TD CLASS="l">202</TD><TD> private SearchPattern fPattern= null;</TD></TR><TR><TD CLASS="l">203</TD><TD> </TD></TR><TR><TD CLASS="l">204</TD><TD> /** The search requestor */</TD></TR><TR CLASS="z"><TD CLASS="l">205</TD><TD> private IRefactoringSearchRequestor fRequestor= new DefaultSearchRequestor();</TD></TR><TR><TD CLASS="l">206</TD><TD> </TD></TR><TR><TD CLASS="l">207</TD><TD> /** The search scope */</TD></TR><TR CLASS="z"><TD CLASS="l">208</TD><TD> private IJavaScriptSearchScope fScope= SearchEngine.createWorkspaceScope();</TD></TR><TR><TD CLASS="l">209</TD><TD> </TD></TR><TR><TD CLASS="l">210</TD><TD> /** The severity */</TD></TR><TR CLASS="z"><TD CLASS="l">211</TD><TD> private int fSeverity= RefactoringStatus.WARNING;</TD></TR><TR><TD CLASS="l">212</TD><TD> </TD></TR><TR><TD CLASS="l">213</TD><TD> /** The search status */</TD></TR><TR CLASS="z"><TD CLASS="l">214</TD><TD> private RefactoringStatus fStatus= new RefactoringStatus();</TD></TR><TR><TD CLASS="l">215</TD><TD> </TD></TR><TR><TD CLASS="l">216</TD><TD> /** The working copies */</TD></TR><TR CLASS="z"><TD CLASS="l">217</TD><TD> private IJavaScriptUnit[] fWorkingCopies= {};</TD></TR><TR><TD CLASS="l"><A NAME="0">218</A></TD><TD> </TD></TR><TR><TD CLASS="l">219</TD><TD> /**</TD></TR><TR><TD CLASS="l">220</TD><TD> * Creates a new refactoring search engine.</TD></TR><TR><TD CLASS="l">221</TD><TD> */</TD></TR><TR CLASS="z"><TD CLASS="l">222</TD><TD> public RefactoringSearchEngine2() {</TD></TR><TR><TD CLASS="l">223</TD><TD> // Do nothing</TD></TR><TR CLASS="z"><TD CLASS="l">224</TD><TD> }</TD></TR><TR><TD CLASS="l">225</TD><TD> </TD></TR><TR><TD CLASS="l">226</TD><TD> /**</TD></TR><TR><TD CLASS="l"><A NAME="2">227</A></TD><TD> * Creates a new refactoring search engine.</TD></TR><TR><TD CLASS="l">228</TD><TD> * </TD></TR><TR><TD CLASS="l">229</TD><TD> * @param pattern the search pattern</TD></TR><TR><TD CLASS="l">230</TD><TD> */</TD></TR><TR CLASS="z"><TD CLASS="l">231</TD><TD> public RefactoringSearchEngine2(final SearchPattern pattern) {</TD></TR><TR CLASS="z"><TD CLASS="l">232</TD><TD> Assert.isNotNull(pattern);</TD></TR><TR CLASS="z"><TD CLASS="l">233</TD><TD> fPattern= pattern;</TD></TR><TR CLASS="z"><TD CLASS="l">234</TD><TD> }</TD></TR><TR><TD CLASS="l">235</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="3">236</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">237</TD><TD> * Clears all results found so far, and sets resets the status to {@link RefactoringStatus#OK}.</TD></TR><TR><TD CLASS="l">238</TD><TD> */</TD></TR><TR><TD CLASS="l">239</TD><TD> public final void clearResults() {</TD></TR><TR CLASS="z"><TD CLASS="l">240</TD><TD> getCollector().clearResults();</TD></TR><TR CLASS="z"><TD CLASS="l">241</TD><TD> fStatus= new RefactoringStatus();</TD></TR><TR CLASS="z"><TD CLASS="l">242</TD><TD> }</TD></TR><TR><TD CLASS="l">243</TD><TD> </TD></TR><TR><TD CLASS="l">244</TD><TD> /**</TD></TR><TR><TD CLASS="l">245</TD><TD> * Returns the affected compilation units of the previous search queries.</TD></TR><TR><TD CLASS="l">246</TD><TD> * <p></TD></TR><TR><TD CLASS="l">247</TD><TD> * In order to retrieve the compilation units, grouping by resource must have been enabled before searching.</TD></TR><TR><TD CLASS="l"><A NAME="4">248</A></TD><TD> * </TD></TR><TR><TD CLASS="l">249</TD><TD> * @return the compilation units of the previous queries</TD></TR><TR><TD CLASS="l">250</TD><TD> */</TD></TR><TR><TD CLASS="l">251</TD><TD> public final IJavaScriptUnit[] getAffectedCompilationUnits() {</TD></TR><TR CLASS="z"><TD CLASS="l">252</TD><TD> if (fGranularity == GRANULARITY_COMPILATION_UNIT) {</TD></TR><TR CLASS="z"><TD CLASS="l">253</TD><TD> final Collection collection= getCollector().getCollectedMatches();</TD></TR><TR CLASS="z"><TD CLASS="l">254</TD><TD> final IJavaScriptUnit[] units= new IJavaScriptUnit[collection.size()];</TD></TR><TR CLASS="z"><TD CLASS="l">255</TD><TD> int index= 0;</TD></TR><TR CLASS="z"><TD CLASS="l">256</TD><TD> for (final Iterator iterator= collection.iterator(); iterator.hasNext(); index++)</TD></TR><TR CLASS="z"><TD CLASS="l">257</TD><TD> units[index]= (IJavaScriptUnit) iterator.next();</TD></TR><TR CLASS="z"><TD CLASS="l">258</TD><TD> return units;</TD></TR><TR><TD CLASS="l">259</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">260</TD><TD> final SearchResultGroup[] groups= getGroupedMatches();</TD></TR><TR CLASS="z"><TD CLASS="l">261</TD><TD> final IJavaScriptUnit[] units= new IJavaScriptUnit[groups.length];</TD></TR><TR CLASS="z"><TD CLASS="l">262</TD><TD> for (int index= 0; index < groups.length; index++)</TD></TR><TR CLASS="z"><TD CLASS="l">263</TD><TD> units[index]= groups[index].getCompilationUnit();</TD></TR><TR CLASS="z"><TD CLASS="l">264</TD><TD> return units;</TD></TR><TR><TD CLASS="l">265</TD><TD> }</TD></TR><TR><TD CLASS="l">266</TD><TD> }</TD></TR><TR><TD CLASS="l">267</TD><TD> </TD></TR><TR><TD CLASS="l">268</TD><TD> /**</TD></TR><TR><TD CLASS="l">269</TD><TD> * Returns the affected java projects of the previous search queries.</TD></TR><TR><TD CLASS="l">270</TD><TD> * <p></TD></TR><TR><TD CLASS="l">271</TD><TD> * In order to retrieve the java projects, grouping by resource must have been enabled before searching.</TD></TR><TR><TD CLASS="l"><A NAME="5">272</A></TD><TD> * </TD></TR><TR><TD CLASS="l">273</TD><TD> * @return the java projects of the previous queries (element type: <code>&ltIJavaProject, Collection&ltSearchResultGroup&gt&gt</code>)</TD></TR><TR><TD CLASS="l">274</TD><TD> */</TD></TR><TR><TD CLASS="l">275</TD><TD> public final Map getAffectedProjects() {</TD></TR><TR CLASS="z"><TD CLASS="l">276</TD><TD> final Map map= new HashMap();</TD></TR><TR CLASS="z"><TD CLASS="l">277</TD><TD> IJavaScriptProject project= null;</TD></TR><TR CLASS="z"><TD CLASS="l">278</TD><TD> IJavaScriptUnit unit= null;</TD></TR><TR CLASS="z"><TD CLASS="l">279</TD><TD> if (fGranularity == GRANULARITY_COMPILATION_UNIT) {</TD></TR><TR CLASS="z"><TD CLASS="l">280</TD><TD> final IJavaScriptUnit[] units= getAffectedCompilationUnits();</TD></TR><TR CLASS="z"><TD CLASS="l">281</TD><TD> for (int index= 0; index < units.length; index++) {</TD></TR><TR CLASS="z"><TD CLASS="l">282</TD><TD> unit= units[index];</TD></TR><TR CLASS="z"><TD CLASS="l">283</TD><TD> project= unit.getJavaScriptProject();</TD></TR><TR CLASS="z"><TD CLASS="l">284</TD><TD> if (project != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">285</TD><TD> Set set= (Set) map.get(project);</TD></TR><TR CLASS="z"><TD CLASS="l">286</TD><TD> if (set == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">287</TD><TD> set= new HashSet();</TD></TR><TR CLASS="z"><TD CLASS="l">288</TD><TD> map.put(project, set);</TD></TR><TR><TD CLASS="l">289</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">290</TD><TD> set.add(unit);</TD></TR><TR><TD CLASS="l">291</TD><TD> }</TD></TR><TR><TD CLASS="l">292</TD><TD> }</TD></TR><TR><TD CLASS="l">293</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">294</TD><TD> final SearchResultGroup[] groups= getGroupedMatches();</TD></TR><TR CLASS="z"><TD CLASS="l">295</TD><TD> SearchResultGroup group= null;</TD></TR><TR CLASS="z"><TD CLASS="l">296</TD><TD> for (int index= 0; index < groups.length; index++) {</TD></TR><TR CLASS="z"><TD CLASS="l">297</TD><TD> group= groups[index];</TD></TR><TR CLASS="z"><TD CLASS="l">298</TD><TD> unit= group.getCompilationUnit();</TD></TR><TR CLASS="z"><TD CLASS="l">299</TD><TD> if (unit != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">300</TD><TD> project= unit.getJavaScriptProject();</TD></TR><TR CLASS="z"><TD CLASS="l">301</TD><TD> if (project != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">302</TD><TD> Set set= (Set) map.get(project);</TD></TR><TR CLASS="z"><TD CLASS="l">303</TD><TD> if (set == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">304</TD><TD> set= new HashSet();</TD></TR><TR CLASS="z"><TD CLASS="l">305</TD><TD> map.put(project, set);</TD></TR><TR><TD CLASS="l">306</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">307</TD><TD> set.add(group);</TD></TR><TR><TD CLASS="l">308</TD><TD> }</TD></TR><TR><TD CLASS="l">309</TD><TD> }</TD></TR><TR><TD CLASS="l">310</TD><TD> }</TD></TR><TR><TD CLASS="l">311</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">312</TD><TD> return map;</TD></TR><TR><TD CLASS="l">313</TD><TD> }</TD></TR><TR><TD CLASS="l">314</TD><TD> </TD></TR><TR><TD CLASS="l">315</TD><TD> /**</TD></TR><TR><TD CLASS="l">316</TD><TD> * Returns the refactoring search collector.</TD></TR><TR><TD CLASS="l"><A NAME="6">317</A></TD><TD> * </TD></TR><TR><TD CLASS="l">318</TD><TD> * @return the refactoring search collector</TD></TR><TR><TD CLASS="l">319</TD><TD> */</TD></TR><TR><TD CLASS="l">320</TD><TD> private RefactoringSearchCollector getCollector() {</TD></TR><TR CLASS="z"><TD CLASS="l">321</TD><TD> if (fCollector == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">322</TD><TD> if (fGranularity == GRANULARITY_COMPILATION_UNIT)</TD></TR><TR CLASS="z"><TD CLASS="l">323</TD><TD> fCollector= new RefactoringCompilationUnitCollector();</TD></TR><TR CLASS="z"><TD CLASS="l">324</TD><TD> else if (fGranularity == GRANULARITY_SEARCH_MATCH)</TD></TR><TR CLASS="z"><TD CLASS="l">325</TD><TD> fCollector= new RefactoringSearchMatchCollector();</TD></TR><TR><TD CLASS="l">326</TD><TD> else</TD></TR><TR CLASS="z"><TD CLASS="l">327</TD><TD> Assert.isTrue(false);</TD></TR><TR><TD CLASS="l">328</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">329</TD><TD> return fCollector;</TD></TR><TR><TD CLASS="l">330</TD><TD> }</TD></TR><TR><TD CLASS="l">331</TD><TD> </TD></TR><TR><TD CLASS="l">332</TD><TD> /**</TD></TR><TR><TD CLASS="l">333</TD><TD> * Returns the found search matches in grouped by their containing resource.</TD></TR><TR><TD CLASS="l"><A NAME="7">334</A></TD><TD> * </TD></TR><TR><TD CLASS="l">335</TD><TD> * @return the found search matches</TD></TR><TR><TD CLASS="l">336</TD><TD> */</TD></TR><TR><TD CLASS="l">337</TD><TD> private SearchResultGroup[] getGroupedMatches() {</TD></TR><TR CLASS="z"><TD CLASS="l">338</TD><TD> final Map grouped= new HashMap();</TD></TR><TR CLASS="z"><TD CLASS="l">339</TD><TD> List matches= null;</TD></TR><TR CLASS="z"><TD CLASS="l">340</TD><TD> IResource resource= null;</TD></TR><TR CLASS="z"><TD CLASS="l">341</TD><TD> SearchMatch match= null;</TD></TR><TR CLASS="z"><TD CLASS="l">342</TD><TD> for (final Iterator iterator= getSearchMatches().iterator(); iterator.hasNext();) {</TD></TR><TR CLASS="z"><TD CLASS="l">343</TD><TD> match= (SearchMatch) iterator.next();</TD></TR><TR CLASS="z"><TD CLASS="l">344</TD><TD> resource= match.getResource();</TD></TR><TR CLASS="z"><TD CLASS="l">345</TD><TD> if (!grouped.containsKey(resource))</TD></TR><TR CLASS="z"><TD CLASS="l">346</TD><TD> grouped.put(resource, new ArrayList(4));</TD></TR><TR CLASS="z"><TD CLASS="l">347</TD><TD> matches= (List) grouped.get(resource);</TD></TR><TR CLASS="z"><TD CLASS="l">348</TD><TD> matches.add(match);</TD></TR><TR><TD CLASS="l">349</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">350</TD><TD> if (fBinary) {</TD></TR><TR CLASS="z"><TD CLASS="l">351</TD><TD> final Collection collection= getCollector().getBinaryResources();</TD></TR><TR CLASS="z"><TD CLASS="l">352</TD><TD> for (final Iterator iterator= grouped.keySet().iterator(); iterator.hasNext();) {</TD></TR><TR CLASS="z"><TD CLASS="l">353</TD><TD> resource= (IResource) iterator.next();</TD></TR><TR CLASS="z"><TD CLASS="l">354</TD><TD> if (collection.contains(resource))</TD></TR><TR CLASS="z"><TD CLASS="l">355</TD><TD> iterator.remove();</TD></TR><TR><TD CLASS="l">356</TD><TD> }</TD></TR><TR><TD CLASS="l">357</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">358</TD><TD> final SearchResultGroup[] result= new SearchResultGroup[grouped.keySet().size()];</TD></TR><TR CLASS="z"><TD CLASS="l">359</TD><TD> int index= 0;</TD></TR><TR CLASS="z"><TD CLASS="l">360</TD><TD> for (final Iterator iterator= grouped.keySet().iterator(); iterator.hasNext();) {</TD></TR><TR CLASS="z"><TD CLASS="l">361</TD><TD> resource= (IResource) iterator.next();</TD></TR><TR CLASS="z"><TD CLASS="l">362</TD><TD> matches= (List) grouped.get(resource);</TD></TR><TR CLASS="z"><TD CLASS="l">363</TD><TD> result[index++]= new SearchResultGroup(resource, ((SearchMatch[]) matches.toArray(new SearchMatch[matches.size()])));</TD></TR><TR><TD CLASS="l">364</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">365</TD><TD> return result;</TD></TR><TR><TD CLASS="l">366</TD><TD> }</TD></TR><TR><TD CLASS="l">367</TD><TD> </TD></TR><TR><TD CLASS="l">368</TD><TD> /**</TD></TR><TR><TD CLASS="l">369</TD><TD> * Returns the search pattern currently used for searching.</TD></TR><TR><TD CLASS="l"><A NAME="8">370</A></TD><TD> * </TD></TR><TR><TD CLASS="l">371</TD><TD> * @return the search pattern</TD></TR><TR><TD CLASS="l">372</TD><TD> */</TD></TR><TR><TD CLASS="l">373</TD><TD> public final SearchPattern getPattern() {</TD></TR><TR CLASS="z"><TD CLASS="l">374</TD><TD> return fPattern;</TD></TR><TR><TD CLASS="l">375</TD><TD> }</TD></TR><TR><TD CLASS="l">376</TD><TD> </TD></TR><TR><TD CLASS="l">377</TD><TD> /**</TD></TR><TR><TD CLASS="l">378</TD><TD> * Returns the results of the previous search queries.</TD></TR><TR><TD CLASS="l">379</TD><TD> * <p></TD></TR><TR><TD CLASS="l">380</TD><TD> * The result depends on the following conditions:</TD></TR><TR><TD CLASS="l">381</TD><TD> * <ul></TD></TR><TR><TD CLASS="l">382</TD><TD> * <li>If the search granularity is {@link #GRANULARITY_COMPILATION_UNIT}, the results are elements of type {@link IJavaScriptUnit}.</li></TD></TR><TR><TD CLASS="l">383</TD><TD> * <li>If grouping by resource is enabled, the results are elements of type {@link SearchResultGroup}, otherwise the elements are of type {@link SearchMatch}.</li></TD></TR><TR><TD CLASS="l">384</TD><TD> * </ul></TD></TR><TR><TD CLASS="l"><A NAME="9">385</A></TD><TD> * </TD></TR><TR><TD CLASS="l">386</TD><TD> * @return the results of the previous queries</TD></TR><TR><TD CLASS="l">387</TD><TD> */</TD></TR><TR><TD CLASS="l">388</TD><TD> public final Object[] getResults() {</TD></TR><TR CLASS="z"><TD CLASS="l">389</TD><TD> if (fGranularity == GRANULARITY_COMPILATION_UNIT)</TD></TR><TR CLASS="z"><TD CLASS="l">390</TD><TD> return getAffectedCompilationUnits();</TD></TR><TR><TD CLASS="l">391</TD><TD> else {</TD></TR><TR CLASS="z"><TD CLASS="l">392</TD><TD> if (fGrouping)</TD></TR><TR CLASS="z"><TD CLASS="l">393</TD><TD> return getGroupedMatches();</TD></TR><TR><TD CLASS="l">394</TD><TD> else</TD></TR><TR CLASS="z"><TD CLASS="l">395</TD><TD> return getUngroupedMatches();</TD></TR><TR><TD CLASS="l">396</TD><TD> }</TD></TR><TR><TD CLASS="l">397</TD><TD> }</TD></TR><TR><TD CLASS="l">398</TD><TD> </TD></TR><TR><TD CLASS="l">399</TD><TD> /**</TD></TR><TR><TD CLASS="l">400</TD><TD> * Returns the search matches filtered by their accuracy.</TD></TR><TR><TD CLASS="l"><A NAME="a">401</A></TD><TD> * </TD></TR><TR><TD CLASS="l">402</TD><TD> * @return the filtered search matches</TD></TR><TR><TD CLASS="l">403</TD><TD> */</TD></TR><TR><TD CLASS="l">404</TD><TD> private Collection getSearchMatches() {</TD></TR><TR CLASS="z"><TD CLASS="l">405</TD><TD> Collection results= null;</TD></TR><TR CLASS="z"><TD CLASS="l">406</TD><TD> if (fInaccurate) {</TD></TR><TR CLASS="z"><TD CLASS="l">407</TD><TD> results= new LinkedList(getCollector().getCollectedMatches());</TD></TR><TR CLASS="z"><TD CLASS="l">408</TD><TD> final Collection collection= getCollector().getInaccurateMatches();</TD></TR><TR CLASS="z"><TD CLASS="l">409</TD><TD> SearchMatch match= null;</TD></TR><TR CLASS="z"><TD CLASS="l">410</TD><TD> for (final Iterator iterator= results.iterator(); iterator.hasNext();) {</TD></TR><TR CLASS="z"><TD CLASS="l">411</TD><TD> match= (SearchMatch) iterator.next();</TD></TR><TR CLASS="z"><TD CLASS="l">412</TD><TD> if (collection.contains(match))</TD></TR><TR CLASS="z"><TD CLASS="l">413</TD><TD> iterator.remove();</TD></TR><TR><TD CLASS="l">414</TD><TD> }</TD></TR><TR><TD CLASS="l">415</TD><TD> } else</TD></TR><TR CLASS="z"><TD CLASS="l">416</TD><TD> results= getCollector().getCollectedMatches();</TD></TR><TR CLASS="z"><TD CLASS="l">417</TD><TD> return results;</TD></TR><TR><TD CLASS="l">418</TD><TD> }</TD></TR><TR><TD CLASS="l">419</TD><TD> </TD></TR><TR><TD CLASS="l">420</TD><TD> /**</TD></TR><TR><TD CLASS="l">421</TD><TD> * Returns the refactoring status of this search engine.</TD></TR><TR><TD CLASS="l"><A NAME="b">422</A></TD><TD> * </TD></TR><TR><TD CLASS="l">423</TD><TD> * @return the refactoring status</TD></TR><TR><TD CLASS="l">424</TD><TD> */</TD></TR><TR><TD CLASS="l">425</TD><TD> public final RefactoringStatus getStatus() {</TD></TR><TR CLASS="z"><TD CLASS="l">426</TD><TD> return fStatus;</TD></TR><TR><TD CLASS="l">427</TD><TD> }</TD></TR><TR><TD CLASS="l">428</TD><TD> </TD></TR><TR><TD CLASS="l">429</TD><TD> /**</TD></TR><TR><TD CLASS="l">430</TD><TD> * Returns the found search matches in no particular order.</TD></TR><TR><TD CLASS="l"><A NAME="c">431</A></TD><TD> * </TD></TR><TR><TD CLASS="l">432</TD><TD> * @return the found search matches</TD></TR><TR><TD CLASS="l">433</TD><TD> */</TD></TR><TR><TD CLASS="l">434</TD><TD> private SearchMatch[] getUngroupedMatches() {</TD></TR><TR CLASS="z"><TD CLASS="l">435</TD><TD> Collection results= null;</TD></TR><TR CLASS="z"><TD CLASS="l">436</TD><TD> if (fBinary) {</TD></TR><TR CLASS="z"><TD CLASS="l">437</TD><TD> results= new LinkedList(getSearchMatches());</TD></TR><TR CLASS="z"><TD CLASS="l">438</TD><TD> final Collection collection= getCollector().getBinaryResources();</TD></TR><TR CLASS="z"><TD CLASS="l">439</TD><TD> SearchMatch match= null;</TD></TR><TR CLASS="z"><TD CLASS="l">440</TD><TD> for (final Iterator iterator= results.iterator(); iterator.hasNext();) {</TD></TR><TR CLASS="z"><TD CLASS="l">441</TD><TD> match= (SearchMatch) iterator.next();</TD></TR><TR CLASS="z"><TD CLASS="l">442</TD><TD> if (collection.contains(match.getResource()))</TD></TR><TR CLASS="z"><TD CLASS="l">443</TD><TD> iterator.remove();</TD></TR><TR><TD CLASS="l">444</TD><TD> }</TD></TR><TR><TD CLASS="l">445</TD><TD> } else</TD></TR><TR CLASS="z"><TD CLASS="l">446</TD><TD> results= getSearchMatches();</TD></TR><TR CLASS="z"><TD CLASS="l">447</TD><TD> final SearchMatch[] matches= new SearchMatch[results.size()];</TD></TR><TR CLASS="z"><TD CLASS="l">448</TD><TD> results.toArray(matches);</TD></TR><TR CLASS="z"><TD CLASS="l">449</TD><TD> return matches;</TD></TR><TR><TD CLASS="l">450</TD><TD> }</TD></TR><TR><TD CLASS="l">451</TD><TD> </TD></TR><TR><TD CLASS="l">452</TD><TD> /**</TD></TR><TR><TD CLASS="l">453</TD><TD> * Performs the search according to the specified pattern.</TD></TR><TR><TD CLASS="l">454</TD><TD> * </TD></TR><TR><TD CLASS="l"><A NAME="d">455</A></TD><TD> * @param monitor the progress monitor, or <code>null</code></TD></TR><TR><TD CLASS="l">456</TD><TD> * @throws JavaScriptModelException if an error occurs during search</TD></TR><TR><TD CLASS="l">457</TD><TD> */</TD></TR><TR><TD CLASS="l">458</TD><TD> public final void searchPattern(final IProgressMonitor monitor) throws JavaScriptModelException {</TD></TR><TR CLASS="z"><TD CLASS="l">459</TD><TD> Assert.isNotNull(fPattern);</TD></TR><TR><TD CLASS="l">460</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">461</TD><TD> monitor.beginTask("", 1); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">462</TD><TD> monitor.setTaskName(RefactoringCoreMessages.RefactoringSearchEngine_searching_occurrences); </TD></TR><TR><TD CLASS="l">463</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">464</TD><TD> SearchEngine engine= null;</TD></TR><TR CLASS="z"><TD CLASS="l">465</TD><TD> if (fOwner != null)</TD></TR><TR CLASS="z"><TD CLASS="l">466</TD><TD> engine= new SearchEngine(fOwner);</TD></TR><TR><TD CLASS="l">467</TD><TD> else</TD></TR><TR CLASS="z"><TD CLASS="l">468</TD><TD> engine= new SearchEngine(fWorkingCopies);</TD></TR><TR CLASS="z"><TD CLASS="l">469</TD><TD> engine.search(fPattern, SearchUtils.getDefaultSearchParticipants(), fScope, getCollector(), new SubProgressMonitor(monitor, 1, SubProgressMonitor.SUPPRESS_SUBTASK_LABEL));</TD></TR><TR CLASS="z"><TD CLASS="l">470</TD><TD> } catch (CoreException exception) {</TD></TR><TR CLASS="z"><TD CLASS="l">471</TD><TD> throw new JavaScriptModelException(exception);</TD></TR><TR><TD CLASS="l">472</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">473</TD><TD> } finally {</TD></TR><TR CLASS="z"><TD CLASS="l">474</TD><TD> monitor.done();</TD></TR><TR CLASS="z"><TD CLASS="l">475</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">476</TD><TD> }</TD></TR><TR><TD CLASS="l">477</TD><TD> </TD></TR><TR><TD CLASS="l">478</TD><TD> /**</TD></TR><TR><TD CLASS="l">479</TD><TD> * Performs the search of referenced fields.</TD></TR><TR><TD CLASS="l">480</TD><TD> * </TD></TR><TR><TD CLASS="l">481</TD><TD> * @param element the java element whose referenced fields have to be found</TD></TR><TR><TD CLASS="l"><A NAME="e">482</A></TD><TD> * @param monitor the progress monitor, or <code>null</code></TD></TR><TR><TD CLASS="l">483</TD><TD> * @throws JavaScriptModelException if an error occurs during search</TD></TR><TR><TD CLASS="l">484</TD><TD> */</TD></TR><TR><TD CLASS="l">485</TD><TD> public final void searchReferencedFields(final IJavaScriptElement element, final IProgressMonitor monitor) throws JavaScriptModelException {</TD></TR><TR CLASS="z"><TD CLASS="l">486</TD><TD> Assert.isNotNull(element);</TD></TR><TR><TD CLASS="l">487</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">488</TD><TD> monitor.beginTask("", 1); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">489</TD><TD> monitor.setTaskName(RefactoringCoreMessages.RefactoringSearchEngine_searching_referenced_fields); </TD></TR><TR><TD CLASS="l">490</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">491</TD><TD> SearchEngine engine= null;</TD></TR><TR CLASS="z"><TD CLASS="l">492</TD><TD> if (fOwner != null)</TD></TR><TR CLASS="z"><TD CLASS="l">493</TD><TD> engine= new SearchEngine(fOwner);</TD></TR><TR><TD CLASS="l">494</TD><TD> else</TD></TR><TR CLASS="z"><TD CLASS="l">495</TD><TD> engine= new SearchEngine(fWorkingCopies);</TD></TR><TR CLASS="z"><TD CLASS="l">496</TD><TD> engine.searchDeclarationsOfAccessedFields(element, getCollector(), new SubProgressMonitor(monitor, 1, SubProgressMonitor.SUPPRESS_SUBTASK_LABEL));</TD></TR><TR CLASS="z"><TD CLASS="l">497</TD><TD> } catch (CoreException exception) {</TD></TR><TR CLASS="z"><TD CLASS="l">498</TD><TD> throw new JavaScriptModelException(exception);</TD></TR><TR><TD CLASS="l">499</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">500</TD><TD> } finally {</TD></TR><TR CLASS="z"><TD CLASS="l">501</TD><TD> monitor.done();</TD></TR><TR CLASS="z"><TD CLASS="l">502</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">503</TD><TD> }</TD></TR><TR><TD CLASS="l">504</TD><TD> </TD></TR><TR><TD CLASS="l">505</TD><TD> /**</TD></TR><TR><TD CLASS="l">506</TD><TD> * Performs the search of referenced methods.</TD></TR><TR><TD CLASS="l">507</TD><TD> * </TD></TR><TR><TD CLASS="l">508</TD><TD> * @param element the java element whose referenced methods have to be found</TD></TR><TR><TD CLASS="l"><A NAME="f">509</A></TD><TD> * @param monitor the progress monitor, or <code>null</code></TD></TR><TR><TD CLASS="l">510</TD><TD> * @throws JavaScriptModelException if an error occurs during search</TD></TR><TR><TD CLASS="l">511</TD><TD> */</TD></TR><TR><TD CLASS="l">512</TD><TD> public final void searchReferencedMethods(final IJavaScriptElement element, final IProgressMonitor monitor) throws JavaScriptModelException {</TD></TR><TR CLASS="z"><TD CLASS="l">513</TD><TD> Assert.isNotNull(element);</TD></TR><TR><TD CLASS="l">514</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">515</TD><TD> monitor.beginTask("", 1); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">516</TD><TD> monitor.setTaskName(RefactoringCoreMessages.RefactoringSearchEngine_searching_referenced_methods); </TD></TR><TR><TD CLASS="l">517</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">518</TD><TD> SearchEngine engine= null;</TD></TR><TR CLASS="z"><TD CLASS="l">519</TD><TD> if (fOwner != null)</TD></TR><TR CLASS="z"><TD CLASS="l">520</TD><TD> engine= new SearchEngine(fOwner);</TD></TR><TR><TD CLASS="l">521</TD><TD> else</TD></TR><TR CLASS="z"><TD CLASS="l">522</TD><TD> engine= new SearchEngine(fWorkingCopies);</TD></TR><TR CLASS="z"><TD CLASS="l">523</TD><TD> engine.searchDeclarationsOfSentMessages(element, getCollector(), new SubProgressMonitor(monitor, 1, SubProgressMonitor.SUPPRESS_SUBTASK_LABEL));</TD></TR><TR CLASS="z"><TD CLASS="l">524</TD><TD> } catch (CoreException exception) {</TD></TR><TR CLASS="z"><TD CLASS="l">525</TD><TD> throw new JavaScriptModelException(exception);</TD></TR><TR><TD CLASS="l">526</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">527</TD><TD> } finally {</TD></TR><TR CLASS="z"><TD CLASS="l">528</TD><TD> monitor.done();</TD></TR><TR CLASS="z"><TD CLASS="l">529</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">530</TD><TD> }</TD></TR><TR><TD CLASS="l">531</TD><TD> </TD></TR><TR><TD CLASS="l">532</TD><TD> /**</TD></TR><TR><TD CLASS="l">533</TD><TD> * Performs the search of referenced types.</TD></TR><TR><TD CLASS="l">534</TD><TD> * </TD></TR><TR><TD CLASS="l">535</TD><TD> * @param element the java element whose referenced types have to be found</TD></TR><TR><TD CLASS="l"><A NAME="10">536</A></TD><TD> * @param monitor the progress monitor, or <code>null</code></TD></TR><TR><TD CLASS="l">537</TD><TD> * @throws JavaScriptModelException if an error occurs during search</TD></TR><TR><TD CLASS="l">538</TD><TD> */</TD></TR><TR><TD CLASS="l">539</TD><TD> public final void searchReferencedTypes(final IJavaScriptElement element, final IProgressMonitor monitor) throws JavaScriptModelException {</TD></TR><TR CLASS="z"><TD CLASS="l">540</TD><TD> Assert.isNotNull(element);</TD></TR><TR><TD CLASS="l">541</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">542</TD><TD> monitor.beginTask("", 1); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">543</TD><TD> monitor.setTaskName(RefactoringCoreMessages.RefactoringSearchEngine_searching_referenced_types); </TD></TR><TR><TD CLASS="l">544</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">545</TD><TD> SearchEngine engine= null;</TD></TR><TR CLASS="z"><TD CLASS="l">546</TD><TD> if (fOwner != null)</TD></TR><TR CLASS="z"><TD CLASS="l">547</TD><TD> engine= new SearchEngine(fOwner);</TD></TR><TR><TD CLASS="l">548</TD><TD> else</TD></TR><TR CLASS="z"><TD CLASS="l">549</TD><TD> engine= new SearchEngine(fWorkingCopies);</TD></TR><TR CLASS="z"><TD CLASS="l">550</TD><TD> engine.searchDeclarationsOfReferencedTypes(element, getCollector(), new SubProgressMonitor(monitor, 1, SubProgressMonitor.SUPPRESS_SUBTASK_LABEL));</TD></TR><TR CLASS="z"><TD CLASS="l">551</TD><TD> } catch (CoreException exception) {</TD></TR><TR CLASS="z"><TD CLASS="l">552</TD><TD> throw new JavaScriptModelException(exception);</TD></TR><TR><TD CLASS="l">553</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">554</TD><TD> } finally {</TD></TR><TR CLASS="z"><TD CLASS="l">555</TD><TD> monitor.done();</TD></TR><TR CLASS="z"><TD CLASS="l">556</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">557</TD><TD> }</TD></TR><TR><TD CLASS="l">558</TD><TD> </TD></TR><TR><TD CLASS="l">559</TD><TD> /**</TD></TR><TR><TD CLASS="l">560</TD><TD> * Sets the conjunction of search patterns to be used during search.</TD></TR><TR><TD CLASS="l">561</TD><TD> * <p></TD></TR><TR><TD CLASS="l">562</TD><TD> * This method must be called before {@link RefactoringSearchEngine2#searchPattern(IProgressMonitor)}</TD></TR><TR><TD CLASS="l">563</TD><TD> * </TD></TR><TR><TD CLASS="l"><A NAME="11">564</A></TD><TD> * @param first the first search pattern to set</TD></TR><TR><TD CLASS="l">565</TD><TD> * @param second the second search pattern to set</TD></TR><TR><TD CLASS="l">566</TD><TD> */</TD></TR><TR><TD CLASS="l">567</TD><TD> public final void setAndPattern(final SearchPattern first, final SearchPattern second) {</TD></TR><TR CLASS="z"><TD CLASS="l">568</TD><TD> Assert.isNotNull(first);</TD></TR><TR CLASS="z"><TD CLASS="l">569</TD><TD> Assert.isNotNull(second);</TD></TR><TR CLASS="z"><TD CLASS="l">570</TD><TD> fPattern= SearchPattern.createAndPattern(first, second);</TD></TR><TR CLASS="z"><TD CLASS="l">571</TD><TD> }</TD></TR><TR><TD CLASS="l">572</TD><TD> </TD></TR><TR><TD CLASS="l">573</TD><TD> /**</TD></TR><TR><TD CLASS="l">574</TD><TD> * Determines how search matches are filtered.</TD></TR><TR><TD CLASS="l">575</TD><TD> * <p></TD></TR><TR><TD CLASS="l">576</TD><TD> * This method must be called before start searching. The default is to filter inaccurate matches only.</TD></TR><TR><TD CLASS="l">577</TD><TD> * </TD></TR><TR><TD CLASS="l"><A NAME="12">578</A></TD><TD> * @param inaccurate <code>true</code> to filter inaccurate matches, <code>false</code> otherwise</TD></TR><TR><TD CLASS="l">579</TD><TD> * @param binary <code>true</code> to filter binary matches, <code>false</code> otherwise</TD></TR><TR><TD CLASS="l">580</TD><TD> */</TD></TR><TR><TD CLASS="l">581</TD><TD> public final void setFiltering(final boolean inaccurate, final boolean binary) {</TD></TR><TR CLASS="z"><TD CLASS="l">582</TD><TD> fInaccurate= inaccurate;</TD></TR><TR CLASS="z"><TD CLASS="l">583</TD><TD> fBinary= binary;</TD></TR><TR CLASS="z"><TD CLASS="l">584</TD><TD> }</TD></TR><TR><TD CLASS="l">585</TD><TD> </TD></TR><TR><TD CLASS="l">586</TD><TD> /**</TD></TR><TR><TD CLASS="l">587</TD><TD> * Sets the granularity to use during the searches.</TD></TR><TR><TD CLASS="l">588</TD><TD> * <p></TD></TR><TR><TD CLASS="l">589</TD><TD> * This method must be called before start searching. The default is a granularity of {@link #GRANULARITY_SEARCH_MATCH}.</TD></TR><TR><TD CLASS="l"><A NAME="13">590</A></TD><TD> * </TD></TR><TR><TD CLASS="l">591</TD><TD> * @param granularity The granularity to use. Must be one of the <code>GRANULARITY_XXX</code> constants.</TD></TR><TR><TD CLASS="l">592</TD><TD> */</TD></TR><TR><TD CLASS="l">593</TD><TD> public final void setGranularity(final int granularity) {</TD></TR><TR CLASS="z"><TD CLASS="l">594</TD><TD> Assert.isTrue(granularity == GRANULARITY_COMPILATION_UNIT || granularity == GRANULARITY_SEARCH_MATCH);</TD></TR><TR CLASS="z"><TD CLASS="l">595</TD><TD> fGranularity= granularity;</TD></TR><TR CLASS="z"><TD CLASS="l">596</TD><TD> }</TD></TR><TR><TD CLASS="l">597</TD><TD> </TD></TR><TR><TD CLASS="l">598</TD><TD> /**</TD></TR><TR><TD CLASS="l">599</TD><TD> * Sets the working copies to take precedence during the searches.</TD></TR><TR><TD CLASS="l">600</TD><TD> * <p></TD></TR><TR><TD CLASS="l">601</TD><TD> * This method must be called before start searching. The default is to use no working copies</TD></TR><TR><TD CLASS="l"><A NAME="1d">602</A></TD><TD> * </TD></TR><TR><TD CLASS="l">603</TD><TD> * @param copies the working copies to use</TD></TR><TR><TD CLASS="l">604</TD><TD> */</TD></TR><TR><TD CLASS="l">605</TD><TD> public final void setWorkingCopies(final IJavaScriptUnit[] copies) {</TD></TR><TR CLASS="z"><TD CLASS="l">606</TD><TD> Assert.isNotNull(copies);</TD></TR><TR CLASS="z"><TD CLASS="l">607</TD><TD> fWorkingCopies= new IJavaScriptUnit[copies.length];</TD></TR><TR CLASS="z"><TD CLASS="l">608</TD><TD> System.arraycopy(copies, 0, fWorkingCopies, 0, copies.length);</TD></TR><TR CLASS="z"><TD CLASS="l">609</TD><TD> }</TD></TR><TR><TD CLASS="l">610</TD><TD> </TD></TR><TR><TD CLASS="l">611</TD><TD> /**</TD></TR><TR><TD CLASS="l">612</TD><TD> * Determines how search matches are grouped.</TD></TR><TR><TD CLASS="l">613</TD><TD> * <p></TD></TR><TR><TD CLASS="l">614</TD><TD> * This method must be called before start searching. The default is to group by containing resource.</TD></TR><TR><TD CLASS="l"><A NAME="14">615</A></TD><TD> * </TD></TR><TR><TD CLASS="l">616</TD><TD> * @param grouping <code>true</code> to group matches by their containing resource, <code>false</code> otherwise</TD></TR><TR><TD CLASS="l">617</TD><TD> */</TD></TR><TR><TD CLASS="l">618</TD><TD> public final void setGrouping(final boolean grouping) {</TD></TR><TR CLASS="z"><TD CLASS="l">619</TD><TD> fGrouping= grouping;</TD></TR><TR CLASS="z"><TD CLASS="l">620</TD><TD> }</TD></TR><TR><TD CLASS="l">621</TD><TD> </TD></TR><TR><TD CLASS="l">622</TD><TD> /**</TD></TR><TR><TD CLASS="l">623</TD><TD> * Sets the disjunction of search patterns to be used during search.</TD></TR><TR><TD CLASS="l">624</TD><TD> * <p></TD></TR><TR><TD CLASS="l">625</TD><TD> * This method must be called before {@link RefactoringSearchEngine2#searchPattern(IProgressMonitor)}</TD></TR><TR><TD CLASS="l">626</TD><TD> * </TD></TR><TR><TD CLASS="l"><A NAME="15">627</A></TD><TD> * @param first the first search pattern to set</TD></TR><TR><TD CLASS="l">628</TD><TD> * @param second the second search pattern to set</TD></TR><TR><TD CLASS="l">629</TD><TD> */</TD></TR><TR><TD CLASS="l">630</TD><TD> public final void setOrPattern(final SearchPattern first, final SearchPattern second) {</TD></TR><TR CLASS="z"><TD CLASS="l">631</TD><TD> Assert.isNotNull(first);</TD></TR><TR CLASS="z"><TD CLASS="l">632</TD><TD> Assert.isNotNull(second);</TD></TR><TR CLASS="z"><TD CLASS="l">633</TD><TD> fPattern= SearchPattern.createOrPattern(first, second);</TD></TR><TR CLASS="z"><TD CLASS="l">634</TD><TD> }</TD></TR><TR><TD CLASS="l">635</TD><TD> </TD></TR><TR><TD CLASS="l">636</TD><TD> /**</TD></TR><TR><TD CLASS="l">637</TD><TD> * Sets the working copy owner to use during search.</TD></TR><TR><TD CLASS="l">638</TD><TD> * <p></TD></TR><TR><TD CLASS="l">639</TD><TD> * This method must be called before start searching. The default is to use no working copy owner.</TD></TR><TR><TD CLASS="l"><A NAME="16">640</A></TD><TD> * </TD></TR><TR><TD CLASS="l">641</TD><TD> * @param owner the working copy owner to use, or <code>null</code> to use none</TD></TR><TR><TD CLASS="l">642</TD><TD> */</TD></TR><TR><TD CLASS="l">643</TD><TD> public final void setOwner(final WorkingCopyOwner owner) {</TD></TR><TR CLASS="z"><TD CLASS="l">644</TD><TD> fOwner= owner;</TD></TR><TR CLASS="z"><TD CLASS="l">645</TD><TD> }</TD></TR><TR><TD CLASS="l">646</TD><TD> </TD></TR><TR><TD CLASS="l">647</TD><TD> /**</TD></TR><TR><TD CLASS="l">648</TD><TD> * Sets the search pattern to be used during search.</TD></TR><TR><TD CLASS="l">649</TD><TD> * <p></TD></TR><TR><TD CLASS="l">650</TD><TD> * This method must be called before {@link RefactoringSearchEngine2#searchPattern(IProgressMonitor)}</TD></TR><TR><TD CLASS="l">651</TD><TD> * </TD></TR><TR><TD CLASS="l"><A NAME="17">652</A></TD><TD> * @param elements the set of elements</TD></TR><TR><TD CLASS="l">653</TD><TD> * @param limitTo determines the nature of the expected matches. This is a combination of {@link org.eclipse.wst.jsdt.core.search.IJavaScriptSearchConstants}.</TD></TR><TR><TD CLASS="l">654</TD><TD> */</TD></TR><TR><TD CLASS="l">655</TD><TD> public final void setPattern(final IJavaScriptElement[] elements, final int limitTo) {</TD></TR><TR CLASS="z"><TD CLASS="l">656</TD><TD> Assert.isNotNull(elements);</TD></TR><TR CLASS="z"><TD CLASS="l">657</TD><TD> Assert.isTrue(elements.length > 0);</TD></TR><TR CLASS="z"><TD CLASS="l">658</TD><TD> SearchPattern pattern= SearchPattern.createPattern(elements[0], limitTo, SearchUtils.GENERICS_AGNOSTIC_MATCH_RULE);</TD></TR><TR CLASS="z"><TD CLASS="l">659</TD><TD> IJavaScriptElement element= null;</TD></TR><TR CLASS="z"><TD CLASS="l">660</TD><TD> for (int index= 1; index < elements.length; index++) {</TD></TR><TR CLASS="z"><TD CLASS="l">661</TD><TD> element= elements[index];</TD></TR><TR CLASS="z"><TD CLASS="l">662</TD><TD> pattern= SearchPattern.createOrPattern(pattern, SearchPattern.createPattern(element, limitTo, SearchUtils.GENERICS_AGNOSTIC_MATCH_RULE));</TD></TR><TR><TD CLASS="l">663</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">664</TD><TD> setPattern(pattern);</TD></TR><TR CLASS="z"><TD CLASS="l">665</TD><TD> }</TD></TR><TR><TD CLASS="l">666</TD><TD> </TD></TR><TR><TD CLASS="l">667</TD><TD> /**</TD></TR><TR><TD CLASS="l">668</TD><TD> * Sets the search pattern to be used during search.</TD></TR><TR><TD CLASS="l">669</TD><TD> * <p></TD></TR><TR><TD CLASS="l">670</TD><TD> * This method must be called before {@link RefactoringSearchEngine2#searchPattern(IProgressMonitor)}</TD></TR><TR><TD CLASS="l"><A NAME="18">671</A></TD><TD> * </TD></TR><TR><TD CLASS="l">672</TD><TD> * @param pattern the search pattern to set</TD></TR><TR><TD CLASS="l">673</TD><TD> */</TD></TR><TR><TD CLASS="l">674</TD><TD> public final void setPattern(final SearchPattern pattern) {</TD></TR><TR CLASS="z"><TD CLASS="l">675</TD><TD> Assert.isNotNull(pattern);</TD></TR><TR CLASS="z"><TD CLASS="l">676</TD><TD> fPattern= pattern;</TD></TR><TR CLASS="z"><TD CLASS="l">677</TD><TD> }</TD></TR><TR><TD CLASS="l">678</TD><TD> </TD></TR><TR><TD CLASS="l">679</TD><TD> /**</TD></TR><TR><TD CLASS="l">680</TD><TD> * Sets the search requestor for this search engine.</TD></TR><TR><TD CLASS="l">681</TD><TD> * <p></TD></TR><TR><TD CLASS="l">682</TD><TD> * This method must be called before start searching. The default is a non-filtering search requestor.</TD></TR><TR><TD CLASS="l"><A NAME="19">683</A></TD><TD> * </TD></TR><TR><TD CLASS="l">684</TD><TD> * @param requestor the search requestor to set</TD></TR><TR><TD CLASS="l">685</TD><TD> */</TD></TR><TR><TD CLASS="l">686</TD><TD> public final void setRequestor(final IRefactoringSearchRequestor requestor) {</TD></TR><TR CLASS="z"><TD CLASS="l">687</TD><TD> Assert.isNotNull(requestor);</TD></TR><TR CLASS="z"><TD CLASS="l">688</TD><TD> fRequestor= requestor;</TD></TR><TR CLASS="z"><TD CLASS="l">689</TD><TD> }</TD></TR><TR><TD CLASS="l">690</TD><TD> </TD></TR><TR><TD CLASS="l">691</TD><TD> /**</TD></TR><TR><TD CLASS="l">692</TD><TD> * Sets the search scope for this search engine.</TD></TR><TR><TD CLASS="l">693</TD><TD> * <p></TD></TR><TR><TD CLASS="l">694</TD><TD> * This method must be called before start searching. The default is the entire workspace as search scope.</TD></TR><TR><TD CLASS="l"><A NAME="1a">695</A></TD><TD> * </TD></TR><TR><TD CLASS="l">696</TD><TD> * @param scope the search scope to set</TD></TR><TR><TD CLASS="l">697</TD><TD> */</TD></TR><TR><TD CLASS="l">698</TD><TD> public final void setScope(final IJavaScriptSearchScope scope) {</TD></TR><TR CLASS="z"><TD CLASS="l">699</TD><TD> Assert.isNotNull(scope);</TD></TR><TR CLASS="z"><TD CLASS="l">700</TD><TD> fScope= scope;</TD></TR><TR CLASS="z"><TD CLASS="l">701</TD><TD> }</TD></TR><TR><TD CLASS="l">702</TD><TD> </TD></TR><TR><TD CLASS="l">703</TD><TD> /**</TD></TR><TR><TD CLASS="l">704</TD><TD> * Sets the severity of the generated status entries.</TD></TR><TR><TD CLASS="l">705</TD><TD> * <p></TD></TR><TR><TD CLASS="l">706</TD><TD> * This method must be called before start searching. The default is a severity of {@link RefactoringStatus#OK}.</TD></TR><TR><TD CLASS="l"><A NAME="1b">707</A></TD><TD> * </TD></TR><TR><TD CLASS="l">708</TD><TD> * @param severity the severity to set</TD></TR><TR><TD CLASS="l">709</TD><TD> */</TD></TR><TR><TD CLASS="l">710</TD><TD> public final void setSeverity(final int severity) {</TD></TR><TR CLASS="z"><TD CLASS="l">711</TD><TD> Assert.isTrue(severity == RefactoringStatus.WARNING || severity == RefactoringStatus.INFO || severity == RefactoringStatus.FATAL || severity == RefactoringStatus.ERROR);</TD></TR><TR CLASS="z"><TD CLASS="l">712</TD><TD> fSeverity= severity;</TD></TR><TR CLASS="z"><TD CLASS="l">713</TD><TD> }</TD></TR><TR><TD CLASS="l">714</TD><TD> </TD></TR><TR><TD CLASS="l">715</TD><TD> /**</TD></TR><TR><TD CLASS="l">716</TD><TD> * Sets the refactoring status for this search engine.</TD></TR><TR><TD CLASS="l">717</TD><TD> * <p></TD></TR><TR><TD CLASS="l">718</TD><TD> * This method must be called before start searching. The default is an empty status with status {@link RefactoringStatus#OK}.</TD></TR><TR><TD CLASS="l"><A NAME="1c">719</A></TD><TD> * </TD></TR><TR><TD CLASS="l">720</TD><TD> * @param status the refactoring status to set</TD></TR><TR><TD CLASS="l">721</TD><TD> */</TD></TR><TR><TD CLASS="l">722</TD><TD> public final void setStatus(final RefactoringStatus status) {</TD></TR><TR CLASS="z"><TD CLASS="l">723</TD><TD> Assert.isNotNull(status);</TD></TR><TR CLASS="z"><TD CLASS="l">724</TD><TD> fStatus= status;</TD></TR><TR CLASS="z"><TD CLASS="l">725</TD><TD> }</TD></TR><TR><TD CLASS="l">726</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="13a.html">org.eclipse.wst.jsdt.internal.corext.refactoring</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>
\ No newline at end of file |