Google Git
Sign in
apache / hbase-site / dc97eead565e541d38e7e85d1ba797b56b79bbf5 / . / testdevapidocs / src-html / org / apache / hadoop / hbase / util / TestAvlUtil.TestAvlKeyComparator.html
blob: 582676a7fbb7effb0f77a193d4a440d1d95b4b8d [file] [log] [blame]
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a>
<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a>
<span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a>
<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a>
<span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a>
<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a>
<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a>
<span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a>
<span class="sourceLineNo">009</span> *<a name="line.9"></a>
<span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
<span class="sourceLineNo">011</span> *<a name="line.11"></a>
<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a>
<span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a>
<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a>
<span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a>
<span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a>
<span class="sourceLineNo">017</span> */<a name="line.17"></a>
<span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.util;<a name="line.18"></a>
<span class="sourceLineNo">019</span><a name="line.19"></a>
<span class="sourceLineNo">020</span>import static org.junit.Assert.assertEquals;<a name="line.20"></a>
<span class="sourceLineNo">021</span>import static org.junit.Assert.assertFalse;<a name="line.21"></a>
<span class="sourceLineNo">022</span>import static org.junit.Assert.assertNotNull;<a name="line.22"></a>
<span class="sourceLineNo">023</span>import static org.junit.Assert.assertTrue;<a name="line.23"></a>
<span class="sourceLineNo">024</span><a name="line.24"></a>
<span class="sourceLineNo">025</span>import java.util.Random;<a name="line.25"></a>
<span class="sourceLineNo">026</span>import java.util.TreeMap;<a name="line.26"></a>
<span class="sourceLineNo">027</span>import org.apache.hadoop.hbase.HBaseClassTestRule;<a name="line.27"></a>
<span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.testclassification.MiscTests;<a name="line.28"></a>
<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.testclassification.SmallTests;<a name="line.29"></a>
<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.util.AvlUtil.AvlIterableList;<a name="line.30"></a>
<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.util.AvlUtil.AvlKeyComparator;<a name="line.31"></a>
<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.util.AvlUtil.AvlLinkedNode;<a name="line.32"></a>
<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.util.AvlUtil.AvlNode;<a name="line.33"></a>
<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.util.AvlUtil.AvlNodeVisitor;<a name="line.34"></a>
<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.util.AvlUtil.AvlTree;<a name="line.35"></a>
<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.util.AvlUtil.AvlTreeIterator;<a name="line.36"></a>
<span class="sourceLineNo">037</span>import org.junit.ClassRule;<a name="line.37"></a>
<span class="sourceLineNo">038</span>import org.junit.Test;<a name="line.38"></a>
<span class="sourceLineNo">039</span>import org.junit.experimental.categories.Category;<a name="line.39"></a>
<span class="sourceLineNo">040</span><a name="line.40"></a>
<span class="sourceLineNo">041</span>@Category({MiscTests.class, SmallTests.class})<a name="line.41"></a>
<span class="sourceLineNo">042</span>public class TestAvlUtil {<a name="line.42"></a>
<span class="sourceLineNo">043</span><a name="line.43"></a>
<span class="sourceLineNo">044</span> @ClassRule<a name="line.44"></a>
<span class="sourceLineNo">045</span> public static final HBaseClassTestRule CLASS_RULE =<a name="line.45"></a>
<span class="sourceLineNo">046</span> HBaseClassTestRule.forClass(TestAvlUtil.class);<a name="line.46"></a>
<span class="sourceLineNo">047</span><a name="line.47"></a>
<span class="sourceLineNo">048</span> private static final TestAvlKeyComparator KEY_COMPARATOR = new TestAvlKeyComparator();<a name="line.48"></a>
<span class="sourceLineNo">049</span><a name="line.49"></a>
<span class="sourceLineNo">050</span> @Test<a name="line.50"></a>
<span class="sourceLineNo">051</span> public void testAvlTreeCrud() {<a name="line.51"></a>
<span class="sourceLineNo">052</span> final int MAX_KEY = 99999999;<a name="line.52"></a>
<span class="sourceLineNo">053</span> final int NELEM = 10000;<a name="line.53"></a>
<span class="sourceLineNo">054</span><a name="line.54"></a>
<span class="sourceLineNo">055</span> final TreeMap&lt;Integer, Object&gt; treeMap = new TreeMap&lt;&gt;();<a name="line.55"></a>
<span class="sourceLineNo">056</span> TestAvlNode root = null;<a name="line.56"></a>
<span class="sourceLineNo">057</span><a name="line.57"></a>
<span class="sourceLineNo">058</span> final Random rand = new Random();<a name="line.58"></a>
<span class="sourceLineNo">059</span> for (int i = 0; i &lt; NELEM; ++i) {<a name="line.59"></a>
<span class="sourceLineNo">060</span> int key = rand.nextInt(MAX_KEY);<a name="line.60"></a>
<span class="sourceLineNo">061</span> if (AvlTree.get(root, key, KEY_COMPARATOR) != null) {<a name="line.61"></a>
<span class="sourceLineNo">062</span> i--;<a name="line.62"></a>
<span class="sourceLineNo">063</span> continue;<a name="line.63"></a>
<span class="sourceLineNo">064</span> }<a name="line.64"></a>
<span class="sourceLineNo">065</span> root = AvlTree.insert(root, new TestAvlNode(key));<a name="line.65"></a>
<span class="sourceLineNo">066</span> treeMap.put(key, null);<a name="line.66"></a>
<span class="sourceLineNo">067</span> for (Integer keyX: treeMap.keySet()) {<a name="line.67"></a>
<span class="sourceLineNo">068</span> TestAvlNode node = AvlTree.get(root, keyX, KEY_COMPARATOR);<a name="line.68"></a>
<span class="sourceLineNo">069</span> assertNotNull(node);<a name="line.69"></a>
<span class="sourceLineNo">070</span> assertEquals(keyX.intValue(), node.getKey());<a name="line.70"></a>
<span class="sourceLineNo">071</span> }<a name="line.71"></a>
<span class="sourceLineNo">072</span> }<a name="line.72"></a>
<span class="sourceLineNo">073</span><a name="line.73"></a>
<span class="sourceLineNo">074</span> for (int i = 0; i &lt; NELEM; ++i) {<a name="line.74"></a>
<span class="sourceLineNo">075</span> int key = rand.nextInt(MAX_KEY);<a name="line.75"></a>
<span class="sourceLineNo">076</span> TestAvlNode node = AvlTree.get(root, key, KEY_COMPARATOR);<a name="line.76"></a>
<span class="sourceLineNo">077</span> if (!treeMap.containsKey(key)) {<a name="line.77"></a>
<span class="sourceLineNo">078</span> assert node == null;<a name="line.78"></a>
<span class="sourceLineNo">079</span> continue;<a name="line.79"></a>
<span class="sourceLineNo">080</span> }<a name="line.80"></a>
<span class="sourceLineNo">081</span> treeMap.remove(key);<a name="line.81"></a>
<span class="sourceLineNo">082</span> assertEquals(key, node.getKey());<a name="line.82"></a>
<span class="sourceLineNo">083</span> root = AvlTree.remove(root, key, KEY_COMPARATOR);<a name="line.83"></a>
<span class="sourceLineNo">084</span> for (Integer keyX: treeMap.keySet()) {<a name="line.84"></a>
<span class="sourceLineNo">085</span> node = AvlTree.get(root, keyX, KEY_COMPARATOR);<a name="line.85"></a>
<span class="sourceLineNo">086</span> assertNotNull(node);<a name="line.86"></a>
<span class="sourceLineNo">087</span> assertEquals(keyX.intValue(), node.getKey());<a name="line.87"></a>
<span class="sourceLineNo">088</span> }<a name="line.88"></a>
<span class="sourceLineNo">089</span> }<a name="line.89"></a>
<span class="sourceLineNo">090</span> }<a name="line.90"></a>
<span class="sourceLineNo">091</span><a name="line.91"></a>
<span class="sourceLineNo">092</span> @Test<a name="line.92"></a>
<span class="sourceLineNo">093</span> public void testAvlTreeVisitor() {<a name="line.93"></a>
<span class="sourceLineNo">094</span> final int MIN_KEY = 0;<a name="line.94"></a>
<span class="sourceLineNo">095</span> final int MAX_KEY = 50;<a name="line.95"></a>
<span class="sourceLineNo">096</span><a name="line.96"></a>
<span class="sourceLineNo">097</span> TestAvlNode root = null;<a name="line.97"></a>
<span class="sourceLineNo">098</span> for (int i = MAX_KEY; i &gt;= MIN_KEY; --i) {<a name="line.98"></a>
<span class="sourceLineNo">099</span> root = AvlTree.insert(root, new TestAvlNode(i));<a name="line.99"></a>
<span class="sourceLineNo">100</span> }<a name="line.100"></a>
<span class="sourceLineNo">101</span><a name="line.101"></a>
<span class="sourceLineNo">102</span> AvlTree.visit(root, new AvlNodeVisitor&lt;TestAvlNode&gt;() {<a name="line.102"></a>
<span class="sourceLineNo">103</span> private int prevKey = -1;<a name="line.103"></a>
<span class="sourceLineNo">104</span> @Override<a name="line.104"></a>
<span class="sourceLineNo">105</span> public boolean visitNode(TestAvlNode node) {<a name="line.105"></a>
<span class="sourceLineNo">106</span> assertEquals(prevKey, node.getKey() - 1);<a name="line.106"></a>
<span class="sourceLineNo">107</span> assertTrue(node.getKey() &gt;= MIN_KEY);<a name="line.107"></a>
<span class="sourceLineNo">108</span> assertTrue(node.getKey() &lt;= MAX_KEY);<a name="line.108"></a>
<span class="sourceLineNo">109</span> prevKey = node.getKey();<a name="line.109"></a>
<span class="sourceLineNo">110</span> return node.getKey() &lt;= MAX_KEY;<a name="line.110"></a>
<span class="sourceLineNo">111</span> }<a name="line.111"></a>
<span class="sourceLineNo">112</span> });<a name="line.112"></a>
<span class="sourceLineNo">113</span> }<a name="line.113"></a>
<span class="sourceLineNo">114</span><a name="line.114"></a>
<span class="sourceLineNo">115</span> @Test<a name="line.115"></a>
<span class="sourceLineNo">116</span> public void testAvlTreeIterSeekFirst() {<a name="line.116"></a>
<span class="sourceLineNo">117</span> final int MIN_KEY = 1;<a name="line.117"></a>
<span class="sourceLineNo">118</span> final int MAX_KEY = 50;<a name="line.118"></a>
<span class="sourceLineNo">119</span><a name="line.119"></a>
<span class="sourceLineNo">120</span> TestAvlNode root = null;<a name="line.120"></a>
<span class="sourceLineNo">121</span> for (int i = MIN_KEY; i &lt; MAX_KEY; ++i) {<a name="line.121"></a>
<span class="sourceLineNo">122</span> root = AvlTree.insert(root, new TestAvlNode(i));<a name="line.122"></a>
<span class="sourceLineNo">123</span> }<a name="line.123"></a>
<span class="sourceLineNo">124</span><a name="line.124"></a>
<span class="sourceLineNo">125</span> AvlTreeIterator&lt;TestAvlNode&gt; iter = new AvlTreeIterator&lt;&gt;(root);<a name="line.125"></a>
<span class="sourceLineNo">126</span> assertTrue(iter.hasNext());<a name="line.126"></a>
<span class="sourceLineNo">127</span> long prevKey = 0;<a name="line.127"></a>
<span class="sourceLineNo">128</span> while (iter.hasNext()) {<a name="line.128"></a>
<span class="sourceLineNo">129</span> TestAvlNode node = iter.next();<a name="line.129"></a>
<span class="sourceLineNo">130</span> assertEquals(prevKey + 1, node.getKey());<a name="line.130"></a>
<span class="sourceLineNo">131</span> prevKey = node.getKey();<a name="line.131"></a>
<span class="sourceLineNo">132</span> }<a name="line.132"></a>
<span class="sourceLineNo">133</span> assertEquals(MAX_KEY - 1, prevKey);<a name="line.133"></a>
<span class="sourceLineNo">134</span> }<a name="line.134"></a>
<span class="sourceLineNo">135</span><a name="line.135"></a>
<span class="sourceLineNo">136</span> @Test<a name="line.136"></a>
<span class="sourceLineNo">137</span> public void testAvlTreeIterSeekTo() {<a name="line.137"></a>
<span class="sourceLineNo">138</span> final int MIN_KEY = 1;<a name="line.138"></a>
<span class="sourceLineNo">139</span> final int MAX_KEY = 50;<a name="line.139"></a>
<span class="sourceLineNo">140</span><a name="line.140"></a>
<span class="sourceLineNo">141</span> TestAvlNode root = null;<a name="line.141"></a>
<span class="sourceLineNo">142</span> for (int i = MIN_KEY; i &lt; MAX_KEY; i += 2) {<a name="line.142"></a>
<span class="sourceLineNo">143</span> root = AvlTree.insert(root, new TestAvlNode(i));<a name="line.143"></a>
<span class="sourceLineNo">144</span> }<a name="line.144"></a>
<span class="sourceLineNo">145</span><a name="line.145"></a>
<span class="sourceLineNo">146</span> for (int i = MIN_KEY - 1; i &lt; MAX_KEY + 1; ++i) {<a name="line.146"></a>
<span class="sourceLineNo">147</span> AvlTreeIterator&lt;TestAvlNode&gt; iter = new AvlTreeIterator&lt;&gt;(root, i, KEY_COMPARATOR);<a name="line.147"></a>
<span class="sourceLineNo">148</span> if (i &lt; MAX_KEY) {<a name="line.148"></a>
<span class="sourceLineNo">149</span> assertTrue(iter.hasNext());<a name="line.149"></a>
<span class="sourceLineNo">150</span> } else {<a name="line.150"></a>
<span class="sourceLineNo">151</span> // searching for something greater than the last node<a name="line.151"></a>
<span class="sourceLineNo">152</span> assertFalse(iter.hasNext());<a name="line.152"></a>
<span class="sourceLineNo">153</span> break;<a name="line.153"></a>
<span class="sourceLineNo">154</span> }<a name="line.154"></a>
<span class="sourceLineNo">155</span><a name="line.155"></a>
<span class="sourceLineNo">156</span> TestAvlNode node = iter.next();<a name="line.156"></a>
<span class="sourceLineNo">157</span> assertEquals((i % 2 == 0) ? i + 1 : i, node.getKey());<a name="line.157"></a>
<span class="sourceLineNo">158</span><a name="line.158"></a>
<span class="sourceLineNo">159</span> long prevKey = node.getKey();<a name="line.159"></a>
<span class="sourceLineNo">160</span> while (iter.hasNext()) {<a name="line.160"></a>
<span class="sourceLineNo">161</span> node = iter.next();<a name="line.161"></a>
<span class="sourceLineNo">162</span> assertTrue(node.getKey() &gt; prevKey);<a name="line.162"></a>
<span class="sourceLineNo">163</span> prevKey = node.getKey();<a name="line.163"></a>
<span class="sourceLineNo">164</span> }<a name="line.164"></a>
<span class="sourceLineNo">165</span> }<a name="line.165"></a>
<span class="sourceLineNo">166</span> }<a name="line.166"></a>
<span class="sourceLineNo">167</span><a name="line.167"></a>
<span class="sourceLineNo">168</span> @Test<a name="line.168"></a>
<span class="sourceLineNo">169</span> public void testAvlIterableListCrud() {<a name="line.169"></a>
<span class="sourceLineNo">170</span> final int NITEMS = 10;<a name="line.170"></a>
<span class="sourceLineNo">171</span> TestLinkedAvlNode prependHead = null;<a name="line.171"></a>
<span class="sourceLineNo">172</span> TestLinkedAvlNode appendHead = null;<a name="line.172"></a>
<span class="sourceLineNo">173</span> // prepend()/append()<a name="line.173"></a>
<span class="sourceLineNo">174</span> for (int i = 0; i &lt;= NITEMS; ++i) {<a name="line.174"></a>
<span class="sourceLineNo">175</span> TestLinkedAvlNode pNode = new TestLinkedAvlNode(i);<a name="line.175"></a>
<span class="sourceLineNo">176</span> assertFalse(AvlIterableList.isLinked(pNode));<a name="line.176"></a>
<span class="sourceLineNo">177</span> prependHead = AvlIterableList.prepend(prependHead, pNode);<a name="line.177"></a>
<span class="sourceLineNo">178</span> assertTrue(AvlIterableList.isLinked(pNode));<a name="line.178"></a>
<span class="sourceLineNo">179</span><a name="line.179"></a>
<span class="sourceLineNo">180</span> TestLinkedAvlNode aNode = new TestLinkedAvlNode(i);<a name="line.180"></a>
<span class="sourceLineNo">181</span> assertFalse(AvlIterableList.isLinked(aNode));<a name="line.181"></a>
<span class="sourceLineNo">182</span> appendHead = AvlIterableList.append(appendHead, aNode);<a name="line.182"></a>
<span class="sourceLineNo">183</span> assertTrue(AvlIterableList.isLinked(aNode));<a name="line.183"></a>
<span class="sourceLineNo">184</span> }<a name="line.184"></a>
<span class="sourceLineNo">185</span> // readNext()<a name="line.185"></a>
<span class="sourceLineNo">186</span> TestLinkedAvlNode pNode = prependHead;<a name="line.186"></a>
<span class="sourceLineNo">187</span> TestLinkedAvlNode aNode = appendHead;<a name="line.187"></a>
<span class="sourceLineNo">188</span> for (int i = 0; i &lt;= NITEMS; ++i) {<a name="line.188"></a>
<span class="sourceLineNo">189</span> assertEquals(NITEMS - i, pNode.getKey());<a name="line.189"></a>
<span class="sourceLineNo">190</span> pNode = AvlIterableList.readNext(pNode);<a name="line.190"></a>
<span class="sourceLineNo">191</span><a name="line.191"></a>
<span class="sourceLineNo">192</span> assertEquals(i, aNode.getKey());<a name="line.192"></a>
<span class="sourceLineNo">193</span> aNode = AvlIterableList.readNext(aNode);<a name="line.193"></a>
<span class="sourceLineNo">194</span> }<a name="line.194"></a>
<span class="sourceLineNo">195</span> // readPrev()<a name="line.195"></a>
<span class="sourceLineNo">196</span> pNode = AvlIterableList.readPrev(prependHead);<a name="line.196"></a>
<span class="sourceLineNo">197</span> aNode = AvlIterableList.readPrev(appendHead);<a name="line.197"></a>
<span class="sourceLineNo">198</span> for (int i = 0; i &lt;= NITEMS; ++i) {<a name="line.198"></a>
<span class="sourceLineNo">199</span> assertEquals(i, pNode.getKey());<a name="line.199"></a>
<span class="sourceLineNo">200</span> pNode = AvlIterableList.readPrev(pNode);<a name="line.200"></a>
<span class="sourceLineNo">201</span><a name="line.201"></a>
<span class="sourceLineNo">202</span> assertEquals(NITEMS - i, aNode.getKey());<a name="line.202"></a>
<span class="sourceLineNo">203</span> aNode = AvlIterableList.readPrev(aNode);<a name="line.203"></a>
<span class="sourceLineNo">204</span> }<a name="line.204"></a>
<span class="sourceLineNo">205</span> // appendList()<a name="line.205"></a>
<span class="sourceLineNo">206</span> TestLinkedAvlNode node = AvlIterableList.appendList(prependHead, appendHead);<a name="line.206"></a>
<span class="sourceLineNo">207</span> for (int i = NITEMS; i &gt;= 0; --i) {<a name="line.207"></a>
<span class="sourceLineNo">208</span> assertEquals(i, node.getKey());<a name="line.208"></a>
<span class="sourceLineNo">209</span> node = AvlIterableList.readNext(node);<a name="line.209"></a>
<span class="sourceLineNo">210</span> }<a name="line.210"></a>
<span class="sourceLineNo">211</span> for (int i = 0; i &lt;= NITEMS; ++i) {<a name="line.211"></a>
<span class="sourceLineNo">212</span> assertEquals(i, node.getKey());<a name="line.212"></a>
<span class="sourceLineNo">213</span> node = AvlIterableList.readNext(node);<a name="line.213"></a>
<span class="sourceLineNo">214</span> }<a name="line.214"></a>
<span class="sourceLineNo">215</span> }<a name="line.215"></a>
<span class="sourceLineNo">216</span><a name="line.216"></a>
<span class="sourceLineNo">217</span> private static class TestAvlNode extends AvlNode&lt;TestAvlNode&gt; {<a name="line.217"></a>
<span class="sourceLineNo">218</span> private final int key;<a name="line.218"></a>
<span class="sourceLineNo">219</span><a name="line.219"></a>
<span class="sourceLineNo">220</span> public TestAvlNode(int key) {<a name="line.220"></a>
<span class="sourceLineNo">221</span> this.key = key;<a name="line.221"></a>
<span class="sourceLineNo">222</span> }<a name="line.222"></a>
<span class="sourceLineNo">223</span><a name="line.223"></a>
<span class="sourceLineNo">224</span> public int getKey() {<a name="line.224"></a>
<span class="sourceLineNo">225</span> return key;<a name="line.225"></a>
<span class="sourceLineNo">226</span> }<a name="line.226"></a>
<span class="sourceLineNo">227</span><a name="line.227"></a>
<span class="sourceLineNo">228</span> @Override<a name="line.228"></a>
<span class="sourceLineNo">229</span> public int compareTo(TestAvlNode other) {<a name="line.229"></a>
<span class="sourceLineNo">230</span> return this.key - other.key;<a name="line.230"></a>
<span class="sourceLineNo">231</span> }<a name="line.231"></a>
<span class="sourceLineNo">232</span><a name="line.232"></a>
<span class="sourceLineNo">233</span> @Override<a name="line.233"></a>
<span class="sourceLineNo">234</span> public String toString() {<a name="line.234"></a>
<span class="sourceLineNo">235</span> return String.format("TestAvlNode(%d)", key);<a name="line.235"></a>
<span class="sourceLineNo">236</span> }<a name="line.236"></a>
<span class="sourceLineNo">237</span> }<a name="line.237"></a>
<span class="sourceLineNo">238</span><a name="line.238"></a>
<span class="sourceLineNo">239</span> private static class TestLinkedAvlNode extends AvlLinkedNode&lt;TestLinkedAvlNode&gt; {<a name="line.239"></a>
<span class="sourceLineNo">240</span> private final int key;<a name="line.240"></a>
<span class="sourceLineNo">241</span><a name="line.241"></a>
<span class="sourceLineNo">242</span> public TestLinkedAvlNode(int key) {<a name="line.242"></a>
<span class="sourceLineNo">243</span> this.key = key;<a name="line.243"></a>
<span class="sourceLineNo">244</span> }<a name="line.244"></a>
<span class="sourceLineNo">245</span><a name="line.245"></a>
<span class="sourceLineNo">246</span> public int getKey() {<a name="line.246"></a>
<span class="sourceLineNo">247</span> return key;<a name="line.247"></a>
<span class="sourceLineNo">248</span> }<a name="line.248"></a>
<span class="sourceLineNo">249</span><a name="line.249"></a>
<span class="sourceLineNo">250</span> @Override<a name="line.250"></a>
<span class="sourceLineNo">251</span> public int compareTo(TestLinkedAvlNode other) {<a name="line.251"></a>
<span class="sourceLineNo">252</span> return this.key - other.key;<a name="line.252"></a>
<span class="sourceLineNo">253</span> }<a name="line.253"></a>
<span class="sourceLineNo">254</span><a name="line.254"></a>
<span class="sourceLineNo">255</span> @Override<a name="line.255"></a>
<span class="sourceLineNo">256</span> public String toString() {<a name="line.256"></a>
<span class="sourceLineNo">257</span> return String.format("TestLinkedAvlNode(%d)", key);<a name="line.257"></a>
<span class="sourceLineNo">258</span> }<a name="line.258"></a>
<span class="sourceLineNo">259</span> }<a name="line.259"></a>
<span class="sourceLineNo">260</span><a name="line.260"></a>
<span class="sourceLineNo">261</span> private static class TestAvlKeyComparator implements AvlKeyComparator&lt;TestAvlNode&gt; {<a name="line.261"></a>
<span class="sourceLineNo">262</span> @Override<a name="line.262"></a>
<span class="sourceLineNo">263</span> public int compareKey(TestAvlNode node, Object key) {<a name="line.263"></a>
<span class="sourceLineNo">264</span> return node.getKey() - (int)key;<a name="line.264"></a>
<span class="sourceLineNo">265</span> }<a name="line.265"></a>
<span class="sourceLineNo">266</span> }<a name="line.266"></a>
<span class="sourceLineNo">267</span>}<a name="line.267"></a>
</pre>
</div>
</body>
</html>