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