| <!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: AvlUtil"> |
| <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 java.util.Iterator;</span> |
| <span class="source-line-no">021</span><span id="line-21">import java.util.concurrent.atomic.AtomicBoolean;</span> |
| <span class="source-line-no">022</span><span id="line-22">import org.apache.yetus.audience.InterfaceAudience;</span> |
| <span class="source-line-no">023</span><span id="line-23">import org.apache.yetus.audience.InterfaceStability;</span> |
| <span class="source-line-no">024</span><span id="line-24"></span> |
| <span class="source-line-no">025</span><span id="line-25">/**</span> |
| <span class="source-line-no">026</span><span id="line-26"> * Helper class that allows to create and manipulate an AvlTree. The main utility is in cases where</span> |
| <span class="source-line-no">027</span><span id="line-27"> * over time we have a lot of add/remove of the same object, and we want to avoid all the</span> |
| <span class="source-line-no">028</span><span id="line-28"> * allocations/deallocations of the "node" objects that the java containers will create.</span> |
| <span class="source-line-no">029</span><span id="line-29"> */</span> |
| <span class="source-line-no">030</span><span id="line-30">@InterfaceAudience.Private</span> |
| <span class="source-line-no">031</span><span id="line-31">@InterfaceStability.Evolving</span> |
| <span class="source-line-no">032</span><span id="line-32">public final class AvlUtil {</span> |
| <span class="source-line-no">033</span><span id="line-33"> private AvlUtil() {</span> |
| <span class="source-line-no">034</span><span id="line-34"> }</span> |
| <span class="source-line-no">035</span><span id="line-35"></span> |
| <span class="source-line-no">036</span><span id="line-36"> /**</span> |
| <span class="source-line-no">037</span><span id="line-37"> * This class represent a node that will be used in an AvlTree. Instead of creating another object</span> |
| <span class="source-line-no">038</span><span id="line-38"> * for the tree node, like the TreeMap and the other java contains, here the node can be extended</span> |
| <span class="source-line-no">039</span><span id="line-39"> * and the content can be embedded directly in the node itself. This is useful in cases where over</span> |
| <span class="source-line-no">040</span><span id="line-40"> * time we have a lot of add/remove of the same object.</span> |
| <span class="source-line-no">041</span><span id="line-41"> */</span> |
| <span class="source-line-no">042</span><span id="line-42"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">043</span><span id="line-43"> public static abstract class AvlNode<TNode extends AvlNode> {</span> |
| <span class="source-line-no">044</span><span id="line-44"> protected TNode avlLeft;</span> |
| <span class="source-line-no">045</span><span id="line-45"> protected TNode avlRight;</span> |
| <span class="source-line-no">046</span><span id="line-46"> protected int avlHeight;</span> |
| <span class="source-line-no">047</span><span id="line-47"></span> |
| <span class="source-line-no">048</span><span id="line-48"> public abstract int compareTo(TNode other);</span> |
| <span class="source-line-no">049</span><span id="line-49"> }</span> |
| <span class="source-line-no">050</span><span id="line-50"></span> |
| <span class="source-line-no">051</span><span id="line-51"> /**</span> |
| <span class="source-line-no">052</span><span id="line-52"> * This class extends the AvlNode and adds two links that will be used in conjunction with the</span> |
| <span class="source-line-no">053</span><span id="line-53"> * AvlIterableList class. This is useful in situations where your node must be in a map to have a</span> |
| <span class="source-line-no">054</span><span id="line-54"> * quick lookup by key, but it also require to be in something like a list/queue. This is useful</span> |
| <span class="source-line-no">055</span><span id="line-55"> * in cases where over time we have a lot of add/remove of the same object.</span> |
| <span class="source-line-no">056</span><span id="line-56"> */</span> |
| <span class="source-line-no">057</span><span id="line-57"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">058</span><span id="line-58"> public static abstract class AvlLinkedNode<TNode extends AvlLinkedNode> extends AvlNode<TNode> {</span> |
| <span class="source-line-no">059</span><span id="line-59"> protected TNode iterNext = null;</span> |
| <span class="source-line-no">060</span><span id="line-60"> protected TNode iterPrev = null;</span> |
| <span class="source-line-no">061</span><span id="line-61"> }</span> |
| <span class="source-line-no">062</span><span id="line-62"></span> |
| <span class="source-line-no">063</span><span id="line-63"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">064</span><span id="line-64"> public interface AvlInsertOrReplace<TNode extends AvlNode> {</span> |
| <span class="source-line-no">065</span><span id="line-65"> TNode insert(Object searchKey);</span> |
| <span class="source-line-no">066</span><span id="line-66"></span> |
| <span class="source-line-no">067</span><span id="line-67"> TNode replace(Object searchKey, TNode prevNode);</span> |
| <span class="source-line-no">068</span><span id="line-68"> }</span> |
| <span class="source-line-no">069</span><span id="line-69"></span> |
| <span class="source-line-no">070</span><span id="line-70"> /**</span> |
| <span class="source-line-no">071</span><span id="line-71"> * The AvlTree allows to lookup an object using a custom key. e.g. the java Map allows only to</span> |
| <span class="source-line-no">072</span><span id="line-72"> * lookup by key using the Comparator specified in the constructor. In this case you can pass a</span> |
| <span class="source-line-no">073</span><span id="line-73"> * specific comparator for every needs.</span> |
| <span class="source-line-no">074</span><span id="line-74"> */</span> |
| <span class="source-line-no">075</span><span id="line-75"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">076</span><span id="line-76"> public static interface AvlKeyComparator<TNode extends AvlNode> {</span> |
| <span class="source-line-no">077</span><span id="line-77"> int compareKey(TNode node, Object key);</span> |
| <span class="source-line-no">078</span><span id="line-78"> }</span> |
| <span class="source-line-no">079</span><span id="line-79"></span> |
| <span class="source-line-no">080</span><span id="line-80"> /**</span> |
| <span class="source-line-no">081</span><span id="line-81"> * Visitor that allows to traverse a set of AvlNodes. If you don't like the callback style of the</span> |
| <span class="source-line-no">082</span><span id="line-82"> * visitor you can always use the AvlTreeIterator.</span> |
| <span class="source-line-no">083</span><span id="line-83"> */</span> |
| <span class="source-line-no">084</span><span id="line-84"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">085</span><span id="line-85"> public static interface AvlNodeVisitor<TNode extends AvlNode> {</span> |
| <span class="source-line-no">086</span><span id="line-86"> /**</span> |
| <span class="source-line-no">087</span><span id="line-87"> * Visitor</span> |
| <span class="source-line-no">088</span><span id="line-88"> * @param node the node that we are currently visiting</span> |
| <span class="source-line-no">089</span><span id="line-89"> * @return false to stop the iteration. true to continue.</span> |
| <span class="source-line-no">090</span><span id="line-90"> */</span> |
| <span class="source-line-no">091</span><span id="line-91"> boolean visitNode(TNode node);</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"> /**</span> |
| <span class="source-line-no">095</span><span id="line-95"> * Helper class that allows to create and manipulate an AVL Tree</span> |
| <span class="source-line-no">096</span><span id="line-96"> */</span> |
| <span class="source-line-no">097</span><span id="line-97"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">098</span><span id="line-98"> public static class AvlTree {</span> |
| <span class="source-line-no">099</span><span id="line-99"> /**</span> |
| <span class="source-line-no">100</span><span id="line-100"> * Return the node that matches the specified key or null in case of node not found.</span> |
| <span class="source-line-no">101</span><span id="line-101"> * @param root the current root of the tree</span> |
| <span class="source-line-no">102</span><span id="line-102"> * @param key the key for the node we are trying to find</span> |
| <span class="source-line-no">103</span><span id="line-103"> * @param keyComparator the comparator to use to match node and key</span> |
| <span class="source-line-no">104</span><span id="line-104"> * @return the node that matches the specified key or null in case of node not found.</span> |
| <span class="source-line-no">105</span><span id="line-105"> */</span> |
| <span class="source-line-no">106</span><span id="line-106"> public static <TNode extends AvlNode> TNode get(TNode root, final Object key,</span> |
| <span class="source-line-no">107</span><span id="line-107"> final AvlKeyComparator<TNode> keyComparator) {</span> |
| <span class="source-line-no">108</span><span id="line-108"> while (root != null) {</span> |
| <span class="source-line-no">109</span><span id="line-109"> int cmp = keyComparator.compareKey(root, key);</span> |
| <span class="source-line-no">110</span><span id="line-110"> if (cmp > 0) {</span> |
| <span class="source-line-no">111</span><span id="line-111"> root = (TNode) root.avlLeft;</span> |
| <span class="source-line-no">112</span><span id="line-112"> } else if (cmp < 0) {</span> |
| <span class="source-line-no">113</span><span id="line-113"> root = (TNode) root.avlRight;</span> |
| <span class="source-line-no">114</span><span id="line-114"> } else {</span> |
| <span class="source-line-no">115</span><span id="line-115"> return (TNode) root;</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"> return null;</span> |
| <span class="source-line-no">119</span><span id="line-119"> }</span> |
| <span class="source-line-no">120</span><span id="line-120"></span> |
| <span class="source-line-no">121</span><span id="line-121"> /**</span> |
| <span class="source-line-no">122</span><span id="line-122"> * Return the first node of the tree.</span> |
| <span class="source-line-no">123</span><span id="line-123"> * @param root the current root of the tree</span> |
| <span class="source-line-no">124</span><span id="line-124"> * @return the first (min) node of the tree</span> |
| <span class="source-line-no">125</span><span id="line-125"> */</span> |
| <span class="source-line-no">126</span><span id="line-126"> public static <TNode extends AvlNode> TNode getFirst(TNode root) {</span> |
| <span class="source-line-no">127</span><span id="line-127"> if (root != null) {</span> |
| <span class="source-line-no">128</span><span id="line-128"> while (root.avlLeft != null) {</span> |
| <span class="source-line-no">129</span><span id="line-129"> root = (TNode) root.avlLeft;</span> |
| <span class="source-line-no">130</span><span id="line-130"> }</span> |
| <span class="source-line-no">131</span><span id="line-131"> }</span> |
| <span class="source-line-no">132</span><span id="line-132"> return root;</span> |
| <span class="source-line-no">133</span><span id="line-133"> }</span> |
| <span class="source-line-no">134</span><span id="line-134"></span> |
| <span class="source-line-no">135</span><span id="line-135"> /**</span> |
| <span class="source-line-no">136</span><span id="line-136"> * Return the last node of the tree.</span> |
| <span class="source-line-no">137</span><span id="line-137"> * @param root the current root of the tree</span> |
| <span class="source-line-no">138</span><span id="line-138"> * @return the last (max) node of the tree</span> |
| <span class="source-line-no">139</span><span id="line-139"> */</span> |
| <span class="source-line-no">140</span><span id="line-140"> public static <TNode extends AvlNode> TNode getLast(TNode root) {</span> |
| <span class="source-line-no">141</span><span id="line-141"> if (root != null) {</span> |
| <span class="source-line-no">142</span><span id="line-142"> while (root.avlRight != null) {</span> |
| <span class="source-line-no">143</span><span id="line-143"> root = (TNode) root.avlRight;</span> |
| <span class="source-line-no">144</span><span id="line-144"> }</span> |
| <span class="source-line-no">145</span><span id="line-145"> }</span> |
| <span class="source-line-no">146</span><span id="line-146"> return root;</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"> /**</span> |
| <span class="source-line-no">150</span><span id="line-150"> * Insert a node into the tree. It uses the AvlNode.compareTo() for ordering. NOTE: The node</span> |
| <span class="source-line-no">151</span><span id="line-151"> * must not be already in the tree.</span> |
| <span class="source-line-no">152</span><span id="line-152"> * @param root the current root of the tree</span> |
| <span class="source-line-no">153</span><span id="line-153"> * @param node the node to insert</span> |
| <span class="source-line-no">154</span><span id="line-154"> * @return the new root of the tree</span> |
| <span class="source-line-no">155</span><span id="line-155"> */</span> |
| <span class="source-line-no">156</span><span id="line-156"> public static <TNode extends AvlNode> TNode insert(TNode root, TNode node) {</span> |
| <span class="source-line-no">157</span><span id="line-157"> if (root == null) return node;</span> |
| <span class="source-line-no">158</span><span id="line-158"></span> |
| <span class="source-line-no">159</span><span id="line-159"> int cmp = node.compareTo(root);</span> |
| <span class="source-line-no">160</span><span id="line-160"> assert cmp != 0 : "node already inserted: " + root;</span> |
| <span class="source-line-no">161</span><span id="line-161"> if (cmp < 0) {</span> |
| <span class="source-line-no">162</span><span id="line-162"> root.avlLeft = insert(root.avlLeft, node);</span> |
| <span class="source-line-no">163</span><span id="line-163"> } else {</span> |
| <span class="source-line-no">164</span><span id="line-164"> root.avlRight = insert(root.avlRight, node);</span> |
| <span class="source-line-no">165</span><span id="line-165"> }</span> |
| <span class="source-line-no">166</span><span id="line-166"> return balance(root);</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"> * Insert a node into the tree. This is useful when you want to create a new node or replace the</span> |
| <span class="source-line-no">171</span><span id="line-171"> * content depending if the node already exists or not. Using AvlInsertOrReplace class you can</span> |
| <span class="source-line-no">172</span><span id="line-172"> * return the node to add/replace.</span> |
| <span class="source-line-no">173</span><span id="line-173"> * @param root the current root of the tree</span> |
| <span class="source-line-no">174</span><span id="line-174"> * @param key the key for the node we are trying to insert</span> |
| <span class="source-line-no">175</span><span id="line-175"> * @param keyComparator the comparator to use to match node and key</span> |
| <span class="source-line-no">176</span><span id="line-176"> * @param insertOrReplace the class to use to insert or replace the node</span> |
| <span class="source-line-no">177</span><span id="line-177"> * @return the new root of the tree</span> |
| <span class="source-line-no">178</span><span id="line-178"> */</span> |
| <span class="source-line-no">179</span><span id="line-179"> public static <TNode extends AvlNode> TNode insert(TNode root, Object key,</span> |
| <span class="source-line-no">180</span><span id="line-180"> final AvlKeyComparator<TNode> keyComparator,</span> |
| <span class="source-line-no">181</span><span id="line-181"> final AvlInsertOrReplace<TNode> insertOrReplace) {</span> |
| <span class="source-line-no">182</span><span id="line-182"> if (root == null) {</span> |
| <span class="source-line-no">183</span><span id="line-183"> return insertOrReplace.insert(key);</span> |
| <span class="source-line-no">184</span><span id="line-184"> }</span> |
| <span class="source-line-no">185</span><span id="line-185"></span> |
| <span class="source-line-no">186</span><span id="line-186"> int cmp = keyComparator.compareKey(root, key);</span> |
| <span class="source-line-no">187</span><span id="line-187"> if (cmp < 0) {</span> |
| <span class="source-line-no">188</span><span id="line-188"> root.avlLeft = insert((TNode) root.avlLeft, key, keyComparator, insertOrReplace);</span> |
| <span class="source-line-no">189</span><span id="line-189"> } else if (cmp > 0) {</span> |
| <span class="source-line-no">190</span><span id="line-190"> root.avlRight = insert((TNode) root.avlRight, key, keyComparator, insertOrReplace);</span> |
| <span class="source-line-no">191</span><span id="line-191"> } else {</span> |
| <span class="source-line-no">192</span><span id="line-192"> TNode left = (TNode) root.avlLeft;</span> |
| <span class="source-line-no">193</span><span id="line-193"> TNode right = (TNode) root.avlRight;</span> |
| <span class="source-line-no">194</span><span id="line-194"> root = insertOrReplace.replace(key, root);</span> |
| <span class="source-line-no">195</span><span id="line-195"> root.avlLeft = left;</span> |
| <span class="source-line-no">196</span><span id="line-196"> root.avlRight = right;</span> |
| <span class="source-line-no">197</span><span id="line-197"> return root;</span> |
| <span class="source-line-no">198</span><span id="line-198"> }</span> |
| <span class="source-line-no">199</span><span id="line-199"> return balance(root);</span> |
| <span class="source-line-no">200</span><span id="line-200"> }</span> |
| <span class="source-line-no">201</span><span id="line-201"></span> |
| <span class="source-line-no">202</span><span id="line-202"> private static <TNode extends AvlNode> TNode removeMin(TNode p) {</span> |
| <span class="source-line-no">203</span><span id="line-203"> if (p.avlLeft == null) return (TNode) p.avlRight;</span> |
| <span class="source-line-no">204</span><span id="line-204"> p.avlLeft = removeMin(p.avlLeft);</span> |
| <span class="source-line-no">205</span><span id="line-205"> return balance(p);</span> |
| <span class="source-line-no">206</span><span id="line-206"> }</span> |
| <span class="source-line-no">207</span><span id="line-207"></span> |
| <span class="source-line-no">208</span><span id="line-208"> /**</span> |
| <span class="source-line-no">209</span><span id="line-209"> * Removes the node matching the specified key from the tree</span> |
| <span class="source-line-no">210</span><span id="line-210"> * @param root the current root of the tree</span> |
| <span class="source-line-no">211</span><span id="line-211"> * @param key the key for the node we are trying to find</span> |
| <span class="source-line-no">212</span><span id="line-212"> * @param keyComparator the comparator to use to match node and key</span> |
| <span class="source-line-no">213</span><span id="line-213"> * @return the new root of the tree</span> |
| <span class="source-line-no">214</span><span id="line-214"> */</span> |
| <span class="source-line-no">215</span><span id="line-215"> public static <TNode extends AvlNode> TNode remove(TNode root, Object key,</span> |
| <span class="source-line-no">216</span><span id="line-216"> final AvlKeyComparator<TNode> keyComparator) {</span> |
| <span class="source-line-no">217</span><span id="line-217"> return remove(root, key, keyComparator, null);</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"> /**</span> |
| <span class="source-line-no">221</span><span id="line-221"> * Removes the node matching the specified key from the tree</span> |
| <span class="source-line-no">222</span><span id="line-222"> * @param root the current root of the tree</span> |
| <span class="source-line-no">223</span><span id="line-223"> * @param key the key for the node we are trying to find</span> |
| <span class="source-line-no">224</span><span id="line-224"> * @param keyComparator the comparator to use to match node and key</span> |
| <span class="source-line-no">225</span><span id="line-225"> * @param removed will be set to true if the node was found and removed, otherwise false</span> |
| <span class="source-line-no">226</span><span id="line-226"> * @return the new root of the tree</span> |
| <span class="source-line-no">227</span><span id="line-227"> */</span> |
| <span class="source-line-no">228</span><span id="line-228"> public static <TNode extends AvlNode> TNode remove(TNode root, Object key,</span> |
| <span class="source-line-no">229</span><span id="line-229"> final AvlKeyComparator<TNode> keyComparator, final AtomicBoolean removed) {</span> |
| <span class="source-line-no">230</span><span id="line-230"> if (root == null) return null;</span> |
| <span class="source-line-no">231</span><span id="line-231"></span> |
| <span class="source-line-no">232</span><span id="line-232"> int cmp = keyComparator.compareKey(root, key);</span> |
| <span class="source-line-no">233</span><span id="line-233"> if (cmp == 0) {</span> |
| <span class="source-line-no">234</span><span id="line-234"> if (removed != null) removed.set(true);</span> |
| <span class="source-line-no">235</span><span id="line-235"></span> |
| <span class="source-line-no">236</span><span id="line-236"> TNode q = (TNode) root.avlLeft;</span> |
| <span class="source-line-no">237</span><span id="line-237"> TNode r = (TNode) root.avlRight;</span> |
| <span class="source-line-no">238</span><span id="line-238"> if (r == null) return q;</span> |
| <span class="source-line-no">239</span><span id="line-239"> TNode min = getFirst(r);</span> |
| <span class="source-line-no">240</span><span id="line-240"> min.avlRight = removeMin(r);</span> |
| <span class="source-line-no">241</span><span id="line-241"> min.avlLeft = q;</span> |
| <span class="source-line-no">242</span><span id="line-242"> return balance(min);</span> |
| <span class="source-line-no">243</span><span id="line-243"> } else if (cmp > 0) {</span> |
| <span class="source-line-no">244</span><span id="line-244"> root.avlLeft = remove((TNode) root.avlLeft, key, keyComparator);</span> |
| <span class="source-line-no">245</span><span id="line-245"> } else /* if (cmp < 0) */ {</span> |
| <span class="source-line-no">246</span><span id="line-246"> root.avlRight = remove((TNode) root.avlRight, key, keyComparator);</span> |
| <span class="source-line-no">247</span><span id="line-247"> }</span> |
| <span class="source-line-no">248</span><span id="line-248"> return balance(root);</span> |
| <span class="source-line-no">249</span><span id="line-249"> }</span> |
| <span class="source-line-no">250</span><span id="line-250"></span> |
| <span class="source-line-no">251</span><span id="line-251"> /**</span> |
| <span class="source-line-no">252</span><span id="line-252"> * Visit each node of the tree</span> |
| <span class="source-line-no">253</span><span id="line-253"> * @param root the current root of the tree</span> |
| <span class="source-line-no">254</span><span id="line-254"> * @param visitor the AvlNodeVisitor instance</span> |
| <span class="source-line-no">255</span><span id="line-255"> */</span> |
| <span class="source-line-no">256</span><span id="line-256"> public static <TNode extends AvlNode> void visit(final TNode root,</span> |
| <span class="source-line-no">257</span><span id="line-257"> final AvlNodeVisitor<TNode> visitor) {</span> |
| <span class="source-line-no">258</span><span id="line-258"> if (root == null) return;</span> |
| <span class="source-line-no">259</span><span id="line-259"></span> |
| <span class="source-line-no">260</span><span id="line-260"> final AvlTreeIterator<TNode> iterator = new AvlTreeIterator<>(root);</span> |
| <span class="source-line-no">261</span><span id="line-261"> boolean visitNext = true;</span> |
| <span class="source-line-no">262</span><span id="line-262"> while (visitNext && iterator.hasNext()) {</span> |
| <span class="source-line-no">263</span><span id="line-263"> visitNext = visitor.visitNode(iterator.next());</span> |
| <span class="source-line-no">264</span><span id="line-264"> }</span> |
| <span class="source-line-no">265</span><span id="line-265"> }</span> |
| <span class="source-line-no">266</span><span id="line-266"></span> |
| <span class="source-line-no">267</span><span id="line-267"> private static <TNode extends AvlNode> TNode balance(TNode p) {</span> |
| <span class="source-line-no">268</span><span id="line-268"> fixHeight(p);</span> |
| <span class="source-line-no">269</span><span id="line-269"> int balance = balanceFactor(p);</span> |
| <span class="source-line-no">270</span><span id="line-270"> if (balance == 2) {</span> |
| <span class="source-line-no">271</span><span id="line-271"> if (balanceFactor(p.avlRight) < 0) {</span> |
| <span class="source-line-no">272</span><span id="line-272"> p.avlRight = rotateRight(p.avlRight);</span> |
| <span class="source-line-no">273</span><span id="line-273"> }</span> |
| <span class="source-line-no">274</span><span id="line-274"> return rotateLeft(p);</span> |
| <span class="source-line-no">275</span><span id="line-275"> } else if (balance == -2) {</span> |
| <span class="source-line-no">276</span><span id="line-276"> if (balanceFactor(p.avlLeft) > 0) {</span> |
| <span class="source-line-no">277</span><span id="line-277"> p.avlLeft = rotateLeft(p.avlLeft);</span> |
| <span class="source-line-no">278</span><span id="line-278"> }</span> |
| <span class="source-line-no">279</span><span id="line-279"> return rotateRight(p);</span> |
| <span class="source-line-no">280</span><span id="line-280"> }</span> |
| <span class="source-line-no">281</span><span id="line-281"> return p;</span> |
| <span class="source-line-no">282</span><span id="line-282"> }</span> |
| <span class="source-line-no">283</span><span id="line-283"></span> |
| <span class="source-line-no">284</span><span id="line-284"> private static <TNode extends AvlNode> TNode rotateRight(TNode p) {</span> |
| <span class="source-line-no">285</span><span id="line-285"> TNode q = (TNode) p.avlLeft;</span> |
| <span class="source-line-no">286</span><span id="line-286"> p.avlLeft = q.avlRight;</span> |
| <span class="source-line-no">287</span><span id="line-287"> q.avlRight = p;</span> |
| <span class="source-line-no">288</span><span id="line-288"> fixHeight(p);</span> |
| <span class="source-line-no">289</span><span id="line-289"> fixHeight(q);</span> |
| <span class="source-line-no">290</span><span id="line-290"> return q;</span> |
| <span class="source-line-no">291</span><span id="line-291"> }</span> |
| <span class="source-line-no">292</span><span id="line-292"></span> |
| <span class="source-line-no">293</span><span id="line-293"> private static <TNode extends AvlNode> TNode rotateLeft(TNode q) {</span> |
| <span class="source-line-no">294</span><span id="line-294"> TNode p = (TNode) q.avlRight;</span> |
| <span class="source-line-no">295</span><span id="line-295"> q.avlRight = p.avlLeft;</span> |
| <span class="source-line-no">296</span><span id="line-296"> p.avlLeft = q;</span> |
| <span class="source-line-no">297</span><span id="line-297"> fixHeight(q);</span> |
| <span class="source-line-no">298</span><span id="line-298"> fixHeight(p);</span> |
| <span class="source-line-no">299</span><span id="line-299"> return p;</span> |
| <span class="source-line-no">300</span><span id="line-300"> }</span> |
| <span class="source-line-no">301</span><span id="line-301"></span> |
| <span class="source-line-no">302</span><span id="line-302"> private static <TNode extends AvlNode> void fixHeight(TNode node) {</span> |
| <span class="source-line-no">303</span><span id="line-303"> final int heightLeft = height(node.avlLeft);</span> |
| <span class="source-line-no">304</span><span id="line-304"> final int heightRight = height(node.avlRight);</span> |
| <span class="source-line-no">305</span><span id="line-305"> node.avlHeight = 1 + Math.max(heightLeft, heightRight);</span> |
| <span class="source-line-no">306</span><span id="line-306"> }</span> |
| <span class="source-line-no">307</span><span id="line-307"></span> |
| <span class="source-line-no">308</span><span id="line-308"> private static <TNode extends AvlNode> int height(TNode node) {</span> |
| <span class="source-line-no">309</span><span id="line-309"> return node != null ? node.avlHeight : 0;</span> |
| <span class="source-line-no">310</span><span id="line-310"> }</span> |
| <span class="source-line-no">311</span><span id="line-311"></span> |
| <span class="source-line-no">312</span><span id="line-312"> private static <TNode extends AvlNode> int balanceFactor(TNode node) {</span> |
| <span class="source-line-no">313</span><span id="line-313"> return height(node.avlRight) - height(node.avlLeft);</span> |
| <span class="source-line-no">314</span><span id="line-314"> }</span> |
| <span class="source-line-no">315</span><span id="line-315"> }</span> |
| <span class="source-line-no">316</span><span id="line-316"></span> |
| <span class="source-line-no">317</span><span id="line-317"> /**</span> |
| <span class="source-line-no">318</span><span id="line-318"> * Iterator for the AvlTree</span> |
| <span class="source-line-no">319</span><span id="line-319"> */</span> |
| <span class="source-line-no">320</span><span id="line-320"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">321</span><span id="line-321"> public static class AvlTreeIterator<TNode extends AvlNode> implements Iterator<TNode> {</span> |
| <span class="source-line-no">322</span><span id="line-322"> private final Object[] stack = new Object[64];</span> |
| <span class="source-line-no">323</span><span id="line-323"></span> |
| <span class="source-line-no">324</span><span id="line-324"> private TNode current = null;</span> |
| <span class="source-line-no">325</span><span id="line-325"> private int height = 0;</span> |
| <span class="source-line-no">326</span><span id="line-326"></span> |
| <span class="source-line-no">327</span><span id="line-327"> public AvlTreeIterator() {</span> |
| <span class="source-line-no">328</span><span id="line-328"> }</span> |
| <span class="source-line-no">329</span><span id="line-329"></span> |
| <span class="source-line-no">330</span><span id="line-330"> /**</span> |
| <span class="source-line-no">331</span><span id="line-331"> * Create the iterator starting from the first (min) node of the tree</span> |
| <span class="source-line-no">332</span><span id="line-332"> * @param root the current root of the tree</span> |
| <span class="source-line-no">333</span><span id="line-333"> */</span> |
| <span class="source-line-no">334</span><span id="line-334"> public AvlTreeIterator(final TNode root) {</span> |
| <span class="source-line-no">335</span><span id="line-335"> seekFirst(root);</span> |
| <span class="source-line-no">336</span><span id="line-336"> }</span> |
| <span class="source-line-no">337</span><span id="line-337"></span> |
| <span class="source-line-no">338</span><span id="line-338"> /**</span> |
| <span class="source-line-no">339</span><span id="line-339"> * Create the iterator starting from the specified key</span> |
| <span class="source-line-no">340</span><span id="line-340"> * @param root the current root of the tree</span> |
| <span class="source-line-no">341</span><span id="line-341"> * @param key the key for the node we are trying to find</span> |
| <span class="source-line-no">342</span><span id="line-342"> * @param keyComparator the comparator to use to match node and key</span> |
| <span class="source-line-no">343</span><span id="line-343"> */</span> |
| <span class="source-line-no">344</span><span id="line-344"> public AvlTreeIterator(final TNode root, final Object key,</span> |
| <span class="source-line-no">345</span><span id="line-345"> final AvlKeyComparator<TNode> keyComparator) {</span> |
| <span class="source-line-no">346</span><span id="line-346"> seekTo(root, key, keyComparator);</span> |
| <span class="source-line-no">347</span><span id="line-347"> }</span> |
| <span class="source-line-no">348</span><span id="line-348"></span> |
| <span class="source-line-no">349</span><span id="line-349"> @Override</span> |
| <span class="source-line-no">350</span><span id="line-350"> public boolean hasNext() {</span> |
| <span class="source-line-no">351</span><span id="line-351"> return current != null;</span> |
| <span class="source-line-no">352</span><span id="line-352"> }</span> |
| <span class="source-line-no">353</span><span id="line-353"></span> |
| <span class="source-line-no">354</span><span id="line-354"> @Override</span> |
| <span class="source-line-no">355</span><span id="line-355"> public TNode next() {</span> |
| <span class="source-line-no">356</span><span id="line-356"> final TNode node = this.current;</span> |
| <span class="source-line-no">357</span><span id="line-357"> seekNext();</span> |
| <span class="source-line-no">358</span><span id="line-358"> return node;</span> |
| <span class="source-line-no">359</span><span id="line-359"> }</span> |
| <span class="source-line-no">360</span><span id="line-360"></span> |
| <span class="source-line-no">361</span><span id="line-361"> @Override</span> |
| <span class="source-line-no">362</span><span id="line-362"> public void remove() {</span> |
| <span class="source-line-no">363</span><span id="line-363"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">364</span><span id="line-364"> }</span> |
| <span class="source-line-no">365</span><span id="line-365"></span> |
| <span class="source-line-no">366</span><span id="line-366"> /**</span> |
| <span class="source-line-no">367</span><span id="line-367"> * Reset the iterator, and seeks to the first (min) node of the tree</span> |
| <span class="source-line-no">368</span><span id="line-368"> * @param root the current root of the tree</span> |
| <span class="source-line-no">369</span><span id="line-369"> */</span> |
| <span class="source-line-no">370</span><span id="line-370"> public void seekFirst(final TNode root) {</span> |
| <span class="source-line-no">371</span><span id="line-371"> current = root;</span> |
| <span class="source-line-no">372</span><span id="line-372"> height = 0;</span> |
| <span class="source-line-no">373</span><span id="line-373"> if (root != null) {</span> |
| <span class="source-line-no">374</span><span id="line-374"> while (current.avlLeft != null) {</span> |
| <span class="source-line-no">375</span><span id="line-375"> stack[height++] = current;</span> |
| <span class="source-line-no">376</span><span id="line-376"> current = (TNode) current.avlLeft;</span> |
| <span class="source-line-no">377</span><span id="line-377"> }</span> |
| <span class="source-line-no">378</span><span id="line-378"> }</span> |
| <span class="source-line-no">379</span><span id="line-379"> }</span> |
| <span class="source-line-no">380</span><span id="line-380"></span> |
| <span class="source-line-no">381</span><span id="line-381"> /**</span> |
| <span class="source-line-no">382</span><span id="line-382"> * Reset the iterator, and seeks to the specified key</span> |
| <span class="source-line-no">383</span><span id="line-383"> * @param root the current root of the tree</span> |
| <span class="source-line-no">384</span><span id="line-384"> * @param key the key for the node we are trying to find</span> |
| <span class="source-line-no">385</span><span id="line-385"> * @param keyComparator the comparator to use to match node and key</span> |
| <span class="source-line-no">386</span><span id="line-386"> */</span> |
| <span class="source-line-no">387</span><span id="line-387"> public void seekTo(final TNode root, final Object key,</span> |
| <span class="source-line-no">388</span><span id="line-388"> final AvlKeyComparator<TNode> keyComparator) {</span> |
| <span class="source-line-no">389</span><span id="line-389"> current = null;</span> |
| <span class="source-line-no">390</span><span id="line-390"> height = 0;</span> |
| <span class="source-line-no">391</span><span id="line-391"></span> |
| <span class="source-line-no">392</span><span id="line-392"> TNode node = root;</span> |
| <span class="source-line-no">393</span><span id="line-393"> while (node != null) {</span> |
| <span class="source-line-no">394</span><span id="line-394"> if (keyComparator.compareKey(node, key) >= 0) {</span> |
| <span class="source-line-no">395</span><span id="line-395"> if (node.avlLeft != null) {</span> |
| <span class="source-line-no">396</span><span id="line-396"> stack[height++] = node;</span> |
| <span class="source-line-no">397</span><span id="line-397"> node = (TNode) node.avlLeft;</span> |
| <span class="source-line-no">398</span><span id="line-398"> } else {</span> |
| <span class="source-line-no">399</span><span id="line-399"> current = node;</span> |
| <span class="source-line-no">400</span><span id="line-400"> return;</span> |
| <span class="source-line-no">401</span><span id="line-401"> }</span> |
| <span class="source-line-no">402</span><span id="line-402"> } else {</span> |
| <span class="source-line-no">403</span><span id="line-403"> if (node.avlRight != null) {</span> |
| <span class="source-line-no">404</span><span id="line-404"> stack[height++] = node;</span> |
| <span class="source-line-no">405</span><span id="line-405"> node = (TNode) node.avlRight;</span> |
| <span class="source-line-no">406</span><span id="line-406"> } else {</span> |
| <span class="source-line-no">407</span><span id="line-407"> if (height > 0) {</span> |
| <span class="source-line-no">408</span><span id="line-408"> TNode parent = (TNode) stack[--height];</span> |
| <span class="source-line-no">409</span><span id="line-409"> while (node == parent.avlRight) {</span> |
| <span class="source-line-no">410</span><span id="line-410"> if (height == 0) {</span> |
| <span class="source-line-no">411</span><span id="line-411"> current = null;</span> |
| <span class="source-line-no">412</span><span id="line-412"> return;</span> |
| <span class="source-line-no">413</span><span id="line-413"> }</span> |
| <span class="source-line-no">414</span><span id="line-414"> node = parent;</span> |
| <span class="source-line-no">415</span><span id="line-415"> parent = (TNode) stack[--height];</span> |
| <span class="source-line-no">416</span><span id="line-416"> }</span> |
| <span class="source-line-no">417</span><span id="line-417"> current = parent;</span> |
| <span class="source-line-no">418</span><span id="line-418"> return;</span> |
| <span class="source-line-no">419</span><span id="line-419"> }</span> |
| <span class="source-line-no">420</span><span id="line-420"> current = null;</span> |
| <span class="source-line-no">421</span><span id="line-421"> return;</span> |
| <span class="source-line-no">422</span><span id="line-422"> }</span> |
| <span class="source-line-no">423</span><span id="line-423"> }</span> |
| <span class="source-line-no">424</span><span id="line-424"> }</span> |
| <span class="source-line-no">425</span><span id="line-425"> }</span> |
| <span class="source-line-no">426</span><span id="line-426"></span> |
| <span class="source-line-no">427</span><span id="line-427"> private void seekNext() {</span> |
| <span class="source-line-no">428</span><span id="line-428"> if (current == null) return;</span> |
| <span class="source-line-no">429</span><span id="line-429"> if (current.avlRight != null) {</span> |
| <span class="source-line-no">430</span><span id="line-430"> stack[height++] = current;</span> |
| <span class="source-line-no">431</span><span id="line-431"> current = (TNode) current.avlRight;</span> |
| <span class="source-line-no">432</span><span id="line-432"> while (current.avlLeft != null) {</span> |
| <span class="source-line-no">433</span><span id="line-433"> stack[height++] = current;</span> |
| <span class="source-line-no">434</span><span id="line-434"> current = (TNode) current.avlLeft;</span> |
| <span class="source-line-no">435</span><span id="line-435"> }</span> |
| <span class="source-line-no">436</span><span id="line-436"> } else {</span> |
| <span class="source-line-no">437</span><span id="line-437"> TNode node;</span> |
| <span class="source-line-no">438</span><span id="line-438"> do {</span> |
| <span class="source-line-no">439</span><span id="line-439"> if (height == 0) {</span> |
| <span class="source-line-no">440</span><span id="line-440"> current = null;</span> |
| <span class="source-line-no">441</span><span id="line-441"> return;</span> |
| <span class="source-line-no">442</span><span id="line-442"> }</span> |
| <span class="source-line-no">443</span><span id="line-443"> node = current;</span> |
| <span class="source-line-no">444</span><span id="line-444"> current = (TNode) stack[--height];</span> |
| <span class="source-line-no">445</span><span id="line-445"> } while (current.avlRight == node);</span> |
| <span class="source-line-no">446</span><span id="line-446"> }</span> |
| <span class="source-line-no">447</span><span id="line-447"> }</span> |
| <span class="source-line-no">448</span><span id="line-448"> }</span> |
| <span class="source-line-no">449</span><span id="line-449"></span> |
| <span class="source-line-no">450</span><span id="line-450"> /**</span> |
| <span class="source-line-no">451</span><span id="line-451"> * Helper class that allows to create and manipulate a linked list of AvlLinkedNodes</span> |
| <span class="source-line-no">452</span><span id="line-452"> */</span> |
| <span class="source-line-no">453</span><span id="line-453"> @InterfaceAudience.Private</span> |
| <span class="source-line-no">454</span><span id="line-454"> public static class AvlIterableList {</span> |
| <span class="source-line-no">455</span><span id="line-455"> /**</span> |
| <span class="source-line-no">456</span><span id="line-456"> * Return the successor of the current node</span> |
| <span class="source-line-no">457</span><span id="line-457"> * @param node the current node</span> |
| <span class="source-line-no">458</span><span id="line-458"> * @return the successor of the current node</span> |
| <span class="source-line-no">459</span><span id="line-459"> */</span> |
| <span class="source-line-no">460</span><span id="line-460"> public static <TNode extends AvlLinkedNode> TNode readNext(TNode node) {</span> |
| <span class="source-line-no">461</span><span id="line-461"> return (TNode) node.iterNext;</span> |
| <span class="source-line-no">462</span><span id="line-462"> }</span> |
| <span class="source-line-no">463</span><span id="line-463"></span> |
| <span class="source-line-no">464</span><span id="line-464"> /**</span> |
| <span class="source-line-no">465</span><span id="line-465"> * Return the predecessor of the current node</span> |
| <span class="source-line-no">466</span><span id="line-466"> * @param node the current node</span> |
| <span class="source-line-no">467</span><span id="line-467"> * @return the predecessor of the current node</span> |
| <span class="source-line-no">468</span><span id="line-468"> */</span> |
| <span class="source-line-no">469</span><span id="line-469"> public static <TNode extends AvlLinkedNode> TNode readPrev(TNode node) {</span> |
| <span class="source-line-no">470</span><span id="line-470"> return (TNode) node.iterPrev;</span> |
| <span class="source-line-no">471</span><span id="line-471"> }</span> |
| <span class="source-line-no">472</span><span id="line-472"></span> |
| <span class="source-line-no">473</span><span id="line-473"> /**</span> |
| <span class="source-line-no">474</span><span id="line-474"> * Prepend a node to the tree</span> |
| <span class="source-line-no">475</span><span id="line-475"> * @param head the head of the linked list</span> |
| <span class="source-line-no">476</span><span id="line-476"> * @param node the node to add to the front of the list</span> |
| <span class="source-line-no">477</span><span id="line-477"> * @return the new head of the list</span> |
| <span class="source-line-no">478</span><span id="line-478"> */</span> |
| <span class="source-line-no">479</span><span id="line-479"> public static <TNode extends AvlLinkedNode> TNode prepend(TNode head, TNode node) {</span> |
| <span class="source-line-no">480</span><span id="line-480"> assert !isLinked(node) : node + " is already linked";</span> |
| <span class="source-line-no">481</span><span id="line-481"> if (head != null) {</span> |
| <span class="source-line-no">482</span><span id="line-482"> TNode tail = (TNode) head.iterPrev;</span> |
| <span class="source-line-no">483</span><span id="line-483"> tail.iterNext = node;</span> |
| <span class="source-line-no">484</span><span id="line-484"> head.iterPrev = node;</span> |
| <span class="source-line-no">485</span><span id="line-485"> node.iterNext = head;</span> |
| <span class="source-line-no">486</span><span id="line-486"> node.iterPrev = tail;</span> |
| <span class="source-line-no">487</span><span id="line-487"> } else {</span> |
| <span class="source-line-no">488</span><span id="line-488"> node.iterNext = node;</span> |
| <span class="source-line-no">489</span><span id="line-489"> node.iterPrev = node;</span> |
| <span class="source-line-no">490</span><span id="line-490"> }</span> |
| <span class="source-line-no">491</span><span id="line-491"> return node;</span> |
| <span class="source-line-no">492</span><span id="line-492"> }</span> |
| <span class="source-line-no">493</span><span id="line-493"></span> |
| <span class="source-line-no">494</span><span id="line-494"> /**</span> |
| <span class="source-line-no">495</span><span id="line-495"> * Append a node to the tree</span> |
| <span class="source-line-no">496</span><span id="line-496"> * @param head the head of the linked list</span> |
| <span class="source-line-no">497</span><span id="line-497"> * @param node the node to add to the tail of the list</span> |
| <span class="source-line-no">498</span><span id="line-498"> * @return the new head of the list</span> |
| <span class="source-line-no">499</span><span id="line-499"> */</span> |
| <span class="source-line-no">500</span><span id="line-500"> public static <TNode extends AvlLinkedNode> TNode append(TNode head, TNode node) {</span> |
| <span class="source-line-no">501</span><span id="line-501"> assert !isLinked(node) : node + " is already linked";</span> |
| <span class="source-line-no">502</span><span id="line-502"> if (head != null) {</span> |
| <span class="source-line-no">503</span><span id="line-503"> TNode tail = (TNode) head.iterPrev;</span> |
| <span class="source-line-no">504</span><span id="line-504"> tail.iterNext = node;</span> |
| <span class="source-line-no">505</span><span id="line-505"> node.iterNext = head;</span> |
| <span class="source-line-no">506</span><span id="line-506"> node.iterPrev = tail;</span> |
| <span class="source-line-no">507</span><span id="line-507"> head.iterPrev = node;</span> |
| <span class="source-line-no">508</span><span id="line-508"> return head;</span> |
| <span class="source-line-no">509</span><span id="line-509"> }</span> |
| <span class="source-line-no">510</span><span id="line-510"> node.iterNext = node;</span> |
| <span class="source-line-no">511</span><span id="line-511"> node.iterPrev = node;</span> |
| <span class="source-line-no">512</span><span id="line-512"> return node;</span> |
| <span class="source-line-no">513</span><span id="line-513"> }</span> |
| <span class="source-line-no">514</span><span id="line-514"></span> |
| <span class="source-line-no">515</span><span id="line-515"> /**</span> |
| <span class="source-line-no">516</span><span id="line-516"> * Append a list of nodes to the tree</span> |
| <span class="source-line-no">517</span><span id="line-517"> * @param head the head of the current linked list</span> |
| <span class="source-line-no">518</span><span id="line-518"> * @param otherHead the head of the list to append to the current list</span> |
| <span class="source-line-no">519</span><span id="line-519"> * @return the new head of the current list</span> |
| <span class="source-line-no">520</span><span id="line-520"> */</span> |
| <span class="source-line-no">521</span><span id="line-521"> public static <TNode extends AvlLinkedNode> TNode appendList(TNode head, TNode otherHead) {</span> |
| <span class="source-line-no">522</span><span id="line-522"> if (head == null) return otherHead;</span> |
| <span class="source-line-no">523</span><span id="line-523"> if (otherHead == null) return head;</span> |
| <span class="source-line-no">524</span><span id="line-524"></span> |
| <span class="source-line-no">525</span><span id="line-525"> TNode tail = (TNode) head.iterPrev;</span> |
| <span class="source-line-no">526</span><span id="line-526"> TNode otherTail = (TNode) otherHead.iterPrev;</span> |
| <span class="source-line-no">527</span><span id="line-527"> tail.iterNext = otherHead;</span> |
| <span class="source-line-no">528</span><span id="line-528"> otherHead.iterPrev = tail;</span> |
| <span class="source-line-no">529</span><span id="line-529"> otherTail.iterNext = head;</span> |
| <span class="source-line-no">530</span><span id="line-530"> head.iterPrev = otherTail;</span> |
| <span class="source-line-no">531</span><span id="line-531"> return head;</span> |
| <span class="source-line-no">532</span><span id="line-532"> }</span> |
| <span class="source-line-no">533</span><span id="line-533"></span> |
| <span class="source-line-no">534</span><span id="line-534"> /**</span> |
| <span class="source-line-no">535</span><span id="line-535"> * Remove a node from the tree</span> |
| <span class="source-line-no">536</span><span id="line-536"> * @param head the head of the linked list</span> |
| <span class="source-line-no">537</span><span id="line-537"> * @param node the node to remove from the list</span> |
| <span class="source-line-no">538</span><span id="line-538"> * @return the new head of the list</span> |
| <span class="source-line-no">539</span><span id="line-539"> */</span> |
| <span class="source-line-no">540</span><span id="line-540"> public static <TNode extends AvlLinkedNode> TNode remove(TNode head, TNode node) {</span> |
| <span class="source-line-no">541</span><span id="line-541"> assert isLinked(node) : node + " is not linked";</span> |
| <span class="source-line-no">542</span><span id="line-542"> if (node != node.iterNext) {</span> |
| <span class="source-line-no">543</span><span id="line-543"> node.iterPrev.iterNext = node.iterNext;</span> |
| <span class="source-line-no">544</span><span id="line-544"> node.iterNext.iterPrev = node.iterPrev;</span> |
| <span class="source-line-no">545</span><span id="line-545"> head = (head == node) ? (TNode) node.iterNext : head;</span> |
| <span class="source-line-no">546</span><span id="line-546"> } else {</span> |
| <span class="source-line-no">547</span><span id="line-547"> head = null;</span> |
| <span class="source-line-no">548</span><span id="line-548"> }</span> |
| <span class="source-line-no">549</span><span id="line-549"> node.iterNext = null;</span> |
| <span class="source-line-no">550</span><span id="line-550"> node.iterPrev = null;</span> |
| <span class="source-line-no">551</span><span id="line-551"> return head;</span> |
| <span class="source-line-no">552</span><span id="line-552"> }</span> |
| <span class="source-line-no">553</span><span id="line-553"></span> |
| <span class="source-line-no">554</span><span id="line-554"> /**</span> |
| <span class="source-line-no">555</span><span id="line-555"> * Prepend a node to the tree before a specific node</span> |
| <span class="source-line-no">556</span><span id="line-556"> * @param head the head of the linked list</span> |
| <span class="source-line-no">557</span><span id="line-557"> * @param base the node which we want to add the {@code node} before it</span> |
| <span class="source-line-no">558</span><span id="line-558"> * @param node the node which we want to add it before the {@code base} node</span> |
| <span class="source-line-no">559</span><span id="line-559"> */</span> |
| <span class="source-line-no">560</span><span id="line-560"> public static <TNode extends AvlLinkedNode> TNode prepend(TNode head, TNode base, TNode node) {</span> |
| <span class="source-line-no">561</span><span id="line-561"> assert !isLinked(node) : node + " is already linked";</span> |
| <span class="source-line-no">562</span><span id="line-562"> node.iterNext = base;</span> |
| <span class="source-line-no">563</span><span id="line-563"> node.iterPrev = base.iterPrev;</span> |
| <span class="source-line-no">564</span><span id="line-564"> base.iterPrev.iterNext = node;</span> |
| <span class="source-line-no">565</span><span id="line-565"> base.iterPrev = node;</span> |
| <span class="source-line-no">566</span><span id="line-566"> return head == base ? node : head;</span> |
| <span class="source-line-no">567</span><span id="line-567"> }</span> |
| <span class="source-line-no">568</span><span id="line-568"></span> |
| <span class="source-line-no">569</span><span id="line-569"> /** Return true if the node is linked to a list, false otherwise */</span> |
| <span class="source-line-no">570</span><span id="line-570"> public static <TNode extends AvlLinkedNode> boolean isLinked(TNode node) {</span> |
| <span class="source-line-no">571</span><span id="line-571"> return node.iterPrev != null && node.iterNext != null;</span> |
| <span class="source-line-no">572</span><span id="line-572"> }</span> |
| <span class="source-line-no">573</span><span id="line-573"> }</span> |
| <span class="source-line-no">574</span><span id="line-574">}</span> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </main> |
| </body> |
| </html> |