The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.
TIEDEMANN / uplug-main-0.3.8 / share / ext / parser / malt / docs / api / src-html / org / maltparser / parser / algorithm / twoplanar / TwoPlanarArcEagerOracle.html 
<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    package org.maltparser.parser.algorithm.twoplanar;<a name="line.1"></a>
<FONT color="green">002</FONT>    <a name="line.2"></a>
<FONT color="green">003</FONT>    import java.util.IdentityHashMap;<a name="line.3"></a>
<FONT color="green">004</FONT>    import java.util.Iterator;<a name="line.4"></a>
<FONT color="green">005</FONT>    import java.util.LinkedList;<a name="line.5"></a>
<FONT color="green">006</FONT>    import java.util.List;<a name="line.6"></a>
<FONT color="green">007</FONT>    import java.util.Map;<a name="line.7"></a>
<FONT color="green">008</FONT>    import java.util.SortedSet;<a name="line.8"></a>
<FONT color="green">009</FONT>    <a name="line.9"></a>
<FONT color="green">010</FONT>    import org.maltparser.core.exception.MaltChainedException;<a name="line.10"></a>
<FONT color="green">011</FONT>    import org.maltparser.core.syntaxgraph.DependencyStructure;<a name="line.11"></a>
<FONT color="green">012</FONT>    import org.maltparser.core.syntaxgraph.edge.Edge;<a name="line.12"></a>
<FONT color="green">013</FONT>    import org.maltparser.core.syntaxgraph.node.DependencyNode;<a name="line.13"></a>
<FONT color="green">014</FONT>    import org.maltparser.parser.DependencyParserConfig;<a name="line.14"></a>
<FONT color="green">015</FONT>    import org.maltparser.parser.Oracle;<a name="line.15"></a>
<FONT color="green">016</FONT>    import org.maltparser.parser.ParserConfiguration;<a name="line.16"></a>
<FONT color="green">017</FONT>    import org.maltparser.parser.history.GuideUserHistory;<a name="line.17"></a>
<FONT color="green">018</FONT>    import org.maltparser.parser.history.action.GuideUserAction;<a name="line.18"></a>
<FONT color="green">019</FONT>    /**<a name="line.19"></a>
<FONT color="green">020</FONT>     * @author Carlos Gomez Rodriguez<a name="line.20"></a>
<FONT color="green">021</FONT>     *<a name="line.21"></a>
<FONT color="green">022</FONT>     */<a name="line.22"></a>
<FONT color="green">023</FONT>    public class TwoPlanarArcEagerOracle extends Oracle {<a name="line.23"></a>
<FONT color="green">024</FONT>    <a name="line.24"></a>
<FONT color="green">025</FONT>            public TwoPlanarArcEagerOracle(DependencyParserConfig manager, GuideUserHistory history) throws MaltChainedException {<a name="line.25"></a>
<FONT color="green">026</FONT>                    super(manager, history);<a name="line.26"></a>
<FONT color="green">027</FONT>                    setGuideName("Two-Planar");<a name="line.27"></a>
<FONT color="green">028</FONT>            }<a name="line.28"></a>
<FONT color="green">029</FONT>            <a name="line.29"></a>
<FONT color="green">030</FONT>            /**<a name="line.30"></a>
<FONT color="green">031</FONT>             * Give this map an edge in the gold standard data, and it will tell you whether, given the links already created by the oracle, it is possible <a name="line.31"></a>
<FONT color="green">032</FONT>             * to create the corresponding edge in one of the planes, in any plane, or in none at all (the latter will happen in non-2-planar structures). <a name="line.32"></a>
<FONT color="green">033</FONT>             */<a name="line.33"></a>
<FONT color="green">034</FONT>            private static final int ANY_PLANE = 0;<a name="line.34"></a>
<FONT color="green">035</FONT>            private static final int FIRST_PLANE = 1;<a name="line.35"></a>
<FONT color="green">036</FONT>            private static final int SECOND_PLANE = 2;<a name="line.36"></a>
<FONT color="green">037</FONT>            private static final int NO_PLANE = 3;<a name="line.37"></a>
<FONT color="green">038</FONT>            private Map&lt;Edge,Integer&gt; linksToPlanes = new IdentityHashMap&lt;Edge,Integer&gt;();<a name="line.38"></a>
<FONT color="green">039</FONT>            <a name="line.39"></a>
<FONT color="green">040</FONT>            public GuideUserAction predict(DependencyStructure gold, ParserConfiguration config) throws MaltChainedException {<a name="line.40"></a>
<FONT color="green">041</FONT>                    TwoPlanarConfig planarConfig = (TwoPlanarConfig)config;<a name="line.41"></a>
<FONT color="green">042</FONT>                    DependencyStructure dg = planarConfig.getDependencyGraph();<a name="line.42"></a>
<FONT color="green">043</FONT>                    DependencyNode activeStackPeek = planarConfig.getActiveStack().peek();<a name="line.43"></a>
<FONT color="green">044</FONT>                    DependencyNode inactiveStackPeek = planarConfig.getInactiveStack().peek();<a name="line.44"></a>
<FONT color="green">045</FONT>                    int activeStackPeekIndex = activeStackPeek.getIndex();<a name="line.45"></a>
<FONT color="green">046</FONT>                    int inactiveStackPeekIndex = inactiveStackPeek.getIndex();<a name="line.46"></a>
<FONT color="green">047</FONT>                    int inputPeekIndex = planarConfig.getInput().peek().getIndex();<a name="line.47"></a>
<FONT color="green">048</FONT>                    <a name="line.48"></a>
<FONT color="green">049</FONT>                    //System.out.println("Initting crossings");<a name="line.49"></a>
<FONT color="green">050</FONT>                    <a name="line.50"></a>
<FONT color="green">051</FONT>                    if ( crossingsGraph == null ) initCrossingsGraph(gold);<a name="line.51"></a>
<FONT color="green">052</FONT>                    <a name="line.52"></a>
<FONT color="green">053</FONT>                    //System.out.println("Crossings initted");<a name="line.53"></a>
<FONT color="green">054</FONT>                    <a name="line.54"></a>
<FONT color="green">055</FONT>                    if (!activeStackPeek.isRoot() &amp;&amp; gold.getTokenNode(activeStackPeekIndex).getHead().getIndex() == inputPeekIndex<a name="line.55"></a>
<FONT color="green">056</FONT>                                    &amp;&amp; !checkIfArcExists ( dg , inputPeekIndex , activeStackPeekIndex ) )  {<a name="line.56"></a>
<FONT color="green">057</FONT>                            if ( planarConfig.getStackActivityState() == TwoPlanarConfig.FIRST_STACK )<a name="line.57"></a>
<FONT color="green">058</FONT>                            {<a name="line.58"></a>
<FONT color="green">059</FONT>                                    propagatePlaneConstraint(gold.getTokenNode(activeStackPeekIndex).getHeadEdge(), FIRST_PLANE );<a name="line.59"></a>
<FONT color="green">060</FONT>                            }<a name="line.60"></a>
<FONT color="green">061</FONT>                            else<a name="line.61"></a>
<FONT color="green">062</FONT>                            {<a name="line.62"></a>
<FONT color="green">063</FONT>                                    propagatePlaneConstraint(gold.getTokenNode(activeStackPeekIndex).getHeadEdge(), SECOND_PLANE );<a name="line.63"></a>
<FONT color="green">064</FONT>                            }<a name="line.64"></a>
<FONT color="green">065</FONT>                            //System.out.println("From " + inputPeekIndex + " to " + activeStackPeekIndex);<a name="line.65"></a>
<FONT color="green">066</FONT>                            return updateActionContainers(TwoPlanar.LEFTARC, gold.getTokenNode(activeStackPeekIndex).getHeadEdge().getLabelSet());  <a name="line.66"></a>
<FONT color="green">067</FONT>                    } <a name="line.67"></a>
<FONT color="green">068</FONT>                    <a name="line.68"></a>
<FONT color="green">069</FONT>                    else if (gold.getTokenNode(inputPeekIndex).getHead().getIndex() == activeStackPeekIndex<a name="line.69"></a>
<FONT color="green">070</FONT>                                    &amp;&amp; !checkIfArcExists ( dg , activeStackPeekIndex , inputPeekIndex ) ) {<a name="line.70"></a>
<FONT color="green">071</FONT>                            if ( planarConfig.getStackActivityState() == TwoPlanarConfig.FIRST_STACK )<a name="line.71"></a>
<FONT color="green">072</FONT>                            {<a name="line.72"></a>
<FONT color="green">073</FONT>                                    propagatePlaneConstraint(gold.getTokenNode(inputPeekIndex).getHeadEdge(), FIRST_PLANE );<a name="line.73"></a>
<FONT color="green">074</FONT>                            }<a name="line.74"></a>
<FONT color="green">075</FONT>                            else<a name="line.75"></a>
<FONT color="green">076</FONT>                            {<a name="line.76"></a>
<FONT color="green">077</FONT>                                    propagatePlaneConstraint(gold.getTokenNode(inputPeekIndex).getHeadEdge(), SECOND_PLANE );<a name="line.77"></a>
<FONT color="green">078</FONT>                            }<a name="line.78"></a>
<FONT color="green">079</FONT>                            //System.out.println("From " + activeStackPeekIndex + " to " + inputPeekIndex);<a name="line.79"></a>
<FONT color="green">080</FONT>                            return updateActionContainers(TwoPlanar.RIGHTARC, gold.getTokenNode(inputPeekIndex).getHeadEdge().getLabelSet());<a name="line.80"></a>
<FONT color="green">081</FONT>                    }<a name="line.81"></a>
<FONT color="green">082</FONT>                    <a name="line.82"></a>
<FONT color="green">083</FONT>                    else if (!inactiveStackPeek.isRoot() &amp;&amp; gold.getTokenNode(inactiveStackPeekIndex).getHead().getIndex() == inputPeekIndex<a name="line.83"></a>
<FONT color="green">084</FONT>                                    &amp;&amp; !checkIfArcExists ( dg , inputPeekIndex , inactiveStackPeekIndex ) )  {<a name="line.84"></a>
<FONT color="green">085</FONT>                            //need to create link, but on the other plane!!<a name="line.85"></a>
<FONT color="green">086</FONT>                            //TODO is this if branch really necessary? i.e. will this happen? (later branches already switch)<a name="line.86"></a>
<FONT color="green">087</FONT>                            //System.out.println("Switch one");<a name="line.87"></a>
<FONT color="green">088</FONT>                            return updateActionContainers(TwoPlanar.SWITCH, null);<a name="line.88"></a>
<FONT color="green">089</FONT>                    }<a name="line.89"></a>
<FONT color="green">090</FONT>                    <a name="line.90"></a>
<FONT color="green">091</FONT>                    else if (gold.getTokenNode(inputPeekIndex).getHead().getIndex() == inactiveStackPeekIndex<a name="line.91"></a>
<FONT color="green">092</FONT>                                    &amp;&amp; !checkIfArcExists ( dg , inactiveStackPeekIndex , inputPeekIndex ) ) {<a name="line.92"></a>
<FONT color="green">093</FONT>                            //need to create link, but on the other plane!!<a name="line.93"></a>
<FONT color="green">094</FONT>                            //TODO is this if branch really necessary? i.e. will this happen? (later branches already switch)<a name="line.94"></a>
<FONT color="green">095</FONT>                            //System.out.println("Switch two");<a name="line.95"></a>
<FONT color="green">096</FONT>                            return updateActionContainers(TwoPlanar.SWITCH, null);<a name="line.96"></a>
<FONT color="green">097</FONT>                    }<a name="line.97"></a>
<FONT color="green">098</FONT>                    <a name="line.98"></a>
<FONT color="green">099</FONT>                    else if ( getFirstPendingLinkOnActivePlane(planarConfig,gold) != null )<a name="line.99"></a>
<FONT color="green">100</FONT>                    {<a name="line.100"></a>
<FONT color="green">101</FONT>                            //System.out.println("Reduce one");<a name="line.101"></a>
<FONT color="green">102</FONT>                            return updateActionContainers(TwoPlanar.REDUCE, null);<a name="line.102"></a>
<FONT color="green">103</FONT>                    }<a name="line.103"></a>
<FONT color="green">104</FONT>                    <a name="line.104"></a>
<FONT color="green">105</FONT>                    else if ( getFirstPendingLinkOnInactivePlane(planarConfig,gold) != null )<a name="line.105"></a>
<FONT color="green">106</FONT>                    {<a name="line.106"></a>
<FONT color="green">107</FONT>                            //System.out.println("Switch for reducing");<a name="line.107"></a>
<FONT color="green">108</FONT>                            return updateActionContainers(TwoPlanar.SWITCH, null);<a name="line.108"></a>
<FONT color="green">109</FONT>                    }<a name="line.109"></a>
<FONT color="green">110</FONT>                    <a name="line.110"></a>
<FONT color="green">111</FONT>                    //TODO: double reduce somehow? (check if reduced node is not covered by links of the other plane, or something like that).<a name="line.111"></a>
<FONT color="green">112</FONT>            <a name="line.112"></a>
<FONT color="green">113</FONT>                    else <a name="line.113"></a>
<FONT color="green">114</FONT>                    {<a name="line.114"></a>
<FONT color="green">115</FONT>                            //System.out.println("Shift");<a name="line.115"></a>
<FONT color="green">116</FONT>                            return updateActionContainers(TwoPlanar.SHIFT, null);<a name="line.116"></a>
<FONT color="green">117</FONT>                    }<a name="line.117"></a>
<FONT color="green">118</FONT>                    <a name="line.118"></a>
<FONT color="green">119</FONT>            }<a name="line.119"></a>
<FONT color="green">120</FONT>            <a name="line.120"></a>
<FONT color="green">121</FONT>            private boolean checkIfArcExists ( DependencyStructure dg , int index1 , int index2 ) throws MaltChainedException<a name="line.121"></a>
<FONT color="green">122</FONT>            {<a name="line.122"></a>
<FONT color="green">123</FONT>                    return dg.getTokenNode(index2).hasHead() &amp;&amp; dg.getTokenNode(index2).getHead().getIndex() == index1;<a name="line.123"></a>
<FONT color="green">124</FONT>            }<a name="line.124"></a>
<FONT color="green">125</FONT>            <a name="line.125"></a>
<FONT color="green">126</FONT>            public void finalizeSentence(DependencyStructure dependencyGraph) throws MaltChainedException {<a name="line.126"></a>
<FONT color="green">127</FONT>                    crossingsGraph = null;<a name="line.127"></a>
<FONT color="green">128</FONT>                    linksToPlanes.clear();<a name="line.128"></a>
<FONT color="green">129</FONT>            }<a name="line.129"></a>
<FONT color="green">130</FONT>            <a name="line.130"></a>
<FONT color="green">131</FONT>            public void terminate() throws MaltChainedException {}<a name="line.131"></a>
<FONT color="green">132</FONT>    <a name="line.132"></a>
<FONT color="green">133</FONT>            <a name="line.133"></a>
<FONT color="green">134</FONT>            <a name="line.134"></a>
<FONT color="green">135</FONT>            private static boolean cross ( Edge e1 , Edge e2 )<a name="line.135"></a>
<FONT color="green">136</FONT>            {<a name="line.136"></a>
<FONT color="green">137</FONT>                    int xSource = e1.getSource().getIndex();<a name="line.137"></a>
<FONT color="green">138</FONT>                    int xTarget = e1.getTarget().getIndex();<a name="line.138"></a>
<FONT color="green">139</FONT>                    int ySource = e2.getSource().getIndex();<a name="line.139"></a>
<FONT color="green">140</FONT>                    int yTarget = e2.getTarget().getIndex();<a name="line.140"></a>
<FONT color="green">141</FONT>                    int xMin = Math.min(xSource,xTarget);<a name="line.141"></a>
<FONT color="green">142</FONT>                    int xMax = Math.max(xSource,xTarget);<a name="line.142"></a>
<FONT color="green">143</FONT>                    int yMin = Math.min(ySource,yTarget);<a name="line.143"></a>
<FONT color="green">144</FONT>                    int yMax = Math.max(ySource,yTarget);<a name="line.144"></a>
<FONT color="green">145</FONT>                    //System.out.println(xMin+":"+xMax+":"+yMin+":"+yMax);<a name="line.145"></a>
<FONT color="green">146</FONT>                    return ( xMin &lt; yMin &amp;&amp; yMin &lt; xMax &amp;&amp; xMax &lt; yMax ) || ( yMin &lt; xMin &amp;&amp; xMin &lt; yMax &amp;&amp; yMax &lt; xMax );<a name="line.146"></a>
<FONT color="green">147</FONT>            }<a name="line.147"></a>
<FONT color="green">148</FONT>            <a name="line.148"></a>
<FONT color="green">149</FONT>            private Map&lt;Edge,List&lt;Edge&gt;&gt; crossingsGraph = null;<a name="line.149"></a>
<FONT color="green">150</FONT>            <a name="line.150"></a>
<FONT color="green">151</FONT>            private void initCrossingsGraph ( DependencyStructure dg )<a name="line.151"></a>
<FONT color="green">152</FONT>            {<a name="line.152"></a>
<FONT color="green">153</FONT>                    crossingsGraph = new IdentityHashMap&lt;Edge,List&lt;Edge&gt;&gt;();<a name="line.153"></a>
<FONT color="green">154</FONT>                    SortedSet&lt;Edge&gt; edges = dg.getEdges();<a name="line.154"></a>
<FONT color="green">155</FONT>                    //System.out.println(edges.size());<a name="line.155"></a>
<FONT color="green">156</FONT>                    //System.out.println(dg.nEdges());<a name="line.156"></a>
<FONT color="green">157</FONT>                    for (Iterator&lt;Edge&gt; iterator1 = edges.iterator(); iterator1.hasNext();) {<a name="line.157"></a>
<FONT color="green">158</FONT>                            Edge edge1 = iterator1.next();<a name="line.158"></a>
<FONT color="green">159</FONT>                            for (Iterator&lt;Edge&gt; iterator2 = edges.iterator(); iterator2.hasNext();) {<a name="line.159"></a>
<FONT color="green">160</FONT>                                    Edge edge2 = iterator2.next();<a name="line.160"></a>
<FONT color="green">161</FONT>                                    if ( edge1.getSource().getIndex() &lt; edge2.getSource().getIndex() &amp;&amp; cross(edge1,edge2) )<a name="line.161"></a>
<FONT color="green">162</FONT>                                    {<a name="line.162"></a>
<FONT color="green">163</FONT>                                            //System.out.println("Crossing!");<a name="line.163"></a>
<FONT color="green">164</FONT>                                            List&lt;Edge&gt; crossingEdge1 = crossingsGraph.get(edge1);<a name="line.164"></a>
<FONT color="green">165</FONT>                                            if ( crossingEdge1 == null ) { crossingEdge1 = new LinkedList&lt;Edge&gt;(); crossingsGraph.put(edge1, crossingEdge1); }<a name="line.165"></a>
<FONT color="green">166</FONT>                                            crossingEdge1.add(edge2);<a name="line.166"></a>
<FONT color="green">167</FONT>                                            List&lt;Edge&gt; crossingEdge2 = crossingsGraph.get(edge2);<a name="line.167"></a>
<FONT color="green">168</FONT>                                            if ( crossingEdge2 == null ) { crossingEdge2 = new LinkedList&lt;Edge&gt;(); crossingsGraph.put(edge2 , crossingEdge2); }<a name="line.168"></a>
<FONT color="green">169</FONT>                                            crossingEdge2.add(edge1);<a name="line.169"></a>
<FONT color="green">170</FONT>                                    }<a name="line.170"></a>
<FONT color="green">171</FONT>                            }<a name="line.171"></a>
<FONT color="green">172</FONT>                    }<a name="line.172"></a>
<FONT color="green">173</FONT>            }<a name="line.173"></a>
<FONT color="green">174</FONT>            <a name="line.174"></a>
<FONT color="green">175</FONT>            private List&lt;Edge&gt; getCrossingEdges ( Edge e )<a name="line.175"></a>
<FONT color="green">176</FONT>            {<a name="line.176"></a>
<FONT color="green">177</FONT>                    return crossingsGraph.get(e);<a name="line.177"></a>
<FONT color="green">178</FONT>            }<a name="line.178"></a>
<FONT color="green">179</FONT>            <a name="line.179"></a>
<FONT color="green">180</FONT>            private void setPlaneConstraint ( Edge e , int requiredPlane )<a name="line.180"></a>
<FONT color="green">181</FONT>            {<a name="line.181"></a>
<FONT color="green">182</FONT>                    linksToPlanes.put(e, requiredPlane);<a name="line.182"></a>
<FONT color="green">183</FONT>            }<a name="line.183"></a>
<FONT color="green">184</FONT>            <a name="line.184"></a>
<FONT color="green">185</FONT>            private int getPlaneConstraint ( Edge e )<a name="line.185"></a>
<FONT color="green">186</FONT>            {<a name="line.186"></a>
<FONT color="green">187</FONT>                    Integer constr = linksToPlanes.get(e);<a name="line.187"></a>
<FONT color="green">188</FONT>                    if ( constr == null )<a name="line.188"></a>
<FONT color="green">189</FONT>                    {<a name="line.189"></a>
<FONT color="green">190</FONT>                            setPlaneConstraint(e,ANY_PLANE);<a name="line.190"></a>
<FONT color="green">191</FONT>                            return ANY_PLANE;<a name="line.191"></a>
<FONT color="green">192</FONT>                    }<a name="line.192"></a>
<FONT color="green">193</FONT>                    else return constr;<a name="line.193"></a>
<FONT color="green">194</FONT>            }<a name="line.194"></a>
<FONT color="green">195</FONT>            <a name="line.195"></a>
<FONT color="green">196</FONT>            private void propagatePlaneConstraint ( Edge e , int requiredPlane )<a name="line.196"></a>
<FONT color="green">197</FONT>            {<a name="line.197"></a>
<FONT color="green">198</FONT>                    setPlaneConstraint(e,requiredPlane);<a name="line.198"></a>
<FONT color="green">199</FONT>                    if ( requiredPlane == FIRST_PLANE || requiredPlane == SECOND_PLANE )<a name="line.199"></a>
<FONT color="green">200</FONT>                    {<a name="line.200"></a>
<FONT color="green">201</FONT>                            List&lt;Edge&gt; crossingEdges = getCrossingEdges(e);<a name="line.201"></a>
<FONT color="green">202</FONT>                            if ( crossingEdges != null )<a name="line.202"></a>
<FONT color="green">203</FONT>                            {<a name="line.203"></a>
<FONT color="green">204</FONT>                                    for (Iterator&lt;Edge&gt; iterator = crossingEdges.iterator(); iterator.hasNext();) <a name="line.204"></a>
<FONT color="green">205</FONT>                                    {<a name="line.205"></a>
<FONT color="green">206</FONT>                                            Edge crossingEdge = iterator.next();<a name="line.206"></a>
<FONT color="green">207</FONT>                                            assert ( requiredPlane == FIRST_PLANE || requiredPlane == SECOND_PLANE );<a name="line.207"></a>
<FONT color="green">208</FONT>                                            int crossingEdgeConstraint = getPlaneConstraint(crossingEdge);<a name="line.208"></a>
<FONT color="green">209</FONT>                                            if ( crossingEdgeConstraint == ANY_PLANE ) <a name="line.209"></a>
<FONT color="green">210</FONT>                                            { <a name="line.210"></a>
<FONT color="green">211</FONT>                                                    if ( requiredPlane == FIRST_PLANE )<a name="line.211"></a>
<FONT color="green">212</FONT>                                                            propagatePlaneConstraint(crossingEdge,SECOND_PLANE);<a name="line.212"></a>
<FONT color="green">213</FONT>                                                    else if ( requiredPlane == SECOND_PLANE )<a name="line.213"></a>
<FONT color="green">214</FONT>                                                            propagatePlaneConstraint(crossingEdge,FIRST_PLANE);<a name="line.214"></a>
<FONT color="green">215</FONT>                                            }<a name="line.215"></a>
<FONT color="green">216</FONT>                                            else if ( crossingEdgeConstraint == NO_PLANE ) ;                <a name="line.216"></a>
<FONT color="green">217</FONT>                                            else if ( crossingEdgeConstraint == FIRST_PLANE )<a name="line.217"></a>
<FONT color="green">218</FONT>                                            {<a name="line.218"></a>
<FONT color="green">219</FONT>                                                    if ( requiredPlane == FIRST_PLANE )<a name="line.219"></a>
<FONT color="green">220</FONT>                                                            propagatePlaneConstraint(crossingEdge,NO_PLANE);<a name="line.220"></a>
<FONT color="green">221</FONT>                                            }<a name="line.221"></a>
<FONT color="green">222</FONT>                                            else if ( crossingEdgeConstraint == SECOND_PLANE )<a name="line.222"></a>
<FONT color="green">223</FONT>                                            {<a name="line.223"></a>
<FONT color="green">224</FONT>                                                    if ( requiredPlane == SECOND_PLANE )<a name="line.224"></a>
<FONT color="green">225</FONT>                                                            propagatePlaneConstraint(crossingEdge,NO_PLANE);<a name="line.225"></a>
<FONT color="green">226</FONT>                                            }<a name="line.226"></a>
<FONT color="green">227</FONT>                                    }<a name="line.227"></a>
<FONT color="green">228</FONT>                            }<a name="line.228"></a>
<FONT color="green">229</FONT>                    }<a name="line.229"></a>
<FONT color="green">230</FONT>            }<a name="line.230"></a>
<FONT color="green">231</FONT>    <a name="line.231"></a>
<FONT color="green">232</FONT>            /**<a name="line.232"></a>
<FONT color="green">233</FONT>             * Decides in which plane link e should be created.<a name="line.233"></a>
<FONT color="green">234</FONT>             */<a name="line.234"></a>
<FONT color="green">235</FONT>            private int getLinkDecision ( Edge e , TwoPlanarConfig config )<a name="line.235"></a>
<FONT color="green">236</FONT>            {<a name="line.236"></a>
<FONT color="green">237</FONT>                    int constraint = getPlaneConstraint ( e );<a name="line.237"></a>
<FONT color="green">238</FONT>                    if ( constraint == ANY_PLANE )<a name="line.238"></a>
<FONT color="green">239</FONT>                    {<a name="line.239"></a>
<FONT color="green">240</FONT>                            //choose active plane<a name="line.240"></a>
<FONT color="green">241</FONT>                            if ( config.getStackActivityState() == TwoPlanarConfig.FIRST_STACK )<a name="line.241"></a>
<FONT color="green">242</FONT>                                    return FIRST_PLANE;<a name="line.242"></a>
<FONT color="green">243</FONT>                            else<a name="line.243"></a>
<FONT color="green">244</FONT>                                    return SECOND_PLANE;<a name="line.244"></a>
<FONT color="green">245</FONT>                    }<a name="line.245"></a>
<FONT color="green">246</FONT>                    else return constraint;<a name="line.246"></a>
<FONT color="green">247</FONT>            }<a name="line.247"></a>
<FONT color="green">248</FONT>            <a name="line.248"></a>
<FONT color="green">249</FONT>            <a name="line.249"></a>
<FONT color="green">250</FONT>            /**<a name="line.250"></a>
<FONT color="green">251</FONT>             * Gets the shortest pending link between (to or from) the input node and a node to the left of the top of the active stack,<a name="line.251"></a>
<FONT color="green">252</FONT>             * such that the link can be established on the active plane.<a name="line.252"></a>
<FONT color="green">253</FONT>             * @param config<a name="line.253"></a>
<FONT color="green">254</FONT>             * @return<a name="line.254"></a>
<FONT color="green">255</FONT>             */<a name="line.255"></a>
<FONT color="green">256</FONT>            private Edge getFirstPendingLinkOnActivePlane ( TwoPlanarConfig config , DependencyStructure gold ) throws MaltChainedException<a name="line.256"></a>
<FONT color="green">257</FONT>            {<a name="line.257"></a>
<FONT color="green">258</FONT>                    return getFirstPendingLinkOnPlane ( config , gold , config.getStackActivityState() == TwoPlanarConfig.FIRST_STACK ? FIRST_PLANE : SECOND_PLANE , <a name="line.258"></a>
<FONT color="green">259</FONT>                                    config.getActiveStack().peek().getIndex() );<a name="line.259"></a>
<FONT color="green">260</FONT>            }<a name="line.260"></a>
<FONT color="green">261</FONT>            <a name="line.261"></a>
<FONT color="green">262</FONT>            /**<a name="line.262"></a>
<FONT color="green">263</FONT>             * Gets the shortest pending link between (to or from) the input node and a node to the left of the top of the inactive stack, <a name="line.263"></a>
<FONT color="green">264</FONT>             * such that the link can be established on the inactive plane.<a name="line.264"></a>
<FONT color="green">265</FONT>             * @param config<a name="line.265"></a>
<FONT color="green">266</FONT>             * @return<a name="line.266"></a>
<FONT color="green">267</FONT>             */<a name="line.267"></a>
<FONT color="green">268</FONT>            private Edge getFirstPendingLinkOnInactivePlane ( TwoPlanarConfig config , DependencyStructure gold ) throws MaltChainedException<a name="line.268"></a>
<FONT color="green">269</FONT>            {<a name="line.269"></a>
<FONT color="green">270</FONT>                    return getFirstPendingLinkOnPlane ( config , gold , config.getStackActivityState() == TwoPlanarConfig.FIRST_STACK ? SECOND_PLANE : FIRST_PLANE ,<a name="line.270"></a>
<FONT color="green">271</FONT>                                    config.getInactiveStack().peek().getIndex() );<a name="line.271"></a>
<FONT color="green">272</FONT>            }<a name="line.272"></a>
<FONT color="green">273</FONT>            <a name="line.273"></a>
<FONT color="green">274</FONT>            private Edge getFirstPendingLinkOnAnyPlane ( TwoPlanarConfig config , DependencyStructure gold ) throws MaltChainedException<a name="line.274"></a>
<FONT color="green">275</FONT>            {<a name="line.275"></a>
<FONT color="green">276</FONT>                    Edge e1 = getFirstPendingLinkOnActivePlane ( config , gold );<a name="line.276"></a>
<FONT color="green">277</FONT>                    Edge e2 = getFirstPendingLinkOnInactivePlane ( config , gold );<a name="line.277"></a>
<FONT color="green">278</FONT>                    int left1 = Math.min(e1.getSource().getIndex(), e1.getTarget().getIndex());<a name="line.278"></a>
<FONT color="green">279</FONT>                    int left2 = Math.min(e2.getSource().getIndex(), e2.getTarget().getIndex());<a name="line.279"></a>
<FONT color="green">280</FONT>                    if ( left1 &gt; left2 ) return e1;<a name="line.280"></a>
<FONT color="green">281</FONT>                    else return e2;<a name="line.281"></a>
<FONT color="green">282</FONT>            }<a name="line.282"></a>
<FONT color="green">283</FONT>            <a name="line.283"></a>
<FONT color="green">284</FONT>            /**<a name="line.284"></a>
<FONT color="green">285</FONT>             * Gets the shortest pending link between (to or from) the input node and a node to the left of rightmostLimit, such that the link<a name="line.285"></a>
<FONT color="green">286</FONT>             * can be established on the given plane.<a name="line.286"></a>
<FONT color="green">287</FONT>             * @param config<a name="line.287"></a>
<FONT color="green">288</FONT>             * @param plane<a name="line.288"></a>
<FONT color="green">289</FONT>             * @param rightmostLimit<a name="line.289"></a>
<FONT color="green">290</FONT>             * @return<a name="line.290"></a>
<FONT color="green">291</FONT>             */<a name="line.291"></a>
<FONT color="green">292</FONT>            private Edge getFirstPendingLinkOnPlane ( TwoPlanarConfig config , DependencyStructure gold ,  int plane , int rightmostLimit )<a name="line.292"></a>
<FONT color="green">293</FONT>                    throws MaltChainedException<a name="line.293"></a>
<FONT color="green">294</FONT>            {<a name="line.294"></a>
<FONT color="green">295</FONT>                    TwoPlanarConfig planarConfig = (TwoPlanarConfig)config;<a name="line.295"></a>
<FONT color="green">296</FONT>                    //DependencyStructure dg = planarConfig.getDependencyGraph(); -&gt; no need, if rightmostLimit is well chosen, due to algorithm invariants<a name="line.296"></a>
<FONT color="green">297</FONT>                    int inputPeekIndex = planarConfig.getInput().peek().getIndex();<a name="line.297"></a>
<FONT color="green">298</FONT>                    <a name="line.298"></a>
<FONT color="green">299</FONT>                    Edge current = null;<a name="line.299"></a>
<FONT color="green">300</FONT>                    int maxIndex;<a name="line.300"></a>
<FONT color="green">301</FONT>                    if ( planarConfig.getRootHandling() == TwoPlanarConfig.NORMAL )<a name="line.301"></a>
<FONT color="green">302</FONT>                            maxIndex = -1; //count links from dummy root<a name="line.302"></a>
<FONT color="green">303</FONT>                    else<a name="line.303"></a>
<FONT color="green">304</FONT>                            maxIndex = 0; //do not count links from dummy root<a name="line.304"></a>
<FONT color="green">305</FONT>                    <a name="line.305"></a>
<FONT color="green">306</FONT>                    if ( gold.getTokenNode(inputPeekIndex).hasLeftDependent() &amp;&amp; <a name="line.306"></a>
<FONT color="green">307</FONT>                                    gold.getTokenNode(inputPeekIndex).getLeftmostDependent().getIndex() &lt; rightmostLimit)<a name="line.307"></a>
<FONT color="green">308</FONT>                    {<a name="line.308"></a>
<FONT color="green">309</FONT>                            SortedSet&lt;DependencyNode&gt; dependents = gold.getTokenNode(inputPeekIndex).getLeftDependents();<a name="line.309"></a>
<FONT color="green">310</FONT>                            for (Iterator&lt;DependencyNode&gt; iterator = dependents.iterator(); iterator.hasNext();) {<a name="line.310"></a>
<FONT color="green">311</FONT>                                    DependencyNode dependent = (DependencyNode) iterator.next();<a name="line.311"></a>
<FONT color="green">312</FONT>                                    if ( dependent.getIndex() &gt; maxIndex &amp;&amp; dependent.getIndex() &lt; rightmostLimit <a name="line.312"></a>
<FONT color="green">313</FONT>                                                    &amp;&amp; getLinkDecision(dependent.getHeadEdge(),config) == plane )<a name="line.313"></a>
<FONT color="green">314</FONT>                                    {<a name="line.314"></a>
<FONT color="green">315</FONT>                                            maxIndex = dependent.getIndex();<a name="line.315"></a>
<FONT color="green">316</FONT>                                            current = dependent.getHeadEdge();<a name="line.316"></a>
<FONT color="green">317</FONT>                                    }<a name="line.317"></a>
<FONT color="green">318</FONT>                            }<a name="line.318"></a>
<FONT color="green">319</FONT>                    }<a name="line.319"></a>
<FONT color="green">320</FONT>                    <a name="line.320"></a>
<FONT color="green">321</FONT>                    //at this point, current is the first left-pointing link, but we have to check right-pointing link as well<a name="line.321"></a>
<FONT color="green">322</FONT>                    <a name="line.322"></a>
<FONT color="green">323</FONT>                    //System.out.println("in" + inputPeekIndex + " rl" + rightmostLimit);<a name="line.323"></a>
<FONT color="green">324</FONT>                    if ( gold.getTokenNode(inputPeekIndex).getHead().getIndex() &lt; rightmostLimit )<a name="line.324"></a>
<FONT color="green">325</FONT>                    {<a name="line.325"></a>
<FONT color="green">326</FONT>                            //System.out.println(":");<a name="line.326"></a>
<FONT color="green">327</FONT>                            if ( gold.getTokenNode(inputPeekIndex).getHead().getIndex() &gt; maxIndex &amp;&amp; <a name="line.327"></a>
<FONT color="green">328</FONT>                                            getLinkDecision(gold.getTokenNode(inputPeekIndex).getHeadEdge(),config) == plane )<a name="line.328"></a>
<FONT color="green">329</FONT>                            {<a name="line.329"></a>
<FONT color="green">330</FONT>                                    //System.out.println("::");<a name="line.330"></a>
<FONT color="green">331</FONT>                                    current = gold.getTokenNode(inputPeekIndex).getHeadEdge();<a name="line.331"></a>
<FONT color="green">332</FONT>                            }<a name="line.332"></a>
<FONT color="green">333</FONT>                    }<a name="line.333"></a>
<FONT color="green">334</FONT>                    <a name="line.334"></a>
<FONT color="green">335</FONT>                    return current;<a name="line.335"></a>
<FONT color="green">336</FONT>                    <a name="line.336"></a>
<FONT color="green">337</FONT>                    <a name="line.337"></a>
<FONT color="green">338</FONT>            }<a name="line.338"></a>
<FONT color="green">339</FONT>            <a name="line.339"></a>
<FONT color="green">340</FONT>    <a name="line.340"></a>
<FONT color="green">341</FONT>    }<a name="line.341"></a>




























































</PRE>
</BODY>
</HTML>