hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From mi...@apache.org
Subject [23/51] [partial] hbase-site git commit: Published site at 60d33ce34191533bb858852584bd9bddfeb16a23.
Date Wed, 16 Dec 2015 16:51:08 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/539ad177/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
index 9a2a5bc..f6c7b80 100644
--- 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
@@ -35,574 +35,567 @@
 <span class="sourceLineNo">027</span><a name="line.27"></a>
 <span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.28"></a>
 <span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.classification.InterfaceStability;<a name="line.29"></a>
-<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.procedure2.Procedure;<a name="line.30"></a>
-<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos;<a name="line.31"></a>
-<span class="sourceLineNo">032</span><a name="line.32"></a>
-<span class="sourceLineNo">033</span>/**<a name="line.33"></a>
-<span class="sourceLineNo">034</span> * Keeps track of live procedures.<a name="line.34"></a>
-<span class="sourceLineNo">035</span> *<a name="line.35"></a>
-<span class="sourceLineNo">036</span> * It can be used by the ProcedureStore to identify which procedures are already<a name="line.36"></a>
-<span class="sourceLineNo">037</span> * deleted/completed to avoid the deserialization step on restart.<a name="line.37"></a>
-<span class="sourceLineNo">038</span> */<a name="line.38"></a>
-<span class="sourceLineNo">039</span>@InterfaceAudience.Private<a name="line.39"></a>
-<span class="sourceLineNo">040</span>@InterfaceStability.Evolving<a name="line.40"></a>
-<span class="sourceLineNo">041</span>public class ProcedureStoreTracker {<a name="line.41"></a>
-<span class="sourceLineNo">042</span>  private final TreeMap&lt;Long, BitSetNode&gt; map = new TreeMap&lt;Long, BitSetNode&gt;();<a name="line.42"></a>
-<span class="sourceLineNo">043</span><a name="line.43"></a>
-<span class="sourceLineNo">044</span>  private boolean keepDeletes = false;<a name="line.44"></a>
-<span class="sourceLineNo">045</span>  private boolean partial = false;<a name="line.45"></a>
-<span class="sourceLineNo">046</span><a name="line.46"></a>
-<span class="sourceLineNo">047</span>  private long minUpdatedProcId = Long.MAX_VALUE;<a name="line.47"></a>
-<span class="sourceLineNo">048</span>  private long maxUpdatedProcId = Long.MIN_VALUE;<a name="line.48"></a>
-<span class="sourceLineNo">049</span><a name="line.49"></a>
-<span class="sourceLineNo">050</span>  public enum DeleteState { YES, NO, MAYBE }<a name="line.50"></a>
-<span class="sourceLineNo">051</span><a name="line.51"></a>
-<span class="sourceLineNo">052</span>  public static class BitSetNode {<a name="line.52"></a>
-<span class="sourceLineNo">053</span>    private final static long WORD_MASK = 0xffffffffffffffffL;<a name="line.53"></a>
-<span class="sourceLineNo">054</span>    private final static int ADDRESS_BITS_PER_WORD = 6;<a name="line.54"></a>
-<span class="sourceLineNo">055</span>    private final static int BITS_PER_WORD = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.55"></a>
-<span class="sourceLineNo">056</span>    private final static int MAX_NODE_SIZE = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.56"></a>
-<span class="sourceLineNo">057</span><a name="line.57"></a>
-<span class="sourceLineNo">058</span>    private final boolean partial;<a name="line.58"></a>
-<span class="sourceLineNo">059</span>    private long[] updated;<a name="line.59"></a>
-<span class="sourceLineNo">060</span>    private long[] deleted;<a name="line.60"></a>
-<span class="sourceLineNo">061</span>    private long start;<a name="line.61"></a>
-<span class="sourceLineNo">062</span><a name="line.62"></a>
-<span class="sourceLineNo">063</span>    public void dump() {<a name="line.63"></a>
-<span class="sourceLineNo">064</span>      System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(),<a name="line.64"></a>
-<span class="sourceLineNo">065</span>        getMinProcId(), getMaxProcId());<a name="line.65"></a>
-<span class="sourceLineNo">066</span>      System.out.println("Update:");<a name="line.66"></a>
-<span class="sourceLineNo">067</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.67"></a>
-<span class="sourceLineNo">068</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.68"></a>
-<span class="sourceLineNo">069</span>          System.out.print((updated[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.69"></a>
-<span class="sourceLineNo">070</span>        }<a name="line.70"></a>
-<span class="sourceLineNo">071</span>        System.out.println(" " + i);<a name="line.71"></a>
-<span class="sourceLineNo">072</span>      }<a name="line.72"></a>
-<span class="sourceLineNo">073</span>      System.out.println();<a name="line.73"></a>
-<span class="sourceLineNo">074</span>      System.out.println("Delete:");<a name="line.74"></a>
-<span class="sourceLineNo">075</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.75"></a>
-<span class="sourceLineNo">076</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.76"></a>
-<span class="sourceLineNo">077</span>          System.out.print((deleted[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.77"></a>
-<span class="sourceLineNo">078</span>        }<a name="line.78"></a>
-<span class="sourceLineNo">079</span>        System.out.println(" " + i);<a name="line.79"></a>
-<span class="sourceLineNo">080</span>      }<a name="line.80"></a>
-<span class="sourceLineNo">081</span>      System.out.println();<a name="line.81"></a>
-<span class="sourceLineNo">082</span>    }<a name="line.82"></a>
-<span class="sourceLineNo">083</span><a name="line.83"></a>
-<span class="sourceLineNo">084</span>    public BitSetNode(final long procId, final boolean partial) {<a name="line.84"></a>
-<span class="sourceLineNo">085</span>      start = alignDown(procId);<a name="line.85"></a>
-<span class="sourceLineNo">086</span><a name="line.86"></a>
-<span class="sourceLineNo">087</span>      int count = 1;<a name="line.87"></a>
-<span class="sourceLineNo">088</span>      updated = new long[count];<a name="line.88"></a>
-<span class="sourceLineNo">089</span>      deleted = new long[count];<a name="line.89"></a>
-<span class="sourceLineNo">090</span>      for (int i = 0; i &lt; count; ++i) {<a name="line.90"></a>
-<span class="sourceLineNo">091</span>        updated[i] = 0;<a name="line.91"></a>
-<span class="sourceLineNo">092</span>        deleted[i] = partial ? 0 : WORD_MASK;<a name="line.92"></a>
-<span class="sourceLineNo">093</span>      }<a name="line.93"></a>
-<span class="sourceLineNo">094</span><a name="line.94"></a>
-<span class="sourceLineNo">095</span>      this.partial = partial;<a name="line.95"></a>
-<span class="sourceLineNo">096</span>      updateState(procId, false);<a name="line.96"></a>
-<span class="sourceLineNo">097</span>    }<a name="line.97"></a>
-<span class="sourceLineNo">098</span><a name="line.98"></a>
-<span class="sourceLineNo">099</span>    protected BitSetNode(final long start, final long[] updated, final long[] deleted) {<a name="line.99"></a>
-<span class="sourceLineNo">100</span>      this.start = start;<a name="line.100"></a>
-<span class="sourceLineNo">101</span>      this.updated = updated;<a name="line.101"></a>
-<span class="sourceLineNo">102</span>      this.deleted = deleted;<a name="line.102"></a>
-<span class="sourceLineNo">103</span>      this.partial = false;<a name="line.103"></a>
-<span class="sourceLineNo">104</span>    }<a name="line.104"></a>
-<span class="sourceLineNo">105</span><a name="line.105"></a>
-<span class="sourceLineNo">106</span>    public void update(final long procId) {<a name="line.106"></a>
-<span class="sourceLineNo">107</span>      updateState(procId, false);<a name="line.107"></a>
-<span class="sourceLineNo">108</span>    }<a name="line.108"></a>
-<span class="sourceLineNo">109</span><a name="line.109"></a>
-<span class="sourceLineNo">110</span>    public void delete(final long procId) {<a name="line.110"></a>
-<span class="sourceLineNo">111</span>      updateState(procId, true);<a name="line.111"></a>
-<span class="sourceLineNo">112</span>    }<a name="line.112"></a>
-<span class="sourceLineNo">113</span><a name="line.113"></a>
-<span class="sourceLineNo">114</span>    public Long getStart() {<a name="line.114"></a>
-<span class="sourceLineNo">115</span>      return start;<a name="line.115"></a>
-<span class="sourceLineNo">116</span>    }<a name="line.116"></a>
-<span class="sourceLineNo">117</span><a name="line.117"></a>
-<span class="sourceLineNo">118</span>    public Long getEnd() {<a name="line.118"></a>
-<span class="sourceLineNo">119</span>      return start + (updated.length &lt;&lt; ADDRESS_BITS_PER_WORD) - 1;<a name="line.119"></a>
-<span class="sourceLineNo">120</span>    }<a name="line.120"></a>
-<span class="sourceLineNo">121</span><a name="line.121"></a>
-<span class="sourceLineNo">122</span>    public boolean contains(final long procId) {<a name="line.122"></a>
-<span class="sourceLineNo">123</span>      return start &lt;= procId &amp;&amp; procId &lt;= getEnd();<a name="line.123"></a>
-<span class="sourceLineNo">124</span>    }<a name="line.124"></a>
-<span class="sourceLineNo">125</span><a name="line.125"></a>
-<span class="sourceLineNo">126</span>    public DeleteState isDeleted(final long procId) {<a name="line.126"></a>
-<span class="sourceLineNo">127</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.127"></a>
-<span class="sourceLineNo">128</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.128"></a>
-<span class="sourceLineNo">129</span>      if (wordIndex &gt;= deleted.length) {<a name="line.129"></a>
-<span class="sourceLineNo">130</span>        return DeleteState.MAYBE;<a name="line.130"></a>
-<span class="sourceLineNo">131</span>      }<a name="line.131"></a>
-<span class="sourceLineNo">132</span>      return (deleted[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0 ? DeleteState.YES : DeleteState.NO;<a name="line.132"></a>
-<span class="sourceLineNo">133</span>    }<a name="line.133"></a>
-<span class="sourceLineNo">134</span><a name="line.134"></a>
-<span class="sourceLineNo">135</span>    private boolean isUpdated(final long procId) {<a name="line.135"></a>
-<span class="sourceLineNo">136</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.136"></a>
-<span class="sourceLineNo">137</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.137"></a>
-<span class="sourceLineNo">138</span>      if (wordIndex &gt;= updated.length) {<a name="line.138"></a>
-<span class="sourceLineNo">139</span>        return false;<a name="line.139"></a>
-<span class="sourceLineNo">140</span>      }<a name="line.140"></a>
-<span class="sourceLineNo">141</span>      return (updated[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0;<a name="line.141"></a>
-<span class="sourceLineNo">142</span>    }<a name="line.142"></a>
-<span class="sourceLineNo">143</span><a name="line.143"></a>
-<span class="sourceLineNo">144</span>    public boolean isUpdated() {<a name="line.144"></a>
-<span class="sourceLineNo">145</span>      // TODO: cache the value<a name="line.145"></a>
-<span class="sourceLineNo">146</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.146"></a>
-<span class="sourceLineNo">147</span>        if ((updated[i] | deleted[i]) != WORD_MASK) {<a name="line.147"></a>
-<span class="sourceLineNo">148</span>          return false;<a name="line.148"></a>
-<span class="sourceLineNo">149</span>        }<a name="line.149"></a>
-<span class="sourceLineNo">150</span>      }<a name="line.150"></a>
-<span class="sourceLineNo">151</span>      return true;<a name="line.151"></a>
-<span class="sourceLineNo">152</span>    }<a name="line.152"></a>
-<span class="sourceLineNo">153</span><a name="line.153"></a>
-<span class="sourceLineNo">154</span>    public boolean isEmpty() {<a name="line.154"></a>
-<span class="sourceLineNo">155</span>      // TODO: cache the value<a name="line.155"></a>
-<span class="sourceLineNo">156</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.156"></a>
-<span class="sourceLineNo">157</span>        if (deleted[i] != WORD_MASK) {<a name="line.157"></a>
-<span class="sourceLineNo">158</span>          return false;<a name="line.158"></a>
-<span class="sourceLineNo">159</span>        }<a name="line.159"></a>
-<span class="sourceLineNo">160</span>      }<a name="line.160"></a>
-<span class="sourceLineNo">161</span>      return true;<a name="line.161"></a>
-<span class="sourceLineNo">162</span>    }<a name="line.162"></a>
-<span class="sourceLineNo">163</span><a name="line.163"></a>
-<span class="sourceLineNo">164</span>    public void resetUpdates() {<a name="line.164"></a>
-<span class="sourceLineNo">165</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.165"></a>
-<span class="sourceLineNo">166</span>        updated[i] = 0;<a name="line.166"></a>
-<span class="sourceLineNo">167</span>      }<a name="line.167"></a>
-<span class="sourceLineNo">168</span>    }<a name="line.168"></a>
-<span class="sourceLineNo">169</span><a name="line.169"></a>
-<span class="sourceLineNo">170</span>    public void undeleteAll() {<a name="line.170"></a>
-<span class="sourceLineNo">171</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.171"></a>
-<span class="sourceLineNo">172</span>        deleted[i] = 0;<a name="line.172"></a>
-<span class="sourceLineNo">173</span>      }<a name="line.173"></a>
-<span class="sourceLineNo">174</span>    }<a name="line.174"></a>
-<span class="sourceLineNo">175</span><a name="line.175"></a>
-<span class="sourceLineNo">176</span>    public void unsetPartialFlag() {<a name="line.176"></a>
-<span class="sourceLineNo">177</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.177"></a>
-<span class="sourceLineNo">178</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.178"></a>
-<span class="sourceLineNo">179</span>          if ((updated[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.179"></a>
-<span class="sourceLineNo">180</span>            deleted[i] |= (1L &lt;&lt; j);<a name="line.180"></a>
-<span class="sourceLineNo">181</span>          }<a name="line.181"></a>
-<span class="sourceLineNo">182</span>        }<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><a name="line.185"></a>
-<span class="sourceLineNo">186</span>    public ProcedureProtos.ProcedureStoreTracker.TrackerNode convert() {<a name="line.186"></a>
-<span class="sourceLineNo">187</span>      ProcedureProtos.ProcedureStoreTracker.TrackerNode.Builder builder =<a name="line.187"></a>
-<span class="sourceLineNo">188</span>        ProcedureProtos.ProcedureStoreTracker.TrackerNode.newBuilder();<a name="line.188"></a>
-<span class="sourceLineNo">189</span>      builder.setStartId(start);<a name="line.189"></a>
-<span class="sourceLineNo">190</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.190"></a>
-<span class="sourceLineNo">191</span>        builder.addUpdated(updated[i]);<a name="line.191"></a>
-<span class="sourceLineNo">192</span>        builder.addDeleted(deleted[i]);<a name="line.192"></a>
-<span class="sourceLineNo">193</span>      }<a name="line.193"></a>
-<span class="sourceLineNo">194</span>      return builder.build();<a name="line.194"></a>
-<span class="sourceLineNo">195</span>    }<a name="line.195"></a>
-<span class="sourceLineNo">196</span><a name="line.196"></a>
-<span class="sourceLineNo">197</span>    public static BitSetNode convert(ProcedureProtos.ProcedureStoreTracker.TrackerNode data) {<a name="line.197"></a>
-<span class="sourceLineNo">198</span>      long start = data.getStartId();<a name="line.198"></a>
-<span class="sourceLineNo">199</span>      int size = data.getUpdatedCount();<a name="line.199"></a>
-<span class="sourceLineNo">200</span>      long[] updated = new long[size];<a name="line.200"></a>
-<span class="sourceLineNo">201</span>      long[] deleted = new long[size];<a name="line.201"></a>
-<span class="sourceLineNo">202</span>      for (int i = 0; i &lt; size; ++i) {<a name="line.202"></a>
-<span class="sourceLineNo">203</span>        updated[i] = data.getUpdated(i);<a name="line.203"></a>
-<span class="sourceLineNo">204</span>        deleted[i] = data.getDeleted(i);<a name="line.204"></a>
-<span class="sourceLineNo">205</span>      }<a name="line.205"></a>
-<span class="sourceLineNo">206</span>      return new BitSetNode(start, updated, deleted);<a name="line.206"></a>
-<span class="sourceLineNo">207</span>    }<a name="line.207"></a>
-<span class="sourceLineNo">208</span><a name="line.208"></a>
-<span class="sourceLineNo">209</span>    // ========================================================================<a name="line.209"></a>
-<span class="sourceLineNo">210</span>    //  Grow/Merge Helpers<a name="line.210"></a>
-<span class="sourceLineNo">211</span>    // ========================================================================<a name="line.211"></a>
-<span class="sourceLineNo">212</span>    public boolean canGrow(final long procId) {<a name="line.212"></a>
-<span class="sourceLineNo">213</span>      return Math.abs(procId - start) &lt; MAX_NODE_SIZE;<a name="line.213"></a>
-<span class="sourceLineNo">214</span>    }<a name="line.214"></a>
-<span class="sourceLineNo">215</span><a name="line.215"></a>
-<span class="sourceLineNo">216</span>    public boolean canMerge(final BitSetNode rightNode) {<a name="line.216"></a>
-<span class="sourceLineNo">217</span>      assert start &lt; rightNode.getEnd();<a name="line.217"></a>
-<span class="sourceLineNo">218</span>      return (rightNode.getEnd() - start) &lt; MAX_NODE_SIZE;<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>    public void grow(final long procId) {<a name="line.221"></a>
-<span class="sourceLineNo">222</span>      int delta, offset;<a name="line.222"></a>
-<span class="sourceLineNo">223</span><a name="line.223"></a>
-<span class="sourceLineNo">224</span>      if (procId &lt; start) {<a name="line.224"></a>
-<span class="sourceLineNo">225</span>        // add to head<a name="line.225"></a>
-<span class="sourceLineNo">226</span>        long newStart = alignDown(procId);<a name="line.226"></a>
-<span class="sourceLineNo">227</span>        delta = (int)(start - newStart) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.227"></a>
-<span class="sourceLineNo">228</span>        offset = delta;<a name="line.228"></a>
-<span class="sourceLineNo">229</span>        start = newStart;<a name="line.229"></a>
-<span class="sourceLineNo">230</span>      } else {<a name="line.230"></a>
-<span class="sourceLineNo">231</span>        // Add to tail<a name="line.231"></a>
-<span class="sourceLineNo">232</span>        long newEnd = alignUp(procId + 1);<a name="line.232"></a>
-<span class="sourceLineNo">233</span>        delta = (int)(newEnd - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.233"></a>
-<span class="sourceLineNo">234</span>        offset = 0;<a name="line.234"></a>
-<span class="sourceLineNo">235</span>      }<a name="line.235"></a>
-<span class="sourceLineNo">236</span><a name="line.236"></a>
-<span class="sourceLineNo">237</span>      long[] newBitmap;<a name="line.237"></a>
-<span class="sourceLineNo">238</span>      int oldSize = updated.length;<a name="line.238"></a>
-<span class="sourceLineNo">239</span><a name="line.239"></a>
-<span class="sourceLineNo">240</span>      newBitmap = new long[oldSize + delta];<a name="line.240"></a>
-<span class="sourceLineNo">241</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.241"></a>
-<span class="sourceLineNo">242</span>        newBitmap[i] = 0;<a name="line.242"></a>
-<span class="sourceLineNo">243</span>      }<a name="line.243"></a>
-<span class="sourceLineNo">244</span>      System.arraycopy(updated, 0, newBitmap, offset, oldSize);<a name="line.244"></a>
-<span class="sourceLineNo">245</span>      updated = newBitmap;<a name="line.245"></a>
-<span class="sourceLineNo">246</span><a name="line.246"></a>
-<span class="sourceLineNo">247</span>      newBitmap = new long[deleted.length + delta];<a name="line.247"></a>
-<span class="sourceLineNo">248</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.248"></a>
-<span class="sourceLineNo">249</span>        newBitmap[i] = partial ? 0 : WORD_MASK;<a name="line.249"></a>
-<span class="sourceLineNo">250</span>      }<a name="line.250"></a>
-<span class="sourceLineNo">251</span>      System.arraycopy(deleted, 0, newBitmap, offset, oldSize);<a name="line.251"></a>
-<span class="sourceLineNo">252</span>      deleted = newBitmap;<a name="line.252"></a>
-<span class="sourceLineNo">253</span>    }<a name="line.253"></a>
-<span class="sourceLineNo">254</span><a name="line.254"></a>
-<span class="sourceLineNo">255</span>    public void merge(final BitSetNode rightNode) {<a name="line.255"></a>
-<span class="sourceLineNo">256</span>      int delta = (int)(rightNode.getEnd() - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.256"></a>
-<span class="sourceLineNo">257</span><a name="line.257"></a>
-<span class="sourceLineNo">258</span>      long[] newBitmap;<a name="line.258"></a>
-<span class="sourceLineNo">259</span>      int oldSize = updated.length;<a name="line.259"></a>
-<span class="sourceLineNo">260</span>      int newSize = (delta - rightNode.updated.length);<a name="line.260"></a>
-<span class="sourceLineNo">261</span>      int offset = oldSize + newSize;<a name="line.261"></a>
-<span class="sourceLineNo">262</span><a name="line.262"></a>
-<span class="sourceLineNo">263</span>      newBitmap = new long[oldSize + delta];<a name="line.263"></a>
-<span class="sourceLineNo">264</span>      System.arraycopy(updated, 0, newBitmap, 0, oldSize);<a name="line.264"></a>
-<span class="sourceLineNo">265</span>      System.arraycopy(rightNode.updated, 0, newBitmap, offset, rightNode.updated.length);<a name="line.265"></a>
-<span class="sourceLineNo">266</span>      updated = newBitmap;<a name="line.266"></a>
-<span class="sourceLineNo">267</span><a name="line.267"></a>
-<span class="sourceLineNo">268</span>      newBitmap = new long[oldSize + delta];<a name="line.268"></a>
-<span class="sourceLineNo">269</span>      System.arraycopy(deleted, 0, newBitmap, 0, oldSize);<a name="line.269"></a>
-<span class="sourceLineNo">270</span>      System.arraycopy(rightNode.deleted, 0, newBitmap, offset, rightNode.deleted.length);<a name="line.270"></a>
-<span class="sourceLineNo">271</span>      deleted = newBitmap;<a name="line.271"></a>
-<span class="sourceLineNo">272</span><a name="line.272"></a>
-<span class="sourceLineNo">273</span>      for (int i = 0; i &lt; newSize; ++i) {<a name="line.273"></a>
-<span class="sourceLineNo">274</span>        updated[offset + i] = 0;<a name="line.274"></a>
-<span class="sourceLineNo">275</span>        deleted[offset + i] = partial ? 0 : WORD_MASK;<a name="line.275"></a>
-<span class="sourceLineNo">276</span>      }<a name="line.276"></a>
-<span class="sourceLineNo">277</span>    }<a name="line.277"></a>
-<span class="sourceLineNo">278</span><a name="line.278"></a>
-<span class="sourceLineNo">279</span>    @Override<a name="line.279"></a>
-<span class="sourceLineNo">280</span>    public String toString() {<a name="line.280"></a>
-<span class="sourceLineNo">281</span>      return "BitSetNode(" + getStart() + "-" + getEnd() + ")";<a name="line.281"></a>
-<span class="sourceLineNo">282</span>    }<a name="line.282"></a>
-<span class="sourceLineNo">283</span><a name="line.283"></a>
-<span class="sourceLineNo">284</span>    // ========================================================================<a name="line.284"></a>
-<span class="sourceLineNo">285</span>    //  Min/Max Helpers<a name="line.285"></a>
-<span class="sourceLineNo">286</span>    // ========================================================================<a name="line.286"></a>
-<span class="sourceLineNo">287</span>    public long getMinProcId() {<a name="line.287"></a>
-<span class="sourceLineNo">288</span>      long minProcId = start;<a name="line.288"></a>
-<span class="sourceLineNo">289</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.289"></a>
-<span class="sourceLineNo">290</span>        if (deleted[i] == 0) {<a name="line.290"></a>
-<span class="sourceLineNo">291</span>          return(minProcId);<a name="line.291"></a>
-<span class="sourceLineNo">292</span>        }<a name="line.292"></a>
-<span class="sourceLineNo">293</span><a name="line.293"></a>
-<span class="sourceLineNo">294</span>        if (deleted[i] != WORD_MASK) {<a name="line.294"></a>
-<span class="sourceLineNo">295</span>          for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.295"></a>
-<span class="sourceLineNo">296</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) != 0) {<a name="line.296"></a>
-<span class="sourceLineNo">297</span>              return minProcId + j;<a name="line.297"></a>
-<span class="sourceLineNo">298</span>            }<a name="line.298"></a>
-<span class="sourceLineNo">299</span>          }<a name="line.299"></a>
-<span class="sourceLineNo">300</span>        }<a name="line.300"></a>
-<span class="sourceLineNo">301</span><a name="line.301"></a>
-<span class="sourceLineNo">302</span>        minProcId += BITS_PER_WORD;<a name="line.302"></a>
-<span class="sourceLineNo">303</span>      }<a name="line.303"></a>
-<span class="sourceLineNo">304</span>      return minProcId;<a name="line.304"></a>
-<span class="sourceLineNo">305</span>    }<a name="line.305"></a>
-<span class="sourceLineNo">306</span><a name="line.306"></a>
-<span class="sourceLineNo">307</span>    public long getMaxProcId() {<a name="line.307"></a>
-<span class="sourceLineNo">308</span>      long maxProcId = getEnd();<a name="line.308"></a>
-<span class="sourceLineNo">309</span>      for (int i = deleted.length - 1; i &gt;= 0; --i) {<a name="line.309"></a>
-<span class="sourceLineNo">310</span>        if (deleted[i] == 0) {<a name="line.310"></a>
-<span class="sourceLineNo">311</span>          return maxProcId;<a name="line.311"></a>
-<span class="sourceLineNo">312</span>        }<a name="line.312"></a>
-<span class="sourceLineNo">313</span><a name="line.313"></a>
-<span class="sourceLineNo">314</span>        if (deleted[i] != WORD_MASK) {<a name="line.314"></a>
-<span class="sourceLineNo">315</span>          for (int j = BITS_PER_WORD - 1; j &gt;= 0; --j) {<a name="line.315"></a>
-<span class="sourceLineNo">316</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.316"></a>
-<span class="sourceLineNo">317</span>              return maxProcId - (BITS_PER_WORD - 1 - j);<a name="line.317"></a>
-<span class="sourceLineNo">318</span>            }<a name="line.318"></a>
-<span class="sourceLineNo">319</span>          }<a name="line.319"></a>
-<span class="sourceLineNo">320</span>        }<a name="line.320"></a>
-<span class="sourceLineNo">321</span>        maxProcId -= BITS_PER_WORD;<a name="line.321"></a>
-<span class="sourceLineNo">322</span>      }<a name="line.322"></a>
-<span class="sourceLineNo">323</span>      return maxProcId;<a name="line.323"></a>
-<span class="sourceLineNo">324</span>    }<a name="line.324"></a>
-<span class="sourceLineNo">325</span><a name="line.325"></a>
-<span class="sourceLineNo">326</span>    // ========================================================================<a name="line.326"></a>
-<span class="sourceLineNo">327</span>    //  Bitmap Helpers<a name="line.327"></a>
-<span class="sourceLineNo">328</span>    // ========================================================================<a name="line.328"></a>
-<span class="sourceLineNo">329</span>    private int getBitmapIndex(final long procId) {<a name="line.329"></a>
-<span class="sourceLineNo">330</span>      return (int)(procId - start);<a name="line.330"></a>
-<span class="sourceLineNo">331</span>    }<a name="line.331"></a>
-<span class="sourceLineNo">332</span><a name="line.332"></a>
-<span class="sourceLineNo">333</span>    private void updateState(final long procId, final boolean isDeleted) {<a name="line.333"></a>
-<span class="sourceLineNo">334</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.334"></a>
-<span class="sourceLineNo">335</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.335"></a>
-<span class="sourceLineNo">336</span>      long value = (1L &lt;&lt; bitmapIndex);<a name="line.336"></a>
-<span class="sourceLineNo">337</span><a name="line.337"></a>
-<span class="sourceLineNo">338</span>      if (isDeleted) {<a name="line.338"></a>
-<span class="sourceLineNo">339</span>        updated[wordIndex] |= value;<a name="line.339"></a>
-<span class="sourceLineNo">340</span>        deleted[wordIndex] |= value;<a name="line.340"></a>
-<span class="sourceLineNo">341</span>      } else {<a name="line.341"></a>
-<span class="sourceLineNo">342</span>        updated[wordIndex] |= value;<a name="line.342"></a>
-<span class="sourceLineNo">343</span>        deleted[wordIndex] &amp;= ~value;<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><a name="line.346"></a>
-<span class="sourceLineNo">347</span>    // ========================================================================<a name="line.347"></a>
-<span class="sourceLineNo">348</span>    //  Helpers<a name="line.348"></a>
-<span class="sourceLineNo">349</span>    // ========================================================================<a name="line.349"></a>
-<span class="sourceLineNo">350</span>    private static long alignUp(final long x) {<a name="line.350"></a>
-<span class="sourceLineNo">351</span>      return (x + (BITS_PER_WORD - 1)) &amp; -BITS_PER_WORD;<a name="line.351"></a>
-<span class="sourceLineNo">352</span>    }<a name="line.352"></a>
-<span class="sourceLineNo">353</span><a name="line.353"></a>
-<span class="sourceLineNo">354</span>    private static long alignDown(final long x) {<a name="line.354"></a>
-<span class="sourceLineNo">355</span>      return x &amp; -BITS_PER_WORD;<a name="line.355"></a>
-<span class="sourceLineNo">356</span>    }<a name="line.356"></a>
-<span class="sourceLineNo">357</span>  }<a name="line.357"></a>
-<span class="sourceLineNo">358</span><a name="line.358"></a>
-<span class="sourceLineNo">359</span>  public void insert(final Procedure proc, final Procedure[] subprocs) {<a name="line.359"></a>
-<span class="sourceLineNo">360</span>    insert(proc.getProcId());<a name="line.360"></a>
-<span class="sourceLineNo">361</span>    if (subprocs != null) {<a name="line.361"></a>
-<span class="sourceLineNo">362</span>      for (int i = 0; i &lt; subprocs.length; ++i) {<a name="line.362"></a>
-<span class="sourceLineNo">363</span>        insert(subprocs[i].getProcId());<a name="line.363"></a>
-<span class="sourceLineNo">364</span>      }<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>  public void update(final Procedure proc) {<a name="line.368"></a>
-<span class="sourceLineNo">369</span>    update(proc.getProcId());<a name="line.369"></a>
-<span class="sourceLineNo">370</span>  }<a name="line.370"></a>
-<span class="sourceLineNo">371</span><a name="line.371"></a>
-<span class="sourceLineNo">372</span>  public void insert(long procId) {<a name="line.372"></a>
-<span class="sourceLineNo">373</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.373"></a>
-<span class="sourceLineNo">374</span>    node.update(procId);<a name="line.374"></a>
-<span class="sourceLineNo">375</span>    trackProcIds(procId);<a name="line.375"></a>
-<span class="sourceLineNo">376</span>  }<a name="line.376"></a>
-<span class="sourceLineNo">377</span><a name="line.377"></a>
-<span class="sourceLineNo">378</span>  public void update(long procId) {<a name="line.378"></a>
-<span class="sourceLineNo">379</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.379"></a>
-<span class="sourceLineNo">380</span>    assert entry != null : "expected node to update procId=" + procId;<a name="line.380"></a>
-<span class="sourceLineNo">381</span><a name="line.381"></a>
-<span class="sourceLineNo">382</span>    BitSetNode node = entry.getValue();<a name="line.382"></a>
-<span class="sourceLineNo">383</span>    assert node.contains(procId);<a name="line.383"></a>
-<span class="sourceLineNo">384</span>    node.update(procId);<a name="line.384"></a>
-<span class="sourceLineNo">385</span>    trackProcIds(procId);<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>  public void delete(long procId) {<a name="line.388"></a>
-<span class="sourceLineNo">389</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.389"></a>
-<span class="sourceLineNo">390</span>    assert entry != null : "expected node to delete procId=" + procId;<a name="line.390"></a>
-<span class="sourceLineNo">391</span><a name="line.391"></a>
-<span class="sourceLineNo">392</span>    BitSetNode node = entry.getValue();<a name="line.392"></a>
-<span class="sourceLineNo">393</span>    assert node.contains(procId) : "expected procId in the node";<a name="line.393"></a>
-<span class="sourceLineNo">394</span>    node.delete(procId);<a name="line.394"></a>
-<span class="sourceLineNo">395</span><a name="line.395"></a>
-<span class="sourceLineNo">396</span>    if (!keepDeletes &amp;&amp; node.isEmpty()) {<a name="line.396"></a>
-<span class="sourceLineNo">397</span>      // TODO: RESET if (map.size() == 1)<a name="line.397"></a>
-<span class="sourceLineNo">398</span>      map.remove(entry.getKey());<a name="line.398"></a>
-<span class="sourceLineNo">399</span>    }<a name="line.399"></a>
-<span class="sourceLineNo">400</span><a name="line.400"></a>
-<span class="sourceLineNo">401</span>    trackProcIds(procId);<a name="line.401"></a>
-<span class="sourceLineNo">402</span>  }<a name="line.402"></a>
-<span class="sourceLineNo">403</span><a name="line.403"></a>
-<span class="sourceLineNo">404</span>  private void trackProcIds(long procId) {<a name="line.404"></a>
-<span class="sourceLineNo">405</span>    minUpdatedProcId = Math.min(minUpdatedProcId, procId);<a name="line.405"></a>
-<span class="sourceLineNo">406</span>    maxUpdatedProcId = Math.max(maxUpdatedProcId, procId);<a name="line.406"></a>
-<span class="sourceLineNo">407</span>  }<a name="line.407"></a>
-<span class="sourceLineNo">408</span><a name="line.408"></a>
-<span class="sourceLineNo">409</span>  public long getUpdatedMinProcId() {<a name="line.409"></a>
-<span class="sourceLineNo">410</span>    return minUpdatedProcId;<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>  public long getUpdatedMaxProcId() {<a name="line.413"></a>
-<span class="sourceLineNo">414</span>    return maxUpdatedProcId;<a name="line.414"></a>
+<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos;<a name="line.30"></a>
+<span class="sourceLineNo">031</span><a name="line.31"></a>
+<span class="sourceLineNo">032</span>/**<a name="line.32"></a>
+<span class="sourceLineNo">033</span> * Keeps track of live procedures.<a name="line.33"></a>
+<span class="sourceLineNo">034</span> *<a name="line.34"></a>
+<span class="sourceLineNo">035</span> * It can be used by the ProcedureStore to identify which procedures are already<a name="line.35"></a>
+<span class="sourceLineNo">036</span> * deleted/completed to avoid the deserialization step on restart.<a name="line.36"></a>
+<span class="sourceLineNo">037</span> */<a name="line.37"></a>
+<span class="sourceLineNo">038</span>@InterfaceAudience.Private<a name="line.38"></a>
+<span class="sourceLineNo">039</span>@InterfaceStability.Evolving<a name="line.39"></a>
+<span class="sourceLineNo">040</span>public class ProcedureStoreTracker {<a name="line.40"></a>
+<span class="sourceLineNo">041</span>  private final TreeMap&lt;Long, BitSetNode&gt; map = new TreeMap&lt;Long, BitSetNode&gt;();<a name="line.41"></a>
+<span class="sourceLineNo">042</span><a name="line.42"></a>
+<span class="sourceLineNo">043</span>  private boolean keepDeletes = false;<a name="line.43"></a>
+<span class="sourceLineNo">044</span>  private boolean partial = false;<a name="line.44"></a>
+<span class="sourceLineNo">045</span><a name="line.45"></a>
+<span class="sourceLineNo">046</span>  private long minUpdatedProcId = Long.MAX_VALUE;<a name="line.46"></a>
+<span class="sourceLineNo">047</span>  private long maxUpdatedProcId = Long.MIN_VALUE;<a name="line.47"></a>
+<span class="sourceLineNo">048</span><a name="line.48"></a>
+<span class="sourceLineNo">049</span>  public enum DeleteState { YES, NO, MAYBE }<a name="line.49"></a>
+<span class="sourceLineNo">050</span><a name="line.50"></a>
+<span class="sourceLineNo">051</span>  public static class BitSetNode {<a name="line.51"></a>
+<span class="sourceLineNo">052</span>    private final static long WORD_MASK = 0xffffffffffffffffL;<a name="line.52"></a>
+<span class="sourceLineNo">053</span>    private final static int ADDRESS_BITS_PER_WORD = 6;<a name="line.53"></a>
+<span class="sourceLineNo">054</span>    private final static int BITS_PER_WORD = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.54"></a>
+<span class="sourceLineNo">055</span>    private final static int MAX_NODE_SIZE = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.55"></a>
+<span class="sourceLineNo">056</span><a name="line.56"></a>
+<span class="sourceLineNo">057</span>    private final boolean partial;<a name="line.57"></a>
+<span class="sourceLineNo">058</span>    private long[] updated;<a name="line.58"></a>
+<span class="sourceLineNo">059</span>    private long[] deleted;<a name="line.59"></a>
+<span class="sourceLineNo">060</span>    private long start;<a name="line.60"></a>
+<span class="sourceLineNo">061</span><a name="line.61"></a>
+<span class="sourceLineNo">062</span>    public void dump() {<a name="line.62"></a>
+<span class="sourceLineNo">063</span>      System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(),<a name="line.63"></a>
+<span class="sourceLineNo">064</span>        getMinProcId(), getMaxProcId());<a name="line.64"></a>
+<span class="sourceLineNo">065</span>      System.out.println("Update:");<a name="line.65"></a>
+<span class="sourceLineNo">066</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.66"></a>
+<span class="sourceLineNo">067</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.67"></a>
+<span class="sourceLineNo">068</span>          System.out.print((updated[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.68"></a>
+<span class="sourceLineNo">069</span>        }<a name="line.69"></a>
+<span class="sourceLineNo">070</span>        System.out.println(" " + i);<a name="line.70"></a>
+<span class="sourceLineNo">071</span>      }<a name="line.71"></a>
+<span class="sourceLineNo">072</span>      System.out.println();<a name="line.72"></a>
+<span class="sourceLineNo">073</span>      System.out.println("Delete:");<a name="line.73"></a>
+<span class="sourceLineNo">074</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.74"></a>
+<span class="sourceLineNo">075</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.75"></a>
+<span class="sourceLineNo">076</span>          System.out.print((deleted[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.76"></a>
+<span class="sourceLineNo">077</span>        }<a name="line.77"></a>
+<span class="sourceLineNo">078</span>        System.out.println(" " + i);<a name="line.78"></a>
+<span class="sourceLineNo">079</span>      }<a name="line.79"></a>
+<span class="sourceLineNo">080</span>      System.out.println();<a name="line.80"></a>
+<span class="sourceLineNo">081</span>    }<a name="line.81"></a>
+<span class="sourceLineNo">082</span><a name="line.82"></a>
+<span class="sourceLineNo">083</span>    public BitSetNode(final long procId, final boolean partial) {<a name="line.83"></a>
+<span class="sourceLineNo">084</span>      start = alignDown(procId);<a name="line.84"></a>
+<span class="sourceLineNo">085</span><a name="line.85"></a>
+<span class="sourceLineNo">086</span>      int count = 1;<a name="line.86"></a>
+<span class="sourceLineNo">087</span>      updated = new long[count];<a name="line.87"></a>
+<span class="sourceLineNo">088</span>      deleted = new long[count];<a name="line.88"></a>
+<span class="sourceLineNo">089</span>      for (int i = 0; i &lt; count; ++i) {<a name="line.89"></a>
+<span class="sourceLineNo">090</span>        updated[i] = 0;<a name="line.90"></a>
+<span class="sourceLineNo">091</span>        deleted[i] = partial ? 0 : WORD_MASK;<a name="line.91"></a>
+<span class="sourceLineNo">092</span>      }<a name="line.92"></a>
+<span class="sourceLineNo">093</span><a name="line.93"></a>
+<span class="sourceLineNo">094</span>      this.partial = partial;<a name="line.94"></a>
+<span class="sourceLineNo">095</span>      updateState(procId, false);<a name="line.95"></a>
+<span class="sourceLineNo">096</span>    }<a name="line.96"></a>
+<span class="sourceLineNo">097</span><a name="line.97"></a>
+<span class="sourceLineNo">098</span>    protected BitSetNode(final long start, final long[] updated, final long[] deleted) {<a name="line.98"></a>
+<span class="sourceLineNo">099</span>      this.start = start;<a name="line.99"></a>
+<span class="sourceLineNo">100</span>      this.updated = updated;<a name="line.100"></a>
+<span class="sourceLineNo">101</span>      this.deleted = deleted;<a name="line.101"></a>
+<span class="sourceLineNo">102</span>      this.partial = false;<a name="line.102"></a>
+<span class="sourceLineNo">103</span>    }<a name="line.103"></a>
+<span class="sourceLineNo">104</span><a name="line.104"></a>
+<span class="sourceLineNo">105</span>    public void update(final long procId) {<a name="line.105"></a>
+<span class="sourceLineNo">106</span>      updateState(procId, false);<a name="line.106"></a>
+<span class="sourceLineNo">107</span>    }<a name="line.107"></a>
+<span class="sourceLineNo">108</span><a name="line.108"></a>
+<span class="sourceLineNo">109</span>    public void delete(final long procId) {<a name="line.109"></a>
+<span class="sourceLineNo">110</span>      updateState(procId, true);<a name="line.110"></a>
+<span class="sourceLineNo">111</span>    }<a name="line.111"></a>
+<span class="sourceLineNo">112</span><a name="line.112"></a>
+<span class="sourceLineNo">113</span>    public Long getStart() {<a name="line.113"></a>
+<span class="sourceLineNo">114</span>      return start;<a name="line.114"></a>
+<span class="sourceLineNo">115</span>    }<a name="line.115"></a>
+<span class="sourceLineNo">116</span><a name="line.116"></a>
+<span class="sourceLineNo">117</span>    public Long getEnd() {<a name="line.117"></a>
+<span class="sourceLineNo">118</span>      return start + (updated.length &lt;&lt; ADDRESS_BITS_PER_WORD) - 1;<a name="line.118"></a>
+<span class="sourceLineNo">119</span>    }<a name="line.119"></a>
+<span class="sourceLineNo">120</span><a name="line.120"></a>
+<span class="sourceLineNo">121</span>    public boolean contains(final long procId) {<a name="line.121"></a>
+<span class="sourceLineNo">122</span>      return start &lt;= procId &amp;&amp; procId &lt;= getEnd();<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 DeleteState isDeleted(final long procId) {<a name="line.125"></a>
+<span class="sourceLineNo">126</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.126"></a>
+<span class="sourceLineNo">127</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.127"></a>
+<span class="sourceLineNo">128</span>      if (wordIndex &gt;= deleted.length) {<a name="line.128"></a>
+<span class="sourceLineNo">129</span>        return DeleteState.MAYBE;<a name="line.129"></a>
+<span class="sourceLineNo">130</span>      }<a name="line.130"></a>
+<span class="sourceLineNo">131</span>      return (deleted[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0 ? DeleteState.YES : DeleteState.NO;<a name="line.131"></a>
+<span class="sourceLineNo">132</span>    }<a name="line.132"></a>
+<span class="sourceLineNo">133</span><a name="line.133"></a>
+<span class="sourceLineNo">134</span>    private boolean isUpdated(final long procId) {<a name="line.134"></a>
+<span class="sourceLineNo">135</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.135"></a>
+<span class="sourceLineNo">136</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.136"></a>
+<span class="sourceLineNo">137</span>      if (wordIndex &gt;= updated.length) {<a name="line.137"></a>
+<span class="sourceLineNo">138</span>        return false;<a name="line.138"></a>
+<span class="sourceLineNo">139</span>      }<a name="line.139"></a>
+<span class="sourceLineNo">140</span>      return (updated[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0;<a name="line.140"></a>
+<span class="sourceLineNo">141</span>    }<a name="line.141"></a>
+<span class="sourceLineNo">142</span><a name="line.142"></a>
+<span class="sourceLineNo">143</span>    public boolean isUpdated() {<a name="line.143"></a>
+<span class="sourceLineNo">144</span>      // TODO: cache the value<a name="line.144"></a>
+<span class="sourceLineNo">145</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.145"></a>
+<span class="sourceLineNo">146</span>        if ((updated[i] | deleted[i]) != WORD_MASK) {<a name="line.146"></a>
+<span class="sourceLineNo">147</span>          return false;<a name="line.147"></a>
+<span class="sourceLineNo">148</span>        }<a name="line.148"></a>
+<span class="sourceLineNo">149</span>      }<a name="line.149"></a>
+<span class="sourceLineNo">150</span>      return true;<a name="line.150"></a>
+<span class="sourceLineNo">151</span>    }<a name="line.151"></a>
+<span class="sourceLineNo">152</span><a name="line.152"></a>
+<span class="sourceLineNo">153</span>    public boolean isEmpty() {<a name="line.153"></a>
+<span class="sourceLineNo">154</span>      // TODO: cache the value<a name="line.154"></a>
+<span class="sourceLineNo">155</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.155"></a>
+<span class="sourceLineNo">156</span>        if (deleted[i] != WORD_MASK) {<a name="line.156"></a>
+<span class="sourceLineNo">157</span>          return false;<a name="line.157"></a>
+<span class="sourceLineNo">158</span>        }<a name="line.158"></a>
+<span class="sourceLineNo">159</span>      }<a name="line.159"></a>
+<span class="sourceLineNo">160</span>      return true;<a name="line.160"></a>
+<span class="sourceLineNo">161</span>    }<a name="line.161"></a>
+<span class="sourceLineNo">162</span><a name="line.162"></a>
+<span class="sourceLineNo">163</span>    public void resetUpdates() {<a name="line.163"></a>
+<span class="sourceLineNo">164</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.164"></a>
+<span class="sourceLineNo">165</span>        updated[i] = 0;<a name="line.165"></a>
+<span class="sourceLineNo">166</span>      }<a name="line.166"></a>
+<span class="sourceLineNo">167</span>    }<a name="line.167"></a>
+<span class="sourceLineNo">168</span><a name="line.168"></a>
+<span class="sourceLineNo">169</span>    public void undeleteAll() {<a name="line.169"></a>
+<span class="sourceLineNo">170</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.170"></a>
+<span class="sourceLineNo">171</span>        deleted[i] = 0;<a name="line.171"></a>
+<span class="sourceLineNo">172</span>      }<a name="line.172"></a>
+<span class="sourceLineNo">173</span>    }<a name="line.173"></a>
+<span class="sourceLineNo">174</span><a name="line.174"></a>
+<span class="sourceLineNo">175</span>    public void unsetPartialFlag() {<a name="line.175"></a>
+<span class="sourceLineNo">176</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.176"></a>
+<span class="sourceLineNo">177</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.177"></a>
+<span class="sourceLineNo">178</span>          if ((updated[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.178"></a>
+<span class="sourceLineNo">179</span>            deleted[i] |= (1L &lt;&lt; j);<a name="line.179"></a>
+<span class="sourceLineNo">180</span>          }<a name="line.180"></a>
+<span class="sourceLineNo">181</span>        }<a name="line.181"></a>
+<span class="sourceLineNo">182</span>      }<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 ProcedureProtos.ProcedureStoreTracker.TrackerNode convert() {<a name="line.185"></a>
+<span class="sourceLineNo">186</span>      ProcedureProtos.ProcedureStoreTracker.TrackerNode.Builder builder =<a name="line.186"></a>
+<span class="sourceLineNo">187</span>        ProcedureProtos.ProcedureStoreTracker.TrackerNode.newBuilder();<a name="line.187"></a>
+<span class="sourceLineNo">188</span>      builder.setStartId(start);<a name="line.188"></a>
+<span class="sourceLineNo">189</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.189"></a>
+<span class="sourceLineNo">190</span>        builder.addUpdated(updated[i]);<a name="line.190"></a>
+<span class="sourceLineNo">191</span>        builder.addDeleted(deleted[i]);<a name="line.191"></a>
+<span class="sourceLineNo">192</span>      }<a name="line.192"></a>
+<span class="sourceLineNo">193</span>      return builder.build();<a name="line.193"></a>
+<span class="sourceLineNo">194</span>    }<a name="line.194"></a>
+<span class="sourceLineNo">195</span><a name="line.195"></a>
+<span class="sourceLineNo">196</span>    public static BitSetNode convert(ProcedureProtos.ProcedureStoreTracker.TrackerNode data) {<a name="line.196"></a>
+<span class="sourceLineNo">197</span>      long start = data.getStartId();<a name="line.197"></a>
+<span class="sourceLineNo">198</span>      int size = data.getUpdatedCount();<a name="line.198"></a>
+<span class="sourceLineNo">199</span>      long[] updated = new long[size];<a name="line.199"></a>
+<span class="sourceLineNo">200</span>      long[] deleted = new long[size];<a name="line.200"></a>
+<span class="sourceLineNo">201</span>      for (int i = 0; i &lt; size; ++i) {<a name="line.201"></a>
+<span class="sourceLineNo">202</span>        updated[i] = data.getUpdated(i);<a name="line.202"></a>
+<span class="sourceLineNo">203</span>        deleted[i] = data.getDeleted(i);<a name="line.203"></a>
+<span class="sourceLineNo">204</span>      }<a name="line.204"></a>
+<span class="sourceLineNo">205</span>      return new BitSetNode(start, updated, deleted);<a name="line.205"></a>
+<span class="sourceLineNo">206</span>    }<a name="line.206"></a>
+<span class="sourceLineNo">207</span><a name="line.207"></a>
+<span class="sourceLineNo">208</span>    // ========================================================================<a name="line.208"></a>
+<span class="sourceLineNo">209</span>    //  Grow/Merge Helpers<a name="line.209"></a>
+<span class="sourceLineNo">210</span>    // ========================================================================<a name="line.210"></a>
+<span class="sourceLineNo">211</span>    public boolean canGrow(final long procId) {<a name="line.211"></a>
+<span class="sourceLineNo">212</span>      return Math.abs(procId - start) &lt; MAX_NODE_SIZE;<a name="line.212"></a>
+<span class="sourceLineNo">213</span>    }<a name="line.213"></a>
+<span class="sourceLineNo">214</span><a name="line.214"></a>
+<span class="sourceLineNo">215</span>    public boolean canMerge(final BitSetNode rightNode) {<a name="line.215"></a>
+<span class="sourceLineNo">216</span>      assert start &lt; rightNode.getEnd();<a name="line.216"></a>
+<span class="sourceLineNo">217</span>      return (rightNode.getEnd() - start) &lt; MAX_NODE_SIZE;<a name="line.217"></a>
+<span class="sourceLineNo">218</span>    }<a name="line.218"></a>
+<span class="sourceLineNo">219</span><a name="line.219"></a>
+<span class="sourceLineNo">220</span>    public void grow(final long procId) {<a name="line.220"></a>
+<span class="sourceLineNo">221</span>      int delta, offset;<a name="line.221"></a>
+<span class="sourceLineNo">222</span><a name="line.222"></a>
+<span class="sourceLineNo">223</span>      if (procId &lt; start) {<a name="line.223"></a>
+<span class="sourceLineNo">224</span>        // add to head<a name="line.224"></a>
+<span class="sourceLineNo">225</span>        long newStart = alignDown(procId);<a name="line.225"></a>
+<span class="sourceLineNo">226</span>        delta = (int)(start - newStart) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.226"></a>
+<span class="sourceLineNo">227</span>        offset = delta;<a name="line.227"></a>
+<span class="sourceLineNo">228</span>        start = newStart;<a name="line.228"></a>
+<span class="sourceLineNo">229</span>      } else {<a name="line.229"></a>
+<span class="sourceLineNo">230</span>        // Add to tail<a name="line.230"></a>
+<span class="sourceLineNo">231</span>        long newEnd = alignUp(procId + 1);<a name="line.231"></a>
+<span class="sourceLineNo">232</span>        delta = (int)(newEnd - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.232"></a>
+<span class="sourceLineNo">233</span>        offset = 0;<a name="line.233"></a>
+<span class="sourceLineNo">234</span>      }<a name="line.234"></a>
+<span class="sourceLineNo">235</span><a name="line.235"></a>
+<span class="sourceLineNo">236</span>      long[] newBitmap;<a name="line.236"></a>
+<span class="sourceLineNo">237</span>      int oldSize = updated.length;<a name="line.237"></a>
+<span class="sourceLineNo">238</span><a name="line.238"></a>
+<span class="sourceLineNo">239</span>      newBitmap = new long[oldSize + delta];<a name="line.239"></a>
+<span class="sourceLineNo">240</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.240"></a>
+<span class="sourceLineNo">241</span>        newBitmap[i] = 0;<a name="line.241"></a>
+<span class="sourceLineNo">242</span>      }<a name="line.242"></a>
+<span class="sourceLineNo">243</span>      System.arraycopy(updated, 0, newBitmap, offset, oldSize);<a name="line.243"></a>
+<span class="sourceLineNo">244</span>      updated = newBitmap;<a name="line.244"></a>
+<span class="sourceLineNo">245</span><a name="line.245"></a>
+<span class="sourceLineNo">246</span>      newBitmap = new long[deleted.length + delta];<a name="line.246"></a>
+<span class="sourceLineNo">247</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.247"></a>
+<span class="sourceLineNo">248</span>        newBitmap[i] = partial ? 0 : WORD_MASK;<a name="line.248"></a>
+<span class="sourceLineNo">249</span>      }<a name="line.249"></a>
+<span class="sourceLineNo">250</span>      System.arraycopy(deleted, 0, newBitmap, offset, oldSize);<a name="line.250"></a>
+<span class="sourceLineNo">251</span>      deleted = newBitmap;<a name="line.251"></a>
+<span class="sourceLineNo">252</span>    }<a name="line.252"></a>
+<span class="sourceLineNo">253</span><a name="line.253"></a>
+<span class="sourceLineNo">254</span>    public void merge(final BitSetNode rightNode) {<a name="line.254"></a>
+<span class="sourceLineNo">255</span>      int delta = (int)(rightNode.getEnd() - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.255"></a>
+<span class="sourceLineNo">256</span><a name="line.256"></a>
+<span class="sourceLineNo">257</span>      long[] newBitmap;<a name="line.257"></a>
+<span class="sourceLineNo">258</span>      int oldSize = updated.length;<a name="line.258"></a>
+<span class="sourceLineNo">259</span>      int newSize = (delta - rightNode.updated.length);<a name="line.259"></a>
+<span class="sourceLineNo">260</span>      int offset = oldSize + newSize;<a name="line.260"></a>
+<span class="sourceLineNo">261</span><a name="line.261"></a>
+<span class="sourceLineNo">262</span>      newBitmap = new long[oldSize + delta];<a name="line.262"></a>
+<span class="sourceLineNo">263</span>      System.arraycopy(updated, 0, newBitmap, 0, oldSize);<a name="line.263"></a>
+<span class="sourceLineNo">264</span>      System.arraycopy(rightNode.updated, 0, newBitmap, offset, rightNode.updated.length);<a name="line.264"></a>
+<span class="sourceLineNo">265</span>      updated = newBitmap;<a name="line.265"></a>
+<span class="sourceLineNo">266</span><a name="line.266"></a>
+<span class="sourceLineNo">267</span>      newBitmap = new long[oldSize + delta];<a name="line.267"></a>
+<span class="sourceLineNo">268</span>      System.arraycopy(deleted, 0, newBitmap, 0, oldSize);<a name="line.268"></a>
+<span class="sourceLineNo">269</span>      System.arraycopy(rightNode.deleted, 0, newBitmap, offset, rightNode.deleted.length);<a name="line.269"></a>
+<span class="sourceLineNo">270</span>      deleted = newBitmap;<a name="line.270"></a>
+<span class="sourceLineNo">271</span><a name="line.271"></a>
+<span class="sourceLineNo">272</span>      for (int i = 0; i &lt; newSize; ++i) {<a name="line.272"></a>
+<span class="sourceLineNo">273</span>        updated[offset + i] = 0;<a name="line.273"></a>
+<span class="sourceLineNo">274</span>        deleted[offset + i] = partial ? 0 : WORD_MASK;<a name="line.274"></a>
+<span class="sourceLineNo">275</span>      }<a name="line.275"></a>
+<span class="sourceLineNo">276</span>    }<a name="line.276"></a>
+<span class="sourceLineNo">277</span><a name="line.277"></a>
+<span class="sourceLineNo">278</span>    @Override<a name="line.278"></a>
+<span class="sourceLineNo">279</span>    public String toString() {<a name="line.279"></a>
+<span class="sourceLineNo">280</span>      return "BitSetNode(" + getStart() + "-" + getEnd() + ")";<a name="line.280"></a>
+<span class="sourceLineNo">281</span>    }<a name="line.281"></a>
+<span class="sourceLineNo">282</span><a name="line.282"></a>
+<span class="sourceLineNo">283</span>    // ========================================================================<a name="line.283"></a>
+<span class="sourceLineNo">284</span>    //  Min/Max Helpers<a name="line.284"></a>
+<span class="sourceLineNo">285</span>    // ========================================================================<a name="line.285"></a>
+<span class="sourceLineNo">286</span>    public long getMinProcId() {<a name="line.286"></a>
+<span class="sourceLineNo">287</span>      long minProcId = start;<a name="line.287"></a>
+<span class="sourceLineNo">288</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.288"></a>
+<span class="sourceLineNo">289</span>        if (deleted[i] == 0) {<a name="line.289"></a>
+<span class="sourceLineNo">290</span>          return(minProcId);<a name="line.290"></a>
+<span class="sourceLineNo">291</span>        }<a name="line.291"></a>
+<span class="sourceLineNo">292</span><a name="line.292"></a>
+<span class="sourceLineNo">293</span>        if (deleted[i] != WORD_MASK) {<a name="line.293"></a>
+<span class="sourceLineNo">294</span>          for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.294"></a>
+<span class="sourceLineNo">295</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) != 0) {<a name="line.295"></a>
+<span class="sourceLineNo">296</span>              return minProcId + j;<a name="line.296"></a>
+<span class="sourceLineNo">297</span>            }<a name="line.297"></a>
+<span class="sourceLineNo">298</span>          }<a name="line.298"></a>
+<span class="sourceLineNo">299</span>        }<a name="line.299"></a>
+<span class="sourceLineNo">300</span><a name="line.300"></a>
+<span class="sourceLineNo">301</span>        minProcId += BITS_PER_WORD;<a name="line.301"></a>
+<span class="sourceLineNo">302</span>      }<a name="line.302"></a>
+<span class="sourceLineNo">303</span>      return minProcId;<a name="line.303"></a>
+<span class="sourceLineNo">304</span>    }<a name="line.304"></a>
+<span class="sourceLineNo">305</span><a name="line.305"></a>
+<span class="sourceLineNo">306</span>    public long getMaxProcId() {<a name="line.306"></a>
+<span class="sourceLineNo">307</span>      long maxProcId = getEnd();<a name="line.307"></a>
+<span class="sourceLineNo">308</span>      for (int i = deleted.length - 1; i &gt;= 0; --i) {<a name="line.308"></a>
+<span class="sourceLineNo">309</span>        if (deleted[i] == 0) {<a name="line.309"></a>
+<span class="sourceLineNo">310</span>          return maxProcId;<a name="line.310"></a>
+<span class="sourceLineNo">311</span>        }<a name="line.311"></a>
+<span class="sourceLineNo">312</span><a name="line.312"></a>
+<span class="sourceLineNo">313</span>        if (deleted[i] != WORD_MASK) {<a name="line.313"></a>
+<span class="sourceLineNo">314</span>          for (int j = BITS_PER_WORD - 1; j &gt;= 0; --j) {<a name="line.314"></a>
+<span class="sourceLineNo">315</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.315"></a>
+<span class="sourceLineNo">316</span>              return maxProcId - (BITS_PER_WORD - 1 - j);<a name="line.316"></a>
+<span class="sourceLineNo">317</span>            }<a name="line.317"></a>
+<span class="sourceLineNo">318</span>          }<a name="line.318"></a>
+<span class="sourceLineNo">319</span>        }<a name="line.319"></a>
+<span class="sourceLineNo">320</span>        maxProcId -= BITS_PER_WORD;<a name="line.320"></a>
+<span class="sourceLineNo">321</span>      }<a name="line.321"></a>
+<span class="sourceLineNo">322</span>      return maxProcId;<a name="line.322"></a>
+<span class="sourceLineNo">323</span>    }<a name="line.323"></a>
+<span class="sourceLineNo">324</span><a name="line.324"></a>
+<span class="sourceLineNo">325</span>    // ========================================================================<a name="line.325"></a>
+<span class="sourceLineNo">326</span>    //  Bitmap Helpers<a name="line.326"></a>
+<span class="sourceLineNo">327</span>    // ========================================================================<a name="line.327"></a>
+<span class="sourceLineNo">328</span>    private int getBitmapIndex(final long procId) {<a name="line.328"></a>
+<span class="sourceLineNo">329</span>      return (int)(procId - start);<a name="line.329"></a>
+<span class="sourceLineNo">330</span>    }<a name="line.330"></a>
+<span class="sourceLineNo">331</span><a name="line.331"></a>
+<span class="sourceLineNo">332</span>    private void updateState(final long procId, final boolean isDeleted) {<a name="line.332"></a>
+<span class="sourceLineNo">333</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.333"></a>
+<span class="sourceLineNo">334</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.334"></a>
+<span class="sourceLineNo">335</span>      long value = (1L &lt;&lt; bitmapIndex);<a name="line.335"></a>
+<span class="sourceLineNo">336</span><a name="line.336"></a>
+<span class="sourceLineNo">337</span>      if (isDeleted) {<a name="line.337"></a>
+<span class="sourceLineNo">338</span>        updated[wordIndex] |= value;<a name="line.338"></a>
+<span class="sourceLineNo">339</span>        deleted[wordIndex] |= value;<a name="line.339"></a>
+<span class="sourceLineNo">340</span>      } else {<a name="line.340"></a>
+<span class="sourceLineNo">341</span>        updated[wordIndex] |= value;<a name="line.341"></a>
+<span class="sourceLineNo">342</span>        deleted[wordIndex] &amp;= ~value;<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>    // ========================================================================<a name="line.346"></a>
+<span class="sourceLineNo">347</span>    //  Helpers<a name="line.347"></a>
+<span class="sourceLineNo">348</span>    // ========================================================================<a name="line.348"></a>
+<span class="sourceLineNo">349</span>    private static long alignUp(final long x) {<a name="line.349"></a>
+<span class="sourceLineNo">350</span>      return (x + (BITS_PER_WORD - 1)) &amp; -BITS_PER_WORD;<a name="line.350"></a>
+<span class="sourceLineNo">351</span>    }<a name="line.351"></a>
+<span class="sourceLineNo">352</span><a name="line.352"></a>
+<span class="sourceLineNo">353</span>    private static long alignDown(final long x) {<a name="line.353"></a>
+<span class="sourceLineNo">354</span>      return x &amp; -BITS_PER_WORD;<a name="line.354"></a>
+<span class="sourceLineNo">355</span>    }<a name="line.355"></a>
+<span class="sourceLineNo">356</span>  }<a name="line.356"></a>
+<span class="sourceLineNo">357</span><a name="line.357"></a>
+<span class="sourceLineNo">358</span>  public void insert(long procId) {<a name="line.358"></a>
+<span class="sourceLineNo">359</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.359"></a>
+<span class="sourceLineNo">360</span>    node.update(procId);<a name="line.360"></a>
+<span class="sourceLineNo">361</span>    trackProcIds(procId);<a name="line.361"></a>
+<span class="sourceLineNo">362</span>  }<a name="line.362"></a>
+<span class="sourceLineNo">363</span><a name="line.363"></a>
+<span class="sourceLineNo">364</span>  public void insert(final long procId, final long[] subProcIds) {<a name="line.364"></a>
+<span class="sourceLineNo">365</span>    update(procId);<a name="line.365"></a>
+<span class="sourceLineNo">366</span>    for (int i = 0; i &lt; subProcIds.length; ++i) {<a name="line.366"></a>
+<span class="sourceLineNo">367</span>      insert(subProcIds[i]);<a name="line.367"></a>
+<span class="sourceLineNo">368</span>    }<a name="line.368"></a>
+<span class="sourceLineNo">369</span>  }<a name="line.369"></a>
+<span class="sourceLineNo">370</span><a name="line.370"></a>
+<span class="sourceLineNo">371</span>  public void update(long procId) {<a name="line.371"></a>
+<span class="sourceLineNo">372</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.372"></a>
+<span class="sourceLineNo">373</span>    assert entry != null : "expected node to update procId=" + procId;<a name="line.373"></a>
+<span class="sourceLineNo">374</span><a name="line.374"></a>
+<span class="sourceLineNo">375</span>    BitSetNode node = entry.getValue();<a name="line.375"></a>
+<span class="sourceLineNo">376</span>    assert node.contains(procId);<a name="line.376"></a>
+<span class="sourceLineNo">377</span>    node.update(procId);<a name="line.377"></a>
+<span class="sourceLineNo">378</span>    trackProcIds(procId);<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>  public void delete(long procId) {<a name="line.381"></a>
+<span class="sourceLineNo">382</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.382"></a>
+<span class="sourceLineNo">383</span>    assert entry != null : "expected node to delete procId=" + procId;<a name="line.383"></a>
+<span class="sourceLineNo">384</span><a name="line.384"></a>
+<span class="sourceLineNo">385</span>    BitSetNode node = entry.getValue();<a name="line.385"></a>
+<span class="sourceLineNo">386</span>    assert node.contains(procId) : "expected procId in the node";<a name="line.386"></a>
+<span class="sourceLineNo">387</span>    node.delete(procId);<a name="line.387"></a>
+<span class="sourceLineNo">388</span><a name="line.388"></a>
+<span class="sourceLineNo">389</span>    if (!keepDeletes &amp;&amp; node.isEmpty()) {<a name="line.389"></a>
+<span class="sourceLineNo">390</span>      // TODO: RESET if (map.size() == 1)<a name="line.390"></a>
+<span class="sourceLineNo">391</span>      map.remove(entry.getKey());<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>    trackProcIds(procId);<a name="line.394"></a>
+<span class="sourceLineNo">395</span>  }<a name="line.395"></a>
+<span class="sourceLineNo">396</span><a name="line.396"></a>
+<span class="sourceLineNo">397</span>  private void trackProcIds(long procId) {<a name="line.397"></a>
+<span class="sourceLineNo">398</span>    minUpdatedProcId = Math.min(minUpdatedProcId, procId);<a name="line.398"></a>
+<span class="sourceLineNo">399</span>    maxUpdatedProcId = Math.max(maxUpdatedProcId, procId);<a name="line.399"></a>
+<span class="sourceLineNo">400</span>  }<a name="line.400"></a>
+<span class="sourceLineNo">401</span><a name="line.401"></a>
+<span class="sourceLineNo">402</span>  public long getUpdatedMinProcId() {<a name="line.402"></a>
+<span class="sourceLineNo">403</span>    return minUpdatedProcId;<a name="line.403"></a>
+<span class="sourceLineNo">404</span>  }<a name="line.404"></a>
+<span class="sourceLineNo">405</span><a name="line.405"></a>
+<span class="sourceLineNo">406</span>  public long getUpdatedMaxProcId() {<a name="line.406"></a>
+<span class="sourceLineNo">407</span>    return maxUpdatedProcId;<a name="line.407"></a>
+<span class="sourceLineNo">408</span>  }<a name="line.408"></a>
+<span class="sourceLineNo">409</span><a name="line.409"></a>
+<span class="sourceLineNo">410</span>  @InterfaceAudience.Private<a name="line.410"></a>
+<span class="sourceLineNo">411</span>  public void setDeleted(final long procId, final boolean isDeleted) {<a name="line.411"></a>
+<span class="sourceLineNo">412</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.412"></a>
+<span class="sourceLineNo">413</span>    assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node;<a name="line.413"></a>
+<span class="sourceLineNo">414</span>    node.updateState(procId, isDeleted);<a name="line.414"></a>
 <span class="sourceLineNo">415</span>  }<a name="line.415"></a>
 <span class="sourceLineNo">416</span><a name="line.416"></a>
-<span class="sourceLineNo">417</span>  @InterfaceAudience.Private<a name="line.417"></a>
-<span class="sourceLineNo">418</span>  public void setDeleted(final long procId, final boolean isDeleted) {<a name="line.418"></a>
-<span class="sourceLineNo">419</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.419"></a>
-<span class="sourceLineNo">420</span>    assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node;<a name="line.420"></a>
-<span class="sourceLineNo">421</span>    node.updateState(procId, isDeleted);<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>  public void clear() {<a name="line.424"></a>
-<span class="sourceLineNo">425</span>    this.map.clear();<a name="line.425"></a>
-<span class="sourceLineNo">426</span>    resetUpdates();<a name="line.426"></a>
-<span class="sourceLineNo">427</span>  }<a name="line.427"></a>
-<span class="sourceLineNo">428</span><a name="line.428"></a>
-<span class="sourceLineNo">429</span>  public DeleteState isDeleted(long procId) {<a name="line.429"></a>
-<span class="sourceLineNo">430</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.430"></a>
-<span class="sourceLineNo">431</span>    if (entry != null &amp;&amp; entry.getValue().contains(procId)) {<a name="line.431"></a>
-<span class="sourceLineNo">432</span>      BitSetNode node = entry.getValue();<a name="line.432"></a>
-<span class="sourceLineNo">433</span>      DeleteState state = node.isDeleted(procId);<a name="line.433"></a>
-<span class="sourceLineNo">434</span>      return partial &amp;&amp; !node.isUpdated(procId) ? DeleteState.MAYBE : state;<a name="line.434"></a>
-<span class="sourceLineNo">435</span>    }<a name="line.435"></a>
-<span class="sourceLineNo">436</span>    return partial ? DeleteState.MAYBE : DeleteState.YES;<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>  public long getMinProcId() {<a name="line.439"></a>
-<span class="sourceLineNo">440</span>    // TODO: Cache?<a name="line.440"></a>
-<span class="sourceLineNo">441</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.firstEntry();<a name="line.441"></a>
-<span class="sourceLineNo">442</span>    return entry == null ? 0 : entry.getValue().getMinProcId();<a name="line.442"></a>
-<span class="sourceLineNo">443</span>  }<a name="line.443"></a>
-<span class="sourceLineNo">444</span><a name="line.444"></a>
-<span class="sourceLineNo">445</span>  public void setKeepDeletes(boolean keepDeletes) {<a name="line.445"></a>
-<span class="sourceLineNo">446</span>    this.keepDeletes = keepDeletes;<a name="line.446"></a>
-<span class="sourceLineNo">447</span>    if (!keepDeletes) {<a name="line.447"></a>
-<span class="sourceLineNo">448</span>      Iterator&lt;Map.Entry&lt;Long, BitSetNode&gt;&gt; it = map.entrySet().iterator();<a name="line.448"></a>
-<span class="sourceLineNo">449</span>      while (it.hasNext()) {<a name="line.449"></a>
-<span class="sourceLineNo">450</span>        Map.Entry&lt;Long, BitSetNode&gt; entry = it.next();<a name="line.450"></a>
-<span class="sourceLineNo">451</span>        if (entry.getValue().isEmpty()) {<a name="line.451"></a>
-<span class="sourceLineNo">452</span>          it.remove();<a name="line.452"></a>
-<span class="sourceLineNo">453</span>        }<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><a name="line.457"></a>
-<span class="sourceLineNo">458</span>  public void setPartialFlag(boolean isPartial) {<a name="line.458"></a>
-<span class="sourceLineNo">459</span>    if (this.partial &amp;&amp; !isPartial) {<a name="line.459"></a>
-<span class="sourceLineNo">460</span>      for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.460"></a>
-<span class="sourceLineNo">461</span>        entry.getValue().unsetPartialFlag();<a name="line.461"></a>
-<span class="sourceLineNo">462</span>      }<a name="line.462"></a>
-<span class="sourceLineNo">463</span>    }<a name="line.463"></a>
-<span class="sourceLineNo">464</span>    this.partial = isPartial;<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 boolean isEmpty() {<a name="line.467"></a>
-<span class="sourceLineNo">468</span>    for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.468"></a>
-<span class="sourceLineNo">469</span>      if (entry.getValue().isEmpty() == false) {<a name="line.469"></a>
-<span class="sourceLineNo">470</span>        return false;<a name="line.470"></a>
-<span class="sourceLineNo">471</span>      }<a name="line.471"></a>
-<span class="sourceLineNo">472</span>    }<a name="line.472"></a>
-<span class="sourceLineNo">473</span>    return true;<a name="line.473"></a>
-<span class="sourceLineNo">474</span>  }<a name="line.474"></a>
-<span class="sourceLineNo">475</span><a name="line.475"></a>
-<span class="sourceLineNo">476</span>  public boolean isUpdated() {<a name="line.476"></a>
-<span class="sourceLineNo">477</span>    for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.477"></a>
-<span class="sourceLineNo">478</span>      if (entry.getValue().isUpdated() == false) {<a name="line.478"></a>
-<span class="sourceLineNo">479</span>        return false;<a name="line.479"></a>
-<span class="sourceLineNo">480</span>      }<a name="line.480"></a>
-<span class="sourceLineNo">481</span>    }<a name="line.481"></a>
-<span class="sourceLineNo">482</span>    return true;<a name="line.482"></a>
-<span class="sourceLineNo">483</span>  }<a name="line.483"></a>
-<span class="sourceLineNo">484</span><a name="line.484"></a>
-<span class="sourceLineNo">485</span>  public boolean isTracking(long minId, long maxId) {<a name="line.485"></a>
-<span class="sourceLineNo">486</span>    // TODO: we can make it more precise, instead of looking just at the block<a name="line.486"></a>
-<span class="sourceLineNo">487</span>    return map.floorEntry(minId) != null || map.floorEntry(maxId) != null;<a name="line.487"></a>
-<span class="sourceLineNo">488</span>  }<a name="line.488"></a>
-<span class="sourceLineNo">489</span><a name="line.489"></a>
-<span class="sourceLineNo">490</span>  public void resetUpdates() {<a name="line.490"></a>
-<span class="sourceLineNo">491</span>    for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.491"></a>
-<span class="sourceLineNo">492</span>      entry.getValue().resetUpdates();<a name="line.492"></a>
-<span class="sourceLineNo">493</span>    }<a name="line.493"></a>
-<span class="sourceLineNo">494</span>    minUpdatedProcId = Long.MAX_VALUE;<a name="line.494"></a>
-<span class="sourceLineNo">495</span>    maxUpdatedProcId = Long.MIN_VALUE;<a name="line.495"></a>
-<span class="sourceLineNo">496</span>  }<a name="line.496"></a>
-<span class="sourceLineNo">497</span><a name="line.497"></a>
-<span class="sourceLineNo">498</span>  public void undeleteAll() {<a name="line.498"></a>
-<span class="sourceLineNo">499</span>    for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.499"></a>
-<span class="sourceLineNo">500</span>      entry.getValue().undeleteAll();<a name="line.500"></a>
-<span class="sourceLineNo">501</span>    }<a name="line.501"></a>
-<span class="sourceLineNo">502</span>  }<a name="line.502"></a>
-<span class="sourceLineNo">503</span><a name="line.503"></a>
-<span class="sourceLineNo">504</span>  private BitSetNode getOrCreateNode(final long procId) {<a name="line.504"></a>
-<span class="sourceLineNo">505</span>    // can procId fit in the left node?<a name="line.505"></a>
-<span class="sourceLineNo">506</span>    BitSetNode leftNode = null;<a name="line.506"></a>
-<span class="sourceLineNo">507</span>    boolean leftCanGrow = false;<a name="line.507"></a>
-<span class="sourceLineNo">508</span>    Map.Entry&lt;Long, BitSetNode&gt; leftEntry = map.floorEntry(procId);<a name="line.508"></a>
-<span class="sourceLineNo">509</span>    if (leftEntry != null) {<a name="line.509"></a>
-<span class="sourceLineNo">510</span>      leftNode = leftEntry.getValue();<a name="line.510"></a>
-<span class="sourceLineNo">511</span>      if (leftNode.contains(procId)) {<a name="line.511"></a>
-<span class="sourceLineNo">512</span>        return leftNode;<a name="line.512"></a>
-<span class="sourceLineNo">513</span>      }<a name="line.513"></a>
-<span class="sourceLineNo">514</span>      leftCanGrow = leftNode.canGrow(procId);<a name="line.514"></a>
-<span class="sourceLineNo">515</span>    }<a name="line.515"></a>
-<span class="sourceLineNo">516</span><a name="line.516"></a>
-<span class="sourceLineNo">517</span>    BitSetNode rightNode = null;<a name="line.517"></a>
-<span class="sourceLineNo">518</span>    boolean rightCanGrow = false;<a name="line.518"></a>
-<span class="sourceLineNo">519</span>    Map.Entry&lt;Long, BitSetNode&gt; rightEntry = map.ceilingEntry(procId);<a name="line.519"></a>
-<span class="sourceLineNo">520</span>    if (rightEntry != null) {<a name="line.520"></a>
-<span class="sourceLineNo">521</span>      rightNode = rightEntry.getValue();<a name="line.521"></a>
-<span class="sourceLineNo">522</span>      rightCanGrow = rightNode.canGrow(procId);<a name="line.522"></a>
-<span class="sourceLineNo">523</span>      if (leftNode != null) {<a name="line.523"></a>
-<span class="sourceLineNo">524</span>        if (leftNode.canMerge(rightNode)) {<a name="line.524"></a>
-<span class="sourceLineNo">525</span>          // merge left and right node<a name="line.525"></a>
-<span class="sourceLineNo">526</span>          return mergeNodes(leftNode, rightNode);<a name="line.526"></a>
-<span class="sourceLineNo">527</span>        }<a name="line.527"></a>
-<span class="sourceLineNo">528</span><a name="line.528"></a>
-<span class="sourceLineNo">529</span>        if (leftCanGrow &amp;&amp; rightCanGrow) {<a name="line.529"></a>
-<span class="sourceLineNo">530</span>          if ((procId - leftNode.getEnd()) &lt;= (rightNode.getStart() - procId)) {<a name="line.530"></a>
-<span class="sourceLineNo">531</span>            // grow the left node<a name="line.531"></a>
-<span class="sourceLineNo">532</span>            return growNode(leftNode, procId);<a name="line.532"></a>
-<span class="sourceLineNo">533</span>          }<a name="line.533"></a>
-<span class="sourceLineNo">534</span>          // grow the right node<a name="line.534"></a>
-<span class="sourceLineNo">535</span>          return growNode(rightNode, procId);<a name="line.535"></a>
-<span class="sourceLineNo">536</span>        }<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>    // grow the left node<a name="line.540"></a>
-<span class="sourceLineNo">541</span>    if (leftCanGrow) {<a name="line.541"></a>
-<span class="sourceLineNo">542</span>      return growNode(leftNode, procId);<a name="line.542"></a>
-<span class="sourceLineNo">543</span>    }<a name="line.543"></a>
-<span class="sourceLineNo">544</span><a name="line.544"></a>
-<span class="sourceLineNo">545</span>    // grow the right node<a name="line.545"></a>
-<span class="sourceLineNo">546</span>    if (rightCanGrow) {<a name="line.546"></a>
-<span class="sourceLineNo">547</span>      return growNode(rightNode, procId);<a name="line.547"></a>
-<span class="sourceLineNo">548</span>    }<a name="line.548"></a>
-<span class="sourceLineNo">549</span><a name="line.549"></a>
-<span class="sourceLineNo">550</span>    // add new node<a name="line.550"></a>
-<span class="sourceLineNo">551</span>    BitSetNode node = new BitSetNode(procId, partial);<a name="line.551"></a>
+<span class="sourceLineNo">417</span>  public void clear() {<a name="line.417"></a>
+<span class="sourceLineNo">418</span>    this.map.clear();<a name="line.418"></a>
+<span class="sourceLineNo">419</span>    resetUpdates();<a name="line.419"></a>
+<span class="sourceLineNo">420</span>  }<a name="line.420"></a>
+<span class="sourceLineNo">421</span><a name="line.421"></a>
+<span class="sourceLineNo">422</span>  public DeleteState isDeleted(long procId) {<a name="line.422"></a>
+<span class="sourceLineNo">423</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.423"></a>
+<span class="sourceLineNo">424</span>    if (entry != null &amp;&amp; entry.getValue().contains(procId)) {<a name="line.424"></a>
+<span class="sourceLineNo">425</span>      BitSetNode node = entry.getValue();<a name="line.425"></a>
+<span class="sourceLineNo">426</span>      DeleteState state = node.isDeleted(procId);<a name="line.426"></a>
+<span class="sourceLineNo">427</span>      return partial &amp;&amp; !node.isUpdated(procId) ? DeleteState.MAYBE : state;<a name="line.427"></a>
+<span class="sourceLineNo">428</span>    }<a name="line.428"></a>
+<span class="sourceLineNo">429</span>    return partial ? DeleteState.MAYBE : DeleteState.YES;<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 long getMinProcId() {<a name="line.432"></a>
+<span class="sourceLineNo">433</span>    // TODO: Cache?<a name="line.433"></a>
+<span class="sourceLineNo">434</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.firstEntry();<a name="line.434"></a>
+<span class="sourceLineNo">435</span>    return entry == null ? 0 : entry.getValue().getMinProcId();<a name="line.435"></a>
+<span class="sourceLineNo">436</span>  }<a name="line.436"></a>
+<span class="sourceLineNo">437</span><a name="line.437"></a>
+<span class="sourceLineNo">438</span>  public void setKeepDeletes(boolean keepDeletes) {<a name="line.438"></a>
+<span class="sourceLineNo">439</span>    this.keepDeletes = keepDeletes;<a name="line.439"></a>
+<span class="sourceLineNo">440</span>    if (!keepDeletes) {<a name="line.440"></a>
+<span class="sourceLineNo">441</span>      Iterator&lt;Map.Entry&lt;Long, BitSetNode&gt;&gt; it = map.entrySet().iterator();<a name="line.441"></a>
+<span class="sourceLineNo">442</span>      while (it.hasNext()) {<a name="line.442"></a>
+<span class="sourceLineNo">443</span>        Map.Entry&lt;Long, BitSetNode&gt; entry = it.next();<a name="line.443"></a>
+<span class="sourceLineNo">444</span>        if (entry.getValue().isEmpty()) {<a name="line.444"></a>
+<span class="sourceLineNo">445</span>          it.remove();<a name="line.445"></a>
+<span class="sourceLineNo">446</span>        }<a name="line.446"></a>
+<span class="sourceLineNo">447</span>      }<a name="line.447"></a>
+<span class="sourceLineNo">448</span>    }<a name="line.448"></a>
+<span class="sourceLineNo">449</span>  }<a name="line.449"></a>
+<span class="sourceLineNo">450</span><a name="line.450"></a>
+<span class="sourceLineNo">451</span>  public void setPartialFlag(boolean isPartial) {<a name="line.451"></a>
+<span class="sourceLineNo">452</span>    if (this.partial &amp;&amp; !isPartial) {<a name="line.452"></a>
+<span class="sourceLineNo">453</span>      for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.453"></a>
+<span class="sourceLineNo">454</span>        entry.getValue().unsetPartialFlag();<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>    this.partial = isPartial;<a name="line.457"></a>
+<span class="sourceLineNo">458</span>  }<a name="line.458"></a>
+<span class="sourceLineNo">459</span><a name="line.459"></a>
+<span class="sourceLineNo">460</span>  public boolean isEmpty() {<a name="line.460"></a>
+<span class="sourceLineNo">461</span>    for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.461"></a>
+<span class="sourceLineNo">462</span>      if (entry.getValue().isEmpty() == false) {<a name="line.462"></a>
+<span class="sourceLineNo">463</span>        return false;<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>    return true;<a name="line.466"></a>
+<span class="sourceLineNo">467</span>  }<a name="line.467"></a>
+<span class="sourceLineNo">468</span><a name="line.468"></a>
+<span class="sourceLineNo">469</span>  public boolean isUpdated() {<a name="line.469"></a>
+<span class="sourceLineNo">470</span>    for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.470"></a>
+<span class="sourceLineNo">471</span>      if (entry.getValue().isUpdated() == false) {<a name="line.471"></a>
+<span class="sourceLineNo">472</span>        return false;<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>    return true;<a name="line.475"></a>
+<span class="sourceLineNo">476</span>  }<a name="line.476"></a>
+<spa

<TRUNCATED>

Mime
View raw message