Google Git
Sign in
apache / hbase-site / 28b9ba9f0344d234f149a8aaf693f9aba08650a5 / . / devapidocs / src-html / org / apache / hadoop / hbase / io / util / LRUDictionary.BidirectionalLRUMap.html
blob: e9b6a2577ec4118a5948c69591e54024e7c4d168 [file] [log] [blame]
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a>
<span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a>
<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a>
<span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a>
<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a>
<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a>
<span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a>
<span class="sourceLineNo">009</span> *<a name="line.9"></a>
<span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
<span class="sourceLineNo">011</span> *<a name="line.11"></a>
<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a>
<span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a>
<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a>
<span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a>
<span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a>
<span class="sourceLineNo">017</span> */<a name="line.17"></a>
<span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.io.util;<a name="line.18"></a>
<span class="sourceLineNo">019</span><a name="line.19"></a>
<span class="sourceLineNo">020</span>import java.nio.ByteBuffer;<a name="line.20"></a>
<span class="sourceLineNo">021</span>import java.util.HashMap;<a name="line.21"></a>
<span class="sourceLineNo">022</span>import org.apache.hadoop.hbase.util.ByteBufferUtils;<a name="line.22"></a>
<span class="sourceLineNo">023</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.23"></a>
<span class="sourceLineNo">024</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.24"></a>
<span class="sourceLineNo">025</span><a name="line.25"></a>
<span class="sourceLineNo">026</span>import org.apache.hbase.thirdparty.com.google.common.base.Preconditions;<a name="line.26"></a>
<span class="sourceLineNo">027</span><a name="line.27"></a>
<span class="sourceLineNo">028</span>/**<a name="line.28"></a>
<span class="sourceLineNo">029</span> * WALDictionary using an LRU eviction algorithm. Uses a linked list running through a hashtable.<a name="line.29"></a>
<span class="sourceLineNo">030</span> * Currently has max of 2^15 entries. Will start evicting if exceeds this number The maximum memory<a name="line.30"></a>
<span class="sourceLineNo">031</span> * we expect this dictionary to take in the worst case is about:<a name="line.31"></a>
<span class="sourceLineNo">032</span> * &lt;code&gt;(2 ^ 15) * 5 (Regionname, Row key, CF, Column qual, table) * 100 bytes<a name="line.32"></a>
<span class="sourceLineNo">033</span> * (these are some big names) = ~16MB&lt;/code&gt;. If you want to get silly, even at 1kb entries, it<a name="line.33"></a>
<span class="sourceLineNo">034</span> * maxes out at 160 megabytes.<a name="line.34"></a>
<span class="sourceLineNo">035</span> */<a name="line.35"></a>
<span class="sourceLineNo">036</span>@InterfaceAudience.Private<a name="line.36"></a>
<span class="sourceLineNo">037</span>public class LRUDictionary implements Dictionary {<a name="line.37"></a>
<span class="sourceLineNo">038</span><a name="line.38"></a>
<span class="sourceLineNo">039</span> BidirectionalLRUMap backingStore;<a name="line.39"></a>
<span class="sourceLineNo">040</span><a name="line.40"></a>
<span class="sourceLineNo">041</span> @Override<a name="line.41"></a>
<span class="sourceLineNo">042</span> public byte[] getEntry(short idx) {<a name="line.42"></a>
<span class="sourceLineNo">043</span> return backingStore.get(idx);<a name="line.43"></a>
<span class="sourceLineNo">044</span> }<a name="line.44"></a>
<span class="sourceLineNo">045</span><a name="line.45"></a>
<span class="sourceLineNo">046</span> @Override<a name="line.46"></a>
<span class="sourceLineNo">047</span> public void init(int initialSize) {<a name="line.47"></a>
<span class="sourceLineNo">048</span> backingStore = new BidirectionalLRUMap(initialSize);<a name="line.48"></a>
<span class="sourceLineNo">049</span> }<a name="line.49"></a>
<span class="sourceLineNo">050</span><a name="line.50"></a>
<span class="sourceLineNo">051</span> @Override<a name="line.51"></a>
<span class="sourceLineNo">052</span> public short findEntry(byte[] data, int offset, int length) {<a name="line.52"></a>
<span class="sourceLineNo">053</span> short ret = backingStore.findIdx(data, offset, length);<a name="line.53"></a>
<span class="sourceLineNo">054</span> if (ret == NOT_IN_DICTIONARY) {<a name="line.54"></a>
<span class="sourceLineNo">055</span> addEntry(data, offset, length);<a name="line.55"></a>
<span class="sourceLineNo">056</span> }<a name="line.56"></a>
<span class="sourceLineNo">057</span> return ret;<a name="line.57"></a>
<span class="sourceLineNo">058</span> }<a name="line.58"></a>
<span class="sourceLineNo">059</span><a name="line.59"></a>
<span class="sourceLineNo">060</span> @Override<a name="line.60"></a>
<span class="sourceLineNo">061</span> public short addEntry(byte[] data, int offset, int length) {<a name="line.61"></a>
<span class="sourceLineNo">062</span> return addEntryInternal(data, offset, length, true);<a name="line.62"></a>
<span class="sourceLineNo">063</span> }<a name="line.63"></a>
<span class="sourceLineNo">064</span><a name="line.64"></a>
<span class="sourceLineNo">065</span> private short addEntryInternal(byte[] data, int offset, int length, boolean copy) {<a name="line.65"></a>
<span class="sourceLineNo">066</span> if (length &lt;= 0) return NOT_IN_DICTIONARY;<a name="line.66"></a>
<span class="sourceLineNo">067</span> return backingStore.put(data, offset, length, copy);<a name="line.67"></a>
<span class="sourceLineNo">068</span> }<a name="line.68"></a>
<span class="sourceLineNo">069</span><a name="line.69"></a>
<span class="sourceLineNo">070</span> @Override<a name="line.70"></a>
<span class="sourceLineNo">071</span> public void clear() {<a name="line.71"></a>
<span class="sourceLineNo">072</span> backingStore.clear();<a name="line.72"></a>
<span class="sourceLineNo">073</span> }<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> * Internal class used to implement LRU eviction and dual lookup (by key and value). This is not<a name="line.76"></a>
<span class="sourceLineNo">077</span> * thread safe. Don't use in multi-threaded applications.<a name="line.77"></a>
<span class="sourceLineNo">078</span> */<a name="line.78"></a>
<span class="sourceLineNo">079</span> static class BidirectionalLRUMap {<a name="line.79"></a>
<span class="sourceLineNo">080</span> private int currSize = 0;<a name="line.80"></a>
<span class="sourceLineNo">081</span><a name="line.81"></a>
<span class="sourceLineNo">082</span> // Head and tail of the LRU list.<a name="line.82"></a>
<span class="sourceLineNo">083</span> private Node head;<a name="line.83"></a>
<span class="sourceLineNo">084</span> private Node tail;<a name="line.84"></a>
<span class="sourceLineNo">085</span><a name="line.85"></a>
<span class="sourceLineNo">086</span> private HashMap&lt;Node, Short&gt; nodeToIndex = new HashMap&lt;&gt;();<a name="line.86"></a>
<span class="sourceLineNo">087</span> private Node[] indexToNode;<a name="line.87"></a>
<span class="sourceLineNo">088</span> private int initSize = 0;<a name="line.88"></a>
<span class="sourceLineNo">089</span><a name="line.89"></a>
<span class="sourceLineNo">090</span> public BidirectionalLRUMap(int initialSize) {<a name="line.90"></a>
<span class="sourceLineNo">091</span> initSize = initialSize;<a name="line.91"></a>
<span class="sourceLineNo">092</span> indexToNode = new Node[initialSize];<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> private short put(byte[] array, int offset, int length, boolean copy) {<a name="line.95"></a>
<span class="sourceLineNo">096</span> if (copy) {<a name="line.96"></a>
<span class="sourceLineNo">097</span> // We copy the bytes we want, otherwise we might be holding references to<a name="line.97"></a>
<span class="sourceLineNo">098</span> // massive arrays in our dictionary (or those arrays might change)<a name="line.98"></a>
<span class="sourceLineNo">099</span> byte[] stored = new byte[length];<a name="line.99"></a>
<span class="sourceLineNo">100</span> Bytes.putBytes(stored, 0, array, offset, length);<a name="line.100"></a>
<span class="sourceLineNo">101</span> return putInternal(stored);<a name="line.101"></a>
<span class="sourceLineNo">102</span> } else {<a name="line.102"></a>
<span class="sourceLineNo">103</span> return putInternal(array);<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><a name="line.106"></a>
<span class="sourceLineNo">107</span> private short putInternal(byte[] stored) {<a name="line.107"></a>
<span class="sourceLineNo">108</span> if (currSize &lt; initSize) {<a name="line.108"></a>
<span class="sourceLineNo">109</span> // There is space to add without evicting.<a name="line.109"></a>
<span class="sourceLineNo">110</span> if (indexToNode[currSize] == null) {<a name="line.110"></a>
<span class="sourceLineNo">111</span> indexToNode[currSize] = new ByteArrayBackedNode();<a name="line.111"></a>
<span class="sourceLineNo">112</span> }<a name="line.112"></a>
<span class="sourceLineNo">113</span> indexToNode[currSize].setContents(stored, 0, stored.length);<a name="line.113"></a>
<span class="sourceLineNo">114</span> setHead(indexToNode[currSize]);<a name="line.114"></a>
<span class="sourceLineNo">115</span> short ret = (short) currSize++;<a name="line.115"></a>
<span class="sourceLineNo">116</span> nodeToIndex.put(indexToNode[ret], ret);<a name="line.116"></a>
<span class="sourceLineNo">117</span> return ret;<a name="line.117"></a>
<span class="sourceLineNo">118</span> } else {<a name="line.118"></a>
<span class="sourceLineNo">119</span> short s = nodeToIndex.remove(tail);<a name="line.119"></a>
<span class="sourceLineNo">120</span> tail.setContents(stored, 0, stored.length);<a name="line.120"></a>
<span class="sourceLineNo">121</span> // we need to rehash this.<a name="line.121"></a>
<span class="sourceLineNo">122</span> nodeToIndex.put(tail, s);<a name="line.122"></a>
<span class="sourceLineNo">123</span> moveToHead(tail);<a name="line.123"></a>
<span class="sourceLineNo">124</span> return s;<a name="line.124"></a>
<span class="sourceLineNo">125</span> }<a name="line.125"></a>
<span class="sourceLineNo">126</span> }<a name="line.126"></a>
<span class="sourceLineNo">127</span><a name="line.127"></a>
<span class="sourceLineNo">128</span> private short findIdx(byte[] array, int offset, int length) {<a name="line.128"></a>
<span class="sourceLineNo">129</span> Short s;<a name="line.129"></a>
<span class="sourceLineNo">130</span> final Node comparisonNode = new ByteArrayBackedNode();<a name="line.130"></a>
<span class="sourceLineNo">131</span> comparisonNode.setContents(array, offset, length);<a name="line.131"></a>
<span class="sourceLineNo">132</span> if ((s = nodeToIndex.get(comparisonNode)) != null) {<a name="line.132"></a>
<span class="sourceLineNo">133</span> moveToHead(indexToNode[s]);<a name="line.133"></a>
<span class="sourceLineNo">134</span> return s;<a name="line.134"></a>
<span class="sourceLineNo">135</span> } else {<a name="line.135"></a>
<span class="sourceLineNo">136</span> return -1;<a name="line.136"></a>
<span class="sourceLineNo">137</span> }<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> private short findIdx(ByteBuffer buf, int offset, int length) {<a name="line.140"></a>
<span class="sourceLineNo">141</span> Short s;<a name="line.141"></a>
<span class="sourceLineNo">142</span> final ByteBufferBackedNode comparisonNode = new ByteBufferBackedNode();<a name="line.142"></a>
<span class="sourceLineNo">143</span> comparisonNode.setContents(buf, offset, length);<a name="line.143"></a>
<span class="sourceLineNo">144</span> if ((s = nodeToIndex.get(comparisonNode)) != null) {<a name="line.144"></a>
<span class="sourceLineNo">145</span> moveToHead(indexToNode[s]);<a name="line.145"></a>
<span class="sourceLineNo">146</span> return s;<a name="line.146"></a>
<span class="sourceLineNo">147</span> } else {<a name="line.147"></a>
<span class="sourceLineNo">148</span> return -1;<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><a name="line.151"></a>
<span class="sourceLineNo">152</span> private byte[] get(short idx) {<a name="line.152"></a>
<span class="sourceLineNo">153</span> Preconditions.checkElementIndex(idx, currSize);<a name="line.153"></a>
<span class="sourceLineNo">154</span> moveToHead(indexToNode[idx]);<a name="line.154"></a>
<span class="sourceLineNo">155</span> return indexToNode[idx].getContents();<a name="line.155"></a>
<span class="sourceLineNo">156</span> }<a name="line.156"></a>
<span class="sourceLineNo">157</span><a name="line.157"></a>
<span class="sourceLineNo">158</span> private void moveToHead(Node n) {<a name="line.158"></a>
<span class="sourceLineNo">159</span> if (head == n) {<a name="line.159"></a>
<span class="sourceLineNo">160</span> // no-op -- it's already the head.<a name="line.160"></a>
<span class="sourceLineNo">161</span> return;<a name="line.161"></a>
<span class="sourceLineNo">162</span> }<a name="line.162"></a>
<span class="sourceLineNo">163</span> // At this point we definitely have prev, since it's not the head.<a name="line.163"></a>
<span class="sourceLineNo">164</span> assert n.prev != null;<a name="line.164"></a>
<span class="sourceLineNo">165</span> // Unlink prev.<a name="line.165"></a>
<span class="sourceLineNo">166</span> n.prev.next = n.next;<a name="line.166"></a>
<span class="sourceLineNo">167</span><a name="line.167"></a>
<span class="sourceLineNo">168</span> // Unlink next<a name="line.168"></a>
<span class="sourceLineNo">169</span> if (n.next != null) {<a name="line.169"></a>
<span class="sourceLineNo">170</span> n.next.prev = n.prev;<a name="line.170"></a>
<span class="sourceLineNo">171</span> } else {<a name="line.171"></a>
<span class="sourceLineNo">172</span> assert n == tail;<a name="line.172"></a>
<span class="sourceLineNo">173</span> tail = n.prev;<a name="line.173"></a>
<span class="sourceLineNo">174</span> }<a name="line.174"></a>
<span class="sourceLineNo">175</span> // Node is now removed from the list. Re-add it at the head.<a name="line.175"></a>
<span class="sourceLineNo">176</span> setHead(n);<a name="line.176"></a>
<span class="sourceLineNo">177</span> }<a name="line.177"></a>
<span class="sourceLineNo">178</span><a name="line.178"></a>
<span class="sourceLineNo">179</span> private void setHead(Node n) {<a name="line.179"></a>
<span class="sourceLineNo">180</span> // assume it's already unlinked from the list at this point.<a name="line.180"></a>
<span class="sourceLineNo">181</span> n.prev = null;<a name="line.181"></a>
<span class="sourceLineNo">182</span> n.next = head;<a name="line.182"></a>
<span class="sourceLineNo">183</span> if (head != null) {<a name="line.183"></a>
<span class="sourceLineNo">184</span> assert head.prev == null;<a name="line.184"></a>
<span class="sourceLineNo">185</span> head.prev = n;<a name="line.185"></a>
<span class="sourceLineNo">186</span> }<a name="line.186"></a>
<span class="sourceLineNo">187</span><a name="line.187"></a>
<span class="sourceLineNo">188</span> head = n;<a name="line.188"></a>
<span class="sourceLineNo">189</span><a name="line.189"></a>
<span class="sourceLineNo">190</span> // First entry<a name="line.190"></a>
<span class="sourceLineNo">191</span> if (tail == null) {<a name="line.191"></a>
<span class="sourceLineNo">192</span> tail = n;<a name="line.192"></a>
<span class="sourceLineNo">193</span> }<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> private void clear() {<a name="line.196"></a>
<span class="sourceLineNo">197</span> for (int i = 0; i &lt; currSize; i++) {<a name="line.197"></a>
<span class="sourceLineNo">198</span> indexToNode[i].next = null;<a name="line.198"></a>
<span class="sourceLineNo">199</span> indexToNode[i].prev = null;<a name="line.199"></a>
<span class="sourceLineNo">200</span> indexToNode[i].resetContents();<a name="line.200"></a>
<span class="sourceLineNo">201</span> }<a name="line.201"></a>
<span class="sourceLineNo">202</span> currSize = 0;<a name="line.202"></a>
<span class="sourceLineNo">203</span> nodeToIndex.clear();<a name="line.203"></a>
<span class="sourceLineNo">204</span> tail = null;<a name="line.204"></a>
<span class="sourceLineNo">205</span> head = null;<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> private static abstract class Node {<a name="line.208"></a>
<span class="sourceLineNo">209</span> int offset;<a name="line.209"></a>
<span class="sourceLineNo">210</span> int length;<a name="line.210"></a>
<span class="sourceLineNo">211</span> Node next; // link towards the tail<a name="line.211"></a>
<span class="sourceLineNo">212</span> Node prev; // link towards the head<a name="line.212"></a>
<span class="sourceLineNo">213</span><a name="line.213"></a>
<span class="sourceLineNo">214</span> abstract void setContents(byte[] container, int offset, int length);<a name="line.214"></a>
<span class="sourceLineNo">215</span><a name="line.215"></a>
<span class="sourceLineNo">216</span> abstract byte[] getContents();<a name="line.216"></a>
<span class="sourceLineNo">217</span><a name="line.217"></a>
<span class="sourceLineNo">218</span> abstract void resetContents();<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> // The actual contents of the LRUDictionary are of ByteArrayBackedNode type<a name="line.221"></a>
<span class="sourceLineNo">222</span> private static class ByteArrayBackedNode extends Node {<a name="line.222"></a>
<span class="sourceLineNo">223</span> private byte[] container;<a name="line.223"></a>
<span class="sourceLineNo">224</span><a name="line.224"></a>
<span class="sourceLineNo">225</span> @Override<a name="line.225"></a>
<span class="sourceLineNo">226</span> void setContents(byte[] container, int offset, int length) {<a name="line.226"></a>
<span class="sourceLineNo">227</span> this.container = container;<a name="line.227"></a>
<span class="sourceLineNo">228</span> this.offset = offset;<a name="line.228"></a>
<span class="sourceLineNo">229</span> this.length = length;<a name="line.229"></a>
<span class="sourceLineNo">230</span> }<a name="line.230"></a>
<span class="sourceLineNo">231</span><a name="line.231"></a>
<span class="sourceLineNo">232</span> @Override<a name="line.232"></a>
<span class="sourceLineNo">233</span> byte[] getContents() {<a name="line.233"></a>
<span class="sourceLineNo">234</span> return this.container;<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> @Override<a name="line.237"></a>
<span class="sourceLineNo">238</span> public int hashCode() {<a name="line.238"></a>
<span class="sourceLineNo">239</span> return Bytes.hashCode(container, offset, length);<a name="line.239"></a>
<span class="sourceLineNo">240</span> }<a name="line.240"></a>
<span class="sourceLineNo">241</span><a name="line.241"></a>
<span class="sourceLineNo">242</span> @Override<a name="line.242"></a>
<span class="sourceLineNo">243</span> void resetContents() {<a name="line.243"></a>
<span class="sourceLineNo">244</span> this.container = null;<a name="line.244"></a>
<span class="sourceLineNo">245</span> }<a name="line.245"></a>
<span class="sourceLineNo">246</span><a name="line.246"></a>
<span class="sourceLineNo">247</span> @Override<a name="line.247"></a>
<span class="sourceLineNo">248</span> public boolean equals(Object other) {<a name="line.248"></a>
<span class="sourceLineNo">249</span> if (!(other instanceof Node)) {<a name="line.249"></a>
<span class="sourceLineNo">250</span> return false;<a name="line.250"></a>
<span class="sourceLineNo">251</span> }<a name="line.251"></a>
<span class="sourceLineNo">252</span><a name="line.252"></a>
<span class="sourceLineNo">253</span> Node casted = (Node) other;<a name="line.253"></a>
<span class="sourceLineNo">254</span> return Bytes.equals(container, offset, length, casted.getContents(), casted.offset,<a name="line.254"></a>
<span class="sourceLineNo">255</span> casted.length);<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> // Currently only used for finding the index and hence this node acts<a name="line.259"></a>
<span class="sourceLineNo">260</span> // as a temporary holder to look up in the indexToNode map<a name="line.260"></a>
<span class="sourceLineNo">261</span> // which is formed by ByteArrayBackedNode<a name="line.261"></a>
<span class="sourceLineNo">262</span> private static class ByteBufferBackedNode extends Node {<a name="line.262"></a>
<span class="sourceLineNo">263</span> private ByteBuffer container;<a name="line.263"></a>
<span class="sourceLineNo">264</span><a name="line.264"></a>
<span class="sourceLineNo">265</span> public ByteBufferBackedNode() {<a name="line.265"></a>
<span class="sourceLineNo">266</span> }<a name="line.266"></a>
<span class="sourceLineNo">267</span><a name="line.267"></a>
<span class="sourceLineNo">268</span> @Override<a name="line.268"></a>
<span class="sourceLineNo">269</span> void setContents(byte[] container, int offset, int length) {<a name="line.269"></a>
<span class="sourceLineNo">270</span> this.container = ByteBuffer.wrap(container);<a name="line.270"></a>
<span class="sourceLineNo">271</span> this.offset = offset;<a name="line.271"></a>
<span class="sourceLineNo">272</span> this.length = length;<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> void setContents(ByteBuffer container, int offset, int length) {<a name="line.275"></a>
<span class="sourceLineNo">276</span> this.container = container;<a name="line.276"></a>
<span class="sourceLineNo">277</span> this.offset = offset;<a name="line.277"></a>
<span class="sourceLineNo">278</span> this.length = length;<a name="line.278"></a>
<span class="sourceLineNo">279</span> }<a name="line.279"></a>
<span class="sourceLineNo">280</span><a name="line.280"></a>
<span class="sourceLineNo">281</span> @Override<a name="line.281"></a>
<span class="sourceLineNo">282</span> void resetContents() {<a name="line.282"></a>
<span class="sourceLineNo">283</span> this.container = null;<a name="line.283"></a>
<span class="sourceLineNo">284</span> }<a name="line.284"></a>
<span class="sourceLineNo">285</span><a name="line.285"></a>
<span class="sourceLineNo">286</span> @Override<a name="line.286"></a>
<span class="sourceLineNo">287</span> byte[] getContents() {<a name="line.287"></a>
<span class="sourceLineNo">288</span> // This ideally should not be called<a name="line.288"></a>
<span class="sourceLineNo">289</span> byte[] copy = new byte[this.length];<a name="line.289"></a>
<span class="sourceLineNo">290</span> ByteBufferUtils.copyFromBufferToArray(copy, (ByteBuffer) this.container, this.offset, 0,<a name="line.290"></a>
<span class="sourceLineNo">291</span> length);<a name="line.291"></a>
<span class="sourceLineNo">292</span> return copy;<a name="line.292"></a>
<span class="sourceLineNo">293</span> }<a name="line.293"></a>
<span class="sourceLineNo">294</span><a name="line.294"></a>
<span class="sourceLineNo">295</span> @Override<a name="line.295"></a>
<span class="sourceLineNo">296</span> public int hashCode() {<a name="line.296"></a>
<span class="sourceLineNo">297</span> return ByteBufferUtils.hashCode(container, offset, length);<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> @Override<a name="line.300"></a>
<span class="sourceLineNo">301</span> public boolean equals(Object other) {<a name="line.301"></a>
<span class="sourceLineNo">302</span> if (!(other instanceof Node)) {<a name="line.302"></a>
<span class="sourceLineNo">303</span> return false;<a name="line.303"></a>
<span class="sourceLineNo">304</span> }<a name="line.304"></a>
<span class="sourceLineNo">305</span> // This was done to avoid findbugs comment<a name="line.305"></a>
<span class="sourceLineNo">306</span> Node casted = (Node) other;<a name="line.306"></a>
<span class="sourceLineNo">307</span> // The other side should be a byte array backed node only as we add only<a name="line.307"></a>
<span class="sourceLineNo">308</span> // ByteArrayBackedNode to the indexToNode map.<a name="line.308"></a>
<span class="sourceLineNo">309</span> return ByteBufferUtils.equals(this.container, offset, length, casted.getContents(),<a name="line.309"></a>
<span class="sourceLineNo">310</span> casted.offset, casted.length);<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> }<a name="line.313"></a>
<span class="sourceLineNo">314</span><a name="line.314"></a>
<span class="sourceLineNo">315</span> @Override<a name="line.315"></a>
<span class="sourceLineNo">316</span> public short findEntry(ByteBuffer data, int offset, int length) {<a name="line.316"></a>
<span class="sourceLineNo">317</span> short ret = backingStore.findIdx(data, offset, length);<a name="line.317"></a>
<span class="sourceLineNo">318</span> if (ret == NOT_IN_DICTIONARY) {<a name="line.318"></a>
<span class="sourceLineNo">319</span> byte[] copy = new byte[length];<a name="line.319"></a>
<span class="sourceLineNo">320</span> ByteBufferUtils.copyFromBufferToArray(copy, data, offset, 0, length);<a name="line.320"></a>
<span class="sourceLineNo">321</span> addEntryInternal(copy, 0, length, false);<a name="line.321"></a>
<span class="sourceLineNo">322</span> }<a name="line.322"></a>
<span class="sourceLineNo">323</span> return ret;<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>
</pre>
</div>
</body>
</html>