<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT> package org.maltparser.core.syntaxgraph.node;<a name="line.1"></a>
<FONT color="green">002</FONT> <a name="line.2"></a>
<FONT color="green">003</FONT> import java.util.SortedSet;<a name="line.3"></a>
<FONT color="green">004</FONT> <a name="line.4"></a>
<FONT color="green">005</FONT> import org.maltparser.core.exception.MaltChainedException;<a name="line.5"></a>
<FONT color="green">006</FONT> import org.maltparser.core.syntaxgraph.Element;<a name="line.6"></a>
<FONT color="green">007</FONT> import org.maltparser.core.syntaxgraph.edge.Edge;<a name="line.7"></a>
<FONT color="green">008</FONT> <a name="line.8"></a>
<FONT color="green">009</FONT> public interface ComparableNode extends Element, Comparable<ComparableNode> {<a name="line.9"></a>
<FONT color="green">010</FONT> /**<a name="line.10"></a>
<FONT color="green">011</FONT> * Returns the index of the node.<a name="line.11"></a>
<FONT color="green">012</FONT> * <a name="line.12"></a>
<FONT color="green">013</FONT> * @return the index of the node.<a name="line.13"></a>
<FONT color="green">014</FONT> */<a name="line.14"></a>
<FONT color="green">015</FONT> public int getIndex();<a name="line.15"></a>
<FONT color="green">016</FONT> /**<a name="line.16"></a>
<FONT color="green">017</FONT> * Returns the index of the node (only used internal by compareTo).<a name="line.17"></a>
<FONT color="green">018</FONT> * <a name="line.18"></a>
<FONT color="green">019</FONT> * @return the index of the node (only used internal by compareTo).<a name="line.19"></a>
<FONT color="green">020</FONT> */<a name="line.20"></a>
<FONT color="green">021</FONT> public int getCompareToIndex();<a name="line.21"></a>
<FONT color="green">022</FONT> /**<a name="line.22"></a>
<FONT color="green">023</FONT> * Returns <i>true</i> if the node is a root node, otherwise <i>false</i>.<a name="line.23"></a>
<FONT color="green">024</FONT> * <a name="line.24"></a>
<FONT color="green">025</FONT> * @return <i>true</i> if the node is a root node, otherwise <i>false</i>.<a name="line.25"></a>
<FONT color="green">026</FONT> */<a name="line.26"></a>
<FONT color="green">027</FONT> public boolean isRoot();<a name="line.27"></a>
<FONT color="green">028</FONT> /**<a name="line.28"></a>
<FONT color="green">029</FONT> * Returns the left-most proper terminal descendant node (excluding itself). <a name="line.29"></a>
<FONT color="green">030</FONT> * <a name="line.30"></a>
<FONT color="green">031</FONT> * @return the left-most proper terminal descendant node. <a name="line.31"></a>
<FONT color="green">032</FONT> * @throws MaltChainedException<a name="line.32"></a>
<FONT color="green">033</FONT> */<a name="line.33"></a>
<FONT color="green">034</FONT> public ComparableNode getLeftmostProperDescendant() throws MaltChainedException;<a name="line.34"></a>
<FONT color="green">035</FONT> /**<a name="line.35"></a>
<FONT color="green">036</FONT> * Returns the right-most proper terminal descendant node (excluding itself). <a name="line.36"></a>
<FONT color="green">037</FONT> * <a name="line.37"></a>
<FONT color="green">038</FONT> * @return the right-most proper terminal descendant node. <a name="line.38"></a>
<FONT color="green">039</FONT> * @throws MaltChainedException<a name="line.39"></a>
<FONT color="green">040</FONT> */<a name="line.40"></a>
<FONT color="green">041</FONT> public ComparableNode getRightmostProperDescendant() throws MaltChainedException;<a name="line.41"></a>
<FONT color="green">042</FONT> /**<a name="line.42"></a>
<FONT color="green">043</FONT> * Returns the index of the left-most proper terminal descendant node (excluding itself). <a name="line.43"></a>
<FONT color="green">044</FONT> * <a name="line.44"></a>
<FONT color="green">045</FONT> * @return the index of the left-most proper terminal descendant node. <a name="line.45"></a>
<FONT color="green">046</FONT> * @throws MaltChainedException<a name="line.46"></a>
<FONT color="green">047</FONT> */<a name="line.47"></a>
<FONT color="green">048</FONT> public int getLeftmostProperDescendantIndex() throws MaltChainedException;<a name="line.48"></a>
<FONT color="green">049</FONT> /**<a name="line.49"></a>
<FONT color="green">050</FONT> * Returns the index of the right-most proper terminal descendant node (excluding itself). <a name="line.50"></a>
<FONT color="green">051</FONT> * <a name="line.51"></a>
<FONT color="green">052</FONT> * @return the index of the right-most proper terminal descendant node. <a name="line.52"></a>
<FONT color="green">053</FONT> * @throws MaltChainedException<a name="line.53"></a>
<FONT color="green">054</FONT> */<a name="line.54"></a>
<FONT color="green">055</FONT> public int getRightmostProperDescendantIndex() throws MaltChainedException;<a name="line.55"></a>
<FONT color="green">056</FONT> /**<a name="line.56"></a>
<FONT color="green">057</FONT> * Returns the left-most terminal descendant node. <a name="line.57"></a>
<FONT color="green">058</FONT> * <a name="line.58"></a>
<FONT color="green">059</FONT> * @return the left-most terminal descendant node. <a name="line.59"></a>
<FONT color="green">060</FONT> * @throws MaltChainedException<a name="line.60"></a>
<FONT color="green">061</FONT> */<a name="line.61"></a>
<FONT color="green">062</FONT> public ComparableNode getLeftmostDescendant() throws MaltChainedException;<a name="line.62"></a>
<FONT color="green">063</FONT> /**<a name="line.63"></a>
<FONT color="green">064</FONT> * Returns the right-most terminal descendant node. <a name="line.64"></a>
<FONT color="green">065</FONT> * <a name="line.65"></a>
<FONT color="green">066</FONT> * @return the right-most terminal descendant node. <a name="line.66"></a>
<FONT color="green">067</FONT> * @throws MaltChainedException<a name="line.67"></a>
<FONT color="green">068</FONT> */<a name="line.68"></a>
<FONT color="green">069</FONT> public ComparableNode getRightmostDescendant() throws MaltChainedException;<a name="line.69"></a>
<FONT color="green">070</FONT> /**<a name="line.70"></a>
<FONT color="green">071</FONT> * Returns the index of the left-most terminal descendant node. <a name="line.71"></a>
<FONT color="green">072</FONT> * <a name="line.72"></a>
<FONT color="green">073</FONT> * @return the index of the left-most terminal descendant node. <a name="line.73"></a>
<FONT color="green">074</FONT> * @throws MaltChainedException<a name="line.74"></a>
<FONT color="green">075</FONT> */<a name="line.75"></a>
<FONT color="green">076</FONT> public int getLeftmostDescendantIndex() throws MaltChainedException;<a name="line.76"></a>
<FONT color="green">077</FONT> /**<a name="line.77"></a>
<FONT color="green">078</FONT> * Returns the index of the right-most terminal descendant node. <a name="line.78"></a>
<FONT color="green">079</FONT> * <a name="line.79"></a>
<FONT color="green">080</FONT> * @return the index of the right-most terminal descendant node. <a name="line.80"></a>
<FONT color="green">081</FONT> * @throws MaltChainedException<a name="line.81"></a>
<FONT color="green">082</FONT> */<a name="line.82"></a>
<FONT color="green">083</FONT> public int getRightmostDescendantIndex() throws MaltChainedException;<a name="line.83"></a>
<FONT color="green">084</FONT> /**<a name="line.84"></a>
<FONT color="green">085</FONT> * Returns the in degree of the node (number of incoming edges of all types of edges).<a name="line.85"></a>
<FONT color="green">086</FONT> * <a name="line.86"></a>
<FONT color="green">087</FONT> * @return the in degree of the node (number of incoming edges of all types of edges).<a name="line.87"></a>
<FONT color="green">088</FONT> */<a name="line.88"></a>
<FONT color="green">089</FONT> public int getInDegree();<a name="line.89"></a>
<FONT color="green">090</FONT> /**<a name="line.90"></a>
<FONT color="green">091</FONT> * Returns the out degree of the node (number of outgoing edges of all types of edges).<a name="line.91"></a>
<FONT color="green">092</FONT> * <a name="line.92"></a>
<FONT color="green">093</FONT> * @return the out degree of the node (number of outgoing edges of all types of edges).<a name="line.93"></a>
<FONT color="green">094</FONT> */<a name="line.94"></a>
<FONT color="green">095</FONT> public int getOutDegree();<a name="line.95"></a>
<FONT color="green">096</FONT> /**<a name="line.96"></a>
<FONT color="green">097</FONT> * Returns a sorted set of incoming secondary edges.<a name="line.97"></a>
<FONT color="green">098</FONT> * <a name="line.98"></a>
<FONT color="green">099</FONT> * @return a sorted set of incoming secondary edges.<a name="line.99"></a>
<FONT color="green">100</FONT> */<a name="line.100"></a>
<FONT color="green">101</FONT> public SortedSet<Edge> getIncomingSecondaryEdges();<a name="line.101"></a>
<FONT color="green">102</FONT> /**<a name="line.102"></a>
<FONT color="green">103</FONT> * Returns a sorted set of outgoing secondary edges.<a name="line.103"></a>
<FONT color="green">104</FONT> * <a name="line.104"></a>
<FONT color="green">105</FONT> * @return a sorted set of outgoing secondary edges.<a name="line.105"></a>
<FONT color="green">106</FONT> */<a name="line.106"></a>
<FONT color="green">107</FONT> public SortedSet<Edge> getOutgoingSecondaryEdges();<a name="line.107"></a>
<FONT color="green">108</FONT> }<a name="line.108"></a>
</PRE>
</BODY>
</HTML>