You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2018/10/07 14:53:13 UTC
[27/47] hbase-site git commit: Published site at
118b0746849c886fc64b0a53014f3186e2db4d9d.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/9b6ca5d1/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html
deleted file mode 100644
index 9d378e8..0000000
--- a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html
+++ /dev/null
@@ -1,859 +0,0 @@
-<!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><a name="line.18"></a>
-<span class="sourceLineNo">019</span>package org.apache.hadoop.hbase.procedure2.store;<a name="line.19"></a>
-<span class="sourceLineNo">020</span><a name="line.20"></a>
-<span class="sourceLineNo">021</span>import java.io.IOException;<a name="line.21"></a>
-<span class="sourceLineNo">022</span>import java.util.Arrays;<a name="line.22"></a>
-<span class="sourceLineNo">023</span>import java.util.Iterator;<a name="line.23"></a>
-<span class="sourceLineNo">024</span>import java.util.Map;<a name="line.24"></a>
-<span class="sourceLineNo">025</span>import java.util.TreeMap;<a name="line.25"></a>
-<span class="sourceLineNo">026</span><a name="line.26"></a>
-<span class="sourceLineNo">027</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import org.apache.yetus.audience.InterfaceStability;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a name="line.29"></a>
-<span class="sourceLineNo">030</span><a name="line.30"></a>
-<span class="sourceLineNo">031</span>/**<a name="line.31"></a>
-<span class="sourceLineNo">032</span> * Keeps track of live procedures.<a name="line.32"></a>
-<span class="sourceLineNo">033</span> *<a name="line.33"></a>
-<span class="sourceLineNo">034</span> * It can be used by the ProcedureStore to identify which procedures are already<a name="line.34"></a>
-<span class="sourceLineNo">035</span> * deleted/completed to avoid the deserialization step on restart<a name="line.35"></a>
-<span class="sourceLineNo">036</span> */<a name="line.36"></a>
-<span class="sourceLineNo">037</span>@InterfaceAudience.Private<a name="line.37"></a>
-<span class="sourceLineNo">038</span>@InterfaceStability.Evolving<a name="line.38"></a>
-<span class="sourceLineNo">039</span>public class ProcedureStoreTracker {<a name="line.39"></a>
-<span class="sourceLineNo">040</span> // Key is procedure id corresponding to first bit of the bitmap.<a name="line.40"></a>
-<span class="sourceLineNo">041</span> private final TreeMap<Long, BitSetNode> map = new TreeMap<>();<a name="line.41"></a>
-<span class="sourceLineNo">042</span><a name="line.42"></a>
-<span class="sourceLineNo">043</span> /**<a name="line.43"></a>
-<span class="sourceLineNo">044</span> * If true, do not remove bits corresponding to deleted procedures. Note that this can result<a name="line.44"></a>
-<span class="sourceLineNo">045</span> * in huge bitmaps overtime.<a name="line.45"></a>
-<span class="sourceLineNo">046</span> * Currently, it's set to true only when building tracker state from logs during recovery. During<a name="line.46"></a>
-<span class="sourceLineNo">047</span> * recovery, if we are sure that a procedure has been deleted, reading its old update entries<a name="line.47"></a>
-<span class="sourceLineNo">048</span> * can be skipped.<a name="line.48"></a>
-<span class="sourceLineNo">049</span> */<a name="line.49"></a>
-<span class="sourceLineNo">050</span> private boolean keepDeletes = false;<a name="line.50"></a>
-<span class="sourceLineNo">051</span> /**<a name="line.51"></a>
-<span class="sourceLineNo">052</span> * If true, it means tracker has incomplete information about the active/deleted procedures.<a name="line.52"></a>
-<span class="sourceLineNo">053</span> * It's set to true only when recovering from old logs. See {@link #isDeleted(long)} docs to<a name="line.53"></a>
-<span class="sourceLineNo">054</span> * understand it's real use.<a name="line.54"></a>
-<span class="sourceLineNo">055</span> */<a name="line.55"></a>
-<span class="sourceLineNo">056</span> private boolean partial = false;<a name="line.56"></a>
-<span class="sourceLineNo">057</span><a name="line.57"></a>
-<span class="sourceLineNo">058</span> private long minUpdatedProcId = Long.MAX_VALUE;<a name="line.58"></a>
-<span class="sourceLineNo">059</span> private long maxUpdatedProcId = Long.MIN_VALUE;<a name="line.59"></a>
-<span class="sourceLineNo">060</span><a name="line.60"></a>
-<span class="sourceLineNo">061</span> public enum DeleteState { YES, NO, MAYBE }<a name="line.61"></a>
-<span class="sourceLineNo">062</span><a name="line.62"></a>
-<span class="sourceLineNo">063</span> /**<a name="line.63"></a>
-<span class="sourceLineNo">064</span> * A bitmap which can grow/merge with other {@link BitSetNode} (if certain conditions are met).<a name="line.64"></a>
-<span class="sourceLineNo">065</span> * Boundaries of bitmap are aligned to multiples of {@link BitSetNode#BITS_PER_WORD}. So the<a name="line.65"></a>
-<span class="sourceLineNo">066</span> * range of a {@link BitSetNode} is from [x * K, y * K) where x and y are integers, y > x and K<a name="line.66"></a>
-<span class="sourceLineNo">067</span> * is BITS_PER_WORD.<a name="line.67"></a>
-<span class="sourceLineNo">068</span> */<a name="line.68"></a>
-<span class="sourceLineNo">069</span> public static class BitSetNode {<a name="line.69"></a>
-<span class="sourceLineNo">070</span> private final static long WORD_MASK = 0xffffffffffffffffL;<a name="line.70"></a>
-<span class="sourceLineNo">071</span> private final static int ADDRESS_BITS_PER_WORD = 6;<a name="line.71"></a>
-<span class="sourceLineNo">072</span> private final static int BITS_PER_WORD = 1 << ADDRESS_BITS_PER_WORD;<a name="line.72"></a>
-<span class="sourceLineNo">073</span> private final static int MAX_NODE_SIZE = 1 << ADDRESS_BITS_PER_WORD;<a name="line.73"></a>
-<span class="sourceLineNo">074</span><a name="line.74"></a>
-<span class="sourceLineNo">075</span> /**<a name="line.75"></a>
-<span class="sourceLineNo">076</span> * Mimics {@link ProcedureStoreTracker#partial}.<a name="line.76"></a>
-<span class="sourceLineNo">077</span> */<a name="line.77"></a>
-<span class="sourceLineNo">078</span> private final boolean partial;<a name="line.78"></a>
-<span class="sourceLineNo">079</span><a name="line.79"></a>
-<span class="sourceLineNo">080</span> /* ----------------------<a name="line.80"></a>
-<span class="sourceLineNo">081</span> * | updated | deleted | meaning<a name="line.81"></a>
-<span class="sourceLineNo">082</span> * | 0 | 0 | proc exists, but hasn't been updated since last resetUpdates().<a name="line.82"></a>
-<span class="sourceLineNo">083</span> * | 1 | 0 | proc was updated (but not deleted).<a name="line.83"></a>
-<span class="sourceLineNo">084</span> * | 1 | 1 | proc was deleted.<a name="line.84"></a>
-<span class="sourceLineNo">085</span> * | 0 | 1 | proc doesn't exist (maybe never created, maybe deleted in past).<a name="line.85"></a>
-<span class="sourceLineNo">086</span> /* ----------------------<a name="line.86"></a>
-<span class="sourceLineNo">087</span> */<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> * Set of procedures which have been updated since last {@link #resetUpdates()}.<a name="line.90"></a>
-<span class="sourceLineNo">091</span> * Useful to track procedures which have been updated since last WAL write.<a name="line.91"></a>
-<span class="sourceLineNo">092</span> */<a name="line.92"></a>
-<span class="sourceLineNo">093</span> private long[] updated;<a name="line.93"></a>
-<span class="sourceLineNo">094</span> /**<a name="line.94"></a>
-<span class="sourceLineNo">095</span> * Keeps track of procedure ids which belong to this bitmap's range and have been deleted.<a name="line.95"></a>
-<span class="sourceLineNo">096</span> * This represents global state since it's not reset on WAL rolls.<a name="line.96"></a>
-<span class="sourceLineNo">097</span> */<a name="line.97"></a>
-<span class="sourceLineNo">098</span> private long[] deleted;<a name="line.98"></a>
-<span class="sourceLineNo">099</span> /**<a name="line.99"></a>
-<span class="sourceLineNo">100</span> * Offset of bitmap i.e. procedure id corresponding to first bit.<a name="line.100"></a>
-<span class="sourceLineNo">101</span> */<a name="line.101"></a>
-<span class="sourceLineNo">102</span> private long start;<a name="line.102"></a>
-<span class="sourceLineNo">103</span><a name="line.103"></a>
-<span class="sourceLineNo">104</span> public void dump() {<a name="line.104"></a>
-<span class="sourceLineNo">105</span> System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(),<a name="line.105"></a>
-<span class="sourceLineNo">106</span> getActiveMinProcId(), getActiveMaxProcId());<a name="line.106"></a>
-<span class="sourceLineNo">107</span> System.out.println("Update:");<a name="line.107"></a>
-<span class="sourceLineNo">108</span> for (int i = 0; i < updated.length; ++i) {<a name="line.108"></a>
-<span class="sourceLineNo">109</span> for (int j = 0; j < BITS_PER_WORD; ++j) {<a name="line.109"></a>
-<span class="sourceLineNo">110</span> System.out.print((updated[i] & (1L << j)) != 0 ? "1" : "0");<a name="line.110"></a>
-<span class="sourceLineNo">111</span> }<a name="line.111"></a>
-<span class="sourceLineNo">112</span> System.out.println(" " + i);<a name="line.112"></a>
-<span class="sourceLineNo">113</span> }<a name="line.113"></a>
-<span class="sourceLineNo">114</span> System.out.println();<a name="line.114"></a>
-<span class="sourceLineNo">115</span> System.out.println("Delete:");<a name="line.115"></a>
-<span class="sourceLineNo">116</span> for (int i = 0; i < deleted.length; ++i) {<a name="line.116"></a>
-<span class="sourceLineNo">117</span> for (int j = 0; j < BITS_PER_WORD; ++j) {<a name="line.117"></a>
-<span class="sourceLineNo">118</span> System.out.print((deleted[i] & (1L << j)) != 0 ? "1" : "0");<a name="line.118"></a>
-<span class="sourceLineNo">119</span> }<a name="line.119"></a>
-<span class="sourceLineNo">120</span> System.out.println(" " + i);<a name="line.120"></a>
-<span class="sourceLineNo">121</span> }<a name="line.121"></a>
-<span class="sourceLineNo">122</span> System.out.println();<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> public BitSetNode(final long procId, final boolean partial) {<a name="line.125"></a>
-<span class="sourceLineNo">126</span> start = alignDown(procId);<a name="line.126"></a>
-<span class="sourceLineNo">127</span><a name="line.127"></a>
-<span class="sourceLineNo">128</span> int count = 1;<a name="line.128"></a>
-<span class="sourceLineNo">129</span> updated = new long[count];<a name="line.129"></a>
-<span class="sourceLineNo">130</span> deleted = new long[count];<a name="line.130"></a>
-<span class="sourceLineNo">131</span> for (int i = 0; i < count; ++i) {<a name="line.131"></a>
-<span class="sourceLineNo">132</span> updated[i] = 0;<a name="line.132"></a>
-<span class="sourceLineNo">133</span> deleted[i] = partial ? 0 : WORD_MASK;<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> this.partial = partial;<a name="line.136"></a>
-<span class="sourceLineNo">137</span> updateState(procId, false);<a name="line.137"></a>
-<span class="sourceLineNo">138</span> }<a name="line.138"></a>
-<span class="sourceLineNo">139</span><a name="line.139"></a>
-<span class="sourceLineNo">140</span> protected BitSetNode(final long start, final long[] updated, final long[] deleted) {<a name="line.140"></a>
-<span class="sourceLineNo">141</span> this.start = start;<a name="line.141"></a>
-<span class="sourceLineNo">142</span> this.updated = updated;<a name="line.142"></a>
-<span class="sourceLineNo">143</span> this.deleted = deleted;<a name="line.143"></a>
-<span class="sourceLineNo">144</span> this.partial = false;<a name="line.144"></a>
-<span class="sourceLineNo">145</span> }<a name="line.145"></a>
-<span class="sourceLineNo">146</span><a name="line.146"></a>
-<span class="sourceLineNo">147</span> public BitSetNode(ProcedureProtos.ProcedureStoreTracker.TrackerNode data) {<a name="line.147"></a>
-<span class="sourceLineNo">148</span> start = data.getStartId();<a name="line.148"></a>
-<span class="sourceLineNo">149</span> int size = data.getUpdatedCount();<a name="line.149"></a>
-<span class="sourceLineNo">150</span> updated = new long[size];<a name="line.150"></a>
-<span class="sourceLineNo">151</span> deleted = new long[size];<a name="line.151"></a>
-<span class="sourceLineNo">152</span> for (int i = 0; i < size; ++i) {<a name="line.152"></a>
-<span class="sourceLineNo">153</span> updated[i] = data.getUpdated(i);<a name="line.153"></a>
-<span class="sourceLineNo">154</span> deleted[i] = data.getDeleted(i);<a name="line.154"></a>
-<span class="sourceLineNo">155</span> }<a name="line.155"></a>
-<span class="sourceLineNo">156</span> partial = false;<a name="line.156"></a>
-<span class="sourceLineNo">157</span> }<a name="line.157"></a>
-<span class="sourceLineNo">158</span><a name="line.158"></a>
-<span class="sourceLineNo">159</span> public BitSetNode(final BitSetNode other, final boolean resetDelete) {<a name="line.159"></a>
-<span class="sourceLineNo">160</span> this.start = other.start;<a name="line.160"></a>
-<span class="sourceLineNo">161</span> this.partial = other.partial;<a name="line.161"></a>
-<span class="sourceLineNo">162</span> this.updated = other.updated.clone();<a name="line.162"></a>
-<span class="sourceLineNo">163</span> if (resetDelete) {<a name="line.163"></a>
-<span class="sourceLineNo">164</span> this.deleted = new long[other.deleted.length];<a name="line.164"></a>
-<span class="sourceLineNo">165</span> for (int i = 0; i < this.deleted.length; ++i) {<a name="line.165"></a>
-<span class="sourceLineNo">166</span> this.deleted[i] = ~(other.updated[i]);<a name="line.166"></a>
-<span class="sourceLineNo">167</span> }<a name="line.167"></a>
-<span class="sourceLineNo">168</span> } else {<a name="line.168"></a>
-<span class="sourceLineNo">169</span> this.deleted = other.deleted.clone();<a name="line.169"></a>
-<span class="sourceLineNo">170</span> }<a name="line.170"></a>
-<span class="sourceLineNo">171</span> }<a name="line.171"></a>
-<span class="sourceLineNo">172</span><a name="line.172"></a>
-<span class="sourceLineNo">173</span> public void update(final long procId) {<a name="line.173"></a>
-<span class="sourceLineNo">174</span> updateState(procId, false);<a name="line.174"></a>
-<span class="sourceLineNo">175</span> }<a name="line.175"></a>
-<span class="sourceLineNo">176</span><a name="line.176"></a>
-<span class="sourceLineNo">177</span> public void delete(final long procId) {<a name="line.177"></a>
-<span class="sourceLineNo">178</span> updateState(procId, true);<a name="line.178"></a>
-<span class="sourceLineNo">179</span> }<a name="line.179"></a>
-<span class="sourceLineNo">180</span><a name="line.180"></a>
-<span class="sourceLineNo">181</span> public long getStart() {<a name="line.181"></a>
-<span class="sourceLineNo">182</span> return start;<a name="line.182"></a>
-<span class="sourceLineNo">183</span> }<a name="line.183"></a>
-<span class="sourceLineNo">184</span><a name="line.184"></a>
-<span class="sourceLineNo">185</span> public long getEnd() {<a name="line.185"></a>
-<span class="sourceLineNo">186</span> return start + (updated.length << ADDRESS_BITS_PER_WORD) - 1;<a name="line.186"></a>
-<span class="sourceLineNo">187</span> }<a name="line.187"></a>
-<span class="sourceLineNo">188</span><a name="line.188"></a>
-<span class="sourceLineNo">189</span> public boolean contains(final long procId) {<a name="line.189"></a>
-<span class="sourceLineNo">190</span> return start <= procId && procId <= getEnd();<a name="line.190"></a>
-<span class="sourceLineNo">191</span> }<a name="line.191"></a>
-<span class="sourceLineNo">192</span><a name="line.192"></a>
-<span class="sourceLineNo">193</span> public DeleteState isDeleted(final long procId) {<a name="line.193"></a>
-<span class="sourceLineNo">194</span> int bitmapIndex = getBitmapIndex(procId);<a name="line.194"></a>
-<span class="sourceLineNo">195</span> int wordIndex = bitmapIndex >> ADDRESS_BITS_PER_WORD;<a name="line.195"></a>
-<span class="sourceLineNo">196</span> if (wordIndex >= deleted.length) {<a name="line.196"></a>
-<span class="sourceLineNo">197</span> return DeleteState.MAYBE;<a name="line.197"></a>
-<span class="sourceLineNo">198</span> }<a name="line.198"></a>
-<span class="sourceLineNo">199</span> return (deleted[wordIndex] & (1L << bitmapIndex)) != 0 ? DeleteState.YES : DeleteState.NO;<a name="line.199"></a>
-<span class="sourceLineNo">200</span> }<a name="line.200"></a>
-<span class="sourceLineNo">201</span><a name="line.201"></a>
-<span class="sourceLineNo">202</span> private boolean isUpdated(final long procId) {<a name="line.202"></a>
-<span class="sourceLineNo">203</span> int bitmapIndex = getBitmapIndex(procId);<a name="line.203"></a>
-<span class="sourceLineNo">204</span> int wordIndex = bitmapIndex >> ADDRESS_BITS_PER_WORD;<a name="line.204"></a>
-<span class="sourceLineNo">205</span> if (wordIndex >= updated.length) {<a name="line.205"></a>
-<span class="sourceLineNo">206</span> return false;<a name="line.206"></a>
-<span class="sourceLineNo">207</span> }<a name="line.207"></a>
-<span class="sourceLineNo">208</span> return (updated[wordIndex] & (1L << bitmapIndex)) != 0;<a name="line.208"></a>
-<span class="sourceLineNo">209</span> }<a name="line.209"></a>
-<span class="sourceLineNo">210</span><a name="line.210"></a>
-<span class="sourceLineNo">211</span> public boolean isUpdated() {<a name="line.211"></a>
-<span class="sourceLineNo">212</span> // TODO: cache the value<a name="line.212"></a>
-<span class="sourceLineNo">213</span> for (int i = 0; i < updated.length; ++i) {<a name="line.213"></a>
-<span class="sourceLineNo">214</span> if ((updated[i] | deleted[i]) != WORD_MASK) {<a name="line.214"></a>
-<span class="sourceLineNo">215</span> return false;<a name="line.215"></a>
-<span class="sourceLineNo">216</span> }<a name="line.216"></a>
-<span class="sourceLineNo">217</span> }<a name="line.217"></a>
-<span class="sourceLineNo">218</span> return true;<a name="line.218"></a>
-<span class="sourceLineNo">219</span> }<a name="line.219"></a>
-<span class="sourceLineNo">220</span><a name="line.220"></a>
-<span class="sourceLineNo">221</span> /**<a name="line.221"></a>
-<span class="sourceLineNo">222</span> * @return true, if there are no active procedures in this BitSetNode, else false.<a name="line.222"></a>
-<span class="sourceLineNo">223</span> */<a name="line.223"></a>
-<span class="sourceLineNo">224</span> public boolean isEmpty() {<a name="line.224"></a>
-<span class="sourceLineNo">225</span> // TODO: cache the value<a name="line.225"></a>
-<span class="sourceLineNo">226</span> for (int i = 0; i < deleted.length; ++i) {<a name="line.226"></a>
-<span class="sourceLineNo">227</span> if (deleted[i] != WORD_MASK) {<a name="line.227"></a>
-<span class="sourceLineNo">228</span> return false;<a name="line.228"></a>
-<span class="sourceLineNo">229</span> }<a name="line.229"></a>
-<span class="sourceLineNo">230</span> }<a name="line.230"></a>
-<span class="sourceLineNo">231</span> return true;<a name="line.231"></a>
-<span class="sourceLineNo">232</span> }<a name="line.232"></a>
-<span class="sourceLineNo">233</span><a name="line.233"></a>
-<span class="sourceLineNo">234</span> public void resetUpdates() {<a name="line.234"></a>
-<span class="sourceLineNo">235</span> for (int i = 0; i < updated.length; ++i) {<a name="line.235"></a>
-<span class="sourceLineNo">236</span> updated[i] = 0;<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><a name="line.239"></a>
-<span class="sourceLineNo">240</span> /**<a name="line.240"></a>
-<span class="sourceLineNo">241</span> * Clears the {@link #deleted} bitmaps.<a name="line.241"></a>
-<span class="sourceLineNo">242</span> */<a name="line.242"></a>
-<span class="sourceLineNo">243</span> public void undeleteAll() {<a name="line.243"></a>
-<span class="sourceLineNo">244</span> for (int i = 0; i < updated.length; ++i) {<a name="line.244"></a>
-<span class="sourceLineNo">245</span> deleted[i] = 0;<a name="line.245"></a>
-<span class="sourceLineNo">246</span> }<a name="line.246"></a>
-<span class="sourceLineNo">247</span> }<a name="line.247"></a>
-<span class="sourceLineNo">248</span><a name="line.248"></a>
-<span class="sourceLineNo">249</span> public void unsetPartialFlag() {<a name="line.249"></a>
-<span class="sourceLineNo">250</span> for (int i = 0; i < updated.length; ++i) {<a name="line.250"></a>
-<span class="sourceLineNo">251</span> for (int j = 0; j < BITS_PER_WORD; ++j) {<a name="line.251"></a>
-<span class="sourceLineNo">252</span> if ((updated[i] & (1L << j)) == 0) {<a name="line.252"></a>
-<span class="sourceLineNo">253</span> deleted[i] |= (1L << j);<a name="line.253"></a>
-<span class="sourceLineNo">254</span> }<a name="line.254"></a>
-<span class="sourceLineNo">255</span> }<a name="line.255"></a>
-<span class="sourceLineNo">256</span> }<a name="line.256"></a>
-<span class="sourceLineNo">257</span> }<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> * Convert to<a name="line.260"></a>
-<span class="sourceLineNo">261</span> * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker.TrackerNode<a name="line.261"></a>
-<span class="sourceLineNo">262</span> * protobuf.<a name="line.262"></a>
-<span class="sourceLineNo">263</span> */<a name="line.263"></a>
-<span class="sourceLineNo">264</span> public ProcedureProtos.ProcedureStoreTracker.TrackerNode convert() {<a name="line.264"></a>
-<span class="sourceLineNo">265</span> ProcedureProtos.ProcedureStoreTracker.TrackerNode.Builder builder =<a name="line.265"></a>
-<span class="sourceLineNo">266</span> ProcedureProtos.ProcedureStoreTracker.TrackerNode.newBuilder();<a name="line.266"></a>
-<span class="sourceLineNo">267</span> builder.setStartId(start);<a name="line.267"></a>
-<span class="sourceLineNo">268</span> for (int i = 0; i < updated.length; ++i) {<a name="line.268"></a>
-<span class="sourceLineNo">269</span> builder.addUpdated(updated[i]);<a name="line.269"></a>
-<span class="sourceLineNo">270</span> builder.addDeleted(deleted[i]);<a name="line.270"></a>
-<span class="sourceLineNo">271</span> }<a name="line.271"></a>
-<span class="sourceLineNo">272</span> return builder.build();<a name="line.272"></a>
-<span class="sourceLineNo">273</span> }<a name="line.273"></a>
-<span class="sourceLineNo">274</span><a name="line.274"></a>
-<span class="sourceLineNo">275</span> // ========================================================================<a name="line.275"></a>
-<span class="sourceLineNo">276</span> // Grow/Merge Helpers<a name="line.276"></a>
-<span class="sourceLineNo">277</span> // ========================================================================<a name="line.277"></a>
-<span class="sourceLineNo">278</span> public boolean canGrow(final long procId) {<a name="line.278"></a>
-<span class="sourceLineNo">279</span> return Math.abs(procId - start) < MAX_NODE_SIZE;<a name="line.279"></a>
-<span class="sourceLineNo">280</span> }<a name="line.280"></a>
-<span class="sourceLineNo">281</span><a name="line.281"></a>
-<span class="sourceLineNo">282</span> public boolean canMerge(final BitSetNode rightNode) {<a name="line.282"></a>
-<span class="sourceLineNo">283</span> // Can just compare 'starts' since boundaries are aligned to multiples of BITS_PER_WORD.<a name="line.283"></a>
-<span class="sourceLineNo">284</span> assert start < rightNode.start;<a name="line.284"></a>
-<span class="sourceLineNo">285</span> return (rightNode.getEnd() - start) < MAX_NODE_SIZE;<a name="line.285"></a>
-<span class="sourceLineNo">286</span> }<a name="line.286"></a>
-<span class="sourceLineNo">287</span><a name="line.287"></a>
-<span class="sourceLineNo">288</span> public void grow(final long procId) {<a name="line.288"></a>
-<span class="sourceLineNo">289</span> int delta, offset;<a name="line.289"></a>
-<span class="sourceLineNo">290</span><a name="line.290"></a>
-<span class="sourceLineNo">291</span> if (procId < start) {<a name="line.291"></a>
-<span class="sourceLineNo">292</span> // add to head<a name="line.292"></a>
-<span class="sourceLineNo">293</span> long newStart = alignDown(procId);<a name="line.293"></a>
-<span class="sourceLineNo">294</span> delta = (int)(start - newStart) >> ADDRESS_BITS_PER_WORD;<a name="line.294"></a>
-<span class="sourceLineNo">295</span> offset = delta;<a name="line.295"></a>
-<span class="sourceLineNo">296</span> start = newStart;<a name="line.296"></a>
-<span class="sourceLineNo">297</span> } else {<a name="line.297"></a>
-<span class="sourceLineNo">298</span> // Add to tail<a name="line.298"></a>
-<span class="sourceLineNo">299</span> long newEnd = alignUp(procId + 1);<a name="line.299"></a>
-<span class="sourceLineNo">300</span> delta = (int)(newEnd - getEnd()) >> ADDRESS_BITS_PER_WORD;<a name="line.300"></a>
-<span class="sourceLineNo">301</span> offset = 0;<a name="line.301"></a>
-<span class="sourceLineNo">302</span> }<a name="line.302"></a>
-<span class="sourceLineNo">303</span><a name="line.303"></a>
-<span class="sourceLineNo">304</span> long[] newBitmap;<a name="line.304"></a>
-<span class="sourceLineNo">305</span> int oldSize = updated.length;<a name="line.305"></a>
-<span class="sourceLineNo">306</span><a name="line.306"></a>
-<span class="sourceLineNo">307</span> newBitmap = new long[oldSize + delta];<a name="line.307"></a>
-<span class="sourceLineNo">308</span> for (int i = 0; i < newBitmap.length; ++i) {<a name="line.308"></a>
-<span class="sourceLineNo">309</span> newBitmap[i] = 0;<a name="line.309"></a>
-<span class="sourceLineNo">310</span> }<a name="line.310"></a>
-<span class="sourceLineNo">311</span> System.arraycopy(updated, 0, newBitmap, offset, oldSize);<a name="line.311"></a>
-<span class="sourceLineNo">312</span> updated = newBitmap;<a name="line.312"></a>
-<span class="sourceLineNo">313</span><a name="line.313"></a>
-<span class="sourceLineNo">314</span> newBitmap = new long[deleted.length + delta];<a name="line.314"></a>
-<span class="sourceLineNo">315</span> for (int i = 0; i < newBitmap.length; ++i) {<a name="line.315"></a>
-<span class="sourceLineNo">316</span> newBitmap[i] = partial ? 0 : WORD_MASK;<a name="line.316"></a>
-<span class="sourceLineNo">317</span> }<a name="line.317"></a>
-<span class="sourceLineNo">318</span> System.arraycopy(deleted, 0, newBitmap, offset, oldSize);<a name="line.318"></a>
-<span class="sourceLineNo">319</span> deleted = newBitmap;<a name="line.319"></a>
-<span class="sourceLineNo">320</span> }<a name="line.320"></a>
-<span class="sourceLineNo">321</span><a name="line.321"></a>
-<span class="sourceLineNo">322</span> public void merge(final BitSetNode rightNode) {<a name="line.322"></a>
-<span class="sourceLineNo">323</span> int delta = (int)(rightNode.getEnd() - getEnd()) >> ADDRESS_BITS_PER_WORD;<a name="line.323"></a>
-<span class="sourceLineNo">324</span><a name="line.324"></a>
-<span class="sourceLineNo">325</span> long[] newBitmap;<a name="line.325"></a>
-<span class="sourceLineNo">326</span> int oldSize = updated.length;<a name="line.326"></a>
-<span class="sourceLineNo">327</span> int newSize = (delta - rightNode.updated.length);<a name="line.327"></a>
-<span class="sourceLineNo">328</span> int offset = oldSize + newSize;<a name="line.328"></a>
-<span class="sourceLineNo">329</span><a name="line.329"></a>
-<span class="sourceLineNo">330</span> newBitmap = new long[oldSize + delta];<a name="line.330"></a>
-<span class="sourceLineNo">331</span> System.arraycopy(updated, 0, newBitmap, 0, oldSize);<a name="line.331"></a>
-<span class="sourceLineNo">332</span> System.arraycopy(rightNode.updated, 0, newBitmap, offset, rightNode.updated.length);<a name="line.332"></a>
-<span class="sourceLineNo">333</span> updated = newBitmap;<a name="line.333"></a>
-<span class="sourceLineNo">334</span><a name="line.334"></a>
-<span class="sourceLineNo">335</span> newBitmap = new long[oldSize + delta];<a name="line.335"></a>
-<span class="sourceLineNo">336</span> System.arraycopy(deleted, 0, newBitmap, 0, oldSize);<a name="line.336"></a>
-<span class="sourceLineNo">337</span> System.arraycopy(rightNode.deleted, 0, newBitmap, offset, rightNode.deleted.length);<a name="line.337"></a>
-<span class="sourceLineNo">338</span> deleted = newBitmap;<a name="line.338"></a>
-<span class="sourceLineNo">339</span><a name="line.339"></a>
-<span class="sourceLineNo">340</span> for (int i = 0; i < newSize; ++i) {<a name="line.340"></a>
-<span class="sourceLineNo">341</span> updated[offset + i] = 0;<a name="line.341"></a>
-<span class="sourceLineNo">342</span> deleted[offset + i] = partial ? 0 : WORD_MASK;<a name="line.342"></a>
-<span class="sourceLineNo">343</span> }<a name="line.343"></a>
-<span class="sourceLineNo">344</span> }<a name="line.344"></a>
-<span class="sourceLineNo">345</span><a name="line.345"></a>
-<span class="sourceLineNo">346</span> @Override<a name="line.346"></a>
-<span class="sourceLineNo">347</span> public String toString() {<a name="line.347"></a>
-<span class="sourceLineNo">348</span> return "BitSetNode(" + getStart() + "-" + getEnd() + ")";<a name="line.348"></a>
-<span class="sourceLineNo">349</span> }<a name="line.349"></a>
-<span class="sourceLineNo">350</span><a name="line.350"></a>
-<span class="sourceLineNo">351</span> // ========================================================================<a name="line.351"></a>
-<span class="sourceLineNo">352</span> // Min/Max Helpers<a name="line.352"></a>
-<span class="sourceLineNo">353</span> // ========================================================================<a name="line.353"></a>
-<span class="sourceLineNo">354</span> public long getActiveMinProcId() {<a name="line.354"></a>
-<span class="sourceLineNo">355</span> long minProcId = start;<a name="line.355"></a>
-<span class="sourceLineNo">356</span> for (int i = 0; i < deleted.length; ++i) {<a name="line.356"></a>
-<span class="sourceLineNo">357</span> if (deleted[i] == 0) {<a name="line.357"></a>
-<span class="sourceLineNo">358</span> return(minProcId);<a name="line.358"></a>
-<span class="sourceLineNo">359</span> }<a name="line.359"></a>
-<span class="sourceLineNo">360</span><a name="line.360"></a>
-<span class="sourceLineNo">361</span> if (deleted[i] != WORD_MASK) {<a name="line.361"></a>
-<span class="sourceLineNo">362</span> for (int j = 0; j < BITS_PER_WORD; ++j) {<a name="line.362"></a>
-<span class="sourceLineNo">363</span> if ((deleted[i] & (1L << j)) != 0) {<a name="line.363"></a>
-<span class="sourceLineNo">364</span> return minProcId + j;<a name="line.364"></a>
-<span class="sourceLineNo">365</span> }<a name="line.365"></a>
-<span class="sourceLineNo">366</span> }<a name="line.366"></a>
-<span class="sourceLineNo">367</span> }<a name="line.367"></a>
-<span class="sourceLineNo">368</span><a name="line.368"></a>
-<span class="sourceLineNo">369</span> minProcId += BITS_PER_WORD;<a name="line.369"></a>
-<span class="sourceLineNo">370</span> }<a name="line.370"></a>
-<span class="sourceLineNo">371</span> return minProcId;<a name="line.371"></a>
-<span class="sourceLineNo">372</span> }<a name="line.372"></a>
-<span class="sourceLineNo">373</span><a name="line.373"></a>
-<span class="sourceLineNo">374</span> public long getActiveMaxProcId() {<a name="line.374"></a>
-<span class="sourceLineNo">375</span> long maxProcId = getEnd();<a name="line.375"></a>
-<span class="sourceLineNo">376</span> for (int i = deleted.length - 1; i >= 0; --i) {<a name="line.376"></a>
-<span class="sourceLineNo">377</span> if (deleted[i] == 0) {<a name="line.377"></a>
-<span class="sourceLineNo">378</span> return maxProcId;<a name="line.378"></a>
-<span class="sourceLineNo">379</span> }<a name="line.379"></a>
-<span class="sourceLineNo">380</span><a name="line.380"></a>
-<span class="sourceLineNo">381</span> if (deleted[i] != WORD_MASK) {<a name="line.381"></a>
-<span class="sourceLineNo">382</span> for (int j = BITS_PER_WORD - 1; j >= 0; --j) {<a name="line.382"></a>
-<span class="sourceLineNo">383</span> if ((deleted[i] & (1L << j)) == 0) {<a name="line.383"></a>
-<span class="sourceLineNo">384</span> return maxProcId - (BITS_PER_WORD - 1 - j);<a name="line.384"></a>
-<span class="sourceLineNo">385</span> }<a name="line.385"></a>
-<span class="sourceLineNo">386</span> }<a name="line.386"></a>
-<span class="sourceLineNo">387</span> }<a name="line.387"></a>
-<span class="sourceLineNo">388</span> maxProcId -= BITS_PER_WORD;<a name="line.388"></a>
-<span class="sourceLineNo">389</span> }<a name="line.389"></a>
-<span class="sourceLineNo">390</span> return maxProcId;<a name="line.390"></a>
-<span class="sourceLineNo">391</span> }<a name="line.391"></a>
-<span class="sourceLineNo">392</span><a name="line.392"></a>
-<span class="sourceLineNo">393</span> // ========================================================================<a name="line.393"></a>
-<span class="sourceLineNo">394</span> // Bitmap Helpers<a name="line.394"></a>
-<span class="sourceLineNo">395</span> // ========================================================================<a name="line.395"></a>
-<span class="sourceLineNo">396</span> private int getBitmapIndex(final long procId) {<a name="line.396"></a>
-<span class="sourceLineNo">397</span> return (int)(procId - start);<a name="line.397"></a>
-<span class="sourceLineNo">398</span> }<a name="line.398"></a>
-<span class="sourceLineNo">399</span><a name="line.399"></a>
-<span class="sourceLineNo">400</span> private void updateState(final long procId, final boolean isDeleted) {<a name="line.400"></a>
-<span class="sourceLineNo">401</span> int bitmapIndex = getBitmapIndex(procId);<a name="line.401"></a>
-<span class="sourceLineNo">402</span> int wordIndex = bitmapIndex >> ADDRESS_BITS_PER_WORD;<a name="line.402"></a>
-<span class="sourceLineNo">403</span> long value = (1L << bitmapIndex);<a name="line.403"></a>
-<span class="sourceLineNo">404</span><a name="line.404"></a>
-<span class="sourceLineNo">405</span> updated[wordIndex] |= value;<a name="line.405"></a>
-<span class="sourceLineNo">406</span> if (isDeleted) {<a name="line.406"></a>
-<span class="sourceLineNo">407</span> deleted[wordIndex] |= value;<a name="line.407"></a>
-<span class="sourceLineNo">408</span> } else {<a name="line.408"></a>
-<span class="sourceLineNo">409</span> deleted[wordIndex] &= ~value;<a name="line.409"></a>
-<span class="sourceLineNo">410</span> }<a name="line.410"></a>
-<span class="sourceLineNo">411</span> }<a name="line.411"></a>
-<span class="sourceLineNo">412</span><a name="line.412"></a>
-<span class="sourceLineNo">413</span><a name="line.413"></a>
-<span class="sourceLineNo">414</span> // ========================================================================<a name="line.414"></a>
-<span class="sourceLineNo">415</span> // Helpers<a name="line.415"></a>
-<span class="sourceLineNo">416</span> // ========================================================================<a name="line.416"></a>
-<span class="sourceLineNo">417</span> /**<a name="line.417"></a>
-<span class="sourceLineNo">418</span> * @return upper boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.418"></a>
-<span class="sourceLineNo">419</span> */<a name="line.419"></a>
-<span class="sourceLineNo">420</span> private static long alignUp(final long x) {<a name="line.420"></a>
-<span class="sourceLineNo">421</span> return (x + (BITS_PER_WORD - 1)) & -BITS_PER_WORD;<a name="line.421"></a>
-<span class="sourceLineNo">422</span> }<a name="line.422"></a>
-<span class="sourceLineNo">423</span><a name="line.423"></a>
-<span class="sourceLineNo">424</span> /**<a name="line.424"></a>
-<span class="sourceLineNo">425</span> * @return lower boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.425"></a>
-<span class="sourceLineNo">426</span> */<a name="line.426"></a>
-<span class="sourceLineNo">427</span> private static long alignDown(final long x) {<a name="line.427"></a>
-<span class="sourceLineNo">428</span> return x & -BITS_PER_WORD;<a name="line.428"></a>
-<span class="sourceLineNo">429</span> }<a name="line.429"></a>
-<span class="sourceLineNo">430</span> }<a name="line.430"></a>
-<span class="sourceLineNo">431</span><a name="line.431"></a>
-<span class="sourceLineNo">432</span> public void resetToProto(final ProcedureProtos.ProcedureStoreTracker trackerProtoBuf) {<a name="line.432"></a>
-<span class="sourceLineNo">433</span> reset();<a name="line.433"></a>
-<span class="sourceLineNo">434</span> for (ProcedureProtos.ProcedureStoreTracker.TrackerNode protoNode: trackerProtoBuf.getNodeList()) {<a name="line.434"></a>
-<span class="sourceLineNo">435</span> final BitSetNode node = new BitSetNode(protoNode);<a name="line.435"></a>
-<span class="sourceLineNo">436</span> map.put(node.getStart(), node);<a name="line.436"></a>
-<span class="sourceLineNo">437</span> }<a name="line.437"></a>
-<span class="sourceLineNo">438</span> }<a name="line.438"></a>
-<span class="sourceLineNo">439</span><a name="line.439"></a>
-<span class="sourceLineNo">440</span> /**<a name="line.440"></a>
-<span class="sourceLineNo">441</span> * Resets internal state to same as given {@code tracker}. Does deep copy of the bitmap.<a name="line.441"></a>
-<span class="sourceLineNo">442</span> */<a name="line.442"></a>
-<span class="sourceLineNo">443</span> public void resetTo(final ProcedureStoreTracker tracker) {<a name="line.443"></a>
-<span class="sourceLineNo">444</span> resetTo(tracker, false);<a name="line.444"></a>
-<span class="sourceLineNo">445</span> }<a name="line.445"></a>
-<span class="sourceLineNo">446</span><a name="line.446"></a>
-<span class="sourceLineNo">447</span> public void resetTo(final ProcedureStoreTracker tracker, final boolean resetDelete) {<a name="line.447"></a>
-<span class="sourceLineNo">448</span> this.partial = tracker.partial;<a name="line.448"></a>
-<span class="sourceLineNo">449</span> this.minUpdatedProcId = tracker.minUpdatedProcId;<a name="line.449"></a>
-<span class="sourceLineNo">450</span> this.maxUpdatedProcId = tracker.maxUpdatedProcId;<a name="line.450"></a>
-<span class="sourceLineNo">451</span> this.keepDeletes = tracker.keepDeletes;<a name="line.451"></a>
-<span class="sourceLineNo">452</span> for (Map.Entry<Long, BitSetNode> entry : tracker.map.entrySet()) {<a name="line.452"></a>
-<span class="sourceLineNo">453</span> map.put(entry.getKey(), new BitSetNode(entry.getValue(), resetDelete));<a name="line.453"></a>
-<span class="sourceLineNo">454</span> }<a name="line.454"></a>
-<span class="sourceLineNo">455</span> }<a name="line.455"></a>
-<span class="sourceLineNo">456</span><a name="line.456"></a>
-<span class="sourceLineNo">457</span> public void insert(long procId) {<a name="line.457"></a>
-<span class="sourceLineNo">458</span> insert(null, procId);<a name="line.458"></a>
-<span class="sourceLineNo">459</span> }<a name="line.459"></a>
-<span class="sourceLineNo">460</span><a name="line.460"></a>
-<span class="sourceLineNo">461</span> public void insert(final long[] procIds) {<a name="line.461"></a>
-<span class="sourceLineNo">462</span> for (int i = 0; i < procIds.length; ++i) {<a name="line.462"></a>
-<span class="sourceLineNo">463</span> insert(procIds[i]);<a name="line.463"></a>
-<span class="sourceLineNo">464</span> }<a name="line.464"></a>
-<span class="sourceLineNo">465</span> }<a name="line.465"></a>
-<span class="sourceLineNo">466</span><a name="line.466"></a>
-<span class="sourceLineNo">467</span> public void insert(final long procId, final long[] subProcIds) {<a name="line.467"></a>
-<span class="sourceLineNo">468</span> BitSetNode node = null;<a name="line.468"></a>
-<span class="sourceLineNo">469</span> node = update(node, procId);<a name="line.469"></a>
-<span class="sourceLineNo">470</span> for (int i = 0; i < subProcIds.length; ++i) {<a name="line.470"></a>
-<span class="sourceLineNo">471</span> node = insert(node, subProcIds[i]);<a name="line.471"></a>
-<span class="sourceLineNo">472</span> }<a name="line.472"></a>
-<span class="sourceLineNo">473</span> }<a name="line.473"></a>
-<span class="sourceLineNo">474</span><a name="line.474"></a>
-<span class="sourceLineNo">475</span> private BitSetNode insert(BitSetNode node, final long procId) {<a name="line.475"></a>
-<span class="sourceLineNo">476</span> if (node == null || !node.contains(procId)) {<a name="line.476"></a>
-<span class="sourceLineNo">477</span> node = getOrCreateNode(procId);<a name="line.477"></a>
-<span class="sourceLineNo">478</span> }<a name="line.478"></a>
-<span class="sourceLineNo">479</span> node.update(procId);<a name="line.479"></a>
-<span class="sourceLineNo">480</span> trackProcIds(procId);<a name="line.480"></a>
-<span class="sourceLineNo">481</span> return node;<a name="line.481"></a>
-<span class="sourceLineNo">482</span> }<a name="line.482"></a>
-<span class="sourceLineNo">483</span><a name="line.483"></a>
-<span class="sourceLineNo">484</span> public void update(long procId) {<a name="line.484"></a>
-<span class="sourceLineNo">485</span> update(null, procId);<a name="line.485"></a>
-<span class="sourceLineNo">486</span> }<a name="line.486"></a>
-<span class="sourceLineNo">487</span><a name="line.487"></a>
-<span class="sourceLineNo">488</span> private BitSetNode update(BitSetNode node, final long procId) {<a name="line.488"></a>
-<span class="sourceLineNo">489</span> node = lookupClosestNode(node, procId);<a name="line.489"></a>
-<span class="sourceLineNo">490</span> assert node != null : "expected node to update procId=" + procId;<a name="line.490"></a>
-<span class="sourceLineNo">491</span> assert node.contains(procId) : "expected procId=" + procId + " in the node";<a name="line.491"></a>
-<span class="sourceLineNo">492</span> node.update(procId);<a name="line.492"></a>
-<span class="sourceLineNo">493</span> trackProcIds(procId);<a name="line.493"></a>
-<span class="sourceLineNo">494</span> return node;<a name="line.494"></a>
-<span class="sourceLineNo">495</span> }<a name="line.495"></a>
-<span class="sourceLineNo">496</span><a name="line.496"></a>
-<span class="sourceLineNo">497</span> public void delete(long procId) {<a name="line.497"></a>
-<span class="sourceLineNo">498</span> delete(null, procId);<a name="line.498"></a>
-<span class="sourceLineNo">499</span> }<a name="line.499"></a>
-<span class="sourceLineNo">500</span><a name="line.500"></a>
-<span class="sourceLineNo">501</span> public void delete(final long[] procIds) {<a name="line.501"></a>
-<span class="sourceLineNo">502</span> Arrays.sort(procIds);<a name="line.502"></a>
-<span class="sourceLineNo">503</span> BitSetNode node = null;<a name="line.503"></a>
-<span class="sourceLineNo">504</span> for (int i = 0; i < procIds.length; ++i) {<a name="line.504"></a>
-<span class="sourceLineNo">505</span> node = delete(node, procIds[i]);<a name="line.505"></a>
-<span class="sourceLineNo">506</span> }<a name="line.506"></a>
-<span class="sourceLineNo">507</span> }<a name="line.507"></a>
-<span class="sourceLineNo">508</span><a name="line.508"></a>
-<span class="sourceLineNo">509</span> private BitSetNode delete(BitSetNode node, final long procId) {<a name="line.509"></a>
-<span class="sourceLineNo">510</span> node = lookupClosestNode(node, procId);<a name="line.510"></a>
-<span class="sourceLineNo">511</span> assert node != null : "expected node to delete procId=" + procId;<a name="line.511"></a>
-<span class="sourceLineNo">512</span> assert node.contains(procId) : "expected procId=" + procId + " in the node";<a name="line.512"></a>
-<span class="sourceLineNo">513</span> node.delete(procId);<a name="line.513"></a>
-<span class="sourceLineNo">514</span> if (!keepDeletes && node.isEmpty()) {<a name="line.514"></a>
-<span class="sourceLineNo">515</span> // TODO: RESET if (map.size() == 1)<a name="line.515"></a>
-<span class="sourceLineNo">516</span> map.remove(node.getStart());<a name="line.516"></a>
-<span class="sourceLineNo">517</span> }<a name="line.517"></a>
-<span class="sourceLineNo">518</span><a name="line.518"></a>
-<span class="sourceLineNo">519</span> trackProcIds(procId);<a name="line.519"></a>
-<span class="sourceLineNo">520</span> return node;<a name="line.520"></a>
-<span class="sourceLineNo">521</span> }<a name="line.521"></a>
-<span class="sourceLineNo">522</span><a name="line.522"></a>
-<span class="sourceLineNo">523</span> @InterfaceAudience.Private<a name="line.523"></a>
-<span class="sourceLineNo">524</span> public void setDeleted(final long procId, final boolean isDeleted) {<a name="line.524"></a>
-<span class="sourceLineNo">525</span> BitSetNode node = getOrCreateNode(procId);<a name="line.525"></a>
-<span class="sourceLineNo">526</span> assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node;<a name="line.526"></a>
-<span class="sourceLineNo">527</span> node.updateState(procId, isDeleted);<a name="line.527"></a>
-<span class="sourceLineNo">528</span> trackProcIds(procId);<a name="line.528"></a>
-<span class="sourceLineNo">529</span> }<a name="line.529"></a>
-<span class="sourceLineNo">530</span><a name="line.530"></a>
-<span class="sourceLineNo">531</span> public void setDeletedIfSet(final long... procId) {<a name="line.531"></a>
-<span class="sourceLineNo">532</span> BitSetNode node = null;<a name="line.532"></a>
-<span class="sourceLineNo">533</span> for (int i = 0; i < procId.length; ++i) {<a name="line.533"></a>
-<span class="sourceLineNo">534</span> node = lookupClosestNode(node, procId[i]);<a name="line.534"></a>
-<span class="sourceLineNo">535</span> if (node != null && node.isUpdated(procId[i])) {<a name="line.535"></a>
-<span class="sourceLineNo">536</span> node.delete(procId[i]);<a name="line.536"></a>
-<span class="sourceLineNo">537</span> }<a name="line.537"></a>
-<span class="sourceLineNo">538</span> }<a name="line.538"></a>
-<span class="sourceLineNo">539</span> }<a name="line.539"></a>
-<span class="sourceLineNo">540</span><a name="line.540"></a>
-<span class="sourceLineNo">541</span> public void setDeletedIfSet(final ProcedureStoreTracker tracker) {<a name="line.541"></a>
-<span class="sourceLineNo">542</span> BitSetNode trackerNode = null;<a name="line.542"></a>
-<span class="sourceLineNo">543</span> for (BitSetNode node: map.values()) {<a name="line.543"></a>
-<span class="sourceLineNo">544</span> final long minProcId = node.getStart();<a name="line.544"></a>
-<span class="sourceLineNo">545</span> final long maxProcId = node.getEnd();<a name="line.545"></a>
-<span class="sourceLineNo">546</span> for (long procId = minProcId; procId <= maxProcId; ++procId) {<a name="line.546"></a>
-<span class="sourceLineNo">547</span> if (!node.isUpdated(procId)) continue;<a name="line.547"></a>
-<span class="sourceLineNo">548</span><a name="line.548"></a>
-<span class="sourceLineNo">549</span> trackerNode = tracker.lookupClosestNode(trackerNode, procId);<a name="line.549"></a>
-<span class="sourceLineNo">550</span> if (trackerNode == null || !trackerNode.contains(procId) || trackerNode.isUpdated(procId)) {<a name="line.550"></a>
-<span class="sourceLineNo">551</span> // the procedure was removed or updated<a name="line.551"></a>
-<span class="sourceLineNo">552</span> node.delete(procId);<a name="line.552"></a>
-<span class="sourceLineNo">553</span> }<a name="line.553"></a>
-<span class="sourceLineNo">554</span> }<a name="line.554"></a>
-<span class="sourceLineNo">555</span> }<a name="line.555"></a>
-<span class="sourceLineNo">556</span> }<a name="line.556"></a>
-<span class="sourceLineNo">557</span><a name="line.557"></a>
-<span class="sourceLineNo">558</span> /**<a name="line.558"></a>
-<span class="sourceLineNo">559</span> * lookup the node containing the specified procId.<a name="line.559"></a>
-<span class="sourceLineNo">560</span> * @param node cached node to check before doing a lookup<a name="line.560"></a>
-<span class="sourceLineNo">561</span> * @param procId the procId to lookup<a name="line.561"></a>
-<span class="sourceLineNo">562</span> * @return the node that may contains the procId or null<a name="line.562"></a>
-<span class="sourceLineNo">563</span> */<a name="line.563"></a>
-<span class="sourceLineNo">564</span> private BitSetNode lookupClosestNode(final BitSetNode node, final long procId) {<a name="line.564"></a>
-<span class="sourceLineNo">565</span> if (node != null && node.contains(procId)) return node;<a name="line.565"></a>
-<span class="sourceLineNo">566</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.566"></a>
-<span class="sourceLineNo">567</span> return entry != null ? entry.getValue() : null;<a name="line.567"></a>
-<span class="sourceLineNo">568</span> }<a name="line.568"></a>
-<span class="sourceLineNo">569</span><a name="line.569"></a>
-<span class="sourceLineNo">570</span> private void trackProcIds(long procId) {<a name="line.570"></a>
-<span class="sourceLineNo">571</span> minUpdatedProcId = Math.min(minUpdatedProcId, procId);<a name="line.571"></a>
-<span class="sourceLineNo">572</span> maxUpdatedProcId = Math.max(maxUpdatedProcId, procId);<a name="line.572"></a>
-<span class="sourceLineNo">573</span> }<a name="line.573"></a>
-<span class="sourceLineNo">574</span><a name="line.574"></a>
-<span class="sourceLineNo">575</span> public long getUpdatedMinProcId() {<a name="line.575"></a>
-<span class="sourceLineNo">576</span> return minUpdatedProcId;<a name="line.576"></a>
-<span class="sourceLineNo">577</span> }<a name="line.577"></a>
-<span class="sourceLineNo">578</span><a name="line.578"></a>
-<span class="sourceLineNo">579</span> public long getUpdatedMaxProcId() {<a name="line.579"></a>
-<span class="sourceLineNo">580</span> return maxUpdatedProcId;<a name="line.580"></a>
-<span class="sourceLineNo">581</span> }<a name="line.581"></a>
-<span class="sourceLineNo">582</span><a name="line.582"></a>
-<span class="sourceLineNo">583</span> public void reset() {<a name="line.583"></a>
-<span class="sourceLineNo">584</span> this.keepDeletes = false;<a name="line.584"></a>
-<span class="sourceLineNo">585</span> this.partial = false;<a name="line.585"></a>
-<span class="sourceLineNo">586</span> this.map.clear();<a name="line.586"></a>
-<span class="sourceLineNo">587</span> resetUpdates();<a name="line.587"></a>
-<span class="sourceLineNo">588</span> }<a name="line.588"></a>
-<span class="sourceLineNo">589</span><a name="line.589"></a>
-<span class="sourceLineNo">590</span> public boolean isUpdated(long procId) {<a name="line.590"></a>
-<span class="sourceLineNo">591</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.591"></a>
-<span class="sourceLineNo">592</span> return entry != null && entry.getValue().contains(procId) && entry.getValue().isUpdated(procId);<a name="line.592"></a>
-<span class="sourceLineNo">593</span> }<a name="line.593"></a>
-<span class="sourceLineNo">594</span><a name="line.594"></a>
-<span class="sourceLineNo">595</span> /**<a name="line.595"></a>
-<span class="sourceLineNo">596</span> * If {@link #partial} is false, returns state from the bitmap. If no state is found for<a name="line.596"></a>
-<span class="sourceLineNo">597</span> * {@code procId}, returns YES.<a name="line.597"></a>
-<span class="sourceLineNo">598</span> * If partial is true, tracker doesn't have complete view of system state, so it returns MAYBE<a name="line.598"></a>
-<span class="sourceLineNo">599</span> * if there is no update for the procedure or if it doesn't have a state in bitmap. Otherwise,<a name="line.599"></a>
-<span class="sourceLineNo">600</span> * returns state from the bitmap.<a name="line.600"></a>
-<span class="sourceLineNo">601</span> */<a name="line.601"></a>
-<span class="sourceLineNo">602</span> public DeleteState isDeleted(long procId) {<a name="line.602"></a>
-<span class="sourceLineNo">603</span> Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.603"></a>
-<span class="sourceLineNo">604</span> if (entry != null && entry.getValue().contains(procId)) {<a name="line.604"></a>
-<span class="sourceLineNo">605</span> BitSetNode node = entry.getValue();<a name="line.605"></a>
-<span class="sourceLineNo">606</span> DeleteState state = node.isDeleted(procId);<a name="line.606"></a>
-<span class="sourceLineNo">607</span> return partial && !node.isUpdated(procId) ? DeleteState.MAYBE : state;<a name="line.607"></a>
-<span class="sourceLineNo">608</span> }<a name="line.608"></a>
-<span class="sourceLineNo">609</span> return partial ? DeleteState.MAYBE : DeleteState.YES;<a name="line.609"></a>
-<span class="sourceLineNo">610</span> }<a name="line.610"></a>
-<span class="sourceLineNo">611</span><a name="line.611"></a>
-<span class="sourceLineNo">612</span> public long getActiveMinProcId() {<a name="line.612"></a>
-<span class="sourceLineNo">613</span> // TODO: Cache?<a name="line.613"></a>
-<span class="sourceLineNo">614</span> Map.Entry<Long, BitSetNode> entry = map.firstEntry();<a name="line.614"></a>
-<span class="sourceLineNo">615</span> return entry == null ? 0 : entry.getValue().getActiveMinProcId();<a name="line.615"></a>
-<span class="sourceLineNo">616</span> }<a name="line.616"></a>
-<span class="sourceLineNo">617</span><a name="line.617"></a>
-<span class="sourceLineNo">618</span> public void setKeepDeletes(boolean keepDeletes) {<a name="line.618"></a>
-<span class="sourceLineNo">619</span> this.keepDeletes = keepDeletes;<a name="line.619"></a>
-<span class="sourceLineNo">620</span> // If not to keep deletes, remove the BitSetNodes which are empty (i.e. contains ids of deleted<a name="line.620"></a>
-<span class="sourceLineNo">621</span> // procedures).<a name="line.621"></a>
-<span class="sourceLineNo">622</span> if (!keepDeletes) {<a name="line.622"></a>
-<span class="sourceLineNo">623</span> Iterator<Map.Entry<Long, BitSetNode>> it = map.entrySet().iterator();<a name="line.623"></a>
-<span class="sourceLineNo">624</span> while (it.hasNext()) {<a name="line.624"></a>
-<span class="sourceLineNo">625</span> Map.Entry<Long, BitSetNode> entry = it.next();<a name="line.625"></a>
-<span class="sourceLineNo">626</span> if (entry.getValue().isEmpty()) {<a name="line.626"></a>
-<span class="sourceLineNo">627</span> it.remove();<a name="line.627"></a>
-<span class="sourceLineNo">628</span> }<a name="line.628"></a>
-<span class="sourceLineNo">629</span> }<a name="line.629"></a>
-<span class="sourceLineNo">630</span> }<a name="line.630"></a>
-<span class="sourceLineNo">631</span> }<a name="line.631"></a>
-<span class="sourceLineNo">632</span><a name="line.632"></a>
-<span class="sourceLineNo">633</span> public boolean isPartial() {<a name="line.633"></a>
-<span class="sourceLineNo">634</span> return partial;<a name="line.634"></a>
-<span class="sourceLineNo">635</span> }<a name="line.635"></a>
-<span class="sourceLineNo">636</span><a name="line.636"></a>
-<span class="sourceLineNo">637</span> public void setPartialFlag(boolean isPartial) {<a name="line.637"></a>
-<span class="sourceLineNo">638</span> if (this.partial && !isPartial) {<a name="line.638"></a>
-<span class="sourceLineNo">639</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.639"></a>
-<span class="sourceLineNo">640</span> entry.getValue().unsetPartialFlag();<a name="line.640"></a>
-<span class="sourceLineNo">641</span> }<a name="line.641"></a>
-<span class="sourceLineNo">642</span> }<a name="line.642"></a>
-<span class="sourceLineNo">643</span> this.partial = isPartial;<a name="line.643"></a>
-<span class="sourceLineNo">644</span> }<a name="line.644"></a>
-<span class="sourceLineNo">645</span><a name="line.645"></a>
-<span class="sourceLineNo">646</span> /**<a name="line.646"></a>
-<span class="sourceLineNo">647</span> * @return true, if no procedure is active, else false.<a name="line.647"></a>
-<span class="sourceLineNo">648</span> */<a name="line.648"></a>
-<span class="sourceLineNo">649</span> public boolean isEmpty() {<a name="line.649"></a>
-<span class="sourceLineNo">650</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.650"></a>
-<span class="sourceLineNo">651</span> if (!entry.getValue().isEmpty()) {<a name="line.651"></a>
-<span class="sourceLineNo">652</span> return false;<a name="line.652"></a>
-<span class="sourceLineNo">653</span> }<a name="line.653"></a>
-<span class="sourceLineNo">654</span> }<a name="line.654"></a>
-<span class="sourceLineNo">655</span> return true;<a name="line.655"></a>
-<span class="sourceLineNo">656</span> }<a name="line.656"></a>
-<span class="sourceLineNo">657</span><a name="line.657"></a>
-<span class="sourceLineNo">658</span> /**<a name="line.658"></a>
-<span class="sourceLineNo">659</span> * @return true if any procedure was updated since last call to {@link #resetUpdates()}.<a name="line.659"></a>
-<span class="sourceLineNo">660</span> */<a name="line.660"></a>
-<span class="sourceLineNo">661</span> public boolean isUpdated() {<a name="line.661"></a>
-<span class="sourceLineNo">662</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.662"></a>
-<span class="sourceLineNo">663</span> if (!entry.getValue().isUpdated()) {<a name="line.663"></a>
-<span class="sourceLineNo">664</span> return false;<a name="line.664"></a>
-<span class="sourceLineNo">665</span> }<a name="line.665"></a>
-<span class="sourceLineNo">666</span> }<a name="line.666"></a>
-<span class="sourceLineNo">667</span> return true;<a name="line.667"></a>
-<span class="sourceLineNo">668</span> }<a name="line.668"></a>
-<span class="sourceLineNo">669</span><a name="line.669"></a>
-<span class="sourceLineNo">670</span> /**<a name="line.670"></a>
-<span class="sourceLineNo">671</span> * Clears the list of updated procedure ids. This doesn't affect global list of active<a name="line.671"></a>
-<span class="sourceLineNo">672</span> * procedure ids.<a name="line.672"></a>
-<span class="sourceLineNo">673</span> */<a name="line.673"></a>
-<span class="sourceLineNo">674</span> public void resetUpdates() {<a name="line.674"></a>
-<span class="sourceLineNo">675</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.675"></a>
-<span class="sourceLineNo">676</span> entry.getValue().resetUpdates();<a name="line.676"></a>
-<span class="sourceLineNo">677</span> }<a name="line.677"></a>
-<span class="sourceLineNo">678</span> minUpdatedProcId = Long.MAX_VALUE;<a name="line.678"></a>
-<span class="sourceLineNo">679</span> maxUpdatedProcId = Long.MIN_VALUE;<a name="line.679"></a>
-<span class="sourceLineNo">680</span> }<a name="line.680"></a>
-<span class="sourceLineNo">681</span><a name="line.681"></a>
-<span class="sourceLineNo">682</span> public void undeleteAll() {<a name="line.682"></a>
-<span class="sourceLineNo">683</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.683"></a>
-<span class="sourceLineNo">684</span> entry.getValue().undeleteAll();<a name="line.684"></a>
-<span class="sourceLineNo">685</span> }<a name="line.685"></a>
-<span class="sourceLineNo">686</span> }<a name="line.686"></a>
-<span class="sourceLineNo">687</span><a name="line.687"></a>
-<span class="sourceLineNo">688</span> private BitSetNode getOrCreateNode(final long procId) {<a name="line.688"></a>
-<span class="sourceLineNo">689</span> // If procId can fit in left node (directly or by growing it)<a name="line.689"></a>
-<span class="sourceLineNo">690</span> BitSetNode leftNode = null;<a name="line.690"></a>
-<span class="sourceLineNo">691</span> boolean leftCanGrow = false;<a name="line.691"></a>
-<span class="sourceLineNo">692</span> Map.Entry<Long, BitSetNode> leftEntry = map.floorEntry(procId);<a name="line.692"></a>
-<span class="sourceLineNo">693</span> if (leftEntry != null) {<a name="line.693"></a>
-<span class="sourceLineNo">694</span> leftNode = leftEntry.getValue();<a name="line.694"></a>
-<span class="sourceLineNo">695</span> if (leftNode.contains(procId)) {<a name="line.695"></a>
-<span class="sourceLineNo">696</span> return leftNode;<a name="line.696"></a>
-<span class="sourceLineNo">697</span> }<a name="line.697"></a>
-<span class="sourceLineNo">698</span> leftCanGrow = leftNode.canGrow(procId);<a name="line.698"></a>
-<span class="sourceLineNo">699</span> }<a name="line.699"></a>
-<span class="sourceLineNo">700</span><a name="line.700"></a>
-<span class="sourceLineNo">701</span> // If procId can fit in right node (directly or by growing it)<a name="line.701"></a>
-<span class="sourceLineNo">702</span> BitSetNode rightNode = null;<a name="line.702"></a>
-<span class="sourceLineNo">703</span> boolean rightCanGrow = false;<a name="line.703"></a>
-<span class="sourceLineNo">704</span> Map.Entry<Long, BitSetNode> rightEntry = map.ceilingEntry(procId);<a name="line.704"></a>
-<span class="sourceLineNo">705</span> if (rightEntry != null) {<a name="line.705"></a>
-<span class="sourceLineNo">706</span> rightNode = rightEntry.getValue();<a name="line.706"></a>
-<span class="sourceLineNo">707</span> rightCanGrow = rightNode.canGrow(procId);<a name="line.707"></a>
-<span class="sourceLineNo">708</span> if (leftNode != null) {<a name="line.708"></a>
-<span class="sourceLineNo">709</span> if (leftNode.canMerge(rightNode)) {<a name="line.709"></a>
-<span class="sourceLineNo">710</span> // merge left and right node<a name="line.710"></a>
-<span class="sourceLineNo">711</span> return mergeNodes(leftNode, rightNode);<a name="line.711"></a>
-<span class="sourceLineNo">712</span> }<a name="line.712"></a>
-<span class="sourceLineNo">713</span><a name="line.713"></a>
-<span class="sourceLineNo">714</span> // If left and right nodes can not merge, decide which one to grow.<a name="line.714"></a>
-<span class="sourceLineNo">715</span> if (leftCanGrow && rightCanGrow) {<a name="line.715"></a>
-<span class="sourceLineNo">716</span> if ((procId - leftNode.getEnd()) <= (rightNode.getStart() - procId)) {<a name="line.716"></a>
-<span class="sourceLineNo">717</span> return growNode(leftNode, procId);<a name="line.717"></a>
-<span class="sourceLineNo">718</span> }<a name="line.718"></a>
-<span class="sourceLineNo">719</span> return growNode(rightNode, procId);<a name="line.719"></a>
-<span class="sourceLineNo">720</span> }<a name="line.720"></a>
-<span class="sourceLineNo">721</span> }<a name="line.721"></a>
-<span class="sourceLineNo">722</span> }<a name="line.722"></a>
-<span class="sourceLineNo">723</span><a name="line.723"></a>
-<span class="sourceLineNo">724</span> // grow the left node<a name="line.724"></a>
-<span class="sourceLineNo">725</span> if (leftCanGrow) {<a name="line.725"></a>
-<span class="sourceLineNo">726</span> return growNode(leftNode, procId);<a name="line.726"></a>
-<span class="sourceLineNo">727</span> }<a name="line.727"></a>
-<span class="sourceLineNo">728</span><a name="line.728"></a>
-<span class="sourceLineNo">729</span> // grow the right node<a name="line.729"></a>
-<span class="sourceLineNo">730</span> if (rightCanGrow) {<a name="line.730"></a>
-<span class="sourceLineNo">731</span> return growNode(rightNode, procId);<a name="line.731"></a>
-<span class="sourceLineNo">732</span> }<a name="line.732"></a>
-<span class="sourceLineNo">733</span><a name="line.733"></a>
-<span class="sourceLineNo">734</span> // add new node if there are no left/right nodes which can be used.<a name="line.734"></a>
-<span class="sourceLineNo">735</span> BitSetNode node = new BitSetNode(procId, partial);<a name="line.735"></a>
-<span class="sourceLineNo">736</span> map.put(node.getStart(), node);<a name="line.736"></a>
-<span class="sourceLineNo">737</span> return node;<a name="line.737"></a>
-<span class="sourceLineNo">738</span> }<a name="line.738"></a>
-<span class="sourceLineNo">739</span><a name="line.739"></a>
-<span class="sourceLineNo">740</span> /**<a name="line.740"></a>
-<span class="sourceLineNo">741</span> * Grows {@code node} to contain {@code procId} and updates the map.<a name="line.741"></a>
-<span class="sourceLineNo">742</span> * @return {@link BitSetNode} instance which contains {@code procId}.<a name="line.742"></a>
-<span class="sourceLineNo">743</span> */<a name="line.743"></a>
-<span class="sourceLineNo">744</span> private BitSetNode growNode(BitSetNode node, long procId) {<a name="line.744"></a>
-<span class="sourceLineNo">745</span> map.remove(node.getStart());<a name="line.745"></a>
-<span class="sourceLineNo">746</span> node.grow(procId);<a name="line.746"></a>
-<span class="sourceLineNo">747</span> map.put(node.getStart(), node);<a name="line.747"></a>
-<span class="sourceLineNo">748</span> return node;<a name="line.748"></a>
-<span class="sourceLineNo">749</span> }<a name="line.749"></a>
-<span class="sourceLineNo">750</span><a name="line.750"></a>
-<span class="sourceLineNo">751</span> /**<a name="line.751"></a>
-<span class="sourceLineNo">752</span> * Merges {@code leftNode} & {@code rightNode} and updates the map.<a name="line.752"></a>
-<span class="sourceLineNo">753</span> */<a name="line.753"></a>
-<span class="sourceLineNo">754</span> private BitSetNode mergeNodes(BitSetNode leftNode, BitSetNode rightNode) {<a name="line.754"></a>
-<span class="sourceLineNo">755</span> assert leftNode.getStart() < rightNode.getStart();<a name="line.755"></a>
-<span class="sourceLineNo">756</span> leftNode.merge(rightNode);<a name="line.756"></a>
-<span class="sourceLineNo">757</span> map.remove(rightNode.getStart());<a name="line.757"></a>
-<span class="sourceLineNo">758</span> return leftNode;<a name="line.758"></a>
-<span class="sourceLineNo">759</span> }<a name="line.759"></a>
-<span class="sourceLineNo">760</span><a name="line.760"></a>
-<span class="sourceLineNo">761</span> public void dump() {<a name="line.761"></a>
-<span class="sourceLineNo">762</span> System.out.println("map " + map.size());<a name="line.762"></a>
-<span class="sourceLineNo">763</span> System.out.println("isUpdated " + isUpdated());<a name="line.763"></a>
-<span class="sourceLineNo">764</span> System.out.println("isEmpty " + isEmpty());<a name="line.764"></a>
-<span class="sourceLineNo">765</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.765"></a>
-<span class="sourceLineNo">766</span> entry.getValue().dump();<a name="line.766"></a>
-<span class="sourceLineNo">767</span> }<a name="line.767"></a>
-<span class="sourceLineNo">768</span> }<a name="line.768"></a>
-<span class="sourceLineNo">769</span><a name="line.769"></a>
-<span class="sourceLineNo">770</span> // ========================================================================<a name="line.770"></a>
-<span class="sourceLineNo">771</span> // Convert to/from Protocol Buffer.<a name="line.771"></a>
-<span class="sourceLineNo">772</span> // ========================================================================<a name="line.772"></a>
-<span class="sourceLineNo">773</span><a name="line.773"></a>
-<span class="sourceLineNo">774</span> /**<a name="line.774"></a>
-<span class="sourceLineNo">775</span> * Builds<a name="line.775"></a>
-<span class="sourceLineNo">776</span> * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker<a name="line.776"></a>
-<span class="sourceLineNo">777</span> * protocol buffer from current state.<a name="line.777"></a>
-<span class="sourceLineNo">778</span> */<a name="line.778"></a>
-<span class="sourceLineNo">779</span> public ProcedureProtos.ProcedureStoreTracker toProto() throws IOException {<a name="line.779"></a>
-<span class="sourceLineNo">780</span> ProcedureProtos.ProcedureStoreTracker.Builder builder =<a name="line.780"></a>
-<span class="sourceLineNo">781</span> ProcedureProtos.ProcedureStoreTracker.newBuilder();<a name="line.781"></a>
-<span class="sourceLineNo">782</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.782"></a>
-<span class="sourceLineNo">783</span> builder.addNode(entry.getValue().convert());<a name="line.783"></a>
-<span class="sourceLineNo">784</span> }<a name="line.784"></a>
-<span class="sourceLineNo">785</span> return builder.build();<a name="line.785"></a>
-<span class="sourceLineNo">786</span> }<a name="line.786"></a>
-<span class="sourceLineNo">787</span>}<a name="line.787"></a>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-</pre>
-</div>
-</body>
-</html>