| <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="98.html">org.eclipse.wst.sse.core.internal.text</A>]</TD></TR></TABLE><H2>COVERAGE SUMMARY FOR SOURCE FILE [<SPAN CLASS="in">StructuredDocumentReParser.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>StructuredDocumentReParser.java</TD><TD>100% (1/1)</TD><TD CLASS="h">19% (10/53)</TD><TD CLASS="h">12% (272/2340)</TD><TD CLASS="h">12% (70.9/590)</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">StructuredDocumentReParser</A></TD><TD>100% (1/1)</TD><TD CLASS="h">19% (10/53)</TD><TD CLASS="h">12% (272/2340)</TD><TD CLASS="h">12% (70.9/590)</TD></TR><TR><TD CLASS="f"><A HREF="#1">_checkBlockNodeList (List): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/48)</TD><TD CLASS="h">0% (0/12)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2">_checkForCriticalWord (String, boolean): StructuredDocumentEvent</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><TD CLASS="f"><A HREF="#3">_computeStartOfDifferences (CoreNodeList, CoreNodeList): int</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/79)</TD><TD CLASS="h">0% (0/28)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#4">_computeStartOfDifferences (IStructuredDocumentRegion, ITextRegionList, IStru...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/77)</TD><TD CLASS="h">0% (0/27)</TD></TR><TR><TD CLASS="f"><A HREF="#5">_formMinimumList (CoreNodeList, int, int): CoreNodeList</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/41)</TD><TD CLASS="h">0% (0/11)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#6">_greaterThanEffectedRegion (IStructuredDocumentRegion): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/22)</TD><TD CLASS="h">0% (0/5)</TD></TR><TR><TD CLASS="f"><A HREF="#7">_greaterThanEffectedRegion (IStructuredDocumentRegion, ITextRegion): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/23)</TD><TD CLASS="h">0% (0/5)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#8">_lessThanEffectedRegion (IStructuredDocumentRegion): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/17)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR><TD CLASS="f"><A HREF="#9">_lessThanEffectedRegion (IStructuredDocumentRegion, ITextRegion): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/18)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#a">_regionsSameKind (ITextRegion, ITextRegion): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/21)</TD><TD CLASS="h">0% (0/6)</TD></TR><TR><TD CLASS="f"><A HREF="#b">changeInIsEndedState (String, String): boolean</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="#c">checkAndAssignParent (IStructuredDocumentRegion, ITextRegion): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/34)</TD><TD CLASS="h">0% (0/10)</TD></TR><TR><TD CLASS="f"><A HREF="#d">checkForCDATA (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/14)</TD><TD CLASS="h">0% (0/5)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#e">checkForComments (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/20)</TD><TD CLASS="h">0% (0/7)</TD></TR><TR><TD CLASS="f"><A HREF="#f">checkForCriticalKey (String): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/5)</TD><TD CLASS="h">0% (0/1)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#10">checkForCriticalName (String): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/5)</TD><TD CLASS="h">0% (0/1)</TD></TR><TR><TD CLASS="f"><A HREF="#11">checkForCrossStructuredDocumentRegionBoundryCases (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/32)</TD><TD CLASS="h">0% (0/11)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#12">checkForCrossStructuredDocumentRegionSyntax (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/20)</TD><TD CLASS="h">0% (0/8)</TD></TR><TR><TD CLASS="f"><A HREF="#13">checkForNoChange (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/37)</TD><TD CLASS="h">0% (0/4)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#14">checkForPI (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/14)</TD><TD CLASS="h">0% (0/5)</TD></TR><TR><TD CLASS="f"><A HREF="#15">checkForQuotes (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/109)</TD><TD CLASS="h">0% (0/21)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#16">checkHeuristics (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/17)</TD><TD CLASS="h">0% (0/7)</TD></TR><TR><TD CLASS="f"><A HREF="#17">checkTagNames (String, String, boolean): boolean</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/47)</TD><TD CLASS="h">0% (0/11)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#18">findDirtyEnd (int): IStructuredDocumentRegion</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/40)</TD><TD CLASS="h">0% (0/11)</TD></TR><TR><TD CLASS="f"><A HREF="#19">findDirtyStart (int): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/35)</TD><TD CLASS="h">0% (0/11)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#1a">getFindReplaceDocumentAdapter (): FindReplaceDocumentAdapter</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/13)</TD><TD CLASS="h">0% (0/3)</TD></TR><TR><TD CLASS="f"><A HREF="#1b">insertNodes (IStructuredDocumentRegion, IStructuredDocumentRegion, CoreNodeLi...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/53)</TD><TD CLASS="h">0% (0/17)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#1c">isCollectionRegion (ITextRegion): boolean</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="#1d">isParsing (): boolean</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="#1e">minimumEvent (CoreNodeList, CoreNodeList): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/232)</TD><TD CLASS="h">0% (0/51)</TD></TR><TR><TD CLASS="f"><A HREF="#1f">newInstance (): IStructuredTextReParser</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="#20">nodesReplacedCheck (CoreNodeList, CoreNodeList): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/18)</TD><TD CLASS="h">0% (0/2)</TD></TR><TR><TD CLASS="f"><A HREF="#21">quickCheck (): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/55)</TD><TD CLASS="h">0% (0/12)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#22">reSetCachedNode (CoreNodeList, CoreNodeList): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/37)</TD><TD CLASS="h">0% (0/7)</TD></TR><TR><TD CLASS="f"><A HREF="#23">regionCheck (CoreNodeList, CoreNodeList): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/32)</TD><TD CLASS="h">0% (0/9)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#24">regionCheck (IStructuredDocumentRegion, IStructuredDocumentRegion): Structure...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/276)</TD><TD CLASS="h">0% (0/46)</TD></TR><TR><TD CLASS="f"><A HREF="#25">reparse (int, int): StructuredDocumentEvent</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/25)</TD><TD CLASS="h">0% (0/7)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#26">replaceRegions (IStructuredDocumentRegion, ITextRegionList, IStructuredDocume...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/91)</TD><TD CLASS="h">0% (0/25)</TD></TR><TR><TD CLASS="f"><A HREF="#27">splice (CoreNodeList, CoreNodeList): IStructuredDocumentRegion</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/154)</TD><TD CLASS="h">0% (0/50)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#28">swapNewForOldRegion (IStructuredDocumentRegion, ITextRegion, IStructuredDocum...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/28)</TD><TD CLASS="h">0% (0/7)</TD></TR><TR><TD CLASS="f"><A HREF="#29">switchNodeLists (CoreNodeList, CoreNodeList): IStructuredDocumentRegion</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/27)</TD><TD CLASS="h">0% (0/7)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2a">transferEmbeddedRegions (IStructuredDocumentRegion, ITextRegionContainer, ITe...</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/26)</TD><TD CLASS="h">0% (0/8)</TD></TR><TR><TD CLASS="f"><A HREF="#2b">updateDownStreamRegions (IStructuredDocumentRegion, ITextRegion): void</A></TD><TD> </TD><TD CLASS="h">0% (0/1)</TD><TD CLASS="h">0% (0/42)</TD><TD CLASS="h">0% (0/13)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2c">reparse (): StructuredDocumentEvent</A></TD><TD> </TD><TD>100% (1/1)</TD><TD CLASS="h">57% (23/40)</TD><TD CLASS="h">64% (7/11)</TD></TR><TR><TD CLASS="f"><A HREF="#2d">formOldNodes (IStructuredDocumentRegion, IStructuredDocumentRegion): CoreNode...</A></TD><TD> </TD><TD>100% (1/1)</TD><TD CLASS="h">72% (39/54)</TD><TD CLASS="h">79% (11/14)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#2e">reparse (IStructuredDocumentRegion, IStructuredDocumentRegion): StructuredDoc...</A></TD><TD> </TD><TD>100% (1/1)</TD><TD CLASS="h">79% (42/53)</TD><TD>85% (11.9/14)</TD></TR><TR><TD CLASS="f"><A HREF="#2f">_core_reparse_update_model (IStructuredDocumentRegion, int, int, CoreNodeList...</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>91% (50/55)</TD><TD>92% (11/12)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#0">StructuredDocumentReParser (): void</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (39/39)</TD><TD>100% (8/8)</TD></TR><TR><TD CLASS="f"><A HREF="#31">_core_reparse_text (int, int): IStructuredDocumentRegion</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (10/10)</TD><TD>100% (2/2)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#32">core_reparse (int, int, CoreNodeList, boolean): StructuredDocumentEvent</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (19/19)</TD><TD>100% (5/5)</TD></TR><TR><TD CLASS="f"><A HREF="#33">endReParse (): void</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (10/10)</TD><TD>100% (4/4)</TD></TR><TR CLASS="o"><TD CLASS="f"><A HREF="#34">initialize (Object, int, int, String): void</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (32/32)</TD><TD>100% (8/8)</TD></TR><TR><TD CLASS="f"><A HREF="#35">setStructuredDocument (IStructuredDocument): void</A></TD><TD> </TD><TD>100% (1/1)</TD><TD>100% (8/8)</TD><TD>100% (3/3)</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, 2006 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.text;</TD></TR><TR><TD CLASS="l">14</TD><TD> </TD></TR><TR><TD CLASS="l">15</TD><TD>import java.util.Iterator;</TD></TR><TR><TD CLASS="l">16</TD><TD>import java.util.List;</TD></TR><TR><TD CLASS="l">17</TD><TD> </TD></TR><TR><TD CLASS="l">18</TD><TD>import org.eclipse.jface.text.BadLocationException;</TD></TR><TR><TD CLASS="l">19</TD><TD>import org.eclipse.jface.text.FindReplaceDocumentAdapter;</TD></TR><TR><TD CLASS="l">20</TD><TD>import org.eclipse.jface.text.IRegion;</TD></TR><TR><TD CLASS="l">21</TD><TD>import org.eclipse.wst.sse.core.internal.Logger;</TD></TR><TR><TD CLASS="l">22</TD><TD>import org.eclipse.wst.sse.core.internal.ltk.parser.BlockTagParser;</TD></TR><TR><TD CLASS="l">23</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.events.NoChangeEvent;</TD></TR><TR><TD CLASS="l">24</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.events.RegionChangedEvent;</TD></TR><TR><TD CLASS="l">25</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.events.RegionsReplacedEvent;</TD></TR><TR><TD CLASS="l">26</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.events.StructuredDocumentEvent;</TD></TR><TR><TD CLASS="l">27</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.events.StructuredDocumentRegionsReplacedEvent;</TD></TR><TR><TD CLASS="l">28</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.text.IStructuredDocument;</TD></TR><TR><TD CLASS="l">29</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.text.IStructuredDocumentRegion;</TD></TR><TR><TD CLASS="l">30</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.text.IStructuredTextReParser;</TD></TR><TR><TD CLASS="l">31</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.text.ITextRegion;</TD></TR><TR><TD CLASS="l">32</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.text.ITextRegionCollection;</TD></TR><TR><TD CLASS="l">33</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.text.ITextRegionContainer;</TD></TR><TR><TD CLASS="l">34</TD><TD>import org.eclipse.wst.sse.core.internal.provisional.text.ITextRegionList;</TD></TR><TR><TD CLASS="l">35</TD><TD>import org.eclipse.wst.sse.core.internal.util.Debug;</TD></TR><TR><TD CLASS="l">36</TD><TD>import org.eclipse.wst.sse.core.internal.util.Utilities;</TD></TR><TR><TD CLASS="l">37</TD><TD>import org.eclipse.wst.sse.core.utils.StringUtils;</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>/**</TD></TR><TR><TD CLASS="l">41</TD><TD> * This class provides a centralized place to put "reparsing" logic. This is</TD></TR><TR><TD CLASS="l">42</TD><TD> * the logic that reparses the text incrementally, as a user types in new</TD></TR><TR><TD CLASS="l">43</TD><TD> * characters, or DOM nodes are inserted or deleted. Note: it is not a thread</TD></TR><TR><TD CLASS="l">44</TD><TD> * safe class.</TD></TR><TR><TD CLASS="l">45</TD><TD> */</TD></TR><TR><TD CLASS="l">46</TD><TD>public class StructuredDocumentReParser implements IStructuredTextReParser {</TD></TR><TR CLASS="c"><TD CLASS="l">47</TD><TD> protected IStructuredDocumentRegion dirtyEnd = null;</TD></TR><TR CLASS="c"><TD CLASS="l">48</TD><TD> protected IStructuredDocumentRegion dirtyStart = null;</TD></TR><TR CLASS="c"><TD CLASS="l">49</TD><TD> final private String doubleQuote = new String(new char[]{'\"'});</TD></TR><TR CLASS="c"><TD CLASS="l">50</TD><TD> protected final CoreNodeList EMPTY_LIST = new CoreNodeList();</TD></TR><TR><TD CLASS="l">51</TD><TD> protected String fChanges;</TD></TR><TR><TD CLASS="l">52</TD><TD> protected String fDeletedText;</TD></TR><TR><TD CLASS="l">53</TD><TD> </TD></TR><TR CLASS="c"><TD CLASS="l">54</TD><TD> private FindReplaceDocumentAdapter fFindReplaceDocumentAdapter = null;</TD></TR><TR><TD CLASS="l">55</TD><TD> protected int fLengthDifference;</TD></TR><TR><TD CLASS="l">56</TD><TD> protected int fLengthToReplace;</TD></TR><TR><TD CLASS="l">57</TD><TD> protected Object fRequester;</TD></TR><TR><TD CLASS="l">58</TD><TD> protected int fStart;</TD></TR><TR><TD CLASS="l">59</TD><TD> // note: this is the impl class of IStructuredDocument, not the interface</TD></TR><TR><TD CLASS="l">60</TD><TD> // FUTURE_TO_DO: I believe some of these can be made private now.?</TD></TR><TR><TD CLASS="l">61</TD><TD> protected BasicStructuredDocument fStructuredDocument;</TD></TR><TR><TD CLASS="l">62</TD><TD> </TD></TR><TR><TD CLASS="l">63</TD><TD> /**</TD></TR><TR><TD CLASS="l">64</TD><TD> * variable used in anticiapation of multithreading</TD></TR><TR><TD CLASS="l">65</TD><TD> */</TD></TR><TR><TD CLASS="l"><A NAME="0">66</A></TD><TD> protected boolean isParsing;</TD></TR><TR CLASS="c"><TD CLASS="l">67</TD><TD> final private String singleQuote = new String(new char[]{'\''});</TD></TR><TR><TD CLASS="l">68</TD><TD> </TD></TR><TR><TD CLASS="l">69</TD><TD> public StructuredDocumentReParser() {</TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="1">70</A></TD><TD> super();</TD></TR><TR CLASS="c"><TD CLASS="l">71</TD><TD> }</TD></TR><TR><TD CLASS="l">72</TD><TD> </TD></TR><TR><TD CLASS="l">73</TD><TD> public StructuredDocumentEvent _checkBlockNodeList(List blockTagList) {</TD></TR><TR CLASS="z"><TD CLASS="l">74</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">75</TD><TD> if (blockTagList != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">76</TD><TD> for (int i = 0; i < blockTagList.size(); i++) {</TD></TR><TR CLASS="z"><TD CLASS="l">77</TD><TD> org.eclipse.wst.sse.core.internal.ltk.parser.BlockMarker blockTag = (org.eclipse.wst.sse.core.internal.ltk.parser.BlockMarker) blockTagList.get(i);</TD></TR><TR CLASS="z"><TD CLASS="l">78</TD><TD> String tagName = blockTag.getTagName();</TD></TR><TR CLASS="z"><TD CLASS="l">79</TD><TD> result = checkForCriticalName("<" + tagName); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">80</TD><TD> if (result != null)</TD></TR><TR CLASS="z"><TD CLASS="l">81</TD><TD> break;</TD></TR><TR CLASS="z"><TD CLASS="l">82</TD><TD> result = checkForCriticalName("</" + tagName); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">83</TD><TD> if (result != null)</TD></TR><TR CLASS="z"><TD CLASS="l">84</TD><TD> break;</TD></TR><TR><TD CLASS="l">85</TD><TD> }</TD></TR><TR><TD CLASS="l">86</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">87</TD><TD> return result;</TD></TR><TR><TD CLASS="l">88</TD><TD> }</TD></TR><TR><TD CLASS="l">89</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="2">90</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">91</TD><TD> * Common utility for checking for critical word such as " <SCRIPT>"</TD></TR><TR><TD CLASS="l">92</TD><TD> */</TD></TR><TR><TD CLASS="l">93</TD><TD> private StructuredDocumentEvent _checkForCriticalWord(String criticalTarget, boolean checkEnd) {</TD></TR><TR CLASS="z"><TD CLASS="l">94</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">95</TD><TD> int documentLength = fStructuredDocument.getLength();</TD></TR><TR CLASS="z"><TD CLASS="l">96</TD><TD> int propLen = fLengthToReplace;</TD></TR><TR CLASS="z"><TD CLASS="l">97</TD><TD> if (propLen > documentLength)</TD></TR><TR CLASS="z"><TD CLASS="l">98</TD><TD> propLen = documentLength;</TD></TR><TR CLASS="z"><TD CLASS="l">99</TD><TD> int startNeighborhood = fStart - criticalTarget.length();</TD></TR><TR CLASS="z"><TD CLASS="l">100</TD><TD> int adjustInsert = 0;</TD></TR><TR CLASS="z"><TD CLASS="l">101</TD><TD> if (startNeighborhood < 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">102</TD><TD> adjustInsert = 0 - startNeighborhood;</TD></TR><TR CLASS="z"><TD CLASS="l">103</TD><TD> startNeighborhood = 0;</TD></TR><TR><TD CLASS="l">104</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">105</TD><TD> int endNeighborhood = fStart + fLengthToReplace + criticalTarget.length() - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">106</TD><TD> if (endNeighborhood > documentLength)</TD></TR><TR CLASS="z"><TD CLASS="l">107</TD><TD> endNeighborhood = documentLength - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">108</TD><TD> int oldlen = endNeighborhood - startNeighborhood; // + 1;</TD></TR><TR CLASS="z"><TD CLASS="l">109</TD><TD> if (oldlen + startNeighborhood > documentLength) {</TD></TR><TR CLASS="z"><TD CLASS="l">110</TD><TD> oldlen = documentLength - startNeighborhood;</TD></TR><TR><TD CLASS="l">111</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">112</TD><TD> String oldText = fStructuredDocument.get(startNeighborhood, oldlen);</TD></TR><TR CLASS="z"><TD CLASS="l">113</TD><TD> String peek = StringUtils.paste(oldText, fChanges, criticalTarget.length() - adjustInsert, fLengthToReplace);</TD></TR><TR CLASS="z"><TD CLASS="l">114</TD><TD> boolean isCriticalString = checkTagNames(oldText, criticalTarget, checkEnd);</TD></TR><TR CLASS="z"><TD CLASS="l">115</TD><TD> boolean toBeCriticalString = checkTagNames(peek, criticalTarget, checkEnd);</TD></TR><TR CLASS="z"><TD CLASS="l">116</TD><TD> if ((isCriticalString != toBeCriticalString) || // OR if both are</TD></TR><TR><TD CLASS="l">117</TD><TD> // critical and there's</TD></TR><TR><TD CLASS="l">118</TD><TD> // a change in the end</TD></TR><TR><TD CLASS="l">119</TD><TD> // tag ('>')</TD></TR><TR CLASS="z"><TD CLASS="l">120</TD><TD> ((isCriticalString && toBeCriticalString) && (changeInIsEndedState(oldText, peek)))) {</TD></TR><TR><TD CLASS="l">121</TD><TD> // if it involves a change of a critical string (making one where</TD></TR><TR><TD CLASS="l">122</TD><TD> // there wasn't, or removing</TD></TR><TR><TD CLASS="l">123</TD><TD> // one where there was one) then reparse everthing.</TD></TR><TR CLASS="z"><TD CLASS="l">124</TD><TD> result = reparse(0, documentLength - 1);</TD></TR><TR><TD CLASS="l">125</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="3">126</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">127</TD><TD> }</TD></TR><TR><TD CLASS="l">128</TD><TD> </TD></TR><TR><TD CLASS="l">129</TD><TD> private int _computeStartOfDifferences(CoreNodeList oldNodes, CoreNodeList newNodes) {</TD></TR><TR CLASS="z"><TD CLASS="l">130</TD><TD> int startOfDifferences = -1;</TD></TR><TR CLASS="z"><TD CLASS="l">131</TD><TD> int newNodesLength = newNodes.getLength();</TD></TR><TR CLASS="z"><TD CLASS="l">132</TD><TD> boolean foundDifference = false;</TD></TR><TR CLASS="z"><TD CLASS="l">133</TD><TD> boolean done = false;</TD></TR><TR><TD CLASS="l">134</TD><TD> // we'll control our loop based on the old List length</TD></TR><TR CLASS="z"><TD CLASS="l">135</TD><TD> int oldNodesLength = oldNodes.getLength();</TD></TR><TR><TD CLASS="l">136</TD><TD> // be sure to check 'done' first, so startOfDifferences isn't</TD></TR><TR><TD CLASS="l">137</TD><TD> // icremented if done is true</TD></TR><TR CLASS="z"><TD CLASS="l">138</TD><TD> done : while ((!done) && (++startOfDifferences < oldNodesLength)) {</TD></TR><TR CLASS="z"><TD CLASS="l">139</TD><TD> IStructuredDocumentRegion oldNode = oldNodes.item(startOfDifferences);</TD></TR><TR><TD CLASS="l">140</TD><TD> // this lessThanEffectedRegion is to check to be sure the node is</TD></TR><TR><TD CLASS="l">141</TD><TD> // infact a candidate</TD></TR><TR><TD CLASS="l">142</TD><TD> // to be considered as "old". This check is important for the case</TD></TR><TR><TD CLASS="l">143</TD><TD> // where some</TD></TR><TR><TD CLASS="l">144</TD><TD> // text is replaceing text that</TD></TR><TR><TD CLASS="l">145</TD><TD> // appears identical, but is a different instance. For example, if</TD></TR><TR><TD CLASS="l">146</TD><TD> // the text</TD></TR><TR><TD CLASS="l">147</TD><TD> // is <P><B></B></P> and <B></B> is inserted at postion 3,</TD></TR><TR><TD CLASS="l">148</TD><TD> // resulting in <P><B></B><B></B></P></TD></TR><TR><TD CLASS="l">149</TD><TD> // we do not want the</TD></TR><TR><TD CLASS="l">150</TD><TD> // first <B> to be considered old ... it is the new one, the</TD></TR><TR><TD CLASS="l">151</TD><TD> // second</TD></TR><TR><TD CLASS="l">152</TD><TD> // <B> is the old one.</TD></TR><TR CLASS="z"><TD CLASS="l">153</TD><TD> if (_lessThanEffectedRegion(oldNode)) {</TD></TR><TR><TD CLASS="l">154</TD><TD> // be sure to check that we have new nodes to compare against.</TD></TR><TR CLASS="z"><TD CLASS="l">155</TD><TD> if (startOfDifferences > newNodesLength) {</TD></TR><TR CLASS="z"><TD CLASS="l">156</TD><TD> foundDifference = false;</TD></TR><TR CLASS="z"><TD CLASS="l">157</TD><TD> done = true;</TD></TR><TR CLASS="z"><TD CLASS="l">158</TD><TD> continue done;</TD></TR><TR><TD CLASS="l">159</TD><TD> } else {</TD></TR><TR><TD CLASS="l">160</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">161</TD><TD> IStructuredDocumentRegion newNode = newNodes.item(startOfDifferences);</TD></TR><TR><TD CLASS="l">162</TD><TD> // note: shift is 0 while at beginning of list, before the</TD></TR><TR><TD CLASS="l">163</TD><TD> // insertion (or deletion) point. After that, it is</TD></TR><TR><TD CLASS="l">164</TD><TD> // fStart+fLengthDifference</TD></TR><TR CLASS="z"><TD CLASS="l">165</TD><TD> if (!(oldNode.sameAs(newNode, 0))) {</TD></TR><TR CLASS="z"><TD CLASS="l">166</TD><TD> foundDifference = true;</TD></TR><TR CLASS="z"><TD CLASS="l">167</TD><TD> done = true;</TD></TR><TR CLASS="z"><TD CLASS="l">168</TD><TD> continue done;</TD></TR><TR><TD CLASS="l">169</TD><TD> } else { // if they are equal, then we will be keeping the</TD></TR><TR><TD CLASS="l">170</TD><TD> // old one, so</TD></TR><TR><TD CLASS="l">171</TD><TD> // we need to be sure its parentDocument is set back</TD></TR><TR><TD CLASS="l">172</TD><TD> // to</TD></TR><TR><TD CLASS="l">173</TD><TD> // the right instance</TD></TR><TR CLASS="z"><TD CLASS="l">174</TD><TD> oldNode.setParentDocument(fStructuredDocument);</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> } else {</TD></TR><TR><TD CLASS="l">178</TD><TD> // we didn't literally find a difference, but we count it as</TD></TR><TR><TD CLASS="l">179</TD><TD> // such by implication</TD></TR><TR CLASS="z"><TD CLASS="l">180</TD><TD> foundDifference = true;</TD></TR><TR CLASS="z"><TD CLASS="l">181</TD><TD> done = true;</TD></TR><TR><TD CLASS="l">182</TD><TD> continue done;</TD></TR><TR><TD CLASS="l">183</TD><TD> }</TD></TR><TR><TD CLASS="l">184</TD><TD> }</TD></TR><TR><TD CLASS="l">185</TD><TD> // if we literally found a difference, then all is ok and we can</TD></TR><TR><TD CLASS="l">186</TD><TD> // return</TD></TR><TR><TD CLASS="l">187</TD><TD> // it.</TD></TR><TR><TD CLASS="l">188</TD><TD> // if we did not literally find one, then we have to decide why.</TD></TR><TR CLASS="z"><TD CLASS="l">189</TD><TD> if (!foundDifference) {</TD></TR><TR CLASS="z"><TD CLASS="l">190</TD><TD> if (newNodesLength == oldNodesLength) { // then lists are</TD></TR><TR><TD CLASS="l">191</TD><TD> // identical</TD></TR><TR><TD CLASS="l">192</TD><TD> // (and may be of zero</TD></TR><TR><TD CLASS="l">193</TD><TD> // length)</TD></TR><TR CLASS="z"><TD CLASS="l">194</TD><TD> startOfDifferences = -1;</TD></TR><TR><TD CLASS="l">195</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">196</TD><TD> if (newNodesLength > oldNodesLength) { // then lists are</TD></TR><TR><TD CLASS="l">197</TD><TD> // identical except for</TD></TR><TR><TD CLASS="l">198</TD><TD> // newNodes added</TD></TR><TR CLASS="z"><TD CLASS="l">199</TD><TD> startOfDifferences = oldNodesLength;</TD></TR><TR><TD CLASS="l">200</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">201</TD><TD> if (newNodesLength < oldNodesLength) { // then lists are</TD></TR><TR><TD CLASS="l">202</TD><TD> // identical except</TD></TR><TR><TD CLASS="l">203</TD><TD> // for old Nodes</TD></TR><TR><TD CLASS="l">204</TD><TD> // deleted</TD></TR><TR CLASS="z"><TD CLASS="l">205</TD><TD> startOfDifferences = newNodesLength;</TD></TR><TR><TD CLASS="l">206</TD><TD> }</TD></TR><TR><TD CLASS="l">207</TD><TD> }</TD></TR><TR><TD CLASS="l">208</TD><TD> }</TD></TR><TR><TD CLASS="l">209</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="4">210</A></TD><TD> return startOfDifferences;</TD></TR><TR><TD CLASS="l">211</TD><TD> }</TD></TR><TR><TD CLASS="l">212</TD><TD> </TD></TR><TR><TD CLASS="l">213</TD><TD> private int _computeStartOfDifferences(IStructuredDocumentRegion oldNodeParam, ITextRegionList oldRegions, IStructuredDocumentRegion newNodeParam, ITextRegionList newRegions) {</TD></TR><TR CLASS="z"><TD CLASS="l">214</TD><TD> int startOfDifferences = -1;</TD></TR><TR CLASS="z"><TD CLASS="l">215</TD><TD> int newRegionsLength = newRegions.size();</TD></TR><TR CLASS="z"><TD CLASS="l">216</TD><TD> boolean foundDifference = false;</TD></TR><TR CLASS="z"><TD CLASS="l">217</TD><TD> boolean done = false;</TD></TR><TR><TD CLASS="l">218</TD><TD> // we'll control our loop based on the old List length</TD></TR><TR CLASS="z"><TD CLASS="l">219</TD><TD> int oldRegionsLength = oldRegions.size();</TD></TR><TR><TD CLASS="l">220</TD><TD> // be sure to check 'done' first, so startOfDifferences isn't</TD></TR><TR><TD CLASS="l">221</TD><TD> // icremented if done is true</TD></TR><TR CLASS="z"><TD CLASS="l">222</TD><TD> done : while ((!done) && (++startOfDifferences < oldRegionsLength)) {</TD></TR><TR CLASS="z"><TD CLASS="l">223</TD><TD> ITextRegion oldRegion = oldRegions.get(startOfDifferences);</TD></TR><TR><TD CLASS="l">224</TD><TD> // this lessThanEffectedRegion is to check to be sure the node is</TD></TR><TR><TD CLASS="l">225</TD><TD> // infact a candidate</TD></TR><TR><TD CLASS="l">226</TD><TD> // to be considered as "old". This check is important for the case</TD></TR><TR><TD CLASS="l">227</TD><TD> // where some</TD></TR><TR><TD CLASS="l">228</TD><TD> // text is replaceing text that</TD></TR><TR><TD CLASS="l">229</TD><TD> // appears identical, but is a different instance. For example, if</TD></TR><TR><TD CLASS="l">230</TD><TD> // the text</TD></TR><TR><TD CLASS="l">231</TD><TD> // is <P><B></B></P> and <B></B> is inserted at postion 3,</TD></TR><TR><TD CLASS="l">232</TD><TD> // resulting in <P><B></B><B></B></P></TD></TR><TR><TD CLASS="l">233</TD><TD> // we do not want the</TD></TR><TR><TD CLASS="l">234</TD><TD> // first <B> to be considered old ... it is the new one, the</TD></TR><TR><TD CLASS="l">235</TD><TD> // second</TD></TR><TR><TD CLASS="l">236</TD><TD> // <B> is the old one.</TD></TR><TR CLASS="z"><TD CLASS="l">237</TD><TD> if (_lessThanEffectedRegion(oldNodeParam, oldRegion)) {</TD></TR><TR><TD CLASS="l">238</TD><TD> // be sure to check that we have new nodes to compare against.</TD></TR><TR CLASS="z"><TD CLASS="l">239</TD><TD> if (startOfDifferences > newRegionsLength) {</TD></TR><TR CLASS="z"><TD CLASS="l">240</TD><TD> foundDifference = false;</TD></TR><TR CLASS="z"><TD CLASS="l">241</TD><TD> done = true;</TD></TR><TR CLASS="z"><TD CLASS="l">242</TD><TD> continue done;</TD></TR><TR><TD CLASS="l">243</TD><TD> } else {</TD></TR><TR><TD CLASS="l">244</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">245</TD><TD> ITextRegion newRegion = newRegions.get(startOfDifferences);</TD></TR><TR><TD CLASS="l">246</TD><TD> // note: shift is 0 while at beginning of list, before the</TD></TR><TR><TD CLASS="l">247</TD><TD> // insertion (or deletion) point. After that, it is</TD></TR><TR><TD CLASS="l">248</TD><TD> // fStart+fLengthDifference</TD></TR><TR CLASS="z"><TD CLASS="l">249</TD><TD> if (!(oldNodeParam.sameAs(oldRegion, newNodeParam, newRegion, 0))) {</TD></TR><TR CLASS="z"><TD CLASS="l">250</TD><TD> foundDifference = true;</TD></TR><TR CLASS="z"><TD CLASS="l">251</TD><TD> done = true;</TD></TR><TR CLASS="z"><TD CLASS="l">252</TD><TD> continue done;</TD></TR><TR><TD CLASS="l">253</TD><TD> } else {</TD></TR><TR><TD CLASS="l">254</TD><TD> // if they are equal, then we will be keeping the old</TD></TR><TR><TD CLASS="l">255</TD><TD> // one.</TD></TR><TR><TD CLASS="l">256</TD><TD> // unlike the flatnode case, there is no reason to</TD></TR><TR><TD CLASS="l">257</TD><TD> // update</TD></TR><TR><TD CLASS="l">258</TD><TD> // the textstore, since its the same text store in</TD></TR><TR><TD CLASS="l">259</TD><TD> // either case</TD></TR><TR><TD CLASS="l">260</TD><TD> // (since its the same flatnode)</TD></TR><TR><TD CLASS="l">261</TD><TD> //oldRegion.setTextStore(fStructuredDocument.parentDocument);</TD></TR><TR><TD CLASS="l">262</TD><TD> }</TD></TR><TR><TD CLASS="l">263</TD><TD> }</TD></TR><TR><TD CLASS="l">264</TD><TD> } else {</TD></TR><TR><TD CLASS="l">265</TD><TD> // we didn't literally find a difference, but we count it as</TD></TR><TR><TD CLASS="l">266</TD><TD> // such by implication</TD></TR><TR CLASS="z"><TD CLASS="l">267</TD><TD> foundDifference = true;</TD></TR><TR CLASS="z"><TD CLASS="l">268</TD><TD> done = true;</TD></TR><TR><TD CLASS="l">269</TD><TD> continue done;</TD></TR><TR><TD CLASS="l">270</TD><TD> }</TD></TR><TR><TD CLASS="l">271</TD><TD> }</TD></TR><TR><TD CLASS="l">272</TD><TD> // if we literally found a difference, then all is ok and we can</TD></TR><TR><TD CLASS="l">273</TD><TD> // return</TD></TR><TR><TD CLASS="l">274</TD><TD> // it.</TD></TR><TR><TD CLASS="l">275</TD><TD> // if we did not literally find one, then we have to decide why.</TD></TR><TR CLASS="z"><TD CLASS="l">276</TD><TD> if (!foundDifference) {</TD></TR><TR CLASS="z"><TD CLASS="l">277</TD><TD> if (newRegionsLength == oldRegionsLength) { // then lists are</TD></TR><TR><TD CLASS="l">278</TD><TD> // identical (and may</TD></TR><TR><TD CLASS="l">279</TD><TD> // be of zero length)</TD></TR><TR CLASS="z"><TD CLASS="l">280</TD><TD> startOfDifferences = -1;</TD></TR><TR><TD CLASS="l">281</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">282</TD><TD> if (newRegionsLength > oldRegionsLength) { // then lists are</TD></TR><TR><TD CLASS="l">283</TD><TD> // identical except</TD></TR><TR><TD CLASS="l">284</TD><TD> // for newRegions</TD></TR><TR><TD CLASS="l">285</TD><TD> // added</TD></TR><TR CLASS="z"><TD CLASS="l">286</TD><TD> startOfDifferences = oldRegionsLength;</TD></TR><TR><TD CLASS="l">287</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">288</TD><TD> if (newRegionsLength < oldRegionsLength) { // then lists</TD></TR><TR><TD CLASS="l">289</TD><TD> // are identical</TD></TR><TR><TD CLASS="l">290</TD><TD> // except for</TD></TR><TR><TD CLASS="l">291</TD><TD> // old Nodes</TD></TR><TR><TD CLASS="l">292</TD><TD> // deleted</TD></TR><TR CLASS="z"><TD CLASS="l">293</TD><TD> startOfDifferences = newRegionsLength;</TD></TR><TR><TD CLASS="l">294</TD><TD> }</TD></TR><TR><TD CLASS="l">295</TD><TD> }</TD></TR><TR><TD CLASS="l">296</TD><TD> }</TD></TR><TR><TD CLASS="l">297</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">298</TD><TD> return startOfDifferences;</TD></TR><TR><TD CLASS="l">299</TD><TD> }</TD></TR><TR><TD CLASS="l">300</TD><TD> </TD></TR><TR><TD CLASS="l">301</TD><TD> /**</TD></TR><TR><TD CLASS="l">302</TD><TD> * Part 1 of 2 steps to do a core_reparse</TD></TR><TR><TD CLASS="l">303</TD><TD> * </TD></TR><TR><TD CLASS="l"><A NAME="31">304</A></TD><TD> * Parses a portion of the current text in the IStructuredDocument and</TD></TR><TR><TD CLASS="l">305</TD><TD> * returns the raw result</TD></TR><TR><TD CLASS="l">306</TD><TD> */</TD></TR><TR><TD CLASS="l">307</TD><TD> private IStructuredDocumentRegion _core_reparse_text(int rescanStart, int rescanEnd) {</TD></TR><TR CLASS="c"><TD CLASS="l">308</TD><TD> fStructuredDocument.resetParser(rescanStart, rescanEnd);</TD></TR><TR CLASS="c"><TD CLASS="l">309</TD><TD> return fStructuredDocument.getParser().getDocumentRegions();</TD></TR><TR><TD CLASS="l">310</TD><TD> }</TD></TR><TR><TD CLASS="l">311</TD><TD> </TD></TR><TR><TD CLASS="l">312</TD><TD> /**</TD></TR><TR><TD CLASS="l">313</TD><TD> * Part 2 of 2 steps to do a core_reparse</TD></TR><TR><TD CLASS="l">314</TD><TD> * </TD></TR><TR><TD CLASS="l">315</TD><TD> * Integrates a list of StructuredDocumentRegions based on the current</TD></TR><TR><TD CLASS="l"><A NAME="2f">316</A></TD><TD> * text contents of the IStructuredDocument into the IStructuredDocument</TD></TR><TR><TD CLASS="l">317</TD><TD> * data structure</TD></TR><TR><TD CLASS="l">318</TD><TD> */</TD></TR><TR><TD CLASS="l">319</TD><TD> private StructuredDocumentEvent _core_reparse_update_model(IStructuredDocumentRegion newNodesHead, int rescanStart, int rescanEnd, CoreNodeList oldNodes, boolean firstTime) {</TD></TR><TR CLASS="c"><TD CLASS="l">320</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="c"><TD CLASS="l">321</TD><TD> CoreNodeList newNodes = null;</TD></TR><TR><TD CLASS="l">322</TD><TD> // rescan</TD></TR><TR CLASS="c"><TD CLASS="l">323</TD><TD> newNodes = new CoreNodeList(newNodesHead);</TD></TR><TR><TD CLASS="l">324</TD><TD> // adjust our newNode chain so the offset positions match</TD></TR><TR><TD CLASS="l">325</TD><TD> // our text store (not the simple string of text reparsed)</TD></TR><TR CLASS="c"><TD CLASS="l">326</TD><TD> StructuredDocumentRegionIterator.adjustStart(newNodesHead, rescanStart);</TD></TR><TR><TD CLASS="l">327</TD><TD> // initialize the parentDocument variable of each instance in the new</TD></TR><TR><TD CLASS="l">328</TD><TD> // chain</TD></TR><TR CLASS="c"><TD CLASS="l">329</TD><TD> StructuredDocumentRegionIterator.setParentDocument(newNodesHead, fStructuredDocument);</TD></TR><TR><TD CLASS="l">330</TD><TD> // initialize the structuredDocument variable of each instance in the</TD></TR><TR><TD CLASS="l">331</TD><TD> // new chain</TD></TR><TR><TD CLASS="l">332</TD><TD> //StructuredDocumentRegionIterator.setStructuredDocument(newNodesHead,</TD></TR><TR><TD CLASS="l">333</TD><TD> // fStructuredDocument);</TD></TR><TR><TD CLASS="l">334</TD><TD> //</TD></TR><TR CLASS="c"><TD CLASS="l">335</TD><TD> if (firstTime) {</TD></TR><TR CLASS="c"><TD CLASS="l">336</TD><TD> fStructuredDocument.setCachedDocumentRegion(newNodesHead);</TD></TR><TR CLASS="c"><TD CLASS="l">337</TD><TD> fStructuredDocument.initializeFirstAndLastDocumentRegion();</TD></TR><TR><TD CLASS="l">338</TD><TD> // note: since we are inserting nodes, for the first time, there</TD></TR><TR><TD CLASS="l">339</TD><TD> // is</TD></TR><TR><TD CLASS="l">340</TD><TD> // no adjustments</TD></TR><TR><TD CLASS="l">341</TD><TD> // to downstream stuff necessary.</TD></TR><TR CLASS="c"><TD CLASS="l">342</TD><TD> result = new StructuredDocumentRegionsReplacedEvent(fStructuredDocument, fRequester, oldNodes, newNodes, fChanges, fStart, fLengthToReplace);</TD></TR><TR><TD CLASS="l">343</TD><TD> } else {</TD></TR><TR><TD CLASS="l">344</TD><TD> // note: integrates changes into model as a side effect</TD></TR><TR CLASS="z"><TD CLASS="l">345</TD><TD> result = minimumEvent(oldNodes, newNodes);</TD></TR><TR><TD CLASS="l">346</TD><TD> }</TD></TR><TR CLASS="c"><TD CLASS="l">347</TD><TD> result.setDeletedText(fDeletedText);</TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="5">348</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">349</TD><TD> }</TD></TR><TR><TD CLASS="l">350</TD><TD> </TD></TR><TR><TD CLASS="l">351</TD><TD> private CoreNodeList _formMinimumList(CoreNodeList flatnodes, int startOfDifferences, int endOfDifferences) {</TD></TR><TR CLASS="z"><TD CLASS="l">352</TD><TD> CoreNodeList minimalNodes = null;</TD></TR><TR><TD CLASS="l">353</TD><TD> // if startOfDifferces is still its initial value, then we have an</TD></TR><TR><TD CLASS="l">354</TD><TD> // empty document</TD></TR><TR CLASS="z"><TD CLASS="l">355</TD><TD> if (startOfDifferences == -1) {</TD></TR><TR CLASS="z"><TD CLASS="l">356</TD><TD> minimalNodes = EMPTY_LIST;</TD></TR><TR><TD CLASS="l">357</TD><TD> } else {</TD></TR><TR><TD CLASS="l">358</TD><TD> // if we do not have any flatnode in our flatnode list, then</TD></TR><TR><TD CLASS="l">359</TD><TD> // simply</TD></TR><TR><TD CLASS="l">360</TD><TD> // return our standard empty list</TD></TR><TR CLASS="z"><TD CLASS="l">361</TD><TD> if (flatnodes.getLength() == 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">362</TD><TD> minimalNodes = EMPTY_LIST;</TD></TR><TR><TD CLASS="l">363</TD><TD> } else {</TD></TR><TR><TD CLASS="l">364</TD><TD> // if startOfDifferences is greater than endOfDifferences,</TD></TR><TR><TD CLASS="l">365</TD><TD> // then</TD></TR><TR><TD CLASS="l">366</TD><TD> // that means the calculations "crossed" each other, and</TD></TR><TR><TD CLASS="l">367</TD><TD> // hence,</TD></TR><TR><TD CLASS="l">368</TD><TD> // there really is no differences, so, again, return the empty</TD></TR><TR><TD CLASS="l">369</TD><TD> // list</TD></TR><TR CLASS="z"><TD CLASS="l">370</TD><TD> if (startOfDifferences > endOfDifferences) {</TD></TR><TR CLASS="z"><TD CLASS="l">371</TD><TD> minimalNodes = EMPTY_LIST;</TD></TR><TR><TD CLASS="l">372</TD><TD> } else {</TD></TR><TR><TD CLASS="l">373</TD><TD> // the last check be sure we have some differnces</TD></TR><TR CLASS="z"><TD CLASS="l">374</TD><TD> if ((endOfDifferences > -1)) {</TD></TR><TR CLASS="z"><TD CLASS="l">375</TD><TD> minimalNodes = new CoreNodeList(flatnodes.item(startOfDifferences), flatnodes.item(endOfDifferences));</TD></TR><TR><TD CLASS="l">376</TD><TD> } else {</TD></TR><TR><TD CLASS="l">377</TD><TD> // there were no differences, the list wasn't</TD></TR><TR><TD CLASS="l">378</TD><TD> // minimized, so simply return it.</TD></TR><TR CLASS="z"><TD CLASS="l">379</TD><TD> minimalNodes = flatnodes;</TD></TR><TR><TD CLASS="l">380</TD><TD> }</TD></TR><TR><TD CLASS="l">381</TD><TD> }</TD></TR><TR><TD CLASS="l">382</TD><TD> }</TD></TR><TR><TD CLASS="l">383</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="6">384</A></TD><TD> return minimalNodes;</TD></TR><TR><TD CLASS="l">385</TD><TD> }</TD></TR><TR><TD CLASS="l">386</TD><TD> </TD></TR><TR><TD CLASS="l">387</TD><TD> private boolean _greaterThanEffectedRegion(IStructuredDocumentRegion oldNode) {</TD></TR><TR CLASS="z"><TD CLASS="l">388</TD><TD> boolean result = false;</TD></TR><TR CLASS="z"><TD CLASS="l">389</TD><TD> int nodeStart = oldNode.getStartOffset();</TD></TR><TR CLASS="z"><TD CLASS="l">390</TD><TD> int changedRegionEnd = fStart + fLengthToReplace - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">391</TD><TD> result = nodeStart > changedRegionEnd;</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="7">392</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">393</TD><TD> }</TD></TR><TR><TD CLASS="l">394</TD><TD> </TD></TR><TR><TD CLASS="l">395</TD><TD> private boolean _greaterThanEffectedRegion(IStructuredDocumentRegion oldNode, ITextRegion oldRegion) {</TD></TR><TR CLASS="z"><TD CLASS="l">396</TD><TD> boolean result = false;</TD></TR><TR CLASS="z"><TD CLASS="l">397</TD><TD> int regionStartOffset = oldNode.getStartOffset(oldRegion);</TD></TR><TR CLASS="z"><TD CLASS="l">398</TD><TD> int effectedRegionEnd = fStart + fLengthToReplace - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">399</TD><TD> result = regionStartOffset > effectedRegionEnd;</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="8">400</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">401</TD><TD> }</TD></TR><TR><TD CLASS="l">402</TD><TD> </TD></TR><TR><TD CLASS="l">403</TD><TD> private boolean _lessThanEffectedRegion(IStructuredDocumentRegion oldNode) {</TD></TR><TR CLASS="z"><TD CLASS="l">404</TD><TD> boolean result = false;</TD></TR><TR CLASS="z"><TD CLASS="l">405</TD><TD> int nodeEnd = oldNode.getEndOffset() - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">406</TD><TD> result = nodeEnd < fStart;</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="9">407</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">408</TD><TD> }</TD></TR><TR><TD CLASS="l">409</TD><TD> </TD></TR><TR><TD CLASS="l">410</TD><TD> private boolean _lessThanEffectedRegion(IStructuredDocumentRegion oldNode, ITextRegion oldRegion) {</TD></TR><TR CLASS="z"><TD CLASS="l">411</TD><TD> boolean result = false;</TD></TR><TR CLASS="z"><TD CLASS="l">412</TD><TD> int nodeEnd = oldNode.getEndOffset(oldRegion) - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">413</TD><TD> result = nodeEnd < fStart;</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="a">414</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">415</TD><TD> }</TD></TR><TR><TD CLASS="l">416</TD><TD> </TD></TR><TR><TD CLASS="l">417</TD><TD> private boolean _regionsSameKind(ITextRegion newRegion, ITextRegion oldRegion) {</TD></TR><TR CLASS="z"><TD CLASS="l">418</TD><TD> boolean result = false;</TD></TR><TR><TD CLASS="l">419</TD><TD> // if one region is a container region, and the other not, always</TD></TR><TR><TD CLASS="l">420</TD><TD> // return false</TD></TR><TR><TD CLASS="l">421</TD><TD> // else, just check their type.</TD></TR><TR><TD CLASS="l">422</TD><TD> // DW druing refactoring, looks like a "typo" here, using 'old' in</TD></TR><TR><TD CLASS="l">423</TD><TD> // both.</TD></TR><TR><TD CLASS="l">424</TD><TD> // if (isContainerRegion(oldRegion) != isContainerRegion(oldRegion))</TD></TR><TR CLASS="z"><TD CLASS="l">425</TD><TD> if (isCollectionRegion(oldRegion) != isCollectionRegion(newRegion))</TD></TR><TR CLASS="z"><TD CLASS="l">426</TD><TD> result = false;</TD></TR><TR CLASS="z"><TD CLASS="l">427</TD><TD> else if (oldRegion.getType() == newRegion.getType())</TD></TR><TR CLASS="z"><TD CLASS="l">428</TD><TD> result = true;</TD></TR><TR CLASS="z"><TD CLASS="l">429</TD><TD> return result;</TD></TR><TR><TD CLASS="l">430</TD><TD> }</TD></TR><TR><TD CLASS="l">431</TD><TD> </TD></TR><TR><TD CLASS="l">432</TD><TD> // private boolean hasCollectionRegions(ITextRegion aRegion) {</TD></TR><TR><TD CLASS="l">433</TD><TD> // boolean result = false;</TD></TR><TR><TD CLASS="l">434</TD><TD> // if (aRegion instanceof ITextRegionCollection) {</TD></TR><TR><TD CLASS="l">435</TD><TD> // ITextRegionCollection regionContainter = (ITextRegionCollection)</TD></TR><TR><TD CLASS="l">436</TD><TD> // aRegion;</TD></TR><TR><TD CLASS="l">437</TD><TD> // ITextRegionList regions = regionContainter.getRegions();</TD></TR><TR><TD CLASS="l">438</TD><TD> // Iterator iterator = regions.iterator();</TD></TR><TR><TD CLASS="l">439</TD><TD> // while (iterator.hasNext()) {</TD></TR><TR><TD CLASS="l">440</TD><TD> // if (aRegion instanceof ITextRegionCollection) {</TD></TR><TR><TD CLASS="l">441</TD><TD> // result = true;</TD></TR><TR><TD CLASS="l">442</TD><TD> // break;</TD></TR><TR><TD CLASS="l">443</TD><TD> // }</TD></TR><TR><TD CLASS="l">444</TD><TD> // }</TD></TR><TR><TD CLASS="l">445</TD><TD> // }</TD></TR><TR><TD CLASS="l">446</TD><TD> // return result;</TD></TR><TR><TD CLASS="l">447</TD><TD> // }</TD></TR><TR><TD CLASS="l">448</TD><TD> /**</TD></TR><TR><TD CLASS="l">449</TD><TD> * This method is specifically to detect changes in 'isEnded' state,</TD></TR><TR><TD CLASS="l"><A NAME="b">450</A></TD><TD> * although it still does so with heuristics. If number of '>' changes,</TD></TR><TR><TD CLASS="l">451</TD><TD> * assume the isEnded state has changed.</TD></TR><TR><TD CLASS="l">452</TD><TD> */</TD></TR><TR><TD CLASS="l">453</TD><TD> private boolean changeInIsEndedState(String oldText, String newText) {</TD></TR><TR CLASS="z"><TD CLASS="l">454</TD><TD> int nOld = StringUtils.occurrencesOf(oldText, '>');</TD></TR><TR CLASS="z"><TD CLASS="l">455</TD><TD> int nNew = StringUtils.occurrencesOf(newText, '>');</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="c">456</A></TD><TD> return !(nOld == nNew);</TD></TR><TR><TD CLASS="l">457</TD><TD> }</TD></TR><TR><TD CLASS="l">458</TD><TD> </TD></TR><TR><TD CLASS="l">459</TD><TD> private void checkAndAssignParent(IStructuredDocumentRegion oldNode, ITextRegion region) {</TD></TR><TR CLASS="z"><TD CLASS="l">460</TD><TD> if (region instanceof ITextRegionContainer) {</TD></TR><TR CLASS="z"><TD CLASS="l">461</TD><TD> ((ITextRegionContainer) region).setParent(oldNode);</TD></TR><TR CLASS="z"><TD CLASS="l">462</TD><TD> return;</TD></TR><TR><TD CLASS="l">463</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">464</TD><TD> if (region instanceof ITextRegionCollection) {</TD></TR><TR CLASS="z"><TD CLASS="l">465</TD><TD> ITextRegionCollection textRegionCollection = (ITextRegionCollection) region;</TD></TR><TR CLASS="z"><TD CLASS="l">466</TD><TD> ITextRegionList regionList = textRegionCollection.getRegions();</TD></TR><TR CLASS="z"><TD CLASS="l">467</TD><TD> for (int i = 0; i < regionList.size(); i++) {</TD></TR><TR CLASS="z"><TD CLASS="l">468</TD><TD> ITextRegion innerRegion = regionList.get(i);</TD></TR><TR CLASS="z"><TD CLASS="l">469</TD><TD> checkAndAssignParent(oldNode, innerRegion);</TD></TR><TR><TD CLASS="l">470</TD><TD> }</TD></TR><TR><TD CLASS="l">471</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">472</TD><TD> }</TD></TR><TR><TD CLASS="l">473</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="d">474</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">475</TD><TD> * A change to a CDATA tag can result in all being reparsed.</TD></TR><TR><TD CLASS="l">476</TD><TD> */</TD></TR><TR><TD CLASS="l">477</TD><TD> private StructuredDocumentEvent checkForCDATA() {</TD></TR><TR CLASS="z"><TD CLASS="l">478</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">479</TD><TD> result = checkForCriticalKey("<![CDATA["); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">480</TD><TD> if (result == null)</TD></TR><TR CLASS="z"><TD CLASS="l">481</TD><TD> result = checkForCriticalKey("]]>"); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">482</TD><TD> return result;</TD></TR><TR><TD CLASS="l">483</TD><TD> }</TD></TR><TR><TD CLASS="l">484</TD><TD> </TD></TR><TR><TD CLASS="l">485</TD><TD> /**</TD></TR><TR><TD CLASS="l">486</TD><TD> * If a comment start or end tag is being added or deleted, we'll rescan</TD></TR><TR><TD CLASS="l">487</TD><TD> * the whole document. The reason is that content that is revealed or</TD></TR><TR><TD CLASS="l">488</TD><TD> * commented out can effect the interpretation of the rest of the</TD></TR><TR><TD CLASS="l"><A NAME="e">489</A></TD><TD> * document. Note: for now this is very XML specific, can refactor/improve</TD></TR><TR><TD CLASS="l">490</TD><TD> * later.</TD></TR><TR><TD CLASS="l">491</TD><TD> */</TD></TR><TR><TD CLASS="l">492</TD><TD> protected StructuredDocumentEvent checkForComments() {</TD></TR><TR CLASS="z"><TD CLASS="l">493</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">494</TD><TD> result = checkForCriticalKey("<!--"); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">495</TD><TD> if (result == null)</TD></TR><TR CLASS="z"><TD CLASS="l">496</TD><TD> result = checkForCriticalKey("-->"); //$NON-NLS-1$</TD></TR><TR><TD CLASS="l">497</TD><TD> // we'll also check for these degenerate cases</TD></TR><TR CLASS="z"><TD CLASS="l">498</TD><TD> if (result == null)</TD></TR><TR CLASS="z"><TD CLASS="l">499</TD><TD> result = checkForCriticalKey("<!--->"); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">500</TD><TD> return result;</TD></TR><TR><TD CLASS="l">501</TD><TD> }</TD></TR><TR><TD CLASS="l">502</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="f">503</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">504</TD><TD> * Common utility for checking for critical word such as " <SCRIPT>"</TD></TR><TR><TD CLASS="l">505</TD><TD> */</TD></TR><TR><TD CLASS="l">506</TD><TD> protected StructuredDocumentEvent checkForCriticalKey(String criticalTarget) {</TD></TR><TR CLASS="z"><TD CLASS="l">507</TD><TD> return _checkForCriticalWord(criticalTarget, false);</TD></TR><TR><TD CLASS="l">508</TD><TD> }</TD></TR><TR><TD CLASS="l">509</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="10">510</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">511</TD><TD> * Common utility for checking for critical word such as " <SCRIPT>"</TD></TR><TR><TD CLASS="l">512</TD><TD> */</TD></TR><TR><TD CLASS="l">513</TD><TD> private StructuredDocumentEvent checkForCriticalName(String criticalTarget) {</TD></TR><TR CLASS="z"><TD CLASS="l">514</TD><TD> return _checkForCriticalWord(criticalTarget, true);</TD></TR><TR><TD CLASS="l">515</TD><TD> }</TD></TR><TR><TD CLASS="l">516</TD><TD> </TD></TR><TR><TD CLASS="l">517</TD><TD> // /**</TD></TR><TR><TD CLASS="l">518</TD><TD> // * Currently this method is pretty specific to ?ML</TD></TR><TR><TD CLASS="l"><A NAME="11">519</A></TD><TD> // * @deprecated - not really deprecated, but plan to make</TD></TR><TR><TD CLASS="l">520</TD><TD> // * protected ... I'm not sure why its public or misspelled?</TD></TR><TR><TD CLASS="l">521</TD><TD> // */</TD></TR><TR><TD CLASS="l">522</TD><TD> protected StructuredDocumentEvent checkForCrossStructuredDocumentRegionBoundryCases() {</TD></TR><TR CLASS="z"><TD CLASS="l">523</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR><TD CLASS="l">524</TD><TD> // Case 1: See if the language's syntax requires that multiple</TD></TR><TR><TD CLASS="l">525</TD><TD> // StructuredDocumentRegions be rescanned</TD></TR><TR CLASS="z"><TD CLASS="l">526</TD><TD> if (result == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">527</TD><TD> result = checkForCrossStructuredDocumentRegionSyntax();</TD></TR><TR><TD CLASS="l">528</TD><TD> }</TD></TR><TR><TD CLASS="l">529</TD><TD> // Case 2: "block tags" whose content is left unparsed</TD></TR><TR CLASS="z"><TD CLASS="l">530</TD><TD> if (result == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">531</TD><TD> Object parser = fStructuredDocument.getParser();</TD></TR><TR CLASS="z"><TD CLASS="l">532</TD><TD> if (parser instanceof BlockTagParser) {</TD></TR><TR CLASS="z"><TD CLASS="l">533</TD><TD> List blockTags = ((BlockTagParser) parser).getBlockMarkers();</TD></TR><TR CLASS="z"><TD CLASS="l">534</TD><TD> result = _checkBlockNodeList(blockTags);</TD></TR><TR><TD CLASS="l">535</TD><TD> }</TD></TR><TR><TD CLASS="l">536</TD><TD> }</TD></TR><TR><TD CLASS="l">537</TD><TD> // FUTURE_TO_DO: is there a better place to do this?</TD></TR><TR><TD CLASS="l">538</TD><TD> // or! do we already do it some other more central place?</TD></TR><TR CLASS="z"><TD CLASS="l">539</TD><TD> if (result != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">540</TD><TD> result.setDeletedText(fDeletedText);</TD></TR><TR><TD CLASS="l">541</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">542</TD><TD> return result;</TD></TR><TR><TD CLASS="l">543</TD><TD> }</TD></TR><TR><TD CLASS="l">544</TD><TD> </TD></TR><TR><TD CLASS="l">545</TD><TD> /**</TD></TR><TR><TD CLASS="l">546</TD><TD> * Allow a reparser to check for extra syntactic cases that require</TD></TR><TR><TD CLASS="l">547</TD><TD> * parsing beyond the flatNode boundary.</TD></TR><TR><TD CLASS="l">548</TD><TD> * </TD></TR><TR><TD CLASS="l">549</TD><TD> * This implementation is very XML-centric.</TD></TR><TR><TD CLASS="l"><A NAME="12">550</A></TD><TD> */</TD></TR><TR><TD CLASS="l">551</TD><TD> protected StructuredDocumentEvent checkForCrossStructuredDocumentRegionSyntax() {</TD></TR><TR><TD CLASS="l">552</TD><TD> StructuredDocumentEvent result;</TD></TR><TR><TD CLASS="l">553</TD><TD> // Case 1: Quote characters are involved</TD></TR><TR CLASS="z"><TD CLASS="l">554</TD><TD> result = checkForQuotes();</TD></TR><TR CLASS="z"><TD CLASS="l">555</TD><TD> if (result == null) {</TD></TR><TR><TD CLASS="l">556</TD><TD> // Case 2: The input forms or undoes a comment beginning or</TD></TR><TR><TD CLASS="l">557</TD><TD> // comment</TD></TR><TR><TD CLASS="l">558</TD><TD> // end</TD></TR><TR CLASS="z"><TD CLASS="l">559</TD><TD> result = checkForComments();</TD></TR><TR><TD CLASS="l">560</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">561</TD><TD> if (result == null) {</TD></TR><TR><TD CLASS="l">562</TD><TD> // Case 3: The input forms or undoes a processing instruction</TD></TR><TR CLASS="z"><TD CLASS="l">563</TD><TD> result = checkForPI();</TD></TR><TR><TD CLASS="l">564</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">565</TD><TD> if (result == null) {</TD></TR><TR><TD CLASS="l">566</TD><TD> // Case 4: The input forms or undoes a CDATA section</TD></TR><TR CLASS="z"><TD CLASS="l">567</TD><TD> result = checkForCDATA();</TD></TR><TR><TD CLASS="l">568</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">569</TD><TD> return result;</TD></TR><TR><TD CLASS="l">570</TD><TD> }</TD></TR><TR><TD CLASS="l">571</TD><TD> </TD></TR><TR><TD CLASS="l">572</TD><TD> /**</TD></TR><TR><TD CLASS="l">573</TD><TD> * Checks to see if change request exactly matches the text it would be</TD></TR><TR><TD CLASS="l"><A NAME="13">574</A></TD><TD> * replacing. (In future, this, or similar method is where to check for</TD></TR><TR><TD CLASS="l">575</TD><TD> * "read only" attempted change.)</TD></TR><TR><TD CLASS="l">576</TD><TD> */</TD></TR><TR><TD CLASS="l">577</TD><TD> private StructuredDocumentEvent checkForNoChange() {</TD></TR><TR CLASS="z"><TD CLASS="l">578</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR><TD CLASS="l">579</TD><TD> // don't check equals unless lengths match</TD></TR><TR><TD CLASS="l">580</TD><TD> // should be a tiny bit faster, since usually not</TD></TR><TR><TD CLASS="l">581</TD><TD> // of equal lengths (I'm surprised String's equals method</TD></TR><TR><TD CLASS="l">582</TD><TD> // doesn't do this.)</TD></TR><TR CLASS="z"><TD CLASS="l">583</TD><TD> if ((fChanges != null) && (fDeletedText != null) && (fChanges.length() == fDeletedText.length()) && (fChanges.equals(fDeletedText))) {</TD></TR><TR CLASS="z"><TD CLASS="l">584</TD><TD> result = new NoChangeEvent(fStructuredDocument, fRequester, fChanges, fStart, fLengthToReplace);</TD></TR><TR><TD CLASS="l">585</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">586</TD><TD> return result;</TD></TR><TR><TD CLASS="l">587</TD><TD> }</TD></TR><TR><TD CLASS="l">588</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="14">589</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">590</TD><TD> * A change to a PI tag can result in all being reparsed.</TD></TR><TR><TD CLASS="l">591</TD><TD> */</TD></TR><TR><TD CLASS="l">592</TD><TD> private StructuredDocumentEvent checkForPI() {</TD></TR><TR CLASS="z"><TD CLASS="l">593</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">594</TD><TD> result = checkForCriticalKey("<?"); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">595</TD><TD> if (result == null)</TD></TR><TR CLASS="z"><TD CLASS="l">596</TD><TD> result = checkForCriticalKey("?>"); //$NON-NLS-1$</TD></TR><TR CLASS="z"><TD CLASS="l">597</TD><TD> return result;</TD></TR><TR><TD CLASS="l">598</TD><TD> }</TD></TR><TR><TD CLASS="l">599</TD><TD> </TD></TR><TR><TD CLASS="l">600</TD><TD> // For simplicity, if either text to be deleted, or text to be inserted</TD></TR><TR><TD CLASS="l">601</TD><TD> // contains at least</TD></TR><TR><TD CLASS="l">602</TD><TD> // one quote, we'll search for previous quote in document, if any, and use</TD></TR><TR><TD CLASS="l">603</TD><TD> // that flatnode as</TD></TR><TR><TD CLASS="l">604</TD><TD> // a dirty start, and we'll use end of document as dirty end. We need to</TD></TR><TR><TD CLASS="l">605</TD><TD> // assume either \" or</TD></TR><TR><TD CLASS="l">606</TD><TD> // \' is an exceptable quote. (NOTE: this is, loosely, an XML assumption</TD></TR><TR><TD CLASS="l">607</TD><TD> // --</TD></TR><TR><TD CLASS="l">608</TD><TD> // other languages</TD></TR><TR><TD CLASS="l">609</TD><TD> // would differ, but we'll "hard code" for XML for now.</TD></TR><TR><TD CLASS="l">610</TD><TD> // future_TODO: this is a really bad heuristic ... we should be looking</TD></TR><TR><TD CLASS="l">611</TD><TD> // for</TD></TR><TR><TD CLASS="l">612</TD><TD> // odd number of quotes</TD></TR><TR><TD CLASS="l">613</TD><TD> // within a structuredDocumentRegion (or something!) This causes way too</TD></TR><TR><TD CLASS="l">614</TD><TD> // much reparsing on</TD></TR><TR><TD CLASS="l"><A NAME="15">615</A></TD><TD> // simple cases, like deleting a tag with a quoted attribute!</TD></TR><TR><TD CLASS="l">616</TD><TD> private StructuredDocumentEvent checkForQuotes() {</TD></TR><TR><TD CLASS="l">617</TD><TD> // routine is supported with null or empty string meaning the same</TD></TR><TR><TD CLASS="l">618</TD><TD> // thing: deletion</TD></TR><TR CLASS="z"><TD CLASS="l">619</TD><TD> if (fChanges == null)</TD></TR><TR CLASS="z"><TD CLASS="l">620</TD><TD> fChanges = ""; //$NON-NLS-1$</TD></TR><TR><TD CLASS="l">621</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">622</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR><TD CLASS="l">623</TD><TD> try {</TD></TR><TR CLASS="z"><TD CLASS="l">624</TD><TD> int dirtyStartPos = -1;</TD></TR><TR CLASS="z"><TD CLASS="l">625</TD><TD> String proposedDeletion = fStructuredDocument.get(fStart, fLengthToReplace);</TD></TR><TR CLASS="z"><TD CLASS="l">626</TD><TD> if (fStart < fStructuredDocument.getLength()) {</TD></TR><TR CLASS="z"><TD CLASS="l">627</TD><TD> if ((fChanges.indexOf(singleQuote) > -1) || (proposedDeletion.indexOf(singleQuote) > -1)) {</TD></TR><TR CLASS="z"><TD CLASS="l">628</TD><TD> IRegion singleQuoteRegion = getFindReplaceDocumentAdapter().find(fStart, singleQuote, false, false, false, false);</TD></TR><TR CLASS="z"><TD CLASS="l">629</TD><TD> if (singleQuoteRegion != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">630</TD><TD> dirtyStartPos = singleQuoteRegion.getOffset();</TD></TR><TR><TD CLASS="l">631</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">632</TD><TD> } else if ((fChanges.indexOf(doubleQuote) > -1) || (proposedDeletion.indexOf(doubleQuote) > -1)) {</TD></TR><TR CLASS="z"><TD CLASS="l">633</TD><TD> IRegion doubleQuoteRegion = getFindReplaceDocumentAdapter().find(fStart, doubleQuote, false, false, false, false);</TD></TR><TR CLASS="z"><TD CLASS="l">634</TD><TD> if (doubleQuoteRegion != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">635</TD><TD> dirtyStartPos = doubleQuoteRegion.getOffset();</TD></TR><TR><TD CLASS="l">636</TD><TD> }</TD></TR><TR><TD CLASS="l">637</TD><TD> }</TD></TR><TR><TD CLASS="l">638</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">639</TD><TD> if (dirtyStartPos > -1) {</TD></TR><TR><TD CLASS="l">640</TD><TD> // then we found one, do create new structuredDocument event</TD></TR><TR><TD CLASS="l">641</TD><TD> // based on the previous quote to end of document</TD></TR><TR><TD CLASS="l">642</TD><TD> // except, we need to be positive that the previous quote is</TD></TR><TR><TD CLASS="l">643</TD><TD> // in a "safe start" region (e.g. if in JSP content, we need</TD></TR><TR><TD CLASS="l">644</TD><TD> // to</TD></TR><TR><TD CLASS="l">645</TD><TD> // backup till we include the whole JSP region, in order for</TD></TR><TR><TD CLASS="l">646</TD><TD> // it</TD></TR><TR><TD CLASS="l">647</TD><TD> // to be correctly re-parsed. The backing up is done in the</TD></TR><TR><TD CLASS="l">648</TD><TD> // reparse/find dirty start from hint</TD></TR><TR><TD CLASS="l">649</TD><TD> // method.</TD></TR><TR CLASS="z"><TD CLASS="l">650</TD><TD> result = reparse(dirtyStartPos, fStructuredDocument.getLength() - 1);</TD></TR><TR><TD CLASS="l">651</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">652</TD><TD> } catch (BadLocationException e) {</TD></TR><TR CLASS="z"><TD CLASS="l">653</TD><TD> Logger.logException(e);</TD></TR><TR><TD CLASS="l">654</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">655</TD><TD> if (result != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">656</TD><TD> result.setDeletedText(fDeletedText);</TD></TR><TR><TD CLASS="l">657</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="16">658</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">659</TD><TD> }</TD></TR><TR><TD CLASS="l">660</TD><TD> </TD></TR><TR><TD CLASS="l">661</TD><TD> private StructuredDocumentEvent checkHeuristics() {</TD></TR><TR CLASS="z"><TD CLASS="l">662</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">663</TD><TD> result = checkForNoChange();</TD></TR><TR CLASS="z"><TD CLASS="l">664</TD><TD> if (result == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">665</TD><TD> result = checkForCrossStructuredDocumentRegionBoundryCases();</TD></TR><TR CLASS="z"><TD CLASS="l">666</TD><TD> if (result == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">667</TD><TD> result = quickCheck();</TD></TR><TR><TD CLASS="l">668</TD><TD> }</TD></TR><TR><TD CLASS="l">669</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">670</TD><TD> return result;</TD></TR><TR><TD CLASS="l">671</TD><TD> }</TD></TR><TR><TD CLASS="l">672</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="17">673</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">674</TD><TD> * Takes into account "tag name" rules for comparisons; case-insensitive.</TD></TR><TR><TD CLASS="l">675</TD><TD> */</TD></TR><TR><TD CLASS="l">676</TD><TD> private boolean checkTagNames(String compareText, String criticalTarget, boolean checkEnd) {</TD></TR><TR CLASS="z"><TD CLASS="l">677</TD><TD> boolean result = false;</TD></TR><TR CLASS="z"><TD CLASS="l">678</TD><TD> if ((compareText == null) || (criticalTarget == null))</TD></TR><TR CLASS="z"><TD CLASS="l">679</TD><TD> return false;</TD></TR><TR CLASS="z"><TD CLASS="l">680</TD><TD> int posOfCriticalWord = compareText.toLowerCase().indexOf(criticalTarget.toLowerCase());</TD></TR><TR CLASS="z"><TD CLASS="l">681</TD><TD> result = posOfCriticalWord > -1;</TD></TR><TR CLASS="z"><TD CLASS="l">682</TD><TD> if (checkEnd && result) {</TD></TR><TR><TD CLASS="l">683</TD><TD> // instead of returning true right away, we'll only return true</TD></TR><TR><TD CLASS="l">684</TD><TD> // the</TD></TR><TR><TD CLASS="l">685</TD><TD> // potentially matched tag is indeed a tag, for example, if</TD></TR><TR><TD CLASS="l">686</TD><TD> // <SCRIPT</TD></TR><TR><TD CLASS="l">687</TD><TD> // becomes <SCRIPTS we don't want to say the latter is a critical</TD></TR><TR><TD CLASS="l">688</TD><TD> // tag</TD></TR><TR CLASS="z"><TD CLASS="l">689</TD><TD> int lastPos = posOfCriticalWord + criticalTarget.length();</TD></TR><TR CLASS="z"><TD CLASS="l">690</TD><TD> if (lastPos < compareText.length()) {</TD></TR><TR CLASS="z"><TD CLASS="l">691</TD><TD> char lastChar = compareText.charAt(lastPos);</TD></TR><TR><TD CLASS="l">692</TD><TD> // Future: check formal definition of this java method, vs.</TD></TR><TR><TD CLASS="l">693</TD><TD> // XML</TD></TR><TR><TD CLASS="l">694</TD><TD> // parsing rules</TD></TR><TR CLASS="z"><TD CLASS="l">695</TD><TD> result = (!Character.isLetterOrDigit(lastChar));</TD></TR><TR><TD CLASS="l">696</TD><TD> }</TD></TR><TR><TD CLASS="l">697</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">698</TD><TD> return result;</TD></TR><TR><TD CLASS="l">699</TD><TD> }</TD></TR><TR><TD CLASS="l">700</TD><TD> </TD></TR><TR><TD CLASS="l">701</TD><TD> /**</TD></TR><TR><TD CLASS="l"><A NAME="32">702</A></TD><TD> * The core reparsing method ... after the dirty start and dirty end have</TD></TR><TR><TD CLASS="l">703</TD><TD> * been calculated elsewhere, and the text updated.</TD></TR><TR><TD CLASS="l">704</TD><TD> */</TD></TR><TR><TD CLASS="l">705</TD><TD> protected StructuredDocumentEvent core_reparse(int rescanStart, int rescanEnd, CoreNodeList oldNodes, boolean firstTime) {</TD></TR><TR CLASS="c"><TD CLASS="l">706</TD><TD> IStructuredDocumentRegion newNodesHead = null;</TD></TR><TR CLASS="c"><TD CLASS="l">707</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="c"><TD CLASS="l">708</TD><TD> newNodesHead = _core_reparse_text(rescanStart, rescanEnd);</TD></TR><TR CLASS="c"><TD CLASS="l">709</TD><TD> result = _core_reparse_update_model(newNodesHead, rescanStart, rescanEnd, oldNodes, firstTime);</TD></TR><TR CLASS="c"><TD CLASS="l">710</TD><TD> return result;</TD></TR><TR><TD CLASS="l">711</TD><TD> }</TD></TR><TR><TD CLASS="l">712</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="33">713</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">714</TD><TD> * Resets state to "not parsing"</TD></TR><TR><TD CLASS="l">715</TD><TD> */</TD></TR><TR><TD CLASS="l">716</TD><TD> private synchronized void endReParse() {</TD></TR><TR CLASS="c"><TD CLASS="l">717</TD><TD> isParsing = false;</TD></TR><TR CLASS="c"><TD CLASS="l">718</TD><TD> dirtyStart = null;</TD></TR><TR CLASS="c"><TD CLASS="l">719</TD><TD> dirtyEnd = null;</TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="18">720</A></TD><TD> }</TD></TR><TR><TD CLASS="l">721</TD><TD> </TD></TR><TR><TD CLASS="l">722</TD><TD> protected IStructuredDocumentRegion findDirtyEnd(int end) {</TD></TR><TR><TD CLASS="l">723</TD><TD> // Caution: here's one place we have to cast</TD></TR><TR CLASS="z"><TD CLASS="l">724</TD><TD> IStructuredDocumentRegion result = fStructuredDocument.getRegionAtCharacterOffset(end);</TD></TR><TR><TD CLASS="l">725</TD><TD> // if not well formed, get one past, if there is something there</TD></TR><TR CLASS="z"><TD CLASS="l">726</TD><TD> if ((result != null) && (!result.isEnded())) {</TD></TR><TR CLASS="z"><TD CLASS="l">727</TD><TD> if (result.getNext() != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">728</TD><TD> result = result.getNext();</TD></TR><TR><TD CLASS="l">729</TD><TD> }</TD></TR><TR><TD CLASS="l">730</TD><TD> }</TD></TR><TR><TD CLASS="l">731</TD><TD> // also, get one past if exactly equal to the end (this was needed</TD></TR><TR><TD CLASS="l">732</TD><TD> // as a simple fix to when a whole exact region is deleted.</TD></TR><TR><TD CLASS="l">733</TD><TD> // there's probably a better way.</TD></TR><TR CLASS="z"><TD CLASS="l">734</TD><TD> if ((result != null) && (end == result.getEnd())) {</TD></TR><TR CLASS="z"><TD CLASS="l">735</TD><TD> if (result.getNext() != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">736</TD><TD> result = result.getNext();</TD></TR><TR><TD CLASS="l">737</TD><TD> }</TD></TR><TR><TD CLASS="l">738</TD><TD> }</TD></TR><TR><TD CLASS="l">739</TD><TD> // moved to subclass for quick transition</TD></TR><TR><TD CLASS="l">740</TD><TD> // 12/6/2001 - Since we've changed the parser/scanner to allow a lone</TD></TR><TR><TD CLASS="l">741</TD><TD> // '<' without</TD></TR><TR><TD CLASS="l">742</TD><TD> // always interpretting it as start of a tag name, we need to be a</TD></TR><TR><TD CLASS="l">743</TD><TD> // little fancier, in order</TD></TR><TR><TD CLASS="l">744</TD><TD> // to "skip" over any plain 'ol content between the lone '<' and any</TD></TR><TR><TD CLASS="l">745</TD><TD> // potential meating</TD></TR><TR><TD CLASS="l">746</TD><TD> // regions past plain 'ol content.</TD></TR><TR><TD CLASS="l">747</TD><TD> // if (isLoneOpenFollowedByContent(result) && (result.getNext() !=</TD></TR><TR><TD CLASS="l">748</TD><TD> // null)) {</TD></TR><TR><TD CLASS="l">749</TD><TD> // result = result.getNext();</TD></TR><TR><TD CLASS="l">750</TD><TD> // }</TD></TR><TR CLASS="z"><TD CLASS="l">751</TD><TD> if (result != null)</TD></TR><TR CLASS="z"><TD CLASS="l">752</TD><TD> fStructuredDocument.setCachedDocumentRegion(result);</TD></TR><TR CLASS="z"><TD CLASS="l">753</TD><TD> dirtyEnd = result;</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="19">754</A></TD><TD> return dirtyEnd;</TD></TR><TR><TD CLASS="l">755</TD><TD> }</TD></TR><TR><TD CLASS="l">756</TD><TD> </TD></TR><TR><TD CLASS="l">757</TD><TD> protected void findDirtyStart(int start) {</TD></TR><TR CLASS="z"><TD CLASS="l">758</TD><TD> IStructuredDocumentRegion result = fStructuredDocument.getRegionAtCharacterOffset(start);</TD></TR><TR><TD CLASS="l">759</TD><TD> // heuristic: if the postion is exactly equal to the start, then</TD></TR><TR><TD CLASS="l">760</TD><TD> // go back one more, if it exists. This prevents problems with</TD></TR><TR><TD CLASS="l">761</TD><TD> // insertions</TD></TR><TR><TD CLASS="l">762</TD><TD> // of text that should be merged with the previous node instead of</TD></TR><TR><TD CLASS="l">763</TD><TD> // simply hung</TD></TR><TR><TD CLASS="l">764</TD><TD> // off of it as a separate node (ex.: XML content inserted right</TD></TR><TR><TD CLASS="l">765</TD><TD> // before</TD></TR><TR><TD CLASS="l">766</TD><TD> // an open</TD></TR><TR><TD CLASS="l">767</TD><TD> // bracket should become part of the previous content node)</TD></TR><TR CLASS="z"><TD CLASS="l">768</TD><TD> if (result != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">769</TD><TD> IStructuredDocumentRegion previous = result.getPrevious();</TD></TR><TR CLASS="z"><TD CLASS="l">770</TD><TD> if ((previous != null) && ((!(previous.isEnded())) || (start == result.getStart()))) {</TD></TR><TR CLASS="z"><TD CLASS="l">771</TD><TD> result = previous;</TD></TR><TR><TD CLASS="l">772</TD><TD> }</TD></TR><TR><TD CLASS="l">773</TD><TD> // If we are now at the end of a "tag dependent" content area (or</TD></TR><TR><TD CLASS="l">774</TD><TD> // JSP area)</TD></TR><TR><TD CLASS="l">775</TD><TD> // then we need to back up all the way to the beginning of that.</TD></TR><TR CLASS="z"><TD CLASS="l">776</TD><TD> IStructuredDocumentRegion potential = result;</TD></TR><TR><TD CLASS="l">777</TD><TD> // moved to subclass to speed transition</TD></TR><TR><TD CLASS="l">778</TD><TD> // while (isPartOfBlockRegion(potential)) {</TD></TR><TR><TD CLASS="l">779</TD><TD> // potential = potential.getPrevious();</TD></TR><TR><TD CLASS="l">780</TD><TD> // }</TD></TR><TR CLASS="z"><TD CLASS="l">781</TD><TD> if (potential != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">782</TD><TD> result = potential;</TD></TR><TR CLASS="z"><TD CLASS="l">783</TD><TD> fStructuredDocument.setCachedDocumentRegion(result);</TD></TR><TR><TD CLASS="l">784</TD><TD> }</TD></TR><TR><TD CLASS="l">785</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="2d">786</A></TD><TD> dirtyStart = result;</TD></TR><TR CLASS="z"><TD CLASS="l">787</TD><TD> }</TD></TR><TR><TD CLASS="l">788</TD><TD> </TD></TR><TR><TD CLASS="l">789</TD><TD> protected CoreNodeList formOldNodes(IStructuredDocumentRegion dirtyStart, IStructuredDocumentRegion dirtyEnd) {</TD></TR><TR CLASS="c"><TD CLASS="l">790</TD><TD> CoreNodeList oldNodes = new CoreNodeList(dirtyStart, dirtyEnd);</TD></TR><TR><TD CLASS="l">791</TD><TD> // Now save the old text, that "goes with" the old nodes and regions.</TD></TR><TR><TD CLASS="l">792</TD><TD> // Notice we are getting it directly from the text store</TD></TR><TR CLASS="c"><TD CLASS="l">793</TD><TD> String oldText = null;</TD></TR><TR CLASS="c"><TD CLASS="l">794</TD><TD> int oldStart = -1;</TD></TR><TR CLASS="c"><TD CLASS="l">795</TD><TD> int oldEnd = -1;</TD></TR><TR><TD CLASS="l">796</TD><TD> // make sure there is some text, if not, use empty string</TD></TR><TR><TD CLASS="l">797</TD><TD> // (if one node is not null, the other should ALWAYS be not null too,</TD></TR><TR><TD CLASS="l">798</TD><TD> // since it</TD></TR><TR><TD CLASS="l">799</TD><TD> // would at least be equal to it.)</TD></TR><TR CLASS="c"><TD CLASS="l">800</TD><TD> if (dirtyStart != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">801</TD><TD> oldStart = dirtyStart.getStart();</TD></TR><TR CLASS="z"><TD CLASS="l">802</TD><TD> oldEnd = dirtyEnd.getEnd();</TD></TR><TR CLASS="z"><TD CLASS="l">803</TD><TD> oldText = fStructuredDocument.get(oldStart, oldEnd - oldStart);</TD></TR><TR><TD CLASS="l">804</TD><TD> } else {</TD></TR><TR CLASS="c"><TD CLASS="l">805</TD><TD> oldStart = 0;</TD></TR><TR CLASS="c"><TD CLASS="l">806</TD><TD> oldEnd = 0;</TD></TR><TR CLASS="c"><TD CLASS="l">807</TD><TD> oldText = ""; //$NON-NLS-1$</TD></TR><TR><TD CLASS="l">808</TD><TD> }</TD></TR><TR><TD CLASS="l">809</TD><TD> // create a temporary text store for this text</TD></TR><TR CLASS="c"><TD CLASS="l">810</TD><TD> SubSetTextStore subTextStore = new SubSetTextStore(oldText, oldStart, oldEnd, fStructuredDocument.getLength());</TD></TR><TR><TD CLASS="l">811</TD><TD> // Now update the text store of the oldNodes</TD></TR><TR CLASS="c"><TD CLASS="l">812</TD><TD> StructuredDocumentRegionIterator.setParentDocument(oldNodes, new MinimalDocument(subTextStore));</TD></TR><TR CLASS="c"><TD CLASS="l">813</TD><TD> return oldNodes;</TD></TR><TR><TD CLASS="l">814</TD><TD> }</TD></TR><TR><TD CLASS="l">815</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="1a">816</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">817</TD><TD> * @return Returns the findReplaceDocumentAdapter.</TD></TR><TR><TD CLASS="l">818</TD><TD> */</TD></TR><TR><TD CLASS="l">819</TD><TD> public FindReplaceDocumentAdapter getFindReplaceDocumentAdapter() {</TD></TR><TR CLASS="z"><TD CLASS="l">820</TD><TD> if (fFindReplaceDocumentAdapter == null) {</TD></TR><TR CLASS="z"><TD CLASS="l">821</TD><TD> fFindReplaceDocumentAdapter = new FindReplaceDocumentAdapter(fStructuredDocument);</TD></TR><TR><TD CLASS="l">822</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">823</TD><TD> return fFindReplaceDocumentAdapter;</TD></TR><TR><TD CLASS="l">824</TD><TD> }</TD></TR><TR><TD CLASS="l">825</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="34">826</A></TD><TD> // Note: if thead safety is needed, this and all the other public methods</TD></TR><TR><TD CLASS="l">827</TD><TD> // of this class</TD></TR><TR><TD CLASS="l">828</TD><TD> // should be synchronized.</TD></TR><TR><TD CLASS="l">829</TD><TD> public void initialize(Object requester, int start, int lengthToReplace, String changes) {</TD></TR><TR CLASS="c"><TD CLASS="l">830</TD><TD> isParsing = true;</TD></TR><TR CLASS="c"><TD CLASS="l">831</TD><TD> fRequester = requester;</TD></TR><TR CLASS="c"><TD CLASS="l">832</TD><TD> fStart = start;</TD></TR><TR CLASS="c"><TD CLASS="l">833</TD><TD> fLengthToReplace = lengthToReplace;</TD></TR><TR CLASS="c"><TD CLASS="l">834</TD><TD> fChanges = changes;</TD></TR><TR><TD CLASS="l">835</TD><TD> // notice this one is derived</TD></TR><TR CLASS="c"><TD CLASS="l">836</TD><TD> fLengthDifference = Utilities.calculateLengthDifference(fChanges, fLengthToReplace);</TD></TR><TR CLASS="c"><TD CLASS="l">837</TD><TD> fDeletedText = fStructuredDocument.get(fStart, fLengthToReplace);</TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="1b">838</A></TD><TD> }</TD></TR><TR><TD CLASS="l">839</TD><TD> </TD></TR><TR><TD CLASS="l">840</TD><TD> protected void insertNodes(IStructuredDocumentRegion previousOldNode, IStructuredDocumentRegion nextOldNode, CoreNodeList newNodes) {</TD></TR><TR><TD CLASS="l">841</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">842</TD><TD> IStructuredDocumentRegion firstNew = null;</TD></TR><TR CLASS="z"><TD CLASS="l">843</TD><TD> IStructuredDocumentRegion lastNew = null;</TD></TR><TR><TD CLASS="l">844</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">845</TD><TD> IStructuredDocumentRegion oldPrevious = previousOldNode;</TD></TR><TR CLASS="z"><TD CLASS="l">846</TD><TD> IStructuredDocumentRegion oldNext = nextOldNode;</TD></TR><TR><TD CLASS="l">847</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">848</TD><TD> if (newNodes.getLength() > 0) {</TD></TR><TR><TD CLASS="l">849</TD><TD> // get pointers</TD></TR><TR CLASS="z"><TD CLASS="l">850</TD><TD> firstNew = newNodes.item(0);</TD></TR><TR CLASS="z"><TD CLASS="l">851</TD><TD> lastNew = newNodes.item(newNodes.getLength() - 1);</TD></TR><TR><TD CLASS="l">852</TD><TD> // switch surrounding StructuredDocumentRegions' references to</TD></TR><TR><TD CLASS="l">853</TD><TD> // lists</TD></TR><TR CLASS="z"><TD CLASS="l">854</TD><TD> if (oldPrevious != null)</TD></TR><TR CLASS="z"><TD CLASS="l">855</TD><TD> oldPrevious.setNext(firstNew);</TD></TR><TR CLASS="z"><TD CLASS="l">856</TD><TD> if (oldNext != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">857</TD><TD> oldNext.setPrevious(lastNew);</TD></TR><TR><TD CLASS="l">858</TD><TD> } else {</TD></TR><TR><TD CLASS="l">859</TD><TD> // SIDE EFFECT</TD></TR><TR><TD CLASS="l">860</TD><TD> // if oldNext is null, that means we are replaceing the</TD></TR><TR><TD CLASS="l">861</TD><TD> // lastNode in the chain,</TD></TR><TR><TD CLASS="l">862</TD><TD> // so we need to update the structuredDocuments lastNode as</TD></TR><TR><TD CLASS="l">863</TD><TD> // the</TD></TR><TR><TD CLASS="l">864</TD><TD> // last of the new nodes.</TD></TR><TR CLASS="z"><TD CLASS="l">865</TD><TD> fStructuredDocument.setLastDocumentRegion(newNodes.item(newNodes.getLength() - 1));</TD></TR><TR><TD CLASS="l">866</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">867</TD><TD> if (firstNew != null)</TD></TR><TR CLASS="z"><TD CLASS="l">868</TD><TD> firstNew.setPrevious(oldPrevious);</TD></TR><TR CLASS="z"><TD CLASS="l">869</TD><TD> if (lastNew != null)</TD></TR><TR CLASS="z"><TD CLASS="l">870</TD><TD> lastNew.setNext(oldNext);</TD></TR><TR><TD CLASS="l">871</TD><TD> }</TD></TR><TR><TD CLASS="l">872</TD><TD> // else nothing to insert</TD></TR><TR CLASS="z"><TD CLASS="l">873</TD><TD> }</TD></TR><TR><TD CLASS="l">874</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="1c">875</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">876</TD><TD> * @param oldRegion</TD></TR><TR><TD CLASS="l">877</TD><TD> */</TD></TR><TR><TD CLASS="l">878</TD><TD> private boolean isCollectionRegion(ITextRegion aRegion) {</TD></TR><TR CLASS="z"><TD CLASS="l">879</TD><TD> return (aRegion instanceof ITextRegionCollection);</TD></TR><TR><TD CLASS="l">880</TD><TD> }</TD></TR><TR><TD CLASS="l">881</TD><TD> </TD></TR><TR><TD CLASS="l"><A NAME="1d">882</A></TD><TD> /**</TD></TR><TR><TD CLASS="l">883</TD><TD> * @return boolean</TD></TR><TR><TD CLASS="l">884</TD><TD> */</TD></TR><TR><TD CLASS="l">885</TD><TD> public boolean isParsing() {</TD></TR><TR CLASS="z"><TD CLASS="l">886</TD><TD> return isParsing;</TD></TR><TR><TD CLASS="l">887</TD><TD> }</TD></TR><TR><TD CLASS="l">888</TD><TD> </TD></TR><TR><TD CLASS="l">889</TD><TD> /**</TD></TR><TR><TD CLASS="l">890</TD><TD> * The minimization algorithm simply checks the old nodes to see if any of</TD></TR><TR><TD CLASS="l">891</TD><TD> * them "survived" the rescan and are unchanged. If so, the instance of</TD></TR><TR><TD CLASS="l">892</TD><TD> * the old node is used instead of the new node. Before the requested</TD></TR><TR><TD CLASS="l">893</TD><TD> * change, need to check type, offsets, and text to determine if the same.</TD></TR><TR><TD CLASS="l"><A NAME="1e">894</A></TD><TD> * After the requested change, need to check type and text, but adjust the</TD></TR><TR><TD CLASS="l">895</TD><TD> * offsets to what ever the change was.</TD></TR><TR><TD CLASS="l">896</TD><TD> */</TD></TR><TR><TD CLASS="l">897</TD><TD> protected StructuredDocumentEvent minimumEvent(CoreNodeList oldNodes, CoreNodeList newNodes) {</TD></TR><TR CLASS="z"><TD CLASS="l">898</TD><TD> StructuredDocumentEvent event = null;</TD></TR><TR CLASS="z"><TD CLASS="l">899</TD><TD> CoreNodeList minimalOldNodes = null;</TD></TR><TR CLASS="z"><TD CLASS="l">900</TD><TD> CoreNodeList minimalNewNodes = null;</TD></TR><TR><TD CLASS="l">901</TD><TD> // To minimize nodes, we'll collect all those</TD></TR><TR><TD CLASS="l">902</TD><TD> // that are not equal into old and new lists</TD></TR><TR><TD CLASS="l">903</TD><TD> // Note: we assume that old and new nodes</TD></TR><TR><TD CLASS="l">904</TD><TD> // are basically contiguous -- and we force it to be so,</TD></TR><TR><TD CLASS="l">905</TD><TD> // by starting at the beginning to</TD></TR><TR><TD CLASS="l">906</TD><TD> // find first difference, and then starting at the end to find</TD></TR><TR><TD CLASS="l">907</TD><TD> // last difference. Everything in between we assume is different.</TD></TR><TR><TD CLASS="l">908</TD><TD> //</TD></TR><TR><TD CLASS="l">909</TD><TD> //</TD></TR><TR><TD CLASS="l">910</TD><TD> //</TD></TR><TR><TD CLASS="l">911</TD><TD> // startOfDifferences is the index into the core node list where the</TD></TR><TR><TD CLASS="l">912</TD><TD> // first difference</TD></TR><TR><TD CLASS="l">913</TD><TD> // occurs. But it may point into the old or the new list.</TD></TR><TR CLASS="z"><TD CLASS="l">914</TD><TD> int startOfDifferences = _computeStartOfDifferences(oldNodes, newNodes);</TD></TR><TR CLASS="z"><TD CLASS="l">915</TD><TD> int endOfDifferencesOld = -1;</TD></TR><TR CLASS="z"><TD CLASS="l">916</TD><TD> int endOfDifferencesNew = -1;</TD></TR><TR><TD CLASS="l">917</TD><TD> // if one of the lists are shorter than where the differences start,</TD></TR><TR><TD CLASS="l">918</TD><TD> // then</TD></TR><TR><TD CLASS="l">919</TD><TD> // then some portion of the lists are identical</TD></TR><TR CLASS="z"><TD CLASS="l">920</TD><TD> if ((startOfDifferences >= oldNodes.getLength()) || (startOfDifferences >= newNodes.getLength())) {</TD></TR><TR CLASS="z"><TD CLASS="l">921</TD><TD> if (oldNodes.getLength() < newNodes.getLength()) {</TD></TR><TR><TD CLASS="l">922</TD><TD> // Then there are new regions to add</TD></TR><TR><TD CLASS="l">923</TD><TD> // these lengths will cause the vector of old ones to not</TD></TR><TR><TD CLASS="l">924</TD><TD> // have any elements, and the vector of new regions to have</TD></TR><TR><TD CLASS="l">925</TD><TD> // just the new ones not in common with the old ones</TD></TR><TR><TD CLASS="l">926</TD><TD> //startOfDifferences should equal oldNodes.getLength(),</TD></TR><TR><TD CLASS="l">927</TD><TD> // calculated above on _computeStartOfDifferences</TD></TR><TR CLASS="z"><TD CLASS="l">928</TD><TD> minimalOldNodes = EMPTY_LIST;</TD></TR><TR CLASS="z"><TD CLASS="l">929</TD><TD> endOfDifferencesNew = newNodes.getLength() - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">930</TD><TD> minimalNewNodes = _formMinimumList(newNodes, startOfDifferences, endOfDifferencesNew);</TD></TR><TR><TD CLASS="l">931</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">932</TD><TD> if (oldNodes.getLength() > newNodes.getLength()) {</TD></TR><TR><TD CLASS="l">933</TD><TD> // delete old</TD></TR><TR><TD CLASS="l">934</TD><TD> // then there are old regions to delete</TD></TR><TR><TD CLASS="l">935</TD><TD> // these lengths will cause the vector of old regions to</TD></TR><TR><TD CLASS="l">936</TD><TD> // contain the ones to delete, and the vector of new</TD></TR><TR><TD CLASS="l">937</TD><TD> // regions</TD></TR><TR><TD CLASS="l">938</TD><TD> // not have any elements</TD></TR><TR><TD CLASS="l">939</TD><TD> //startOfDifferences should equal newNodes.getLength(),</TD></TR><TR><TD CLASS="l">940</TD><TD> // calculated above on _computeStartOfDifferences</TD></TR><TR CLASS="z"><TD CLASS="l">941</TD><TD> endOfDifferencesOld = oldNodes.getLength() - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">942</TD><TD> minimalOldNodes = _formMinimumList(oldNodes, startOfDifferences, endOfDifferencesOld);</TD></TR><TR CLASS="z"><TD CLASS="l">943</TD><TD> minimalNewNodes = EMPTY_LIST;</TD></TR><TR><TD CLASS="l">944</TD><TD> } else</TD></TR><TR><TD CLASS="l">945</TD><TD> // unlikely event</TD></TR><TR CLASS="z"><TD CLASS="l">946</TD><TD> event = new NoChangeEvent(fStructuredDocument, fRequester, fChanges, fStart, fLengthToReplace);</TD></TR><TR><TD CLASS="l">947</TD><TD> }</TD></TR><TR><TD CLASS="l">948</TD><TD> } else {</TD></TR><TR><TD CLASS="l">949</TD><TD> // We found a normal startOfDiffernces, but have not yet found the</TD></TR><TR><TD CLASS="l">950</TD><TD> // ends.</TD></TR><TR><TD CLASS="l">951</TD><TD> // We'll look for the end of differences by going backwards down</TD></TR><TR><TD CLASS="l">952</TD><TD> // the two lists.</TD></TR><TR><TD CLASS="l">953</TD><TD> // Here we need a seperate index for each array, since they may be</TD></TR><TR><TD CLASS="l">954</TD><TD> // (and</TD></TR><TR><TD CLASS="l">955</TD><TD> // probably are) of different lengths.</TD></TR><TR CLASS="z"><TD CLASS="l">956</TD><TD> int indexOld = oldNodes.getLength() - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">957</TD><TD> int indexNew = newNodes.getLength() - 1;</TD></TR><TR><TD CLASS="l">958</TD><TD> // The greaterThanEffectedRegion is important to gaurd against</TD></TR><TR><TD CLASS="l">959</TD><TD> // incorrect counting</TD></TR><TR><TD CLASS="l">960</TD><TD> // when something identical is inserted to what's already there</TD></TR><TR><TD CLASS="l">961</TD><TD> // (see minimization test case 5)</TD></TR><TR><TD CLASS="l">962</TD><TD> // Note: the indexOld > startOfDifferences keeps indexOld from</TD></TR><TR><TD CLASS="l">963</TD><TD> // getting too small,</TD></TR><TR><TD CLASS="l">964</TD><TD> // so that the subsequent oldNodes.item(indexOld) is always valid.</TD></TR><TR CLASS="z"><TD CLASS="l">965</TD><TD> while ((indexOld >= startOfDifferences) && (_greaterThanEffectedRegion(oldNodes.item(indexOld)))) {</TD></TR><TR CLASS="z"><TD CLASS="l">966</TD><TD> if (!(oldNodes.item(indexOld).sameAs(newNodes.item(indexNew), fLengthDifference))) {</TD></TR><TR CLASS="z"><TD CLASS="l">967</TD><TD> break;</TD></TR><TR><TD CLASS="l">968</TD><TD> } else {</TD></TR><TR><TD CLASS="l">969</TD><TD> // if they are equal, then we will be keeping the old one,</TD></TR><TR><TD CLASS="l">970</TD><TD> // so</TD></TR><TR><TD CLASS="l">971</TD><TD> // we need to be sure its parentDocument is set back to</TD></TR><TR><TD CLASS="l">972</TD><TD> // the</TD></TR><TR><TD CLASS="l">973</TD><TD> // right instance</TD></TR><TR CLASS="z"><TD CLASS="l">974</TD><TD> oldNodes.item(indexOld).setParentDocument(fStructuredDocument);</TD></TR><TR><TD CLASS="l">975</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">976</TD><TD> indexOld--;</TD></TR><TR CLASS="z"><TD CLASS="l">977</TD><TD> indexNew--;</TD></TR><TR><TD CLASS="l">978</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">979</TD><TD> endOfDifferencesOld = indexOld;</TD></TR><TR CLASS="z"><TD CLASS="l">980</TD><TD> endOfDifferencesNew = indexNew;</TD></TR><TR CLASS="z"><TD CLASS="l">981</TD><TD> minimalOldNodes = _formMinimumList(oldNodes, startOfDifferences, endOfDifferencesOld);</TD></TR><TR CLASS="z"><TD CLASS="l">982</TD><TD> minimalNewNodes = _formMinimumList(newNodes, startOfDifferences, endOfDifferencesNew);</TD></TR><TR><TD CLASS="l">983</TD><TD> } /////////////////////////////////////////</TD></TR><TR><TD CLASS="l">984</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">985</TD><TD> IStructuredDocumentRegion firstDownStreamNode = null;</TD></TR><TR CLASS="z"><TD CLASS="l">986</TD><TD> event = regionCheck(minimalOldNodes, minimalNewNodes);</TD></TR><TR CLASS="z"><TD CLASS="l">987</TD><TD> if (event != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">988</TD><TD> firstDownStreamNode = minimalOldNodes.item(0).getNext();</TD></TR><TR CLASS="z"><TD CLASS="l">989</TD><TD> if (firstDownStreamNode != null && fLengthDifference != 0) { // if</TD></TR><TR><TD CLASS="l">990</TD><TD> // firstDownStream</TD></TR><TR><TD CLASS="l">991</TD><TD> // is</TD></TR><TR><TD CLASS="l">992</TD><TD> // null,</TD></TR><TR><TD CLASS="l">993</TD><TD> // then</TD></TR><TR><TD CLASS="l">994</TD><TD> // we're</TD></TR><TR><TD CLASS="l">995</TD><TD> // at</TD></TR><TR><TD CLASS="l">996</TD><TD> // the</TD></TR><TR><TD CLASS="l">997</TD><TD> // end</TD></TR><TR><TD CLASS="l">998</TD><TD> // of</TD></TR><TR><TD CLASS="l">999</TD><TD> // the</TD></TR><TR><TD CLASS="l">1000</TD><TD> // document</TD></TR><TR CLASS="z"><TD CLASS="l">1001</TD><TD> StructuredDocumentRegionIterator.adjustStart(firstDownStreamNode, fLengthDifference);</TD></TR><TR><TD CLASS="l">1002</TD><TD> } //</TD></TR><TR><TD CLASS="l">1003</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">1004</TD><TD> event = nodesReplacedCheck(minimalOldNodes, minimalNewNodes);</TD></TR><TR><TD CLASS="l">1005</TD><TD> // now splice the new chain of nodes to where the old chain is (or</TD></TR><TR><TD CLASS="l">1006</TD><TD> // was)</TD></TR><TR><TD CLASS="l">1007</TD><TD> // the firstDownStreamNode (the first of those after the new</TD></TR><TR><TD CLASS="l">1008</TD><TD> // nodes)</TD></TR><TR><TD CLASS="l">1009</TD><TD> // is</TD></TR><TR><TD CLASS="l">1010</TD><TD> // remembered as a tiny optimization.</TD></TR><TR CLASS="z"><TD CLASS="l">1011</TD><TD> if (minimalOldNodes.getLength() == 0 && minimalNewNodes.getLength() > 0) {</TD></TR><TR><TD CLASS="l">1012</TD><TD> // if no old nodes are being deleted, then use the</TD></TR><TR><TD CLASS="l">1013</TD><TD> // the newNodes offset (minus one) to find the point to</TD></TR><TR><TD CLASS="l">1014</TD><TD> // update downstream nodes, and after updating downstream</TD></TR><TR><TD CLASS="l">1015</TD><TD> // nodes postions, insert the new ones.</TD></TR><TR CLASS="z"><TD CLASS="l">1016</TD><TD> int insertOffset = minimalNewNodes.item(0).getStartOffset();</TD></TR><TR CLASS="z"><TD CLASS="l">1017</TD><TD> IStructuredDocumentRegion lastOldUnchangedNode = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1018</TD><TD> if (insertOffset > 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1019</TD><TD> lastOldUnchangedNode = fStructuredDocument.getRegionAtCharacterOffset(insertOffset - 1);</TD></TR><TR CLASS="z"><TD CLASS="l">1020</TD><TD> firstDownStreamNode = lastOldUnchangedNode.getNext();</TD></TR><TR><TD CLASS="l">1021</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1022</TD><TD> // we're inserting at very beginning</TD></TR><TR CLASS="z"><TD CLASS="l">1023</TD><TD> firstDownStreamNode = fStructuredDocument.getFirstStructuredDocumentRegion();</TD></TR><TR><TD CLASS="l">1024</TD><TD> // SIDE EFFECT: change the firstNode pointer if we're</TD></TR><TR><TD CLASS="l">1025</TD><TD> // inserting at beginning</TD></TR><TR CLASS="z"><TD CLASS="l">1026</TD><TD> fStructuredDocument.setFirstDocumentRegion(minimalNewNodes.item(0));</TD></TR><TR><TD CLASS="l">1027</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1028</TD><TD> StructuredDocumentRegionIterator.adjustStart(firstDownStreamNode, fLengthDifference);</TD></TR><TR CLASS="z"><TD CLASS="l">1029</TD><TD> insertNodes(lastOldUnchangedNode, firstDownStreamNode, minimalNewNodes);</TD></TR><TR><TD CLASS="l">1030</TD><TD> // this (nodes replaced) is the only case where we need to</TD></TR><TR><TD CLASS="l">1031</TD><TD> // update the cached Node</TD></TR><TR CLASS="z"><TD CLASS="l">1032</TD><TD> reSetCachedNode(minimalOldNodes, minimalNewNodes);</TD></TR><TR><TD CLASS="l">1033</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">1034</TD><TD> firstDownStreamNode = switchNodeLists(minimalOldNodes, minimalNewNodes);</TD></TR><TR><TD CLASS="l">1035</TD><TD> // no need to adjust the length of the new nodes themselves,</TD></TR><TR><TD CLASS="l">1036</TD><TD> // they</TD></TR><TR><TD CLASS="l">1037</TD><TD> // are already correct, but we do need to</TD></TR><TR><TD CLASS="l">1038</TD><TD> // adjust all "down stream" nodes with the length of the</TD></TR><TR><TD CLASS="l">1039</TD><TD> // insertion or deletion</TD></TR><TR><TD CLASS="l">1040</TD><TD> // --- adjustment moved to calling method.</TD></TR><TR CLASS="z"><TD CLASS="l">1041</TD><TD> if (firstDownStreamNode != null) {</TD></TR><TR><TD CLASS="l">1042</TD><TD> // && event != null</TD></TR><TR CLASS="z"><TD CLASS="l">1043</TD><TD> StructuredDocumentRegionIterator.adjustStart(firstDownStreamNode, fLengthDifference);</TD></TR><TR><TD CLASS="l">1044</TD><TD> } //</TD></TR><TR><TD CLASS="l">1045</TD><TD> // this (nodes replaced) is the only case where we need to</TD></TR><TR><TD CLASS="l">1046</TD><TD> // update the cached Node</TD></TR><TR CLASS="z"><TD CLASS="l">1047</TD><TD> reSetCachedNode(minimalOldNodes, minimalNewNodes);</TD></TR><TR><TD CLASS="l">1048</TD><TD> }</TD></TR><TR><TD CLASS="l">1049</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1050</TD><TD> return event;</TD></TR><TR><TD CLASS="l"><A NAME="1f">1051</A></TD><TD> }</TD></TR><TR><TD CLASS="l">1052</TD><TD> </TD></TR><TR><TD CLASS="l">1053</TD><TD> // TODO: This should be abstract.</TD></TR><TR><TD CLASS="l">1054</TD><TD> public IStructuredTextReParser newInstance() {</TD></TR><TR CLASS="z"><TD CLASS="l">1055</TD><TD> return new StructuredDocumentReParser();</TD></TR><TR><TD CLASS="l">1056</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="20">1057</A></TD><TD> </TD></TR><TR><TD CLASS="l">1058</TD><TD> protected StructuredDocumentEvent nodesReplacedCheck(CoreNodeList oldNodes, CoreNodeList newNodes) {</TD></TR><TR><TD CLASS="l">1059</TD><TD> // actually, nothing to check here, since (and assuming) we've already</TD></TR><TR><TD CLASS="l">1060</TD><TD> // minimized the number of nodes, and ruled out mere region changes</TD></TR><TR CLASS="z"><TD CLASS="l">1061</TD><TD> StructuredDocumentEvent result = new StructuredDocumentRegionsReplacedEvent(fStructuredDocument, fRequester, oldNodes, newNodes, fChanges, fStart, fLengthToReplace);</TD></TR><TR CLASS="z"><TD CLASS="l">1062</TD><TD> return result;</TD></TR><TR><TD CLASS="l">1063</TD><TD> }</TD></TR><TR><TD CLASS="l">1064</TD><TD> </TD></TR><TR><TD CLASS="l">1065</TD><TD> /**</TD></TR><TR><TD CLASS="l">1066</TD><TD> * A method to allow any heuristic "quick checks" that might cover many</TD></TR><TR><TD CLASS="l"><A NAME="21">1067</A></TD><TD> * many cases, before expending the time on a full reparse.</TD></TR><TR><TD CLASS="l">1068</TD><TD> * </TD></TR><TR><TD CLASS="l">1069</TD><TD> */</TD></TR><TR><TD CLASS="l">1070</TD><TD> public StructuredDocumentEvent quickCheck() {</TD></TR><TR CLASS="z"><TD CLASS="l">1071</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR><TD CLASS="l">1072</TD><TD> // if the dirty start is null, then we have an empty document.</TD></TR><TR><TD CLASS="l">1073</TD><TD> // in which case we'll return null so everything can be</TD></TR><TR><TD CLASS="l">1074</TD><TD> // reparsed "from scratch" . If its not null, we'll give the flatnode</TD></TR><TR><TD CLASS="l">1075</TD><TD> // a</TD></TR><TR><TD CLASS="l">1076</TD><TD> // chance</TD></TR><TR><TD CLASS="l">1077</TD><TD> // to handle, but only if there is one flatnode involved.</TD></TR><TR CLASS="z"><TD CLASS="l">1078</TD><TD> if (dirtyStart != null && dirtyStart == dirtyEnd) {</TD></TR><TR CLASS="z"><TD CLASS="l">1079</TD><TD> IStructuredDocumentRegion targetNode = dirtyStart;</TD></TR><TR CLASS="z"><TD CLASS="l">1080</TD><TD> result = dirtyStart.updateRegion(fRequester, targetNode, fChanges, fStart, fLengthToReplace);</TD></TR><TR CLASS="z"><TD CLASS="l">1081</TD><TD> if (result != null) {</TD></TR><TR><TD CLASS="l">1082</TD><TD> // at this point only, we need to update the text store and</TD></TR><TR><TD CLASS="l">1083</TD><TD> // and downstream nodes.</TD></TR><TR><TD CLASS="l">1084</TD><TD> // FUTURE_TO_DO: can this dependency on structuredDocument</TD></TR><TR><TD CLASS="l">1085</TD><TD> // method be eliminated?</TD></TR><TR CLASS="z"><TD CLASS="l">1086</TD><TD> fStructuredDocument.updateDocumentData(fStart, fLengthToReplace, fChanges);</TD></TR><TR CLASS="z"><TD CLASS="l">1087</TD><TD> IStructuredDocumentRegion firstDownStreamNode = targetNode.getNext();</TD></TR><TR><TD CLASS="l">1088</TD><TD> // then flatnode must have been the last one, so need to</TD></TR><TR><TD CLASS="l">1089</TD><TD> // update</TD></TR><TR><TD CLASS="l">1090</TD><TD> // any downstream ones</TD></TR><TR CLASS="z"><TD CLASS="l">1091</TD><TD> if (firstDownStreamNode != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">1092</TD><TD> StructuredDocumentRegionIterator.adjustStart(firstDownStreamNode, fLengthDifference);</TD></TR><TR><TD CLASS="l">1093</TD><TD> }</TD></TR><TR><TD CLASS="l">1094</TD><TD> }</TD></TR><TR><TD CLASS="l">1095</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1096</TD><TD> if (result != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">1097</TD><TD> result.setDeletedText(fDeletedText);</TD></TR><TR><TD CLASS="l">1098</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1099</TD><TD> return result;</TD></TR><TR><TD CLASS="l">1100</TD><TD> }</TD></TR><TR><TD CLASS="l">1101</TD><TD> </TD></TR><TR><TD CLASS="l">1102</TD><TD> /**</TD></TR><TR><TD CLASS="l">1103</TD><TD> * If only one node is involved, sees how many regions are changed. If</TD></TR><TR><TD CLASS="l">1104</TD><TD> * only one, then its a 'regionChanged' event ... if more than one, its a</TD></TR><TR><TD CLASS="l">1105</TD><TD> * 'regionsReplaced' event.</TD></TR><TR><TD CLASS="l">1106</TD><TD> */</TD></TR><TR><TD CLASS="l">1107</TD><TD> protected StructuredDocumentEvent regionCheck(CoreNodeList oldNodes, CoreNodeList newNodes) {</TD></TR><TR><TD CLASS="l">1108</TD><TD> if (Debug.debugStructuredDocument)</TD></TR><TR><TD CLASS="l">1109</TD><TD> System.out.println("IStructuredDocument::regionsReplacedCheck"); //$NON-NLS-1$</TD></TR><TR><TD CLASS="l">1110</TD><TD> //$NON-NLS-1$</TD></TR><TR><TD CLASS="l"><A NAME="23">1111</A></TD><TD> //$NON-NLS-1$</TD></TR><TR><TD CLASS="l">1112</TD><TD> // the "regionsReplaced" event could only be true if and only if the</TD></TR><TR><TD CLASS="l">1113</TD><TD> // nodelists</TD></TR><TR><TD CLASS="l">1114</TD><TD> // are each only "1" in length.</TD></TR><TR CLASS="z"><TD CLASS="l">1115</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1116</TD><TD> int oldLength = oldNodes.getLength();</TD></TR><TR CLASS="z"><TD CLASS="l">1117</TD><TD> int newLength = newNodes.getLength();</TD></TR><TR CLASS="z"><TD CLASS="l">1118</TD><TD> if ((oldLength != 1) || (newLength != 1)) {</TD></TR><TR CLASS="z"><TD CLASS="l">1119</TD><TD> result = null;</TD></TR><TR><TD CLASS="l">1120</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">1121</TD><TD> IStructuredDocumentRegion oldNode = oldNodes.item(0);</TD></TR><TR CLASS="z"><TD CLASS="l">1122</TD><TD> IStructuredDocumentRegion newNode = newNodes.item(0);</TD></TR><TR CLASS="z"><TD CLASS="l">1123</TD><TD> result = regionCheck(oldNode, newNode);</TD></TR><TR><TD CLASS="l">1124</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1125</TD><TD> return result;</TD></TR><TR><TD CLASS="l">1126</TD><TD> }</TD></TR><TR><TD CLASS="l">1127</TD><TD> </TD></TR><TR><TD CLASS="l">1128</TD><TD> /**</TD></TR><TR><TD CLASS="l">1129</TD><TD> * If only one node is involved, sees how many regions are changed. If</TD></TR><TR><TD CLASS="l">1130</TD><TD> * only one, then its a 'regionChanged' event ... if more than one, its a</TD></TR><TR><TD CLASS="l"><A NAME="24">1131</A></TD><TD> * 'regionsReplaced' event.</TD></TR><TR><TD CLASS="l">1132</TD><TD> */</TD></TR><TR><TD CLASS="l">1133</TD><TD> protected StructuredDocumentEvent regionCheck(IStructuredDocumentRegion oldNode, IStructuredDocumentRegion newNode) {</TD></TR><TR><TD CLASS="l">1134</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">1135</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1136</TD><TD> ITextRegionList oldRegions = oldNode.getRegions();</TD></TR><TR CLASS="z"><TD CLASS="l">1137</TD><TD> ITextRegionList newRegions = newNode.getRegions();</TD></TR><TR CLASS="z"><TD CLASS="l">1138</TD><TD> ITextRegion[] oldRegionsArray = oldRegions.toArray();</TD></TR><TR CLASS="z"><TD CLASS="l">1139</TD><TD> ITextRegion[] newRegionsArray = newRegions.toArray();</TD></TR><TR><TD CLASS="l">1140</TD><TD> //</TD></TR><TR><TD CLASS="l">1141</TD><TD> // for the 'regionsReplaced' event, we don't care if</TD></TR><TR><TD CLASS="l">1142</TD><TD> // the regions changed due to type, or text,</TD></TR><TR><TD CLASS="l">1143</TD><TD> // we'll just collect all those that are not equal</TD></TR><TR><TD CLASS="l">1144</TD><TD> // into the old and new region lists.</TD></TR><TR><TD CLASS="l">1145</TD><TD> // Note: we, of course, assume that old and new regions</TD></TR><TR><TD CLASS="l">1146</TD><TD> // are basically contiguous -- and we force it to be so,</TD></TR><TR><TD CLASS="l">1147</TD><TD> // even if not literally so, by starting at beginning to</TD></TR><TR><TD CLASS="l">1148</TD><TD> // find first difference, and then starting at end to find</TD></TR><TR><TD CLASS="l">1149</TD><TD> // last difference. Everything in between we assume is different.</TD></TR><TR><TD CLASS="l">1150</TD><TD> //</TD></TR><TR><TD CLASS="l">1151</TD><TD> // going up is easy, we start at zero in each, and continue</TD></TR><TR><TD CLASS="l">1152</TD><TD> // till regions are not the same.</TD></TR><TR CLASS="z"><TD CLASS="l">1153</TD><TD> int startOfDifferences = _computeStartOfDifferences(oldNode, oldRegions, newNode, newRegions);</TD></TR><TR CLASS="z"><TD CLASS="l">1154</TD><TD> int endOfDifferencesOld = -1;</TD></TR><TR CLASS="z"><TD CLASS="l">1155</TD><TD> int endOfDifferencesNew = -1;</TD></TR><TR><TD CLASS="l">1156</TD><TD> //</TD></TR><TR><TD CLASS="l">1157</TD><TD> //</TD></TR><TR><TD CLASS="l">1158</TD><TD> // if one of the lists are shorter than where the differences start,</TD></TR><TR><TD CLASS="l">1159</TD><TD> // then</TD></TR><TR><TD CLASS="l">1160</TD><TD> // then some portion of the lists are identical</TD></TR><TR CLASS="z"><TD CLASS="l">1161</TD><TD> if ((startOfDifferences >= oldRegions.size()) || (startOfDifferences >= newRegions.size())) {</TD></TR><TR CLASS="z"><TD CLASS="l">1162</TD><TD> if (oldRegions.size() < newRegions.size()) {</TD></TR><TR><TD CLASS="l">1163</TD><TD> // INSERT CASE</TD></TR><TR><TD CLASS="l">1164</TD><TD> // then there are new regions to add</TD></TR><TR><TD CLASS="l">1165</TD><TD> // these lengths will cause the vector of old ones to not</TD></TR><TR><TD CLASS="l">1166</TD><TD> // have any elements, and the vector of new regions to have</TD></TR><TR><TD CLASS="l">1167</TD><TD> // just the new ones.</TD></TR><TR CLASS="z"><TD CLASS="l">1168</TD><TD> startOfDifferences = oldRegionsArray.length;</TD></TR><TR CLASS="z"><TD CLASS="l">1169</TD><TD> endOfDifferencesOld = oldRegionsArray.length - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">1170</TD><TD> endOfDifferencesNew = newRegionsArray.length - 1;</TD></TR><TR><TD CLASS="l">1171</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">1172</TD><TD> if (oldRegions.size() > newRegions.size()) {</TD></TR><TR><TD CLASS="l">1173</TD><TD> // DELETE CASE</TD></TR><TR><TD CLASS="l">1174</TD><TD> // then there are old regions to delete</TD></TR><TR><TD CLASS="l">1175</TD><TD> // these lengths will cause the vector of old regions to</TD></TR><TR><TD CLASS="l">1176</TD><TD> // contain the ones to delete, and the vector of new</TD></TR><TR><TD CLASS="l">1177</TD><TD> // regions</TD></TR><TR><TD CLASS="l">1178</TD><TD> // not have any elements</TD></TR><TR CLASS="z"><TD CLASS="l">1179</TD><TD> startOfDifferences = newRegionsArray.length;</TD></TR><TR CLASS="z"><TD CLASS="l">1180</TD><TD> endOfDifferencesOld = oldRegionsArray.length - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">1181</TD><TD> endOfDifferencesNew = newRegionsArray.length - 1;</TD></TR><TR><TD CLASS="l">1182</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1183</TD><TD> // else the lists are identical!</TD></TR><TR><TD CLASS="l">1184</TD><TD> // unlikely event, probably error in current design, since</TD></TR><TR><TD CLASS="l">1185</TD><TD> // we check for identity at the very beginning of</TD></TR><TR><TD CLASS="l">1186</TD><TD> // reparsing.</TD></TR><TR CLASS="z"><TD CLASS="l">1187</TD><TD> result = new NoChangeEvent(fStructuredDocument, fRequester, fChanges, fStart, fLengthToReplace);</TD></TR><TR><TD CLASS="l">1188</TD><TD> }</TD></TR><TR><TD CLASS="l">1189</TD><TD> }</TD></TR><TR><TD CLASS="l">1190</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">1191</TD><TD> if ((startOfDifferences > -1) && (endOfDifferencesOld < 0) && (endOfDifferencesNew < 0)) {</TD></TR><TR><TD CLASS="l">1192</TD><TD> // We found a normal startOfDiffernces, but have not yet found</TD></TR><TR><TD CLASS="l">1193</TD><TD> // the ends.</TD></TR><TR><TD CLASS="l">1194</TD><TD> // We'll look for the end of differences by going backwards</TD></TR><TR><TD CLASS="l">1195</TD><TD> // down the two lists.</TD></TR><TR><TD CLASS="l">1196</TD><TD> // Here we need a seperate index for each array, since they</TD></TR><TR><TD CLASS="l">1197</TD><TD> // may</TD></TR><TR><TD CLASS="l">1198</TD><TD> // be (and</TD></TR><TR><TD CLASS="l">1199</TD><TD> // probably are) of different lengths.</TD></TR><TR CLASS="z"><TD CLASS="l">1200</TD><TD> int indexOld = oldRegionsArray.length - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">1201</TD><TD> int indexNew = newRegionsArray.length - 1;</TD></TR><TR CLASS="z"><TD CLASS="l">1202</TD><TD> while ((indexOld >= startOfDifferences) && (_greaterThanEffectedRegion(oldNode, oldRegionsArray[indexOld]))) {</TD></TR><TR CLASS="z"><TD CLASS="l">1203</TD><TD> if ((!(oldNode.sameAs(oldRegionsArray[indexOld], newNode, newRegionsArray[indexNew], fLengthDifference)))) {</TD></TR><TR><TD CLASS="l">1204</TD><TD> //endOfDifferencesOld = indexOne;</TD></TR><TR><TD CLASS="l">1205</TD><TD> //endOfDifferencesNew = indexTwo;</TD></TR><TR CLASS="z"><TD CLASS="l">1206</TD><TD> break;</TD></TR><TR><TD CLASS="l">1207</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1208</TD><TD> indexOld--;</TD></TR><TR CLASS="z"><TD CLASS="l">1209</TD><TD> indexNew--;</TD></TR><TR><TD CLASS="l">1210</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1211</TD><TD> endOfDifferencesOld = indexOld;</TD></TR><TR CLASS="z"><TD CLASS="l">1212</TD><TD> endOfDifferencesNew = indexNew;</TD></TR><TR><TD CLASS="l">1213</TD><TD> }</TD></TR><TR><TD CLASS="l">1214</TD><TD> }</TD></TR><TR><TD CLASS="l">1215</TD><TD> //</TD></TR><TR><TD CLASS="l">1216</TD><TD> // result != null means the impossible case above occurred</TD></TR><TR CLASS="z"><TD CLASS="l">1217</TD><TD> if (result == null) {</TD></TR><TR><TD CLASS="l">1218</TD><TD> // Now form the two vectors of different regions</TD></TR><TR CLASS="z"><TD CLASS="l">1219</TD><TD> ITextRegionList holdOldRegions = new TextRegionListImpl();</TD></TR><TR CLASS="z"><TD CLASS="l">1220</TD><TD> ITextRegionList holdNewRegions = new TextRegionListImpl();</TD></TR><TR CLASS="z"><TD CLASS="l">1221</TD><TD> if (startOfDifferences > -1 && endOfDifferencesOld > -1) {</TD></TR><TR CLASS="z"><TD CLASS="l">1222</TD><TD> for (int i = startOfDifferences; i <= endOfDifferencesOld; i++) {</TD></TR><TR CLASS="z"><TD CLASS="l">1223</TD><TD> holdOldRegions.add(oldRegionsArray[i]);</TD></TR><TR><TD CLASS="l">1224</TD><TD> }</TD></TR><TR><TD CLASS="l">1225</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1226</TD><TD> if (startOfDifferences > -1 && endOfDifferencesNew > -1) {</TD></TR><TR CLASS="z"><TD CLASS="l">1227</TD><TD> for (int i = startOfDifferences; i <= endOfDifferencesNew; i++) {</TD></TR><TR CLASS="z"><TD CLASS="l">1228</TD><TD> holdNewRegions.add(newRegionsArray[i]);</TD></TR><TR><TD CLASS="l">1229</TD><TD> }</TD></TR><TR><TD CLASS="l">1230</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1231</TD><TD> if (holdOldRegions.size() == 0 && holdNewRegions.size() == 0) {</TD></TR><TR><TD CLASS="l">1232</TD><TD> // then this means the regions were identical, which means</TD></TR><TR><TD CLASS="l">1233</TD><TD> // someone</TD></TR><TR><TD CLASS="l">1234</TD><TD> // pasted exactly the same thing they had selected, or !!!</TD></TR><TR><TD CLASS="l">1235</TD><TD> // someone deleted the end bracket of the tag. !!!?</TD></TR><TR CLASS="z"><TD CLASS="l">1236</TD><TD> result = new NoChangeEvent(fStructuredDocument, fRequester, fChanges, fStart, fLengthToReplace);</TD></TR><TR><TD CLASS="l">1237</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1238</TD><TD> //If both holdOldRegions and holdNewRegions are of length 1,</TD></TR><TR><TD CLASS="l">1239</TD><TD> // then its</TD></TR><TR><TD CLASS="l">1240</TD><TD> // a "region changed" event, else a "regions replaced" event.</TD></TR><TR><TD CLASS="l">1241</TD><TD> // so we want the new instance of region to become part of the</TD></TR><TR><TD CLASS="l">1242</TD><TD> // old instance of old node</TD></TR><TR CLASS="z"><TD CLASS="l">1243</TD><TD> if ((holdOldRegions.size() == 1) && (holdNewRegions.size() == 1) && _regionsSameKind((holdNewRegions.get(0)), (holdOldRegions.get(0)))) {</TD></TR><TR CLASS="z"><TD CLASS="l">1244</TD><TD> ITextRegion newOldRegion = swapNewForOldRegion(oldNode, holdOldRegions.get(0), newNode, holdNewRegions.get(0));</TD></TR><TR><TD CLASS="l">1245</TD><TD> // -- need to update any down stream regions, within this</TD></TR><TR><TD CLASS="l">1246</TD><TD> // 'oldNode'</TD></TR><TR CLASS="z"><TD CLASS="l">1247</TD><TD> updateDownStreamRegions(oldNode, newOldRegion);</TD></TR><TR CLASS="z"><TD CLASS="l">1248</TD><TD> result = new RegionChangedEvent(fStructuredDocument, fRequester, oldNode, newOldRegion, fChanges, fStart, fLengthToReplace);</TD></TR><TR><TD CLASS="l">1249</TD><TD> } else {</TD></TR><TR CLASS="z"><TD CLASS="l">1250</TD><TD> replaceRegions(oldNode, holdOldRegions, newNode, holdNewRegions);</TD></TR><TR><TD CLASS="l">1251</TD><TD> // -- need to update any down stream regions, within this</TD></TR><TR><TD CLASS="l">1252</TD><TD> // 'oldNode'</TD></TR><TR><TD CLASS="l">1253</TD><TD> // don't need with the way replaceRegions is implemented.</TD></TR><TR><TD CLASS="l">1254</TD><TD> // It handles.</TD></TR><TR><TD CLASS="l">1255</TD><TD> //if(holdNewRegions.size() > 0)</TD></TR><TR><TD CLASS="l">1256</TD><TD> //updateDownStreamRegions(oldNode, (ITextRegion)</TD></TR><TR><TD CLASS="l">1257</TD><TD> // holdNewRegions.lastElement());</TD></TR><TR CLASS="z"><TD CLASS="l">1258</TD><TD> result = new RegionsReplacedEvent(fStructuredDocument, fRequester, oldNode, holdOldRegions, holdNewRegions, fChanges, fStart, fLengthToReplace);</TD></TR><TR><TD CLASS="l">1259</TD><TD> }</TD></TR><TR><TD CLASS="l">1260</TD><TD> }</TD></TR><TR><TD CLASS="l">1261</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1262</TD><TD> return result;</TD></TR><TR><TD CLASS="l">1263</TD><TD> }</TD></TR><TR><TD CLASS="l">1264</TD><TD> </TD></TR><TR><TD CLASS="l">1265</TD><TD> /**</TD></TR><TR><TD CLASS="l">1266</TD><TD> * An entry point for reparsing. It calculates the dirty start and dirty</TD></TR><TR><TD CLASS="l"><A NAME="2c">1267</A></TD><TD> * end flatnodes based on the start point and length of the changes.</TD></TR><TR><TD CLASS="l">1268</TD><TD> * </TD></TR><TR><TD CLASS="l">1269</TD><TD> */</TD></TR><TR><TD CLASS="l">1270</TD><TD> public StructuredDocumentEvent reparse() {</TD></TR><TR CLASS="c"><TD CLASS="l">1271</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR><TD CLASS="l">1272</TD><TD> // if we do not have a cachedNode, then the document</TD></TR><TR><TD CLASS="l">1273</TD><TD> // must be empty, so simply use 'null' as the dirtyStart and dirtyEnd</TD></TR><TR><TD CLASS="l">1274</TD><TD> // otherwise, find them.</TD></TR><TR CLASS="c"><TD CLASS="l">1275</TD><TD> if (fStructuredDocument.getCachedDocumentRegion() != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">1276</TD><TD> findDirtyStart(fStart);</TD></TR><TR CLASS="z"><TD CLASS="l">1277</TD><TD> int end = fStart + fLengthToReplace;</TD></TR><TR CLASS="z"><TD CLASS="l">1278</TD><TD> findDirtyEnd(end);</TD></TR><TR><TD CLASS="l">1279</TD><TD> }</TD></TR><TR CLASS="c"><TD CLASS="l">1280</TD><TD> if (fStructuredDocument.getCachedDocumentRegion() != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">1281</TD><TD> result = checkHeuristics();</TD></TR><TR><TD CLASS="l">1282</TD><TD> }</TD></TR><TR CLASS="c"><TD CLASS="l">1283</TD><TD> if (result == null) {</TD></TR><TR CLASS="c"><TD CLASS="l">1284</TD><TD> result = reparse(dirtyStart, dirtyEnd);</TD></TR><TR><TD CLASS="l">1285</TD><TD> }</TD></TR><TR CLASS="c"><TD CLASS="l">1286</TD><TD> endReParse();</TD></TR><TR CLASS="c"><TD CLASS="l">1287</TD><TD> return result;</TD></TR><TR><TD CLASS="l">1288</TD><TD> }</TD></TR><TR><TD CLASS="l">1289</TD><TD> </TD></TR><TR><TD CLASS="l">1290</TD><TD> /**</TD></TR><TR><TD CLASS="l">1291</TD><TD> * An entry point for reparsing. It calculates the dirty start and dirty</TD></TR><TR><TD CLASS="l">1292</TD><TD> * end flatnodes based on suggested positions to begin and end. This is</TD></TR><TR><TD CLASS="l">1293</TD><TD> * needed for cases where parsing must go beyond the immediate node and</TD></TR><TR><TD CLASS="l"><A NAME="25">1294</A></TD><TD> * its direct neighbors.</TD></TR><TR><TD CLASS="l">1295</TD><TD> * </TD></TR><TR><TD CLASS="l">1296</TD><TD> */</TD></TR><TR><TD CLASS="l">1297</TD><TD> protected StructuredDocumentEvent reparse(int reScanStartHint, int reScanEndHint) {</TD></TR><TR CLASS="z"><TD CLASS="l">1298</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR><TD CLASS="l">1299</TD><TD> // if we do not have a cachedNode, then the document</TD></TR><TR><TD CLASS="l">1300</TD><TD> // must be empty, so simply use 'null' as the dirtyStart and dirtyEnd</TD></TR><TR CLASS="z"><TD CLASS="l">1301</TD><TD> if (fStructuredDocument.getCachedDocumentRegion() != null) {</TD></TR><TR CLASS="z"><TD CLASS="l">1302</TD><TD> findDirtyStart(reScanStartHint);</TD></TR><TR CLASS="z"><TD CLASS="l">1303</TD><TD> findDirtyEnd(reScanEndHint);</TD></TR><TR><TD CLASS="l">1304</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1305</TD><TD> result = reparse(dirtyStart, dirtyEnd);</TD></TR><TR CLASS="z"><TD CLASS="l">1306</TD><TD> isParsing = false;</TD></TR><TR><TD CLASS="l">1307</TD><TD> // debug</TD></TR><TR><TD CLASS="l">1308</TD><TD> //verifyStructured(result);</TD></TR><TR CLASS="z"><TD CLASS="l">1309</TD><TD> return result;</TD></TR><TR><TD CLASS="l">1310</TD><TD> }</TD></TR><TR><TD CLASS="l">1311</TD><TD> </TD></TR><TR><TD CLASS="l">1312</TD><TD> /**</TD></TR><TR><TD CLASS="l"><A NAME="2e">1313</A></TD><TD> * The core reparsing method ... after the dirty start and dirty end have</TD></TR><TR><TD CLASS="l">1314</TD><TD> * been calculated elsewhere.</TD></TR><TR><TD CLASS="l">1315</TD><TD> */</TD></TR><TR><TD CLASS="l">1316</TD><TD> protected StructuredDocumentEvent reparse(IStructuredDocumentRegion dirtyStart, IStructuredDocumentRegion dirtyEnd) {</TD></TR><TR CLASS="c"><TD CLASS="l">1317</TD><TD> StructuredDocumentEvent result = null;</TD></TR><TR CLASS="c"><TD CLASS="l">1318</TD><TD> int rescanStart = -1;</TD></TR><TR CLASS="c"><TD CLASS="l">1319</TD><TD> int rescanEnd = -1;</TD></TR><TR CLASS="c"><TD CLASS="l">1320</TD><TD> boolean firstTime = false;</TD></TR><TR><TD CLASS="l">1321</TD><TD> //</TD></TR><TR><TD CLASS="l">1322</TD><TD> // "save" the oldNodes (that may be replaced) in a list</TD></TR><TR CLASS="c"><TD CLASS="l">1323</TD><TD> CoreNodeList oldNodes = formOldNodes(dirtyStart, dirtyEnd);</TD></TR><TR CLASS="p"><TD CLASS="l" TITLE="88% line coverage (15 out of 17 instructions)">1324</TD><TD TITLE="88% line coverage (15 out of 17 instructions)"> if (dirtyStart == null || dirtyEnd == null) {</TD></TR><TR><TD CLASS="l">1325</TD><TD> // dirtyStart or dirty end are null, then that means we didn't</TD></TR><TR><TD CLASS="l">1326</TD><TD> // have</TD></TR><TR><TD CLASS="l">1327</TD><TD> // a</TD></TR><TR><TD CLASS="l">1328</TD><TD> // cached node, which means we have an empty document, so we</TD></TR><TR><TD CLASS="l">1329</TD><TD> // just need to rescan the changes</TD></TR><TR CLASS="c"><TD CLASS="l">1330</TD><TD> rescanStart = 0;</TD></TR><TR CLASS="c"><TD CLASS="l">1331</TD><TD> rescanEnd = fChanges.length();</TD></TR><TR CLASS="c"><TD CLASS="l">1332</TD><TD> firstTime = true;</TD></TR><TR><TD CLASS="l">1333</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1334</TD><TD> // set the start of the text to rescan</TD></TR><TR CLASS="z"><TD CLASS="l">1335</TD><TD> rescanStart = dirtyStart.getStart();</TD></TR><TR><TD CLASS="l">1336</TD><TD> //</TD></TR><TR><TD CLASS="l">1337</TD><TD> // set the end of the text to rescan</TD></TR><TR><TD CLASS="l">1338</TD><TD> // notice we use the same rationale as for the rescanStart,</TD></TR><TR><TD CLASS="l">1339</TD><TD> // with the added caveat that length has to be added to it,</TD></TR><TR><TD CLASS="l">1340</TD><TD> // to compensate for the new text which has been added or deleted.</TD></TR><TR><TD CLASS="l">1341</TD><TD> // If changes has zero length, then "length" will be negative,</TD></TR><TR><TD CLASS="l">1342</TD><TD> // since</TD></TR><TR><TD CLASS="l">1343</TD><TD> // we are deleting text. Otherwise, use the difference between</TD></TR><TR><TD CLASS="l">1344</TD><TD> // what's selected to be replaced and the length of the new text.</TD></TR><TR CLASS="z"><TD CLASS="l">1345</TD><TD> rescanEnd = dirtyEnd.getEnd() + fLengthDifference;</TD></TR><TR><TD CLASS="l">1346</TD><TD> }</TD></TR><TR><TD CLASS="l">1347</TD><TD> // now that we have the old stuff "saved" away, update the document</TD></TR><TR><TD CLASS="l">1348</TD><TD> // with the changes.</TD></TR><TR><TD CLASS="l">1349</TD><TD> // FUTURE_TO_DO -- don't fire "document changed" event till later</TD></TR><TR CLASS="c"><TD CLASS="l">1350</TD><TD> fStructuredDocument.updateDocumentData(fStart, fLengthToReplace, fChanges);</TD></TR><TR><TD CLASS="l">1351</TD><TD> // ------------------ now the real work</TD></TR><TR CLASS="c"><TD CLASS="l">1352</TD><TD> result = core_reparse(rescanStart, rescanEnd, oldNodes, firstTime);</TD></TR><TR><TD CLASS="l">1353</TD><TD> //</TD></TR><TR><TD CLASS="l">1354</TD><TD> // event is returned to the caller, incase there is</TD></TR><TR><TD CLASS="l">1355</TD><TD> // some opitmization they can do</TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="26">1356</A></TD><TD> return result;</TD></TR><TR><TD CLASS="l">1357</TD><TD> }</TD></TR><TR><TD CLASS="l">1358</TD><TD> </TD></TR><TR><TD CLASS="l">1359</TD><TD> protected void replaceRegions(IStructuredDocumentRegion oldNode, ITextRegionList oldRegions, IStructuredDocumentRegion newNode, ITextRegionList newRegions) {</TD></TR><TR CLASS="z"><TD CLASS="l">1360</TD><TD> int insertPos = -1;</TD></TR><TR CLASS="z"><TD CLASS="l">1361</TD><TD> ITextRegionList regions = oldNode.getRegions();</TD></TR><TR><TD CLASS="l">1362</TD><TD> // make a fake flatnode to be new parent of oldRegions, so their text</TD></TR><TR><TD CLASS="l">1363</TD><TD> // will be right.</TD></TR><TR><TD CLASS="l">1364</TD><TD> //IStructuredDocumentRegion holdOldStructuredDocumentRegion = new</TD></TR><TR><TD CLASS="l">1365</TD><TD> // BasicStructuredDocumentRegion(oldNode);</TD></TR><TR><TD CLASS="l">1366</TD><TD> //</TD></TR><TR><TD CLASS="l">1367</TD><TD> // need to reset the parent of the new to-be-inserted regions to be</TD></TR><TR><TD CLASS="l">1368</TD><TD> // the</TD></TR><TR><TD CLASS="l">1369</TD><TD> // same oldNode that is the one having its regions changed</TD></TR><TR><TD CLASS="l">1370</TD><TD> // DW, 4/16/2003, removed since ITextRegion no longer has parent.</TD></TR><TR><TD CLASS="l">1371</TD><TD> // ITextRegionContainer oldParent = oldNode;</TD></TR><TR><TD CLASS="l">1372</TD><TD> // for (int i = 0; i < newRegions.size(); i++) {</TD></TR><TR><TD CLASS="l">1373</TD><TD> // AbstractRegion region = (AbstractRegion) newRegions.elementAt(i);</TD></TR><TR><TD CLASS="l">1374</TD><TD> // region.setParent(oldParent);</TD></TR><TR><TD CLASS="l">1375</TD><TD> // }</TD></TR><TR><TD CLASS="l">1376</TD><TD> // if there are no old regions, insert the new regions according to</TD></TR><TR><TD CLASS="l">1377</TD><TD> // offset</TD></TR><TR CLASS="z"><TD CLASS="l">1378</TD><TD> if (oldRegions.size() == 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1379</TD><TD> ITextRegion firstNewRegion = newRegions.get(0);</TD></TR><TR CLASS="z"><TD CLASS="l">1380</TD><TD> int firstOffset = newNode.getStartOffset(firstNewRegion);</TD></TR><TR><TD CLASS="l">1381</TD><TD> // if at beginning, insert there</TD></TR><TR CLASS="z"><TD CLASS="l">1382</TD><TD> if (firstOffset == 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1383</TD><TD> insertPos = 0;</TD></TR><TR><TD CLASS="l">1384</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1385</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">1386</TD><TD> ITextRegion regionAtOffset = oldNode.getRegionAtCharacterOffset(firstOffset);</TD></TR><TR CLASS="z"><TD CLASS="l">1387</TD><TD> if (regionAtOffset == null)</TD></TR><TR CLASS="z"><TD CLASS="l">1388</TD><TD> insertPos = regions.size();</TD></TR><TR><TD CLASS="l">1389</TD><TD> else</TD></TR><TR CLASS="z"><TD CLASS="l">1390</TD><TD> insertPos = regions.indexOf(regionAtOffset);</TD></TR><TR><TD CLASS="l">1391</TD><TD> }</TD></TR><TR><TD CLASS="l">1392</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1393</TD><TD> // else, delete old ones before inserting new ones in their place</TD></TR><TR CLASS="z"><TD CLASS="l">1394</TD><TD> ITextRegion firstOldRegion = oldRegions.get(0);</TD></TR><TR CLASS="z"><TD CLASS="l">1395</TD><TD> insertPos = regions.indexOf(firstOldRegion);</TD></TR><TR CLASS="z"><TD CLASS="l">1396</TD><TD> regions.removeAll(oldRegions);</TD></TR><TR><TD CLASS="l">1397</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1398</TD><TD> regions.addAll(insertPos, newRegions);</TD></TR><TR><TD CLASS="l">1399</TD><TD> // now regions vector of each node should be of equal length,</TD></TR><TR><TD CLASS="l">1400</TD><TD> // so go through each, and make sure the old regions</TD></TR><TR><TD CLASS="l">1401</TD><TD> // offsets matches the new regions offsets</TD></TR><TR><TD CLASS="l">1402</TD><TD> // (we'll just assign them all, but could be slightly more effiecient)</TD></TR><TR CLASS="z"><TD CLASS="l">1403</TD><TD> ITextRegionList allNewRegions = newNode.getRegions();</TD></TR><TR CLASS="z"><TD CLASS="l">1404</TD><TD> for (int i = 0; i < regions.size(); i++) {</TD></TR><TR CLASS="z"><TD CLASS="l">1405</TD><TD> ITextRegion nextOldishRegion = regions.get(i);</TD></TR><TR CLASS="z"><TD CLASS="l">1406</TD><TD> ITextRegion nextNewRegion = allNewRegions.get(i);</TD></TR><TR CLASS="z"><TD CLASS="l">1407</TD><TD> nextOldishRegion.equatePositions(nextNewRegion);</TD></TR><TR CLASS="z"><TD CLASS="l">1408</TD><TD> checkAndAssignParent(oldNode, nextOldishRegion);</TD></TR><TR><TD CLASS="l">1409</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1410</TD><TD> oldNode.setLength(newNode.getLength());</TD></TR><TR CLASS="z"><TD CLASS="l">1411</TD><TD> oldNode.setEnded(newNode.isEnded());</TD></TR><TR CLASS="z"><TD CLASS="l">1412</TD><TD> oldNode.setParentDocument(newNode.getParentDocument());</TD></TR><TR><TD CLASS="l">1413</TD><TD> // removed concept of part of these regions, so no longer need to do.</TD></TR><TR><TD CLASS="l">1414</TD><TD> // for (int i = 0; i < oldRegions.size(); i++) {</TD></TR><TR><TD CLASS="l">1415</TD><TD> // ITextRegion region = (ITextRegion) oldRegions.elementAt(i);</TD></TR><TR><TD CLASS="l">1416</TD><TD> // region.setParent(holdOldStructuredDocumentRegion);</TD></TR><TR><TD CLASS="l">1417</TD><TD> // }</TD></TR><TR CLASS="z"><TD CLASS="l">1418</TD><TD> }</TD></TR><TR><TD CLASS="l">1419</TD><TD> </TD></TR><TR><TD CLASS="l">1420</TD><TD> private void reSetCachedNode(CoreNodeList oldNodes, CoreNodeList newNodes) {</TD></TR><TR><TD CLASS="l"><A NAME="22">1421</A></TD><TD> // use the last newNode as the new cachedNode postion, unless its null</TD></TR><TR><TD CLASS="l">1422</TD><TD> // (e.g. when nodes are deleted) in which case, assign</TD></TR><TR><TD CLASS="l">1423</TD><TD> // it to a "safe" node so we don't lose reference to the</TD></TR><TR><TD CLASS="l">1424</TD><TD> // structuredDocument!</TD></TR><TR CLASS="z"><TD CLASS="l">1425</TD><TD> if (newNodes.getLength() > 0) {</TD></TR><TR><TD CLASS="l">1426</TD><TD> // use last new node as the cache</TD></TR><TR CLASS="z"><TD CLASS="l">1427</TD><TD> fStructuredDocument.setCachedDocumentRegion(newNodes.item(newNodes.getLength() - 1));</TD></TR><TR><TD CLASS="l">1428</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1429</TD><TD> // if cachedNode is an old node, then we're in trouble:</TD></TR><TR><TD CLASS="l">1430</TD><TD> // we can't leave it as the cached node! and its already</TD></TR><TR><TD CLASS="l">1431</TD><TD> // been disconnected from the model, so we can't do getNext</TD></TR><TR><TD CLASS="l">1432</TD><TD> // or getPrevious, so we'll get one that is right before</TD></TR><TR><TD CLASS="l">1433</TD><TD> // (or right after) the offset of the old nodes that are being</TD></TR><TR><TD CLASS="l">1434</TD><TD> // deleted.</TD></TR><TR><TD CLASS="l">1435</TD><TD> // </TD></TR><TR><TD CLASS="l">1436</TD><TD> // if newNodesHead and cachedNode are both null, then</TD></TR><TR><TD CLASS="l">1437</TD><TD> // it means we were asked to insert an empty string into</TD></TR><TR><TD CLASS="l">1438</TD><TD> // an empty document. So we have nothing to do here</TD></TR><TR><TD CLASS="l">1439</TD><TD> // (that is, we have no node to cache)</TD></TR><TR><TD CLASS="l">1440</TD><TD> // similarly if there are no new nodes and no old nodes then</TD></TR><TR><TD CLASS="l">1441</TD><TD> // nothing to do (but that should never happen ... we shouldn't</TD></TR><TR><TD CLASS="l">1442</TD><TD> // get there if there is no event to generate).</TD></TR><TR CLASS="z"><TD CLASS="l">1443</TD><TD> if ((fStructuredDocument.getCachedDocumentRegion() != null) && (oldNodes.getLength() > 0)) {</TD></TR><TR><TD CLASS="l">1444</TD><TD> // note: we can't simple use nodeAtCharacterOffset, since it</TD></TR><TR><TD CLASS="l">1445</TD><TD> // depends on cachedNode.</TD></TR><TR CLASS="z"><TD CLASS="l">1446</TD><TD> if (oldNodes.includes(fStructuredDocument.getCachedDocumentRegion()))</TD></TR><TR CLASS="z"><TD CLASS="l">1447</TD><TD> fStructuredDocument.setCachedDocumentRegion(fStructuredDocument.getFirstStructuredDocumentRegion());</TD></TR><TR><TD CLASS="l">1448</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1449</TD><TD> if ((fStructuredDocument.getCachedDocumentRegion() == null) && (Debug.displayWarnings)) {</TD></TR><TR><TD CLASS="l">1450</TD><TD> // this will happen now legitamately when all text is deleted</TD></TR><TR><TD CLASS="l">1451</TD><TD> // from a document</TD></TR><TR><TD CLASS="l">1452</TD><TD> System.out.println("Warning: StructuredDocumentReParser::reSetCachedNode: could not find a node to cache! (its ok if all text deleted)"); //$NON-NLS-1$</TD></TR><TR><TD CLASS="l">1453</TD><TD> }</TD></TR><TR><TD CLASS="l">1454</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1455</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="35">1456</A></TD><TD> </TD></TR><TR><TD CLASS="l">1457</TD><TD> public void setStructuredDocument(IStructuredDocument newStructuredDocument) {</TD></TR><TR><TD CLASS="l">1458</TD><TD> // NOTE: this method (and class) depend on being able to</TD></TR><TR><TD CLASS="l">1459</TD><TD> // do the following cast (i.e. references some fields directly)</TD></TR><TR CLASS="c"><TD CLASS="l">1460</TD><TD> fStructuredDocument = (BasicStructuredDocument) newStructuredDocument;</TD></TR><TR CLASS="c"><TD CLASS="l">1461</TD><TD> fFindReplaceDocumentAdapter = null;</TD></TR><TR CLASS="c"><TD CLASS="l"><A NAME="27">1462</A></TD><TD> }</TD></TR><TR><TD CLASS="l">1463</TD><TD> </TD></TR><TR><TD CLASS="l">1464</TD><TD> private IStructuredDocumentRegion splice(CoreNodeList oldNodes, CoreNodeList newNodes) {</TD></TR><TR><TD CLASS="l">1465</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">1466</TD><TD> IStructuredDocumentRegion firstOld = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1467</TD><TD> IStructuredDocumentRegion firstNew = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1468</TD><TD> IStructuredDocumentRegion lastOld = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1469</TD><TD> IStructuredDocumentRegion lastNew = null;</TD></TR><TR><TD CLASS="l">1470</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">1471</TD><TD> IStructuredDocumentRegion oldPrevious = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1472</TD><TD> IStructuredDocumentRegion oldNext = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1473</TD><TD> IStructuredDocumentRegion newPrevious = null;</TD></TR><TR CLASS="z"><TD CLASS="l">1474</TD><TD> IStructuredDocumentRegion newNext = null;</TD></TR><TR><TD CLASS="l">1475</TD><TD> //</TD></TR><TR><TD CLASS="l">1476</TD><TD> // if called with both arguments empty lists, we can disregard.</TD></TR><TR><TD CLASS="l">1477</TD><TD> // this happens, for example, when some text is replaced with the</TD></TR><TR><TD CLASS="l">1478</TD><TD> // identical text.</TD></TR><TR CLASS="z"><TD CLASS="l">1479</TD><TD> if ((oldNodes.getLength() == 0) && (newNodes.getLength() == 0)) {</TD></TR><TR CLASS="z"><TD CLASS="l">1480</TD><TD> return null;</TD></TR><TR><TD CLASS="l">1481</TD><TD> }</TD></TR><TR><TD CLASS="l">1482</TD><TD> // get pointers</TD></TR><TR CLASS="z"><TD CLASS="l">1483</TD><TD> if (newNodes.getLength() > 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1484</TD><TD> firstNew = newNodes.item(0);</TD></TR><TR CLASS="z"><TD CLASS="l">1485</TD><TD> lastNew = newNodes.item(newNodes.getLength() - 1);</TD></TR><TR><TD CLASS="l">1486</TD><TD> }</TD></TR><TR><TD CLASS="l">1487</TD><TD> //</TD></TR><TR CLASS="z"><TD CLASS="l">1488</TD><TD> if (oldNodes.getLength() > 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1489</TD><TD> firstOld = oldNodes.item(0);</TD></TR><TR CLASS="z"><TD CLASS="l">1490</TD><TD> lastOld = oldNodes.item(oldNodes.getLength() - 1);</TD></TR><TR CLASS="z"><TD CLASS="l">1491</TD><TD> if (firstOld != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1492</TD><TD> oldPrevious = firstOld.getPrevious();</TD></TR><TR CLASS="z"><TD CLASS="l">1493</TD><TD> if (lastOld != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1494</TD><TD> oldNext = lastOld.getNext();</TD></TR><TR><TD CLASS="l">1495</TD><TD> }</TD></TR><TR><TD CLASS="l">1496</TD><TD> // handle switch</TD></TR><TR CLASS="z"><TD CLASS="l">1497</TD><TD> if (newNodes.getLength() > 0) {</TD></TR><TR><TD CLASS="l">1498</TD><TD> // switch surrounding StructuredDocumentRegions' references to</TD></TR><TR><TD CLASS="l">1499</TD><TD> // lists</TD></TR><TR CLASS="z"><TD CLASS="l">1500</TD><TD> if (oldPrevious != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1501</TD><TD> oldPrevious.setNext(firstNew);</TD></TR><TR CLASS="z"><TD CLASS="l">1502</TD><TD> if (newPrevious != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1503</TD><TD> newPrevious.setNext(firstOld);</TD></TR><TR CLASS="z"><TD CLASS="l">1504</TD><TD> if (oldNext != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1505</TD><TD> oldNext.setPrevious(lastNew);</TD></TR><TR CLASS="z"><TD CLASS="l">1506</TD><TD> if (newNext != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1507</TD><TD> newNext.setPrevious(lastOld);</TD></TR><TR><TD CLASS="l">1508</TD><TD> // switch list pointers to surrounding StructuredDocumentRegions</TD></TR><TR CLASS="z"><TD CLASS="l">1509</TD><TD> if (firstOld != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1510</TD><TD> firstOld.setPrevious(newPrevious);</TD></TR><TR CLASS="z"><TD CLASS="l">1511</TD><TD> if (lastOld != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1512</TD><TD> lastOld.setNext(newNext);</TD></TR><TR CLASS="z"><TD CLASS="l">1513</TD><TD> if (firstNew != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1514</TD><TD> firstNew.setPrevious(oldPrevious);</TD></TR><TR CLASS="z"><TD CLASS="l">1515</TD><TD> if (lastNew != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1516</TD><TD> lastNew.setNext(oldNext);</TD></TR><TR><TD CLASS="l">1517</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1518</TD><TD> // short circuit when there are no new nodes</TD></TR><TR CLASS="z"><TD CLASS="l">1519</TD><TD> if (oldPrevious != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1520</TD><TD> oldPrevious.setNext(oldNext);</TD></TR><TR CLASS="z"><TD CLASS="l">1521</TD><TD> if (oldNext != null)</TD></TR><TR CLASS="z"><TD CLASS="l">1522</TD><TD> oldNext.setPrevious(oldPrevious);</TD></TR><TR><TD CLASS="l">1523</TD><TD> }</TD></TR><TR><TD CLASS="l">1524</TD><TD> //</TD></TR><TR><TD CLASS="l">1525</TD><TD> // SIDE EFFECTs</TD></TR><TR><TD CLASS="l">1526</TD><TD> // if we have oldNodes, and if oldNext or oldPrevious is null,</TD></TR><TR><TD CLASS="l">1527</TD><TD> // that means we are replacing</TD></TR><TR><TD CLASS="l">1528</TD><TD> // the lastNode or firstNode the structuredDocuments's chain of nodes,</TD></TR><TR><TD CLASS="l">1529</TD><TD> // so we need to update the structuredDocuments last or first Node</TD></TR><TR><TD CLASS="l">1530</TD><TD> // as the last or first of the new nodes.</TD></TR><TR><TD CLASS="l">1531</TD><TD> // (and sometimes even these will be null! such as when deleting all</TD></TR><TR><TD CLASS="l">1532</TD><TD> // text in a document).</TD></TR><TR CLASS="z"><TD CLASS="l">1533</TD><TD> if ((oldNext == null) && (oldNodes.getLength() > 0)) {</TD></TR><TR CLASS="z"><TD CLASS="l">1534</TD><TD> if (newNodes.getLength() > 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1535</TD><TD> fStructuredDocument.setLastDocumentRegion(lastNew);</TD></TR><TR><TD CLASS="l">1536</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1537</TD><TD> // in this case, the last node is being deleted, but not</TD></TR><TR><TD CLASS="l">1538</TD><TD> // replaced</TD></TR><TR><TD CLASS="l">1539</TD><TD> // with anything. In this case, we can just back up one</TD></TR><TR><TD CLASS="l">1540</TD><TD> // from the first old node</TD></TR><TR CLASS="z"><TD CLASS="l">1541</TD><TD> fStructuredDocument.setLastDocumentRegion(firstOld.getPrevious());</TD></TR><TR><TD CLASS="l">1542</TD><TD> }</TD></TR><TR><TD CLASS="l">1543</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1544</TD><TD> if ((oldPrevious == null) && (oldNodes.getLength() > 0)) {</TD></TR><TR CLASS="z"><TD CLASS="l">1545</TD><TD> if (newNodes.getLength() > 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1546</TD><TD> fStructuredDocument.setFirstDocumentRegion(firstNew);</TD></TR><TR><TD CLASS="l">1547</TD><TD> } else {</TD></TR><TR><TD CLASS="l">1548</TD><TD> // in this case the first node is being deleted, but not</TD></TR><TR><TD CLASS="l">1549</TD><TD> // replaced</TD></TR><TR><TD CLASS="l">1550</TD><TD> // with anything. So, we just go one forward past the last old</TD></TR><TR><TD CLASS="l">1551</TD><TD> // node.</TD></TR><TR CLASS="z"><TD CLASS="l">1552</TD><TD> fStructuredDocument.setFirstDocumentRegion(lastOld.getNext());</TD></TR><TR><TD CLASS="l">1553</TD><TD> }</TD></TR><TR><TD CLASS="l">1554</TD><TD> }</TD></TR><TR><TD CLASS="l">1555</TD><TD> // as a tiny optimization, we return the first of the downstream</TD></TR><TR><TD CLASS="l">1556</TD><TD> // nodes,</TD></TR><TR><TD CLASS="l">1557</TD><TD> // if any</TD></TR><TR CLASS="z"><TD CLASS="l">1558</TD><TD> return oldNext;</TD></TR><TR><TD CLASS="l">1559</TD><TD> }</TD></TR><TR><TD CLASS="l">1560</TD><TD> </TD></TR><TR><TD CLASS="l">1561</TD><TD> /**</TD></TR><TR><TD CLASS="l">1562</TD><TD> * The purpose of this method is to "reuse" the old container region, when</TD></TR><TR><TD CLASS="l">1563</TD><TD> * found to be same (so same instance doesn't change). The goal is to</TD></TR><TR><TD CLASS="l">1564</TD><TD> * "transform" the old region, so its equivelent to the newly parsed one.</TD></TR><TR><TD CLASS="l"><A NAME="28">1565</A></TD><TD> * </TD></TR><TR><TD CLASS="l">1566</TD><TD> */</TD></TR><TR><TD CLASS="l">1567</TD><TD> private ITextRegion swapNewForOldRegion(IStructuredDocumentRegion oldNode, ITextRegion oldRegion, IStructuredDocumentRegion newNode, ITextRegion newRegion) {</TD></TR><TR><TD CLASS="l">1568</TD><TD> // makes the old region instance the correct size.</TD></TR><TR CLASS="z"><TD CLASS="l">1569</TD><TD> oldRegion.equatePositions(newRegion);</TD></TR><TR><TD CLASS="l">1570</TD><TD> // adjusts old node instance appropriately</TD></TR><TR CLASS="z"><TD CLASS="l">1571</TD><TD> oldNode.setLength(newNode.getLength());</TD></TR><TR CLASS="z"><TD CLASS="l">1572</TD><TD> oldNode.setEnded(newNode.isEnded());</TD></TR><TR><TD CLASS="l">1573</TD><TD> // we do have to set the parent document, since the oldNode's</TD></TR><TR><TD CLASS="l">1574</TD><TD> // were set to a temporary one, then newNode's have the</TD></TR><TR><TD CLASS="l">1575</TD><TD> // right one.</TD></TR><TR CLASS="z"><TD CLASS="l">1576</TD><TD> oldNode.setParentDocument(newNode.getParentDocument());</TD></TR><TR><TD CLASS="l">1577</TD><TD> // if we're transforming a container region, we need to be sure to</TD></TR><TR><TD CLASS="l">1578</TD><TD> // transfer the new embedded regions, to the old parent</TD></TR><TR><TD CLASS="l">1579</TD><TD> // Note: if oldRegion hasEmbeddedRegions, then we know the</TD></TR><TR><TD CLASS="l">1580</TD><TD> // newRegion does too, since we got here because they were the</TD></TR><TR><TD CLASS="l">1581</TD><TD> // same type.</TD></TR><TR CLASS="z"><TD CLASS="l">1582</TD><TD> if (isCollectionRegion(oldRegion)) { // ||</TD></TR><TR><TD CLASS="l">1583</TD><TD> // hasContainerRegions(oldRegion))</TD></TR><TR><TD CLASS="l">1584</TD><TD> // {</TD></TR><TR CLASS="z"><TD CLASS="l">1585</TD><TD> transferEmbeddedRegions(oldNode, (ITextRegionContainer) oldRegion, (ITextRegionContainer) newRegion);</TD></TR><TR><TD CLASS="l">1586</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l"><A NAME="29">1587</A></TD><TD> return oldRegion;</TD></TR><TR><TD CLASS="l">1588</TD><TD> }</TD></TR><TR><TD CLASS="l">1589</TD><TD> </TD></TR><TR><TD CLASS="l">1590</TD><TD> private IStructuredDocumentRegion switchNodeLists(CoreNodeList oldNodes, CoreNodeList newNodes) {</TD></TR><TR CLASS="z"><TD CLASS="l">1591</TD><TD> IStructuredDocumentRegion result = splice(oldNodes, newNodes);</TD></TR><TR><TD CLASS="l">1592</TD><TD> // ensure that the old nodes hold no references to the existing model</TD></TR><TR CLASS="z"><TD CLASS="l">1593</TD><TD> if (oldNodes.getLength() > 0) {</TD></TR><TR CLASS="z"><TD CLASS="l">1594</TD><TD> IStructuredDocumentRegion firstItem = oldNodes.item(0);</TD></TR><TR CLASS="z"><TD CLASS="l">1595</TD><TD> firstItem.setPrevious(null);</TD></TR><TR CLASS="z"><TD CLASS="l">1596</TD><TD> IStructuredDocumentRegion lastItem = oldNodes.item(oldNodes.getLength() - 1);</TD></TR><TR CLASS="z"><TD CLASS="l">1597</TD><TD> lastItem.setNext(null);</TD></TR><TR><TD CLASS="l">1598</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1599</TD><TD> return result;</TD></TR><TR><TD CLASS="l">1600</TD><TD> }</TD></TR><TR><TD CLASS="l">1601</TD><TD> </TD></TR><TR><TD CLASS="l">1602</TD><TD> /**</TD></TR><TR><TD CLASS="l">1603</TD><TD> * The purpose of this method is to "reuse" the old container region, when</TD></TR><TR><TD CLASS="l">1604</TD><TD> * found to be same (so same instance doesn't change). The goal is to</TD></TR><TR><TD CLASS="l">1605</TD><TD> * "transform" the old region, so its equivelent to the newly parsed one.</TD></TR><TR><TD CLASS="l">1606</TD><TD> * </TD></TR><TR><TD CLASS="l">1607</TD><TD> */</TD></TR><TR><TD CLASS="l">1608</TD><TD> private void transferEmbeddedRegions(IStructuredDocumentRegion oldNode, ITextRegionContainer oldRegion, ITextRegionContainer newRegion) {</TD></TR><TR><TD CLASS="l">1609</TD><TD> // the oldRegion should already have the right parent, since</TD></TR><TR><TD CLASS="l">1610</TD><TD> // we got here because all's equivelent except the region</TD></TR><TR><TD CLASS="l">1611</TD><TD> // postions have changed.</TD></TR><TR><TD CLASS="l"><A NAME="2a">1612</A></TD><TD> //oldRegion.setParent(newRegion.getParent());</TD></TR><TR><TD CLASS="l">1613</TD><TD> // but we should check if there's "nested" embedded regions, and if</TD></TR><TR><TD CLASS="l">1614</TD><TD> // so, we can just move them over. setting their parent as this old</TD></TR><TR><TD CLASS="l">1615</TD><TD> // region.</TD></TR><TR CLASS="z"><TD CLASS="l">1616</TD><TD> ITextRegionList newRegionsToTransfer = newRegion.getRegions();</TD></TR><TR CLASS="z"><TD CLASS="l">1617</TD><TD> oldRegion.setRegions(newRegionsToTransfer);</TD></TR><TR CLASS="z"><TD CLASS="l">1618</TD><TD> Iterator newRegionsInOldOne = newRegionsToTransfer.iterator();</TD></TR><TR CLASS="z"><TD CLASS="l">1619</TD><TD> while (newRegionsInOldOne.hasNext()) {</TD></TR><TR CLASS="z"><TD CLASS="l">1620</TD><TD> ITextRegion newOne = (ITextRegion) newRegionsInOldOne.next();</TD></TR><TR CLASS="z"><TD CLASS="l">1621</TD><TD> if (isCollectionRegion(newOne)) { // ||</TD></TR><TR><TD CLASS="l">1622</TD><TD> // hasContainerRegions(newOne)) {</TD></TR><TR><TD CLASS="l">1623</TD><TD> //((ITextRegionContainer) newOne).setParent(oldRegion);</TD></TR><TR CLASS="z"><TD CLASS="l">1624</TD><TD> oldRegion.setRegions(newRegion.getRegions());</TD></TR><TR><TD CLASS="l">1625</TD><TD> }</TD></TR><TR><TD CLASS="l">1626</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1627</TD><TD> }</TD></TR><TR><TD CLASS="l"><A NAME="2b">1628</A></TD><TD> </TD></TR><TR><TD CLASS="l">1629</TD><TD> private void updateDownStreamRegions(IStructuredDocumentRegion flatNode, ITextRegion lastKnownRegion) {</TD></TR><TR><TD CLASS="l">1630</TD><TD> // so all regions after the last known region (last known to be ok)</TD></TR><TR><TD CLASS="l">1631</TD><TD> // have to have their start and end values adjusted.</TD></TR><TR CLASS="z"><TD CLASS="l">1632</TD><TD> ITextRegionList regions = flatNode.getRegions();</TD></TR><TR CLASS="z"><TD CLASS="l">1633</TD><TD> int listLength = regions.size();</TD></TR><TR CLASS="z"><TD CLASS="l">1634</TD><TD> int startIndex = 0;</TD></TR><TR><TD CLASS="l">1635</TD><TD> // first, loop through to find where to start</TD></TR><TR CLASS="z"><TD CLASS="l">1636</TD><TD> for (int i = 0; i < listLength; i++) {</TD></TR><TR CLASS="z"><TD CLASS="l">1637</TD><TD> ITextRegion region = regions.get(i);</TD></TR><TR CLASS="z"><TD CLASS="l">1638</TD><TD> if (region == lastKnownRegion) {</TD></TR><TR CLASS="z"><TD CLASS="l">1639</TD><TD> startIndex = i;</TD></TR><TR CLASS="z"><TD CLASS="l">1640</TD><TD> break;</TD></TR><TR><TD CLASS="l">1641</TD><TD> }</TD></TR><TR><TD CLASS="l">1642</TD><TD> }</TD></TR><TR><TD CLASS="l">1643</TD><TD> // now, beginning one past the last known one, loop</TD></TR><TR><TD CLASS="l">1644</TD><TD> // through to end of list, adjusting the start and end postions.</TD></TR><TR CLASS="z"><TD CLASS="l">1645</TD><TD> startIndex++;</TD></TR><TR CLASS="z"><TD CLASS="l">1646</TD><TD> for (int j = startIndex; j < listLength; j++) {</TD></TR><TR CLASS="z"><TD CLASS="l">1647</TD><TD> ITextRegion region = regions.get(j);</TD></TR><TR CLASS="z"><TD CLASS="l">1648</TD><TD> region.adjustStart(fLengthDifference);</TD></TR><TR><TD CLASS="l">1649</TD><TD> }</TD></TR><TR CLASS="z"><TD CLASS="l">1650</TD><TD> }</TD></TR><TR><TD CLASS="l">1651</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="98.html">org.eclipse.wst.sse.core.internal.text</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> |